slabs_free        230 mm/slab.c      	INIT_LIST_HEAD(&parent->slabs_free);
slabs_free        251 mm/slab.c      	MAKE_LIST((cachep), (&(ptr)->slabs_free), slabs_free, nodeid);	\
slabs_free       2189 mm/slab.c      	while (nr_freed < tofree && !list_empty(&n->slabs_free)) {
slabs_free       2192 mm/slab.c      		p = n->slabs_free.prev;
slabs_free       2193 mm/slab.c      		if (p == &n->slabs_free) {
slabs_free       2663 mm/slab.c      		list_add_tail(&page->slab_list, &n->slabs_free);
slabs_free       2811 mm/slab.c      		list_add_tail(&page->slab_list, &n->slabs_free);
slabs_free       2822 mm/slab.c      	list_for_each_entry(page, &n->slabs_free, slab_list) {
slabs_free       2841 mm/slab.c      		page = list_first_entry_or_null(&n->slabs_free, struct page,
slabs_free       3350 mm/slab.c      			list_add(&page->slab_list, &n->slabs_free);
slabs_free       3361 mm/slab.c      	while (n->free_objects > n->free_limit && !list_empty(&n->slabs_free)) {
slabs_free       3364 mm/slab.c      		page = list_last_entry(&n->slabs_free, struct page, slab_list);
slabs_free       3403 mm/slab.c      		list_for_each_entry(page, &n->slabs_free, slab_list) {
slabs_free        604 mm/slab.h      	struct list_head slabs_free;