• Home
  • Raw
  • Download

Lines Matching refs:avail

185 	unsigned int avail;  member
525 ac->avail = 0; in init_arraycache()
578 int nr = min3(from->avail, max, to->limit - to->avail); in transfer_objects()
583 memcpy(to->entry + to->avail, from->entry + from->avail -nr, in transfer_objects()
586 from->avail -= nr; in transfer_objects()
587 to->avail += nr; in transfer_objects()
690 if (ac->avail) { in __drain_alien_cache()
700 free_block(cachep, ac->entry, ac->avail, node, list); in __drain_alien_cache()
701 ac->avail = 0; in __drain_alien_cache()
719 if (ac->avail && spin_trylock_irq(&alc->lock)) { in reap_alien()
766 if (unlikely(ac->avail == ac->limit)) { in __cache_free_alien()
770 ac->entry[ac->avail++] = objp; in __cache_free_alien()
903 n->shared->avail, node, &list); in setup_kmem_cache_node()
904 n->shared->avail = 0; in setup_kmem_cache_node()
964 free_block(cachep, nc->entry, nc->avail, node, &list); in cpuup_canceled()
965 nc->avail = 0; in cpuup_canceled()
975 shared->avail, node, &list); in cpuup_canceled()
1772 cpu_cache_get(cachep)->avail = 0; in setup_cpu_cache()
2124 if (!ac || !ac->avail) in drain_array_locked()
2127 tofree = free_all ? ac->avail : (ac->limit + 4) / 5; in drain_array_locked()
2128 if (tofree > ac->avail) in drain_array_locked()
2129 tofree = (ac->avail + 1) / 2; in drain_array_locked()
2132 ac->avail -= tofree; in drain_array_locked()
2133 memmove(ac->entry, &(ac->entry[tofree]), sizeof(void *) * ac->avail); in drain_array_locked()
2148 free_block(cachep, ac->entry, ac->avail, node, &list); in do_drain()
2151 ac->avail = 0; in do_drain()
2899 ac->entry[ac->avail++] = slab_get_obj(cachep, page); in alloc_block()
2929 BUG_ON(ac->avail > 0 || !n); in cache_alloc_refill()
2931 if (!n->free_objects && (!shared || !shared->avail)) in cache_alloc_refill()
2956 n->free_objects -= ac->avail; in cache_alloc_refill()
2962 if (unlikely(!ac->avail)) { in cache_alloc_refill()
2978 if (!ac->avail && page) in cache_alloc_refill()
2982 if (!ac->avail) in cache_alloc_refill()
2987 return ac->entry[--ac->avail]; in cache_alloc_refill()
3045 if (likely(ac->avail)) { in ____cache_alloc()
3047 objp = ac->entry[--ac->avail]; in ____cache_alloc()
3068 kmemleak_erase(&ac->entry[ac->avail]); in ____cache_alloc()
3385 int max = shared_array->limit - shared_array->avail; in cache_flusharray()
3389 memcpy(&(shared_array->entry[shared_array->avail]), in cache_flusharray()
3391 shared_array->avail += batchcount; in cache_flusharray()
3413 ac->avail -= batchcount; in cache_flusharray()
3414 memmove(ac->entry, &(ac->entry[batchcount]), sizeof(void *)*ac->avail); in cache_flusharray()
3452 if (ac->avail < ac->limit) { in ___cache_free()
3468 ac->entry[ac->avail++] = objp; in ___cache_free()
3834 free_block(cachep, ac->entry, ac->avail, node, &list); in __do_tune_cpucache()
3952 if (!ac || !ac->avail) in drain_array()
4053 shared_avail += n->shared->avail; in get_slabinfo()