nc->avail); 
nc->avail, node); 
static int alloc_kmemlist(kmem_cache_t *cachep){	int node;	struct kmem_list3 *l3;	int err = 0;	for_each_online_node(node) {		struct array_cache *nc = NULL, *new;		struct array_cache **new_alien = NULL;#ifdef CONFIG_NUMA		if (!(new_alien = alloc_alien_cache(node, cachep->limit)))			goto fail;#endif		if (!(new = alloc_arraycache(node, (cachep->shared*				cachep->batchcount), 0xbaadf00d)))			goto fail;		if ((l3 = cachep->nodelists[node])) {			spin_lock_irq(&l3->list_lock);			if ((nc = cachep->nodelists[node]->shared))				free_block(cachep, nc->entry,							nc->avail);			l3->shared = new;			if (!cachep->nodelists[node]->alien) {				l3->alien = new_alien;				new_alien = NULL;			}			l3->free_limit = (1 + nr_cpus_node(node))*				cachep->batchcount + cachep->num;			spin_unlock_irq(&l3->list_lock);			kfree(nc);			free_alien_cache(new_alien);			continue;		}		if (!(l3 = kmalloc_node(sizeof(struct kmem_list3),						GFP_KERNEL, node)))			goto fail;		kmem_list3_init(l3);		l3->next_reap = jiffies + REAPTIMEOUT_LIST3 +			((unsigned long)cachep)%REAPTIMEOUT_LIST3;		l3->shared = new;		l3->alien = new_alien;		l3->free_limit = (1 + nr_cpus_node(node))*			cachep->batchcount + cachep->num;		cachep->nodelists[node] = l3;	}	return err;fail:	err = -ENOMEM;	return err;}
4520	/local/tlutelli/issta_data/temp/c/2005_temp/2005/4520/ff69416e6323fe9d38c42a06ebdefeb58bbe9336/slab.c/clean/mm/slab.c