Lines Matching refs:list
86 * Each node has its own list of partial, free and full slabs.
177 * - reduce the number of linked list operations
212 int node, struct list_head *list);
213 static void slabs_destroy(struct kmem_cache *cachep, struct list_head *list);
218 void **list);
221 void **list);
556 LIST_HEAD(list);
562 free_block(cachep, &objp, 1, page_node, &list);
565 slabs_destroy(cachep, &list);
696 struct list_head *list)
710 free_block(cachep, ac->entry, ac->avail, node, list);
730 LIST_HEAD(list);
732 __drain_alien_cache(cachep, ac, node, &list);
734 slabs_destroy(cachep, &list);
751 LIST_HEAD(list);
755 __drain_alien_cache(cachep, ac, i, &list);
757 slabs_destroy(cachep, &list);
768 LIST_HEAD(list);
778 __drain_alien_cache(cachep, ac, page_node, &list);
782 slabs_destroy(cachep, &list);
786 free_block(cachep, &objp, 1, page_node, &list);
788 slabs_destroy(cachep, &list);
872 list_for_each_entry(cachep, &slab_caches, list) {
890 LIST_HEAD(list);
913 n->shared->avail, node, &list);
929 slabs_destroy(cachep, &list);
957 list_for_each_entry(cachep, &slab_caches, list) {
961 LIST_HEAD(list);
974 free_block(cachep, nc->entry, nc->avail, node, &list);
985 shared->avail, node, &list);
1001 slabs_destroy(cachep, &list);
1008 list_for_each_entry(cachep, &slab_caches, list) {
1024 * alloc_arraycache's are going to use this list.
1036 list_for_each_entry(cachep, &slab_caches, list) {
1110 list_for_each_entry(cachep, &slab_caches, list) {
1164 static void __init init_list(struct kmem_cache *cachep, struct kmem_cache_node *list,
1172 memcpy(ptr, list, sizeof(struct kmem_cache_node));
1251 list_add(&kmem_cache->list, &slab_caches);
1289 list_for_each_entry(cachep, &slab_caches, list)
1639 static void slabs_destroy(struct kmem_cache *cachep, struct list_head *list)
1643 list_for_each_entry_safe(page, n, list, slab_list) {
2129 int node, bool free_all, struct list_head *list)
2140 free_block(cachep, ac->entry, tofree, node, list);
2151 LIST_HEAD(list);
2157 free_block(cachep, ac->entry, ac->avail, node, &list);
2160 slabs_destroy(cachep, &list);
2167 LIST_HEAD(list);
2177 drain_array_locked(cachep, n->shared, node, true, &list);
2180 slabs_destroy(cachep, &list);
2185 * Remove slabs from the list of free slabs.
2375 unsigned int *list;
2383 * return true if the pre-computed list is available, false otherwize.
2395 /* Use a random state if the pre-computed list is not available */
2400 state->list = cachep->random_seq;
2408 /* Get the next entry on the list and randomize it using a random shift */
2413 return state->list[state->pos++];
2425 * return true if the list was successfully shuffled, false otherwise.
2450 * On early boot, generate the list dynamically.
2451 * Later use a pre-computed list for speed.
2642 void *list = NULL;
2658 fixup_slab_list(cachep, n, page, &list);
2664 fixup_objfreelist_debug(cachep, &list);
2743 void **list)
2746 void *next = *list;
2759 void **list)
2761 /* move slabp to correct slabp list: */
2771 *objp = *list;
2772 *list = objp;
2800 /* Move pfmemalloc slab to the end of list to speed up next search */
2850 void *list = NULL;
2865 fixup_slab_list(cachep, n, page, &list);
2868 fixup_objfreelist_debug(cachep, &list);
2874 * Slab list should be fixed up by fixup_slab_list() for existing slab
2903 void *list = NULL;
2944 fixup_slab_list(cachep, n, page, &list);
2951 fixup_objfreelist_debug(cachep, &list);
3168 void *list = NULL;
3191 fixup_slab_list(cachep, n, page, &list);
3194 fixup_objfreelist_debug(cachep, &list);
3319 * @list: List of detached free slabs should be freed by caller
3322 int nr_objects, int node, struct list_head *list)
3348 * partial list on free - maximum time for the
3359 list_move(&page->slab_list, list);
3370 LIST_HEAD(list);
3390 free_block(cachep, ac->entry, batchcount, node, &list);
3408 slabs_destroy(cachep, &list);
3781 if (!cachep->list.next) {
3827 LIST_HEAD(list);
3835 free_block(cachep, ac->entry, ac->avail, node, &list);
3837 slabs_destroy(cachep, &list);
3863 * - reduce the number of linked list operations on the slab and
3918 LIST_HEAD(list);
3932 drain_array_locked(cachep, ac, node, false, &list);
3935 slabs_destroy(cachep, &list);
3961 list_for_each_entry(searchp, &slab_caches, list) {
4110 list_for_each_entry(cachep, &slab_caches, list) {