Home
last modified time | relevance | path

Searched refs:slabs_free (Results 1 – 2 of 2) sorted by relevance

/linux-6.3-rc2/mm/
A Dslab.c230 INIT_LIST_HEAD(&parent->slabs_free); in kmem_cache_node_init()
251 MAKE_LIST((cachep), (&(ptr)->slabs_free), slabs_free, nodeid); \
2187 while (nr_freed < tofree && !list_empty(&n->slabs_free)) { in drain_freelist()
2190 p = n->slabs_free.prev; in drain_freelist()
2191 if (p == &n->slabs_free) { in drain_freelist()
2635 list_add_tail(&slab->slab_list, &n->slabs_free); in cache_grow_end()
2783 list_add_tail(&slab->slab_list, &n->slabs_free); in get_valid_first_slab()
2794 list_for_each_entry(slab, &n->slabs_free, slab_list) { in get_valid_first_slab()
2813 slab = list_first_entry_or_null(&n->slabs_free, struct slab, in get_first_slab()
3297 list_add(&slab->slab_list, &n->slabs_free); in free_block()
[all …]
A Dslab.h789 struct list_head slabs_free; member

Completed in 12 milliseconds