Lines Matching refs:array
47 * Each cache has a short per-cpu head array, most allocs
48 * and frees go into that array, and if that array overflows, then 1/2
49 * of the entries in the array are given back into the global cache.
50 * The head array is strictly LIFO and should improve the cache hit rates.
584 * chicken and egg problem: delay the per-cpu array allocation
612 * We set lock class for alien array caches which are up during init.
673 return cachep->array[smp_processor_id()];
990 * Stuff objects into the remote nodes shared array first.
1048 * Make sure we are not freeing a object from another node to the array
1133 nc = cachep->array[cpu];
1134 cachep->array[cpu] = NULL;
1204 * array caches
1232 cachep->array[cpu] = nc;
1459 * Initially an __init data area is used for the head array and the
1461 * array at the end of the bootstrap.
1464 * An __init data area is used for the head array.
1480 cache_cache.array[smp_processor_id()] = &initarray_cache.cache;
1514 * Initialize the caches that provide memory for the array cache and the
1577 cache_cache.array[smp_processor_id()] = ptr;
1590 malloc_sizes[INDEX_AC].cs_cachep->array[smp_processor_id()] =
1990 kfree(cachep->array[i]);
2086 cachep->array[smp_processor_id()] = &initarray_generic.cache;
2099 cachep->array[smp_processor_id()] =
2638 * descriptors in kmem_cache_create, we search through the malloc_sizes array.
3023 /* See if we can refill from the shared array */
3191 * treat the array pointers as a reference to the object.
3965 new->cachep->array[smp_processor_id()] = new->new[smp_processor_id()];
4019 * The head array serves three purposes:
4023 * bufctl chains: array operations are cheaper.
4042 * cpus is necessary. This is provided by a shared array. The array
4067 * Drain an array if it contains any elements taking the l3 lock only if
4069 * if drain_array() is used on the shared array.