Lines Matching refs:slabs_free
230 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, struct slab, in get_first_slab()
3277 list_add(&slab->slab_list, &n->slabs_free); in free_block()
3288 while (n->free_objects > n->free_limit && !list_empty(&n->slabs_free)) { in free_block()
3291 slab = list_last_entry(&n->slabs_free, struct slab, slab_list); in free_block()
3330 list_for_each_entry(slab, &n->slabs_free, slab_list) { in cache_flusharray()