Searched refs:slabs_free (Results 1 – 2 of 2) sorted by relevance
/mm/ |
D | slab.c | 231 INIT_LIST_HEAD(&parent->slabs_free); in kmem_cache_node_init() 252 MAKE_LIST((cachep), (&(ptr)->slabs_free), slabs_free, nodeid); \ 2200 while (nr_freed < tofree && !list_empty(&n->slabs_free)) { in drain_freelist() 2203 p = n->slabs_free.prev; in drain_freelist() 2204 if (p == &n->slabs_free) { in drain_freelist() 2657 list_add_tail(&page->slab_list, &n->slabs_free); in cache_grow_end() 2805 list_add_tail(&page->slab_list, &n->slabs_free); in get_valid_first_slab() 2816 list_for_each_entry(page, &n->slabs_free, slab_list) { in get_valid_first_slab() 2835 page = list_first_entry_or_null(&n->slabs_free, struct page, in get_first_slab() 3354 list_add(&page->slab_list, &n->slabs_free); in free_block() [all …]
|
D | slab.h | 570 struct list_head slabs_free; member
|