free_block(cachep, ac->entry, batchcount); 
free_block(cachep, ac->entry, batchcount, node); 
static void cache_flusharray(kmem_cache_t *cachep, struct array_cache *ac){	int batchcount;	struct kmem_list3 *l3;	batchcount = ac->batchcount;#if DEBUG	BUG_ON(!batchcount || batchcount > ac->avail);#endif	check_irq_off();	l3 = cachep->nodelists[numa_node_id()];	spin_lock(&l3->list_lock);	if (l3->shared) {		struct array_cache *shared_array = l3->shared;		int max = shared_array->limit-shared_array->avail;		if (max) {			if (batchcount > max)				batchcount = max;			memcpy(&(shared_array->entry[shared_array->avail]),					ac->entry,					sizeof(void*)*batchcount);			shared_array->avail += batchcount;			goto free_done;		}	}	free_block(cachep, ac->entry, batchcount);free_done:#if STATS	{		int i = 0;		struct list_head *p;		p = l3->slabs_free.next;		while (p != &(l3->slabs_free)) {			struct slab *slabp;			slabp = list_entry(p, struct slab, list);			BUG_ON(slabp->inuse);			i++;			p = p->next;		}		STATS_SET_FREEABLE(cachep, i);	}#endif	spin_unlock(&l3->list_lock);	ac->avail -= batchcount;	memmove(ac->entry, &(ac->entry[batchcount]),			sizeof(void*)*ac->avail);}
4520	/local/tlutelli/issta_data/temp/c/2005_temp/2005/4520/ff69416e6323fe9d38c42a06ebdefeb58bbe9336/slab.c/clean/mm/slab.c