blob: 052e7d64537eb61e71c780ff4a6ca653dff0750e [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * linux/mm/slab.c
3 * Written by Mark Hemment, 1996/97.
4 * (markhe@nextd.demon.co.uk)
5 *
6 * kmem_cache_destroy() + some cleanup - 1999 Andrea Arcangeli
7 *
8 * Major cleanup, different bufctl logic, per-cpu arrays
9 * (c) 2000 Manfred Spraul
10 *
11 * Cleanup, make the head arrays unconditional, preparation for NUMA
12 * (c) 2002 Manfred Spraul
13 *
14 * An implementation of the Slab Allocator as described in outline in;
15 * UNIX Internals: The New Frontiers by Uresh Vahalia
16 * Pub: Prentice Hall ISBN 0-13-101908-2
17 * or with a little more detail in;
18 * The Slab Allocator: An Object-Caching Kernel Memory Allocator
19 * Jeff Bonwick (Sun Microsystems).
20 * Presented at: USENIX Summer 1994 Technical Conference
21 *
22 * The memory is organized in caches, one cache for each object type.
23 * (e.g. inode_cache, dentry_cache, buffer_head, vm_area_struct)
24 * Each cache consists out of many slabs (they are small (usually one
25 * page long) and always contiguous), and each slab contains multiple
26 * initialized objects.
27 *
28 * This means, that your constructor is used only for newly allocated
Simon Arlott183ff222007-10-20 01:27:18 +020029 * slabs and you must pass objects with the same initializations to
Linus Torvalds1da177e2005-04-16 15:20:36 -070030 * kmem_cache_free.
31 *
32 * Each cache can only support one memory type (GFP_DMA, GFP_HIGHMEM,
33 * normal). If you need a special memory type, then must create a new
34 * cache for that memory type.
35 *
36 * In order to reduce fragmentation, the slabs are sorted in 3 groups:
37 * full slabs with 0 free objects
38 * partial slabs
39 * empty slabs with no allocated objects
40 *
41 * If partial slabs exist, then new allocations come from these slabs,
42 * otherwise from empty slabs or new slabs are allocated.
43 *
44 * kmem_cache_destroy() CAN CRASH if you try to allocate from the cache
45 * during kmem_cache_destroy(). The caller must prevent concurrent allocs.
46 *
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.
51 * On SMP, it additionally reduces the spinlock operations.
52 *
Andrew Mortona737b3e2006-03-22 00:08:11 -080053 * The c_cpuarray may not be read with enabled local interrupts -
Linus Torvalds1da177e2005-04-16 15:20:36 -070054 * it's changed with a smp_call_function().
55 *
56 * SMP synchronization:
57 * constructors and destructors are called without any locking.
Pekka Enberg343e0d72006-02-01 03:05:50 -080058 * Several members in struct kmem_cache and struct slab never change, they
Linus Torvalds1da177e2005-04-16 15:20:36 -070059 * are accessed without any locking.
60 * The per-cpu arrays are never accessed from the wrong cpu, no locking,
61 * and local interrupts are disabled so slab code is preempt-safe.
62 * The non-constant members are protected with a per-cache irq spinlock.
63 *
64 * Many thanks to Mark Hemment, who wrote another per-cpu slab patch
65 * in 2000 - many ideas in the current implementation are derived from
66 * his patch.
67 *
68 * Further notes from the original documentation:
69 *
70 * 11 April '97. Started multi-threading - markhe
Ingo Molnarfc0abb12006-01-18 17:42:33 -080071 * The global cache-chain is protected by the mutex 'cache_chain_mutex'.
Linus Torvalds1da177e2005-04-16 15:20:36 -070072 * The sem is only needed when accessing/extending the cache-chain, which
73 * can never happen inside an interrupt (kmem_cache_create(),
74 * kmem_cache_shrink() and kmem_cache_reap()).
75 *
76 * At present, each engine can be growing a cache. This should be blocked.
77 *
Christoph Lametere498be72005-09-09 13:03:32 -070078 * 15 March 2005. NUMA slab allocator.
79 * Shai Fultheim <shai@scalex86.org>.
80 * Shobhit Dayal <shobhit@calsoftinc.com>
81 * Alok N Kataria <alokk@calsoftinc.com>
82 * Christoph Lameter <christoph@lameter.com>
83 *
84 * Modified the slab allocator to be node aware on NUMA systems.
85 * Each node has its own list of partial, free and full slabs.
86 * All object allocations for a node occur from node specific slab lists.
Linus Torvalds1da177e2005-04-16 15:20:36 -070087 */
88
Linus Torvalds1da177e2005-04-16 15:20:36 -070089#include <linux/slab.h>
90#include <linux/mm.h>
Randy Dunlapc9cf5522006-06-27 02:53:52 -070091#include <linux/poison.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070092#include <linux/swap.h>
93#include <linux/cache.h>
94#include <linux/interrupt.h>
95#include <linux/init.h>
96#include <linux/compiler.h>
Paul Jackson101a5002006-03-24 03:16:07 -080097#include <linux/cpuset.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070098#include <linux/seq_file.h>
99#include <linux/notifier.h>
100#include <linux/kallsyms.h>
101#include <linux/cpu.h>
102#include <linux/sysctl.h>
103#include <linux/module.h>
104#include <linux/rcupdate.h>
Paulo Marques543537b2005-06-23 00:09:02 -0700105#include <linux/string.h>
Andrew Morton138ae662006-12-06 20:36:41 -0800106#include <linux/uaccess.h>
Christoph Lametere498be72005-09-09 13:03:32 -0700107#include <linux/nodemask.h>
Christoph Lameterdc85da12006-01-18 17:42:36 -0800108#include <linux/mempolicy.h>
Ingo Molnarfc0abb12006-01-18 17:42:33 -0800109#include <linux/mutex.h>
Akinobu Mita8a8b6502006-12-08 02:39:44 -0800110#include <linux/fault-inject.h>
Ingo Molnare7eebaf2006-06-27 02:54:55 -0700111#include <linux/rtmutex.h>
Eric Dumazet6a2d7a92006-12-13 00:34:27 -0800112#include <linux/reciprocal_div.h>
Thomas Gleixner3ac7fe52008-04-30 00:55:01 -0700113#include <linux/debugobjects.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -0700114
Linus Torvalds1da177e2005-04-16 15:20:36 -0700115#include <asm/cacheflush.h>
116#include <asm/tlbflush.h>
117#include <asm/page.h>
118
119/*
Christoph Lameter50953fe2007-05-06 14:50:16 -0700120 * DEBUG - 1 for kmem_cache_create() to honour; SLAB_RED_ZONE & SLAB_POISON.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121 * 0 for faster, smaller code (especially in the critical paths).
122 *
123 * STATS - 1 to collect stats for /proc/slabinfo.
124 * 0 for faster, smaller code (especially in the critical paths).
125 *
126 * FORCED_DEBUG - 1 enables SLAB_RED_ZONE and SLAB_POISON (if possible)
127 */
128
129#ifdef CONFIG_DEBUG_SLAB
130#define DEBUG 1
131#define STATS 1
132#define FORCED_DEBUG 1
133#else
134#define DEBUG 0
135#define STATS 0
136#define FORCED_DEBUG 0
137#endif
138
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139/* Shouldn't this be in a header file somewhere? */
140#define BYTES_PER_WORD sizeof(void *)
David Woodhouse87a927c2007-07-04 21:26:44 -0400141#define REDZONE_ALIGN max(BYTES_PER_WORD, __alignof__(unsigned long long))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142
Linus Torvalds1da177e2005-04-16 15:20:36 -0700143#ifndef ARCH_KMALLOC_MINALIGN
144/*
145 * Enforce a minimum alignment for the kmalloc caches.
146 * Usually, the kmalloc caches are cache_line_size() aligned, except when
147 * DEBUG and FORCED_DEBUG are enabled, then they are BYTES_PER_WORD aligned.
148 * Some archs want to perform DMA into kmalloc caches and need a guaranteed
David Woodhouseb46b8f12007-05-08 00:22:59 -0700149 * alignment larger than the alignment of a 64-bit integer.
150 * ARCH_KMALLOC_MINALIGN allows that.
151 * Note that increasing this value may disable some debug features.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700152 */
David Woodhouseb46b8f12007-05-08 00:22:59 -0700153#define ARCH_KMALLOC_MINALIGN __alignof__(unsigned long long)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700154#endif
155
156#ifndef ARCH_SLAB_MINALIGN
157/*
158 * Enforce a minimum alignment for all caches.
159 * Intended for archs that get misalignment faults even for BYTES_PER_WORD
160 * aligned buffers. Includes ARCH_KMALLOC_MINALIGN.
161 * If possible: Do not enable this flag for CONFIG_DEBUG_SLAB, it disables
162 * some debug features.
163 */
164#define ARCH_SLAB_MINALIGN 0
165#endif
166
167#ifndef ARCH_KMALLOC_FLAGS
168#define ARCH_KMALLOC_FLAGS SLAB_HWCACHE_ALIGN
169#endif
170
171/* Legal flag mask for kmem_cache_create(). */
172#if DEBUG
Christoph Lameter50953fe2007-05-06 14:50:16 -0700173# define CREATE_MASK (SLAB_RED_ZONE | \
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174 SLAB_POISON | SLAB_HWCACHE_ALIGN | \
Christoph Lameterac2b8982006-03-22 00:08:15 -0800175 SLAB_CACHE_DMA | \
Christoph Lameter5af60832007-05-06 14:49:56 -0700176 SLAB_STORE_USER | \
Linus Torvalds1da177e2005-04-16 15:20:36 -0700177 SLAB_RECLAIM_ACCOUNT | SLAB_PANIC | \
Thomas Gleixner3ac7fe52008-04-30 00:55:01 -0700178 SLAB_DESTROY_BY_RCU | SLAB_MEM_SPREAD | \
179 SLAB_DEBUG_OBJECTS)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700180#else
Christoph Lameterac2b8982006-03-22 00:08:15 -0800181# define CREATE_MASK (SLAB_HWCACHE_ALIGN | \
Christoph Lameter5af60832007-05-06 14:49:56 -0700182 SLAB_CACHE_DMA | \
Linus Torvalds1da177e2005-04-16 15:20:36 -0700183 SLAB_RECLAIM_ACCOUNT | SLAB_PANIC | \
Thomas Gleixner3ac7fe52008-04-30 00:55:01 -0700184 SLAB_DESTROY_BY_RCU | SLAB_MEM_SPREAD | \
185 SLAB_DEBUG_OBJECTS)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700186#endif
187
188/*
189 * kmem_bufctl_t:
190 *
191 * Bufctl's are used for linking objs within a slab
192 * linked offsets.
193 *
194 * This implementation relies on "struct page" for locating the cache &
195 * slab an object belongs to.
196 * This allows the bufctl structure to be small (one int), but limits
197 * the number of objects a slab (not a cache) can contain when off-slab
198 * bufctls are used. The limit is the size of the largest general cache
199 * that does not use off-slab slabs.
200 * For 32bit archs with 4 kB pages, is this 56.
201 * This is not serious, as it is only for large objects, when it is unwise
202 * to have too many per slab.
203 * Note: This limit can be raised by introducing a general cache whose size
204 * is less than 512 (PAGE_SIZE<<3), but greater than 256.
205 */
206
Kyle Moffettfa5b08d2005-09-03 15:55:03 -0700207typedef unsigned int kmem_bufctl_t;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700208#define BUFCTL_END (((kmem_bufctl_t)(~0U))-0)
209#define BUFCTL_FREE (((kmem_bufctl_t)(~0U))-1)
Al Viro871751e2006-03-25 03:06:39 -0800210#define BUFCTL_ACTIVE (((kmem_bufctl_t)(~0U))-2)
211#define SLAB_LIMIT (((kmem_bufctl_t)(~0U))-3)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700212
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213/*
214 * struct slab
215 *
216 * Manages the objs in a slab. Placed either at the beginning of mem allocated
217 * for a slab, or allocated from an general cache.
218 * Slabs are chained into three list: fully used, partial, fully free slabs.
219 */
220struct slab {
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800221 struct list_head list;
222 unsigned long colouroff;
223 void *s_mem; /* including colour offset */
224 unsigned int inuse; /* num of objs active in slab */
225 kmem_bufctl_t free;
226 unsigned short nodeid;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700227};
228
229/*
230 * struct slab_rcu
231 *
232 * slab_destroy on a SLAB_DESTROY_BY_RCU cache uses this structure to
233 * arrange for kmem_freepages to be called via RCU. This is useful if
234 * we need to approach a kernel structure obliquely, from its address
235 * obtained without the usual locking. We can lock the structure to
236 * stabilize it and check it's still at the given address, only if we
237 * can be sure that the memory has not been meanwhile reused for some
238 * other kind of object (which our subsystem's lock might corrupt).
239 *
240 * rcu_read_lock before reading the address, then rcu_read_unlock after
241 * taking the spinlock within the structure expected at that address.
242 *
243 * We assume struct slab_rcu can overlay struct slab when destroying.
244 */
245struct slab_rcu {
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800246 struct rcu_head head;
Pekka Enberg343e0d72006-02-01 03:05:50 -0800247 struct kmem_cache *cachep;
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800248 void *addr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700249};
250
251/*
252 * struct array_cache
253 *
Linus Torvalds1da177e2005-04-16 15:20:36 -0700254 * Purpose:
255 * - LIFO ordering, to hand out cache-warm objects from _alloc
256 * - reduce the number of linked list operations
257 * - reduce spinlock operations
258 *
259 * The limit is stored in the per-cpu structure to reduce the data cache
260 * footprint.
261 *
262 */
263struct array_cache {
264 unsigned int avail;
265 unsigned int limit;
266 unsigned int batchcount;
267 unsigned int touched;
Christoph Lametere498be72005-09-09 13:03:32 -0700268 spinlock_t lock;
Robert P. J. Daybda5b652007-10-16 23:30:05 -0700269 void *entry[]; /*
Andrew Mortona737b3e2006-03-22 00:08:11 -0800270 * Must have this definition in here for the proper
271 * alignment of array_cache. Also simplifies accessing
272 * the entries.
Andrew Mortona737b3e2006-03-22 00:08:11 -0800273 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274};
275
Andrew Mortona737b3e2006-03-22 00:08:11 -0800276/*
277 * bootstrap: The caches do not work without cpuarrays anymore, but the
278 * cpuarrays are allocated from the generic caches...
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279 */
280#define BOOT_CPUCACHE_ENTRIES 1
281struct arraycache_init {
282 struct array_cache cache;
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800283 void *entries[BOOT_CPUCACHE_ENTRIES];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700284};
285
286/*
Christoph Lametere498be72005-09-09 13:03:32 -0700287 * The slab lists for all objects.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700288 */
289struct kmem_list3 {
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800290 struct list_head slabs_partial; /* partial list first, better asm code */
291 struct list_head slabs_full;
292 struct list_head slabs_free;
293 unsigned long free_objects;
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800294 unsigned int free_limit;
Ravikiran G Thirumalai2e1217c2006-02-04 23:27:56 -0800295 unsigned int colour_next; /* Per-node cache coloring */
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800296 spinlock_t list_lock;
297 struct array_cache *shared; /* shared per node */
298 struct array_cache **alien; /* on other nodes */
Christoph Lameter35386e32006-03-22 00:09:05 -0800299 unsigned long next_reap; /* updated without locking */
300 int free_touched; /* updated without locking */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700301};
302
Christoph Lametere498be72005-09-09 13:03:32 -0700303/*
304 * Need this for bootstrapping a per node allocator.
305 */
Pekka Enberg556a1692008-01-25 08:20:51 +0200306#define NUM_INIT_LISTS (3 * MAX_NUMNODES)
Christoph Lametere498be72005-09-09 13:03:32 -0700307struct kmem_list3 __initdata initkmem_list3[NUM_INIT_LISTS];
308#define CACHE_CACHE 0
Pekka Enberg556a1692008-01-25 08:20:51 +0200309#define SIZE_AC MAX_NUMNODES
310#define SIZE_L3 (2 * MAX_NUMNODES)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700311
Christoph Lametered11d9e2006-06-30 01:55:45 -0700312static int drain_freelist(struct kmem_cache *cache,
313 struct kmem_list3 *l3, int tofree);
314static void free_block(struct kmem_cache *cachep, void **objpp, int len,
315 int node);
Christoph Lameter2ed3a4e2006-09-25 23:31:38 -0700316static int enable_cpucache(struct kmem_cache *cachep);
David Howells65f27f32006-11-22 14:55:48 +0000317static void cache_reap(struct work_struct *unused);
Christoph Lametered11d9e2006-06-30 01:55:45 -0700318
Christoph Lametere498be72005-09-09 13:03:32 -0700319/*
Andrew Mortona737b3e2006-03-22 00:08:11 -0800320 * This function must be completely optimized away if a constant is passed to
321 * it. Mostly the same as what is in linux/slab.h except it returns an index.
Christoph Lametere498be72005-09-09 13:03:32 -0700322 */
Ivan Kokshaysky7243cc02005-09-22 21:43:58 -0700323static __always_inline int index_of(const size_t size)
Christoph Lametere498be72005-09-09 13:03:32 -0700324{
Steven Rostedt5ec8a842006-02-01 03:05:44 -0800325 extern void __bad_size(void);
326
Christoph Lametere498be72005-09-09 13:03:32 -0700327 if (__builtin_constant_p(size)) {
328 int i = 0;
329
330#define CACHE(x) \
331 if (size <=x) \
332 return i; \
333 else \
334 i++;
Joe Perches1c61fc42008-03-05 13:58:17 -0800335#include <linux/kmalloc_sizes.h>
Christoph Lametere498be72005-09-09 13:03:32 -0700336#undef CACHE
Steven Rostedt5ec8a842006-02-01 03:05:44 -0800337 __bad_size();
Ivan Kokshaysky7243cc02005-09-22 21:43:58 -0700338 } else
Steven Rostedt5ec8a842006-02-01 03:05:44 -0800339 __bad_size();
Christoph Lametere498be72005-09-09 13:03:32 -0700340 return 0;
341}
342
Ingo Molnare0a42722006-06-23 02:03:46 -0700343static int slab_early_init = 1;
344
Christoph Lametere498be72005-09-09 13:03:32 -0700345#define INDEX_AC index_of(sizeof(struct arraycache_init))
346#define INDEX_L3 index_of(sizeof(struct kmem_list3))
347
Pekka Enberg5295a742006-02-01 03:05:48 -0800348static void kmem_list3_init(struct kmem_list3 *parent)
Christoph Lametere498be72005-09-09 13:03:32 -0700349{
350 INIT_LIST_HEAD(&parent->slabs_full);
351 INIT_LIST_HEAD(&parent->slabs_partial);
352 INIT_LIST_HEAD(&parent->slabs_free);
353 parent->shared = NULL;
354 parent->alien = NULL;
Ravikiran G Thirumalai2e1217c2006-02-04 23:27:56 -0800355 parent->colour_next = 0;
Christoph Lametere498be72005-09-09 13:03:32 -0700356 spin_lock_init(&parent->list_lock);
357 parent->free_objects = 0;
358 parent->free_touched = 0;
359}
360
Andrew Mortona737b3e2006-03-22 00:08:11 -0800361#define MAKE_LIST(cachep, listp, slab, nodeid) \
362 do { \
363 INIT_LIST_HEAD(listp); \
364 list_splice(&(cachep->nodelists[nodeid]->slab), listp); \
Christoph Lametere498be72005-09-09 13:03:32 -0700365 } while (0)
366
Andrew Mortona737b3e2006-03-22 00:08:11 -0800367#define MAKE_ALL_LISTS(cachep, ptr, nodeid) \
368 do { \
Christoph Lametere498be72005-09-09 13:03:32 -0700369 MAKE_LIST((cachep), (&(ptr)->slabs_full), slabs_full, nodeid); \
370 MAKE_LIST((cachep), (&(ptr)->slabs_partial), slabs_partial, nodeid); \
371 MAKE_LIST((cachep), (&(ptr)->slabs_free), slabs_free, nodeid); \
372 } while (0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700373
374/*
Pekka Enberg343e0d72006-02-01 03:05:50 -0800375 * struct kmem_cache
Linus Torvalds1da177e2005-04-16 15:20:36 -0700376 *
377 * manages a cache.
378 */
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800379
Pekka J Enberg2109a2d2005-11-07 00:58:01 -0800380struct kmem_cache {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700381/* 1) per-cpu data, touched during every alloc/free */
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800382 struct array_cache *array[NR_CPUS];
Ravikiran G Thirumalaib5d8ca72006-03-22 00:08:12 -0800383/* 2) Cache tunables. Protected by cache_chain_mutex */
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800384 unsigned int batchcount;
385 unsigned int limit;
386 unsigned int shared;
Ravikiran G Thirumalaib5d8ca72006-03-22 00:08:12 -0800387
Manfred Spraul3dafccf2006-02-01 03:05:42 -0800388 unsigned int buffer_size;
Eric Dumazet6a2d7a92006-12-13 00:34:27 -0800389 u32 reciprocal_buffer_size;
Ravikiran G Thirumalaib5d8ca72006-03-22 00:08:12 -0800390/* 3) touched by every alloc & free from the backend */
Ravikiran G Thirumalaib5d8ca72006-03-22 00:08:12 -0800391
Andrew Mortona737b3e2006-03-22 00:08:11 -0800392 unsigned int flags; /* constant flags */
393 unsigned int num; /* # of objs per slab */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700394
Ravikiran G Thirumalaib5d8ca72006-03-22 00:08:12 -0800395/* 4) cache_grow/shrink */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700396 /* order of pgs per slab (2^n) */
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800397 unsigned int gfporder;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700398
399 /* force GFP flags, e.g. GFP_DMA */
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800400 gfp_t gfpflags;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700401
Andrew Mortona737b3e2006-03-22 00:08:11 -0800402 size_t colour; /* cache colouring range */
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800403 unsigned int colour_off; /* colour offset */
Pekka Enberg343e0d72006-02-01 03:05:50 -0800404 struct kmem_cache *slabp_cache;
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800405 unsigned int slab_size;
Andrew Mortona737b3e2006-03-22 00:08:11 -0800406 unsigned int dflags; /* dynamic flags */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700407
408 /* constructor func */
Christoph Lameter4ba9b9d2007-10-16 23:25:51 -0700409 void (*ctor)(struct kmem_cache *, void *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700410
Ravikiran G Thirumalaib5d8ca72006-03-22 00:08:12 -0800411/* 5) cache creation/removal */
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800412 const char *name;
413 struct list_head next;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700414
Ravikiran G Thirumalaib5d8ca72006-03-22 00:08:12 -0800415/* 6) statistics */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700416#if STATS
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800417 unsigned long num_active;
418 unsigned long num_allocations;
419 unsigned long high_mark;
420 unsigned long grown;
421 unsigned long reaped;
422 unsigned long errors;
423 unsigned long max_freeable;
424 unsigned long node_allocs;
425 unsigned long node_frees;
Ravikiran G Thirumalaifb7faf32006-04-10 22:52:54 -0700426 unsigned long node_overflow;
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800427 atomic_t allochit;
428 atomic_t allocmiss;
429 atomic_t freehit;
430 atomic_t freemiss;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700431#endif
432#if DEBUG
Manfred Spraul3dafccf2006-02-01 03:05:42 -0800433 /*
434 * If debugging is enabled, then the allocator can add additional
435 * fields and/or padding to every object. buffer_size contains the total
436 * object size including these internal fields, the following two
437 * variables contain the offset to the user object and its size.
438 */
439 int obj_offset;
440 int obj_size;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700441#endif
Eric Dumazet8da34302007-05-06 14:49:29 -0700442 /*
443 * We put nodelists[] at the end of kmem_cache, because we want to size
444 * this array to nr_node_ids slots instead of MAX_NUMNODES
445 * (see kmem_cache_init())
446 * We still use [MAX_NUMNODES] and not [1] or [0] because cache_cache
447 * is statically defined, so we reserve the max number of nodes.
448 */
449 struct kmem_list3 *nodelists[MAX_NUMNODES];
450 /*
451 * Do not add fields after nodelists[]
452 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700453};
454
455#define CFLGS_OFF_SLAB (0x80000000UL)
456#define OFF_SLAB(x) ((x)->flags & CFLGS_OFF_SLAB)
457
458#define BATCHREFILL_LIMIT 16
Andrew Mortona737b3e2006-03-22 00:08:11 -0800459/*
460 * Optimization question: fewer reaps means less probability for unnessary
461 * cpucache drain/refill cycles.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700462 *
Adrian Bunkdc6f3f22005-11-08 16:44:08 +0100463 * OTOH the cpuarrays can contain lots of objects,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700464 * which could lock up otherwise freeable slabs.
465 */
466#define REAPTIMEOUT_CPUC (2*HZ)
467#define REAPTIMEOUT_LIST3 (4*HZ)
468
469#if STATS
470#define STATS_INC_ACTIVE(x) ((x)->num_active++)
471#define STATS_DEC_ACTIVE(x) ((x)->num_active--)
472#define STATS_INC_ALLOCED(x) ((x)->num_allocations++)
473#define STATS_INC_GROWN(x) ((x)->grown++)
Christoph Lametered11d9e2006-06-30 01:55:45 -0700474#define STATS_ADD_REAPED(x,y) ((x)->reaped += (y))
Andrew Mortona737b3e2006-03-22 00:08:11 -0800475#define STATS_SET_HIGH(x) \
476 do { \
477 if ((x)->num_active > (x)->high_mark) \
478 (x)->high_mark = (x)->num_active; \
479 } while (0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700480#define STATS_INC_ERR(x) ((x)->errors++)
481#define STATS_INC_NODEALLOCS(x) ((x)->node_allocs++)
Christoph Lametere498be72005-09-09 13:03:32 -0700482#define STATS_INC_NODEFREES(x) ((x)->node_frees++)
Ravikiran G Thirumalaifb7faf32006-04-10 22:52:54 -0700483#define STATS_INC_ACOVERFLOW(x) ((x)->node_overflow++)
Andrew Mortona737b3e2006-03-22 00:08:11 -0800484#define STATS_SET_FREEABLE(x, i) \
485 do { \
486 if ((x)->max_freeable < i) \
487 (x)->max_freeable = i; \
488 } while (0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700489#define STATS_INC_ALLOCHIT(x) atomic_inc(&(x)->allochit)
490#define STATS_INC_ALLOCMISS(x) atomic_inc(&(x)->allocmiss)
491#define STATS_INC_FREEHIT(x) atomic_inc(&(x)->freehit)
492#define STATS_INC_FREEMISS(x) atomic_inc(&(x)->freemiss)
493#else
494#define STATS_INC_ACTIVE(x) do { } while (0)
495#define STATS_DEC_ACTIVE(x) do { } while (0)
496#define STATS_INC_ALLOCED(x) do { } while (0)
497#define STATS_INC_GROWN(x) do { } while (0)
Christoph Lametered11d9e2006-06-30 01:55:45 -0700498#define STATS_ADD_REAPED(x,y) do { } while (0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700499#define STATS_SET_HIGH(x) do { } while (0)
500#define STATS_INC_ERR(x) do { } while (0)
501#define STATS_INC_NODEALLOCS(x) do { } while (0)
Christoph Lametere498be72005-09-09 13:03:32 -0700502#define STATS_INC_NODEFREES(x) do { } while (0)
Ravikiran G Thirumalaifb7faf32006-04-10 22:52:54 -0700503#define STATS_INC_ACOVERFLOW(x) do { } while (0)
Andrew Mortona737b3e2006-03-22 00:08:11 -0800504#define STATS_SET_FREEABLE(x, i) do { } while (0)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700505#define STATS_INC_ALLOCHIT(x) do { } while (0)
506#define STATS_INC_ALLOCMISS(x) do { } while (0)
507#define STATS_INC_FREEHIT(x) do { } while (0)
508#define STATS_INC_FREEMISS(x) do { } while (0)
509#endif
510
511#if DEBUG
Linus Torvalds1da177e2005-04-16 15:20:36 -0700512
Andrew Mortona737b3e2006-03-22 00:08:11 -0800513/*
514 * memory layout of objects:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700515 * 0 : objp
Manfred Spraul3dafccf2006-02-01 03:05:42 -0800516 * 0 .. cachep->obj_offset - BYTES_PER_WORD - 1: padding. This ensures that
Linus Torvalds1da177e2005-04-16 15:20:36 -0700517 * the end of an object is aligned with the end of the real
518 * allocation. Catches writes behind the end of the allocation.
Manfred Spraul3dafccf2006-02-01 03:05:42 -0800519 * cachep->obj_offset - BYTES_PER_WORD .. cachep->obj_offset - 1:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700520 * redzone word.
Manfred Spraul3dafccf2006-02-01 03:05:42 -0800521 * cachep->obj_offset: The real object.
522 * cachep->buffer_size - 2* BYTES_PER_WORD: redzone word [BYTES_PER_WORD long]
Andrew Mortona737b3e2006-03-22 00:08:11 -0800523 * cachep->buffer_size - 1* BYTES_PER_WORD: last caller address
524 * [BYTES_PER_WORD long]
Linus Torvalds1da177e2005-04-16 15:20:36 -0700525 */
Pekka Enberg343e0d72006-02-01 03:05:50 -0800526static int obj_offset(struct kmem_cache *cachep)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700527{
Manfred Spraul3dafccf2006-02-01 03:05:42 -0800528 return cachep->obj_offset;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700529}
530
Pekka Enberg343e0d72006-02-01 03:05:50 -0800531static int obj_size(struct kmem_cache *cachep)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700532{
Manfred Spraul3dafccf2006-02-01 03:05:42 -0800533 return cachep->obj_size;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700534}
535
David Woodhouseb46b8f12007-05-08 00:22:59 -0700536static unsigned long long *dbg_redzone1(struct kmem_cache *cachep, void *objp)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700537{
538 BUG_ON(!(cachep->flags & SLAB_RED_ZONE));
David Woodhouseb46b8f12007-05-08 00:22:59 -0700539 return (unsigned long long*) (objp + obj_offset(cachep) -
540 sizeof(unsigned long long));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700541}
542
David Woodhouseb46b8f12007-05-08 00:22:59 -0700543static unsigned long long *dbg_redzone2(struct kmem_cache *cachep, void *objp)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700544{
545 BUG_ON(!(cachep->flags & SLAB_RED_ZONE));
546 if (cachep->flags & SLAB_STORE_USER)
David Woodhouseb46b8f12007-05-08 00:22:59 -0700547 return (unsigned long long *)(objp + cachep->buffer_size -
548 sizeof(unsigned long long) -
David Woodhouse87a927c2007-07-04 21:26:44 -0400549 REDZONE_ALIGN);
David Woodhouseb46b8f12007-05-08 00:22:59 -0700550 return (unsigned long long *) (objp + cachep->buffer_size -
551 sizeof(unsigned long long));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700552}
553
Pekka Enberg343e0d72006-02-01 03:05:50 -0800554static void **dbg_userword(struct kmem_cache *cachep, void *objp)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700555{
556 BUG_ON(!(cachep->flags & SLAB_STORE_USER));
Manfred Spraul3dafccf2006-02-01 03:05:42 -0800557 return (void **)(objp + cachep->buffer_size - BYTES_PER_WORD);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700558}
559
560#else
561
Manfred Spraul3dafccf2006-02-01 03:05:42 -0800562#define obj_offset(x) 0
563#define obj_size(cachep) (cachep->buffer_size)
David Woodhouseb46b8f12007-05-08 00:22:59 -0700564#define dbg_redzone1(cachep, objp) ({BUG(); (unsigned long long *)NULL;})
565#define dbg_redzone2(cachep, objp) ({BUG(); (unsigned long long *)NULL;})
Linus Torvalds1da177e2005-04-16 15:20:36 -0700566#define dbg_userword(cachep, objp) ({BUG(); (void **)NULL;})
567
568#endif
569
570/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700571 * Do not go above this order unless 0 objects fit into the slab.
572 */
573#define BREAK_GFP_ORDER_HI 1
574#define BREAK_GFP_ORDER_LO 0
575static int slab_break_gfp_order = BREAK_GFP_ORDER_LO;
576
Andrew Mortona737b3e2006-03-22 00:08:11 -0800577/*
578 * Functions for storing/retrieving the cachep and or slab from the page
579 * allocator. These are used to find the slab an obj belongs to. With kfree(),
580 * these are used to find the cache which an obj belongs to.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700581 */
Pekka Enberg065d41c2005-11-13 16:06:46 -0800582static inline void page_set_cache(struct page *page, struct kmem_cache *cache)
583{
584 page->lru.next = (struct list_head *)cache;
585}
586
587static inline struct kmem_cache *page_get_cache(struct page *page)
588{
Christoph Lameterd85f3382007-05-06 14:49:39 -0700589 page = compound_head(page);
Pekka Enbergddc2e812006-06-23 02:03:40 -0700590 BUG_ON(!PageSlab(page));
Pekka Enberg065d41c2005-11-13 16:06:46 -0800591 return (struct kmem_cache *)page->lru.next;
592}
593
594static inline void page_set_slab(struct page *page, struct slab *slab)
595{
596 page->lru.prev = (struct list_head *)slab;
597}
598
599static inline struct slab *page_get_slab(struct page *page)
600{
Pekka Enbergddc2e812006-06-23 02:03:40 -0700601 BUG_ON(!PageSlab(page));
Pekka Enberg065d41c2005-11-13 16:06:46 -0800602 return (struct slab *)page->lru.prev;
603}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700604
Pekka Enberg6ed5eb22006-02-01 03:05:49 -0800605static inline struct kmem_cache *virt_to_cache(const void *obj)
606{
Christoph Lameterb49af682007-05-06 14:49:41 -0700607 struct page *page = virt_to_head_page(obj);
Pekka Enberg6ed5eb22006-02-01 03:05:49 -0800608 return page_get_cache(page);
609}
610
611static inline struct slab *virt_to_slab(const void *obj)
612{
Christoph Lameterb49af682007-05-06 14:49:41 -0700613 struct page *page = virt_to_head_page(obj);
Pekka Enberg6ed5eb22006-02-01 03:05:49 -0800614 return page_get_slab(page);
615}
616
Pekka Enberg8fea4e92006-03-22 00:08:10 -0800617static inline void *index_to_obj(struct kmem_cache *cache, struct slab *slab,
618 unsigned int idx)
619{
620 return slab->s_mem + cache->buffer_size * idx;
621}
622
Eric Dumazet6a2d7a92006-12-13 00:34:27 -0800623/*
624 * We want to avoid an expensive divide : (offset / cache->buffer_size)
625 * Using the fact that buffer_size is a constant for a particular cache,
626 * we can replace (offset / cache->buffer_size) by
627 * reciprocal_divide(offset, cache->reciprocal_buffer_size)
628 */
629static inline unsigned int obj_to_index(const struct kmem_cache *cache,
630 const struct slab *slab, void *obj)
Pekka Enberg8fea4e92006-03-22 00:08:10 -0800631{
Eric Dumazet6a2d7a92006-12-13 00:34:27 -0800632 u32 offset = (obj - slab->s_mem);
633 return reciprocal_divide(offset, cache->reciprocal_buffer_size);
Pekka Enberg8fea4e92006-03-22 00:08:10 -0800634}
635
Andrew Mortona737b3e2006-03-22 00:08:11 -0800636/*
637 * These are the default caches for kmalloc. Custom caches can have other sizes.
638 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700639struct cache_sizes malloc_sizes[] = {
640#define CACHE(x) { .cs_size = (x) },
641#include <linux/kmalloc_sizes.h>
642 CACHE(ULONG_MAX)
643#undef CACHE
644};
645EXPORT_SYMBOL(malloc_sizes);
646
647/* Must match cache_sizes above. Out of line to keep cache footprint low. */
648struct cache_names {
649 char *name;
650 char *name_dma;
651};
652
653static struct cache_names __initdata cache_names[] = {
654#define CACHE(x) { .name = "size-" #x, .name_dma = "size-" #x "(DMA)" },
655#include <linux/kmalloc_sizes.h>
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800656 {NULL,}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700657#undef CACHE
658};
659
660static struct arraycache_init initarray_cache __initdata =
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800661 { {0, BOOT_CPUCACHE_ENTRIES, 1, 0} };
Linus Torvalds1da177e2005-04-16 15:20:36 -0700662static struct arraycache_init initarray_generic =
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800663 { {0, BOOT_CPUCACHE_ENTRIES, 1, 0} };
Linus Torvalds1da177e2005-04-16 15:20:36 -0700664
665/* internal cache of cache description objs */
Pekka Enberg343e0d72006-02-01 03:05:50 -0800666static struct kmem_cache cache_cache = {
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800667 .batchcount = 1,
668 .limit = BOOT_CPUCACHE_ENTRIES,
669 .shared = 1,
Pekka Enberg343e0d72006-02-01 03:05:50 -0800670 .buffer_size = sizeof(struct kmem_cache),
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800671 .name = "kmem_cache",
Linus Torvalds1da177e2005-04-16 15:20:36 -0700672};
673
Ravikiran G Thirumalai056c6242006-09-25 23:31:38 -0700674#define BAD_ALIEN_MAGIC 0x01020304ul
675
Arjan van de Venf1aaee52006-07-13 14:46:03 +0200676#ifdef CONFIG_LOCKDEP
677
678/*
679 * Slab sometimes uses the kmalloc slabs to store the slab headers
680 * for other slabs "off slab".
681 * The locking for this is tricky in that it nests within the locks
682 * of all other slabs in a few places; to deal with this special
683 * locking we put on-slab caches into a separate lock-class.
Ravikiran G Thirumalai056c6242006-09-25 23:31:38 -0700684 *
685 * We set lock class for alien array caches which are up during init.
686 * The lock annotation will be lost if all cpus of a node goes down and
687 * then comes back up during hotplug
Arjan van de Venf1aaee52006-07-13 14:46:03 +0200688 */
Ravikiran G Thirumalai056c6242006-09-25 23:31:38 -0700689static struct lock_class_key on_slab_l3_key;
690static struct lock_class_key on_slab_alc_key;
Arjan van de Venf1aaee52006-07-13 14:46:03 +0200691
Ravikiran G Thirumalai056c6242006-09-25 23:31:38 -0700692static inline void init_lock_keys(void)
693
Arjan van de Venf1aaee52006-07-13 14:46:03 +0200694{
695 int q;
Ravikiran G Thirumalai056c6242006-09-25 23:31:38 -0700696 struct cache_sizes *s = malloc_sizes;
Arjan van de Venf1aaee52006-07-13 14:46:03 +0200697
Ravikiran G Thirumalai056c6242006-09-25 23:31:38 -0700698 while (s->cs_size != ULONG_MAX) {
699 for_each_node(q) {
700 struct array_cache **alc;
701 int r;
702 struct kmem_list3 *l3 = s->cs_cachep->nodelists[q];
703 if (!l3 || OFF_SLAB(s->cs_cachep))
704 continue;
705 lockdep_set_class(&l3->list_lock, &on_slab_l3_key);
706 alc = l3->alien;
707 /*
708 * FIXME: This check for BAD_ALIEN_MAGIC
709 * should go away when common slab code is taught to
710 * work even without alien caches.
711 * Currently, non NUMA code returns BAD_ALIEN_MAGIC
712 * for alloc_alien_cache,
713 */
714 if (!alc || (unsigned long)alc == BAD_ALIEN_MAGIC)
715 continue;
716 for_each_node(r) {
717 if (alc[r])
718 lockdep_set_class(&alc[r]->lock,
719 &on_slab_alc_key);
720 }
721 }
722 s++;
Arjan van de Venf1aaee52006-07-13 14:46:03 +0200723 }
724}
Arjan van de Venf1aaee52006-07-13 14:46:03 +0200725#else
Ravikiran G Thirumalai056c6242006-09-25 23:31:38 -0700726static inline void init_lock_keys(void)
Arjan van de Venf1aaee52006-07-13 14:46:03 +0200727{
728}
729#endif
730
Ravikiran G Thirumalai8f5be202006-12-06 20:32:14 -0800731/*
Gautham R Shenoy95402b32008-01-25 21:08:02 +0100732 * Guard access to the cache-chain.
Ravikiran G Thirumalai8f5be202006-12-06 20:32:14 -0800733 */
Ingo Molnarfc0abb12006-01-18 17:42:33 -0800734static DEFINE_MUTEX(cache_chain_mutex);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700735static struct list_head cache_chain;
736
737/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700738 * chicken and egg problem: delay the per-cpu array allocation
739 * until the general caches are up.
740 */
741static enum {
742 NONE,
Christoph Lametere498be72005-09-09 13:03:32 -0700743 PARTIAL_AC,
744 PARTIAL_L3,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700745 FULL
746} g_cpucache_up;
747
Mike Kravetz39d24e62006-05-15 09:44:13 -0700748/*
749 * used by boot code to determine if it can use slab based allocator
750 */
751int slab_is_available(void)
752{
753 return g_cpucache_up == FULL;
754}
755
David Howells52bad642006-11-22 14:54:01 +0000756static DEFINE_PER_CPU(struct delayed_work, reap_work);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700757
Pekka Enberg343e0d72006-02-01 03:05:50 -0800758static inline struct array_cache *cpu_cache_get(struct kmem_cache *cachep)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700759{
760 return cachep->array[smp_processor_id()];
761}
762
Andrew Mortona737b3e2006-03-22 00:08:11 -0800763static inline struct kmem_cache *__find_general_cachep(size_t size,
764 gfp_t gfpflags)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700765{
766 struct cache_sizes *csizep = malloc_sizes;
767
768#if DEBUG
769 /* This happens if someone tries to call
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800770 * kmem_cache_create(), or __kmalloc(), before
771 * the generic caches are initialized.
772 */
Alok Katariac7e43c72005-09-14 12:17:53 -0700773 BUG_ON(malloc_sizes[INDEX_AC].cs_cachep == NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700774#endif
Christoph Lameter6cb8f912007-07-17 04:03:22 -0700775 if (!size)
776 return ZERO_SIZE_PTR;
777
Linus Torvalds1da177e2005-04-16 15:20:36 -0700778 while (size > csizep->cs_size)
779 csizep++;
780
781 /*
Martin Hicks0abf40c2005-09-03 15:54:54 -0700782 * Really subtle: The last entry with cs->cs_size==ULONG_MAX
Linus Torvalds1da177e2005-04-16 15:20:36 -0700783 * has cs_{dma,}cachep==NULL. Thus no special case
784 * for large kmalloc calls required.
785 */
Christoph Lameter4b51d662007-02-10 01:43:10 -0800786#ifdef CONFIG_ZONE_DMA
Linus Torvalds1da177e2005-04-16 15:20:36 -0700787 if (unlikely(gfpflags & GFP_DMA))
788 return csizep->cs_dmacachep;
Christoph Lameter4b51d662007-02-10 01:43:10 -0800789#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700790 return csizep->cs_cachep;
791}
792
Adrian Bunkb2213852006-09-25 23:31:02 -0700793static struct kmem_cache *kmem_find_general_cachep(size_t size, gfp_t gfpflags)
Manfred Spraul97e2bde2005-05-01 08:58:38 -0700794{
795 return __find_general_cachep(size, gfpflags);
796}
Manfred Spraul97e2bde2005-05-01 08:58:38 -0700797
Steven Rostedtfbaccac2006-02-01 03:05:45 -0800798static size_t slab_mgmt_size(size_t nr_objs, size_t align)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700799{
Steven Rostedtfbaccac2006-02-01 03:05:45 -0800800 return ALIGN(sizeof(struct slab)+nr_objs*sizeof(kmem_bufctl_t), align);
801}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700802
Andrew Mortona737b3e2006-03-22 00:08:11 -0800803/*
804 * Calculate the number of objects and left-over bytes for a given buffer size.
805 */
Steven Rostedtfbaccac2006-02-01 03:05:45 -0800806static void cache_estimate(unsigned long gfporder, size_t buffer_size,
807 size_t align, int flags, size_t *left_over,
808 unsigned int *num)
809{
810 int nr_objs;
811 size_t mgmt_size;
812 size_t slab_size = PAGE_SIZE << gfporder;
813
814 /*
815 * The slab management structure can be either off the slab or
816 * on it. For the latter case, the memory allocated for a
817 * slab is used for:
818 *
819 * - The struct slab
820 * - One kmem_bufctl_t for each object
821 * - Padding to respect alignment of @align
822 * - @buffer_size bytes for each object
823 *
824 * If the slab management structure is off the slab, then the
825 * alignment will already be calculated into the size. Because
826 * the slabs are all pages aligned, the objects will be at the
827 * correct alignment when allocated.
828 */
829 if (flags & CFLGS_OFF_SLAB) {
830 mgmt_size = 0;
831 nr_objs = slab_size / buffer_size;
832
833 if (nr_objs > SLAB_LIMIT)
834 nr_objs = SLAB_LIMIT;
835 } else {
836 /*
837 * Ignore padding for the initial guess. The padding
838 * is at most @align-1 bytes, and @buffer_size is at
839 * least @align. In the worst case, this result will
840 * be one greater than the number of objects that fit
841 * into the memory allocation when taking the padding
842 * into account.
843 */
844 nr_objs = (slab_size - sizeof(struct slab)) /
845 (buffer_size + sizeof(kmem_bufctl_t));
846
847 /*
848 * This calculated number will be either the right
849 * amount, or one greater than what we want.
850 */
851 if (slab_mgmt_size(nr_objs, align) + nr_objs*buffer_size
852 > slab_size)
853 nr_objs--;
854
855 if (nr_objs > SLAB_LIMIT)
856 nr_objs = SLAB_LIMIT;
857
858 mgmt_size = slab_mgmt_size(nr_objs, align);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700859 }
Steven Rostedtfbaccac2006-02-01 03:05:45 -0800860 *num = nr_objs;
861 *left_over = slab_size - nr_objs*buffer_size - mgmt_size;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700862}
863
Harvey Harrisond40cee22008-04-30 00:55:07 -0700864#define slab_error(cachep, msg) __slab_error(__func__, cachep, msg)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700865
Andrew Mortona737b3e2006-03-22 00:08:11 -0800866static void __slab_error(const char *function, struct kmem_cache *cachep,
867 char *msg)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700868{
869 printk(KERN_ERR "slab error in %s(): cache `%s': %s\n",
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800870 function, cachep->name, msg);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700871 dump_stack();
872}
873
Paul Menage3395ee02006-12-06 20:32:16 -0800874/*
875 * By default on NUMA we use alien caches to stage the freeing of
876 * objects allocated from other nodes. This causes massive memory
877 * inefficiencies when using fake NUMA setup to split memory into a
878 * large number of small nodes, so it can be disabled on the command
879 * line
880 */
881
882static int use_alien_caches __read_mostly = 1;
Siddha, Suresh B1807a1a2007-08-22 14:01:49 -0700883static int numa_platform __read_mostly = 1;
Paul Menage3395ee02006-12-06 20:32:16 -0800884static int __init noaliencache_setup(char *s)
885{
886 use_alien_caches = 0;
887 return 1;
888}
889__setup("noaliencache", noaliencache_setup);
890
Christoph Lameter8fce4d82006-03-09 17:33:54 -0800891#ifdef CONFIG_NUMA
892/*
893 * Special reaping functions for NUMA systems called from cache_reap().
894 * These take care of doing round robin flushing of alien caches (containing
895 * objects freed on different nodes from which they were allocated) and the
896 * flushing of remote pcps by calling drain_node_pages.
897 */
898static DEFINE_PER_CPU(unsigned long, reap_node);
899
900static void init_reap_node(int cpu)
901{
902 int node;
903
904 node = next_node(cpu_to_node(cpu), node_online_map);
905 if (node == MAX_NUMNODES)
Paul Jackson442295c2006-03-22 00:09:11 -0800906 node = first_node(node_online_map);
Christoph Lameter8fce4d82006-03-09 17:33:54 -0800907
Daniel Yeisley7f6b8872006-11-02 22:07:14 -0800908 per_cpu(reap_node, cpu) = node;
Christoph Lameter8fce4d82006-03-09 17:33:54 -0800909}
910
911static void next_reap_node(void)
912{
913 int node = __get_cpu_var(reap_node);
914
Christoph Lameter8fce4d82006-03-09 17:33:54 -0800915 node = next_node(node, node_online_map);
916 if (unlikely(node >= MAX_NUMNODES))
917 node = first_node(node_online_map);
918 __get_cpu_var(reap_node) = node;
919}
920
921#else
922#define init_reap_node(cpu) do { } while (0)
923#define next_reap_node(void) do { } while (0)
924#endif
925
Linus Torvalds1da177e2005-04-16 15:20:36 -0700926/*
927 * Initiate the reap timer running on the target CPU. We run at around 1 to 2Hz
928 * via the workqueue/eventd.
929 * Add the CPU number into the expiration time to minimize the possibility of
930 * the CPUs getting into lockstep and contending for the global cache chain
931 * lock.
932 */
Adrian Bunk897e6792007-07-15 23:38:20 -0700933static void __cpuinit start_cpu_timer(int cpu)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700934{
David Howells52bad642006-11-22 14:54:01 +0000935 struct delayed_work *reap_work = &per_cpu(reap_work, cpu);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700936
937 /*
938 * When this gets called from do_initcalls via cpucache_init(),
939 * init_workqueues() has already run, so keventd will be setup
940 * at that time.
941 */
David Howells52bad642006-11-22 14:54:01 +0000942 if (keventd_up() && reap_work->work.func == NULL) {
Christoph Lameter8fce4d82006-03-09 17:33:54 -0800943 init_reap_node(cpu);
David Howells65f27f32006-11-22 14:55:48 +0000944 INIT_DELAYED_WORK(reap_work, cache_reap);
Arjan van de Ven2b284212006-12-10 02:21:28 -0800945 schedule_delayed_work_on(cpu, reap_work,
946 __round_jiffies_relative(HZ, cpu));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700947 }
948}
949
Christoph Lametere498be72005-09-09 13:03:32 -0700950static struct array_cache *alloc_arraycache(int node, int entries,
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800951 int batchcount)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700952{
Pekka Enbergb28a02d2006-01-08 01:00:37 -0800953 int memsize = sizeof(void *) * entries + sizeof(struct array_cache);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700954 struct array_cache *nc = NULL;
955
Christoph Lametere498be72005-09-09 13:03:32 -0700956 nc = kmalloc_node(memsize, GFP_KERNEL, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700957 if (nc) {
958 nc->avail = 0;
959 nc->limit = entries;
960 nc->batchcount = batchcount;
961 nc->touched = 0;
Christoph Lametere498be72005-09-09 13:03:32 -0700962 spin_lock_init(&nc->lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700963 }
964 return nc;
965}
966
Christoph Lameter3ded1752006-03-25 03:06:44 -0800967/*
968 * Transfer objects in one arraycache to another.
969 * Locking must be handled by the caller.
970 *
971 * Return the number of entries transferred.
972 */
973static int transfer_objects(struct array_cache *to,
974 struct array_cache *from, unsigned int max)
975{
976 /* Figure out how many entries to transfer */
977 int nr = min(min(from->avail, max), to->limit - to->avail);
978
979 if (!nr)
980 return 0;
981
982 memcpy(to->entry + to->avail, from->entry + from->avail -nr,
983 sizeof(void *) *nr);
984
985 from->avail -= nr;
986 to->avail += nr;
987 to->touched = 1;
988 return nr;
989}
990
Christoph Lameter765c4502006-09-27 01:50:08 -0700991#ifndef CONFIG_NUMA
992
993#define drain_alien_cache(cachep, alien) do { } while (0)
994#define reap_alien(cachep, l3) do { } while (0)
995
996static inline struct array_cache **alloc_alien_cache(int node, int limit)
997{
998 return (struct array_cache **)BAD_ALIEN_MAGIC;
999}
1000
1001static inline void free_alien_cache(struct array_cache **ac_ptr)
1002{
1003}
1004
1005static inline int cache_free_alien(struct kmem_cache *cachep, void *objp)
1006{
1007 return 0;
1008}
1009
1010static inline void *alternate_node_alloc(struct kmem_cache *cachep,
1011 gfp_t flags)
1012{
1013 return NULL;
1014}
1015
Christoph Hellwig8b98c162006-12-06 20:32:30 -08001016static inline void *____cache_alloc_node(struct kmem_cache *cachep,
Christoph Lameter765c4502006-09-27 01:50:08 -07001017 gfp_t flags, int nodeid)
1018{
1019 return NULL;
1020}
1021
1022#else /* CONFIG_NUMA */
1023
Christoph Hellwig8b98c162006-12-06 20:32:30 -08001024static void *____cache_alloc_node(struct kmem_cache *, gfp_t, int);
Paul Jacksonc61afb12006-03-24 03:16:08 -08001025static void *alternate_node_alloc(struct kmem_cache *, gfp_t);
Christoph Lameterdc85da12006-01-18 17:42:36 -08001026
Pekka Enberg5295a742006-02-01 03:05:48 -08001027static struct array_cache **alloc_alien_cache(int node, int limit)
Christoph Lametere498be72005-09-09 13:03:32 -07001028{
1029 struct array_cache **ac_ptr;
Christoph Lameter8ef82862007-02-20 13:57:52 -08001030 int memsize = sizeof(void *) * nr_node_ids;
Christoph Lametere498be72005-09-09 13:03:32 -07001031 int i;
1032
1033 if (limit > 1)
1034 limit = 12;
1035 ac_ptr = kmalloc_node(memsize, GFP_KERNEL, node);
1036 if (ac_ptr) {
1037 for_each_node(i) {
1038 if (i == node || !node_online(i)) {
1039 ac_ptr[i] = NULL;
1040 continue;
1041 }
1042 ac_ptr[i] = alloc_arraycache(node, limit, 0xbaadf00d);
1043 if (!ac_ptr[i]) {
Akinobu Mitacc550de2007-11-14 16:58:35 -08001044 for (i--; i >= 0; i--)
Christoph Lametere498be72005-09-09 13:03:32 -07001045 kfree(ac_ptr[i]);
1046 kfree(ac_ptr);
1047 return NULL;
1048 }
1049 }
1050 }
1051 return ac_ptr;
1052}
1053
Pekka Enberg5295a742006-02-01 03:05:48 -08001054static void free_alien_cache(struct array_cache **ac_ptr)
Christoph Lametere498be72005-09-09 13:03:32 -07001055{
1056 int i;
1057
1058 if (!ac_ptr)
1059 return;
Christoph Lametere498be72005-09-09 13:03:32 -07001060 for_each_node(i)
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001061 kfree(ac_ptr[i]);
Christoph Lametere498be72005-09-09 13:03:32 -07001062 kfree(ac_ptr);
1063}
1064
Pekka Enberg343e0d72006-02-01 03:05:50 -08001065static void __drain_alien_cache(struct kmem_cache *cachep,
Pekka Enberg5295a742006-02-01 03:05:48 -08001066 struct array_cache *ac, int node)
Christoph Lametere498be72005-09-09 13:03:32 -07001067{
1068 struct kmem_list3 *rl3 = cachep->nodelists[node];
1069
1070 if (ac->avail) {
1071 spin_lock(&rl3->list_lock);
Christoph Lametere00946f2006-03-25 03:06:45 -08001072 /*
1073 * Stuff objects into the remote nodes shared array first.
1074 * That way we could avoid the overhead of putting the objects
1075 * into the free lists and getting them back later.
1076 */
shin, jacob693f7d32006-04-28 10:54:37 -05001077 if (rl3->shared)
1078 transfer_objects(rl3->shared, ac, ac->limit);
Christoph Lametere00946f2006-03-25 03:06:45 -08001079
Christoph Lameterff694162005-09-22 21:44:02 -07001080 free_block(cachep, ac->entry, ac->avail, node);
Christoph Lametere498be72005-09-09 13:03:32 -07001081 ac->avail = 0;
1082 spin_unlock(&rl3->list_lock);
1083 }
1084}
1085
Christoph Lameter8fce4d82006-03-09 17:33:54 -08001086/*
1087 * Called from cache_reap() to regularly drain alien caches round robin.
1088 */
1089static void reap_alien(struct kmem_cache *cachep, struct kmem_list3 *l3)
1090{
1091 int node = __get_cpu_var(reap_node);
1092
1093 if (l3->alien) {
1094 struct array_cache *ac = l3->alien[node];
Christoph Lametere00946f2006-03-25 03:06:45 -08001095
1096 if (ac && ac->avail && spin_trylock_irq(&ac->lock)) {
Christoph Lameter8fce4d82006-03-09 17:33:54 -08001097 __drain_alien_cache(cachep, ac, node);
1098 spin_unlock_irq(&ac->lock);
1099 }
1100 }
1101}
1102
Andrew Mortona737b3e2006-03-22 00:08:11 -08001103static void drain_alien_cache(struct kmem_cache *cachep,
1104 struct array_cache **alien)
Christoph Lametere498be72005-09-09 13:03:32 -07001105{
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001106 int i = 0;
Christoph Lametere498be72005-09-09 13:03:32 -07001107 struct array_cache *ac;
1108 unsigned long flags;
1109
1110 for_each_online_node(i) {
Ravikiran G Thirumalai4484ebf2006-02-04 23:27:59 -08001111 ac = alien[i];
Christoph Lametere498be72005-09-09 13:03:32 -07001112 if (ac) {
1113 spin_lock_irqsave(&ac->lock, flags);
1114 __drain_alien_cache(cachep, ac, i);
1115 spin_unlock_irqrestore(&ac->lock, flags);
1116 }
1117 }
1118}
Pekka Enberg729bd0b2006-06-23 02:03:05 -07001119
Ingo Molnar873623d2006-07-13 14:44:38 +02001120static inline int cache_free_alien(struct kmem_cache *cachep, void *objp)
Pekka Enberg729bd0b2006-06-23 02:03:05 -07001121{
1122 struct slab *slabp = virt_to_slab(objp);
1123 int nodeid = slabp->nodeid;
1124 struct kmem_list3 *l3;
1125 struct array_cache *alien = NULL;
Pekka Enberg1ca4cb22006-10-06 00:43:52 -07001126 int node;
1127
1128 node = numa_node_id();
Pekka Enberg729bd0b2006-06-23 02:03:05 -07001129
1130 /*
1131 * Make sure we are not freeing a object from another node to the array
1132 * cache on this cpu.
1133 */
Siddha, Suresh B62918a02007-05-02 19:27:18 +02001134 if (likely(slabp->nodeid == node))
Pekka Enberg729bd0b2006-06-23 02:03:05 -07001135 return 0;
1136
Pekka Enberg1ca4cb22006-10-06 00:43:52 -07001137 l3 = cachep->nodelists[node];
Pekka Enberg729bd0b2006-06-23 02:03:05 -07001138 STATS_INC_NODEFREES(cachep);
1139 if (l3->alien && l3->alien[nodeid]) {
1140 alien = l3->alien[nodeid];
Ingo Molnar873623d2006-07-13 14:44:38 +02001141 spin_lock(&alien->lock);
Pekka Enberg729bd0b2006-06-23 02:03:05 -07001142 if (unlikely(alien->avail == alien->limit)) {
1143 STATS_INC_ACOVERFLOW(cachep);
1144 __drain_alien_cache(cachep, alien, nodeid);
1145 }
1146 alien->entry[alien->avail++] = objp;
1147 spin_unlock(&alien->lock);
1148 } else {
1149 spin_lock(&(cachep->nodelists[nodeid])->list_lock);
1150 free_block(cachep, &objp, 1, nodeid);
1151 spin_unlock(&(cachep->nodelists[nodeid])->list_lock);
1152 }
1153 return 1;
1154}
Christoph Lametere498be72005-09-09 13:03:32 -07001155#endif
1156
Akinobu Mitafbf1e472007-10-18 03:05:09 -07001157static void __cpuinit cpuup_canceled(long cpu)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001158{
Akinobu Mitafbf1e472007-10-18 03:05:09 -07001159 struct kmem_cache *cachep;
1160 struct kmem_list3 *l3 = NULL;
1161 int node = cpu_to_node(cpu);
Mike Travisc5f59f02008-04-04 18:11:10 -07001162 node_to_cpumask_ptr(mask, node);
Akinobu Mitafbf1e472007-10-18 03:05:09 -07001163
1164 list_for_each_entry(cachep, &cache_chain, next) {
1165 struct array_cache *nc;
1166 struct array_cache *shared;
1167 struct array_cache **alien;
Akinobu Mitafbf1e472007-10-18 03:05:09 -07001168
Akinobu Mitafbf1e472007-10-18 03:05:09 -07001169 /* cpu is dead; no one can alloc from it. */
1170 nc = cachep->array[cpu];
1171 cachep->array[cpu] = NULL;
1172 l3 = cachep->nodelists[node];
1173
1174 if (!l3)
1175 goto free_array_cache;
1176
1177 spin_lock_irq(&l3->list_lock);
1178
1179 /* Free limit for this kmem_list3 */
1180 l3->free_limit -= cachep->batchcount;
1181 if (nc)
1182 free_block(cachep, nc->entry, nc->avail, node);
1183
Mike Travisc5f59f02008-04-04 18:11:10 -07001184 if (!cpus_empty(*mask)) {
Akinobu Mitafbf1e472007-10-18 03:05:09 -07001185 spin_unlock_irq(&l3->list_lock);
1186 goto free_array_cache;
1187 }
1188
1189 shared = l3->shared;
1190 if (shared) {
1191 free_block(cachep, shared->entry,
1192 shared->avail, node);
1193 l3->shared = NULL;
1194 }
1195
1196 alien = l3->alien;
1197 l3->alien = NULL;
1198
1199 spin_unlock_irq(&l3->list_lock);
1200
1201 kfree(shared);
1202 if (alien) {
1203 drain_alien_cache(cachep, alien);
1204 free_alien_cache(alien);
1205 }
1206free_array_cache:
1207 kfree(nc);
1208 }
1209 /*
1210 * In the previous loop, all the objects were freed to
1211 * the respective cache's slabs, now we can go ahead and
1212 * shrink each nodelist to its limit.
1213 */
1214 list_for_each_entry(cachep, &cache_chain, next) {
1215 l3 = cachep->nodelists[node];
1216 if (!l3)
1217 continue;
1218 drain_freelist(cachep, l3, l3->free_objects);
1219 }
1220}
1221
1222static int __cpuinit cpuup_prepare(long cpu)
1223{
Pekka Enberg343e0d72006-02-01 03:05:50 -08001224 struct kmem_cache *cachep;
Christoph Lametere498be72005-09-09 13:03:32 -07001225 struct kmem_list3 *l3 = NULL;
1226 int node = cpu_to_node(cpu);
David Howellsea02e3d2007-07-19 01:49:09 -07001227 const int memsize = sizeof(struct kmem_list3);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001228
Akinobu Mitafbf1e472007-10-18 03:05:09 -07001229 /*
1230 * We need to do this right in the beginning since
1231 * alloc_arraycache's are going to use this list.
1232 * kmalloc_node allows us to add the slab to the right
1233 * kmem_list3 and not this cpu's kmem_list3
1234 */
1235
1236 list_for_each_entry(cachep, &cache_chain, next) {
1237 /*
1238 * Set up the size64 kmemlist for cpu before we can
1239 * begin anything. Make sure some other cpu on this
1240 * node has not already allocated this
1241 */
1242 if (!cachep->nodelists[node]) {
1243 l3 = kmalloc_node(memsize, GFP_KERNEL, node);
1244 if (!l3)
1245 goto bad;
1246 kmem_list3_init(l3);
1247 l3->next_reap = jiffies + REAPTIMEOUT_LIST3 +
1248 ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
1249
1250 /*
1251 * The l3s don't come and go as CPUs come and
1252 * go. cache_chain_mutex is sufficient
1253 * protection here.
1254 */
1255 cachep->nodelists[node] = l3;
1256 }
1257
1258 spin_lock_irq(&cachep->nodelists[node]->list_lock);
1259 cachep->nodelists[node]->free_limit =
1260 (1 + nr_cpus_node(node)) *
1261 cachep->batchcount + cachep->num;
1262 spin_unlock_irq(&cachep->nodelists[node]->list_lock);
1263 }
1264
1265 /*
1266 * Now we can go ahead with allocating the shared arrays and
1267 * array caches
1268 */
1269 list_for_each_entry(cachep, &cache_chain, next) {
1270 struct array_cache *nc;
1271 struct array_cache *shared = NULL;
1272 struct array_cache **alien = NULL;
1273
1274 nc = alloc_arraycache(node, cachep->limit,
1275 cachep->batchcount);
1276 if (!nc)
1277 goto bad;
1278 if (cachep->shared) {
1279 shared = alloc_arraycache(node,
1280 cachep->shared * cachep->batchcount,
1281 0xbaadf00d);
Akinobu Mita12d00f62007-10-18 03:05:11 -07001282 if (!shared) {
1283 kfree(nc);
Akinobu Mitafbf1e472007-10-18 03:05:09 -07001284 goto bad;
Akinobu Mita12d00f62007-10-18 03:05:11 -07001285 }
Akinobu Mitafbf1e472007-10-18 03:05:09 -07001286 }
1287 if (use_alien_caches) {
1288 alien = alloc_alien_cache(node, cachep->limit);
Akinobu Mita12d00f62007-10-18 03:05:11 -07001289 if (!alien) {
1290 kfree(shared);
1291 kfree(nc);
Akinobu Mitafbf1e472007-10-18 03:05:09 -07001292 goto bad;
Akinobu Mita12d00f62007-10-18 03:05:11 -07001293 }
Akinobu Mitafbf1e472007-10-18 03:05:09 -07001294 }
1295 cachep->array[cpu] = nc;
1296 l3 = cachep->nodelists[node];
1297 BUG_ON(!l3);
1298
1299 spin_lock_irq(&l3->list_lock);
1300 if (!l3->shared) {
1301 /*
1302 * We are serialised from CPU_DEAD or
1303 * CPU_UP_CANCELLED by the cpucontrol lock
1304 */
1305 l3->shared = shared;
1306 shared = NULL;
1307 }
1308#ifdef CONFIG_NUMA
1309 if (!l3->alien) {
1310 l3->alien = alien;
1311 alien = NULL;
1312 }
1313#endif
1314 spin_unlock_irq(&l3->list_lock);
1315 kfree(shared);
1316 free_alien_cache(alien);
1317 }
1318 return 0;
1319bad:
Akinobu Mita12d00f62007-10-18 03:05:11 -07001320 cpuup_canceled(cpu);
Akinobu Mitafbf1e472007-10-18 03:05:09 -07001321 return -ENOMEM;
1322}
1323
1324static int __cpuinit cpuup_callback(struct notifier_block *nfb,
1325 unsigned long action, void *hcpu)
1326{
1327 long cpu = (long)hcpu;
1328 int err = 0;
1329
Linus Torvalds1da177e2005-04-16 15:20:36 -07001330 switch (action) {
Heiko Carstens38c3bd92007-05-09 02:34:05 -07001331 case CPU_UP_PREPARE:
Rafael J. Wysocki8bb78442007-05-09 02:35:10 -07001332 case CPU_UP_PREPARE_FROZEN:
Gautham R Shenoy95402b32008-01-25 21:08:02 +01001333 mutex_lock(&cache_chain_mutex);
Akinobu Mitafbf1e472007-10-18 03:05:09 -07001334 err = cpuup_prepare(cpu);
Gautham R Shenoy95402b32008-01-25 21:08:02 +01001335 mutex_unlock(&cache_chain_mutex);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001336 break;
1337 case CPU_ONLINE:
Rafael J. Wysocki8bb78442007-05-09 02:35:10 -07001338 case CPU_ONLINE_FROZEN:
Linus Torvalds1da177e2005-04-16 15:20:36 -07001339 start_cpu_timer(cpu);
1340 break;
1341#ifdef CONFIG_HOTPLUG_CPU
Christoph Lameter5830c592007-05-09 02:34:22 -07001342 case CPU_DOWN_PREPARE:
Rafael J. Wysocki8bb78442007-05-09 02:35:10 -07001343 case CPU_DOWN_PREPARE_FROZEN:
Christoph Lameter5830c592007-05-09 02:34:22 -07001344 /*
1345 * Shutdown cache reaper. Note that the cache_chain_mutex is
1346 * held so that if cache_reap() is invoked it cannot do
1347 * anything expensive but will only modify reap_work
1348 * and reschedule the timer.
1349 */
1350 cancel_rearming_delayed_work(&per_cpu(reap_work, cpu));
1351 /* Now the cache_reaper is guaranteed to be not running. */
1352 per_cpu(reap_work, cpu).work.func = NULL;
1353 break;
1354 case CPU_DOWN_FAILED:
Rafael J. Wysocki8bb78442007-05-09 02:35:10 -07001355 case CPU_DOWN_FAILED_FROZEN:
Christoph Lameter5830c592007-05-09 02:34:22 -07001356 start_cpu_timer(cpu);
1357 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001358 case CPU_DEAD:
Rafael J. Wysocki8bb78442007-05-09 02:35:10 -07001359 case CPU_DEAD_FROZEN:
Ravikiran G Thirumalai4484ebf2006-02-04 23:27:59 -08001360 /*
1361 * Even if all the cpus of a node are down, we don't free the
1362 * kmem_list3 of any cache. This to avoid a race between
1363 * cpu_down, and a kmalloc allocation from another cpu for
1364 * memory from the node of the cpu going down. The list3
1365 * structure is usually allocated from kmem_cache_create() and
1366 * gets destroyed at kmem_cache_destroy().
1367 */
Simon Arlott183ff222007-10-20 01:27:18 +02001368 /* fall through */
Ravikiran G Thirumalai8f5be202006-12-06 20:32:14 -08001369#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07001370 case CPU_UP_CANCELED:
Rafael J. Wysocki8bb78442007-05-09 02:35:10 -07001371 case CPU_UP_CANCELED_FROZEN:
Gautham R Shenoy95402b32008-01-25 21:08:02 +01001372 mutex_lock(&cache_chain_mutex);
Akinobu Mitafbf1e472007-10-18 03:05:09 -07001373 cpuup_canceled(cpu);
Ingo Molnarfc0abb12006-01-18 17:42:33 -08001374 mutex_unlock(&cache_chain_mutex);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001375 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001376 }
Akinobu Mitafbf1e472007-10-18 03:05:09 -07001377 return err ? NOTIFY_BAD : NOTIFY_OK;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001378}
1379
Chandra Seetharaman74b85f32006-06-27 02:54:09 -07001380static struct notifier_block __cpuinitdata cpucache_notifier = {
1381 &cpuup_callback, NULL, 0
1382};
Linus Torvalds1da177e2005-04-16 15:20:36 -07001383
Christoph Lametere498be72005-09-09 13:03:32 -07001384/*
1385 * swap the static kmem_list3 with kmalloced memory
1386 */
Andrew Mortona737b3e2006-03-22 00:08:11 -08001387static void init_list(struct kmem_cache *cachep, struct kmem_list3 *list,
1388 int nodeid)
Christoph Lametere498be72005-09-09 13:03:32 -07001389{
1390 struct kmem_list3 *ptr;
1391
Christoph Lametere498be72005-09-09 13:03:32 -07001392 ptr = kmalloc_node(sizeof(struct kmem_list3), GFP_KERNEL, nodeid);
1393 BUG_ON(!ptr);
1394
1395 local_irq_disable();
1396 memcpy(ptr, list, sizeof(struct kmem_list3));
Ingo Molnar2b2d5492006-07-03 00:25:28 -07001397 /*
1398 * Do not assume that spinlocks can be initialized via memcpy:
1399 */
1400 spin_lock_init(&ptr->list_lock);
1401
Christoph Lametere498be72005-09-09 13:03:32 -07001402 MAKE_ALL_LISTS(cachep, ptr, nodeid);
1403 cachep->nodelists[nodeid] = ptr;
1404 local_irq_enable();
1405}
1406
Andrew Mortona737b3e2006-03-22 00:08:11 -08001407/*
Pekka Enberg556a1692008-01-25 08:20:51 +02001408 * For setting up all the kmem_list3s for cache whose buffer_size is same as
1409 * size of kmem_list3.
1410 */
1411static void __init set_up_list3s(struct kmem_cache *cachep, int index)
1412{
1413 int node;
1414
1415 for_each_online_node(node) {
1416 cachep->nodelists[node] = &initkmem_list3[index + node];
1417 cachep->nodelists[node]->next_reap = jiffies +
1418 REAPTIMEOUT_LIST3 +
1419 ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
1420 }
1421}
1422
1423/*
Andrew Mortona737b3e2006-03-22 00:08:11 -08001424 * Initialisation. Called after the page allocator have been initialised and
1425 * before smp_init().
Linus Torvalds1da177e2005-04-16 15:20:36 -07001426 */
1427void __init kmem_cache_init(void)
1428{
1429 size_t left_over;
1430 struct cache_sizes *sizes;
1431 struct cache_names *names;
Christoph Lametere498be72005-09-09 13:03:32 -07001432 int i;
Jack Steiner07ed76b2006-03-07 21:55:46 -08001433 int order;
Pekka Enberg1ca4cb22006-10-06 00:43:52 -07001434 int node;
Christoph Lametere498be72005-09-09 13:03:32 -07001435
Siddha, Suresh B1807a1a2007-08-22 14:01:49 -07001436 if (num_possible_nodes() == 1) {
Siddha, Suresh B62918a02007-05-02 19:27:18 +02001437 use_alien_caches = 0;
Siddha, Suresh B1807a1a2007-08-22 14:01:49 -07001438 numa_platform = 0;
1439 }
Siddha, Suresh B62918a02007-05-02 19:27:18 +02001440
Christoph Lametere498be72005-09-09 13:03:32 -07001441 for (i = 0; i < NUM_INIT_LISTS; i++) {
1442 kmem_list3_init(&initkmem_list3[i]);
1443 if (i < MAX_NUMNODES)
1444 cache_cache.nodelists[i] = NULL;
1445 }
Pekka Enberg556a1692008-01-25 08:20:51 +02001446 set_up_list3s(&cache_cache, CACHE_CACHE);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001447
1448 /*
1449 * Fragmentation resistance on low memory - only use bigger
1450 * page orders on machines with more than 32MB of memory.
1451 */
1452 if (num_physpages > (32 << 20) >> PAGE_SHIFT)
1453 slab_break_gfp_order = BREAK_GFP_ORDER_HI;
1454
Linus Torvalds1da177e2005-04-16 15:20:36 -07001455 /* Bootstrap is tricky, because several objects are allocated
1456 * from caches that do not exist yet:
Andrew Mortona737b3e2006-03-22 00:08:11 -08001457 * 1) initialize the cache_cache cache: it contains the struct
1458 * kmem_cache structures of all caches, except cache_cache itself:
1459 * cache_cache is statically allocated.
Christoph Lametere498be72005-09-09 13:03:32 -07001460 * Initially an __init data area is used for the head array and the
1461 * kmem_list3 structures, it's replaced with a kmalloc allocated
1462 * array at the end of the bootstrap.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001463 * 2) Create the first kmalloc cache.
Pekka Enberg343e0d72006-02-01 03:05:50 -08001464 * The struct kmem_cache for the new cache is allocated normally.
Christoph Lametere498be72005-09-09 13:03:32 -07001465 * An __init data area is used for the head array.
1466 * 3) Create the remaining kmalloc caches, with minimally sized
1467 * head arrays.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001468 * 4) Replace the __init data head arrays for cache_cache and the first
1469 * kmalloc cache with kmalloc allocated arrays.
Christoph Lametere498be72005-09-09 13:03:32 -07001470 * 5) Replace the __init data for kmem_list3 for cache_cache and
1471 * the other cache's with kmalloc allocated memory.
1472 * 6) Resize the head arrays of the kmalloc caches to their final sizes.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001473 */
1474
Pekka Enberg1ca4cb22006-10-06 00:43:52 -07001475 node = numa_node_id();
1476
Linus Torvalds1da177e2005-04-16 15:20:36 -07001477 /* 1) create the cache_cache */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001478 INIT_LIST_HEAD(&cache_chain);
1479 list_add(&cache_cache.next, &cache_chain);
1480 cache_cache.colour_off = cache_line_size();
1481 cache_cache.array[smp_processor_id()] = &initarray_cache.cache;
Daniel Yeisleyec1f5ee2008-03-25 23:59:08 +02001482 cache_cache.nodelists[node] = &initkmem_list3[CACHE_CACHE + node];
Linus Torvalds1da177e2005-04-16 15:20:36 -07001483
Eric Dumazet8da34302007-05-06 14:49:29 -07001484 /*
1485 * struct kmem_cache size depends on nr_node_ids, which
1486 * can be less than MAX_NUMNODES.
1487 */
1488 cache_cache.buffer_size = offsetof(struct kmem_cache, nodelists) +
1489 nr_node_ids * sizeof(struct kmem_list3 *);
1490#if DEBUG
1491 cache_cache.obj_size = cache_cache.buffer_size;
1492#endif
Andrew Mortona737b3e2006-03-22 00:08:11 -08001493 cache_cache.buffer_size = ALIGN(cache_cache.buffer_size,
1494 cache_line_size());
Eric Dumazet6a2d7a92006-12-13 00:34:27 -08001495 cache_cache.reciprocal_buffer_size =
1496 reciprocal_value(cache_cache.buffer_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001497
Jack Steiner07ed76b2006-03-07 21:55:46 -08001498 for (order = 0; order < MAX_ORDER; order++) {
1499 cache_estimate(order, cache_cache.buffer_size,
1500 cache_line_size(), 0, &left_over, &cache_cache.num);
1501 if (cache_cache.num)
1502 break;
1503 }
Eric Sesterhenn40094fa2006-04-02 13:49:25 +02001504 BUG_ON(!cache_cache.num);
Jack Steiner07ed76b2006-03-07 21:55:46 -08001505 cache_cache.gfporder = order;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001506 cache_cache.colour = left_over / cache_cache.colour_off;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001507 cache_cache.slab_size = ALIGN(cache_cache.num * sizeof(kmem_bufctl_t) +
1508 sizeof(struct slab), cache_line_size());
Linus Torvalds1da177e2005-04-16 15:20:36 -07001509
1510 /* 2+3) create the kmalloc caches */
1511 sizes = malloc_sizes;
1512 names = cache_names;
1513
Andrew Mortona737b3e2006-03-22 00:08:11 -08001514 /*
1515 * Initialize the caches that provide memory for the array cache and the
1516 * kmem_list3 structures first. Without this, further allocations will
1517 * bug.
Christoph Lametere498be72005-09-09 13:03:32 -07001518 */
1519
1520 sizes[INDEX_AC].cs_cachep = kmem_cache_create(names[INDEX_AC].name,
Andrew Mortona737b3e2006-03-22 00:08:11 -08001521 sizes[INDEX_AC].cs_size,
1522 ARCH_KMALLOC_MINALIGN,
1523 ARCH_KMALLOC_FLAGS|SLAB_PANIC,
Paul Mundt20c2df82007-07-20 10:11:58 +09001524 NULL);
Christoph Lametere498be72005-09-09 13:03:32 -07001525
Andrew Mortona737b3e2006-03-22 00:08:11 -08001526 if (INDEX_AC != INDEX_L3) {
Christoph Lametere498be72005-09-09 13:03:32 -07001527 sizes[INDEX_L3].cs_cachep =
Andrew Mortona737b3e2006-03-22 00:08:11 -08001528 kmem_cache_create(names[INDEX_L3].name,
1529 sizes[INDEX_L3].cs_size,
1530 ARCH_KMALLOC_MINALIGN,
1531 ARCH_KMALLOC_FLAGS|SLAB_PANIC,
Paul Mundt20c2df82007-07-20 10:11:58 +09001532 NULL);
Andrew Mortona737b3e2006-03-22 00:08:11 -08001533 }
Christoph Lametere498be72005-09-09 13:03:32 -07001534
Ingo Molnare0a42722006-06-23 02:03:46 -07001535 slab_early_init = 0;
1536
Linus Torvalds1da177e2005-04-16 15:20:36 -07001537 while (sizes->cs_size != ULONG_MAX) {
Christoph Lametere498be72005-09-09 13:03:32 -07001538 /*
1539 * For performance, all the general caches are L1 aligned.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001540 * This should be particularly beneficial on SMP boxes, as it
1541 * eliminates "false sharing".
1542 * Note for systems short on memory removing the alignment will
Christoph Lametere498be72005-09-09 13:03:32 -07001543 * allow tighter packing of the smaller caches.
1544 */
Andrew Mortona737b3e2006-03-22 00:08:11 -08001545 if (!sizes->cs_cachep) {
Christoph Lametere498be72005-09-09 13:03:32 -07001546 sizes->cs_cachep = kmem_cache_create(names->name,
Andrew Mortona737b3e2006-03-22 00:08:11 -08001547 sizes->cs_size,
1548 ARCH_KMALLOC_MINALIGN,
1549 ARCH_KMALLOC_FLAGS|SLAB_PANIC,
Paul Mundt20c2df82007-07-20 10:11:58 +09001550 NULL);
Andrew Mortona737b3e2006-03-22 00:08:11 -08001551 }
Christoph Lameter4b51d662007-02-10 01:43:10 -08001552#ifdef CONFIG_ZONE_DMA
1553 sizes->cs_dmacachep = kmem_cache_create(
1554 names->name_dma,
Andrew Mortona737b3e2006-03-22 00:08:11 -08001555 sizes->cs_size,
1556 ARCH_KMALLOC_MINALIGN,
1557 ARCH_KMALLOC_FLAGS|SLAB_CACHE_DMA|
1558 SLAB_PANIC,
Paul Mundt20c2df82007-07-20 10:11:58 +09001559 NULL);
Christoph Lameter4b51d662007-02-10 01:43:10 -08001560#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07001561 sizes++;
1562 names++;
1563 }
1564 /* 4) Replace the bootstrap head arrays */
1565 {
Ingo Molnar2b2d5492006-07-03 00:25:28 -07001566 struct array_cache *ptr;
Christoph Lametere498be72005-09-09 13:03:32 -07001567
Linus Torvalds1da177e2005-04-16 15:20:36 -07001568 ptr = kmalloc(sizeof(struct arraycache_init), GFP_KERNEL);
Christoph Lametere498be72005-09-09 13:03:32 -07001569
Linus Torvalds1da177e2005-04-16 15:20:36 -07001570 local_irq_disable();
Pekka Enberg9a2dba42006-02-01 03:05:49 -08001571 BUG_ON(cpu_cache_get(&cache_cache) != &initarray_cache.cache);
1572 memcpy(ptr, cpu_cache_get(&cache_cache),
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001573 sizeof(struct arraycache_init));
Ingo Molnar2b2d5492006-07-03 00:25:28 -07001574 /*
1575 * Do not assume that spinlocks can be initialized via memcpy:
1576 */
1577 spin_lock_init(&ptr->lock);
1578
Linus Torvalds1da177e2005-04-16 15:20:36 -07001579 cache_cache.array[smp_processor_id()] = ptr;
1580 local_irq_enable();
Christoph Lametere498be72005-09-09 13:03:32 -07001581
Linus Torvalds1da177e2005-04-16 15:20:36 -07001582 ptr = kmalloc(sizeof(struct arraycache_init), GFP_KERNEL);
Christoph Lametere498be72005-09-09 13:03:32 -07001583
Linus Torvalds1da177e2005-04-16 15:20:36 -07001584 local_irq_disable();
Pekka Enberg9a2dba42006-02-01 03:05:49 -08001585 BUG_ON(cpu_cache_get(malloc_sizes[INDEX_AC].cs_cachep)
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001586 != &initarray_generic.cache);
Pekka Enberg9a2dba42006-02-01 03:05:49 -08001587 memcpy(ptr, cpu_cache_get(malloc_sizes[INDEX_AC].cs_cachep),
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001588 sizeof(struct arraycache_init));
Ingo Molnar2b2d5492006-07-03 00:25:28 -07001589 /*
1590 * Do not assume that spinlocks can be initialized via memcpy:
1591 */
1592 spin_lock_init(&ptr->lock);
1593
Christoph Lametere498be72005-09-09 13:03:32 -07001594 malloc_sizes[INDEX_AC].cs_cachep->array[smp_processor_id()] =
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001595 ptr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001596 local_irq_enable();
1597 }
Christoph Lametere498be72005-09-09 13:03:32 -07001598 /* 5) Replace the bootstrap kmem_list3's */
1599 {
Pekka Enberg1ca4cb22006-10-06 00:43:52 -07001600 int nid;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001601
Mel Gorman9c09a952008-01-24 05:49:54 -08001602 for_each_online_node(nid) {
Daniel Yeisleyec1f5ee2008-03-25 23:59:08 +02001603 init_list(&cache_cache, &initkmem_list3[CACHE_CACHE + nid], nid);
Pekka Enberg556a1692008-01-25 08:20:51 +02001604
Christoph Lametere498be72005-09-09 13:03:32 -07001605 init_list(malloc_sizes[INDEX_AC].cs_cachep,
Pekka Enberg1ca4cb22006-10-06 00:43:52 -07001606 &initkmem_list3[SIZE_AC + nid], nid);
Christoph Lametere498be72005-09-09 13:03:32 -07001607
1608 if (INDEX_AC != INDEX_L3) {
1609 init_list(malloc_sizes[INDEX_L3].cs_cachep,
Pekka Enberg1ca4cb22006-10-06 00:43:52 -07001610 &initkmem_list3[SIZE_L3 + nid], nid);
Christoph Lametere498be72005-09-09 13:03:32 -07001611 }
1612 }
1613 }
1614
1615 /* 6) resize the head arrays to their final sizes */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001616 {
Pekka Enberg343e0d72006-02-01 03:05:50 -08001617 struct kmem_cache *cachep;
Ingo Molnarfc0abb12006-01-18 17:42:33 -08001618 mutex_lock(&cache_chain_mutex);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001619 list_for_each_entry(cachep, &cache_chain, next)
Christoph Lameter2ed3a4e2006-09-25 23:31:38 -07001620 if (enable_cpucache(cachep))
1621 BUG();
Ingo Molnarfc0abb12006-01-18 17:42:33 -08001622 mutex_unlock(&cache_chain_mutex);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001623 }
1624
Ravikiran G Thirumalai056c6242006-09-25 23:31:38 -07001625 /* Annotate slab for lockdep -- annotate the malloc caches */
1626 init_lock_keys();
1627
1628
Linus Torvalds1da177e2005-04-16 15:20:36 -07001629 /* Done! */
1630 g_cpucache_up = FULL;
1631
Andrew Mortona737b3e2006-03-22 00:08:11 -08001632 /*
1633 * Register a cpu startup notifier callback that initializes
1634 * cpu_cache_get for all new cpus
Linus Torvalds1da177e2005-04-16 15:20:36 -07001635 */
1636 register_cpu_notifier(&cpucache_notifier);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001637
Andrew Mortona737b3e2006-03-22 00:08:11 -08001638 /*
1639 * The reap timers are started later, with a module init call: That part
1640 * of the kernel is not yet operational.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001641 */
1642}
1643
1644static int __init cpucache_init(void)
1645{
1646 int cpu;
1647
Andrew Mortona737b3e2006-03-22 00:08:11 -08001648 /*
1649 * Register the timers that return unneeded pages to the page allocator
Linus Torvalds1da177e2005-04-16 15:20:36 -07001650 */
Christoph Lametere498be72005-09-09 13:03:32 -07001651 for_each_online_cpu(cpu)
Andrew Mortona737b3e2006-03-22 00:08:11 -08001652 start_cpu_timer(cpu);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001653 return 0;
1654}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001655__initcall(cpucache_init);
1656
1657/*
1658 * Interface to system's page allocator. No need to hold the cache-lock.
1659 *
1660 * If we requested dmaable memory, we will get it. Even if we
1661 * did not request dmaable memory, we might get it, but that
1662 * would be relatively rare and ignorable.
1663 */
Pekka Enberg343e0d72006-02-01 03:05:50 -08001664static void *kmem_getpages(struct kmem_cache *cachep, gfp_t flags, int nodeid)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001665{
1666 struct page *page;
Christoph Hellwige1b6aa62006-06-23 02:03:17 -07001667 int nr_pages;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001668 int i;
1669
Luke Yangd6fef9d2006-04-10 22:52:56 -07001670#ifndef CONFIG_MMU
Christoph Hellwige1b6aa62006-06-23 02:03:17 -07001671 /*
1672 * Nommu uses slab's for process anonymous memory allocations, and thus
1673 * requires __GFP_COMP to properly refcount higher order allocations
Luke Yangd6fef9d2006-04-10 22:52:56 -07001674 */
Christoph Hellwige1b6aa62006-06-23 02:03:17 -07001675 flags |= __GFP_COMP;
Luke Yangd6fef9d2006-04-10 22:52:56 -07001676#endif
Christoph Lameter765c4502006-09-27 01:50:08 -07001677
Christoph Lameter3c517a62006-12-06 20:33:29 -08001678 flags |= cachep->gfpflags;
Mel Gormane12ba742007-10-16 01:25:52 -07001679 if (cachep->flags & SLAB_RECLAIM_ACCOUNT)
1680 flags |= __GFP_RECLAIMABLE;
Christoph Hellwige1b6aa62006-06-23 02:03:17 -07001681
1682 page = alloc_pages_node(nodeid, flags, cachep->gfporder);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001683 if (!page)
1684 return NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001685
Christoph Hellwige1b6aa62006-06-23 02:03:17 -07001686 nr_pages = (1 << cachep->gfporder);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001687 if (cachep->flags & SLAB_RECLAIM_ACCOUNT)
Christoph Lameter972d1a72006-09-25 23:31:51 -07001688 add_zone_page_state(page_zone(page),
1689 NR_SLAB_RECLAIMABLE, nr_pages);
1690 else
1691 add_zone_page_state(page_zone(page),
1692 NR_SLAB_UNRECLAIMABLE, nr_pages);
Christoph Hellwige1b6aa62006-06-23 02:03:17 -07001693 for (i = 0; i < nr_pages; i++)
1694 __SetPageSlab(page + i);
1695 return page_address(page);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001696}
1697
1698/*
1699 * Interface to system's page release.
1700 */
Pekka Enberg343e0d72006-02-01 03:05:50 -08001701static void kmem_freepages(struct kmem_cache *cachep, void *addr)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001702{
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001703 unsigned long i = (1 << cachep->gfporder);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001704 struct page *page = virt_to_page(addr);
1705 const unsigned long nr_freed = i;
1706
Christoph Lameter972d1a72006-09-25 23:31:51 -07001707 if (cachep->flags & SLAB_RECLAIM_ACCOUNT)
1708 sub_zone_page_state(page_zone(page),
1709 NR_SLAB_RECLAIMABLE, nr_freed);
1710 else
1711 sub_zone_page_state(page_zone(page),
1712 NR_SLAB_UNRECLAIMABLE, nr_freed);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001713 while (i--) {
Nick Pigginf205b2f2006-03-22 00:08:02 -08001714 BUG_ON(!PageSlab(page));
1715 __ClearPageSlab(page);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001716 page++;
1717 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001718 if (current->reclaim_state)
1719 current->reclaim_state->reclaimed_slab += nr_freed;
1720 free_pages((unsigned long)addr, cachep->gfporder);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001721}
1722
1723static void kmem_rcu_free(struct rcu_head *head)
1724{
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001725 struct slab_rcu *slab_rcu = (struct slab_rcu *)head;
Pekka Enberg343e0d72006-02-01 03:05:50 -08001726 struct kmem_cache *cachep = slab_rcu->cachep;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001727
1728 kmem_freepages(cachep, slab_rcu->addr);
1729 if (OFF_SLAB(cachep))
1730 kmem_cache_free(cachep->slabp_cache, slab_rcu);
1731}
1732
1733#if DEBUG
1734
1735#ifdef CONFIG_DEBUG_PAGEALLOC
Pekka Enberg343e0d72006-02-01 03:05:50 -08001736static void store_stackinfo(struct kmem_cache *cachep, unsigned long *addr,
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001737 unsigned long caller)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001738{
Manfred Spraul3dafccf2006-02-01 03:05:42 -08001739 int size = obj_size(cachep);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001740
Manfred Spraul3dafccf2006-02-01 03:05:42 -08001741 addr = (unsigned long *)&((char *)addr)[obj_offset(cachep)];
Linus Torvalds1da177e2005-04-16 15:20:36 -07001742
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001743 if (size < 5 * sizeof(unsigned long))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001744 return;
1745
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001746 *addr++ = 0x12345678;
1747 *addr++ = caller;
1748 *addr++ = smp_processor_id();
1749 size -= 3 * sizeof(unsigned long);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001750 {
1751 unsigned long *sptr = &caller;
1752 unsigned long svalue;
1753
1754 while (!kstack_end(sptr)) {
1755 svalue = *sptr++;
1756 if (kernel_text_address(svalue)) {
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001757 *addr++ = svalue;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001758 size -= sizeof(unsigned long);
1759 if (size <= sizeof(unsigned long))
1760 break;
1761 }
1762 }
1763
1764 }
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001765 *addr++ = 0x87654321;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001766}
1767#endif
1768
Pekka Enberg343e0d72006-02-01 03:05:50 -08001769static void poison_obj(struct kmem_cache *cachep, void *addr, unsigned char val)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001770{
Manfred Spraul3dafccf2006-02-01 03:05:42 -08001771 int size = obj_size(cachep);
1772 addr = &((char *)addr)[obj_offset(cachep)];
Linus Torvalds1da177e2005-04-16 15:20:36 -07001773
1774 memset(addr, val, size);
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001775 *(unsigned char *)(addr + size - 1) = POISON_END;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001776}
1777
1778static void dump_line(char *data, int offset, int limit)
1779{
1780 int i;
Dave Jonesaa83aa42006-09-29 01:59:51 -07001781 unsigned char error = 0;
1782 int bad_count = 0;
1783
Linus Torvalds1da177e2005-04-16 15:20:36 -07001784 printk(KERN_ERR "%03x:", offset);
Dave Jonesaa83aa42006-09-29 01:59:51 -07001785 for (i = 0; i < limit; i++) {
1786 if (data[offset + i] != POISON_FREE) {
1787 error = data[offset + i];
1788 bad_count++;
1789 }
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001790 printk(" %02x", (unsigned char)data[offset + i]);
Dave Jonesaa83aa42006-09-29 01:59:51 -07001791 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001792 printk("\n");
Dave Jonesaa83aa42006-09-29 01:59:51 -07001793
1794 if (bad_count == 1) {
1795 error ^= POISON_FREE;
1796 if (!(error & (error - 1))) {
1797 printk(KERN_ERR "Single bit error detected. Probably "
1798 "bad RAM.\n");
1799#ifdef CONFIG_X86
1800 printk(KERN_ERR "Run memtest86+ or a similar memory "
1801 "test tool.\n");
1802#else
1803 printk(KERN_ERR "Run a memory test tool.\n");
1804#endif
1805 }
1806 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001807}
1808#endif
1809
1810#if DEBUG
1811
Pekka Enberg343e0d72006-02-01 03:05:50 -08001812static void print_objinfo(struct kmem_cache *cachep, void *objp, int lines)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001813{
1814 int i, size;
1815 char *realobj;
1816
1817 if (cachep->flags & SLAB_RED_ZONE) {
David Woodhouseb46b8f12007-05-08 00:22:59 -07001818 printk(KERN_ERR "Redzone: 0x%llx/0x%llx.\n",
Andrew Mortona737b3e2006-03-22 00:08:11 -08001819 *dbg_redzone1(cachep, objp),
1820 *dbg_redzone2(cachep, objp));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001821 }
1822
1823 if (cachep->flags & SLAB_STORE_USER) {
1824 printk(KERN_ERR "Last user: [<%p>]",
Andrew Mortona737b3e2006-03-22 00:08:11 -08001825 *dbg_userword(cachep, objp));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001826 print_symbol("(%s)",
Andrew Mortona737b3e2006-03-22 00:08:11 -08001827 (unsigned long)*dbg_userword(cachep, objp));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001828 printk("\n");
1829 }
Manfred Spraul3dafccf2006-02-01 03:05:42 -08001830 realobj = (char *)objp + obj_offset(cachep);
1831 size = obj_size(cachep);
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001832 for (i = 0; i < size && lines; i += 16, lines--) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001833 int limit;
1834 limit = 16;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001835 if (i + limit > size)
1836 limit = size - i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001837 dump_line(realobj, i, limit);
1838 }
1839}
1840
Pekka Enberg343e0d72006-02-01 03:05:50 -08001841static void check_poison_obj(struct kmem_cache *cachep, void *objp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001842{
1843 char *realobj;
1844 int size, i;
1845 int lines = 0;
1846
Manfred Spraul3dafccf2006-02-01 03:05:42 -08001847 realobj = (char *)objp + obj_offset(cachep);
1848 size = obj_size(cachep);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001849
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001850 for (i = 0; i < size; i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001851 char exp = POISON_FREE;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001852 if (i == size - 1)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001853 exp = POISON_END;
1854 if (realobj[i] != exp) {
1855 int limit;
1856 /* Mismatch ! */
1857 /* Print header */
1858 if (lines == 0) {
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001859 printk(KERN_ERR
David Howellse94a40c2007-04-02 23:46:28 +01001860 "Slab corruption: %s start=%p, len=%d\n",
1861 cachep->name, realobj, size);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001862 print_objinfo(cachep, objp, 0);
1863 }
1864 /* Hexdump the affected line */
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001865 i = (i / 16) * 16;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001866 limit = 16;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001867 if (i + limit > size)
1868 limit = size - i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001869 dump_line(realobj, i, limit);
1870 i += 16;
1871 lines++;
1872 /* Limit to 5 lines */
1873 if (lines > 5)
1874 break;
1875 }
1876 }
1877 if (lines != 0) {
1878 /* Print some data about the neighboring objects, if they
1879 * exist:
1880 */
Pekka Enberg6ed5eb22006-02-01 03:05:49 -08001881 struct slab *slabp = virt_to_slab(objp);
Pekka Enberg8fea4e92006-03-22 00:08:10 -08001882 unsigned int objnr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001883
Pekka Enberg8fea4e92006-03-22 00:08:10 -08001884 objnr = obj_to_index(cachep, slabp, objp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001885 if (objnr) {
Pekka Enberg8fea4e92006-03-22 00:08:10 -08001886 objp = index_to_obj(cachep, slabp, objnr - 1);
Manfred Spraul3dafccf2006-02-01 03:05:42 -08001887 realobj = (char *)objp + obj_offset(cachep);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001888 printk(KERN_ERR "Prev obj: start=%p, len=%d\n",
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001889 realobj, size);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001890 print_objinfo(cachep, objp, 2);
1891 }
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001892 if (objnr + 1 < cachep->num) {
Pekka Enberg8fea4e92006-03-22 00:08:10 -08001893 objp = index_to_obj(cachep, slabp, objnr + 1);
Manfred Spraul3dafccf2006-02-01 03:05:42 -08001894 realobj = (char *)objp + obj_offset(cachep);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001895 printk(KERN_ERR "Next obj: start=%p, len=%d\n",
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001896 realobj, size);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001897 print_objinfo(cachep, objp, 2);
1898 }
1899 }
1900}
1901#endif
1902
Linus Torvalds1da177e2005-04-16 15:20:36 -07001903#if DEBUG
Rabin Vincente79aec22008-07-04 00:40:32 +05301904static void slab_destroy_debugcheck(struct kmem_cache *cachep, struct slab *slabp)
Matthew Dobson12dd36f2006-02-01 03:05:46 -08001905{
Linus Torvalds1da177e2005-04-16 15:20:36 -07001906 int i;
1907 for (i = 0; i < cachep->num; i++) {
Pekka Enberg8fea4e92006-03-22 00:08:10 -08001908 void *objp = index_to_obj(cachep, slabp, i);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001909
1910 if (cachep->flags & SLAB_POISON) {
1911#ifdef CONFIG_DEBUG_PAGEALLOC
Andrew Mortona737b3e2006-03-22 00:08:11 -08001912 if (cachep->buffer_size % PAGE_SIZE == 0 &&
1913 OFF_SLAB(cachep))
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001914 kernel_map_pages(virt_to_page(objp),
Andrew Mortona737b3e2006-03-22 00:08:11 -08001915 cachep->buffer_size / PAGE_SIZE, 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001916 else
1917 check_poison_obj(cachep, objp);
1918#else
1919 check_poison_obj(cachep, objp);
1920#endif
1921 }
1922 if (cachep->flags & SLAB_RED_ZONE) {
1923 if (*dbg_redzone1(cachep, objp) != RED_INACTIVE)
1924 slab_error(cachep, "start of a freed object "
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001925 "was overwritten");
Linus Torvalds1da177e2005-04-16 15:20:36 -07001926 if (*dbg_redzone2(cachep, objp) != RED_INACTIVE)
1927 slab_error(cachep, "end of a freed object "
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001928 "was overwritten");
Linus Torvalds1da177e2005-04-16 15:20:36 -07001929 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001930 }
Matthew Dobson12dd36f2006-02-01 03:05:46 -08001931}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001932#else
Rabin Vincente79aec22008-07-04 00:40:32 +05301933static void slab_destroy_debugcheck(struct kmem_cache *cachep, struct slab *slabp)
Matthew Dobson12dd36f2006-02-01 03:05:46 -08001934{
Matthew Dobson12dd36f2006-02-01 03:05:46 -08001935}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001936#endif
1937
Randy Dunlap911851e2006-03-22 00:08:14 -08001938/**
1939 * slab_destroy - destroy and release all objects in a slab
1940 * @cachep: cache pointer being destroyed
1941 * @slabp: slab pointer being destroyed
1942 *
Matthew Dobson12dd36f2006-02-01 03:05:46 -08001943 * Destroy all the objs in a slab, and release the mem back to the system.
Andrew Mortona737b3e2006-03-22 00:08:11 -08001944 * Before calling the slab must have been unlinked from the cache. The
1945 * cache-lock is not held/needed.
Matthew Dobson12dd36f2006-02-01 03:05:46 -08001946 */
Pekka Enberg343e0d72006-02-01 03:05:50 -08001947static void slab_destroy(struct kmem_cache *cachep, struct slab *slabp)
Matthew Dobson12dd36f2006-02-01 03:05:46 -08001948{
1949 void *addr = slabp->s_mem - slabp->colouroff;
1950
Rabin Vincente79aec22008-07-04 00:40:32 +05301951 slab_destroy_debugcheck(cachep, slabp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001952 if (unlikely(cachep->flags & SLAB_DESTROY_BY_RCU)) {
1953 struct slab_rcu *slab_rcu;
1954
Pekka Enbergb28a02d2006-01-08 01:00:37 -08001955 slab_rcu = (struct slab_rcu *)slabp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001956 slab_rcu->cachep = cachep;
1957 slab_rcu->addr = addr;
1958 call_rcu(&slab_rcu->head, kmem_rcu_free);
1959 } else {
1960 kmem_freepages(cachep, addr);
Ingo Molnar873623d2006-07-13 14:44:38 +02001961 if (OFF_SLAB(cachep))
1962 kmem_cache_free(cachep->slabp_cache, slabp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001963 }
1964}
1965
Christoph Lameter117f6eb2006-09-25 23:31:37 -07001966static void __kmem_cache_destroy(struct kmem_cache *cachep)
1967{
1968 int i;
1969 struct kmem_list3 *l3;
1970
1971 for_each_online_cpu(i)
1972 kfree(cachep->array[i]);
1973
1974 /* NUMA: free the list3 structures */
1975 for_each_online_node(i) {
1976 l3 = cachep->nodelists[i];
1977 if (l3) {
1978 kfree(l3->shared);
1979 free_alien_cache(l3->alien);
1980 kfree(l3);
1981 }
1982 }
1983 kmem_cache_free(&cache_cache, cachep);
1984}
1985
1986
Linus Torvalds1da177e2005-04-16 15:20:36 -07001987/**
Randy.Dunlapa70773d2006-02-01 03:05:52 -08001988 * calculate_slab_order - calculate size (page order) of slabs
1989 * @cachep: pointer to the cache that is being created
1990 * @size: size of objects to be created in this cache.
1991 * @align: required alignment for the objects.
1992 * @flags: slab allocation flags
1993 *
1994 * Also calculates the number of objects per slab.
Pekka Enberg4d268eb2006-01-08 01:00:36 -08001995 *
1996 * This could be made much more intelligent. For now, try to avoid using
1997 * high order pages for slabs. When the gfp() functions are more friendly
1998 * towards high-order requests, this should be changed.
1999 */
Andrew Mortona737b3e2006-03-22 00:08:11 -08002000static size_t calculate_slab_order(struct kmem_cache *cachep,
Randy Dunlapee13d782006-02-01 03:05:53 -08002001 size_t size, size_t align, unsigned long flags)
Pekka Enberg4d268eb2006-01-08 01:00:36 -08002002{
Ingo Molnarb1ab41c2006-06-02 15:44:58 +02002003 unsigned long offslab_limit;
Pekka Enberg4d268eb2006-01-08 01:00:36 -08002004 size_t left_over = 0;
Linus Torvalds9888e6f2006-03-06 17:44:43 -08002005 int gfporder;
Pekka Enberg4d268eb2006-01-08 01:00:36 -08002006
Christoph Lameter0aa817f2007-05-16 22:11:01 -07002007 for (gfporder = 0; gfporder <= KMALLOC_MAX_ORDER; gfporder++) {
Pekka Enberg4d268eb2006-01-08 01:00:36 -08002008 unsigned int num;
2009 size_t remainder;
2010
Linus Torvalds9888e6f2006-03-06 17:44:43 -08002011 cache_estimate(gfporder, size, align, flags, &remainder, &num);
Pekka Enberg4d268eb2006-01-08 01:00:36 -08002012 if (!num)
2013 continue;
Linus Torvalds9888e6f2006-03-06 17:44:43 -08002014
Ingo Molnarb1ab41c2006-06-02 15:44:58 +02002015 if (flags & CFLGS_OFF_SLAB) {
2016 /*
2017 * Max number of objs-per-slab for caches which
2018 * use off-slab slabs. Needed to avoid a possible
2019 * looping condition in cache_grow().
2020 */
2021 offslab_limit = size - sizeof(struct slab);
2022 offslab_limit /= sizeof(kmem_bufctl_t);
2023
2024 if (num > offslab_limit)
2025 break;
2026 }
Pekka Enberg4d268eb2006-01-08 01:00:36 -08002027
Linus Torvalds9888e6f2006-03-06 17:44:43 -08002028 /* Found something acceptable - save it away */
Pekka Enberg4d268eb2006-01-08 01:00:36 -08002029 cachep->num = num;
Linus Torvalds9888e6f2006-03-06 17:44:43 -08002030 cachep->gfporder = gfporder;
Pekka Enberg4d268eb2006-01-08 01:00:36 -08002031 left_over = remainder;
2032
2033 /*
Linus Torvaldsf78bb8a2006-03-08 10:33:05 -08002034 * A VFS-reclaimable slab tends to have most allocations
2035 * as GFP_NOFS and we really don't want to have to be allocating
2036 * higher-order pages when we are unable to shrink dcache.
2037 */
2038 if (flags & SLAB_RECLAIM_ACCOUNT)
2039 break;
2040
2041 /*
Pekka Enberg4d268eb2006-01-08 01:00:36 -08002042 * Large number of objects is good, but very large slabs are
2043 * currently bad for the gfp()s.
2044 */
Linus Torvalds9888e6f2006-03-06 17:44:43 -08002045 if (gfporder >= slab_break_gfp_order)
Pekka Enberg4d268eb2006-01-08 01:00:36 -08002046 break;
2047
Linus Torvalds9888e6f2006-03-06 17:44:43 -08002048 /*
2049 * Acceptable internal fragmentation?
2050 */
Andrew Mortona737b3e2006-03-22 00:08:11 -08002051 if (left_over * 8 <= (PAGE_SIZE << gfporder))
Pekka Enberg4d268eb2006-01-08 01:00:36 -08002052 break;
2053 }
2054 return left_over;
2055}
2056
Sam Ravnborg38bdc322007-05-17 23:48:19 +02002057static int __init_refok setup_cpu_cache(struct kmem_cache *cachep)
Pekka Enbergf30cf7d2006-03-22 00:08:11 -08002058{
Christoph Lameter2ed3a4e2006-09-25 23:31:38 -07002059 if (g_cpucache_up == FULL)
2060 return enable_cpucache(cachep);
2061
Pekka Enbergf30cf7d2006-03-22 00:08:11 -08002062 if (g_cpucache_up == NONE) {
2063 /*
2064 * Note: the first kmem_cache_create must create the cache
2065 * that's used by kmalloc(24), otherwise the creation of
2066 * further caches will BUG().
2067 */
2068 cachep->array[smp_processor_id()] = &initarray_generic.cache;
2069
2070 /*
2071 * If the cache that's used by kmalloc(sizeof(kmem_list3)) is
2072 * the first cache, then we need to set up all its list3s,
2073 * otherwise the creation of further caches will BUG().
2074 */
2075 set_up_list3s(cachep, SIZE_AC);
2076 if (INDEX_AC == INDEX_L3)
2077 g_cpucache_up = PARTIAL_L3;
2078 else
2079 g_cpucache_up = PARTIAL_AC;
2080 } else {
2081 cachep->array[smp_processor_id()] =
2082 kmalloc(sizeof(struct arraycache_init), GFP_KERNEL);
2083
2084 if (g_cpucache_up == PARTIAL_AC) {
2085 set_up_list3s(cachep, SIZE_L3);
2086 g_cpucache_up = PARTIAL_L3;
2087 } else {
2088 int node;
Pekka Enberg556a1692008-01-25 08:20:51 +02002089 for_each_online_node(node) {
Pekka Enbergf30cf7d2006-03-22 00:08:11 -08002090 cachep->nodelists[node] =
2091 kmalloc_node(sizeof(struct kmem_list3),
2092 GFP_KERNEL, node);
2093 BUG_ON(!cachep->nodelists[node]);
2094 kmem_list3_init(cachep->nodelists[node]);
2095 }
2096 }
2097 }
2098 cachep->nodelists[numa_node_id()]->next_reap =
2099 jiffies + REAPTIMEOUT_LIST3 +
2100 ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
2101
2102 cpu_cache_get(cachep)->avail = 0;
2103 cpu_cache_get(cachep)->limit = BOOT_CPUCACHE_ENTRIES;
2104 cpu_cache_get(cachep)->batchcount = 1;
2105 cpu_cache_get(cachep)->touched = 0;
2106 cachep->batchcount = 1;
2107 cachep->limit = BOOT_CPUCACHE_ENTRIES;
Christoph Lameter2ed3a4e2006-09-25 23:31:38 -07002108 return 0;
Pekka Enbergf30cf7d2006-03-22 00:08:11 -08002109}
2110
Pekka Enberg4d268eb2006-01-08 01:00:36 -08002111/**
Linus Torvalds1da177e2005-04-16 15:20:36 -07002112 * kmem_cache_create - Create a cache.
2113 * @name: A string which is used in /proc/slabinfo to identify this cache.
2114 * @size: The size of objects to be created in this cache.
2115 * @align: The required alignment for the objects.
2116 * @flags: SLAB flags
2117 * @ctor: A constructor for the objects.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002118 *
2119 * Returns a ptr to the cache on success, NULL on failure.
2120 * Cannot be called within a int, but can be interrupted.
Paul Mundt20c2df82007-07-20 10:11:58 +09002121 * The @ctor is run when new pages are allocated by the cache.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002122 *
2123 * @name must be valid until the cache is destroyed. This implies that
Andrew Mortona737b3e2006-03-22 00:08:11 -08002124 * the module calling this has to destroy the cache before getting unloaded.
2125 *
Linus Torvalds1da177e2005-04-16 15:20:36 -07002126 * The flags are
2127 *
2128 * %SLAB_POISON - Poison the slab with a known test pattern (a5a5a5a5)
2129 * to catch references to uninitialised memory.
2130 *
2131 * %SLAB_RED_ZONE - Insert `Red' zones around the allocated memory to check
2132 * for buffer overruns.
2133 *
Linus Torvalds1da177e2005-04-16 15:20:36 -07002134 * %SLAB_HWCACHE_ALIGN - Align the objects in this cache to a hardware
2135 * cacheline. This can be beneficial if you're counting cycles as closely
2136 * as davem.
2137 */
Pekka Enberg343e0d72006-02-01 03:05:50 -08002138struct kmem_cache *
Linus Torvalds1da177e2005-04-16 15:20:36 -07002139kmem_cache_create (const char *name, size_t size, size_t align,
Andrew Mortona737b3e2006-03-22 00:08:11 -08002140 unsigned long flags,
Christoph Lameter4ba9b9d2007-10-16 23:25:51 -07002141 void (*ctor)(struct kmem_cache *, void *))
Linus Torvalds1da177e2005-04-16 15:20:36 -07002142{
2143 size_t left_over, slab_size, ralign;
Christoph Hellwig7a7c3812006-06-23 02:03:17 -07002144 struct kmem_cache *cachep = NULL, *pc;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002145
2146 /*
2147 * Sanity checks... these are all serious usage bugs.
2148 */
Andrew Mortona737b3e2006-03-22 00:08:11 -08002149 if (!name || in_interrupt() || (size < BYTES_PER_WORD) ||
Paul Mundt20c2df82007-07-20 10:11:58 +09002150 size > KMALLOC_MAX_SIZE) {
Harvey Harrisond40cee22008-04-30 00:55:07 -07002151 printk(KERN_ERR "%s: Early error in slab %s\n", __func__,
Andrew Mortona737b3e2006-03-22 00:08:11 -08002152 name);
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002153 BUG();
2154 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002155
Ravikiran G Thirumalaif0188f42006-02-10 01:51:13 -08002156 /*
Ravikiran G Thirumalai8f5be202006-12-06 20:32:14 -08002157 * We use cache_chain_mutex to ensure a consistent view of
2158 * cpu_online_map as well. Please see cpuup_callback
Ravikiran G Thirumalaif0188f42006-02-10 01:51:13 -08002159 */
Gautham R Shenoy95402b32008-01-25 21:08:02 +01002160 get_online_cpus();
Ingo Molnarfc0abb12006-01-18 17:42:33 -08002161 mutex_lock(&cache_chain_mutex);
Andrew Morton4f12bb42005-11-07 00:58:00 -08002162
Christoph Hellwig7a7c3812006-06-23 02:03:17 -07002163 list_for_each_entry(pc, &cache_chain, next) {
Andrew Morton4f12bb42005-11-07 00:58:00 -08002164 char tmp;
2165 int res;
2166
2167 /*
2168 * This happens when the module gets unloaded and doesn't
2169 * destroy its slab cache and no-one else reuses the vmalloc
2170 * area of the module. Print a warning.
2171 */
Andrew Morton138ae662006-12-06 20:36:41 -08002172 res = probe_kernel_address(pc->name, tmp);
Andrew Morton4f12bb42005-11-07 00:58:00 -08002173 if (res) {
matzeb4169522007-05-06 14:49:52 -07002174 printk(KERN_ERR
2175 "SLAB: cache with size %d has lost its name\n",
Manfred Spraul3dafccf2006-02-01 03:05:42 -08002176 pc->buffer_size);
Andrew Morton4f12bb42005-11-07 00:58:00 -08002177 continue;
2178 }
2179
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002180 if (!strcmp(pc->name, name)) {
matzeb4169522007-05-06 14:49:52 -07002181 printk(KERN_ERR
2182 "kmem_cache_create: duplicate cache %s\n", name);
Andrew Morton4f12bb42005-11-07 00:58:00 -08002183 dump_stack();
2184 goto oops;
2185 }
2186 }
2187
Linus Torvalds1da177e2005-04-16 15:20:36 -07002188#if DEBUG
2189 WARN_ON(strchr(name, ' ')); /* It confuses parsers */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002190#if FORCED_DEBUG
2191 /*
2192 * Enable redzoning and last user accounting, except for caches with
2193 * large objects, if the increased size would increase the object size
2194 * above the next power of two: caches with object sizes just above a
2195 * power of two have a significant amount of internal fragmentation.
2196 */
David Woodhouse87a927c2007-07-04 21:26:44 -04002197 if (size < 4096 || fls(size - 1) == fls(size-1 + REDZONE_ALIGN +
2198 2 * sizeof(unsigned long long)))
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002199 flags |= SLAB_RED_ZONE | SLAB_STORE_USER;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002200 if (!(flags & SLAB_DESTROY_BY_RCU))
2201 flags |= SLAB_POISON;
2202#endif
2203 if (flags & SLAB_DESTROY_BY_RCU)
2204 BUG_ON(flags & SLAB_POISON);
2205#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07002206 /*
Andrew Mortona737b3e2006-03-22 00:08:11 -08002207 * Always checks flags, a caller might be expecting debug support which
2208 * isn't available.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002209 */
Eric Sesterhenn40094fa2006-04-02 13:49:25 +02002210 BUG_ON(flags & ~CREATE_MASK);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002211
Andrew Mortona737b3e2006-03-22 00:08:11 -08002212 /*
2213 * Check that size is in terms of words. This is needed to avoid
Linus Torvalds1da177e2005-04-16 15:20:36 -07002214 * unaligned accesses for some archs when redzoning is used, and makes
2215 * sure any on-slab bufctl's are also correctly aligned.
2216 */
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002217 if (size & (BYTES_PER_WORD - 1)) {
2218 size += (BYTES_PER_WORD - 1);
2219 size &= ~(BYTES_PER_WORD - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002220 }
2221
Andrew Mortona737b3e2006-03-22 00:08:11 -08002222 /* calculate the final buffer alignment: */
2223
Linus Torvalds1da177e2005-04-16 15:20:36 -07002224 /* 1) arch recommendation: can be overridden for debug */
2225 if (flags & SLAB_HWCACHE_ALIGN) {
Andrew Mortona737b3e2006-03-22 00:08:11 -08002226 /*
2227 * Default alignment: as specified by the arch code. Except if
2228 * an object is really small, then squeeze multiple objects into
2229 * one cacheline.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002230 */
2231 ralign = cache_line_size();
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002232 while (size <= ralign / 2)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002233 ralign /= 2;
2234 } else {
2235 ralign = BYTES_PER_WORD;
2236 }
Pekka Enbergca5f9702006-09-25 23:31:25 -07002237
2238 /*
David Woodhouse87a927c2007-07-04 21:26:44 -04002239 * Redzoning and user store require word alignment or possibly larger.
2240 * Note this will be overridden by architecture or caller mandated
2241 * alignment if either is greater than BYTES_PER_WORD.
Pekka Enbergca5f9702006-09-25 23:31:25 -07002242 */
David Woodhouse87a927c2007-07-04 21:26:44 -04002243 if (flags & SLAB_STORE_USER)
2244 ralign = BYTES_PER_WORD;
2245
2246 if (flags & SLAB_RED_ZONE) {
2247 ralign = REDZONE_ALIGN;
2248 /* If redzoning, ensure that the second redzone is suitably
2249 * aligned, by adjusting the object size accordingly. */
2250 size += REDZONE_ALIGN - 1;
2251 size &= ~(REDZONE_ALIGN - 1);
2252 }
Pekka Enbergca5f9702006-09-25 23:31:25 -07002253
Kevin Hilmana44b56d2006-12-06 20:32:11 -08002254 /* 2) arch mandated alignment */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002255 if (ralign < ARCH_SLAB_MINALIGN) {
2256 ralign = ARCH_SLAB_MINALIGN;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002257 }
Kevin Hilmana44b56d2006-12-06 20:32:11 -08002258 /* 3) caller mandated alignment */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002259 if (ralign < align) {
2260 ralign = align;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002261 }
Kevin Hilmana44b56d2006-12-06 20:32:11 -08002262 /* disable debug if necessary */
David Woodhouseb46b8f12007-05-08 00:22:59 -07002263 if (ralign > __alignof__(unsigned long long))
Kevin Hilmana44b56d2006-12-06 20:32:11 -08002264 flags &= ~(SLAB_RED_ZONE | SLAB_STORE_USER);
Andrew Mortona737b3e2006-03-22 00:08:11 -08002265 /*
Pekka Enbergca5f9702006-09-25 23:31:25 -07002266 * 4) Store it.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002267 */
2268 align = ralign;
2269
2270 /* Get cache's description obj. */
Christoph Lametere94b1762006-12-06 20:33:17 -08002271 cachep = kmem_cache_zalloc(&cache_cache, GFP_KERNEL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002272 if (!cachep)
Andrew Morton4f12bb42005-11-07 00:58:00 -08002273 goto oops;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002274
2275#if DEBUG
Manfred Spraul3dafccf2006-02-01 03:05:42 -08002276 cachep->obj_size = size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002277
Pekka Enbergca5f9702006-09-25 23:31:25 -07002278 /*
2279 * Both debugging options require word-alignment which is calculated
2280 * into align above.
2281 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002282 if (flags & SLAB_RED_ZONE) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002283 /* add space for red zone words */
David Woodhouseb46b8f12007-05-08 00:22:59 -07002284 cachep->obj_offset += sizeof(unsigned long long);
2285 size += 2 * sizeof(unsigned long long);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002286 }
2287 if (flags & SLAB_STORE_USER) {
Pekka Enbergca5f9702006-09-25 23:31:25 -07002288 /* user store requires one word storage behind the end of
David Woodhouse87a927c2007-07-04 21:26:44 -04002289 * the real object. But if the second red zone needs to be
2290 * aligned to 64 bits, we must allow that much space.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002291 */
David Woodhouse87a927c2007-07-04 21:26:44 -04002292 if (flags & SLAB_RED_ZONE)
2293 size += REDZONE_ALIGN;
2294 else
2295 size += BYTES_PER_WORD;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002296 }
2297#if FORCED_DEBUG && defined(CONFIG_DEBUG_PAGEALLOC)
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002298 if (size >= malloc_sizes[INDEX_L3 + 1].cs_size
Manfred Spraul3dafccf2006-02-01 03:05:42 -08002299 && cachep->obj_size > cache_line_size() && size < PAGE_SIZE) {
2300 cachep->obj_offset += PAGE_SIZE - size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002301 size = PAGE_SIZE;
2302 }
2303#endif
2304#endif
2305
Ingo Molnare0a42722006-06-23 02:03:46 -07002306 /*
2307 * Determine if the slab management is 'on' or 'off' slab.
2308 * (bootstrapping cannot cope with offslab caches so don't do
2309 * it too early on.)
2310 */
2311 if ((size >= (PAGE_SIZE >> 3)) && !slab_early_init)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002312 /*
2313 * Size is large, assume best to place the slab management obj
2314 * off-slab (should allow better packing of objs).
2315 */
2316 flags |= CFLGS_OFF_SLAB;
2317
2318 size = ALIGN(size, align);
2319
Linus Torvaldsf78bb8a2006-03-08 10:33:05 -08002320 left_over = calculate_slab_order(cachep, size, align, flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002321
2322 if (!cachep->num) {
matzeb4169522007-05-06 14:49:52 -07002323 printk(KERN_ERR
2324 "kmem_cache_create: couldn't create cache %s.\n", name);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002325 kmem_cache_free(&cache_cache, cachep);
2326 cachep = NULL;
Andrew Morton4f12bb42005-11-07 00:58:00 -08002327 goto oops;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002328 }
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002329 slab_size = ALIGN(cachep->num * sizeof(kmem_bufctl_t)
2330 + sizeof(struct slab), align);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002331
2332 /*
2333 * If the slab has been placed off-slab, and we have enough space then
2334 * move it on-slab. This is at the expense of any extra colouring.
2335 */
2336 if (flags & CFLGS_OFF_SLAB && left_over >= slab_size) {
2337 flags &= ~CFLGS_OFF_SLAB;
2338 left_over -= slab_size;
2339 }
2340
2341 if (flags & CFLGS_OFF_SLAB) {
2342 /* really off slab. No need for manual alignment */
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002343 slab_size =
2344 cachep->num * sizeof(kmem_bufctl_t) + sizeof(struct slab);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002345 }
2346
2347 cachep->colour_off = cache_line_size();
2348 /* Offset must be a multiple of the alignment. */
2349 if (cachep->colour_off < align)
2350 cachep->colour_off = align;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002351 cachep->colour = left_over / cachep->colour_off;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002352 cachep->slab_size = slab_size;
2353 cachep->flags = flags;
2354 cachep->gfpflags = 0;
Christoph Lameter4b51d662007-02-10 01:43:10 -08002355 if (CONFIG_ZONE_DMA_FLAG && (flags & SLAB_CACHE_DMA))
Linus Torvalds1da177e2005-04-16 15:20:36 -07002356 cachep->gfpflags |= GFP_DMA;
Manfred Spraul3dafccf2006-02-01 03:05:42 -08002357 cachep->buffer_size = size;
Eric Dumazet6a2d7a92006-12-13 00:34:27 -08002358 cachep->reciprocal_buffer_size = reciprocal_value(size);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002359
Ravikiran G Thirumalaie5ac9c52006-09-25 23:31:34 -07002360 if (flags & CFLGS_OFF_SLAB) {
Victor Fuscob2d55072005-09-10 00:26:36 -07002361 cachep->slabp_cache = kmem_find_general_cachep(slab_size, 0u);
Ravikiran G Thirumalaie5ac9c52006-09-25 23:31:34 -07002362 /*
2363 * This is a possibility for one of the malloc_sizes caches.
2364 * But since we go off slab only for object size greater than
2365 * PAGE_SIZE/8, and malloc_sizes gets created in ascending order,
2366 * this should not happen at all.
2367 * But leave a BUG_ON for some lucky dude.
2368 */
Christoph Lameter6cb8f912007-07-17 04:03:22 -07002369 BUG_ON(ZERO_OR_NULL_PTR(cachep->slabp_cache));
Ravikiran G Thirumalaie5ac9c52006-09-25 23:31:34 -07002370 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002371 cachep->ctor = ctor;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002372 cachep->name = name;
2373
Christoph Lameter2ed3a4e2006-09-25 23:31:38 -07002374 if (setup_cpu_cache(cachep)) {
2375 __kmem_cache_destroy(cachep);
2376 cachep = NULL;
2377 goto oops;
2378 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002379
Linus Torvalds1da177e2005-04-16 15:20:36 -07002380 /* cache setup completed, link it into the list */
2381 list_add(&cachep->next, &cache_chain);
Andrew Mortona737b3e2006-03-22 00:08:11 -08002382oops:
Linus Torvalds1da177e2005-04-16 15:20:36 -07002383 if (!cachep && (flags & SLAB_PANIC))
2384 panic("kmem_cache_create(): failed to create slab `%s'\n",
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002385 name);
Ingo Molnarfc0abb12006-01-18 17:42:33 -08002386 mutex_unlock(&cache_chain_mutex);
Gautham R Shenoy95402b32008-01-25 21:08:02 +01002387 put_online_cpus();
Linus Torvalds1da177e2005-04-16 15:20:36 -07002388 return cachep;
2389}
2390EXPORT_SYMBOL(kmem_cache_create);
2391
2392#if DEBUG
2393static void check_irq_off(void)
2394{
2395 BUG_ON(!irqs_disabled());
2396}
2397
2398static void check_irq_on(void)
2399{
2400 BUG_ON(irqs_disabled());
2401}
2402
Pekka Enberg343e0d72006-02-01 03:05:50 -08002403static void check_spinlock_acquired(struct kmem_cache *cachep)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002404{
2405#ifdef CONFIG_SMP
2406 check_irq_off();
Christoph Lametere498be72005-09-09 13:03:32 -07002407 assert_spin_locked(&cachep->nodelists[numa_node_id()]->list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002408#endif
2409}
Christoph Lametere498be72005-09-09 13:03:32 -07002410
Pekka Enberg343e0d72006-02-01 03:05:50 -08002411static void check_spinlock_acquired_node(struct kmem_cache *cachep, int node)
Christoph Lametere498be72005-09-09 13:03:32 -07002412{
2413#ifdef CONFIG_SMP
2414 check_irq_off();
2415 assert_spin_locked(&cachep->nodelists[node]->list_lock);
2416#endif
2417}
2418
Linus Torvalds1da177e2005-04-16 15:20:36 -07002419#else
2420#define check_irq_off() do { } while(0)
2421#define check_irq_on() do { } while(0)
2422#define check_spinlock_acquired(x) do { } while(0)
Christoph Lametere498be72005-09-09 13:03:32 -07002423#define check_spinlock_acquired_node(x, y) do { } while(0)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002424#endif
2425
Christoph Lameteraab22072006-03-22 00:09:06 -08002426static void drain_array(struct kmem_cache *cachep, struct kmem_list3 *l3,
2427 struct array_cache *ac,
2428 int force, int node);
2429
Linus Torvalds1da177e2005-04-16 15:20:36 -07002430static void do_drain(void *arg)
2431{
Andrew Mortona737b3e2006-03-22 00:08:11 -08002432 struct kmem_cache *cachep = arg;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002433 struct array_cache *ac;
Christoph Lameterff694162005-09-22 21:44:02 -07002434 int node = numa_node_id();
Linus Torvalds1da177e2005-04-16 15:20:36 -07002435
2436 check_irq_off();
Pekka Enberg9a2dba42006-02-01 03:05:49 -08002437 ac = cpu_cache_get(cachep);
Christoph Lameterff694162005-09-22 21:44:02 -07002438 spin_lock(&cachep->nodelists[node]->list_lock);
2439 free_block(cachep, ac->entry, ac->avail, node);
2440 spin_unlock(&cachep->nodelists[node]->list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002441 ac->avail = 0;
2442}
2443
Pekka Enberg343e0d72006-02-01 03:05:50 -08002444static void drain_cpu_caches(struct kmem_cache *cachep)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002445{
Christoph Lametere498be72005-09-09 13:03:32 -07002446 struct kmem_list3 *l3;
2447 int node;
2448
Jens Axboe15c8b6c2008-05-09 09:39:44 +02002449 on_each_cpu(do_drain, cachep, 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002450 check_irq_on();
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002451 for_each_online_node(node) {
Christoph Lametere498be72005-09-09 13:03:32 -07002452 l3 = cachep->nodelists[node];
Roland Dreiera4523a82006-05-15 11:41:00 -07002453 if (l3 && l3->alien)
2454 drain_alien_cache(cachep, l3->alien);
2455 }
2456
2457 for_each_online_node(node) {
2458 l3 = cachep->nodelists[node];
2459 if (l3)
Christoph Lameteraab22072006-03-22 00:09:06 -08002460 drain_array(cachep, l3, l3->shared, 1, node);
Christoph Lametere498be72005-09-09 13:03:32 -07002461 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002462}
2463
Christoph Lametered11d9e2006-06-30 01:55:45 -07002464/*
2465 * Remove slabs from the list of free slabs.
2466 * Specify the number of slabs to drain in tofree.
2467 *
2468 * Returns the actual number of slabs released.
2469 */
2470static int drain_freelist(struct kmem_cache *cache,
2471 struct kmem_list3 *l3, int tofree)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002472{
Christoph Lametered11d9e2006-06-30 01:55:45 -07002473 struct list_head *p;
2474 int nr_freed;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002475 struct slab *slabp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002476
Christoph Lametered11d9e2006-06-30 01:55:45 -07002477 nr_freed = 0;
2478 while (nr_freed < tofree && !list_empty(&l3->slabs_free)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002479
Christoph Lametered11d9e2006-06-30 01:55:45 -07002480 spin_lock_irq(&l3->list_lock);
Christoph Lametere498be72005-09-09 13:03:32 -07002481 p = l3->slabs_free.prev;
Christoph Lametered11d9e2006-06-30 01:55:45 -07002482 if (p == &l3->slabs_free) {
2483 spin_unlock_irq(&l3->list_lock);
2484 goto out;
2485 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002486
Christoph Lametered11d9e2006-06-30 01:55:45 -07002487 slabp = list_entry(p, struct slab, list);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002488#if DEBUG
Eric Sesterhenn40094fa2006-04-02 13:49:25 +02002489 BUG_ON(slabp->inuse);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002490#endif
2491 list_del(&slabp->list);
Christoph Lametered11d9e2006-06-30 01:55:45 -07002492 /*
2493 * Safe to drop the lock. The slab is no longer linked
2494 * to the cache.
2495 */
2496 l3->free_objects -= cache->num;
Christoph Lametere498be72005-09-09 13:03:32 -07002497 spin_unlock_irq(&l3->list_lock);
Christoph Lametered11d9e2006-06-30 01:55:45 -07002498 slab_destroy(cache, slabp);
2499 nr_freed++;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002500 }
Christoph Lametered11d9e2006-06-30 01:55:45 -07002501out:
2502 return nr_freed;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002503}
2504
Ravikiran G Thirumalai8f5be202006-12-06 20:32:14 -08002505/* Called with cache_chain_mutex held to protect against cpu hotplug */
Pekka Enberg343e0d72006-02-01 03:05:50 -08002506static int __cache_shrink(struct kmem_cache *cachep)
Christoph Lametere498be72005-09-09 13:03:32 -07002507{
2508 int ret = 0, i = 0;
2509 struct kmem_list3 *l3;
2510
2511 drain_cpu_caches(cachep);
2512
2513 check_irq_on();
2514 for_each_online_node(i) {
2515 l3 = cachep->nodelists[i];
Christoph Lametered11d9e2006-06-30 01:55:45 -07002516 if (!l3)
2517 continue;
2518
2519 drain_freelist(cachep, l3, l3->free_objects);
2520
2521 ret += !list_empty(&l3->slabs_full) ||
2522 !list_empty(&l3->slabs_partial);
Christoph Lametere498be72005-09-09 13:03:32 -07002523 }
2524 return (ret ? 1 : 0);
2525}
2526
Linus Torvalds1da177e2005-04-16 15:20:36 -07002527/**
2528 * kmem_cache_shrink - Shrink a cache.
2529 * @cachep: The cache to shrink.
2530 *
2531 * Releases as many slabs as possible for a cache.
2532 * To help debugging, a zero exit status indicates all slabs were released.
2533 */
Pekka Enberg343e0d72006-02-01 03:05:50 -08002534int kmem_cache_shrink(struct kmem_cache *cachep)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002535{
Ravikiran G Thirumalai8f5be202006-12-06 20:32:14 -08002536 int ret;
Eric Sesterhenn40094fa2006-04-02 13:49:25 +02002537 BUG_ON(!cachep || in_interrupt());
Linus Torvalds1da177e2005-04-16 15:20:36 -07002538
Gautham R Shenoy95402b32008-01-25 21:08:02 +01002539 get_online_cpus();
Ravikiran G Thirumalai8f5be202006-12-06 20:32:14 -08002540 mutex_lock(&cache_chain_mutex);
2541 ret = __cache_shrink(cachep);
2542 mutex_unlock(&cache_chain_mutex);
Gautham R Shenoy95402b32008-01-25 21:08:02 +01002543 put_online_cpus();
Ravikiran G Thirumalai8f5be202006-12-06 20:32:14 -08002544 return ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002545}
2546EXPORT_SYMBOL(kmem_cache_shrink);
2547
2548/**
2549 * kmem_cache_destroy - delete a cache
2550 * @cachep: the cache to destroy
2551 *
Robert P. J. Day72fd4a32007-02-10 01:45:59 -08002552 * Remove a &struct kmem_cache object from the slab cache.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002553 *
2554 * It is expected this function will be called by a module when it is
2555 * unloaded. This will remove the cache completely, and avoid a duplicate
2556 * cache being allocated each time a module is loaded and unloaded, if the
2557 * module doesn't have persistent in-kernel storage across loads and unloads.
2558 *
2559 * The cache must be empty before calling this function.
2560 *
2561 * The caller must guarantee that noone will allocate memory from the cache
2562 * during the kmem_cache_destroy().
2563 */
Alexey Dobriyan133d2052006-09-27 01:49:41 -07002564void kmem_cache_destroy(struct kmem_cache *cachep)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002565{
Eric Sesterhenn40094fa2006-04-02 13:49:25 +02002566 BUG_ON(!cachep || in_interrupt());
Linus Torvalds1da177e2005-04-16 15:20:36 -07002567
Linus Torvalds1da177e2005-04-16 15:20:36 -07002568 /* Find the cache in the chain of caches. */
Gautham R Shenoy95402b32008-01-25 21:08:02 +01002569 get_online_cpus();
Ingo Molnarfc0abb12006-01-18 17:42:33 -08002570 mutex_lock(&cache_chain_mutex);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002571 /*
2572 * the chain is never empty, cache_cache is never destroyed
2573 */
2574 list_del(&cachep->next);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002575 if (__cache_shrink(cachep)) {
2576 slab_error(cachep, "Can't free all objects");
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002577 list_add(&cachep->next, &cache_chain);
Ingo Molnarfc0abb12006-01-18 17:42:33 -08002578 mutex_unlock(&cache_chain_mutex);
Gautham R Shenoy95402b32008-01-25 21:08:02 +01002579 put_online_cpus();
Alexey Dobriyan133d2052006-09-27 01:49:41 -07002580 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002581 }
2582
2583 if (unlikely(cachep->flags & SLAB_DESTROY_BY_RCU))
Paul E. McKenneyfbd568a3e2005-05-01 08:59:04 -07002584 synchronize_rcu();
Linus Torvalds1da177e2005-04-16 15:20:36 -07002585
Christoph Lameter117f6eb2006-09-25 23:31:37 -07002586 __kmem_cache_destroy(cachep);
Ravikiran G Thirumalai8f5be202006-12-06 20:32:14 -08002587 mutex_unlock(&cache_chain_mutex);
Gautham R Shenoy95402b32008-01-25 21:08:02 +01002588 put_online_cpus();
Linus Torvalds1da177e2005-04-16 15:20:36 -07002589}
2590EXPORT_SYMBOL(kmem_cache_destroy);
2591
Ravikiran G Thirumalaie5ac9c52006-09-25 23:31:34 -07002592/*
2593 * Get the memory for a slab management obj.
2594 * For a slab cache when the slab descriptor is off-slab, slab descriptors
2595 * always come from malloc_sizes caches. The slab descriptor cannot
2596 * come from the same cache which is getting created because,
2597 * when we are searching for an appropriate cache for these
2598 * descriptors in kmem_cache_create, we search through the malloc_sizes array.
2599 * If we are creating a malloc_sizes cache here it would not be visible to
2600 * kmem_find_general_cachep till the initialization is complete.
2601 * Hence we cannot have slabp_cache same as the original cache.
2602 */
Pekka Enberg343e0d72006-02-01 03:05:50 -08002603static struct slab *alloc_slabmgmt(struct kmem_cache *cachep, void *objp,
Ravikiran G Thirumalai5b74ada2006-04-10 22:52:53 -07002604 int colour_off, gfp_t local_flags,
2605 int nodeid)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002606{
2607 struct slab *slabp;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002608
Linus Torvalds1da177e2005-04-16 15:20:36 -07002609 if (OFF_SLAB(cachep)) {
2610 /* Slab management obj is off-slab. */
Ravikiran G Thirumalai5b74ada2006-04-10 22:52:53 -07002611 slabp = kmem_cache_alloc_node(cachep->slabp_cache,
Christoph Lameter3c517a62006-12-06 20:33:29 -08002612 local_flags & ~GFP_THISNODE, nodeid);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002613 if (!slabp)
2614 return NULL;
2615 } else {
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002616 slabp = objp + colour_off;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002617 colour_off += cachep->slab_size;
2618 }
2619 slabp->inuse = 0;
2620 slabp->colouroff = colour_off;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002621 slabp->s_mem = objp + colour_off;
Ravikiran G Thirumalai5b74ada2006-04-10 22:52:53 -07002622 slabp->nodeid = nodeid;
Marcin Slusarze51bfd02008-02-10 11:21:54 +01002623 slabp->free = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002624 return slabp;
2625}
2626
2627static inline kmem_bufctl_t *slab_bufctl(struct slab *slabp)
2628{
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002629 return (kmem_bufctl_t *) (slabp + 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002630}
2631
Pekka Enberg343e0d72006-02-01 03:05:50 -08002632static void cache_init_objs(struct kmem_cache *cachep,
Christoph Lametera35afb82007-05-16 22:10:57 -07002633 struct slab *slabp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002634{
2635 int i;
2636
2637 for (i = 0; i < cachep->num; i++) {
Pekka Enberg8fea4e92006-03-22 00:08:10 -08002638 void *objp = index_to_obj(cachep, slabp, i);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002639#if DEBUG
2640 /* need to poison the objs? */
2641 if (cachep->flags & SLAB_POISON)
2642 poison_obj(cachep, objp, POISON_FREE);
2643 if (cachep->flags & SLAB_STORE_USER)
2644 *dbg_userword(cachep, objp) = NULL;
2645
2646 if (cachep->flags & SLAB_RED_ZONE) {
2647 *dbg_redzone1(cachep, objp) = RED_INACTIVE;
2648 *dbg_redzone2(cachep, objp) = RED_INACTIVE;
2649 }
2650 /*
Andrew Mortona737b3e2006-03-22 00:08:11 -08002651 * Constructors are not allowed to allocate memory from the same
2652 * cache which they are a constructor for. Otherwise, deadlock.
2653 * They must also be threaded.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002654 */
2655 if (cachep->ctor && !(cachep->flags & SLAB_POISON))
Christoph Lameter4ba9b9d2007-10-16 23:25:51 -07002656 cachep->ctor(cachep, objp + obj_offset(cachep));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002657
2658 if (cachep->flags & SLAB_RED_ZONE) {
2659 if (*dbg_redzone2(cachep, objp) != RED_INACTIVE)
2660 slab_error(cachep, "constructor overwrote the"
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002661 " end of an object");
Linus Torvalds1da177e2005-04-16 15:20:36 -07002662 if (*dbg_redzone1(cachep, objp) != RED_INACTIVE)
2663 slab_error(cachep, "constructor overwrote the"
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002664 " start of an object");
Linus Torvalds1da177e2005-04-16 15:20:36 -07002665 }
Andrew Mortona737b3e2006-03-22 00:08:11 -08002666 if ((cachep->buffer_size % PAGE_SIZE) == 0 &&
2667 OFF_SLAB(cachep) && cachep->flags & SLAB_POISON)
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002668 kernel_map_pages(virt_to_page(objp),
Manfred Spraul3dafccf2006-02-01 03:05:42 -08002669 cachep->buffer_size / PAGE_SIZE, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002670#else
2671 if (cachep->ctor)
Christoph Lameter4ba9b9d2007-10-16 23:25:51 -07002672 cachep->ctor(cachep, objp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002673#endif
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002674 slab_bufctl(slabp)[i] = i + 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002675 }
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002676 slab_bufctl(slabp)[i - 1] = BUFCTL_END;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002677}
2678
Pekka Enberg343e0d72006-02-01 03:05:50 -08002679static void kmem_flagcheck(struct kmem_cache *cachep, gfp_t flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002680{
Christoph Lameter4b51d662007-02-10 01:43:10 -08002681 if (CONFIG_ZONE_DMA_FLAG) {
2682 if (flags & GFP_DMA)
2683 BUG_ON(!(cachep->gfpflags & GFP_DMA));
2684 else
2685 BUG_ON(cachep->gfpflags & GFP_DMA);
2686 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002687}
2688
Andrew Mortona737b3e2006-03-22 00:08:11 -08002689static void *slab_get_obj(struct kmem_cache *cachep, struct slab *slabp,
2690 int nodeid)
Matthew Dobson78d382d2006-02-01 03:05:47 -08002691{
Pekka Enberg8fea4e92006-03-22 00:08:10 -08002692 void *objp = index_to_obj(cachep, slabp, slabp->free);
Matthew Dobson78d382d2006-02-01 03:05:47 -08002693 kmem_bufctl_t next;
2694
2695 slabp->inuse++;
2696 next = slab_bufctl(slabp)[slabp->free];
2697#if DEBUG
2698 slab_bufctl(slabp)[slabp->free] = BUFCTL_FREE;
2699 WARN_ON(slabp->nodeid != nodeid);
2700#endif
2701 slabp->free = next;
2702
2703 return objp;
2704}
2705
Andrew Mortona737b3e2006-03-22 00:08:11 -08002706static void slab_put_obj(struct kmem_cache *cachep, struct slab *slabp,
2707 void *objp, int nodeid)
Matthew Dobson78d382d2006-02-01 03:05:47 -08002708{
Pekka Enberg8fea4e92006-03-22 00:08:10 -08002709 unsigned int objnr = obj_to_index(cachep, slabp, objp);
Matthew Dobson78d382d2006-02-01 03:05:47 -08002710
2711#if DEBUG
2712 /* Verify that the slab belongs to the intended node */
2713 WARN_ON(slabp->nodeid != nodeid);
2714
Al Viro871751e2006-03-25 03:06:39 -08002715 if (slab_bufctl(slabp)[objnr] + 1 <= SLAB_LIMIT + 1) {
Matthew Dobson78d382d2006-02-01 03:05:47 -08002716 printk(KERN_ERR "slab: double free detected in cache "
Andrew Mortona737b3e2006-03-22 00:08:11 -08002717 "'%s', objp %p\n", cachep->name, objp);
Matthew Dobson78d382d2006-02-01 03:05:47 -08002718 BUG();
2719 }
2720#endif
2721 slab_bufctl(slabp)[objnr] = slabp->free;
2722 slabp->free = objnr;
2723 slabp->inuse--;
2724}
2725
Pekka Enberg47768742006-06-23 02:03:07 -07002726/*
2727 * Map pages beginning at addr to the given cache and slab. This is required
2728 * for the slab allocator to be able to lookup the cache and slab of a
2729 * virtual address for kfree, ksize, kmem_ptr_validate, and slab debugging.
2730 */
2731static void slab_map_pages(struct kmem_cache *cache, struct slab *slab,
2732 void *addr)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002733{
Pekka Enberg47768742006-06-23 02:03:07 -07002734 int nr_pages;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002735 struct page *page;
2736
Pekka Enberg47768742006-06-23 02:03:07 -07002737 page = virt_to_page(addr);
Nick Piggin84097512006-03-22 00:08:34 -08002738
Pekka Enberg47768742006-06-23 02:03:07 -07002739 nr_pages = 1;
Nick Piggin84097512006-03-22 00:08:34 -08002740 if (likely(!PageCompound(page)))
Pekka Enberg47768742006-06-23 02:03:07 -07002741 nr_pages <<= cache->gfporder;
2742
Linus Torvalds1da177e2005-04-16 15:20:36 -07002743 do {
Pekka Enberg47768742006-06-23 02:03:07 -07002744 page_set_cache(page, cache);
2745 page_set_slab(page, slab);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002746 page++;
Pekka Enberg47768742006-06-23 02:03:07 -07002747 } while (--nr_pages);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002748}
2749
2750/*
2751 * Grow (by 1) the number of slabs within a cache. This is called by
2752 * kmem_cache_alloc() when there are no active objs left in a cache.
2753 */
Christoph Lameter3c517a62006-12-06 20:33:29 -08002754static int cache_grow(struct kmem_cache *cachep,
2755 gfp_t flags, int nodeid, void *objp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002756{
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002757 struct slab *slabp;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002758 size_t offset;
2759 gfp_t local_flags;
Christoph Lametere498be72005-09-09 13:03:32 -07002760 struct kmem_list3 *l3;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002761
Andrew Mortona737b3e2006-03-22 00:08:11 -08002762 /*
2763 * Be lazy and only check for valid flags here, keeping it out of the
2764 * critical path in kmem_cache_alloc().
Linus Torvalds1da177e2005-04-16 15:20:36 -07002765 */
Christoph Lameter6cb06222007-10-16 01:25:41 -07002766 BUG_ON(flags & GFP_SLAB_BUG_MASK);
2767 local_flags = flags & (GFP_CONSTRAINT_MASK|GFP_RECLAIM_MASK);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002768
Ravikiran G Thirumalai2e1217c2006-02-04 23:27:56 -08002769 /* Take the l3 list lock to change the colour_next on this node */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002770 check_irq_off();
Ravikiran G Thirumalai2e1217c2006-02-04 23:27:56 -08002771 l3 = cachep->nodelists[nodeid];
2772 spin_lock(&l3->list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002773
2774 /* Get colour for the slab, and cal the next value. */
Ravikiran G Thirumalai2e1217c2006-02-04 23:27:56 -08002775 offset = l3->colour_next;
2776 l3->colour_next++;
2777 if (l3->colour_next >= cachep->colour)
2778 l3->colour_next = 0;
2779 spin_unlock(&l3->list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002780
Ravikiran G Thirumalai2e1217c2006-02-04 23:27:56 -08002781 offset *= cachep->colour_off;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002782
2783 if (local_flags & __GFP_WAIT)
2784 local_irq_enable();
2785
2786 /*
2787 * The test for missing atomic flag is performed here, rather than
2788 * the more obvious place, simply to reduce the critical path length
2789 * in kmem_cache_alloc(). If a caller is seriously mis-behaving they
2790 * will eventually be caught here (where it matters).
2791 */
2792 kmem_flagcheck(cachep, flags);
2793
Andrew Mortona737b3e2006-03-22 00:08:11 -08002794 /*
2795 * Get mem for the objs. Attempt to allocate a physical page from
2796 * 'nodeid'.
Christoph Lametere498be72005-09-09 13:03:32 -07002797 */
Christoph Lameter3c517a62006-12-06 20:33:29 -08002798 if (!objp)
Andrew Mortonb8c1c5d2007-07-24 12:02:40 -07002799 objp = kmem_getpages(cachep, local_flags, nodeid);
Andrew Mortona737b3e2006-03-22 00:08:11 -08002800 if (!objp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002801 goto failed;
2802
2803 /* Get slab management. */
Christoph Lameter3c517a62006-12-06 20:33:29 -08002804 slabp = alloc_slabmgmt(cachep, objp, offset,
Christoph Lameter6cb06222007-10-16 01:25:41 -07002805 local_flags & ~GFP_CONSTRAINT_MASK, nodeid);
Andrew Mortona737b3e2006-03-22 00:08:11 -08002806 if (!slabp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002807 goto opps1;
2808
Pekka Enberg47768742006-06-23 02:03:07 -07002809 slab_map_pages(cachep, slabp, objp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002810
Christoph Lametera35afb82007-05-16 22:10:57 -07002811 cache_init_objs(cachep, slabp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002812
2813 if (local_flags & __GFP_WAIT)
2814 local_irq_disable();
2815 check_irq_off();
Christoph Lametere498be72005-09-09 13:03:32 -07002816 spin_lock(&l3->list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002817
2818 /* Make slab active. */
Christoph Lametere498be72005-09-09 13:03:32 -07002819 list_add_tail(&slabp->list, &(l3->slabs_free));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002820 STATS_INC_GROWN(cachep);
Christoph Lametere498be72005-09-09 13:03:32 -07002821 l3->free_objects += cachep->num;
2822 spin_unlock(&l3->list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002823 return 1;
Andrew Mortona737b3e2006-03-22 00:08:11 -08002824opps1:
Linus Torvalds1da177e2005-04-16 15:20:36 -07002825 kmem_freepages(cachep, objp);
Andrew Mortona737b3e2006-03-22 00:08:11 -08002826failed:
Linus Torvalds1da177e2005-04-16 15:20:36 -07002827 if (local_flags & __GFP_WAIT)
2828 local_irq_disable();
2829 return 0;
2830}
2831
2832#if DEBUG
2833
2834/*
2835 * Perform extra freeing checks:
2836 * - detect bad pointers.
2837 * - POISON/RED_ZONE checking
Linus Torvalds1da177e2005-04-16 15:20:36 -07002838 */
2839static void kfree_debugcheck(const void *objp)
2840{
Linus Torvalds1da177e2005-04-16 15:20:36 -07002841 if (!virt_addr_valid(objp)) {
2842 printk(KERN_ERR "kfree_debugcheck: out of range ptr %lxh.\n",
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002843 (unsigned long)objp);
2844 BUG();
Linus Torvalds1da177e2005-04-16 15:20:36 -07002845 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002846}
2847
Pekka Enberg58ce1fd2006-06-23 02:03:24 -07002848static inline void verify_redzone_free(struct kmem_cache *cache, void *obj)
2849{
David Woodhouseb46b8f12007-05-08 00:22:59 -07002850 unsigned long long redzone1, redzone2;
Pekka Enberg58ce1fd2006-06-23 02:03:24 -07002851
2852 redzone1 = *dbg_redzone1(cache, obj);
2853 redzone2 = *dbg_redzone2(cache, obj);
2854
2855 /*
2856 * Redzone is ok.
2857 */
2858 if (redzone1 == RED_ACTIVE && redzone2 == RED_ACTIVE)
2859 return;
2860
2861 if (redzone1 == RED_INACTIVE && redzone2 == RED_INACTIVE)
2862 slab_error(cache, "double free detected");
2863 else
2864 slab_error(cache, "memory outside object was overwritten");
2865
David Woodhouseb46b8f12007-05-08 00:22:59 -07002866 printk(KERN_ERR "%p: redzone 1:0x%llx, redzone 2:0x%llx.\n",
Pekka Enberg58ce1fd2006-06-23 02:03:24 -07002867 obj, redzone1, redzone2);
2868}
2869
Pekka Enberg343e0d72006-02-01 03:05:50 -08002870static void *cache_free_debugcheck(struct kmem_cache *cachep, void *objp,
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002871 void *caller)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002872{
2873 struct page *page;
2874 unsigned int objnr;
2875 struct slab *slabp;
2876
Matthew Wilcox80cbd912007-11-29 12:05:13 -07002877 BUG_ON(virt_to_cache(objp) != cachep);
2878
Manfred Spraul3dafccf2006-02-01 03:05:42 -08002879 objp -= obj_offset(cachep);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002880 kfree_debugcheck(objp);
Christoph Lameterb49af682007-05-06 14:49:41 -07002881 page = virt_to_head_page(objp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002882
Pekka Enberg065d41c2005-11-13 16:06:46 -08002883 slabp = page_get_slab(page);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002884
2885 if (cachep->flags & SLAB_RED_ZONE) {
Pekka Enberg58ce1fd2006-06-23 02:03:24 -07002886 verify_redzone_free(cachep, objp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002887 *dbg_redzone1(cachep, objp) = RED_INACTIVE;
2888 *dbg_redzone2(cachep, objp) = RED_INACTIVE;
2889 }
2890 if (cachep->flags & SLAB_STORE_USER)
2891 *dbg_userword(cachep, objp) = caller;
2892
Pekka Enberg8fea4e92006-03-22 00:08:10 -08002893 objnr = obj_to_index(cachep, slabp, objp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002894
2895 BUG_ON(objnr >= cachep->num);
Pekka Enberg8fea4e92006-03-22 00:08:10 -08002896 BUG_ON(objp != index_to_obj(cachep, slabp, objnr));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002897
Al Viro871751e2006-03-25 03:06:39 -08002898#ifdef CONFIG_DEBUG_SLAB_LEAK
2899 slab_bufctl(slabp)[objnr] = BUFCTL_FREE;
2900#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07002901 if (cachep->flags & SLAB_POISON) {
2902#ifdef CONFIG_DEBUG_PAGEALLOC
Andrew Mortona737b3e2006-03-22 00:08:11 -08002903 if ((cachep->buffer_size % PAGE_SIZE)==0 && OFF_SLAB(cachep)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002904 store_stackinfo(cachep, objp, (unsigned long)caller);
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002905 kernel_map_pages(virt_to_page(objp),
Manfred Spraul3dafccf2006-02-01 03:05:42 -08002906 cachep->buffer_size / PAGE_SIZE, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002907 } else {
2908 poison_obj(cachep, objp, POISON_FREE);
2909 }
2910#else
2911 poison_obj(cachep, objp, POISON_FREE);
2912#endif
2913 }
2914 return objp;
2915}
2916
Pekka Enberg343e0d72006-02-01 03:05:50 -08002917static void check_slabp(struct kmem_cache *cachep, struct slab *slabp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002918{
2919 kmem_bufctl_t i;
2920 int entries = 0;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002921
Linus Torvalds1da177e2005-04-16 15:20:36 -07002922 /* Check slab's freelist to see if this obj is there. */
2923 for (i = slabp->free; i != BUFCTL_END; i = slab_bufctl(slabp)[i]) {
2924 entries++;
2925 if (entries > cachep->num || i >= cachep->num)
2926 goto bad;
2927 }
2928 if (entries != cachep->num - slabp->inuse) {
Andrew Mortona737b3e2006-03-22 00:08:11 -08002929bad:
2930 printk(KERN_ERR "slab: Internal list corruption detected in "
2931 "cache '%s'(%d), slabp %p(%d). Hexdump:\n",
2932 cachep->name, cachep->num, slabp, slabp->inuse);
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002933 for (i = 0;
Linus Torvalds264132b2006-03-06 12:10:07 -08002934 i < sizeof(*slabp) + cachep->num * sizeof(kmem_bufctl_t);
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002935 i++) {
Andrew Mortona737b3e2006-03-22 00:08:11 -08002936 if (i % 16 == 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002937 printk("\n%03x:", i);
Pekka Enbergb28a02d2006-01-08 01:00:37 -08002938 printk(" %02x", ((unsigned char *)slabp)[i]);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002939 }
2940 printk("\n");
2941 BUG();
2942 }
2943}
2944#else
2945#define kfree_debugcheck(x) do { } while(0)
2946#define cache_free_debugcheck(x,objp,z) (objp)
2947#define check_slabp(x,y) do { } while(0)
2948#endif
2949
Pekka Enberg343e0d72006-02-01 03:05:50 -08002950static void *cache_alloc_refill(struct kmem_cache *cachep, gfp_t flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002951{
2952 int batchcount;
2953 struct kmem_list3 *l3;
2954 struct array_cache *ac;
Pekka Enberg1ca4cb22006-10-06 00:43:52 -07002955 int node;
2956
Andrew Mortona737b3e2006-03-22 00:08:11 -08002957retry:
Joe Korty6d2144d2008-03-05 15:04:59 -08002958 check_irq_off();
2959 node = numa_node_id();
2960 ac = cpu_cache_get(cachep);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002961 batchcount = ac->batchcount;
2962 if (!ac->touched && batchcount > BATCHREFILL_LIMIT) {
Andrew Mortona737b3e2006-03-22 00:08:11 -08002963 /*
2964 * If there was little recent activity on this cache, then
2965 * perform only a partial refill. Otherwise we could generate
2966 * refill bouncing.
Linus Torvalds1da177e2005-04-16 15:20:36 -07002967 */
2968 batchcount = BATCHREFILL_LIMIT;
2969 }
Pekka Enberg1ca4cb22006-10-06 00:43:52 -07002970 l3 = cachep->nodelists[node];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002971
Christoph Lametere498be72005-09-09 13:03:32 -07002972 BUG_ON(ac->avail > 0 || !l3);
2973 spin_lock(&l3->list_lock);
2974
Christoph Lameter3ded1752006-03-25 03:06:44 -08002975 /* See if we can refill from the shared array */
2976 if (l3->shared && transfer_objects(ac, l3->shared, batchcount))
2977 goto alloc_done;
2978
Linus Torvalds1da177e2005-04-16 15:20:36 -07002979 while (batchcount > 0) {
2980 struct list_head *entry;
2981 struct slab *slabp;
2982 /* Get slab alloc is to come from. */
2983 entry = l3->slabs_partial.next;
2984 if (entry == &l3->slabs_partial) {
2985 l3->free_touched = 1;
2986 entry = l3->slabs_free.next;
2987 if (entry == &l3->slabs_free)
2988 goto must_grow;
2989 }
2990
2991 slabp = list_entry(entry, struct slab, list);
2992 check_slabp(cachep, slabp);
2993 check_spinlock_acquired(cachep);
Pekka Enberg714b8172007-05-06 14:49:03 -07002994
2995 /*
2996 * The slab was either on partial or free list so
2997 * there must be at least one object available for
2998 * allocation.
2999 */
3000 BUG_ON(slabp->inuse < 0 || slabp->inuse >= cachep->num);
3001
Linus Torvalds1da177e2005-04-16 15:20:36 -07003002 while (slabp->inuse < cachep->num && batchcount--) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07003003 STATS_INC_ALLOCED(cachep);
3004 STATS_INC_ACTIVE(cachep);
3005 STATS_SET_HIGH(cachep);
3006
Matthew Dobson78d382d2006-02-01 03:05:47 -08003007 ac->entry[ac->avail++] = slab_get_obj(cachep, slabp,
Pekka Enberg1ca4cb22006-10-06 00:43:52 -07003008 node);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003009 }
3010 check_slabp(cachep, slabp);
3011
3012 /* move slabp to correct slabp list: */
3013 list_del(&slabp->list);
3014 if (slabp->free == BUFCTL_END)
3015 list_add(&slabp->list, &l3->slabs_full);
3016 else
3017 list_add(&slabp->list, &l3->slabs_partial);
3018 }
3019
Andrew Mortona737b3e2006-03-22 00:08:11 -08003020must_grow:
Linus Torvalds1da177e2005-04-16 15:20:36 -07003021 l3->free_objects -= ac->avail;
Andrew Mortona737b3e2006-03-22 00:08:11 -08003022alloc_done:
Christoph Lametere498be72005-09-09 13:03:32 -07003023 spin_unlock(&l3->list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003024
3025 if (unlikely(!ac->avail)) {
3026 int x;
Christoph Lameter3c517a62006-12-06 20:33:29 -08003027 x = cache_grow(cachep, flags | GFP_THISNODE, node, NULL);
Christoph Lametere498be72005-09-09 13:03:32 -07003028
Andrew Mortona737b3e2006-03-22 00:08:11 -08003029 /* cache_grow can reenable interrupts, then ac could change. */
Pekka Enberg9a2dba42006-02-01 03:05:49 -08003030 ac = cpu_cache_get(cachep);
Andrew Mortona737b3e2006-03-22 00:08:11 -08003031 if (!x && ac->avail == 0) /* no objects in sight? abort */
Linus Torvalds1da177e2005-04-16 15:20:36 -07003032 return NULL;
3033
Andrew Mortona737b3e2006-03-22 00:08:11 -08003034 if (!ac->avail) /* objects refilled by interrupt? */
Linus Torvalds1da177e2005-04-16 15:20:36 -07003035 goto retry;
3036 }
3037 ac->touched = 1;
Christoph Lametere498be72005-09-09 13:03:32 -07003038 return ac->entry[--ac->avail];
Linus Torvalds1da177e2005-04-16 15:20:36 -07003039}
3040
Andrew Mortona737b3e2006-03-22 00:08:11 -08003041static inline void cache_alloc_debugcheck_before(struct kmem_cache *cachep,
3042 gfp_t flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003043{
3044 might_sleep_if(flags & __GFP_WAIT);
3045#if DEBUG
3046 kmem_flagcheck(cachep, flags);
3047#endif
3048}
3049
3050#if DEBUG
Andrew Mortona737b3e2006-03-22 00:08:11 -08003051static void *cache_alloc_debugcheck_after(struct kmem_cache *cachep,
3052 gfp_t flags, void *objp, void *caller)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003053{
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003054 if (!objp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003055 return objp;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003056 if (cachep->flags & SLAB_POISON) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07003057#ifdef CONFIG_DEBUG_PAGEALLOC
Manfred Spraul3dafccf2006-02-01 03:05:42 -08003058 if ((cachep->buffer_size % PAGE_SIZE) == 0 && OFF_SLAB(cachep))
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003059 kernel_map_pages(virt_to_page(objp),
Manfred Spraul3dafccf2006-02-01 03:05:42 -08003060 cachep->buffer_size / PAGE_SIZE, 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003061 else
3062 check_poison_obj(cachep, objp);
3063#else
3064 check_poison_obj(cachep, objp);
3065#endif
3066 poison_obj(cachep, objp, POISON_INUSE);
3067 }
3068 if (cachep->flags & SLAB_STORE_USER)
3069 *dbg_userword(cachep, objp) = caller;
3070
3071 if (cachep->flags & SLAB_RED_ZONE) {
Andrew Mortona737b3e2006-03-22 00:08:11 -08003072 if (*dbg_redzone1(cachep, objp) != RED_INACTIVE ||
3073 *dbg_redzone2(cachep, objp) != RED_INACTIVE) {
3074 slab_error(cachep, "double free, or memory outside"
3075 " object was overwritten");
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003076 printk(KERN_ERR
David Woodhouseb46b8f12007-05-08 00:22:59 -07003077 "%p: redzone 1:0x%llx, redzone 2:0x%llx\n",
Andrew Mortona737b3e2006-03-22 00:08:11 -08003078 objp, *dbg_redzone1(cachep, objp),
3079 *dbg_redzone2(cachep, objp));
Linus Torvalds1da177e2005-04-16 15:20:36 -07003080 }
3081 *dbg_redzone1(cachep, objp) = RED_ACTIVE;
3082 *dbg_redzone2(cachep, objp) = RED_ACTIVE;
3083 }
Al Viro871751e2006-03-25 03:06:39 -08003084#ifdef CONFIG_DEBUG_SLAB_LEAK
3085 {
3086 struct slab *slabp;
3087 unsigned objnr;
3088
Christoph Lameterb49af682007-05-06 14:49:41 -07003089 slabp = page_get_slab(virt_to_head_page(objp));
Al Viro871751e2006-03-25 03:06:39 -08003090 objnr = (unsigned)(objp - slabp->s_mem) / cachep->buffer_size;
3091 slab_bufctl(slabp)[objnr] = BUFCTL_ACTIVE;
3092 }
3093#endif
Manfred Spraul3dafccf2006-02-01 03:05:42 -08003094 objp += obj_offset(cachep);
Christoph Lameter4f104932007-05-06 14:50:17 -07003095 if (cachep->ctor && cachep->flags & SLAB_POISON)
Christoph Lameter4ba9b9d2007-10-16 23:25:51 -07003096 cachep->ctor(cachep, objp);
Kevin Hilmana44b56d2006-12-06 20:32:11 -08003097#if ARCH_SLAB_MINALIGN
3098 if ((u32)objp & (ARCH_SLAB_MINALIGN-1)) {
3099 printk(KERN_ERR "0x%p: not aligned to ARCH_SLAB_MINALIGN=%d\n",
3100 objp, ARCH_SLAB_MINALIGN);
3101 }
3102#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07003103 return objp;
3104}
3105#else
3106#define cache_alloc_debugcheck_after(a,b,objp,d) (objp)
3107#endif
3108
Akinobu Mita8a8b6502006-12-08 02:39:44 -08003109#ifdef CONFIG_FAILSLAB
3110
3111static struct failslab_attr {
3112
3113 struct fault_attr attr;
3114
3115 u32 ignore_gfp_wait;
3116#ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
3117 struct dentry *ignore_gfp_wait_file;
3118#endif
3119
3120} failslab = {
3121 .attr = FAULT_ATTR_INITIALIZER,
Don Mullis6b1b60f2006-12-08 02:39:53 -08003122 .ignore_gfp_wait = 1,
Akinobu Mita8a8b6502006-12-08 02:39:44 -08003123};
3124
3125static int __init setup_failslab(char *str)
3126{
3127 return setup_fault_attr(&failslab.attr, str);
3128}
3129__setup("failslab=", setup_failslab);
3130
3131static int should_failslab(struct kmem_cache *cachep, gfp_t flags)
3132{
3133 if (cachep == &cache_cache)
3134 return 0;
3135 if (flags & __GFP_NOFAIL)
3136 return 0;
3137 if (failslab.ignore_gfp_wait && (flags & __GFP_WAIT))
3138 return 0;
3139
3140 return should_fail(&failslab.attr, obj_size(cachep));
3141}
3142
3143#ifdef CONFIG_FAULT_INJECTION_DEBUG_FS
3144
3145static int __init failslab_debugfs(void)
3146{
3147 mode_t mode = S_IFREG | S_IRUSR | S_IWUSR;
3148 struct dentry *dir;
3149 int err;
3150
Akinobu Mita824ebef2007-05-06 14:49:58 -07003151 err = init_fault_attr_dentries(&failslab.attr, "failslab");
Akinobu Mita8a8b6502006-12-08 02:39:44 -08003152 if (err)
3153 return err;
3154 dir = failslab.attr.dentries.dir;
3155
3156 failslab.ignore_gfp_wait_file =
3157 debugfs_create_bool("ignore-gfp-wait", mode, dir,
3158 &failslab.ignore_gfp_wait);
3159
3160 if (!failslab.ignore_gfp_wait_file) {
3161 err = -ENOMEM;
3162 debugfs_remove(failslab.ignore_gfp_wait_file);
3163 cleanup_fault_attr_dentries(&failslab.attr);
3164 }
3165
3166 return err;
3167}
3168
3169late_initcall(failslab_debugfs);
3170
3171#endif /* CONFIG_FAULT_INJECTION_DEBUG_FS */
3172
3173#else /* CONFIG_FAILSLAB */
3174
3175static inline int should_failslab(struct kmem_cache *cachep, gfp_t flags)
3176{
3177 return 0;
3178}
3179
3180#endif /* CONFIG_FAILSLAB */
3181
Pekka Enberg343e0d72006-02-01 03:05:50 -08003182static inline void *____cache_alloc(struct kmem_cache *cachep, gfp_t flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003183{
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003184 void *objp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003185 struct array_cache *ac;
3186
Alok N Kataria5c382302005-09-27 21:45:46 -07003187 check_irq_off();
Akinobu Mita8a8b6502006-12-08 02:39:44 -08003188
Pekka Enberg9a2dba42006-02-01 03:05:49 -08003189 ac = cpu_cache_get(cachep);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003190 if (likely(ac->avail)) {
3191 STATS_INC_ALLOCHIT(cachep);
3192 ac->touched = 1;
Christoph Lametere498be72005-09-09 13:03:32 -07003193 objp = ac->entry[--ac->avail];
Linus Torvalds1da177e2005-04-16 15:20:36 -07003194 } else {
3195 STATS_INC_ALLOCMISS(cachep);
3196 objp = cache_alloc_refill(cachep, flags);
3197 }
Alok N Kataria5c382302005-09-27 21:45:46 -07003198 return objp;
3199}
3200
Christoph Lametere498be72005-09-09 13:03:32 -07003201#ifdef CONFIG_NUMA
3202/*
Paul Jacksonb2455392006-03-24 03:16:12 -08003203 * Try allocating on another node if PF_SPREAD_SLAB|PF_MEMPOLICY.
Paul Jacksonc61afb12006-03-24 03:16:08 -08003204 *
3205 * If we are in_interrupt, then process context, including cpusets and
3206 * mempolicy, may not apply and should not be used for allocation policy.
3207 */
3208static void *alternate_node_alloc(struct kmem_cache *cachep, gfp_t flags)
3209{
3210 int nid_alloc, nid_here;
3211
Christoph Lameter765c4502006-09-27 01:50:08 -07003212 if (in_interrupt() || (flags & __GFP_THISNODE))
Paul Jacksonc61afb12006-03-24 03:16:08 -08003213 return NULL;
3214 nid_alloc = nid_here = numa_node_id();
3215 if (cpuset_do_slab_mem_spread() && (cachep->flags & SLAB_MEM_SPREAD))
3216 nid_alloc = cpuset_mem_spread_node();
3217 else if (current->mempolicy)
3218 nid_alloc = slab_node(current->mempolicy);
3219 if (nid_alloc != nid_here)
Christoph Hellwig8b98c162006-12-06 20:32:30 -08003220 return ____cache_alloc_node(cachep, flags, nid_alloc);
Paul Jacksonc61afb12006-03-24 03:16:08 -08003221 return NULL;
3222}
3223
3224/*
Christoph Lameter765c4502006-09-27 01:50:08 -07003225 * Fallback function if there was no memory available and no objects on a
Christoph Lameter3c517a62006-12-06 20:33:29 -08003226 * certain node and fall back is permitted. First we scan all the
3227 * available nodelists for available objects. If that fails then we
3228 * perform an allocation without specifying a node. This allows the page
3229 * allocator to do its reclaim / fallback magic. We then insert the
3230 * slab into the proper nodelist and then allocate from it.
Christoph Lameter765c4502006-09-27 01:50:08 -07003231 */
Pekka Enberg8c8cc2c2007-02-10 01:42:53 -08003232static void *fallback_alloc(struct kmem_cache *cache, gfp_t flags)
Christoph Lameter765c4502006-09-27 01:50:08 -07003233{
Pekka Enberg8c8cc2c2007-02-10 01:42:53 -08003234 struct zonelist *zonelist;
3235 gfp_t local_flags;
Mel Gormandd1a2392008-04-28 02:12:17 -07003236 struct zoneref *z;
Mel Gorman54a6eb52008-04-28 02:12:16 -07003237 struct zone *zone;
3238 enum zone_type high_zoneidx = gfp_zone(flags);
Christoph Lameter765c4502006-09-27 01:50:08 -07003239 void *obj = NULL;
Christoph Lameter3c517a62006-12-06 20:33:29 -08003240 int nid;
Pekka Enberg8c8cc2c2007-02-10 01:42:53 -08003241
3242 if (flags & __GFP_THISNODE)
3243 return NULL;
3244
Mel Gorman0e884602008-04-28 02:12:14 -07003245 zonelist = node_zonelist(slab_node(current->mempolicy), flags);
Christoph Lameter6cb06222007-10-16 01:25:41 -07003246 local_flags = flags & (GFP_CONSTRAINT_MASK|GFP_RECLAIM_MASK);
Christoph Lameter765c4502006-09-27 01:50:08 -07003247
Christoph Lameter3c517a62006-12-06 20:33:29 -08003248retry:
3249 /*
3250 * Look through allowed nodes for objects available
3251 * from existing per node queues.
3252 */
Mel Gorman54a6eb52008-04-28 02:12:16 -07003253 for_each_zone_zonelist(zone, z, zonelist, high_zoneidx) {
3254 nid = zone_to_nid(zone);
Christoph Lameteraedb0eb2006-10-21 10:24:16 -07003255
Mel Gorman54a6eb52008-04-28 02:12:16 -07003256 if (cpuset_zone_allowed_hardwall(zone, flags) &&
Christoph Lameter3c517a62006-12-06 20:33:29 -08003257 cache->nodelists[nid] &&
Christoph Lameter481c5342008-06-21 16:46:35 -07003258 cache->nodelists[nid]->free_objects) {
Christoph Lameter3c517a62006-12-06 20:33:29 -08003259 obj = ____cache_alloc_node(cache,
3260 flags | GFP_THISNODE, nid);
Christoph Lameter481c5342008-06-21 16:46:35 -07003261 if (obj)
3262 break;
3263 }
Christoph Lameter3c517a62006-12-06 20:33:29 -08003264 }
3265
Christoph Lametercfce6602007-05-06 14:50:17 -07003266 if (!obj) {
Christoph Lameter3c517a62006-12-06 20:33:29 -08003267 /*
3268 * This allocation will be performed within the constraints
3269 * of the current cpuset / memory policy requirements.
3270 * We may trigger various forms of reclaim on the allowed
3271 * set and go into memory reserves if necessary.
3272 */
Christoph Lameterdd47ea72006-12-13 00:34:11 -08003273 if (local_flags & __GFP_WAIT)
3274 local_irq_enable();
3275 kmem_flagcheck(cache, flags);
Christoph Lameter9ac33b22008-03-04 12:24:22 -08003276 obj = kmem_getpages(cache, local_flags, -1);
Christoph Lameterdd47ea72006-12-13 00:34:11 -08003277 if (local_flags & __GFP_WAIT)
3278 local_irq_disable();
Christoph Lameter3c517a62006-12-06 20:33:29 -08003279 if (obj) {
3280 /*
3281 * Insert into the appropriate per node queues
3282 */
3283 nid = page_to_nid(virt_to_page(obj));
3284 if (cache_grow(cache, flags, nid, obj)) {
3285 obj = ____cache_alloc_node(cache,
3286 flags | GFP_THISNODE, nid);
3287 if (!obj)
3288 /*
3289 * Another processor may allocate the
3290 * objects in the slab since we are
3291 * not holding any locks.
3292 */
3293 goto retry;
3294 } else {
Hugh Dickinsb6a60452007-01-05 16:36:36 -08003295 /* cache_grow already freed obj */
Christoph Lameter3c517a62006-12-06 20:33:29 -08003296 obj = NULL;
3297 }
3298 }
Christoph Lameteraedb0eb2006-10-21 10:24:16 -07003299 }
Christoph Lameter765c4502006-09-27 01:50:08 -07003300 return obj;
3301}
3302
3303/*
Christoph Lametere498be72005-09-09 13:03:32 -07003304 * A interface to enable slab creation on nodeid
Linus Torvalds1da177e2005-04-16 15:20:36 -07003305 */
Christoph Hellwig8b98c162006-12-06 20:32:30 -08003306static void *____cache_alloc_node(struct kmem_cache *cachep, gfp_t flags,
Andrew Mortona737b3e2006-03-22 00:08:11 -08003307 int nodeid)
Christoph Lametere498be72005-09-09 13:03:32 -07003308{
3309 struct list_head *entry;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003310 struct slab *slabp;
3311 struct kmem_list3 *l3;
3312 void *obj;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003313 int x;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003314
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003315 l3 = cachep->nodelists[nodeid];
3316 BUG_ON(!l3);
Christoph Lametere498be72005-09-09 13:03:32 -07003317
Andrew Mortona737b3e2006-03-22 00:08:11 -08003318retry:
Ravikiran G Thirumalaica3b9b92006-02-04 23:27:58 -08003319 check_irq_off();
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003320 spin_lock(&l3->list_lock);
3321 entry = l3->slabs_partial.next;
3322 if (entry == &l3->slabs_partial) {
3323 l3->free_touched = 1;
3324 entry = l3->slabs_free.next;
3325 if (entry == &l3->slabs_free)
3326 goto must_grow;
3327 }
Christoph Lametere498be72005-09-09 13:03:32 -07003328
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003329 slabp = list_entry(entry, struct slab, list);
3330 check_spinlock_acquired_node(cachep, nodeid);
3331 check_slabp(cachep, slabp);
Christoph Lametere498be72005-09-09 13:03:32 -07003332
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003333 STATS_INC_NODEALLOCS(cachep);
3334 STATS_INC_ACTIVE(cachep);
3335 STATS_SET_HIGH(cachep);
Christoph Lametere498be72005-09-09 13:03:32 -07003336
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003337 BUG_ON(slabp->inuse == cachep->num);
Christoph Lametere498be72005-09-09 13:03:32 -07003338
Matthew Dobson78d382d2006-02-01 03:05:47 -08003339 obj = slab_get_obj(cachep, slabp, nodeid);
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003340 check_slabp(cachep, slabp);
3341 l3->free_objects--;
3342 /* move slabp to correct slabp list: */
3343 list_del(&slabp->list);
Christoph Lametere498be72005-09-09 13:03:32 -07003344
Andrew Mortona737b3e2006-03-22 00:08:11 -08003345 if (slabp->free == BUFCTL_END)
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003346 list_add(&slabp->list, &l3->slabs_full);
Andrew Mortona737b3e2006-03-22 00:08:11 -08003347 else
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003348 list_add(&slabp->list, &l3->slabs_partial);
Christoph Lametere498be72005-09-09 13:03:32 -07003349
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003350 spin_unlock(&l3->list_lock);
3351 goto done;
Christoph Lametere498be72005-09-09 13:03:32 -07003352
Andrew Mortona737b3e2006-03-22 00:08:11 -08003353must_grow:
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003354 spin_unlock(&l3->list_lock);
Christoph Lameter3c517a62006-12-06 20:33:29 -08003355 x = cache_grow(cachep, flags | GFP_THISNODE, nodeid, NULL);
Christoph Lameter765c4502006-09-27 01:50:08 -07003356 if (x)
3357 goto retry;
Christoph Lametere498be72005-09-09 13:03:32 -07003358
Pekka Enberg8c8cc2c2007-02-10 01:42:53 -08003359 return fallback_alloc(cachep, flags);
Christoph Lameter765c4502006-09-27 01:50:08 -07003360
Andrew Mortona737b3e2006-03-22 00:08:11 -08003361done:
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003362 return obj;
Christoph Lametere498be72005-09-09 13:03:32 -07003363}
Pekka Enberg8c8cc2c2007-02-10 01:42:53 -08003364
3365/**
3366 * kmem_cache_alloc_node - Allocate an object on the specified node
3367 * @cachep: The cache to allocate from.
3368 * @flags: See kmalloc().
3369 * @nodeid: node number of the target node.
3370 * @caller: return address of caller, used for debug information
3371 *
3372 * Identical to kmem_cache_alloc but it will allocate memory on the given
3373 * node, which can improve the performance for cpu bound structures.
3374 *
3375 * Fallback to other node is possible if __GFP_THISNODE is not set.
3376 */
3377static __always_inline void *
3378__cache_alloc_node(struct kmem_cache *cachep, gfp_t flags, int nodeid,
3379 void *caller)
3380{
3381 unsigned long save_flags;
3382 void *ptr;
3383
Akinobu Mita824ebef2007-05-06 14:49:58 -07003384 if (should_failslab(cachep, flags))
3385 return NULL;
3386
Pekka Enberg8c8cc2c2007-02-10 01:42:53 -08003387 cache_alloc_debugcheck_before(cachep, flags);
3388 local_irq_save(save_flags);
3389
3390 if (unlikely(nodeid == -1))
3391 nodeid = numa_node_id();
3392
3393 if (unlikely(!cachep->nodelists[nodeid])) {
3394 /* Node not bootstrapped yet */
3395 ptr = fallback_alloc(cachep, flags);
3396 goto out;
3397 }
3398
3399 if (nodeid == numa_node_id()) {
3400 /*
3401 * Use the locally cached objects if possible.
3402 * However ____cache_alloc does not allow fallback
3403 * to other nodes. It may fail while we still have
3404 * objects on other nodes available.
3405 */
3406 ptr = ____cache_alloc(cachep, flags);
3407 if (ptr)
3408 goto out;
3409 }
3410 /* ___cache_alloc_node can fall back to other nodes */
3411 ptr = ____cache_alloc_node(cachep, flags, nodeid);
3412 out:
3413 local_irq_restore(save_flags);
3414 ptr = cache_alloc_debugcheck_after(cachep, flags, ptr, caller);
3415
Christoph Lameterd07dbea2007-07-17 04:03:23 -07003416 if (unlikely((flags & __GFP_ZERO) && ptr))
3417 memset(ptr, 0, obj_size(cachep));
3418
Pekka Enberg8c8cc2c2007-02-10 01:42:53 -08003419 return ptr;
3420}
3421
3422static __always_inline void *
3423__do_cache_alloc(struct kmem_cache *cache, gfp_t flags)
3424{
3425 void *objp;
3426
3427 if (unlikely(current->flags & (PF_SPREAD_SLAB | PF_MEMPOLICY))) {
3428 objp = alternate_node_alloc(cache, flags);
3429 if (objp)
3430 goto out;
3431 }
3432 objp = ____cache_alloc(cache, flags);
3433
3434 /*
3435 * We may just have run out of memory on the local node.
3436 * ____cache_alloc_node() knows how to locate memory on other nodes
3437 */
3438 if (!objp)
3439 objp = ____cache_alloc_node(cache, flags, numa_node_id());
3440
3441 out:
3442 return objp;
3443}
3444#else
3445
3446static __always_inline void *
3447__do_cache_alloc(struct kmem_cache *cachep, gfp_t flags)
3448{
3449 return ____cache_alloc(cachep, flags);
3450}
3451
3452#endif /* CONFIG_NUMA */
3453
3454static __always_inline void *
3455__cache_alloc(struct kmem_cache *cachep, gfp_t flags, void *caller)
3456{
3457 unsigned long save_flags;
3458 void *objp;
3459
Akinobu Mita824ebef2007-05-06 14:49:58 -07003460 if (should_failslab(cachep, flags))
3461 return NULL;
3462
Pekka Enberg8c8cc2c2007-02-10 01:42:53 -08003463 cache_alloc_debugcheck_before(cachep, flags);
3464 local_irq_save(save_flags);
3465 objp = __do_cache_alloc(cachep, flags);
3466 local_irq_restore(save_flags);
3467 objp = cache_alloc_debugcheck_after(cachep, flags, objp, caller);
3468 prefetchw(objp);
3469
Christoph Lameterd07dbea2007-07-17 04:03:23 -07003470 if (unlikely((flags & __GFP_ZERO) && objp))
3471 memset(objp, 0, obj_size(cachep));
3472
Pekka Enberg8c8cc2c2007-02-10 01:42:53 -08003473 return objp;
3474}
Christoph Lametere498be72005-09-09 13:03:32 -07003475
3476/*
3477 * Caller needs to acquire correct kmem_list's list_lock
3478 */
Pekka Enberg343e0d72006-02-01 03:05:50 -08003479static void free_block(struct kmem_cache *cachep, void **objpp, int nr_objects,
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003480 int node)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003481{
3482 int i;
Christoph Lametere498be72005-09-09 13:03:32 -07003483 struct kmem_list3 *l3;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003484
3485 for (i = 0; i < nr_objects; i++) {
3486 void *objp = objpp[i];
3487 struct slab *slabp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003488
Pekka Enberg6ed5eb22006-02-01 03:05:49 -08003489 slabp = virt_to_slab(objp);
Christoph Lameterff694162005-09-22 21:44:02 -07003490 l3 = cachep->nodelists[node];
Linus Torvalds1da177e2005-04-16 15:20:36 -07003491 list_del(&slabp->list);
Christoph Lameterff694162005-09-22 21:44:02 -07003492 check_spinlock_acquired_node(cachep, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003493 check_slabp(cachep, slabp);
Matthew Dobson78d382d2006-02-01 03:05:47 -08003494 slab_put_obj(cachep, slabp, objp, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003495 STATS_DEC_ACTIVE(cachep);
Christoph Lametere498be72005-09-09 13:03:32 -07003496 l3->free_objects++;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003497 check_slabp(cachep, slabp);
3498
3499 /* fixup slab chains */
3500 if (slabp->inuse == 0) {
Christoph Lametere498be72005-09-09 13:03:32 -07003501 if (l3->free_objects > l3->free_limit) {
3502 l3->free_objects -= cachep->num;
Ravikiran G Thirumalaie5ac9c52006-09-25 23:31:34 -07003503 /* No need to drop any previously held
3504 * lock here, even if we have a off-slab slab
3505 * descriptor it is guaranteed to come from
3506 * a different cache, refer to comments before
3507 * alloc_slabmgmt.
3508 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07003509 slab_destroy(cachep, slabp);
3510 } else {
Christoph Lametere498be72005-09-09 13:03:32 -07003511 list_add(&slabp->list, &l3->slabs_free);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003512 }
3513 } else {
3514 /* Unconditionally move a slab to the end of the
3515 * partial list on free - maximum time for the
3516 * other objects to be freed, too.
3517 */
Christoph Lametere498be72005-09-09 13:03:32 -07003518 list_add_tail(&slabp->list, &l3->slabs_partial);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003519 }
3520 }
3521}
3522
Pekka Enberg343e0d72006-02-01 03:05:50 -08003523static void cache_flusharray(struct kmem_cache *cachep, struct array_cache *ac)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003524{
3525 int batchcount;
Christoph Lametere498be72005-09-09 13:03:32 -07003526 struct kmem_list3 *l3;
Christoph Lameterff694162005-09-22 21:44:02 -07003527 int node = numa_node_id();
Linus Torvalds1da177e2005-04-16 15:20:36 -07003528
3529 batchcount = ac->batchcount;
3530#if DEBUG
3531 BUG_ON(!batchcount || batchcount > ac->avail);
3532#endif
3533 check_irq_off();
Christoph Lameterff694162005-09-22 21:44:02 -07003534 l3 = cachep->nodelists[node];
Ingo Molnar873623d2006-07-13 14:44:38 +02003535 spin_lock(&l3->list_lock);
Christoph Lametere498be72005-09-09 13:03:32 -07003536 if (l3->shared) {
3537 struct array_cache *shared_array = l3->shared;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003538 int max = shared_array->limit - shared_array->avail;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003539 if (max) {
3540 if (batchcount > max)
3541 batchcount = max;
Christoph Lametere498be72005-09-09 13:03:32 -07003542 memcpy(&(shared_array->entry[shared_array->avail]),
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003543 ac->entry, sizeof(void *) * batchcount);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003544 shared_array->avail += batchcount;
3545 goto free_done;
3546 }
3547 }
3548
Christoph Lameterff694162005-09-22 21:44:02 -07003549 free_block(cachep, ac->entry, batchcount, node);
Andrew Mortona737b3e2006-03-22 00:08:11 -08003550free_done:
Linus Torvalds1da177e2005-04-16 15:20:36 -07003551#if STATS
3552 {
3553 int i = 0;
3554 struct list_head *p;
3555
Christoph Lametere498be72005-09-09 13:03:32 -07003556 p = l3->slabs_free.next;
3557 while (p != &(l3->slabs_free)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07003558 struct slab *slabp;
3559
3560 slabp = list_entry(p, struct slab, list);
3561 BUG_ON(slabp->inuse);
3562
3563 i++;
3564 p = p->next;
3565 }
3566 STATS_SET_FREEABLE(cachep, i);
3567 }
3568#endif
Christoph Lametere498be72005-09-09 13:03:32 -07003569 spin_unlock(&l3->list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003570 ac->avail -= batchcount;
Andrew Mortona737b3e2006-03-22 00:08:11 -08003571 memmove(ac->entry, &(ac->entry[batchcount]), sizeof(void *)*ac->avail);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003572}
3573
3574/*
Andrew Mortona737b3e2006-03-22 00:08:11 -08003575 * Release an obj back to its cache. If the obj has a constructed state, it must
3576 * be in this state _before_ it is released. Called with disabled ints.
Linus Torvalds1da177e2005-04-16 15:20:36 -07003577 */
Ingo Molnar873623d2006-07-13 14:44:38 +02003578static inline void __cache_free(struct kmem_cache *cachep, void *objp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003579{
Pekka Enberg9a2dba42006-02-01 03:05:49 -08003580 struct array_cache *ac = cpu_cache_get(cachep);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003581
3582 check_irq_off();
3583 objp = cache_free_debugcheck(cachep, objp, __builtin_return_address(0));
3584
Siddha, Suresh B1807a1a2007-08-22 14:01:49 -07003585 /*
3586 * Skip calling cache_free_alien() when the platform is not numa.
3587 * This will avoid cache misses that happen while accessing slabp (which
3588 * is per page memory reference) to get nodeid. Instead use a global
3589 * variable to skip the call, which is mostly likely to be present in
3590 * the cache.
3591 */
3592 if (numa_platform && cache_free_alien(cachep, objp))
Pekka Enberg729bd0b2006-06-23 02:03:05 -07003593 return;
Christoph Lametere498be72005-09-09 13:03:32 -07003594
Linus Torvalds1da177e2005-04-16 15:20:36 -07003595 if (likely(ac->avail < ac->limit)) {
3596 STATS_INC_FREEHIT(cachep);
Christoph Lametere498be72005-09-09 13:03:32 -07003597 ac->entry[ac->avail++] = objp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003598 return;
3599 } else {
3600 STATS_INC_FREEMISS(cachep);
3601 cache_flusharray(cachep, ac);
Christoph Lametere498be72005-09-09 13:03:32 -07003602 ac->entry[ac->avail++] = objp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003603 }
3604}
3605
3606/**
3607 * kmem_cache_alloc - Allocate an object
3608 * @cachep: The cache to allocate from.
3609 * @flags: See kmalloc().
3610 *
3611 * Allocate an object from this cache. The flags are only relevant
3612 * if the cache has no available objects.
3613 */
Pekka Enberg343e0d72006-02-01 03:05:50 -08003614void *kmem_cache_alloc(struct kmem_cache *cachep, gfp_t flags)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003615{
Pekka Enberg7fd6b142006-02-01 03:05:52 -08003616 return __cache_alloc(cachep, flags, __builtin_return_address(0));
Linus Torvalds1da177e2005-04-16 15:20:36 -07003617}
3618EXPORT_SYMBOL(kmem_cache_alloc);
3619
3620/**
Randy Dunlap76824862008-03-19 17:00:40 -07003621 * kmem_ptr_validate - check if an untrusted pointer might be a slab entry.
Linus Torvalds1da177e2005-04-16 15:20:36 -07003622 * @cachep: the cache we're checking against
3623 * @ptr: pointer to validate
3624 *
Randy Dunlap76824862008-03-19 17:00:40 -07003625 * This verifies that the untrusted pointer looks sane;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003626 * it is _not_ a guarantee that the pointer is actually
3627 * part of the slab cache in question, but it at least
3628 * validates that the pointer can be dereferenced and
3629 * looks half-way sane.
3630 *
3631 * Currently only used for dentry validation.
3632 */
Christoph Lameterb7f869a2006-12-22 01:06:44 -08003633int kmem_ptr_validate(struct kmem_cache *cachep, const void *ptr)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003634{
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003635 unsigned long addr = (unsigned long)ptr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003636 unsigned long min_addr = PAGE_OFFSET;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003637 unsigned long align_mask = BYTES_PER_WORD - 1;
Manfred Spraul3dafccf2006-02-01 03:05:42 -08003638 unsigned long size = cachep->buffer_size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003639 struct page *page;
3640
3641 if (unlikely(addr < min_addr))
3642 goto out;
3643 if (unlikely(addr > (unsigned long)high_memory - size))
3644 goto out;
3645 if (unlikely(addr & align_mask))
3646 goto out;
3647 if (unlikely(!kern_addr_valid(addr)))
3648 goto out;
3649 if (unlikely(!kern_addr_valid(addr + size - 1)))
3650 goto out;
3651 page = virt_to_page(ptr);
3652 if (unlikely(!PageSlab(page)))
3653 goto out;
Pekka Enberg065d41c2005-11-13 16:06:46 -08003654 if (unlikely(page_get_cache(page) != cachep))
Linus Torvalds1da177e2005-04-16 15:20:36 -07003655 goto out;
3656 return 1;
Andrew Mortona737b3e2006-03-22 00:08:11 -08003657out:
Linus Torvalds1da177e2005-04-16 15:20:36 -07003658 return 0;
3659}
3660
3661#ifdef CONFIG_NUMA
Christoph Hellwig8b98c162006-12-06 20:32:30 -08003662void *kmem_cache_alloc_node(struct kmem_cache *cachep, gfp_t flags, int nodeid)
3663{
3664 return __cache_alloc_node(cachep, flags, nodeid,
3665 __builtin_return_address(0));
3666}
Linus Torvalds1da177e2005-04-16 15:20:36 -07003667EXPORT_SYMBOL(kmem_cache_alloc_node);
3668
Christoph Hellwig8b98c162006-12-06 20:32:30 -08003669static __always_inline void *
3670__do_kmalloc_node(size_t size, gfp_t flags, int node, void *caller)
Manfred Spraul97e2bde2005-05-01 08:58:38 -07003671{
Pekka Enberg343e0d72006-02-01 03:05:50 -08003672 struct kmem_cache *cachep;
Manfred Spraul97e2bde2005-05-01 08:58:38 -07003673
3674 cachep = kmem_find_general_cachep(size, flags);
Christoph Lameter6cb8f912007-07-17 04:03:22 -07003675 if (unlikely(ZERO_OR_NULL_PTR(cachep)))
3676 return cachep;
Manfred Spraul97e2bde2005-05-01 08:58:38 -07003677 return kmem_cache_alloc_node(cachep, flags, node);
3678}
Christoph Hellwig8b98c162006-12-06 20:32:30 -08003679
3680#ifdef CONFIG_DEBUG_SLAB
3681void *__kmalloc_node(size_t size, gfp_t flags, int node)
3682{
3683 return __do_kmalloc_node(size, flags, node,
3684 __builtin_return_address(0));
3685}
Christoph Hellwigdbe5e692006-09-25 23:31:36 -07003686EXPORT_SYMBOL(__kmalloc_node);
Christoph Hellwig8b98c162006-12-06 20:32:30 -08003687
3688void *__kmalloc_node_track_caller(size_t size, gfp_t flags,
3689 int node, void *caller)
3690{
3691 return __do_kmalloc_node(size, flags, node, caller);
3692}
3693EXPORT_SYMBOL(__kmalloc_node_track_caller);
3694#else
3695void *__kmalloc_node(size_t size, gfp_t flags, int node)
3696{
3697 return __do_kmalloc_node(size, flags, node, NULL);
3698}
3699EXPORT_SYMBOL(__kmalloc_node);
3700#endif /* CONFIG_DEBUG_SLAB */
3701#endif /* CONFIG_NUMA */
Linus Torvalds1da177e2005-04-16 15:20:36 -07003702
3703/**
Paul Drynoff800590f2006-06-23 02:03:48 -07003704 * __do_kmalloc - allocate memory
Linus Torvalds1da177e2005-04-16 15:20:36 -07003705 * @size: how many bytes of memory are required.
Paul Drynoff800590f2006-06-23 02:03:48 -07003706 * @flags: the type of memory to allocate (see kmalloc).
Randy Dunlap911851e2006-03-22 00:08:14 -08003707 * @caller: function caller for debug tracking of the caller
Linus Torvalds1da177e2005-04-16 15:20:36 -07003708 */
Pekka Enberg7fd6b142006-02-01 03:05:52 -08003709static __always_inline void *__do_kmalloc(size_t size, gfp_t flags,
3710 void *caller)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003711{
Pekka Enberg343e0d72006-02-01 03:05:50 -08003712 struct kmem_cache *cachep;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003713
Manfred Spraul97e2bde2005-05-01 08:58:38 -07003714 /* If you want to save a few bytes .text space: replace
3715 * __ with kmem_.
3716 * Then kmalloc uses the uninlined functions instead of the inline
3717 * functions.
3718 */
3719 cachep = __find_general_cachep(size, flags);
Linus Torvaldsa5c96d82007-07-19 13:17:15 -07003720 if (unlikely(ZERO_OR_NULL_PTR(cachep)))
3721 return cachep;
Pekka Enberg7fd6b142006-02-01 03:05:52 -08003722 return __cache_alloc(cachep, flags, caller);
3723}
3724
Pekka Enberg7fd6b142006-02-01 03:05:52 -08003725
Christoph Hellwig1d2c8ee2006-10-04 02:15:25 -07003726#ifdef CONFIG_DEBUG_SLAB
Pekka Enberg7fd6b142006-02-01 03:05:52 -08003727void *__kmalloc(size_t size, gfp_t flags)
3728{
Al Viro871751e2006-03-25 03:06:39 -08003729 return __do_kmalloc(size, flags, __builtin_return_address(0));
Linus Torvalds1da177e2005-04-16 15:20:36 -07003730}
3731EXPORT_SYMBOL(__kmalloc);
3732
Pekka Enberg7fd6b142006-02-01 03:05:52 -08003733void *__kmalloc_track_caller(size_t size, gfp_t flags, void *caller)
3734{
3735 return __do_kmalloc(size, flags, caller);
3736}
3737EXPORT_SYMBOL(__kmalloc_track_caller);
Christoph Hellwig1d2c8ee2006-10-04 02:15:25 -07003738
3739#else
3740void *__kmalloc(size_t size, gfp_t flags)
3741{
3742 return __do_kmalloc(size, flags, NULL);
3743}
3744EXPORT_SYMBOL(__kmalloc);
Pekka Enberg7fd6b142006-02-01 03:05:52 -08003745#endif
3746
Linus Torvalds1da177e2005-04-16 15:20:36 -07003747/**
3748 * kmem_cache_free - Deallocate an object
3749 * @cachep: The cache the allocation was from.
3750 * @objp: The previously allocated object.
3751 *
3752 * Free an object which was previously allocated from this
3753 * cache.
3754 */
Pekka Enberg343e0d72006-02-01 03:05:50 -08003755void kmem_cache_free(struct kmem_cache *cachep, void *objp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003756{
3757 unsigned long flags;
3758
3759 local_irq_save(flags);
Ingo Molnar898552c2007-02-10 01:44:57 -08003760 debug_check_no_locks_freed(objp, obj_size(cachep));
Thomas Gleixner3ac7fe52008-04-30 00:55:01 -07003761 if (!(cachep->flags & SLAB_DEBUG_OBJECTS))
3762 debug_check_no_obj_freed(objp, obj_size(cachep));
Ingo Molnar873623d2006-07-13 14:44:38 +02003763 __cache_free(cachep, objp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003764 local_irq_restore(flags);
3765}
3766EXPORT_SYMBOL(kmem_cache_free);
3767
3768/**
Linus Torvalds1da177e2005-04-16 15:20:36 -07003769 * kfree - free previously allocated memory
3770 * @objp: pointer returned by kmalloc.
3771 *
Pekka Enberg80e93ef2005-09-09 13:10:16 -07003772 * If @objp is NULL, no operation is performed.
3773 *
Linus Torvalds1da177e2005-04-16 15:20:36 -07003774 * Don't free memory not originally allocated by kmalloc()
3775 * or you will run into trouble.
3776 */
3777void kfree(const void *objp)
3778{
Pekka Enberg343e0d72006-02-01 03:05:50 -08003779 struct kmem_cache *c;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003780 unsigned long flags;
3781
Christoph Lameter6cb8f912007-07-17 04:03:22 -07003782 if (unlikely(ZERO_OR_NULL_PTR(objp)))
Linus Torvalds1da177e2005-04-16 15:20:36 -07003783 return;
3784 local_irq_save(flags);
3785 kfree_debugcheck(objp);
Pekka Enberg6ed5eb22006-02-01 03:05:49 -08003786 c = virt_to_cache(objp);
Ingo Molnarf9b84042006-06-27 02:54:49 -07003787 debug_check_no_locks_freed(objp, obj_size(c));
Thomas Gleixner3ac7fe52008-04-30 00:55:01 -07003788 debug_check_no_obj_freed(objp, obj_size(c));
Ingo Molnar873623d2006-07-13 14:44:38 +02003789 __cache_free(c, (void *)objp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003790 local_irq_restore(flags);
3791}
3792EXPORT_SYMBOL(kfree);
3793
Pekka Enberg343e0d72006-02-01 03:05:50 -08003794unsigned int kmem_cache_size(struct kmem_cache *cachep)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003795{
Manfred Spraul3dafccf2006-02-01 03:05:42 -08003796 return obj_size(cachep);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003797}
3798EXPORT_SYMBOL(kmem_cache_size);
3799
Pekka Enberg343e0d72006-02-01 03:05:50 -08003800const char *kmem_cache_name(struct kmem_cache *cachep)
Arnaldo Carvalho de Melo19449722005-06-18 22:46:19 -07003801{
3802 return cachep->name;
3803}
3804EXPORT_SYMBOL_GPL(kmem_cache_name);
3805
Christoph Lametere498be72005-09-09 13:03:32 -07003806/*
Simon Arlott183ff222007-10-20 01:27:18 +02003807 * This initializes kmem_list3 or resizes various caches for all nodes.
Christoph Lametere498be72005-09-09 13:03:32 -07003808 */
Pekka Enberg343e0d72006-02-01 03:05:50 -08003809static int alloc_kmemlist(struct kmem_cache *cachep)
Christoph Lametere498be72005-09-09 13:03:32 -07003810{
3811 int node;
3812 struct kmem_list3 *l3;
Christoph Lametercafeb022006-03-25 03:06:46 -08003813 struct array_cache *new_shared;
Paul Menage3395ee02006-12-06 20:32:16 -08003814 struct array_cache **new_alien = NULL;
Christoph Lametere498be72005-09-09 13:03:32 -07003815
Mel Gorman9c09a952008-01-24 05:49:54 -08003816 for_each_online_node(node) {
Christoph Lametercafeb022006-03-25 03:06:46 -08003817
Paul Menage3395ee02006-12-06 20:32:16 -08003818 if (use_alien_caches) {
3819 new_alien = alloc_alien_cache(node, cachep->limit);
3820 if (!new_alien)
3821 goto fail;
3822 }
Christoph Lametercafeb022006-03-25 03:06:46 -08003823
Eric Dumazet63109842007-05-06 14:49:28 -07003824 new_shared = NULL;
3825 if (cachep->shared) {
3826 new_shared = alloc_arraycache(node,
Christoph Lameter0718dc22006-03-25 03:06:47 -08003827 cachep->shared*cachep->batchcount,
Andrew Mortona737b3e2006-03-22 00:08:11 -08003828 0xbaadf00d);
Eric Dumazet63109842007-05-06 14:49:28 -07003829 if (!new_shared) {
3830 free_alien_cache(new_alien);
3831 goto fail;
3832 }
Christoph Lameter0718dc22006-03-25 03:06:47 -08003833 }
Christoph Lametercafeb022006-03-25 03:06:46 -08003834
Andrew Mortona737b3e2006-03-22 00:08:11 -08003835 l3 = cachep->nodelists[node];
3836 if (l3) {
Christoph Lametercafeb022006-03-25 03:06:46 -08003837 struct array_cache *shared = l3->shared;
3838
Christoph Lametere498be72005-09-09 13:03:32 -07003839 spin_lock_irq(&l3->list_lock);
3840
Christoph Lametercafeb022006-03-25 03:06:46 -08003841 if (shared)
Christoph Lameter0718dc22006-03-25 03:06:47 -08003842 free_block(cachep, shared->entry,
3843 shared->avail, node);
Christoph Lametere498be72005-09-09 13:03:32 -07003844
Christoph Lametercafeb022006-03-25 03:06:46 -08003845 l3->shared = new_shared;
3846 if (!l3->alien) {
Christoph Lametere498be72005-09-09 13:03:32 -07003847 l3->alien = new_alien;
3848 new_alien = NULL;
3849 }
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003850 l3->free_limit = (1 + nr_cpus_node(node)) *
Andrew Mortona737b3e2006-03-22 00:08:11 -08003851 cachep->batchcount + cachep->num;
Christoph Lametere498be72005-09-09 13:03:32 -07003852 spin_unlock_irq(&l3->list_lock);
Christoph Lametercafeb022006-03-25 03:06:46 -08003853 kfree(shared);
Christoph Lametere498be72005-09-09 13:03:32 -07003854 free_alien_cache(new_alien);
3855 continue;
3856 }
Andrew Mortona737b3e2006-03-22 00:08:11 -08003857 l3 = kmalloc_node(sizeof(struct kmem_list3), GFP_KERNEL, node);
Christoph Lameter0718dc22006-03-25 03:06:47 -08003858 if (!l3) {
3859 free_alien_cache(new_alien);
3860 kfree(new_shared);
Christoph Lametere498be72005-09-09 13:03:32 -07003861 goto fail;
Christoph Lameter0718dc22006-03-25 03:06:47 -08003862 }
Christoph Lametere498be72005-09-09 13:03:32 -07003863
3864 kmem_list3_init(l3);
3865 l3->next_reap = jiffies + REAPTIMEOUT_LIST3 +
Andrew Mortona737b3e2006-03-22 00:08:11 -08003866 ((unsigned long)cachep) % REAPTIMEOUT_LIST3;
Christoph Lametercafeb022006-03-25 03:06:46 -08003867 l3->shared = new_shared;
Christoph Lametere498be72005-09-09 13:03:32 -07003868 l3->alien = new_alien;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003869 l3->free_limit = (1 + nr_cpus_node(node)) *
Andrew Mortona737b3e2006-03-22 00:08:11 -08003870 cachep->batchcount + cachep->num;
Christoph Lametere498be72005-09-09 13:03:32 -07003871 cachep->nodelists[node] = l3;
3872 }
Christoph Lametercafeb022006-03-25 03:06:46 -08003873 return 0;
Christoph Lameter0718dc22006-03-25 03:06:47 -08003874
Andrew Mortona737b3e2006-03-22 00:08:11 -08003875fail:
Christoph Lameter0718dc22006-03-25 03:06:47 -08003876 if (!cachep->next.next) {
3877 /* Cache is not active yet. Roll back what we did */
3878 node--;
3879 while (node >= 0) {
3880 if (cachep->nodelists[node]) {
3881 l3 = cachep->nodelists[node];
3882
3883 kfree(l3->shared);
3884 free_alien_cache(l3->alien);
3885 kfree(l3);
3886 cachep->nodelists[node] = NULL;
3887 }
3888 node--;
3889 }
3890 }
Christoph Lametercafeb022006-03-25 03:06:46 -08003891 return -ENOMEM;
Christoph Lametere498be72005-09-09 13:03:32 -07003892}
3893
Linus Torvalds1da177e2005-04-16 15:20:36 -07003894struct ccupdate_struct {
Pekka Enberg343e0d72006-02-01 03:05:50 -08003895 struct kmem_cache *cachep;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003896 struct array_cache *new[NR_CPUS];
3897};
3898
3899static void do_ccupdate_local(void *info)
3900{
Andrew Mortona737b3e2006-03-22 00:08:11 -08003901 struct ccupdate_struct *new = info;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003902 struct array_cache *old;
3903
3904 check_irq_off();
Pekka Enberg9a2dba42006-02-01 03:05:49 -08003905 old = cpu_cache_get(new->cachep);
Christoph Lametere498be72005-09-09 13:03:32 -07003906
Linus Torvalds1da177e2005-04-16 15:20:36 -07003907 new->cachep->array[smp_processor_id()] = new->new[smp_processor_id()];
3908 new->new[smp_processor_id()] = old;
3909}
3910
Ravikiran G Thirumalaib5d8ca72006-03-22 00:08:12 -08003911/* Always called with the cache_chain_mutex held */
Andrew Mortona737b3e2006-03-22 00:08:11 -08003912static int do_tune_cpucache(struct kmem_cache *cachep, int limit,
3913 int batchcount, int shared)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003914{
Siddha, Suresh Bd2e7b7d2006-09-25 23:31:47 -07003915 struct ccupdate_struct *new;
Christoph Lameter2ed3a4e2006-09-25 23:31:38 -07003916 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003917
Siddha, Suresh Bd2e7b7d2006-09-25 23:31:47 -07003918 new = kzalloc(sizeof(*new), GFP_KERNEL);
3919 if (!new)
3920 return -ENOMEM;
3921
Christoph Lametere498be72005-09-09 13:03:32 -07003922 for_each_online_cpu(i) {
Siddha, Suresh Bd2e7b7d2006-09-25 23:31:47 -07003923 new->new[i] = alloc_arraycache(cpu_to_node(i), limit,
Andrew Mortona737b3e2006-03-22 00:08:11 -08003924 batchcount);
Siddha, Suresh Bd2e7b7d2006-09-25 23:31:47 -07003925 if (!new->new[i]) {
Pekka Enbergb28a02d2006-01-08 01:00:37 -08003926 for (i--; i >= 0; i--)
Siddha, Suresh Bd2e7b7d2006-09-25 23:31:47 -07003927 kfree(new->new[i]);
3928 kfree(new);
Christoph Lametere498be72005-09-09 13:03:32 -07003929 return -ENOMEM;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003930 }
3931 }
Siddha, Suresh Bd2e7b7d2006-09-25 23:31:47 -07003932 new->cachep = cachep;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003933
Jens Axboe15c8b6c2008-05-09 09:39:44 +02003934 on_each_cpu(do_ccupdate_local, (void *)new, 1);
Christoph Lametere498be72005-09-09 13:03:32 -07003935
Linus Torvalds1da177e2005-04-16 15:20:36 -07003936 check_irq_on();
Linus Torvalds1da177e2005-04-16 15:20:36 -07003937 cachep->batchcount = batchcount;
3938 cachep->limit = limit;
Christoph Lametere498be72005-09-09 13:03:32 -07003939 cachep->shared = shared;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003940
Christoph Lametere498be72005-09-09 13:03:32 -07003941 for_each_online_cpu(i) {
Siddha, Suresh Bd2e7b7d2006-09-25 23:31:47 -07003942 struct array_cache *ccold = new->new[i];
Linus Torvalds1da177e2005-04-16 15:20:36 -07003943 if (!ccold)
3944 continue;
Christoph Lametere498be72005-09-09 13:03:32 -07003945 spin_lock_irq(&cachep->nodelists[cpu_to_node(i)]->list_lock);
Christoph Lameterff694162005-09-22 21:44:02 -07003946 free_block(cachep, ccold->entry, ccold->avail, cpu_to_node(i));
Christoph Lametere498be72005-09-09 13:03:32 -07003947 spin_unlock_irq(&cachep->nodelists[cpu_to_node(i)]->list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003948 kfree(ccold);
3949 }
Siddha, Suresh Bd2e7b7d2006-09-25 23:31:47 -07003950 kfree(new);
Christoph Lameter2ed3a4e2006-09-25 23:31:38 -07003951 return alloc_kmemlist(cachep);
Linus Torvalds1da177e2005-04-16 15:20:36 -07003952}
3953
Ravikiran G Thirumalaib5d8ca72006-03-22 00:08:12 -08003954/* Called with cache_chain_mutex held always */
Christoph Lameter2ed3a4e2006-09-25 23:31:38 -07003955static int enable_cpucache(struct kmem_cache *cachep)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003956{
3957 int err;
3958 int limit, shared;
3959
Andrew Mortona737b3e2006-03-22 00:08:11 -08003960 /*
3961 * The head array serves three purposes:
Linus Torvalds1da177e2005-04-16 15:20:36 -07003962 * - create a LIFO ordering, i.e. return objects that are cache-warm
3963 * - reduce the number of spinlock operations.
Andrew Mortona737b3e2006-03-22 00:08:11 -08003964 * - reduce the number of linked list operations on the slab and
Linus Torvalds1da177e2005-04-16 15:20:36 -07003965 * bufctl chains: array operations are cheaper.
3966 * The numbers are guessed, we should auto-tune as described by
3967 * Bonwick.
3968 */
Manfred Spraul3dafccf2006-02-01 03:05:42 -08003969 if (cachep->buffer_size > 131072)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003970 limit = 1;
Manfred Spraul3dafccf2006-02-01 03:05:42 -08003971 else if (cachep->buffer_size > PAGE_SIZE)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003972 limit = 8;
Manfred Spraul3dafccf2006-02-01 03:05:42 -08003973 else if (cachep->buffer_size > 1024)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003974 limit = 24;
Manfred Spraul3dafccf2006-02-01 03:05:42 -08003975 else if (cachep->buffer_size > 256)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003976 limit = 54;
3977 else
3978 limit = 120;
3979
Andrew Mortona737b3e2006-03-22 00:08:11 -08003980 /*
3981 * CPU bound tasks (e.g. network routing) can exhibit cpu bound
Linus Torvalds1da177e2005-04-16 15:20:36 -07003982 * allocation behaviour: Most allocs on one cpu, most free operations
3983 * on another cpu. For these cases, an efficient object passing between
3984 * cpus is necessary. This is provided by a shared array. The array
3985 * replaces Bonwick's magazine layer.
3986 * On uniprocessor, it's functionally equivalent (but less efficient)
3987 * to a larger limit. Thus disabled by default.
3988 */
3989 shared = 0;
Eric Dumazet364fbb22007-05-06 14:49:27 -07003990 if (cachep->buffer_size <= PAGE_SIZE && num_possible_cpus() > 1)
Linus Torvalds1da177e2005-04-16 15:20:36 -07003991 shared = 8;
Linus Torvalds1da177e2005-04-16 15:20:36 -07003992
3993#if DEBUG
Andrew Mortona737b3e2006-03-22 00:08:11 -08003994 /*
3995 * With debugging enabled, large batchcount lead to excessively long
3996 * periods with disabled local interrupts. Limit the batchcount
Linus Torvalds1da177e2005-04-16 15:20:36 -07003997 */
3998 if (limit > 32)
3999 limit = 32;
4000#endif
Pekka Enbergb28a02d2006-01-08 01:00:37 -08004001 err = do_tune_cpucache(cachep, limit, (limit + 1) / 2, shared);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004002 if (err)
4003 printk(KERN_ERR "enable_cpucache failed for %s, error %d.\n",
Pekka Enbergb28a02d2006-01-08 01:00:37 -08004004 cachep->name, -err);
Christoph Lameter2ed3a4e2006-09-25 23:31:38 -07004005 return err;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004006}
4007
Christoph Lameter1b552532006-03-22 00:09:07 -08004008/*
4009 * Drain an array if it contains any elements taking the l3 lock only if
Christoph Lameterb18e7e62006-03-22 00:09:07 -08004010 * necessary. Note that the l3 listlock also protects the array_cache
4011 * if drain_array() is used on the shared array.
Christoph Lameter1b552532006-03-22 00:09:07 -08004012 */
4013void drain_array(struct kmem_cache *cachep, struct kmem_list3 *l3,
4014 struct array_cache *ac, int force, int node)
Linus Torvalds1da177e2005-04-16 15:20:36 -07004015{
4016 int tofree;
4017
Christoph Lameter1b552532006-03-22 00:09:07 -08004018 if (!ac || !ac->avail)
4019 return;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004020 if (ac->touched && !force) {
4021 ac->touched = 0;
Christoph Lameterb18e7e62006-03-22 00:09:07 -08004022 } else {
Christoph Lameter1b552532006-03-22 00:09:07 -08004023 spin_lock_irq(&l3->list_lock);
Christoph Lameterb18e7e62006-03-22 00:09:07 -08004024 if (ac->avail) {
4025 tofree = force ? ac->avail : (ac->limit + 4) / 5;
4026 if (tofree > ac->avail)
4027 tofree = (ac->avail + 1) / 2;
4028 free_block(cachep, ac->entry, tofree, node);
4029 ac->avail -= tofree;
4030 memmove(ac->entry, &(ac->entry[tofree]),
4031 sizeof(void *) * ac->avail);
4032 }
Christoph Lameter1b552532006-03-22 00:09:07 -08004033 spin_unlock_irq(&l3->list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004034 }
4035}
4036
4037/**
4038 * cache_reap - Reclaim memory from caches.
Randy Dunlap05fb6bf2007-02-28 20:12:13 -08004039 * @w: work descriptor
Linus Torvalds1da177e2005-04-16 15:20:36 -07004040 *
4041 * Called from workqueue/eventd every few seconds.
4042 * Purpose:
4043 * - clear the per-cpu caches for this CPU.
4044 * - return freeable pages to the main free memory pool.
4045 *
Andrew Mortona737b3e2006-03-22 00:08:11 -08004046 * If we cannot acquire the cache chain mutex then just give up - we'll try
4047 * again on the next iteration.
Linus Torvalds1da177e2005-04-16 15:20:36 -07004048 */
Christoph Lameter7c5cae32007-02-10 01:42:55 -08004049static void cache_reap(struct work_struct *w)
Linus Torvalds1da177e2005-04-16 15:20:36 -07004050{
Christoph Hellwig7a7c3812006-06-23 02:03:17 -07004051 struct kmem_cache *searchp;
Christoph Lametere498be72005-09-09 13:03:32 -07004052 struct kmem_list3 *l3;
Christoph Lameteraab22072006-03-22 00:09:06 -08004053 int node = numa_node_id();
Christoph Lameter7c5cae32007-02-10 01:42:55 -08004054 struct delayed_work *work =
4055 container_of(w, struct delayed_work, work);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004056
Christoph Lameter7c5cae32007-02-10 01:42:55 -08004057 if (!mutex_trylock(&cache_chain_mutex))
Linus Torvalds1da177e2005-04-16 15:20:36 -07004058 /* Give up. Setup the next iteration. */
Christoph Lameter7c5cae32007-02-10 01:42:55 -08004059 goto out;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004060
Christoph Hellwig7a7c3812006-06-23 02:03:17 -07004061 list_for_each_entry(searchp, &cache_chain, next) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07004062 check_irq_on();
4063
Christoph Lameter35386e32006-03-22 00:09:05 -08004064 /*
4065 * We only take the l3 lock if absolutely necessary and we
4066 * have established with reasonable certainty that
4067 * we can do some work if the lock was obtained.
4068 */
Christoph Lameteraab22072006-03-22 00:09:06 -08004069 l3 = searchp->nodelists[node];
Christoph Lameter35386e32006-03-22 00:09:05 -08004070
Christoph Lameter8fce4d82006-03-09 17:33:54 -08004071 reap_alien(searchp, l3);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004072
Christoph Lameteraab22072006-03-22 00:09:06 -08004073 drain_array(searchp, l3, cpu_cache_get(searchp), 0, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004074
Christoph Lameter35386e32006-03-22 00:09:05 -08004075 /*
4076 * These are racy checks but it does not matter
4077 * if we skip one check or scan twice.
4078 */
Christoph Lametere498be72005-09-09 13:03:32 -07004079 if (time_after(l3->next_reap, jiffies))
Christoph Lameter35386e32006-03-22 00:09:05 -08004080 goto next;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004081
Christoph Lametere498be72005-09-09 13:03:32 -07004082 l3->next_reap = jiffies + REAPTIMEOUT_LIST3;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004083
Christoph Lameteraab22072006-03-22 00:09:06 -08004084 drain_array(searchp, l3, l3->shared, 0, node);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004085
Christoph Lametered11d9e2006-06-30 01:55:45 -07004086 if (l3->free_touched)
Christoph Lametere498be72005-09-09 13:03:32 -07004087 l3->free_touched = 0;
Christoph Lametered11d9e2006-06-30 01:55:45 -07004088 else {
4089 int freed;
4090
4091 freed = drain_freelist(searchp, l3, (l3->free_limit +
4092 5 * searchp->num - 1) / (5 * searchp->num));
4093 STATS_ADD_REAPED(searchp, freed);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004094 }
Christoph Lameter35386e32006-03-22 00:09:05 -08004095next:
Linus Torvalds1da177e2005-04-16 15:20:36 -07004096 cond_resched();
4097 }
4098 check_irq_on();
Ingo Molnarfc0abb12006-01-18 17:42:33 -08004099 mutex_unlock(&cache_chain_mutex);
Christoph Lameter8fce4d82006-03-09 17:33:54 -08004100 next_reap_node();
Christoph Lameter7c5cae32007-02-10 01:42:55 -08004101out:
Andrew Mortona737b3e2006-03-22 00:08:11 -08004102 /* Set up the next iteration */
Christoph Lameter7c5cae32007-02-10 01:42:55 -08004103 schedule_delayed_work(work, round_jiffies_relative(REAPTIMEOUT_CPUC));
Linus Torvalds1da177e2005-04-16 15:20:36 -07004104}
4105
Linus Torvalds158a9622008-01-02 13:04:48 -08004106#ifdef CONFIG_SLABINFO
Linus Torvalds1da177e2005-04-16 15:20:36 -07004107
Pekka Enberg85289f92006-01-08 01:00:36 -08004108static void print_slabinfo_header(struct seq_file *m)
4109{
4110 /*
4111 * Output format version, so at least we can change it
4112 * without _too_ many complaints.
4113 */
4114#if STATS
4115 seq_puts(m, "slabinfo - version: 2.1 (statistics)\n");
4116#else
4117 seq_puts(m, "slabinfo - version: 2.1\n");
4118#endif
4119 seq_puts(m, "# name <active_objs> <num_objs> <objsize> "
4120 "<objperslab> <pagesperslab>");
4121 seq_puts(m, " : tunables <limit> <batchcount> <sharedfactor>");
4122 seq_puts(m, " : slabdata <active_slabs> <num_slabs> <sharedavail>");
4123#if STATS
4124 seq_puts(m, " : globalstat <listallocs> <maxobjs> <grown> <reaped> "
Ravikiran G Thirumalaifb7faf32006-04-10 22:52:54 -07004125 "<error> <maxfreeable> <nodeallocs> <remotefrees> <alienoverflow>");
Pekka Enberg85289f92006-01-08 01:00:36 -08004126 seq_puts(m, " : cpustat <allochit> <allocmiss> <freehit> <freemiss>");
4127#endif
4128 seq_putc(m, '\n');
4129}
4130
Linus Torvalds1da177e2005-04-16 15:20:36 -07004131static void *s_start(struct seq_file *m, loff_t *pos)
4132{
4133 loff_t n = *pos;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004134
Ingo Molnarfc0abb12006-01-18 17:42:33 -08004135 mutex_lock(&cache_chain_mutex);
Pekka Enberg85289f92006-01-08 01:00:36 -08004136 if (!n)
4137 print_slabinfo_header(m);
Pavel Emelianovb92151b2007-07-15 23:38:04 -07004138
4139 return seq_list_start(&cache_chain, *pos);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004140}
4141
4142static void *s_next(struct seq_file *m, void *p, loff_t *pos)
4143{
Pavel Emelianovb92151b2007-07-15 23:38:04 -07004144 return seq_list_next(p, &cache_chain, pos);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004145}
4146
4147static void s_stop(struct seq_file *m, void *p)
4148{
Ingo Molnarfc0abb12006-01-18 17:42:33 -08004149 mutex_unlock(&cache_chain_mutex);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004150}
4151
4152static int s_show(struct seq_file *m, void *p)
4153{
Pavel Emelianovb92151b2007-07-15 23:38:04 -07004154 struct kmem_cache *cachep = list_entry(p, struct kmem_cache, next);
Pekka Enbergb28a02d2006-01-08 01:00:37 -08004155 struct slab *slabp;
4156 unsigned long active_objs;
4157 unsigned long num_objs;
4158 unsigned long active_slabs = 0;
4159 unsigned long num_slabs, free_objects = 0, shared_avail = 0;
Christoph Lametere498be72005-09-09 13:03:32 -07004160 const char *name;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004161 char *error = NULL;
Christoph Lametere498be72005-09-09 13:03:32 -07004162 int node;
4163 struct kmem_list3 *l3;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004164
Linus Torvalds1da177e2005-04-16 15:20:36 -07004165 active_objs = 0;
4166 num_slabs = 0;
Christoph Lametere498be72005-09-09 13:03:32 -07004167 for_each_online_node(node) {
4168 l3 = cachep->nodelists[node];
4169 if (!l3)
4170 continue;
4171
Ravikiran G Thirumalaica3b9b92006-02-04 23:27:58 -08004172 check_irq_on();
4173 spin_lock_irq(&l3->list_lock);
Christoph Lametere498be72005-09-09 13:03:32 -07004174
Christoph Hellwig7a7c3812006-06-23 02:03:17 -07004175 list_for_each_entry(slabp, &l3->slabs_full, list) {
Christoph Lametere498be72005-09-09 13:03:32 -07004176 if (slabp->inuse != cachep->num && !error)
4177 error = "slabs_full accounting error";
4178 active_objs += cachep->num;
4179 active_slabs++;
4180 }
Christoph Hellwig7a7c3812006-06-23 02:03:17 -07004181 list_for_each_entry(slabp, &l3->slabs_partial, list) {
Christoph Lametere498be72005-09-09 13:03:32 -07004182 if (slabp->inuse == cachep->num && !error)
4183 error = "slabs_partial inuse accounting error";
4184 if (!slabp->inuse && !error)
4185 error = "slabs_partial/inuse accounting error";
4186 active_objs += slabp->inuse;
4187 active_slabs++;
4188 }
Christoph Hellwig7a7c3812006-06-23 02:03:17 -07004189 list_for_each_entry(slabp, &l3->slabs_free, list) {
Christoph Lametere498be72005-09-09 13:03:32 -07004190 if (slabp->inuse && !error)
4191 error = "slabs_free/inuse accounting error";
4192 num_slabs++;
4193 }
4194 free_objects += l3->free_objects;
Ravikiran G Thirumalai4484ebf2006-02-04 23:27:59 -08004195 if (l3->shared)
4196 shared_avail += l3->shared->avail;
Christoph Lametere498be72005-09-09 13:03:32 -07004197
Ravikiran G Thirumalaica3b9b92006-02-04 23:27:58 -08004198 spin_unlock_irq(&l3->list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004199 }
Pekka Enbergb28a02d2006-01-08 01:00:37 -08004200 num_slabs += active_slabs;
4201 num_objs = num_slabs * cachep->num;
Christoph Lametere498be72005-09-09 13:03:32 -07004202 if (num_objs - active_objs != free_objects && !error)
Linus Torvalds1da177e2005-04-16 15:20:36 -07004203 error = "free_objects accounting error";
4204
Pekka Enbergb28a02d2006-01-08 01:00:37 -08004205 name = cachep->name;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004206 if (error)
4207 printk(KERN_ERR "slab: cache %s error: %s\n", name, error);
4208
4209 seq_printf(m, "%-17s %6lu %6lu %6u %4u %4d",
Manfred Spraul3dafccf2006-02-01 03:05:42 -08004210 name, active_objs, num_objs, cachep->buffer_size,
Pekka Enbergb28a02d2006-01-08 01:00:37 -08004211 cachep->num, (1 << cachep->gfporder));
Linus Torvalds1da177e2005-04-16 15:20:36 -07004212 seq_printf(m, " : tunables %4u %4u %4u",
Pekka Enbergb28a02d2006-01-08 01:00:37 -08004213 cachep->limit, cachep->batchcount, cachep->shared);
Christoph Lametere498be72005-09-09 13:03:32 -07004214 seq_printf(m, " : slabdata %6lu %6lu %6lu",
Pekka Enbergb28a02d2006-01-08 01:00:37 -08004215 active_slabs, num_slabs, shared_avail);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004216#if STATS
Pekka Enbergb28a02d2006-01-08 01:00:37 -08004217 { /* list3 stats */
Linus Torvalds1da177e2005-04-16 15:20:36 -07004218 unsigned long high = cachep->high_mark;
4219 unsigned long allocs = cachep->num_allocations;
4220 unsigned long grown = cachep->grown;
4221 unsigned long reaped = cachep->reaped;
4222 unsigned long errors = cachep->errors;
4223 unsigned long max_freeable = cachep->max_freeable;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004224 unsigned long node_allocs = cachep->node_allocs;
Christoph Lametere498be72005-09-09 13:03:32 -07004225 unsigned long node_frees = cachep->node_frees;
Ravikiran G Thirumalaifb7faf32006-04-10 22:52:54 -07004226 unsigned long overflows = cachep->node_overflow;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004227
Christoph Lametere498be72005-09-09 13:03:32 -07004228 seq_printf(m, " : globalstat %7lu %6lu %5lu %4lu \
Ravikiran G Thirumalaifb7faf32006-04-10 22:52:54 -07004229 %4lu %4lu %4lu %4lu %4lu", allocs, high, grown,
Andrew Mortona737b3e2006-03-22 00:08:11 -08004230 reaped, errors, max_freeable, node_allocs,
Ravikiran G Thirumalaifb7faf32006-04-10 22:52:54 -07004231 node_frees, overflows);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004232 }
4233 /* cpu stats */
4234 {
4235 unsigned long allochit = atomic_read(&cachep->allochit);
4236 unsigned long allocmiss = atomic_read(&cachep->allocmiss);
4237 unsigned long freehit = atomic_read(&cachep->freehit);
4238 unsigned long freemiss = atomic_read(&cachep->freemiss);
4239
4240 seq_printf(m, " : cpustat %6lu %6lu %6lu %6lu",
Pekka Enbergb28a02d2006-01-08 01:00:37 -08004241 allochit, allocmiss, freehit, freemiss);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004242 }
4243#endif
4244 seq_putc(m, '\n');
Linus Torvalds1da177e2005-04-16 15:20:36 -07004245 return 0;
4246}
4247
4248/*
4249 * slabinfo_op - iterator that generates /proc/slabinfo
4250 *
4251 * Output layout:
4252 * cache-name
4253 * num-active-objs
4254 * total-objs
4255 * object size
4256 * num-active-slabs
4257 * total-slabs
4258 * num-pages-per-slab
4259 * + further values on SMP and with statistics enabled
4260 */
4261
Helge Deller15ad7cd2006-12-06 20:40:36 -08004262const struct seq_operations slabinfo_op = {
Pekka Enbergb28a02d2006-01-08 01:00:37 -08004263 .start = s_start,
4264 .next = s_next,
4265 .stop = s_stop,
4266 .show = s_show,
Linus Torvalds1da177e2005-04-16 15:20:36 -07004267};
4268
4269#define MAX_SLABINFO_WRITE 128
4270/**
4271 * slabinfo_write - Tuning for the slab allocator
4272 * @file: unused
4273 * @buffer: user buffer
4274 * @count: data length
4275 * @ppos: unused
4276 */
Pekka Enbergb28a02d2006-01-08 01:00:37 -08004277ssize_t slabinfo_write(struct file *file, const char __user * buffer,
4278 size_t count, loff_t *ppos)
Linus Torvalds1da177e2005-04-16 15:20:36 -07004279{
Pekka Enbergb28a02d2006-01-08 01:00:37 -08004280 char kbuf[MAX_SLABINFO_WRITE + 1], *tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004281 int limit, batchcount, shared, res;
Christoph Hellwig7a7c3812006-06-23 02:03:17 -07004282 struct kmem_cache *cachep;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08004283
Linus Torvalds1da177e2005-04-16 15:20:36 -07004284 if (count > MAX_SLABINFO_WRITE)
4285 return -EINVAL;
4286 if (copy_from_user(&kbuf, buffer, count))
4287 return -EFAULT;
Pekka Enbergb28a02d2006-01-08 01:00:37 -08004288 kbuf[MAX_SLABINFO_WRITE] = '\0';
Linus Torvalds1da177e2005-04-16 15:20:36 -07004289
4290 tmp = strchr(kbuf, ' ');
4291 if (!tmp)
4292 return -EINVAL;
4293 *tmp = '\0';
4294 tmp++;
4295 if (sscanf(tmp, " %d %d %d", &limit, &batchcount, &shared) != 3)
4296 return -EINVAL;
4297
4298 /* Find the cache in the chain of caches. */
Ingo Molnarfc0abb12006-01-18 17:42:33 -08004299 mutex_lock(&cache_chain_mutex);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004300 res = -EINVAL;
Christoph Hellwig7a7c3812006-06-23 02:03:17 -07004301 list_for_each_entry(cachep, &cache_chain, next) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07004302 if (!strcmp(cachep->name, kbuf)) {
Andrew Mortona737b3e2006-03-22 00:08:11 -08004303 if (limit < 1 || batchcount < 1 ||
4304 batchcount > limit || shared < 0) {
Christoph Lametere498be72005-09-09 13:03:32 -07004305 res = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004306 } else {
Christoph Lametere498be72005-09-09 13:03:32 -07004307 res = do_tune_cpucache(cachep, limit,
Pekka Enbergb28a02d2006-01-08 01:00:37 -08004308 batchcount, shared);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004309 }
4310 break;
4311 }
4312 }
Ingo Molnarfc0abb12006-01-18 17:42:33 -08004313 mutex_unlock(&cache_chain_mutex);
Linus Torvalds1da177e2005-04-16 15:20:36 -07004314 if (res >= 0)
4315 res = count;
4316 return res;
4317}
Al Viro871751e2006-03-25 03:06:39 -08004318
4319#ifdef CONFIG_DEBUG_SLAB_LEAK
4320
4321static void *leaks_start(struct seq_file *m, loff_t *pos)
4322{
Al Viro871751e2006-03-25 03:06:39 -08004323 mutex_lock(&cache_chain_mutex);
Pavel Emelianovb92151b2007-07-15 23:38:04 -07004324 return seq_list_start(&cache_chain, *pos);
Al Viro871751e2006-03-25 03:06:39 -08004325}
4326
4327static inline int add_caller(unsigned long *n, unsigned long v)
4328{
4329 unsigned long *p;
4330 int l;
4331 if (!v)
4332 return 1;
4333 l = n[1];
4334 p = n + 2;
4335 while (l) {
4336 int i = l/2;
4337 unsigned long *q = p + 2 * i;
4338 if (*q == v) {
4339 q[1]++;
4340 return 1;
4341 }
4342 if (*q > v) {
4343 l = i;
4344 } else {
4345 p = q + 2;
4346 l -= i + 1;
4347 }
4348 }
4349 if (++n[1] == n[0])
4350 return 0;
4351 memmove(p + 2, p, n[1] * 2 * sizeof(unsigned long) - ((void *)p - (void *)n));
4352 p[0] = v;
4353 p[1] = 1;
4354 return 1;
4355}
4356
4357static void handle_slab(unsigned long *n, struct kmem_cache *c, struct slab *s)
4358{
4359 void *p;
4360 int i;
4361 if (n[0] == n[1])
4362 return;
4363 for (i = 0, p = s->s_mem; i < c->num; i++, p += c->buffer_size) {
4364 if (slab_bufctl(s)[i] != BUFCTL_ACTIVE)
4365 continue;
4366 if (!add_caller(n, (unsigned long)*dbg_userword(c, p)))
4367 return;
4368 }
4369}
4370
4371static void show_symbol(struct seq_file *m, unsigned long address)
4372{
4373#ifdef CONFIG_KALLSYMS
Al Viro871751e2006-03-25 03:06:39 -08004374 unsigned long offset, size;
Tejun Heo9281ace2007-07-17 04:03:51 -07004375 char modname[MODULE_NAME_LEN], name[KSYM_NAME_LEN];
Al Viro871751e2006-03-25 03:06:39 -08004376
Alexey Dobriyana5c43da2007-05-08 00:28:47 -07004377 if (lookup_symbol_attrs(address, &size, &offset, modname, name) == 0) {
Al Viro871751e2006-03-25 03:06:39 -08004378 seq_printf(m, "%s+%#lx/%#lx", name, offset, size);
Alexey Dobriyana5c43da2007-05-08 00:28:47 -07004379 if (modname[0])
Al Viro871751e2006-03-25 03:06:39 -08004380 seq_printf(m, " [%s]", modname);
4381 return;
4382 }
4383#endif
4384 seq_printf(m, "%p", (void *)address);
4385}
4386
4387static int leaks_show(struct seq_file *m, void *p)
4388{
Pavel Emelianovb92151b2007-07-15 23:38:04 -07004389 struct kmem_cache *cachep = list_entry(p, struct kmem_cache, next);
Al Viro871751e2006-03-25 03:06:39 -08004390 struct slab *slabp;
4391 struct kmem_list3 *l3;
4392 const char *name;
4393 unsigned long *n = m->private;
4394 int node;
4395 int i;
4396
4397 if (!(cachep->flags & SLAB_STORE_USER))
4398 return 0;
4399 if (!(cachep->flags & SLAB_RED_ZONE))
4400 return 0;
4401
4402 /* OK, we can do it */
4403
4404 n[1] = 0;
4405
4406 for_each_online_node(node) {
4407 l3 = cachep->nodelists[node];
4408 if (!l3)
4409 continue;
4410
4411 check_irq_on();
4412 spin_lock_irq(&l3->list_lock);
4413
Christoph Hellwig7a7c3812006-06-23 02:03:17 -07004414 list_for_each_entry(slabp, &l3->slabs_full, list)
Al Viro871751e2006-03-25 03:06:39 -08004415 handle_slab(n, cachep, slabp);
Christoph Hellwig7a7c3812006-06-23 02:03:17 -07004416 list_for_each_entry(slabp, &l3->slabs_partial, list)
Al Viro871751e2006-03-25 03:06:39 -08004417 handle_slab(n, cachep, slabp);
Al Viro871751e2006-03-25 03:06:39 -08004418 spin_unlock_irq(&l3->list_lock);
4419 }
4420 name = cachep->name;
4421 if (n[0] == n[1]) {
4422 /* Increase the buffer size */
4423 mutex_unlock(&cache_chain_mutex);
4424 m->private = kzalloc(n[0] * 4 * sizeof(unsigned long), GFP_KERNEL);
4425 if (!m->private) {
4426 /* Too bad, we are really out */
4427 m->private = n;
4428 mutex_lock(&cache_chain_mutex);
4429 return -ENOMEM;
4430 }
4431 *(unsigned long *)m->private = n[0] * 2;
4432 kfree(n);
4433 mutex_lock(&cache_chain_mutex);
4434 /* Now make sure this entry will be retried */
4435 m->count = m->size;
4436 return 0;
4437 }
4438 for (i = 0; i < n[1]; i++) {
4439 seq_printf(m, "%s: %lu ", name, n[2*i+3]);
4440 show_symbol(m, n[2*i+2]);
4441 seq_putc(m, '\n');
4442 }
Siddha, Suresh Bd2e7b7d2006-09-25 23:31:47 -07004443
Al Viro871751e2006-03-25 03:06:39 -08004444 return 0;
4445}
4446
Helge Deller15ad7cd2006-12-06 20:40:36 -08004447const struct seq_operations slabstats_op = {
Al Viro871751e2006-03-25 03:06:39 -08004448 .start = leaks_start,
4449 .next = s_next,
4450 .stop = s_stop,
4451 .show = leaks_show,
4452};
4453#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07004454#endif
4455
Manfred Spraul00e145b2005-09-03 15:55:07 -07004456/**
4457 * ksize - get the actual amount of memory allocated for a given object
4458 * @objp: Pointer to the object
4459 *
4460 * kmalloc may internally round up allocations and return more memory
4461 * than requested. ksize() can be used to determine the actual amount of
4462 * memory allocated. The caller may use this additional memory, even though
4463 * a smaller amount of memory was initially specified with the kmalloc call.
4464 * The caller must guarantee that objp points to a valid object previously
4465 * allocated with either kmalloc() or kmem_cache_alloc(). The object
4466 * must not be freed during the duration of the call.
4467 */
Pekka Enbergfd76bab2007-05-06 14:48:40 -07004468size_t ksize(const void *objp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07004469{
Christoph Lameteref8b4522007-10-16 01:24:46 -07004470 BUG_ON(!objp);
4471 if (unlikely(objp == ZERO_SIZE_PTR))
Manfred Spraul00e145b2005-09-03 15:55:07 -07004472 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07004473
Pekka Enberg6ed5eb22006-02-01 03:05:49 -08004474 return obj_size(virt_to_cache(objp));
Linus Torvalds1da177e2005-04-16 15:20:36 -07004475}
Tetsuo Handaf8fcc932007-12-04 23:45:08 -08004476EXPORT_SYMBOL(ksize);