searchp 3981 mm/slab.c struct kmem_cache *searchp; searchp 3990 mm/slab.c list_for_each_entry(searchp, &slab_caches, list) { searchp 3998 mm/slab.c n = get_node(searchp, node); searchp 4000 mm/slab.c reap_alien(searchp, n); searchp 4002 mm/slab.c drain_array(searchp, n, cpu_cache_get(searchp), node); searchp 4013 mm/slab.c drain_array(searchp, n, n->shared, node); searchp 4020 mm/slab.c freed = drain_freelist(searchp, n, (n->free_limit + searchp 4021 mm/slab.c 5 * searchp->num - 1) / (5 * searchp->num)); searchp 4022 mm/slab.c STATS_ADD_REAPED(searchp, freed);