Lines Matching refs:slabs_free
195 struct list_head slabs_free; member
360 slabs_free: LIST_HEAD_INIT(cache_cache.slabs_free),
792 INIT_LIST_HEAD(&cachep->slabs_free); in kmem_cache_create()
926 p = cachep->slabs_free.prev; in __kmem_cache_shrink_locked()
927 if (p == &cachep->slabs_free) in __kmem_cache_shrink_locked()
930 slabp = list_entry(cachep->slabs_free.prev, slab_t, list); in __kmem_cache_shrink_locked()
1188 list_add_tail(&slabp->list, &cachep->slabs_free); in kmem_cache_grow()
1291 struct list_head * slabs_free; \
1292 slabs_free = &(cachep)->slabs_free; \
1293 entry = slabs_free->next; \
1294 if (unlikely(entry == slabs_free)) \
1317 struct list_head * slabs_free; in kmem_cache_alloc_batch() local
1318 slabs_free = &(cachep)->slabs_free; in kmem_cache_alloc_batch()
1319 entry = slabs_free->next; in kmem_cache_alloc_batch()
1320 if (unlikely(entry == slabs_free)) in kmem_cache_alloc_batch()
1464 list_add(&slabp->list, &cachep->slabs_free); in kmem_cache_free_one()
1785 p = searchp->slabs_free.next; in kmem_cache_reap()
1786 while (p != &searchp->slabs_free) { in kmem_cache_reap()
1838 p = best_cachep->slabs_free.prev; in kmem_cache_reap()
1839 if (p == &best_cachep->slabs_free) in kmem_cache_reap()
1941 list_for_each(q,&cachep->slabs_free) { in s_show()