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);	\
2266 	while (nr_freed < tofree && !list_empty(&n->slabs_free)) {  in drain_freelist()
2269 		p = n->slabs_free.prev;  in drain_freelist()
2270 		if (p == &n->slabs_free) {  in drain_freelist()
2735 		list_add_tail(&page->lru, &(n->slabs_free));  in cache_grow_end()
2885 		list_add_tail(&page->lru, &n->slabs_free);  in get_valid_first_slab()
2896 	list_for_each_entry(page, &n->slabs_free, lru) {  in get_valid_first_slab()
2914 		page = list_first_entry_or_null(&n->slabs_free, struct page,  in get_first_slab()
3423 			list_add(&page->lru, &n->slabs_free);  in free_block()
3434 	while (n->free_objects > n->free_limit && !list_empty(&n->slabs_free)) {  in free_block()
3437 		page = list_last_entry(&n->slabs_free, struct page, lru);  in free_block()
3476 		list_for_each_entry(page, &n->slabs_free, lru) {  in cache_flusharray()