Home
last modified time | relevance | path

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

/mm/
Dslab.c229 INIT_LIST_HEAD(&parent->slabs_free); in kmem_cache_node_init()
249 MAKE_LIST((cachep), (&(ptr)->slabs_free), slabs_free, nodeid); \
1395 list_for_each_entry(page, &n->slabs_free, lru) in slab_out_of_memory()
2310 while (nr_freed < tofree && !list_empty(&n->slabs_free)) { in drain_freelist()
2313 p = n->slabs_free.prev; in drain_freelist()
2314 if (p == &n->slabs_free) { in drain_freelist()
2757 list_add_tail(&page->lru, &(n->slabs_free)); in cache_grow_end()
2907 list_add_tail(&page->lru, &n->slabs_free); in get_valid_first_slab()
2916 list_for_each_entry(page, &n->slabs_free, lru) { in get_valid_first_slab()
2932 page = list_first_entry_or_null(&n->slabs_free, in get_first_slab()
[all …]
Dslab.h434 struct list_head slabs_free; member