Home
last modified time | relevance | path

Searched refs:slabs_free (Results 1 - 4 of 4) sorted by relevance

/kernel/linux/linux-5.10/mm/
H A Dslab.c230 INIT_LIST_HEAD(&parent->slabs_free); in kmem_cache_node_init()
251 MAKE_LIST((cachep), (&(ptr)->slabs_free), slabs_free, nodeid); \
2198 while (nr_freed < tofree && !list_empty(&n->slabs_free)) { in drain_freelist()
2201 p = n->slabs_free.prev; in drain_freelist()
2202 if (p == &n->slabs_free) { in drain_freelist()
2655 list_add_tail(&page->slab_list, &n->slabs_free); in cache_grow_end()
2803 list_add_tail(&page->slab_list, &n->slabs_free); in get_valid_first_slab()
2814 list_for_each_entry(page, &n->slabs_free, slab_list) { in get_valid_first_slab()
2833 page = list_first_entry_or_null(&n->slabs_free, struc in get_first_slab()
[all...]
H A Dslab.h551 struct list_head slabs_free; member
/kernel/linux/linux-6.6/mm/
H A Dslab.c230 INIT_LIST_HEAD(&parent->slabs_free); in kmem_cache_node_init()
251 MAKE_LIST((cachep), (&(ptr)->slabs_free), slabs_free, nodeid); \
2178 while (nr_freed < tofree && !list_empty(&n->slabs_free)) { in drain_freelist()
2181 p = n->slabs_free.prev; in drain_freelist()
2182 if (p == &n->slabs_free) { in drain_freelist()
2615 list_add_tail(&slab->slab_list, &n->slabs_free); in cache_grow_end()
2763 list_add_tail(&slab->slab_list, &n->slabs_free); in get_valid_first_slab()
2774 list_for_each_entry(slab, &n->slabs_free, slab_list) { in get_valid_first_slab()
2793 slab = list_first_entry_or_null(&n->slabs_free, struc in get_first_slab()
[all...]
H A Dslab.h781 struct list_head slabs_free; member

Completed in 11 milliseconds