Lines Matching refs:list
86 * Each node has its own list of partial, free and full slabs.
178 * - reduce the number of linked list operations
213 int node, struct list_head *list);
214 static void slabs_destroy(struct kmem_cache *cachep, struct list_head *list);
219 void **list);
222 void **list);
556 LIST_HEAD(list);
562 free_block(cachep, &objp, 1, slab_node, &list);
565 slabs_destroy(cachep, &list);
681 struct list_head *list)
695 free_block(cachep, ac->entry, ac->avail, node, list);
715 LIST_HEAD(list);
717 __drain_alien_cache(cachep, ac, node, &list);
719 slabs_destroy(cachep, &list);
736 LIST_HEAD(list);
740 __drain_alien_cache(cachep, ac, i, &list);
742 slabs_destroy(cachep, &list);
753 LIST_HEAD(list);
763 __drain_alien_cache(cachep, ac, slab_node, &list);
767 slabs_destroy(cachep, &list);
771 free_block(cachep, &objp, 1, slab_node, &list);
773 slabs_destroy(cachep, &list);
857 list_for_each_entry(cachep, &slab_caches, list) {
875 LIST_HEAD(list);
898 n->shared->avail, node, &list);
914 slabs_destroy(cachep, &list);
942 list_for_each_entry(cachep, &slab_caches, list) {
946 LIST_HEAD(list);
959 free_block(cachep, nc->entry, nc->avail, node, &list);
970 shared->avail, node, &list);
986 slabs_destroy(cachep, &list);
993 list_for_each_entry(cachep, &slab_caches, list) {
1009 * alloc_arraycache's are going to use this list.
1021 list_for_each_entry(cachep, &slab_caches, list) {
1095 list_for_each_entry(cachep, &slab_caches, list) {
1149 static void __init init_list(struct kmem_cache *cachep, struct kmem_cache_node *list,
1157 memcpy(ptr, list, sizeof(struct kmem_cache_node));
1236 list_add(&kmem_cache->list, &slab_caches);
1268 list_for_each_entry(cachep, &slab_caches, list)
1622 static void slabs_destroy(struct kmem_cache *cachep, struct list_head *list)
1626 list_for_each_entry_safe(slab, n, list, slab_list) {
2109 int node, bool free_all, struct list_head *list)
2120 free_block(cachep, ac->entry, tofree, node, list);
2131 LIST_HEAD(list);
2137 free_block(cachep, ac->entry, ac->avail, node, &list);
2140 slabs_destroy(cachep, &list);
2147 LIST_HEAD(list);
2157 drain_array_locked(cachep, n->shared, node, true, &list);
2160 slabs_destroy(cachep, &list);
2165 * Remove slabs from the list of free slabs.
2356 unsigned int *list;
2362 * return true if the pre-computed list is available, false otherwise.
2372 state->list = cachep->random_seq;
2380 /* Get the next entry on the list and randomize it using a random shift */
2385 return state->list[state->pos++];
2397 * return true if the list was successfully shuffled, false otherwise.
2422 * On early boot, generate the list dynamically.
2423 * Later use a pre-computed list for speed.
2602 void *list = NULL;
2618 fixup_slab_list(cachep, n, slab, &list);
2624 fixup_objfreelist_debug(cachep, &list);
2703 void **list)
2706 void *next = *list;
2719 void **list)
2721 /* move slabp to correct slabp list: */
2731 *objp = *list;
2732 *list = objp;
2760 /* Move pfmemalloc slab to the end of list to speed up next search */
2810 void *list = NULL;
2825 fixup_slab_list(cachep, n, slab, &list);
2828 fixup_objfreelist_debug(cachep, &list);
2834 * Slab list should be fixed up by fixup_slab_list() for existing slab
2863 void *list = NULL;
2904 fixup_slab_list(cachep, n, slab, &list);
2911 fixup_objfreelist_debug(cachep, &list);
3123 void *list = NULL;
3146 fixup_slab_list(cachep, n, slab, &list);
3149 fixup_objfreelist_debug(cachep, &list);
3252 * @list: List of detached free slabs should be freed by caller
3255 int nr_objects, int node, struct list_head *list)
3281 * partial list on free - maximum time for the
3292 list_move(&slab->slab_list, list);
3303 LIST_HEAD(list);
3323 free_block(cachep, ac->entry, batchcount, node, &list);
3341 slabs_destroy(cachep, &list);
3644 if (!cachep->list.next) {
3690 LIST_HEAD(list);
3698 free_block(cachep, ac->entry, ac->avail, node, &list);
3700 slabs_destroy(cachep, &list);
3724 * - reduce the number of linked list operations on the slab and
3778 LIST_HEAD(list);
3792 drain_array_locked(cachep, ac, node, false, &list);
3795 slabs_destroy(cachep, &list);
3821 list_for_each_entry(searchp, &slab_caches, list) {
3970 list_for_each_entry(cachep, &slab_caches, list) {