Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
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 | |
29 | * slabs and you must pass objects with the same intializations to | |
30 | * 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 | * | |
53 | * The c_cpuarray may not be read with enabled local interrupts - | |
54 | * it's changed with a smp_call_function(). | |
55 | * | |
56 | * SMP synchronization: | |
57 | * constructors and destructors are called without any locking. | |
343e0d7a | 58 | * Several members in struct kmem_cache and struct slab never change, they |
1da177e4 LT |
59 | * 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 | |
fc0abb14 | 71 | * The global cache-chain is protected by the mutex 'cache_chain_mutex'. |
1da177e4 LT |
72 | * 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 | * | |
e498be7d CL |
78 | * 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. | |
1da177e4 LT |
87 | */ |
88 | ||
89 | #include <linux/config.h> | |
90 | #include <linux/slab.h> | |
91 | #include <linux/mm.h> | |
92 | #include <linux/swap.h> | |
93 | #include <linux/cache.h> | |
94 | #include <linux/interrupt.h> | |
95 | #include <linux/init.h> | |
96 | #include <linux/compiler.h> | |
97 | #include <linux/seq_file.h> | |
98 | #include <linux/notifier.h> | |
99 | #include <linux/kallsyms.h> | |
100 | #include <linux/cpu.h> | |
101 | #include <linux/sysctl.h> | |
102 | #include <linux/module.h> | |
103 | #include <linux/rcupdate.h> | |
543537bd | 104 | #include <linux/string.h> |
e498be7d | 105 | #include <linux/nodemask.h> |
dc85da15 | 106 | #include <linux/mempolicy.h> |
fc0abb14 | 107 | #include <linux/mutex.h> |
1da177e4 LT |
108 | |
109 | #include <asm/uaccess.h> | |
110 | #include <asm/cacheflush.h> | |
111 | #include <asm/tlbflush.h> | |
112 | #include <asm/page.h> | |
113 | ||
114 | /* | |
115 | * DEBUG - 1 for kmem_cache_create() to honour; SLAB_DEBUG_INITIAL, | |
116 | * SLAB_RED_ZONE & SLAB_POISON. | |
117 | * 0 for faster, smaller code (especially in the critical paths). | |
118 | * | |
119 | * STATS - 1 to collect stats for /proc/slabinfo. | |
120 | * 0 for faster, smaller code (especially in the critical paths). | |
121 | * | |
122 | * FORCED_DEBUG - 1 enables SLAB_RED_ZONE and SLAB_POISON (if possible) | |
123 | */ | |
124 | ||
125 | #ifdef CONFIG_DEBUG_SLAB | |
126 | #define DEBUG 1 | |
127 | #define STATS 1 | |
128 | #define FORCED_DEBUG 1 | |
129 | #else | |
130 | #define DEBUG 0 | |
131 | #define STATS 0 | |
132 | #define FORCED_DEBUG 0 | |
133 | #endif | |
134 | ||
1da177e4 LT |
135 | /* Shouldn't this be in a header file somewhere? */ |
136 | #define BYTES_PER_WORD sizeof(void *) | |
137 | ||
138 | #ifndef cache_line_size | |
139 | #define cache_line_size() L1_CACHE_BYTES | |
140 | #endif | |
141 | ||
142 | #ifndef ARCH_KMALLOC_MINALIGN | |
143 | /* | |
144 | * Enforce a minimum alignment for the kmalloc caches. | |
145 | * Usually, the kmalloc caches are cache_line_size() aligned, except when | |
146 | * DEBUG and FORCED_DEBUG are enabled, then they are BYTES_PER_WORD aligned. | |
147 | * Some archs want to perform DMA into kmalloc caches and need a guaranteed | |
148 | * alignment larger than BYTES_PER_WORD. ARCH_KMALLOC_MINALIGN allows that. | |
149 | * Note that this flag disables some debug features. | |
150 | */ | |
151 | #define ARCH_KMALLOC_MINALIGN 0 | |
152 | #endif | |
153 | ||
154 | #ifndef ARCH_SLAB_MINALIGN | |
155 | /* | |
156 | * Enforce a minimum alignment for all caches. | |
157 | * Intended for archs that get misalignment faults even for BYTES_PER_WORD | |
158 | * aligned buffers. Includes ARCH_KMALLOC_MINALIGN. | |
159 | * If possible: Do not enable this flag for CONFIG_DEBUG_SLAB, it disables | |
160 | * some debug features. | |
161 | */ | |
162 | #define ARCH_SLAB_MINALIGN 0 | |
163 | #endif | |
164 | ||
165 | #ifndef ARCH_KMALLOC_FLAGS | |
166 | #define ARCH_KMALLOC_FLAGS SLAB_HWCACHE_ALIGN | |
167 | #endif | |
168 | ||
169 | /* Legal flag mask for kmem_cache_create(). */ | |
170 | #if DEBUG | |
171 | # define CREATE_MASK (SLAB_DEBUG_INITIAL | SLAB_RED_ZONE | \ | |
172 | SLAB_POISON | SLAB_HWCACHE_ALIGN | \ | |
173 | SLAB_NO_REAP | SLAB_CACHE_DMA | \ | |
174 | SLAB_MUST_HWCACHE_ALIGN | SLAB_STORE_USER | \ | |
175 | SLAB_RECLAIM_ACCOUNT | SLAB_PANIC | \ | |
176 | SLAB_DESTROY_BY_RCU) | |
177 | #else | |
178 | # define CREATE_MASK (SLAB_HWCACHE_ALIGN | SLAB_NO_REAP | \ | |
179 | SLAB_CACHE_DMA | SLAB_MUST_HWCACHE_ALIGN | \ | |
180 | SLAB_RECLAIM_ACCOUNT | SLAB_PANIC | \ | |
181 | SLAB_DESTROY_BY_RCU) | |
182 | #endif | |
183 | ||
184 | /* | |
185 | * kmem_bufctl_t: | |
186 | * | |
187 | * Bufctl's are used for linking objs within a slab | |
188 | * linked offsets. | |
189 | * | |
190 | * This implementation relies on "struct page" for locating the cache & | |
191 | * slab an object belongs to. | |
192 | * This allows the bufctl structure to be small (one int), but limits | |
193 | * the number of objects a slab (not a cache) can contain when off-slab | |
194 | * bufctls are used. The limit is the size of the largest general cache | |
195 | * that does not use off-slab slabs. | |
196 | * For 32bit archs with 4 kB pages, is this 56. | |
197 | * This is not serious, as it is only for large objects, when it is unwise | |
198 | * to have too many per slab. | |
199 | * Note: This limit can be raised by introducing a general cache whose size | |
200 | * is less than 512 (PAGE_SIZE<<3), but greater than 256. | |
201 | */ | |
202 | ||
fa5b08d5 | 203 | typedef unsigned int kmem_bufctl_t; |
1da177e4 LT |
204 | #define BUFCTL_END (((kmem_bufctl_t)(~0U))-0) |
205 | #define BUFCTL_FREE (((kmem_bufctl_t)(~0U))-1) | |
206 | #define SLAB_LIMIT (((kmem_bufctl_t)(~0U))-2) | |
207 | ||
208 | /* Max number of objs-per-slab for caches which use off-slab slabs. | |
209 | * Needed to avoid a possible looping condition in cache_grow(). | |
210 | */ | |
211 | static unsigned long offslab_limit; | |
212 | ||
213 | /* | |
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 | */ | |
220 | struct slab { | |
b28a02de PE |
221 | 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; | |
1da177e4 LT |
227 | }; |
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 | */ | |
245 | struct slab_rcu { | |
b28a02de | 246 | struct rcu_head head; |
343e0d7a | 247 | struct kmem_cache *cachep; |
b28a02de | 248 | void *addr; |
1da177e4 LT |
249 | }; |
250 | ||
251 | /* | |
252 | * struct array_cache | |
253 | * | |
1da177e4 LT |
254 | * 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 | */ | |
263 | struct array_cache { | |
264 | unsigned int avail; | |
265 | unsigned int limit; | |
266 | unsigned int batchcount; | |
267 | unsigned int touched; | |
e498be7d CL |
268 | spinlock_t lock; |
269 | void *entry[0]; /* | |
270 | * Must have this definition in here for the proper | |
271 | * alignment of array_cache. Also simplifies accessing | |
272 | * the entries. | |
273 | * [0] is for gcc 2.95. It should really be []. | |
274 | */ | |
1da177e4 LT |
275 | }; |
276 | ||
277 | /* bootstrap: The caches do not work without cpuarrays anymore, | |
278 | * but the cpuarrays are allocated from the generic caches... | |
279 | */ | |
280 | #define BOOT_CPUCACHE_ENTRIES 1 | |
281 | struct arraycache_init { | |
282 | struct array_cache cache; | |
b28a02de | 283 | void *entries[BOOT_CPUCACHE_ENTRIES]; |
1da177e4 LT |
284 | }; |
285 | ||
286 | /* | |
e498be7d | 287 | * The slab lists for all objects. |
1da177e4 LT |
288 | */ |
289 | struct kmem_list3 { | |
b28a02de PE |
290 | 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; | |
294 | unsigned long next_reap; | |
295 | int free_touched; | |
296 | unsigned int free_limit; | |
2e1217cf | 297 | unsigned int colour_next; /* Per-node cache coloring */ |
b28a02de PE |
298 | spinlock_t list_lock; |
299 | struct array_cache *shared; /* shared per node */ | |
300 | struct array_cache **alien; /* on other nodes */ | |
1da177e4 LT |
301 | }; |
302 | ||
e498be7d CL |
303 | /* |
304 | * Need this for bootstrapping a per node allocator. | |
305 | */ | |
306 | #define NUM_INIT_LISTS (2 * MAX_NUMNODES + 1) | |
307 | struct kmem_list3 __initdata initkmem_list3[NUM_INIT_LISTS]; | |
308 | #define CACHE_CACHE 0 | |
309 | #define SIZE_AC 1 | |
310 | #define SIZE_L3 (1 + MAX_NUMNODES) | |
311 | ||
312 | /* | |
7243cc05 | 313 | * This function must be completely optimized away if |
e498be7d CL |
314 | * a constant is passed to it. Mostly the same as |
315 | * what is in linux/slab.h except it returns an | |
316 | * index. | |
317 | */ | |
7243cc05 | 318 | static __always_inline int index_of(const size_t size) |
e498be7d | 319 | { |
5ec8a847 SR |
320 | extern void __bad_size(void); |
321 | ||
e498be7d CL |
322 | if (__builtin_constant_p(size)) { |
323 | int i = 0; | |
324 | ||
325 | #define CACHE(x) \ | |
326 | if (size <=x) \ | |
327 | return i; \ | |
328 | else \ | |
329 | i++; | |
330 | #include "linux/kmalloc_sizes.h" | |
331 | #undef CACHE | |
5ec8a847 | 332 | __bad_size(); |
7243cc05 | 333 | } else |
5ec8a847 | 334 | __bad_size(); |
e498be7d CL |
335 | return 0; |
336 | } | |
337 | ||
338 | #define INDEX_AC index_of(sizeof(struct arraycache_init)) | |
339 | #define INDEX_L3 index_of(sizeof(struct kmem_list3)) | |
1da177e4 | 340 | |
5295a74c | 341 | static void kmem_list3_init(struct kmem_list3 *parent) |
e498be7d CL |
342 | { |
343 | INIT_LIST_HEAD(&parent->slabs_full); | |
344 | INIT_LIST_HEAD(&parent->slabs_partial); | |
345 | INIT_LIST_HEAD(&parent->slabs_free); | |
346 | parent->shared = NULL; | |
347 | parent->alien = NULL; | |
2e1217cf | 348 | parent->colour_next = 0; |
e498be7d CL |
349 | spin_lock_init(&parent->list_lock); |
350 | parent->free_objects = 0; | |
351 | parent->free_touched = 0; | |
352 | } | |
353 | ||
354 | #define MAKE_LIST(cachep, listp, slab, nodeid) \ | |
355 | do { \ | |
356 | INIT_LIST_HEAD(listp); \ | |
357 | list_splice(&(cachep->nodelists[nodeid]->slab), listp); \ | |
358 | } while (0) | |
359 | ||
360 | #define MAKE_ALL_LISTS(cachep, ptr, nodeid) \ | |
361 | do { \ | |
362 | MAKE_LIST((cachep), (&(ptr)->slabs_full), slabs_full, nodeid); \ | |
363 | MAKE_LIST((cachep), (&(ptr)->slabs_partial), slabs_partial, nodeid); \ | |
364 | MAKE_LIST((cachep), (&(ptr)->slabs_free), slabs_free, nodeid); \ | |
365 | } while (0) | |
1da177e4 LT |
366 | |
367 | /* | |
343e0d7a | 368 | * struct kmem_cache |
1da177e4 LT |
369 | * |
370 | * manages a cache. | |
371 | */ | |
b28a02de | 372 | |
2109a2d1 | 373 | struct kmem_cache { |
1da177e4 | 374 | /* 1) per-cpu data, touched during every alloc/free */ |
b28a02de PE |
375 | struct array_cache *array[NR_CPUS]; |
376 | unsigned int batchcount; | |
377 | unsigned int limit; | |
378 | unsigned int shared; | |
3dafccf2 | 379 | unsigned int buffer_size; |
e498be7d | 380 | /* 2) touched by every alloc & free from the backend */ |
b28a02de PE |
381 | struct kmem_list3 *nodelists[MAX_NUMNODES]; |
382 | unsigned int flags; /* constant flags */ | |
383 | unsigned int num; /* # of objs per slab */ | |
384 | spinlock_t spinlock; | |
1da177e4 LT |
385 | |
386 | /* 3) cache_grow/shrink */ | |
387 | /* order of pgs per slab (2^n) */ | |
b28a02de | 388 | unsigned int gfporder; |
1da177e4 LT |
389 | |
390 | /* force GFP flags, e.g. GFP_DMA */ | |
b28a02de | 391 | gfp_t gfpflags; |
1da177e4 | 392 | |
b28a02de PE |
393 | size_t colour; /* cache colouring range */ |
394 | unsigned int colour_off; /* colour offset */ | |
343e0d7a | 395 | struct kmem_cache *slabp_cache; |
b28a02de PE |
396 | unsigned int slab_size; |
397 | unsigned int dflags; /* dynamic flags */ | |
1da177e4 LT |
398 | |
399 | /* constructor func */ | |
343e0d7a | 400 | void (*ctor) (void *, struct kmem_cache *, unsigned long); |
1da177e4 LT |
401 | |
402 | /* de-constructor func */ | |
343e0d7a | 403 | void (*dtor) (void *, struct kmem_cache *, unsigned long); |
1da177e4 LT |
404 | |
405 | /* 4) cache creation/removal */ | |
b28a02de PE |
406 | const char *name; |
407 | struct list_head next; | |
1da177e4 LT |
408 | |
409 | /* 5) statistics */ | |
410 | #if STATS | |
b28a02de PE |
411 | unsigned long num_active; |
412 | unsigned long num_allocations; | |
413 | unsigned long high_mark; | |
414 | unsigned long grown; | |
415 | unsigned long reaped; | |
416 | unsigned long errors; | |
417 | unsigned long max_freeable; | |
418 | unsigned long node_allocs; | |
419 | unsigned long node_frees; | |
420 | atomic_t allochit; | |
421 | atomic_t allocmiss; | |
422 | atomic_t freehit; | |
423 | atomic_t freemiss; | |
1da177e4 LT |
424 | #endif |
425 | #if DEBUG | |
3dafccf2 MS |
426 | /* |
427 | * If debugging is enabled, then the allocator can add additional | |
428 | * fields and/or padding to every object. buffer_size contains the total | |
429 | * object size including these internal fields, the following two | |
430 | * variables contain the offset to the user object and its size. | |
431 | */ | |
432 | int obj_offset; | |
433 | int obj_size; | |
1da177e4 LT |
434 | #endif |
435 | }; | |
436 | ||
437 | #define CFLGS_OFF_SLAB (0x80000000UL) | |
438 | #define OFF_SLAB(x) ((x)->flags & CFLGS_OFF_SLAB) | |
439 | ||
440 | #define BATCHREFILL_LIMIT 16 | |
441 | /* Optimization question: fewer reaps means less | |
442 | * probability for unnessary cpucache drain/refill cycles. | |
443 | * | |
dc6f3f27 | 444 | * OTOH the cpuarrays can contain lots of objects, |
1da177e4 LT |
445 | * which could lock up otherwise freeable slabs. |
446 | */ | |
447 | #define REAPTIMEOUT_CPUC (2*HZ) | |
448 | #define REAPTIMEOUT_LIST3 (4*HZ) | |
449 | ||
450 | #if STATS | |
451 | #define STATS_INC_ACTIVE(x) ((x)->num_active++) | |
452 | #define STATS_DEC_ACTIVE(x) ((x)->num_active--) | |
453 | #define STATS_INC_ALLOCED(x) ((x)->num_allocations++) | |
454 | #define STATS_INC_GROWN(x) ((x)->grown++) | |
455 | #define STATS_INC_REAPED(x) ((x)->reaped++) | |
456 | #define STATS_SET_HIGH(x) do { if ((x)->num_active > (x)->high_mark) \ | |
457 | (x)->high_mark = (x)->num_active; \ | |
458 | } while (0) | |
459 | #define STATS_INC_ERR(x) ((x)->errors++) | |
460 | #define STATS_INC_NODEALLOCS(x) ((x)->node_allocs++) | |
e498be7d | 461 | #define STATS_INC_NODEFREES(x) ((x)->node_frees++) |
1da177e4 LT |
462 | #define STATS_SET_FREEABLE(x, i) \ |
463 | do { if ((x)->max_freeable < i) \ | |
464 | (x)->max_freeable = i; \ | |
465 | } while (0) | |
466 | ||
467 | #define STATS_INC_ALLOCHIT(x) atomic_inc(&(x)->allochit) | |
468 | #define STATS_INC_ALLOCMISS(x) atomic_inc(&(x)->allocmiss) | |
469 | #define STATS_INC_FREEHIT(x) atomic_inc(&(x)->freehit) | |
470 | #define STATS_INC_FREEMISS(x) atomic_inc(&(x)->freemiss) | |
471 | #else | |
472 | #define STATS_INC_ACTIVE(x) do { } while (0) | |
473 | #define STATS_DEC_ACTIVE(x) do { } while (0) | |
474 | #define STATS_INC_ALLOCED(x) do { } while (0) | |
475 | #define STATS_INC_GROWN(x) do { } while (0) | |
476 | #define STATS_INC_REAPED(x) do { } while (0) | |
477 | #define STATS_SET_HIGH(x) do { } while (0) | |
478 | #define STATS_INC_ERR(x) do { } while (0) | |
479 | #define STATS_INC_NODEALLOCS(x) do { } while (0) | |
e498be7d | 480 | #define STATS_INC_NODEFREES(x) do { } while (0) |
1da177e4 LT |
481 | #define STATS_SET_FREEABLE(x, i) \ |
482 | do { } while (0) | |
483 | ||
484 | #define STATS_INC_ALLOCHIT(x) do { } while (0) | |
485 | #define STATS_INC_ALLOCMISS(x) do { } while (0) | |
486 | #define STATS_INC_FREEHIT(x) do { } while (0) | |
487 | #define STATS_INC_FREEMISS(x) do { } while (0) | |
488 | #endif | |
489 | ||
490 | #if DEBUG | |
491 | /* Magic nums for obj red zoning. | |
492 | * Placed in the first word before and the first word after an obj. | |
493 | */ | |
494 | #define RED_INACTIVE 0x5A2CF071UL /* when obj is inactive */ | |
495 | #define RED_ACTIVE 0x170FC2A5UL /* when obj is active */ | |
496 | ||
497 | /* ...and for poisoning */ | |
498 | #define POISON_INUSE 0x5a /* for use-uninitialised poisoning */ | |
499 | #define POISON_FREE 0x6b /* for use-after-free poisoning */ | |
500 | #define POISON_END 0xa5 /* end-byte of poisoning */ | |
501 | ||
502 | /* memory layout of objects: | |
503 | * 0 : objp | |
3dafccf2 | 504 | * 0 .. cachep->obj_offset - BYTES_PER_WORD - 1: padding. This ensures that |
1da177e4 LT |
505 | * the end of an object is aligned with the end of the real |
506 | * allocation. Catches writes behind the end of the allocation. | |
3dafccf2 | 507 | * cachep->obj_offset - BYTES_PER_WORD .. cachep->obj_offset - 1: |
1da177e4 | 508 | * redzone word. |
3dafccf2 MS |
509 | * cachep->obj_offset: The real object. |
510 | * cachep->buffer_size - 2* BYTES_PER_WORD: redzone word [BYTES_PER_WORD long] | |
511 | * cachep->buffer_size - 1* BYTES_PER_WORD: last caller address [BYTES_PER_WORD long] | |
1da177e4 | 512 | */ |
343e0d7a | 513 | static int obj_offset(struct kmem_cache *cachep) |
1da177e4 | 514 | { |
3dafccf2 | 515 | return cachep->obj_offset; |
1da177e4 LT |
516 | } |
517 | ||
343e0d7a | 518 | static int obj_size(struct kmem_cache *cachep) |
1da177e4 | 519 | { |
3dafccf2 | 520 | return cachep->obj_size; |
1da177e4 LT |
521 | } |
522 | ||
343e0d7a | 523 | static unsigned long *dbg_redzone1(struct kmem_cache *cachep, void *objp) |
1da177e4 LT |
524 | { |
525 | BUG_ON(!(cachep->flags & SLAB_RED_ZONE)); | |
3dafccf2 | 526 | return (unsigned long*) (objp+obj_offset(cachep)-BYTES_PER_WORD); |
1da177e4 LT |
527 | } |
528 | ||
343e0d7a | 529 | static unsigned long *dbg_redzone2(struct kmem_cache *cachep, void *objp) |
1da177e4 LT |
530 | { |
531 | BUG_ON(!(cachep->flags & SLAB_RED_ZONE)); | |
532 | if (cachep->flags & SLAB_STORE_USER) | |
3dafccf2 | 533 | return (unsigned long *)(objp + cachep->buffer_size - |
b28a02de | 534 | 2 * BYTES_PER_WORD); |
3dafccf2 | 535 | return (unsigned long *)(objp + cachep->buffer_size - BYTES_PER_WORD); |
1da177e4 LT |
536 | } |
537 | ||
343e0d7a | 538 | static void **dbg_userword(struct kmem_cache *cachep, void *objp) |
1da177e4 LT |
539 | { |
540 | BUG_ON(!(cachep->flags & SLAB_STORE_USER)); | |
3dafccf2 | 541 | return (void **)(objp + cachep->buffer_size - BYTES_PER_WORD); |
1da177e4 LT |
542 | } |
543 | ||
544 | #else | |
545 | ||
3dafccf2 MS |
546 | #define obj_offset(x) 0 |
547 | #define obj_size(cachep) (cachep->buffer_size) | |
1da177e4 LT |
548 | #define dbg_redzone1(cachep, objp) ({BUG(); (unsigned long *)NULL;}) |
549 | #define dbg_redzone2(cachep, objp) ({BUG(); (unsigned long *)NULL;}) | |
550 | #define dbg_userword(cachep, objp) ({BUG(); (void **)NULL;}) | |
551 | ||
552 | #endif | |
553 | ||
554 | /* | |
555 | * Maximum size of an obj (in 2^order pages) | |
556 | * and absolute limit for the gfp order. | |
557 | */ | |
558 | #if defined(CONFIG_LARGE_ALLOCS) | |
559 | #define MAX_OBJ_ORDER 13 /* up to 32Mb */ | |
560 | #define MAX_GFP_ORDER 13 /* up to 32Mb */ | |
561 | #elif defined(CONFIG_MMU) | |
562 | #define MAX_OBJ_ORDER 5 /* 32 pages */ | |
563 | #define MAX_GFP_ORDER 5 /* 32 pages */ | |
564 | #else | |
565 | #define MAX_OBJ_ORDER 8 /* up to 1Mb */ | |
566 | #define MAX_GFP_ORDER 8 /* up to 1Mb */ | |
567 | #endif | |
568 | ||
569 | /* | |
570 | * Do not go above this order unless 0 objects fit into the slab. | |
571 | */ | |
572 | #define BREAK_GFP_ORDER_HI 1 | |
573 | #define BREAK_GFP_ORDER_LO 0 | |
574 | static int slab_break_gfp_order = BREAK_GFP_ORDER_LO; | |
575 | ||
065d41cb | 576 | /* Functions for storing/retrieving the cachep and or slab from the |
1da177e4 LT |
577 | * global 'mem_map'. These are used to find the slab an obj belongs to. |
578 | * With kfree(), these are used to find the cache which an obj belongs to. | |
579 | */ | |
065d41cb PE |
580 | static inline void page_set_cache(struct page *page, struct kmem_cache *cache) |
581 | { | |
582 | page->lru.next = (struct list_head *)cache; | |
583 | } | |
584 | ||
585 | static inline struct kmem_cache *page_get_cache(struct page *page) | |
586 | { | |
587 | return (struct kmem_cache *)page->lru.next; | |
588 | } | |
589 | ||
590 | static inline void page_set_slab(struct page *page, struct slab *slab) | |
591 | { | |
592 | page->lru.prev = (struct list_head *)slab; | |
593 | } | |
594 | ||
595 | static inline struct slab *page_get_slab(struct page *page) | |
596 | { | |
597 | return (struct slab *)page->lru.prev; | |
598 | } | |
1da177e4 | 599 | |
6ed5eb22 PE |
600 | static inline struct kmem_cache *virt_to_cache(const void *obj) |
601 | { | |
602 | struct page *page = virt_to_page(obj); | |
603 | return page_get_cache(page); | |
604 | } | |
605 | ||
606 | static inline struct slab *virt_to_slab(const void *obj) | |
607 | { | |
608 | struct page *page = virt_to_page(obj); | |
609 | return page_get_slab(page); | |
610 | } | |
611 | ||
1da177e4 LT |
612 | /* These are the default caches for kmalloc. Custom caches can have other sizes. */ |
613 | struct cache_sizes malloc_sizes[] = { | |
614 | #define CACHE(x) { .cs_size = (x) }, | |
615 | #include <linux/kmalloc_sizes.h> | |
616 | CACHE(ULONG_MAX) | |
617 | #undef CACHE | |
618 | }; | |
619 | EXPORT_SYMBOL(malloc_sizes); | |
620 | ||
621 | /* Must match cache_sizes above. Out of line to keep cache footprint low. */ | |
622 | struct cache_names { | |
623 | char *name; | |
624 | char *name_dma; | |
625 | }; | |
626 | ||
627 | static struct cache_names __initdata cache_names[] = { | |
628 | #define CACHE(x) { .name = "size-" #x, .name_dma = "size-" #x "(DMA)" }, | |
629 | #include <linux/kmalloc_sizes.h> | |
b28a02de | 630 | {NULL,} |
1da177e4 LT |
631 | #undef CACHE |
632 | }; | |
633 | ||
634 | static struct arraycache_init initarray_cache __initdata = | |
b28a02de | 635 | { {0, BOOT_CPUCACHE_ENTRIES, 1, 0} }; |
1da177e4 | 636 | static struct arraycache_init initarray_generic = |
b28a02de | 637 | { {0, BOOT_CPUCACHE_ENTRIES, 1, 0} }; |
1da177e4 LT |
638 | |
639 | /* internal cache of cache description objs */ | |
343e0d7a | 640 | static struct kmem_cache cache_cache = { |
b28a02de PE |
641 | .batchcount = 1, |
642 | .limit = BOOT_CPUCACHE_ENTRIES, | |
643 | .shared = 1, | |
343e0d7a | 644 | .buffer_size = sizeof(struct kmem_cache), |
b28a02de PE |
645 | .flags = SLAB_NO_REAP, |
646 | .spinlock = SPIN_LOCK_UNLOCKED, | |
647 | .name = "kmem_cache", | |
1da177e4 | 648 | #if DEBUG |
343e0d7a | 649 | .obj_size = sizeof(struct kmem_cache), |
1da177e4 LT |
650 | #endif |
651 | }; | |
652 | ||
653 | /* Guard access to the cache-chain. */ | |
fc0abb14 | 654 | static DEFINE_MUTEX(cache_chain_mutex); |
1da177e4 LT |
655 | static struct list_head cache_chain; |
656 | ||
657 | /* | |
658 | * vm_enough_memory() looks at this to determine how many | |
659 | * slab-allocated pages are possibly freeable under pressure | |
660 | * | |
661 | * SLAB_RECLAIM_ACCOUNT turns this on per-slab | |
662 | */ | |
663 | atomic_t slab_reclaim_pages; | |
1da177e4 LT |
664 | |
665 | /* | |
666 | * chicken and egg problem: delay the per-cpu array allocation | |
667 | * until the general caches are up. | |
668 | */ | |
669 | static enum { | |
670 | NONE, | |
e498be7d CL |
671 | PARTIAL_AC, |
672 | PARTIAL_L3, | |
1da177e4 LT |
673 | FULL |
674 | } g_cpucache_up; | |
675 | ||
676 | static DEFINE_PER_CPU(struct work_struct, reap_work); | |
677 | ||
343e0d7a PE |
678 | static void free_block(struct kmem_cache *cachep, void **objpp, int len, int node); |
679 | static void enable_cpucache(struct kmem_cache *cachep); | |
b28a02de | 680 | static void cache_reap(void *unused); |
343e0d7a | 681 | static int __node_shrink(struct kmem_cache *cachep, int node); |
1da177e4 | 682 | |
343e0d7a | 683 | static inline struct array_cache *cpu_cache_get(struct kmem_cache *cachep) |
1da177e4 LT |
684 | { |
685 | return cachep->array[smp_processor_id()]; | |
686 | } | |
687 | ||
343e0d7a | 688 | static inline struct kmem_cache *__find_general_cachep(size_t size, gfp_t gfpflags) |
1da177e4 LT |
689 | { |
690 | struct cache_sizes *csizep = malloc_sizes; | |
691 | ||
692 | #if DEBUG | |
693 | /* This happens if someone tries to call | |
b28a02de PE |
694 | * kmem_cache_create(), or __kmalloc(), before |
695 | * the generic caches are initialized. | |
696 | */ | |
c7e43c78 | 697 | BUG_ON(malloc_sizes[INDEX_AC].cs_cachep == NULL); |
1da177e4 LT |
698 | #endif |
699 | while (size > csizep->cs_size) | |
700 | csizep++; | |
701 | ||
702 | /* | |
0abf40c1 | 703 | * Really subtle: The last entry with cs->cs_size==ULONG_MAX |
1da177e4 LT |
704 | * has cs_{dma,}cachep==NULL. Thus no special case |
705 | * for large kmalloc calls required. | |
706 | */ | |
707 | if (unlikely(gfpflags & GFP_DMA)) | |
708 | return csizep->cs_dmacachep; | |
709 | return csizep->cs_cachep; | |
710 | } | |
711 | ||
343e0d7a | 712 | struct kmem_cache *kmem_find_general_cachep(size_t size, gfp_t gfpflags) |
97e2bde4 MS |
713 | { |
714 | return __find_general_cachep(size, gfpflags); | |
715 | } | |
716 | EXPORT_SYMBOL(kmem_find_general_cachep); | |
717 | ||
fbaccacf | 718 | static size_t slab_mgmt_size(size_t nr_objs, size_t align) |
1da177e4 | 719 | { |
fbaccacf SR |
720 | return ALIGN(sizeof(struct slab)+nr_objs*sizeof(kmem_bufctl_t), align); |
721 | } | |
1da177e4 | 722 | |
fbaccacf SR |
723 | /* Calculate the number of objects and left-over bytes for a given |
724 | buffer size. */ | |
725 | static void cache_estimate(unsigned long gfporder, size_t buffer_size, | |
726 | size_t align, int flags, size_t *left_over, | |
727 | unsigned int *num) | |
728 | { | |
729 | int nr_objs; | |
730 | size_t mgmt_size; | |
731 | size_t slab_size = PAGE_SIZE << gfporder; | |
1da177e4 | 732 | |
fbaccacf SR |
733 | /* |
734 | * The slab management structure can be either off the slab or | |
735 | * on it. For the latter case, the memory allocated for a | |
736 | * slab is used for: | |
737 | * | |
738 | * - The struct slab | |
739 | * - One kmem_bufctl_t for each object | |
740 | * - Padding to respect alignment of @align | |
741 | * - @buffer_size bytes for each object | |
742 | * | |
743 | * If the slab management structure is off the slab, then the | |
744 | * alignment will already be calculated into the size. Because | |
745 | * the slabs are all pages aligned, the objects will be at the | |
746 | * correct alignment when allocated. | |
747 | */ | |
748 | if (flags & CFLGS_OFF_SLAB) { | |
749 | mgmt_size = 0; | |
750 | nr_objs = slab_size / buffer_size; | |
751 | ||
752 | if (nr_objs > SLAB_LIMIT) | |
753 | nr_objs = SLAB_LIMIT; | |
754 | } else { | |
755 | /* | |
756 | * Ignore padding for the initial guess. The padding | |
757 | * is at most @align-1 bytes, and @buffer_size is at | |
758 | * least @align. In the worst case, this result will | |
759 | * be one greater than the number of objects that fit | |
760 | * into the memory allocation when taking the padding | |
761 | * into account. | |
762 | */ | |
763 | nr_objs = (slab_size - sizeof(struct slab)) / | |
764 | (buffer_size + sizeof(kmem_bufctl_t)); | |
765 | ||
766 | /* | |
767 | * This calculated number will be either the right | |
768 | * amount, or one greater than what we want. | |
769 | */ | |
770 | if (slab_mgmt_size(nr_objs, align) + nr_objs*buffer_size | |
771 | > slab_size) | |
772 | nr_objs--; | |
773 | ||
774 | if (nr_objs > SLAB_LIMIT) | |
775 | nr_objs = SLAB_LIMIT; | |
776 | ||
777 | mgmt_size = slab_mgmt_size(nr_objs, align); | |
778 | } | |
779 | *num = nr_objs; | |
780 | *left_over = slab_size - nr_objs*buffer_size - mgmt_size; | |
1da177e4 LT |
781 | } |
782 | ||
783 | #define slab_error(cachep, msg) __slab_error(__FUNCTION__, cachep, msg) | |
784 | ||
343e0d7a | 785 | static void __slab_error(const char *function, struct kmem_cache *cachep, char *msg) |
1da177e4 LT |
786 | { |
787 | printk(KERN_ERR "slab error in %s(): cache `%s': %s\n", | |
b28a02de | 788 | function, cachep->name, msg); |
1da177e4 LT |
789 | dump_stack(); |
790 | } | |
791 | ||
792 | /* | |
793 | * Initiate the reap timer running on the target CPU. We run at around 1 to 2Hz | |
794 | * via the workqueue/eventd. | |
795 | * Add the CPU number into the expiration time to minimize the possibility of | |
796 | * the CPUs getting into lockstep and contending for the global cache chain | |
797 | * lock. | |
798 | */ | |
799 | static void __devinit start_cpu_timer(int cpu) | |
800 | { | |
801 | struct work_struct *reap_work = &per_cpu(reap_work, cpu); | |
802 | ||
803 | /* | |
804 | * When this gets called from do_initcalls via cpucache_init(), | |
805 | * init_workqueues() has already run, so keventd will be setup | |
806 | * at that time. | |
807 | */ | |
808 | if (keventd_up() && reap_work->func == NULL) { | |
809 | INIT_WORK(reap_work, cache_reap, NULL); | |
810 | schedule_delayed_work_on(cpu, reap_work, HZ + 3 * cpu); | |
811 | } | |
812 | } | |
813 | ||
e498be7d | 814 | static struct array_cache *alloc_arraycache(int node, int entries, |
b28a02de | 815 | int batchcount) |
1da177e4 | 816 | { |
b28a02de | 817 | int memsize = sizeof(void *) * entries + sizeof(struct array_cache); |
1da177e4 LT |
818 | struct array_cache *nc = NULL; |
819 | ||
e498be7d | 820 | nc = kmalloc_node(memsize, GFP_KERNEL, node); |
1da177e4 LT |
821 | if (nc) { |
822 | nc->avail = 0; | |
823 | nc->limit = entries; | |
824 | nc->batchcount = batchcount; | |
825 | nc->touched = 0; | |
e498be7d | 826 | spin_lock_init(&nc->lock); |
1da177e4 LT |
827 | } |
828 | return nc; | |
829 | } | |
830 | ||
e498be7d | 831 | #ifdef CONFIG_NUMA |
343e0d7a | 832 | static void *__cache_alloc_node(struct kmem_cache *, gfp_t, int); |
dc85da15 | 833 | |
5295a74c | 834 | static struct array_cache **alloc_alien_cache(int node, int limit) |
e498be7d CL |
835 | { |
836 | struct array_cache **ac_ptr; | |
b28a02de | 837 | int memsize = sizeof(void *) * MAX_NUMNODES; |
e498be7d CL |
838 | int i; |
839 | ||
840 | if (limit > 1) | |
841 | limit = 12; | |
842 | ac_ptr = kmalloc_node(memsize, GFP_KERNEL, node); | |
843 | if (ac_ptr) { | |
844 | for_each_node(i) { | |
845 | if (i == node || !node_online(i)) { | |
846 | ac_ptr[i] = NULL; | |
847 | continue; | |
848 | } | |
849 | ac_ptr[i] = alloc_arraycache(node, limit, 0xbaadf00d); | |
850 | if (!ac_ptr[i]) { | |
b28a02de | 851 | for (i--; i <= 0; i--) |
e498be7d CL |
852 | kfree(ac_ptr[i]); |
853 | kfree(ac_ptr); | |
854 | return NULL; | |
855 | } | |
856 | } | |
857 | } | |
858 | return ac_ptr; | |
859 | } | |
860 | ||
5295a74c | 861 | static void free_alien_cache(struct array_cache **ac_ptr) |
e498be7d CL |
862 | { |
863 | int i; | |
864 | ||
865 | if (!ac_ptr) | |
866 | return; | |
867 | ||
868 | for_each_node(i) | |
b28a02de | 869 | kfree(ac_ptr[i]); |
e498be7d CL |
870 | |
871 | kfree(ac_ptr); | |
872 | } | |
873 | ||
343e0d7a | 874 | static void __drain_alien_cache(struct kmem_cache *cachep, |
5295a74c | 875 | struct array_cache *ac, int node) |
e498be7d CL |
876 | { |
877 | struct kmem_list3 *rl3 = cachep->nodelists[node]; | |
878 | ||
879 | if (ac->avail) { | |
880 | spin_lock(&rl3->list_lock); | |
ff69416e | 881 | free_block(cachep, ac->entry, ac->avail, node); |
e498be7d CL |
882 | ac->avail = 0; |
883 | spin_unlock(&rl3->list_lock); | |
884 | } | |
885 | } | |
886 | ||
4484ebf1 | 887 | static void drain_alien_cache(struct kmem_cache *cachep, struct array_cache **alien) |
e498be7d | 888 | { |
b28a02de | 889 | int i = 0; |
e498be7d CL |
890 | struct array_cache *ac; |
891 | unsigned long flags; | |
892 | ||
893 | for_each_online_node(i) { | |
4484ebf1 | 894 | ac = alien[i]; |
e498be7d CL |
895 | if (ac) { |
896 | spin_lock_irqsave(&ac->lock, flags); | |
897 | __drain_alien_cache(cachep, ac, i); | |
898 | spin_unlock_irqrestore(&ac->lock, flags); | |
899 | } | |
900 | } | |
901 | } | |
902 | #else | |
7a21ef6f | 903 | |
4484ebf1 RT |
904 | #define drain_alien_cache(cachep, alien) do { } while (0) |
905 | ||
7a21ef6f LT |
906 | static inline struct array_cache **alloc_alien_cache(int node, int limit) |
907 | { | |
908 | return (struct array_cache **) 0x01020304ul; | |
909 | } | |
910 | ||
4484ebf1 RT |
911 | static inline void free_alien_cache(struct array_cache **ac_ptr) |
912 | { | |
913 | } | |
7a21ef6f | 914 | |
e498be7d CL |
915 | #endif |
916 | ||
1da177e4 | 917 | static int __devinit cpuup_callback(struct notifier_block *nfb, |
b28a02de | 918 | unsigned long action, void *hcpu) |
1da177e4 LT |
919 | { |
920 | long cpu = (long)hcpu; | |
343e0d7a | 921 | struct kmem_cache *cachep; |
e498be7d CL |
922 | struct kmem_list3 *l3 = NULL; |
923 | int node = cpu_to_node(cpu); | |
924 | int memsize = sizeof(struct kmem_list3); | |
1da177e4 LT |
925 | |
926 | switch (action) { | |
927 | case CPU_UP_PREPARE: | |
fc0abb14 | 928 | mutex_lock(&cache_chain_mutex); |
e498be7d CL |
929 | /* we need to do this right in the beginning since |
930 | * alloc_arraycache's are going to use this list. | |
931 | * kmalloc_node allows us to add the slab to the right | |
932 | * kmem_list3 and not this cpu's kmem_list3 | |
933 | */ | |
934 | ||
1da177e4 | 935 | list_for_each_entry(cachep, &cache_chain, next) { |
e498be7d CL |
936 | /* setup the size64 kmemlist for cpu before we can |
937 | * begin anything. Make sure some other cpu on this | |
938 | * node has not already allocated this | |
939 | */ | |
940 | if (!cachep->nodelists[node]) { | |
941 | if (!(l3 = kmalloc_node(memsize, | |
b28a02de | 942 | GFP_KERNEL, node))) |
e498be7d CL |
943 | goto bad; |
944 | kmem_list3_init(l3); | |
945 | l3->next_reap = jiffies + REAPTIMEOUT_LIST3 + | |
b28a02de | 946 | ((unsigned long)cachep) % REAPTIMEOUT_LIST3; |
e498be7d | 947 | |
4484ebf1 RT |
948 | /* |
949 | * The l3s don't come and go as CPUs come and | |
950 | * go. cache_chain_mutex is sufficient | |
951 | * protection here. | |
952 | */ | |
e498be7d CL |
953 | cachep->nodelists[node] = l3; |
954 | } | |
1da177e4 | 955 | |
e498be7d CL |
956 | spin_lock_irq(&cachep->nodelists[node]->list_lock); |
957 | cachep->nodelists[node]->free_limit = | |
b28a02de PE |
958 | (1 + nr_cpus_node(node)) * |
959 | cachep->batchcount + cachep->num; | |
e498be7d CL |
960 | spin_unlock_irq(&cachep->nodelists[node]->list_lock); |
961 | } | |
962 | ||
963 | /* Now we can go ahead with allocating the shared array's | |
b28a02de | 964 | & array cache's */ |
e498be7d | 965 | list_for_each_entry(cachep, &cache_chain, next) { |
cd105df4 | 966 | struct array_cache *nc; |
4484ebf1 RT |
967 | struct array_cache *shared; |
968 | struct array_cache **alien; | |
cd105df4 | 969 | |
e498be7d | 970 | nc = alloc_arraycache(node, cachep->limit, |
4484ebf1 | 971 | cachep->batchcount); |
1da177e4 LT |
972 | if (!nc) |
973 | goto bad; | |
4484ebf1 RT |
974 | shared = alloc_arraycache(node, |
975 | cachep->shared * cachep->batchcount, | |
976 | 0xbaadf00d); | |
977 | if (!shared) | |
978 | goto bad; | |
7a21ef6f | 979 | |
4484ebf1 RT |
980 | alien = alloc_alien_cache(node, cachep->limit); |
981 | if (!alien) | |
982 | goto bad; | |
1da177e4 | 983 | cachep->array[cpu] = nc; |
1da177e4 | 984 | |
e498be7d CL |
985 | l3 = cachep->nodelists[node]; |
986 | BUG_ON(!l3); | |
e498be7d | 987 | |
4484ebf1 RT |
988 | spin_lock_irq(&l3->list_lock); |
989 | if (!l3->shared) { | |
990 | /* | |
991 | * We are serialised from CPU_DEAD or | |
992 | * CPU_UP_CANCELLED by the cpucontrol lock | |
993 | */ | |
994 | l3->shared = shared; | |
995 | shared = NULL; | |
e498be7d | 996 | } |
4484ebf1 RT |
997 | #ifdef CONFIG_NUMA |
998 | if (!l3->alien) { | |
999 | l3->alien = alien; | |
1000 | alien = NULL; | |
1001 | } | |
1002 | #endif | |
1003 | spin_unlock_irq(&l3->list_lock); | |
1004 | ||
1005 | kfree(shared); | |
1006 | free_alien_cache(alien); | |
1da177e4 | 1007 | } |
fc0abb14 | 1008 | mutex_unlock(&cache_chain_mutex); |
1da177e4 LT |
1009 | break; |
1010 | case CPU_ONLINE: | |
1011 | start_cpu_timer(cpu); | |
1012 | break; | |
1013 | #ifdef CONFIG_HOTPLUG_CPU | |
1014 | case CPU_DEAD: | |
4484ebf1 RT |
1015 | /* |
1016 | * Even if all the cpus of a node are down, we don't free the | |
1017 | * kmem_list3 of any cache. This to avoid a race between | |
1018 | * cpu_down, and a kmalloc allocation from another cpu for | |
1019 | * memory from the node of the cpu going down. The list3 | |
1020 | * structure is usually allocated from kmem_cache_create() and | |
1021 | * gets destroyed at kmem_cache_destroy(). | |
1022 | */ | |
1da177e4 LT |
1023 | /* fall thru */ |
1024 | case CPU_UP_CANCELED: | |
fc0abb14 | 1025 | mutex_lock(&cache_chain_mutex); |
1da177e4 LT |
1026 | |
1027 | list_for_each_entry(cachep, &cache_chain, next) { | |
1028 | struct array_cache *nc; | |
4484ebf1 RT |
1029 | struct array_cache *shared; |
1030 | struct array_cache **alien; | |
e498be7d | 1031 | cpumask_t mask; |
1da177e4 | 1032 | |
e498be7d | 1033 | mask = node_to_cpumask(node); |
1da177e4 LT |
1034 | /* cpu is dead; no one can alloc from it. */ |
1035 | nc = cachep->array[cpu]; | |
1036 | cachep->array[cpu] = NULL; | |
e498be7d CL |
1037 | l3 = cachep->nodelists[node]; |
1038 | ||
1039 | if (!l3) | |
4484ebf1 | 1040 | goto free_array_cache; |
e498be7d | 1041 | |
ca3b9b91 | 1042 | spin_lock_irq(&l3->list_lock); |
e498be7d CL |
1043 | |
1044 | /* Free limit for this kmem_list3 */ | |
1045 | l3->free_limit -= cachep->batchcount; | |
1046 | if (nc) | |
ff69416e | 1047 | free_block(cachep, nc->entry, nc->avail, node); |
e498be7d CL |
1048 | |
1049 | if (!cpus_empty(mask)) { | |
ca3b9b91 | 1050 | spin_unlock_irq(&l3->list_lock); |
4484ebf1 | 1051 | goto free_array_cache; |
b28a02de | 1052 | } |
e498be7d | 1053 | |
4484ebf1 RT |
1054 | shared = l3->shared; |
1055 | if (shared) { | |
e498be7d | 1056 | free_block(cachep, l3->shared->entry, |
b28a02de | 1057 | l3->shared->avail, node); |
e498be7d CL |
1058 | l3->shared = NULL; |
1059 | } | |
e498be7d | 1060 | |
4484ebf1 RT |
1061 | alien = l3->alien; |
1062 | l3->alien = NULL; | |
1063 | ||
1064 | spin_unlock_irq(&l3->list_lock); | |
1065 | ||
1066 | kfree(shared); | |
1067 | if (alien) { | |
1068 | drain_alien_cache(cachep, alien); | |
1069 | free_alien_cache(alien); | |
e498be7d | 1070 | } |
4484ebf1 | 1071 | free_array_cache: |
1da177e4 LT |
1072 | kfree(nc); |
1073 | } | |
4484ebf1 RT |
1074 | /* |
1075 | * In the previous loop, all the objects were freed to | |
1076 | * the respective cache's slabs, now we can go ahead and | |
1077 | * shrink each nodelist to its limit. | |
1078 | */ | |
1079 | list_for_each_entry(cachep, &cache_chain, next) { | |
1080 | l3 = cachep->nodelists[node]; | |
1081 | if (!l3) | |
1082 | continue; | |
1083 | spin_lock_irq(&l3->list_lock); | |
1084 | /* free slabs belonging to this node */ | |
1085 | __node_shrink(cachep, node); | |
1086 | spin_unlock_irq(&l3->list_lock); | |
1087 | } | |
fc0abb14 | 1088 | mutex_unlock(&cache_chain_mutex); |
1da177e4 LT |
1089 | break; |
1090 | #endif | |
1091 | } | |
1092 | return NOTIFY_OK; | |
b28a02de | 1093 | bad: |
fc0abb14 | 1094 | mutex_unlock(&cache_chain_mutex); |
1da177e4 LT |
1095 | return NOTIFY_BAD; |
1096 | } | |
1097 | ||
1098 | static struct notifier_block cpucache_notifier = { &cpuup_callback, NULL, 0 }; | |
1099 | ||
e498be7d CL |
1100 | /* |
1101 | * swap the static kmem_list3 with kmalloced memory | |
1102 | */ | |
343e0d7a | 1103 | static void init_list(struct kmem_cache *cachep, struct kmem_list3 *list, int nodeid) |
e498be7d CL |
1104 | { |
1105 | struct kmem_list3 *ptr; | |
1106 | ||
1107 | BUG_ON(cachep->nodelists[nodeid] != list); | |
1108 | ptr = kmalloc_node(sizeof(struct kmem_list3), GFP_KERNEL, nodeid); | |
1109 | BUG_ON(!ptr); | |
1110 | ||
1111 | local_irq_disable(); | |
1112 | memcpy(ptr, list, sizeof(struct kmem_list3)); | |
1113 | MAKE_ALL_LISTS(cachep, ptr, nodeid); | |
1114 | cachep->nodelists[nodeid] = ptr; | |
1115 | local_irq_enable(); | |
1116 | } | |
1117 | ||
1da177e4 LT |
1118 | /* Initialisation. |
1119 | * Called after the gfp() functions have been enabled, and before smp_init(). | |
1120 | */ | |
1121 | void __init kmem_cache_init(void) | |
1122 | { | |
1123 | size_t left_over; | |
1124 | struct cache_sizes *sizes; | |
1125 | struct cache_names *names; | |
e498be7d CL |
1126 | int i; |
1127 | ||
1128 | for (i = 0; i < NUM_INIT_LISTS; i++) { | |
1129 | kmem_list3_init(&initkmem_list3[i]); | |
1130 | if (i < MAX_NUMNODES) | |
1131 | cache_cache.nodelists[i] = NULL; | |
1132 | } | |
1da177e4 LT |
1133 | |
1134 | /* | |
1135 | * Fragmentation resistance on low memory - only use bigger | |
1136 | * page orders on machines with more than 32MB of memory. | |
1137 | */ | |
1138 | if (num_physpages > (32 << 20) >> PAGE_SHIFT) | |
1139 | slab_break_gfp_order = BREAK_GFP_ORDER_HI; | |
1140 | ||
1da177e4 LT |
1141 | /* Bootstrap is tricky, because several objects are allocated |
1142 | * from caches that do not exist yet: | |
343e0d7a | 1143 | * 1) initialize the cache_cache cache: it contains the struct kmem_cache |
1da177e4 LT |
1144 | * structures of all caches, except cache_cache itself: cache_cache |
1145 | * is statically allocated. | |
e498be7d CL |
1146 | * Initially an __init data area is used for the head array and the |
1147 | * kmem_list3 structures, it's replaced with a kmalloc allocated | |
1148 | * array at the end of the bootstrap. | |
1da177e4 | 1149 | * 2) Create the first kmalloc cache. |
343e0d7a | 1150 | * The struct kmem_cache for the new cache is allocated normally. |
e498be7d CL |
1151 | * An __init data area is used for the head array. |
1152 | * 3) Create the remaining kmalloc caches, with minimally sized | |
1153 | * head arrays. | |
1da177e4 LT |
1154 | * 4) Replace the __init data head arrays for cache_cache and the first |
1155 | * kmalloc cache with kmalloc allocated arrays. | |
e498be7d CL |
1156 | * 5) Replace the __init data for kmem_list3 for cache_cache and |
1157 | * the other cache's with kmalloc allocated memory. | |
1158 | * 6) Resize the head arrays of the kmalloc caches to their final sizes. | |
1da177e4 LT |
1159 | */ |
1160 | ||
1161 | /* 1) create the cache_cache */ | |
1da177e4 LT |
1162 | INIT_LIST_HEAD(&cache_chain); |
1163 | list_add(&cache_cache.next, &cache_chain); | |
1164 | cache_cache.colour_off = cache_line_size(); | |
1165 | cache_cache.array[smp_processor_id()] = &initarray_cache.cache; | |
e498be7d | 1166 | cache_cache.nodelists[numa_node_id()] = &initkmem_list3[CACHE_CACHE]; |
1da177e4 | 1167 | |
3dafccf2 | 1168 | cache_cache.buffer_size = ALIGN(cache_cache.buffer_size, cache_line_size()); |
1da177e4 | 1169 | |
3dafccf2 | 1170 | cache_estimate(0, cache_cache.buffer_size, cache_line_size(), 0, |
b28a02de | 1171 | &left_over, &cache_cache.num); |
1da177e4 LT |
1172 | if (!cache_cache.num) |
1173 | BUG(); | |
1174 | ||
b28a02de | 1175 | cache_cache.colour = left_over / cache_cache.colour_off; |
b28a02de PE |
1176 | cache_cache.slab_size = ALIGN(cache_cache.num * sizeof(kmem_bufctl_t) + |
1177 | sizeof(struct slab), cache_line_size()); | |
1da177e4 LT |
1178 | |
1179 | /* 2+3) create the kmalloc caches */ | |
1180 | sizes = malloc_sizes; | |
1181 | names = cache_names; | |
1182 | ||
e498be7d CL |
1183 | /* Initialize the caches that provide memory for the array cache |
1184 | * and the kmem_list3 structures first. | |
1185 | * Without this, further allocations will bug | |
1186 | */ | |
1187 | ||
1188 | sizes[INDEX_AC].cs_cachep = kmem_cache_create(names[INDEX_AC].name, | |
b28a02de PE |
1189 | sizes[INDEX_AC].cs_size, |
1190 | ARCH_KMALLOC_MINALIGN, | |
1191 | (ARCH_KMALLOC_FLAGS | | |
1192 | SLAB_PANIC), NULL, NULL); | |
e498be7d CL |
1193 | |
1194 | if (INDEX_AC != INDEX_L3) | |
1195 | sizes[INDEX_L3].cs_cachep = | |
b28a02de PE |
1196 | kmem_cache_create(names[INDEX_L3].name, |
1197 | sizes[INDEX_L3].cs_size, | |
1198 | ARCH_KMALLOC_MINALIGN, | |
1199 | (ARCH_KMALLOC_FLAGS | SLAB_PANIC), NULL, | |
1200 | NULL); | |
e498be7d | 1201 | |
1da177e4 | 1202 | while (sizes->cs_size != ULONG_MAX) { |
e498be7d CL |
1203 | /* |
1204 | * For performance, all the general caches are L1 aligned. | |
1da177e4 LT |
1205 | * This should be particularly beneficial on SMP boxes, as it |
1206 | * eliminates "false sharing". | |
1207 | * Note for systems short on memory removing the alignment will | |
e498be7d CL |
1208 | * allow tighter packing of the smaller caches. |
1209 | */ | |
b28a02de | 1210 | if (!sizes->cs_cachep) |
e498be7d | 1211 | sizes->cs_cachep = kmem_cache_create(names->name, |
b28a02de PE |
1212 | sizes->cs_size, |
1213 | ARCH_KMALLOC_MINALIGN, | |
1214 | (ARCH_KMALLOC_FLAGS | |
1215 | | SLAB_PANIC), | |
1216 | NULL, NULL); | |
1da177e4 LT |
1217 | |
1218 | /* Inc off-slab bufctl limit until the ceiling is hit. */ | |
1219 | if (!(OFF_SLAB(sizes->cs_cachep))) { | |
b28a02de | 1220 | offslab_limit = sizes->cs_size - sizeof(struct slab); |
1da177e4 LT |
1221 | offslab_limit /= sizeof(kmem_bufctl_t); |
1222 | } | |
1223 | ||
1224 | sizes->cs_dmacachep = kmem_cache_create(names->name_dma, | |
b28a02de PE |
1225 | sizes->cs_size, |
1226 | ARCH_KMALLOC_MINALIGN, | |
1227 | (ARCH_KMALLOC_FLAGS | | |
1228 | SLAB_CACHE_DMA | | |
1229 | SLAB_PANIC), NULL, | |
1230 | NULL); | |
1da177e4 LT |
1231 | |
1232 | sizes++; | |
1233 | names++; | |
1234 | } | |
1235 | /* 4) Replace the bootstrap head arrays */ | |
1236 | { | |
b28a02de | 1237 | void *ptr; |
e498be7d | 1238 | |
1da177e4 | 1239 | ptr = kmalloc(sizeof(struct arraycache_init), GFP_KERNEL); |
e498be7d | 1240 | |
1da177e4 | 1241 | local_irq_disable(); |
9a2dba4b PE |
1242 | BUG_ON(cpu_cache_get(&cache_cache) != &initarray_cache.cache); |
1243 | memcpy(ptr, cpu_cache_get(&cache_cache), | |
b28a02de | 1244 | sizeof(struct arraycache_init)); |
1da177e4 LT |
1245 | cache_cache.array[smp_processor_id()] = ptr; |
1246 | local_irq_enable(); | |
e498be7d | 1247 | |
1da177e4 | 1248 | ptr = kmalloc(sizeof(struct arraycache_init), GFP_KERNEL); |
e498be7d | 1249 | |
1da177e4 | 1250 | local_irq_disable(); |
9a2dba4b | 1251 | BUG_ON(cpu_cache_get(malloc_sizes[INDEX_AC].cs_cachep) |
b28a02de | 1252 | != &initarray_generic.cache); |
9a2dba4b | 1253 | memcpy(ptr, cpu_cache_get(malloc_sizes[INDEX_AC].cs_cachep), |
b28a02de | 1254 | sizeof(struct arraycache_init)); |
e498be7d | 1255 | malloc_sizes[INDEX_AC].cs_cachep->array[smp_processor_id()] = |
b28a02de | 1256 | ptr; |
1da177e4 LT |
1257 | local_irq_enable(); |
1258 | } | |
e498be7d CL |
1259 | /* 5) Replace the bootstrap kmem_list3's */ |
1260 | { | |
1261 | int node; | |
1262 | /* Replace the static kmem_list3 structures for the boot cpu */ | |
1263 | init_list(&cache_cache, &initkmem_list3[CACHE_CACHE], | |
b28a02de | 1264 | numa_node_id()); |
e498be7d CL |
1265 | |
1266 | for_each_online_node(node) { | |
1267 | init_list(malloc_sizes[INDEX_AC].cs_cachep, | |
b28a02de | 1268 | &initkmem_list3[SIZE_AC + node], node); |
e498be7d CL |
1269 | |
1270 | if (INDEX_AC != INDEX_L3) { | |
1271 | init_list(malloc_sizes[INDEX_L3].cs_cachep, | |
b28a02de PE |
1272 | &initkmem_list3[SIZE_L3 + node], |
1273 | node); | |
e498be7d CL |
1274 | } |
1275 | } | |
1276 | } | |
1da177e4 | 1277 | |
e498be7d | 1278 | /* 6) resize the head arrays to their final sizes */ |
1da177e4 | 1279 | { |
343e0d7a | 1280 | struct kmem_cache *cachep; |
fc0abb14 | 1281 | mutex_lock(&cache_chain_mutex); |
1da177e4 | 1282 | list_for_each_entry(cachep, &cache_chain, next) |
b28a02de | 1283 | enable_cpucache(cachep); |
fc0abb14 | 1284 | mutex_unlock(&cache_chain_mutex); |
1da177e4 LT |
1285 | } |
1286 | ||
1287 | /* Done! */ | |
1288 | g_cpucache_up = FULL; | |
1289 | ||
1290 | /* Register a cpu startup notifier callback | |
9a2dba4b | 1291 | * that initializes cpu_cache_get for all new cpus |
1da177e4 LT |
1292 | */ |
1293 | register_cpu_notifier(&cpucache_notifier); | |
1da177e4 LT |
1294 | |
1295 | /* The reap timers are started later, with a module init call: | |
1296 | * That part of the kernel is not yet operational. | |
1297 | */ | |
1298 | } | |
1299 | ||
1300 | static int __init cpucache_init(void) | |
1301 | { | |
1302 | int cpu; | |
1303 | ||
1304 | /* | |
1305 | * Register the timers that return unneeded | |
1306 | * pages to gfp. | |
1307 | */ | |
e498be7d | 1308 | for_each_online_cpu(cpu) |
b28a02de | 1309 | start_cpu_timer(cpu); |
1da177e4 LT |
1310 | |
1311 | return 0; | |
1312 | } | |
1313 | ||
1314 | __initcall(cpucache_init); | |
1315 | ||
1316 | /* | |
1317 | * Interface to system's page allocator. No need to hold the cache-lock. | |
1318 | * | |
1319 | * If we requested dmaable memory, we will get it. Even if we | |
1320 | * did not request dmaable memory, we might get it, but that | |
1321 | * would be relatively rare and ignorable. | |
1322 | */ | |
343e0d7a | 1323 | static void *kmem_getpages(struct kmem_cache *cachep, gfp_t flags, int nodeid) |
1da177e4 LT |
1324 | { |
1325 | struct page *page; | |
1326 | void *addr; | |
1327 | int i; | |
1328 | ||
1329 | flags |= cachep->gfpflags; | |
50c85a19 | 1330 | page = alloc_pages_node(nodeid, flags, cachep->gfporder); |
1da177e4 LT |
1331 | if (!page) |
1332 | return NULL; | |
1333 | addr = page_address(page); | |
1334 | ||
1335 | i = (1 << cachep->gfporder); | |
1336 | if (cachep->flags & SLAB_RECLAIM_ACCOUNT) | |
1337 | atomic_add(i, &slab_reclaim_pages); | |
1338 | add_page_state(nr_slab, i); | |
1339 | while (i--) { | |
1340 | SetPageSlab(page); | |
1341 | page++; | |
1342 | } | |
1343 | return addr; | |
1344 | } | |
1345 | ||
1346 | /* | |
1347 | * Interface to system's page release. | |
1348 | */ | |
343e0d7a | 1349 | static void kmem_freepages(struct kmem_cache *cachep, void *addr) |
1da177e4 | 1350 | { |
b28a02de | 1351 | unsigned long i = (1 << cachep->gfporder); |
1da177e4 LT |
1352 | struct page *page = virt_to_page(addr); |
1353 | const unsigned long nr_freed = i; | |
1354 | ||
1355 | while (i--) { | |
1356 | if (!TestClearPageSlab(page)) | |
1357 | BUG(); | |
1358 | page++; | |
1359 | } | |
1360 | sub_page_state(nr_slab, nr_freed); | |
1361 | if (current->reclaim_state) | |
1362 | current->reclaim_state->reclaimed_slab += nr_freed; | |
1363 | free_pages((unsigned long)addr, cachep->gfporder); | |
b28a02de PE |
1364 | if (cachep->flags & SLAB_RECLAIM_ACCOUNT) |
1365 | atomic_sub(1 << cachep->gfporder, &slab_reclaim_pages); | |
1da177e4 LT |
1366 | } |
1367 | ||
1368 | static void kmem_rcu_free(struct rcu_head *head) | |
1369 | { | |
b28a02de | 1370 | struct slab_rcu *slab_rcu = (struct slab_rcu *)head; |
343e0d7a | 1371 | struct kmem_cache *cachep = slab_rcu->cachep; |
1da177e4 LT |
1372 | |
1373 | kmem_freepages(cachep, slab_rcu->addr); | |
1374 | if (OFF_SLAB(cachep)) | |
1375 | kmem_cache_free(cachep->slabp_cache, slab_rcu); | |
1376 | } | |
1377 | ||
1378 | #if DEBUG | |
1379 | ||
1380 | #ifdef CONFIG_DEBUG_PAGEALLOC | |
343e0d7a | 1381 | static void store_stackinfo(struct kmem_cache *cachep, unsigned long *addr, |
b28a02de | 1382 | unsigned long caller) |
1da177e4 | 1383 | { |
3dafccf2 | 1384 | int size = obj_size(cachep); |
1da177e4 | 1385 | |
3dafccf2 | 1386 | addr = (unsigned long *)&((char *)addr)[obj_offset(cachep)]; |
1da177e4 | 1387 | |
b28a02de | 1388 | if (size < 5 * sizeof(unsigned long)) |
1da177e4 LT |
1389 | return; |
1390 | ||
b28a02de PE |
1391 | *addr++ = 0x12345678; |
1392 | *addr++ = caller; | |
1393 | *addr++ = smp_processor_id(); | |
1394 | size -= 3 * sizeof(unsigned long); | |
1da177e4 LT |
1395 | { |
1396 | unsigned long *sptr = &caller; | |
1397 | unsigned long svalue; | |
1398 | ||
1399 | while (!kstack_end(sptr)) { | |
1400 | svalue = *sptr++; | |
1401 | if (kernel_text_address(svalue)) { | |
b28a02de | 1402 | *addr++ = svalue; |
1da177e4 LT |
1403 | size -= sizeof(unsigned long); |
1404 | if (size <= sizeof(unsigned long)) | |
1405 | break; | |
1406 | } | |
1407 | } | |
1408 | ||
1409 | } | |
b28a02de | 1410 | *addr++ = 0x87654321; |
1da177e4 LT |
1411 | } |
1412 | #endif | |
1413 | ||
343e0d7a | 1414 | static void poison_obj(struct kmem_cache *cachep, void *addr, unsigned char val) |
1da177e4 | 1415 | { |
3dafccf2 MS |
1416 | int size = obj_size(cachep); |
1417 | addr = &((char *)addr)[obj_offset(cachep)]; | |
1da177e4 LT |
1418 | |
1419 | memset(addr, val, size); | |
b28a02de | 1420 | *(unsigned char *)(addr + size - 1) = POISON_END; |
1da177e4 LT |
1421 | } |
1422 | ||
1423 | static void dump_line(char *data, int offset, int limit) | |
1424 | { | |
1425 | int i; | |
1426 | printk(KERN_ERR "%03x:", offset); | |
b28a02de PE |
1427 | for (i = 0; i < limit; i++) { |
1428 | printk(" %02x", (unsigned char)data[offset + i]); | |
1da177e4 LT |
1429 | } |
1430 | printk("\n"); | |
1431 | } | |
1432 | #endif | |
1433 | ||
1434 | #if DEBUG | |
1435 | ||
343e0d7a | 1436 | static void print_objinfo(struct kmem_cache *cachep, void *objp, int lines) |
1da177e4 LT |
1437 | { |
1438 | int i, size; | |
1439 | char *realobj; | |
1440 | ||
1441 | if (cachep->flags & SLAB_RED_ZONE) { | |
1442 | printk(KERN_ERR "Redzone: 0x%lx/0x%lx.\n", | |
b28a02de PE |
1443 | *dbg_redzone1(cachep, objp), |
1444 | *dbg_redzone2(cachep, objp)); | |
1da177e4 LT |
1445 | } |
1446 | ||
1447 | if (cachep->flags & SLAB_STORE_USER) { | |
1448 | printk(KERN_ERR "Last user: [<%p>]", | |
b28a02de | 1449 | *dbg_userword(cachep, objp)); |
1da177e4 | 1450 | print_symbol("(%s)", |
b28a02de | 1451 | (unsigned long)*dbg_userword(cachep, objp)); |
1da177e4 LT |
1452 | printk("\n"); |
1453 | } | |
3dafccf2 MS |
1454 | realobj = (char *)objp + obj_offset(cachep); |
1455 | size = obj_size(cachep); | |
b28a02de | 1456 | for (i = 0; i < size && lines; i += 16, lines--) { |
1da177e4 LT |
1457 | int limit; |
1458 | limit = 16; | |
b28a02de PE |
1459 | if (i + limit > size) |
1460 | limit = size - i; | |
1da177e4 LT |
1461 | dump_line(realobj, i, limit); |
1462 | } | |
1463 | } | |
1464 | ||
343e0d7a | 1465 | static void check_poison_obj(struct kmem_cache *cachep, void *objp) |
1da177e4 LT |
1466 | { |
1467 | char *realobj; | |
1468 | int size, i; | |
1469 | int lines = 0; | |
1470 | ||
3dafccf2 MS |
1471 | realobj = (char *)objp + obj_offset(cachep); |
1472 | size = obj_size(cachep); | |
1da177e4 | 1473 | |
b28a02de | 1474 | for (i = 0; i < size; i++) { |
1da177e4 | 1475 | char exp = POISON_FREE; |
b28a02de | 1476 | if (i == size - 1) |
1da177e4 LT |
1477 | exp = POISON_END; |
1478 | if (realobj[i] != exp) { | |
1479 | int limit; | |
1480 | /* Mismatch ! */ | |
1481 | /* Print header */ | |
1482 | if (lines == 0) { | |
b28a02de PE |
1483 | printk(KERN_ERR |
1484 | "Slab corruption: start=%p, len=%d\n", | |
1485 | realobj, size); | |
1da177e4 LT |
1486 | print_objinfo(cachep, objp, 0); |
1487 | } | |
1488 | /* Hexdump the affected line */ | |
b28a02de | 1489 | i = (i / 16) * 16; |
1da177e4 | 1490 | limit = 16; |
b28a02de PE |
1491 | if (i + limit > size) |
1492 | limit = size - i; | |
1da177e4 LT |
1493 | dump_line(realobj, i, limit); |
1494 | i += 16; | |
1495 | lines++; | |
1496 | /* Limit to 5 lines */ | |
1497 | if (lines > 5) | |
1498 | break; | |
1499 | } | |
1500 | } | |
1501 | if (lines != 0) { | |
1502 | /* Print some data about the neighboring objects, if they | |
1503 | * exist: | |
1504 | */ | |
6ed5eb22 | 1505 | struct slab *slabp = virt_to_slab(objp); |
1da177e4 LT |
1506 | int objnr; |
1507 | ||
3dafccf2 | 1508 | objnr = (unsigned)(objp - slabp->s_mem) / cachep->buffer_size; |
1da177e4 | 1509 | if (objnr) { |
3dafccf2 MS |
1510 | objp = slabp->s_mem + (objnr - 1) * cachep->buffer_size; |
1511 | realobj = (char *)objp + obj_offset(cachep); | |
1da177e4 | 1512 | printk(KERN_ERR "Prev obj: start=%p, len=%d\n", |
b28a02de | 1513 | realobj, size); |
1da177e4 LT |
1514 | print_objinfo(cachep, objp, 2); |
1515 | } | |
b28a02de | 1516 | if (objnr + 1 < cachep->num) { |
3dafccf2 MS |
1517 | objp = slabp->s_mem + (objnr + 1) * cachep->buffer_size; |
1518 | realobj = (char *)objp + obj_offset(cachep); | |
1da177e4 | 1519 | printk(KERN_ERR "Next obj: start=%p, len=%d\n", |
b28a02de | 1520 | realobj, size); |
1da177e4 LT |
1521 | print_objinfo(cachep, objp, 2); |
1522 | } | |
1523 | } | |
1524 | } | |
1525 | #endif | |
1526 | ||
12dd36fa MD |
1527 | #if DEBUG |
1528 | /** | |
1529 | * slab_destroy_objs - call the registered destructor for each object in | |
1530 | * a slab that is to be destroyed. | |
1da177e4 | 1531 | */ |
343e0d7a | 1532 | static void slab_destroy_objs(struct kmem_cache *cachep, struct slab *slabp) |
1da177e4 | 1533 | { |
1da177e4 LT |
1534 | int i; |
1535 | for (i = 0; i < cachep->num; i++) { | |
3dafccf2 | 1536 | void *objp = slabp->s_mem + cachep->buffer_size * i; |
1da177e4 LT |
1537 | |
1538 | if (cachep->flags & SLAB_POISON) { | |
1539 | #ifdef CONFIG_DEBUG_PAGEALLOC | |
3dafccf2 | 1540 | if ((cachep->buffer_size % PAGE_SIZE) == 0 |
b28a02de PE |
1541 | && OFF_SLAB(cachep)) |
1542 | kernel_map_pages(virt_to_page(objp), | |
3dafccf2 | 1543 | cachep->buffer_size / PAGE_SIZE, |
b28a02de | 1544 | 1); |
1da177e4 LT |
1545 | else |
1546 | check_poison_obj(cachep, objp); | |
1547 | #else | |
1548 | check_poison_obj(cachep, objp); | |
1549 | #endif | |
1550 | } | |
1551 | if (cachep->flags & SLAB_RED_ZONE) { | |
1552 | if (*dbg_redzone1(cachep, objp) != RED_INACTIVE) | |
1553 | slab_error(cachep, "start of a freed object " | |
b28a02de | 1554 | "was overwritten"); |
1da177e4 LT |
1555 | if (*dbg_redzone2(cachep, objp) != RED_INACTIVE) |
1556 | slab_error(cachep, "end of a freed object " | |
b28a02de | 1557 | "was overwritten"); |
1da177e4 LT |
1558 | } |
1559 | if (cachep->dtor && !(cachep->flags & SLAB_POISON)) | |
3dafccf2 | 1560 | (cachep->dtor) (objp + obj_offset(cachep), cachep, 0); |
1da177e4 | 1561 | } |
12dd36fa | 1562 | } |
1da177e4 | 1563 | #else |
343e0d7a | 1564 | static void slab_destroy_objs(struct kmem_cache *cachep, struct slab *slabp) |
12dd36fa | 1565 | { |
1da177e4 LT |
1566 | if (cachep->dtor) { |
1567 | int i; | |
1568 | for (i = 0; i < cachep->num; i++) { | |
3dafccf2 | 1569 | void *objp = slabp->s_mem + cachep->buffer_size * i; |
b28a02de | 1570 | (cachep->dtor) (objp, cachep, 0); |
1da177e4 LT |
1571 | } |
1572 | } | |
12dd36fa | 1573 | } |
1da177e4 LT |
1574 | #endif |
1575 | ||
12dd36fa MD |
1576 | /** |
1577 | * Destroy all the objs in a slab, and release the mem back to the system. | |
1578 | * Before calling the slab must have been unlinked from the cache. | |
1579 | * The cache-lock is not held/needed. | |
1580 | */ | |
343e0d7a | 1581 | static void slab_destroy(struct kmem_cache *cachep, struct slab *slabp) |
12dd36fa MD |
1582 | { |
1583 | void *addr = slabp->s_mem - slabp->colouroff; | |
1584 | ||
1585 | slab_destroy_objs(cachep, slabp); | |
1da177e4 LT |
1586 | if (unlikely(cachep->flags & SLAB_DESTROY_BY_RCU)) { |
1587 | struct slab_rcu *slab_rcu; | |
1588 | ||
b28a02de | 1589 | slab_rcu = (struct slab_rcu *)slabp; |
1da177e4 LT |
1590 | slab_rcu->cachep = cachep; |
1591 | slab_rcu->addr = addr; | |
1592 | call_rcu(&slab_rcu->head, kmem_rcu_free); | |
1593 | } else { | |
1594 | kmem_freepages(cachep, addr); | |
1595 | if (OFF_SLAB(cachep)) | |
1596 | kmem_cache_free(cachep->slabp_cache, slabp); | |
1597 | } | |
1598 | } | |
1599 | ||
3dafccf2 | 1600 | /* For setting up all the kmem_list3s for cache whose buffer_size is same |
e498be7d | 1601 | as size of kmem_list3. */ |
343e0d7a | 1602 | static void set_up_list3s(struct kmem_cache *cachep, int index) |
e498be7d CL |
1603 | { |
1604 | int node; | |
1605 | ||
1606 | for_each_online_node(node) { | |
b28a02de | 1607 | cachep->nodelists[node] = &initkmem_list3[index + node]; |
e498be7d | 1608 | cachep->nodelists[node]->next_reap = jiffies + |
b28a02de PE |
1609 | REAPTIMEOUT_LIST3 + |
1610 | ((unsigned long)cachep) % REAPTIMEOUT_LIST3; | |
e498be7d CL |
1611 | } |
1612 | } | |
1613 | ||
4d268eba | 1614 | /** |
a70773dd RD |
1615 | * calculate_slab_order - calculate size (page order) of slabs |
1616 | * @cachep: pointer to the cache that is being created | |
1617 | * @size: size of objects to be created in this cache. | |
1618 | * @align: required alignment for the objects. | |
1619 | * @flags: slab allocation flags | |
1620 | * | |
1621 | * Also calculates the number of objects per slab. | |
4d268eba PE |
1622 | * |
1623 | * This could be made much more intelligent. For now, try to avoid using | |
1624 | * high order pages for slabs. When the gfp() functions are more friendly | |
1625 | * towards high-order requests, this should be changed. | |
1626 | */ | |
ee13d785 RD |
1627 | static inline size_t calculate_slab_order(struct kmem_cache *cachep, |
1628 | size_t size, size_t align, unsigned long flags) | |
4d268eba PE |
1629 | { |
1630 | size_t left_over = 0; | |
1631 | ||
b28a02de | 1632 | for (;; cachep->gfporder++) { |
4d268eba PE |
1633 | unsigned int num; |
1634 | size_t remainder; | |
1635 | ||
1636 | if (cachep->gfporder > MAX_GFP_ORDER) { | |
1637 | cachep->num = 0; | |
1638 | break; | |
1639 | } | |
1640 | ||
1641 | cache_estimate(cachep->gfporder, size, align, flags, | |
1642 | &remainder, &num); | |
1643 | if (!num) | |
1644 | continue; | |
1645 | /* More than offslab_limit objects will cause problems */ | |
1646 | if (flags & CFLGS_OFF_SLAB && cachep->num > offslab_limit) | |
1647 | break; | |
1648 | ||
1649 | cachep->num = num; | |
1650 | left_over = remainder; | |
1651 | ||
1652 | /* | |
1653 | * Large number of objects is good, but very large slabs are | |
1654 | * currently bad for the gfp()s. | |
1655 | */ | |
1656 | if (cachep->gfporder >= slab_break_gfp_order) | |
1657 | break; | |
1658 | ||
1659 | if ((left_over * 8) <= (PAGE_SIZE << cachep->gfporder)) | |
1660 | /* Acceptable internal fragmentation */ | |
1661 | break; | |
1662 | } | |
1663 | return left_over; | |
1664 | } | |
1665 | ||
1da177e4 LT |
1666 | /** |
1667 | * kmem_cache_create - Create a cache. | |
1668 | * @name: A string which is used in /proc/slabinfo to identify this cache. | |
1669 | * @size: The size of objects to be created in this cache. | |
1670 | * @align: The required alignment for the objects. | |
1671 | * @flags: SLAB flags | |
1672 | * @ctor: A constructor for the objects. | |
1673 | * @dtor: A destructor for the objects. | |
1674 | * | |
1675 | * Returns a ptr to the cache on success, NULL on failure. | |
1676 | * Cannot be called within a int, but can be interrupted. | |
1677 | * The @ctor is run when new pages are allocated by the cache | |
1678 | * and the @dtor is run before the pages are handed back. | |
1679 | * | |
1680 | * @name must be valid until the cache is destroyed. This implies that | |
1681 | * the module calling this has to destroy the cache before getting | |
1682 | * unloaded. | |
1683 | * | |
1684 | * The flags are | |
1685 | * | |
1686 | * %SLAB_POISON - Poison the slab with a known test pattern (a5a5a5a5) | |
1687 | * to catch references to uninitialised memory. | |
1688 | * | |
1689 | * %SLAB_RED_ZONE - Insert `Red' zones around the allocated memory to check | |
1690 | * for buffer overruns. | |
1691 | * | |
1692 | * %SLAB_NO_REAP - Don't automatically reap this cache when we're under | |
1693 | * memory pressure. | |
1694 | * | |
1695 | * %SLAB_HWCACHE_ALIGN - Align the objects in this cache to a hardware | |
1696 | * cacheline. This can be beneficial if you're counting cycles as closely | |
1697 | * as davem. | |
1698 | */ | |
343e0d7a | 1699 | struct kmem_cache * |
1da177e4 | 1700 | kmem_cache_create (const char *name, size_t size, size_t align, |
343e0d7a PE |
1701 | unsigned long flags, void (*ctor)(void*, struct kmem_cache *, unsigned long), |
1702 | void (*dtor)(void*, struct kmem_cache *, unsigned long)) | |
1da177e4 LT |
1703 | { |
1704 | size_t left_over, slab_size, ralign; | |
343e0d7a | 1705 | struct kmem_cache *cachep = NULL; |
4f12bb4f | 1706 | struct list_head *p; |
1da177e4 LT |
1707 | |
1708 | /* | |
1709 | * Sanity checks... these are all serious usage bugs. | |
1710 | */ | |
1711 | if ((!name) || | |
b28a02de PE |
1712 | in_interrupt() || |
1713 | (size < BYTES_PER_WORD) || | |
1714 | (size > (1 << MAX_OBJ_ORDER) * PAGE_SIZE) || (dtor && !ctor)) { | |
1715 | printk(KERN_ERR "%s: Early error in slab %s\n", | |
1716 | __FUNCTION__, name); | |
1717 | BUG(); | |
1718 | } | |
1da177e4 | 1719 | |
fc0abb14 | 1720 | mutex_lock(&cache_chain_mutex); |
4f12bb4f AM |
1721 | |
1722 | list_for_each(p, &cache_chain) { | |
343e0d7a | 1723 | struct kmem_cache *pc = list_entry(p, struct kmem_cache, next); |
4f12bb4f AM |
1724 | mm_segment_t old_fs = get_fs(); |
1725 | char tmp; | |
1726 | int res; | |
1727 | ||
1728 | /* | |
1729 | * This happens when the module gets unloaded and doesn't | |
1730 | * destroy its slab cache and no-one else reuses the vmalloc | |
1731 | * area of the module. Print a warning. | |
1732 | */ | |
1733 | set_fs(KERNEL_DS); | |
1734 | res = __get_user(tmp, pc->name); | |
1735 | set_fs(old_fs); | |
1736 | if (res) { | |
1737 | printk("SLAB: cache with size %d has lost its name\n", | |
3dafccf2 | 1738 | pc->buffer_size); |
4f12bb4f AM |
1739 | continue; |
1740 | } | |
1741 | ||
b28a02de | 1742 | if (!strcmp(pc->name, name)) { |
4f12bb4f AM |
1743 | printk("kmem_cache_create: duplicate cache %s\n", name); |
1744 | dump_stack(); | |
1745 | goto oops; | |
1746 | } | |
1747 | } | |
1748 | ||
1da177e4 LT |
1749 | #if DEBUG |
1750 | WARN_ON(strchr(name, ' ')); /* It confuses parsers */ | |
1751 | if ((flags & SLAB_DEBUG_INITIAL) && !ctor) { | |
1752 | /* No constructor, but inital state check requested */ | |
1753 | printk(KERN_ERR "%s: No con, but init state check " | |
b28a02de | 1754 | "requested - %s\n", __FUNCTION__, name); |
1da177e4 LT |
1755 | flags &= ~SLAB_DEBUG_INITIAL; |
1756 | } | |
1da177e4 LT |
1757 | #if FORCED_DEBUG |
1758 | /* | |
1759 | * Enable redzoning and last user accounting, except for caches with | |
1760 | * large objects, if the increased size would increase the object size | |
1761 | * above the next power of two: caches with object sizes just above a | |
1762 | * power of two have a significant amount of internal fragmentation. | |
1763 | */ | |
b28a02de PE |
1764 | if ((size < 4096 |
1765 | || fls(size - 1) == fls(size - 1 + 3 * BYTES_PER_WORD))) | |
1766 | flags |= SLAB_RED_ZONE | SLAB_STORE_USER; | |
1da177e4 LT |
1767 | if (!(flags & SLAB_DESTROY_BY_RCU)) |
1768 | flags |= SLAB_POISON; | |
1769 | #endif | |
1770 | if (flags & SLAB_DESTROY_BY_RCU) | |
1771 | BUG_ON(flags & SLAB_POISON); | |
1772 | #endif | |
1773 | if (flags & SLAB_DESTROY_BY_RCU) | |
1774 | BUG_ON(dtor); | |
1775 | ||
1776 | /* | |
1777 | * Always checks flags, a caller might be expecting debug | |
1778 | * support which isn't available. | |
1779 | */ | |
1780 | if (flags & ~CREATE_MASK) | |
1781 | BUG(); | |
1782 | ||
1783 | /* Check that size is in terms of words. This is needed to avoid | |
1784 | * unaligned accesses for some archs when redzoning is used, and makes | |
1785 | * sure any on-slab bufctl's are also correctly aligned. | |
1786 | */ | |
b28a02de PE |
1787 | if (size & (BYTES_PER_WORD - 1)) { |
1788 | size += (BYTES_PER_WORD - 1); | |
1789 | size &= ~(BYTES_PER_WORD - 1); | |
1da177e4 LT |
1790 | } |
1791 | ||
1792 | /* calculate out the final buffer alignment: */ | |
1793 | /* 1) arch recommendation: can be overridden for debug */ | |
1794 | if (flags & SLAB_HWCACHE_ALIGN) { | |
1795 | /* Default alignment: as specified by the arch code. | |
1796 | * Except if an object is really small, then squeeze multiple | |
1797 | * objects into one cacheline. | |
1798 | */ | |
1799 | ralign = cache_line_size(); | |
b28a02de | 1800 | while (size <= ralign / 2) |
1da177e4 LT |
1801 | ralign /= 2; |
1802 | } else { | |
1803 | ralign = BYTES_PER_WORD; | |
1804 | } | |
1805 | /* 2) arch mandated alignment: disables debug if necessary */ | |
1806 | if (ralign < ARCH_SLAB_MINALIGN) { | |
1807 | ralign = ARCH_SLAB_MINALIGN; | |
1808 | if (ralign > BYTES_PER_WORD) | |
b28a02de | 1809 | flags &= ~(SLAB_RED_ZONE | SLAB_STORE_USER); |
1da177e4 LT |
1810 | } |
1811 | /* 3) caller mandated alignment: disables debug if necessary */ | |
1812 | if (ralign < align) { | |
1813 | ralign = align; | |
1814 | if (ralign > BYTES_PER_WORD) | |
b28a02de | 1815 | flags &= ~(SLAB_RED_ZONE | SLAB_STORE_USER); |
1da177e4 LT |
1816 | } |
1817 | /* 4) Store it. Note that the debug code below can reduce | |
1818 | * the alignment to BYTES_PER_WORD. | |
1819 | */ | |
1820 | align = ralign; | |
1821 | ||
1822 | /* Get cache's description obj. */ | |
343e0d7a | 1823 | cachep = kmem_cache_alloc(&cache_cache, SLAB_KERNEL); |
1da177e4 | 1824 | if (!cachep) |
4f12bb4f | 1825 | goto oops; |
343e0d7a | 1826 | memset(cachep, 0, sizeof(struct kmem_cache)); |
1da177e4 LT |
1827 | |
1828 | #if DEBUG | |
3dafccf2 | 1829 | cachep->obj_size = size; |
1da177e4 LT |
1830 | |
1831 | if (flags & SLAB_RED_ZONE) { | |
1832 | /* redzoning only works with word aligned caches */ | |
1833 | align = BYTES_PER_WORD; | |
1834 | ||
1835 | /* add space for red zone words */ | |
3dafccf2 | 1836 | cachep->obj_offset += BYTES_PER_WORD; |
b28a02de | 1837 | size += 2 * BYTES_PER_WORD; |
1da177e4 LT |
1838 | } |
1839 | if (flags & SLAB_STORE_USER) { | |
1840 | /* user store requires word alignment and | |
1841 | * one word storage behind the end of the real | |
1842 | * object. | |
1843 | */ | |
1844 | align = BYTES_PER_WORD; | |
1845 | size += BYTES_PER_WORD; | |
1846 | } | |
1847 | #if FORCED_DEBUG && defined(CONFIG_DEBUG_PAGEALLOC) | |
b28a02de | 1848 | if (size >= malloc_sizes[INDEX_L3 + 1].cs_size |
3dafccf2 MS |
1849 | && cachep->obj_size > cache_line_size() && size < PAGE_SIZE) { |
1850 | cachep->obj_offset += PAGE_SIZE - size; | |
1da177e4 LT |
1851 | size = PAGE_SIZE; |
1852 | } | |
1853 | #endif | |
1854 | #endif | |
1855 | ||
1856 | /* Determine if the slab management is 'on' or 'off' slab. */ | |
b28a02de | 1857 | if (size >= (PAGE_SIZE >> 3)) |
1da177e4 LT |
1858 | /* |
1859 | * Size is large, assume best to place the slab management obj | |
1860 | * off-slab (should allow better packing of objs). | |
1861 | */ | |
1862 | flags |= CFLGS_OFF_SLAB; | |
1863 | ||
1864 | size = ALIGN(size, align); | |
1865 | ||
1866 | if ((flags & SLAB_RECLAIM_ACCOUNT) && size <= PAGE_SIZE) { | |
1867 | /* | |
1868 | * A VFS-reclaimable slab tends to have most allocations | |
1869 | * as GFP_NOFS and we really don't want to have to be allocating | |
1870 | * higher-order pages when we are unable to shrink dcache. | |
1871 | */ | |
1872 | cachep->gfporder = 0; | |
1873 | cache_estimate(cachep->gfporder, size, align, flags, | |
b28a02de | 1874 | &left_over, &cachep->num); |
4d268eba PE |
1875 | } else |
1876 | left_over = calculate_slab_order(cachep, size, align, flags); | |
1da177e4 LT |
1877 | |
1878 | if (!cachep->num) { | |
1879 | printk("kmem_cache_create: couldn't create cache %s.\n", name); | |
1880 | kmem_cache_free(&cache_cache, cachep); | |
1881 | cachep = NULL; | |
4f12bb4f | 1882 | goto oops; |
1da177e4 | 1883 | } |
b28a02de PE |
1884 | slab_size = ALIGN(cachep->num * sizeof(kmem_bufctl_t) |
1885 | + sizeof(struct slab), align); | |
1da177e4 LT |
1886 | |
1887 | /* | |
1888 | * If the slab has been placed off-slab, and we have enough space then | |
1889 | * move it on-slab. This is at the expense of any extra colouring. | |
1890 | */ | |
1891 | if (flags & CFLGS_OFF_SLAB && left_over >= slab_size) { | |
1892 | flags &= ~CFLGS_OFF_SLAB; | |
1893 | left_over -= slab_size; | |
1894 | } | |
1895 | ||
1896 | if (flags & CFLGS_OFF_SLAB) { | |
1897 | /* really off slab. No need for manual alignment */ | |
b28a02de PE |
1898 | slab_size = |
1899 | cachep->num * sizeof(kmem_bufctl_t) + sizeof(struct slab); | |
1da177e4 LT |
1900 | } |
1901 | ||
1902 | cachep->colour_off = cache_line_size(); | |
1903 | /* Offset must be a multiple of the alignment. */ | |
1904 | if (cachep->colour_off < align) | |
1905 | cachep->colour_off = align; | |
b28a02de | 1906 | cachep->colour = left_over / cachep->colour_off; |
1da177e4 LT |
1907 | cachep->slab_size = slab_size; |
1908 | cachep->flags = flags; | |
1909 | cachep->gfpflags = 0; | |
1910 | if (flags & SLAB_CACHE_DMA) | |
1911 | cachep->gfpflags |= GFP_DMA; | |
1912 | spin_lock_init(&cachep->spinlock); | |
3dafccf2 | 1913 | cachep->buffer_size = size; |
1da177e4 LT |
1914 | |
1915 | if (flags & CFLGS_OFF_SLAB) | |
b2d55073 | 1916 | cachep->slabp_cache = kmem_find_general_cachep(slab_size, 0u); |
1da177e4 LT |
1917 | cachep->ctor = ctor; |
1918 | cachep->dtor = dtor; | |
1919 | cachep->name = name; | |
1920 | ||
1921 | /* Don't let CPUs to come and go */ | |
1922 | lock_cpu_hotplug(); | |
1923 | ||
1924 | if (g_cpucache_up == FULL) { | |
1925 | enable_cpucache(cachep); | |
1926 | } else { | |
1927 | if (g_cpucache_up == NONE) { | |
1928 | /* Note: the first kmem_cache_create must create | |
1929 | * the cache that's used by kmalloc(24), otherwise | |
1930 | * the creation of further caches will BUG(). | |
1931 | */ | |
e498be7d | 1932 | cachep->array[smp_processor_id()] = |
b28a02de | 1933 | &initarray_generic.cache; |
e498be7d CL |
1934 | |
1935 | /* If the cache that's used by | |
1936 | * kmalloc(sizeof(kmem_list3)) is the first cache, | |
1937 | * then we need to set up all its list3s, otherwise | |
1938 | * the creation of further caches will BUG(). | |
1939 | */ | |
1940 | set_up_list3s(cachep, SIZE_AC); | |
1941 | if (INDEX_AC == INDEX_L3) | |
1942 | g_cpucache_up = PARTIAL_L3; | |
1943 | else | |
1944 | g_cpucache_up = PARTIAL_AC; | |
1da177e4 | 1945 | } else { |
e498be7d | 1946 | cachep->array[smp_processor_id()] = |
b28a02de | 1947 | kmalloc(sizeof(struct arraycache_init), GFP_KERNEL); |
e498be7d CL |
1948 | |
1949 | if (g_cpucache_up == PARTIAL_AC) { | |
1950 | set_up_list3s(cachep, SIZE_L3); | |
1951 | g_cpucache_up = PARTIAL_L3; | |
1952 | } else { | |
1953 | int node; | |
1954 | for_each_online_node(node) { | |
1955 | ||
1956 | cachep->nodelists[node] = | |
b28a02de PE |
1957 | kmalloc_node(sizeof |
1958 | (struct kmem_list3), | |
1959 | GFP_KERNEL, node); | |
e498be7d | 1960 | BUG_ON(!cachep->nodelists[node]); |
b28a02de PE |
1961 | kmem_list3_init(cachep-> |
1962 | nodelists[node]); | |
e498be7d CL |
1963 | } |
1964 | } | |
1da177e4 | 1965 | } |
e498be7d | 1966 | cachep->nodelists[numa_node_id()]->next_reap = |
b28a02de PE |
1967 | jiffies + REAPTIMEOUT_LIST3 + |
1968 | ((unsigned long)cachep) % REAPTIMEOUT_LIST3; | |
e498be7d | 1969 | |
9a2dba4b PE |
1970 | BUG_ON(!cpu_cache_get(cachep)); |
1971 | cpu_cache_get(cachep)->avail = 0; | |
1972 | cpu_cache_get(cachep)->limit = BOOT_CPUCACHE_ENTRIES; | |
1973 | cpu_cache_get(cachep)->batchcount = 1; | |
1974 | cpu_cache_get(cachep)->touched = 0; | |
1da177e4 LT |
1975 | cachep->batchcount = 1; |
1976 | cachep->limit = BOOT_CPUCACHE_ENTRIES; | |
b28a02de | 1977 | } |
1da177e4 | 1978 | |
1da177e4 LT |
1979 | /* cache setup completed, link it into the list */ |
1980 | list_add(&cachep->next, &cache_chain); | |
1da177e4 | 1981 | unlock_cpu_hotplug(); |
b28a02de | 1982 | oops: |
1da177e4 LT |
1983 | if (!cachep && (flags & SLAB_PANIC)) |
1984 | panic("kmem_cache_create(): failed to create slab `%s'\n", | |
b28a02de | 1985 | name); |
fc0abb14 | 1986 | mutex_unlock(&cache_chain_mutex); |
1da177e4 LT |
1987 | return cachep; |
1988 | } | |
1989 | EXPORT_SYMBOL(kmem_cache_create); | |
1990 | ||
1991 | #if DEBUG | |
1992 | static void check_irq_off(void) | |
1993 | { | |
1994 | BUG_ON(!irqs_disabled()); | |
1995 | } | |
1996 | ||
1997 | static void check_irq_on(void) | |
1998 | { | |
1999 | BUG_ON(irqs_disabled()); | |
2000 | } | |
2001 | ||
343e0d7a | 2002 | static void check_spinlock_acquired(struct kmem_cache *cachep) |
1da177e4 LT |
2003 | { |
2004 | #ifdef CONFIG_SMP | |
2005 | check_irq_off(); | |
e498be7d | 2006 | assert_spin_locked(&cachep->nodelists[numa_node_id()]->list_lock); |
1da177e4 LT |
2007 | #endif |
2008 | } | |
e498be7d | 2009 | |
343e0d7a | 2010 | static void check_spinlock_acquired_node(struct kmem_cache *cachep, int node) |
e498be7d CL |
2011 | { |
2012 | #ifdef CONFIG_SMP | |
2013 | check_irq_off(); | |
2014 | assert_spin_locked(&cachep->nodelists[node]->list_lock); | |
2015 | #endif | |
2016 | } | |
2017 | ||
1da177e4 LT |
2018 | #else |
2019 | #define check_irq_off() do { } while(0) | |
2020 | #define check_irq_on() do { } while(0) | |
2021 | #define check_spinlock_acquired(x) do { } while(0) | |
e498be7d | 2022 | #define check_spinlock_acquired_node(x, y) do { } while(0) |
1da177e4 LT |
2023 | #endif |
2024 | ||
2025 | /* | |
2026 | * Waits for all CPUs to execute func(). | |
2027 | */ | |
b28a02de | 2028 | static void smp_call_function_all_cpus(void (*func)(void *arg), void *arg) |
1da177e4 LT |
2029 | { |
2030 | check_irq_on(); | |
2031 | preempt_disable(); | |
2032 | ||
2033 | local_irq_disable(); | |
2034 | func(arg); | |
2035 | local_irq_enable(); | |
2036 | ||
2037 | if (smp_call_function(func, arg, 1, 1)) | |
2038 | BUG(); | |
2039 | ||
2040 | preempt_enable(); | |
2041 | } | |
2042 | ||
343e0d7a | 2043 | static void drain_array_locked(struct kmem_cache *cachep, struct array_cache *ac, |
b28a02de | 2044 | int force, int node); |
1da177e4 LT |
2045 | |
2046 | static void do_drain(void *arg) | |
2047 | { | |
343e0d7a | 2048 | struct kmem_cache *cachep = (struct kmem_cache *) arg; |
1da177e4 | 2049 | struct array_cache *ac; |
ff69416e | 2050 | int node = numa_node_id(); |
1da177e4 LT |
2051 | |
2052 | check_irq_off(); | |
9a2dba4b | 2053 | ac = cpu_cache_get(cachep); |
ff69416e CL |
2054 | spin_lock(&cachep->nodelists[node]->list_lock); |
2055 | free_block(cachep, ac->entry, ac->avail, node); | |
2056 | spin_unlock(&cachep->nodelists[node]->list_lock); | |
1da177e4 LT |
2057 | ac->avail = 0; |
2058 | } | |
2059 | ||
343e0d7a | 2060 | static void drain_cpu_caches(struct kmem_cache *cachep) |
1da177e4 | 2061 | { |
e498be7d CL |
2062 | struct kmem_list3 *l3; |
2063 | int node; | |
2064 | ||
1da177e4 LT |
2065 | smp_call_function_all_cpus(do_drain, cachep); |
2066 | check_irq_on(); | |
b28a02de | 2067 | for_each_online_node(node) { |
e498be7d CL |
2068 | l3 = cachep->nodelists[node]; |
2069 | if (l3) { | |
ca3b9b91 | 2070 | spin_lock_irq(&l3->list_lock); |
e498be7d | 2071 | drain_array_locked(cachep, l3->shared, 1, node); |
ca3b9b91 | 2072 | spin_unlock_irq(&l3->list_lock); |
e498be7d | 2073 | if (l3->alien) |
4484ebf1 | 2074 | drain_alien_cache(cachep, l3->alien); |
e498be7d CL |
2075 | } |
2076 | } | |
1da177e4 LT |
2077 | } |
2078 | ||
343e0d7a | 2079 | static int __node_shrink(struct kmem_cache *cachep, int node) |
1da177e4 LT |
2080 | { |
2081 | struct slab *slabp; | |
e498be7d | 2082 | struct kmem_list3 *l3 = cachep->nodelists[node]; |
1da177e4 LT |
2083 | int ret; |
2084 | ||
e498be7d | 2085 | for (;;) { |
1da177e4 LT |
2086 | struct list_head *p; |
2087 | ||
e498be7d CL |
2088 | p = l3->slabs_free.prev; |
2089 | if (p == &l3->slabs_free) | |
1da177e4 LT |
2090 | break; |
2091 | ||
e498be7d | 2092 | slabp = list_entry(l3->slabs_free.prev, struct slab, list); |
1da177e4 LT |
2093 | #if DEBUG |
2094 | if (slabp->inuse) | |
2095 | BUG(); | |
2096 | #endif | |
2097 | list_del(&slabp->list); | |
2098 | ||
e498be7d CL |
2099 | l3->free_objects -= cachep->num; |
2100 | spin_unlock_irq(&l3->list_lock); | |
1da177e4 | 2101 | slab_destroy(cachep, slabp); |
e498be7d | 2102 | spin_lock_irq(&l3->list_lock); |
1da177e4 | 2103 | } |
b28a02de | 2104 | ret = !list_empty(&l3->slabs_full) || !list_empty(&l3->slabs_partial); |
1da177e4 LT |
2105 | return ret; |
2106 | } | |
2107 | ||
343e0d7a | 2108 | static int __cache_shrink(struct kmem_cache *cachep) |
e498be7d CL |
2109 | { |
2110 | int ret = 0, i = 0; | |
2111 | struct kmem_list3 *l3; | |
2112 | ||
2113 | drain_cpu_caches(cachep); | |
2114 | ||
2115 | check_irq_on(); | |
2116 | for_each_online_node(i) { | |
2117 | l3 = cachep->nodelists[i]; | |
2118 | if (l3) { | |
2119 | spin_lock_irq(&l3->list_lock); | |
2120 | ret += __node_shrink(cachep, i); | |
2121 | spin_unlock_irq(&l3->list_lock); | |
2122 | } | |
2123 | } | |
2124 | return (ret ? 1 : 0); | |
2125 | } | |
2126 | ||
1da177e4 LT |
2127 | /** |
2128 | * kmem_cache_shrink - Shrink a cache. | |
2129 | * @cachep: The cache to shrink. | |
2130 | * | |
2131 | * Releases as many slabs as possible for a cache. | |
2132 | * To help debugging, a zero exit status indicates all slabs were released. | |
2133 | */ | |
343e0d7a | 2134 | int kmem_cache_shrink(struct kmem_cache *cachep) |
1da177e4 LT |
2135 | { |
2136 | if (!cachep || in_interrupt()) | |
2137 | BUG(); | |
2138 | ||
2139 | return __cache_shrink(cachep); | |
2140 | } | |
2141 | EXPORT_SYMBOL(kmem_cache_shrink); | |
2142 | ||
2143 | /** | |
2144 | * kmem_cache_destroy - delete a cache | |
2145 | * @cachep: the cache to destroy | |
2146 | * | |
343e0d7a | 2147 | * Remove a struct kmem_cache object from the slab cache. |
1da177e4 LT |
2148 | * Returns 0 on success. |
2149 | * | |
2150 | * It is expected this function will be called by a module when it is | |
2151 | * unloaded. This will remove the cache completely, and avoid a duplicate | |
2152 | * cache being allocated each time a module is loaded and unloaded, if the | |
2153 | * module doesn't have persistent in-kernel storage across loads and unloads. | |
2154 | * | |
2155 | * The cache must be empty before calling this function. | |
2156 | * | |
2157 | * The caller must guarantee that noone will allocate memory from the cache | |
2158 | * during the kmem_cache_destroy(). | |
2159 | */ | |
343e0d7a | 2160 | int kmem_cache_destroy(struct kmem_cache *cachep) |
1da177e4 LT |
2161 | { |
2162 | int i; | |
e498be7d | 2163 | struct kmem_list3 *l3; |
1da177e4 LT |
2164 | |
2165 | if (!cachep || in_interrupt()) | |
2166 | BUG(); | |
2167 | ||
2168 | /* Don't let CPUs to come and go */ | |
2169 | lock_cpu_hotplug(); | |
2170 | ||
2171 | /* Find the cache in the chain of caches. */ | |
fc0abb14 | 2172 | mutex_lock(&cache_chain_mutex); |
1da177e4 LT |
2173 | /* |
2174 | * the chain is never empty, cache_cache is never destroyed | |
2175 | */ | |
2176 | list_del(&cachep->next); | |
fc0abb14 | 2177 | mutex_unlock(&cache_chain_mutex); |
1da177e4 LT |
2178 | |
2179 | if (__cache_shrink(cachep)) { | |
2180 | slab_error(cachep, "Can't free all objects"); | |
fc0abb14 | 2181 | mutex_lock(&cache_chain_mutex); |
b28a02de | 2182 | list_add(&cachep->next, &cache_chain); |
fc0abb14 | 2183 | mutex_unlock(&cache_chain_mutex); |
1da177e4 LT |
2184 | unlock_cpu_hotplug(); |
2185 | return 1; | |
2186 | } | |
2187 | ||
2188 | if (unlikely(cachep->flags & SLAB_DESTROY_BY_RCU)) | |
fbd568a3 | 2189 | synchronize_rcu(); |
1da177e4 | 2190 | |
e498be7d | 2191 | for_each_online_cpu(i) |
b28a02de | 2192 | kfree(cachep->array[i]); |
1da177e4 LT |
2193 | |
2194 | /* NUMA: free the list3 structures */ | |
e498be7d CL |
2195 | for_each_online_node(i) { |
2196 | if ((l3 = cachep->nodelists[i])) { | |
2197 | kfree(l3->shared); | |
2198 | free_alien_cache(l3->alien); | |
2199 | kfree(l3); | |
2200 | } | |
2201 | } | |
1da177e4 LT |
2202 | kmem_cache_free(&cache_cache, cachep); |
2203 | ||
2204 | unlock_cpu_hotplug(); | |
2205 | ||
2206 | return 0; | |
2207 | } | |
2208 | EXPORT_SYMBOL(kmem_cache_destroy); | |
2209 | ||
2210 | /* Get the memory for a slab management obj. */ | |
343e0d7a | 2211 | static struct slab *alloc_slabmgmt(struct kmem_cache *cachep, void *objp, |
b28a02de | 2212 | int colour_off, gfp_t local_flags) |
1da177e4 LT |
2213 | { |
2214 | struct slab *slabp; | |
b28a02de | 2215 | |
1da177e4 LT |
2216 | if (OFF_SLAB(cachep)) { |
2217 | /* Slab management obj is off-slab. */ | |
2218 | slabp = kmem_cache_alloc(cachep->slabp_cache, local_flags); | |
2219 | if (!slabp) | |
2220 | return NULL; | |
2221 | } else { | |
b28a02de | 2222 | slabp = objp + colour_off; |
1da177e4 LT |
2223 | colour_off += cachep->slab_size; |
2224 | } | |
2225 | slabp->inuse = 0; | |
2226 | slabp->colouroff = colour_off; | |
b28a02de | 2227 | slabp->s_mem = objp + colour_off; |
1da177e4 LT |
2228 | |
2229 | return slabp; | |
2230 | } | |
2231 | ||
2232 | static inline kmem_bufctl_t *slab_bufctl(struct slab *slabp) | |
2233 | { | |
b28a02de | 2234 | return (kmem_bufctl_t *) (slabp + 1); |
1da177e4 LT |
2235 | } |
2236 | ||
343e0d7a | 2237 | static void cache_init_objs(struct kmem_cache *cachep, |
b28a02de | 2238 | struct slab *slabp, unsigned long ctor_flags) |
1da177e4 LT |
2239 | { |
2240 | int i; | |
2241 | ||
2242 | for (i = 0; i < cachep->num; i++) { | |
3dafccf2 | 2243 | void *objp = slabp->s_mem + cachep->buffer_size * i; |
1da177e4 LT |
2244 | #if DEBUG |
2245 | /* need to poison the objs? */ | |
2246 | if (cachep->flags & SLAB_POISON) | |
2247 | poison_obj(cachep, objp, POISON_FREE); | |
2248 | if (cachep->flags & SLAB_STORE_USER) | |
2249 | *dbg_userword(cachep, objp) = NULL; | |
2250 | ||
2251 | if (cachep->flags & SLAB_RED_ZONE) { | |
2252 | *dbg_redzone1(cachep, objp) = RED_INACTIVE; | |
2253 | *dbg_redzone2(cachep, objp) = RED_INACTIVE; | |
2254 | } | |
2255 | /* | |
2256 | * Constructors are not allowed to allocate memory from | |
2257 | * the same cache which they are a constructor for. | |
2258 | * Otherwise, deadlock. They must also be threaded. | |
2259 | */ | |
2260 | if (cachep->ctor && !(cachep->flags & SLAB_POISON)) | |
3dafccf2 | 2261 | cachep->ctor(objp + obj_offset(cachep), cachep, |
b28a02de | 2262 | ctor_flags); |
1da177e4 LT |
2263 | |
2264 | if (cachep->flags & SLAB_RED_ZONE) { | |
2265 | if (*dbg_redzone2(cachep, objp) != RED_INACTIVE) | |
2266 | slab_error(cachep, "constructor overwrote the" | |
b28a02de | 2267 | " end of an object"); |
1da177e4 LT |
2268 | if (*dbg_redzone1(cachep, objp) != RED_INACTIVE) |
2269 | slab_error(cachep, "constructor overwrote the" | |
b28a02de | 2270 | " start of an object"); |
1da177e4 | 2271 | } |
3dafccf2 | 2272 | if ((cachep->buffer_size % PAGE_SIZE) == 0 && OFF_SLAB(cachep) |
b28a02de PE |
2273 | && cachep->flags & SLAB_POISON) |
2274 | kernel_map_pages(virt_to_page(objp), | |
3dafccf2 | 2275 | cachep->buffer_size / PAGE_SIZE, 0); |
1da177e4 LT |
2276 | #else |
2277 | if (cachep->ctor) | |
2278 | cachep->ctor(objp, cachep, ctor_flags); | |
2279 | #endif | |
b28a02de | 2280 | slab_bufctl(slabp)[i] = i + 1; |
1da177e4 | 2281 | } |
b28a02de | 2282 | slab_bufctl(slabp)[i - 1] = BUFCTL_END; |
1da177e4 LT |
2283 | slabp->free = 0; |
2284 | } | |
2285 | ||
343e0d7a | 2286 | static void kmem_flagcheck(struct kmem_cache *cachep, gfp_t flags) |
1da177e4 LT |
2287 | { |
2288 | if (flags & SLAB_DMA) { | |
2289 | if (!(cachep->gfpflags & GFP_DMA)) | |
2290 | BUG(); | |
2291 | } else { | |
2292 | if (cachep->gfpflags & GFP_DMA) | |
2293 | BUG(); | |
2294 | } | |
2295 | } | |
2296 | ||
343e0d7a | 2297 | static void *slab_get_obj(struct kmem_cache *cachep, struct slab *slabp, int nodeid) |
78d382d7 MD |
2298 | { |
2299 | void *objp = slabp->s_mem + (slabp->free * cachep->buffer_size); | |
2300 | kmem_bufctl_t next; | |
2301 | ||
2302 | slabp->inuse++; | |
2303 | next = slab_bufctl(slabp)[slabp->free]; | |
2304 | #if DEBUG | |
2305 | slab_bufctl(slabp)[slabp->free] = BUFCTL_FREE; | |
2306 | WARN_ON(slabp->nodeid != nodeid); | |
2307 | #endif | |
2308 | slabp->free = next; | |
2309 | ||
2310 | return objp; | |
2311 | } | |
2312 | ||
343e0d7a | 2313 | static void slab_put_obj(struct kmem_cache *cachep, struct slab *slabp, void *objp, |
78d382d7 MD |
2314 | int nodeid) |
2315 | { | |
2316 | unsigned int objnr = (unsigned)(objp-slabp->s_mem) / cachep->buffer_size; | |
2317 | ||
2318 | #if DEBUG | |
2319 | /* Verify that the slab belongs to the intended node */ | |
2320 | WARN_ON(slabp->nodeid != nodeid); | |
2321 | ||
2322 | if (slab_bufctl(slabp)[objnr] != BUFCTL_FREE) { | |
2323 | printk(KERN_ERR "slab: double free detected in cache " | |
2324 | "'%s', objp %p\n", cachep->name, objp); | |
2325 | BUG(); | |
2326 | } | |
2327 | #endif | |
2328 | slab_bufctl(slabp)[objnr] = slabp->free; | |
2329 | slabp->free = objnr; | |
2330 | slabp->inuse--; | |
2331 | } | |
2332 | ||
343e0d7a | 2333 | static void set_slab_attr(struct kmem_cache *cachep, struct slab *slabp, void *objp) |
1da177e4 LT |
2334 | { |
2335 | int i; | |
2336 | struct page *page; | |
2337 | ||
2338 | /* Nasty!!!!!! I hope this is OK. */ | |
2339 | i = 1 << cachep->gfporder; | |
2340 | page = virt_to_page(objp); | |
2341 | do { | |
065d41cb PE |
2342 | page_set_cache(page, cachep); |
2343 | page_set_slab(page, slabp); | |
1da177e4 LT |
2344 | page++; |
2345 | } while (--i); | |
2346 | } | |
2347 | ||
2348 | /* | |
2349 | * Grow (by 1) the number of slabs within a cache. This is called by | |
2350 | * kmem_cache_alloc() when there are no active objs left in a cache. | |
2351 | */ | |
343e0d7a | 2352 | static int cache_grow(struct kmem_cache *cachep, gfp_t flags, int nodeid) |
1da177e4 | 2353 | { |
b28a02de PE |
2354 | struct slab *slabp; |
2355 | void *objp; | |
2356 | size_t offset; | |
2357 | gfp_t local_flags; | |
2358 | unsigned long ctor_flags; | |
e498be7d | 2359 | struct kmem_list3 *l3; |
1da177e4 LT |
2360 | |
2361 | /* Be lazy and only check for valid flags here, | |
b28a02de | 2362 | * keeping it out of the critical path in kmem_cache_alloc(). |
1da177e4 | 2363 | */ |
b28a02de | 2364 | if (flags & ~(SLAB_DMA | SLAB_LEVEL_MASK | SLAB_NO_GROW)) |
1da177e4 LT |
2365 | BUG(); |
2366 | if (flags & SLAB_NO_GROW) | |
2367 | return 0; | |
2368 | ||
2369 | ctor_flags = SLAB_CTOR_CONSTRUCTOR; | |
2370 | local_flags = (flags & SLAB_LEVEL_MASK); | |
2371 | if (!(local_flags & __GFP_WAIT)) | |
2372 | /* | |
2373 | * Not allowed to sleep. Need to tell a constructor about | |
2374 | * this - it might need to know... | |
2375 | */ | |
2376 | ctor_flags |= SLAB_CTOR_ATOMIC; | |
2377 | ||
2e1217cf | 2378 | /* Take the l3 list lock to change the colour_next on this node */ |
1da177e4 | 2379 | check_irq_off(); |
2e1217cf RT |
2380 | l3 = cachep->nodelists[nodeid]; |
2381 | spin_lock(&l3->list_lock); | |
1da177e4 LT |
2382 | |
2383 | /* Get colour for the slab, and cal the next value. */ | |
2e1217cf RT |
2384 | offset = l3->colour_next; |
2385 | l3->colour_next++; | |
2386 | if (l3->colour_next >= cachep->colour) | |
2387 | l3->colour_next = 0; | |
2388 | spin_unlock(&l3->list_lock); | |
1da177e4 | 2389 | |
2e1217cf | 2390 | offset *= cachep->colour_off; |
1da177e4 LT |
2391 | |
2392 | if (local_flags & __GFP_WAIT) | |
2393 | local_irq_enable(); | |
2394 | ||
2395 | /* | |
2396 | * The test for missing atomic flag is performed here, rather than | |
2397 | * the more obvious place, simply to reduce the critical path length | |
2398 | * in kmem_cache_alloc(). If a caller is seriously mis-behaving they | |
2399 | * will eventually be caught here (where it matters). | |
2400 | */ | |
2401 | kmem_flagcheck(cachep, flags); | |
2402 | ||
e498be7d CL |
2403 | /* Get mem for the objs. |
2404 | * Attempt to allocate a physical page from 'nodeid', | |
2405 | */ | |
1da177e4 LT |
2406 | if (!(objp = kmem_getpages(cachep, flags, nodeid))) |
2407 | goto failed; | |
2408 | ||
2409 | /* Get slab management. */ | |
2410 | if (!(slabp = alloc_slabmgmt(cachep, objp, offset, local_flags))) | |
2411 | goto opps1; | |
2412 | ||
e498be7d | 2413 | slabp->nodeid = nodeid; |
1da177e4 LT |
2414 | set_slab_attr(cachep, slabp, objp); |
2415 | ||
2416 | cache_init_objs(cachep, slabp, ctor_flags); | |
2417 | ||
2418 | if (local_flags & __GFP_WAIT) | |
2419 | local_irq_disable(); | |
2420 | check_irq_off(); | |
e498be7d | 2421 | spin_lock(&l3->list_lock); |
1da177e4 LT |
2422 | |
2423 | /* Make slab active. */ | |
e498be7d | 2424 | list_add_tail(&slabp->list, &(l3->slabs_free)); |
1da177e4 | 2425 | STATS_INC_GROWN(cachep); |
e498be7d CL |
2426 | l3->free_objects += cachep->num; |
2427 | spin_unlock(&l3->list_lock); | |
1da177e4 | 2428 | return 1; |
b28a02de | 2429 | opps1: |
1da177e4 | 2430 | kmem_freepages(cachep, objp); |
b28a02de | 2431 | failed: |
1da177e4 LT |
2432 | if (local_flags & __GFP_WAIT) |
2433 | local_irq_disable(); | |
2434 | return 0; | |
2435 | } | |
2436 | ||
2437 | #if DEBUG | |
2438 | ||
2439 | /* | |
2440 | * Perform extra freeing checks: | |
2441 | * - detect bad pointers. | |
2442 | * - POISON/RED_ZONE checking | |
2443 | * - destructor calls, for caches with POISON+dtor | |
2444 | */ | |
2445 | static void kfree_debugcheck(const void *objp) | |
2446 | { | |
2447 | struct page *page; | |
2448 | ||
2449 | if (!virt_addr_valid(objp)) { | |
2450 | printk(KERN_ERR "kfree_debugcheck: out of range ptr %lxh.\n", | |
b28a02de PE |
2451 | (unsigned long)objp); |
2452 | BUG(); | |
1da177e4 LT |
2453 | } |
2454 | page = virt_to_page(objp); | |
2455 | if (!PageSlab(page)) { | |
b28a02de PE |
2456 | printk(KERN_ERR "kfree_debugcheck: bad ptr %lxh.\n", |
2457 | (unsigned long)objp); | |
1da177e4 LT |
2458 | BUG(); |
2459 | } | |
2460 | } | |
2461 | ||
343e0d7a | 2462 | static void *cache_free_debugcheck(struct kmem_cache *cachep, void *objp, |
b28a02de | 2463 | void *caller) |
1da177e4 LT |
2464 | { |
2465 | struct page *page; | |
2466 | unsigned int objnr; | |
2467 | struct slab *slabp; | |
2468 | ||
3dafccf2 | 2469 | objp -= obj_offset(cachep); |
1da177e4 LT |
2470 | kfree_debugcheck(objp); |
2471 | page = virt_to_page(objp); | |
2472 | ||
065d41cb | 2473 | if (page_get_cache(page) != cachep) { |
b28a02de PE |
2474 | printk(KERN_ERR |
2475 | "mismatch in kmem_cache_free: expected cache %p, got %p\n", | |
2476 | page_get_cache(page), cachep); | |
1da177e4 | 2477 | printk(KERN_ERR "%p is %s.\n", cachep, cachep->name); |
b28a02de PE |
2478 | printk(KERN_ERR "%p is %s.\n", page_get_cache(page), |
2479 | page_get_cache(page)->name); | |
1da177e4 LT |
2480 | WARN_ON(1); |
2481 | } | |
065d41cb | 2482 | slabp = page_get_slab(page); |
1da177e4 LT |
2483 | |
2484 | if (cachep->flags & SLAB_RED_ZONE) { | |
b28a02de PE |
2485 | if (*dbg_redzone1(cachep, objp) != RED_ACTIVE |
2486 | || *dbg_redzone2(cachep, objp) != RED_ACTIVE) { | |
2487 | slab_error(cachep, | |
2488 | "double free, or memory outside" | |
2489 | " object was overwritten"); | |
2490 | printk(KERN_ERR | |
2491 | "%p: redzone 1: 0x%lx, redzone 2: 0x%lx.\n", | |
2492 | objp, *dbg_redzone1(cachep, objp), | |
2493 | *dbg_redzone2(cachep, objp)); | |
1da177e4 LT |
2494 | } |
2495 | *dbg_redzone1(cachep, objp) = RED_INACTIVE; | |
2496 | *dbg_redzone2(cachep, objp) = RED_INACTIVE; | |
2497 | } | |
2498 | if (cachep->flags & SLAB_STORE_USER) | |
2499 | *dbg_userword(cachep, objp) = caller; | |
2500 | ||
3dafccf2 | 2501 | objnr = (unsigned)(objp - slabp->s_mem) / cachep->buffer_size; |
1da177e4 LT |
2502 | |
2503 | BUG_ON(objnr >= cachep->num); | |
3dafccf2 | 2504 | BUG_ON(objp != slabp->s_mem + objnr * cachep->buffer_size); |
1da177e4 LT |
2505 | |
2506 | if (cachep->flags & SLAB_DEBUG_INITIAL) { | |
2507 | /* Need to call the slab's constructor so the | |
2508 | * caller can perform a verify of its state (debugging). | |
2509 | * Called without the cache-lock held. | |
2510 | */ | |
3dafccf2 | 2511 | cachep->ctor(objp + obj_offset(cachep), |
b28a02de | 2512 | cachep, SLAB_CTOR_CONSTRUCTOR | SLAB_CTOR_VERIFY); |
1da177e4 LT |
2513 | } |
2514 | if (cachep->flags & SLAB_POISON && cachep->dtor) { | |
2515 | /* we want to cache poison the object, | |
2516 | * call the destruction callback | |
2517 | */ | |
3dafccf2 | 2518 | cachep->dtor(objp + obj_offset(cachep), cachep, 0); |
1da177e4 LT |
2519 | } |
2520 | if (cachep->flags & SLAB_POISON) { | |
2521 | #ifdef CONFIG_DEBUG_PAGEALLOC | |
3dafccf2 | 2522 | if ((cachep->buffer_size % PAGE_SIZE) == 0 && OFF_SLAB(cachep)) { |
1da177e4 | 2523 | store_stackinfo(cachep, objp, (unsigned long)caller); |
b28a02de | 2524 | kernel_map_pages(virt_to_page(objp), |
3dafccf2 | 2525 | cachep->buffer_size / PAGE_SIZE, 0); |
1da177e4 LT |
2526 | } else { |
2527 | poison_obj(cachep, objp, POISON_FREE); | |
2528 | } | |
2529 | #else | |
2530 | poison_obj(cachep, objp, POISON_FREE); | |
2531 | #endif | |
2532 | } | |
2533 | return objp; | |
2534 | } | |
2535 | ||
343e0d7a | 2536 | static void check_slabp(struct kmem_cache *cachep, struct slab *slabp) |
1da177e4 LT |
2537 | { |
2538 | kmem_bufctl_t i; | |
2539 | int entries = 0; | |
b28a02de | 2540 | |
1da177e4 LT |
2541 | /* Check slab's freelist to see if this obj is there. */ |
2542 | for (i = slabp->free; i != BUFCTL_END; i = slab_bufctl(slabp)[i]) { | |
2543 | entries++; | |
2544 | if (entries > cachep->num || i >= cachep->num) | |
2545 | goto bad; | |
2546 | } | |
2547 | if (entries != cachep->num - slabp->inuse) { | |
b28a02de PE |
2548 | bad: |
2549 | printk(KERN_ERR | |
2550 | "slab: Internal list corruption detected in cache '%s'(%d), slabp %p(%d). Hexdump:\n", | |
2551 | cachep->name, cachep->num, slabp, slabp->inuse); | |
2552 | for (i = 0; | |
2553 | i < sizeof(slabp) + cachep->num * sizeof(kmem_bufctl_t); | |
2554 | i++) { | |
2555 | if ((i % 16) == 0) | |
1da177e4 | 2556 | printk("\n%03x:", i); |
b28a02de | 2557 | printk(" %02x", ((unsigned char *)slabp)[i]); |
1da177e4 LT |
2558 | } |
2559 | printk("\n"); | |
2560 | BUG(); | |
2561 | } | |
2562 | } | |
2563 | #else | |
2564 | #define kfree_debugcheck(x) do { } while(0) | |
2565 | #define cache_free_debugcheck(x,objp,z) (objp) | |
2566 | #define check_slabp(x,y) do { } while(0) | |
2567 | #endif | |
2568 | ||
343e0d7a | 2569 | static void *cache_alloc_refill(struct kmem_cache *cachep, gfp_t flags) |
1da177e4 LT |
2570 | { |
2571 | int batchcount; | |
2572 | struct kmem_list3 *l3; | |
2573 | struct array_cache *ac; | |
2574 | ||
2575 | check_irq_off(); | |
9a2dba4b | 2576 | ac = cpu_cache_get(cachep); |
b28a02de | 2577 | retry: |
1da177e4 LT |
2578 | batchcount = ac->batchcount; |
2579 | if (!ac->touched && batchcount > BATCHREFILL_LIMIT) { | |
2580 | /* if there was little recent activity on this | |
2581 | * cache, then perform only a partial refill. | |
2582 | * Otherwise we could generate refill bouncing. | |
2583 | */ | |
2584 | batchcount = BATCHREFILL_LIMIT; | |
2585 | } | |
e498be7d CL |
2586 | l3 = cachep->nodelists[numa_node_id()]; |
2587 | ||
2588 | BUG_ON(ac->avail > 0 || !l3); | |
2589 | spin_lock(&l3->list_lock); | |
1da177e4 | 2590 | |
1da177e4 LT |
2591 | if (l3->shared) { |
2592 | struct array_cache *shared_array = l3->shared; | |
2593 | if (shared_array->avail) { | |
2594 | if (batchcount > shared_array->avail) | |
2595 | batchcount = shared_array->avail; | |
2596 | shared_array->avail -= batchcount; | |
2597 | ac->avail = batchcount; | |
e498be7d | 2598 | memcpy(ac->entry, |
b28a02de PE |
2599 | &(shared_array->entry[shared_array->avail]), |
2600 | sizeof(void *) * batchcount); | |
1da177e4 LT |
2601 | shared_array->touched = 1; |
2602 | goto alloc_done; | |
2603 | } | |
2604 | } | |
2605 | while (batchcount > 0) { | |
2606 | struct list_head *entry; | |
2607 | struct slab *slabp; | |
2608 | /* Get slab alloc is to come from. */ | |
2609 | entry = l3->slabs_partial.next; | |
2610 | if (entry == &l3->slabs_partial) { | |
2611 | l3->free_touched = 1; | |
2612 | entry = l3->slabs_free.next; | |
2613 | if (entry == &l3->slabs_free) | |
2614 | goto must_grow; | |
2615 | } | |
2616 | ||
2617 | slabp = list_entry(entry, struct slab, list); | |
2618 | check_slabp(cachep, slabp); | |
2619 | check_spinlock_acquired(cachep); | |
2620 | while (slabp->inuse < cachep->num && batchcount--) { | |
1da177e4 LT |
2621 | STATS_INC_ALLOCED(cachep); |
2622 | STATS_INC_ACTIVE(cachep); | |
2623 | STATS_SET_HIGH(cachep); | |
2624 | ||
78d382d7 MD |
2625 | ac->entry[ac->avail++] = slab_get_obj(cachep, slabp, |
2626 | numa_node_id()); | |
1da177e4 LT |
2627 | } |
2628 | check_slabp(cachep, slabp); | |
2629 | ||
2630 | /* move slabp to correct slabp list: */ | |
2631 | list_del(&slabp->list); | |
2632 | if (slabp->free == BUFCTL_END) | |
2633 | list_add(&slabp->list, &l3->slabs_full); | |
2634 | else | |
2635 | list_add(&slabp->list, &l3->slabs_partial); | |
2636 | } | |
2637 | ||
b28a02de | 2638 | must_grow: |
1da177e4 | 2639 | l3->free_objects -= ac->avail; |
b28a02de | 2640 | alloc_done: |
e498be7d | 2641 | spin_unlock(&l3->list_lock); |
1da177e4 LT |
2642 | |
2643 | if (unlikely(!ac->avail)) { | |
2644 | int x; | |
e498be7d CL |
2645 | x = cache_grow(cachep, flags, numa_node_id()); |
2646 | ||
1da177e4 | 2647 | // cache_grow can reenable interrupts, then ac could change. |
9a2dba4b | 2648 | ac = cpu_cache_get(cachep); |
1da177e4 LT |
2649 | if (!x && ac->avail == 0) // no objects in sight? abort |
2650 | return NULL; | |
2651 | ||
b28a02de | 2652 | if (!ac->avail) // objects refilled by interrupt? |
1da177e4 LT |
2653 | goto retry; |
2654 | } | |
2655 | ac->touched = 1; | |
e498be7d | 2656 | return ac->entry[--ac->avail]; |
1da177e4 LT |
2657 | } |
2658 | ||
2659 | static inline void | |
343e0d7a | 2660 | cache_alloc_debugcheck_before(struct kmem_cache *cachep, gfp_t flags) |
1da177e4 LT |
2661 | { |
2662 | might_sleep_if(flags & __GFP_WAIT); | |
2663 | #if DEBUG | |
2664 | kmem_flagcheck(cachep, flags); | |
2665 | #endif | |
2666 | } | |
2667 | ||
2668 | #if DEBUG | |
343e0d7a | 2669 | static void *cache_alloc_debugcheck_after(struct kmem_cache *cachep, gfp_t flags, |
b28a02de | 2670 | void *objp, void *caller) |
1da177e4 | 2671 | { |
b28a02de | 2672 | if (!objp) |
1da177e4 | 2673 | return objp; |
b28a02de | 2674 | if (cachep->flags & SLAB_POISON) { |
1da177e4 | 2675 | #ifdef CONFIG_DEBUG_PAGEALLOC |
3dafccf2 | 2676 | if ((cachep->buffer_size % PAGE_SIZE) == 0 && OFF_SLAB(cachep)) |
b28a02de | 2677 | kernel_map_pages(virt_to_page(objp), |
3dafccf2 | 2678 | cachep->buffer_size / PAGE_SIZE, 1); |
1da177e4 LT |
2679 | else |
2680 | check_poison_obj(cachep, objp); | |
2681 | #else | |
2682 | check_poison_obj(cachep, objp); | |
2683 | #endif | |
2684 | poison_obj(cachep, objp, POISON_INUSE); | |
2685 | } | |
2686 | if (cachep->flags & SLAB_STORE_USER) | |
2687 | *dbg_userword(cachep, objp) = caller; | |
2688 | ||
2689 | if (cachep->flags & SLAB_RED_ZONE) { | |
b28a02de PE |
2690 | if (*dbg_redzone1(cachep, objp) != RED_INACTIVE |
2691 | || *dbg_redzone2(cachep, objp) != RED_INACTIVE) { | |
2692 | slab_error(cachep, | |
2693 | "double free, or memory outside" | |
2694 | " object was overwritten"); | |
2695 | printk(KERN_ERR | |
2696 | "%p: redzone 1: 0x%lx, redzone 2: 0x%lx.\n", | |
2697 | objp, *dbg_redzone1(cachep, objp), | |
2698 | *dbg_redzone2(cachep, objp)); | |
1da177e4 LT |
2699 | } |
2700 | *dbg_redzone1(cachep, objp) = RED_ACTIVE; | |
2701 | *dbg_redzone2(cachep, objp) = RED_ACTIVE; | |
2702 | } | |
3dafccf2 | 2703 | objp += obj_offset(cachep); |
1da177e4 | 2704 | if (cachep->ctor && cachep->flags & SLAB_POISON) { |
b28a02de | 2705 | unsigned long ctor_flags = SLAB_CTOR_CONSTRUCTOR; |
1da177e4 LT |
2706 | |
2707 | if (!(flags & __GFP_WAIT)) | |
2708 | ctor_flags |= SLAB_CTOR_ATOMIC; | |
2709 | ||
2710 | cachep->ctor(objp, cachep, ctor_flags); | |
b28a02de | 2711 | } |
1da177e4 LT |
2712 | return objp; |
2713 | } | |
2714 | #else | |
2715 | #define cache_alloc_debugcheck_after(a,b,objp,d) (objp) | |
2716 | #endif | |
2717 | ||
343e0d7a | 2718 | static inline void *____cache_alloc(struct kmem_cache *cachep, gfp_t flags) |
1da177e4 | 2719 | { |
b28a02de | 2720 | void *objp; |
1da177e4 LT |
2721 | struct array_cache *ac; |
2722 | ||
dc85da15 | 2723 | #ifdef CONFIG_NUMA |
86c562a9 | 2724 | if (unlikely(current->mempolicy && !in_interrupt())) { |
dc85da15 CL |
2725 | int nid = slab_node(current->mempolicy); |
2726 | ||
2727 | if (nid != numa_node_id()) | |
2728 | return __cache_alloc_node(cachep, flags, nid); | |
2729 | } | |
2730 | #endif | |
2731 | ||
5c382300 | 2732 | check_irq_off(); |
9a2dba4b | 2733 | ac = cpu_cache_get(cachep); |
1da177e4 LT |
2734 | if (likely(ac->avail)) { |
2735 | STATS_INC_ALLOCHIT(cachep); | |
2736 | ac->touched = 1; | |
e498be7d | 2737 | objp = ac->entry[--ac->avail]; |
1da177e4 LT |
2738 | } else { |
2739 | STATS_INC_ALLOCMISS(cachep); | |
2740 | objp = cache_alloc_refill(cachep, flags); | |
2741 | } | |
5c382300 AK |
2742 | return objp; |
2743 | } | |
2744 | ||
7fd6b141 PE |
2745 | static __always_inline void * |
2746 | __cache_alloc(struct kmem_cache *cachep, gfp_t flags, void *caller) | |
5c382300 AK |
2747 | { |
2748 | unsigned long save_flags; | |
b28a02de | 2749 | void *objp; |
5c382300 AK |
2750 | |
2751 | cache_alloc_debugcheck_before(cachep, flags); | |
2752 | ||
2753 | local_irq_save(save_flags); | |
2754 | objp = ____cache_alloc(cachep, flags); | |
1da177e4 | 2755 | local_irq_restore(save_flags); |
34342e86 | 2756 | objp = cache_alloc_debugcheck_after(cachep, flags, objp, |
7fd6b141 | 2757 | caller); |
34342e86 | 2758 | prefetchw(objp); |
1da177e4 LT |
2759 | return objp; |
2760 | } | |
2761 | ||
e498be7d CL |
2762 | #ifdef CONFIG_NUMA |
2763 | /* | |
2764 | * A interface to enable slab creation on nodeid | |
1da177e4 | 2765 | */ |
343e0d7a | 2766 | static void *__cache_alloc_node(struct kmem_cache *cachep, gfp_t flags, int nodeid) |
e498be7d CL |
2767 | { |
2768 | struct list_head *entry; | |
b28a02de PE |
2769 | struct slab *slabp; |
2770 | struct kmem_list3 *l3; | |
2771 | void *obj; | |
b28a02de PE |
2772 | int x; |
2773 | ||
2774 | l3 = cachep->nodelists[nodeid]; | |
2775 | BUG_ON(!l3); | |
2776 | ||
2777 | retry: | |
ca3b9b91 | 2778 | check_irq_off(); |
b28a02de PE |
2779 | spin_lock(&l3->list_lock); |
2780 | entry = l3->slabs_partial.next; | |
2781 | if (entry == &l3->slabs_partial) { | |
2782 | l3->free_touched = 1; | |
2783 | entry = l3->slabs_free.next; | |
2784 | if (entry == &l3->slabs_free) | |
2785 | goto must_grow; | |
2786 | } | |
2787 | ||
2788 | slabp = list_entry(entry, struct slab, list); | |
2789 | check_spinlock_acquired_node(cachep, nodeid); | |
2790 | check_slabp(cachep, slabp); | |
2791 | ||
2792 | STATS_INC_NODEALLOCS(cachep); | |
2793 | STATS_INC_ACTIVE(cachep); | |
2794 | STATS_SET_HIGH(cachep); | |
2795 | ||
2796 | BUG_ON(slabp->inuse == cachep->num); | |
2797 | ||
78d382d7 | 2798 | obj = slab_get_obj(cachep, slabp, nodeid); |
b28a02de PE |
2799 | check_slabp(cachep, slabp); |
2800 | l3->free_objects--; | |
2801 | /* move slabp to correct slabp list: */ | |
2802 | list_del(&slabp->list); | |
2803 | ||
2804 | if (slabp->free == BUFCTL_END) { | |
2805 | list_add(&slabp->list, &l3->slabs_full); | |
2806 | } else { | |
2807 | list_add(&slabp->list, &l3->slabs_partial); | |
2808 | } | |
e498be7d | 2809 | |
b28a02de PE |
2810 | spin_unlock(&l3->list_lock); |
2811 | goto done; | |
e498be7d | 2812 | |
b28a02de PE |
2813 | must_grow: |
2814 | spin_unlock(&l3->list_lock); | |
2815 | x = cache_grow(cachep, flags, nodeid); | |
1da177e4 | 2816 | |
b28a02de PE |
2817 | if (!x) |
2818 | return NULL; | |
e498be7d | 2819 | |
b28a02de PE |
2820 | goto retry; |
2821 | done: | |
2822 | return obj; | |
e498be7d CL |
2823 | } |
2824 | #endif | |
2825 | ||
2826 | /* | |
2827 | * Caller needs to acquire correct kmem_list's list_lock | |
2828 | */ | |
343e0d7a | 2829 | static void free_block(struct kmem_cache *cachep, void **objpp, int nr_objects, |
b28a02de | 2830 | int node) |
1da177e4 LT |
2831 | { |
2832 | int i; | |
e498be7d | 2833 | struct kmem_list3 *l3; |
1da177e4 LT |
2834 | |
2835 | for (i = 0; i < nr_objects; i++) { | |
2836 | void *objp = objpp[i]; | |
2837 | struct slab *slabp; | |
1da177e4 | 2838 | |
6ed5eb22 | 2839 | slabp = virt_to_slab(objp); |
ff69416e | 2840 | l3 = cachep->nodelists[node]; |
1da177e4 | 2841 | list_del(&slabp->list); |
ff69416e | 2842 | check_spinlock_acquired_node(cachep, node); |
1da177e4 | 2843 | check_slabp(cachep, slabp); |
78d382d7 | 2844 | slab_put_obj(cachep, slabp, objp, node); |
1da177e4 | 2845 | STATS_DEC_ACTIVE(cachep); |
e498be7d | 2846 | l3->free_objects++; |
1da177e4 LT |
2847 | check_slabp(cachep, slabp); |
2848 | ||
2849 | /* fixup slab chains */ | |
2850 | if (slabp->inuse == 0) { | |
e498be7d CL |
2851 | if (l3->free_objects > l3->free_limit) { |
2852 | l3->free_objects -= cachep->num; | |
1da177e4 LT |
2853 | slab_destroy(cachep, slabp); |
2854 | } else { | |
e498be7d | 2855 | list_add(&slabp->list, &l3->slabs_free); |
1da177e4 LT |
2856 | } |
2857 | } else { | |
2858 | /* Unconditionally move a slab to the end of the | |
2859 | * partial list on free - maximum time for the | |
2860 | * other objects to be freed, too. | |
2861 | */ | |
e498be7d | 2862 | list_add_tail(&slabp->list, &l3->slabs_partial); |
1da177e4 LT |
2863 | } |
2864 | } | |
2865 | } | |
2866 | ||
343e0d7a | 2867 | static void cache_flusharray(struct kmem_cache *cachep, struct array_cache *ac) |
1da177e4 LT |
2868 | { |
2869 | int batchcount; | |
e498be7d | 2870 | struct kmem_list3 *l3; |
ff69416e | 2871 | int node = numa_node_id(); |
1da177e4 LT |
2872 | |
2873 | batchcount = ac->batchcount; | |
2874 | #if DEBUG | |
2875 | BUG_ON(!batchcount || batchcount > ac->avail); | |
2876 | #endif | |
2877 | check_irq_off(); | |
ff69416e | 2878 | l3 = cachep->nodelists[node]; |
e498be7d CL |
2879 | spin_lock(&l3->list_lock); |
2880 | if (l3->shared) { | |
2881 | struct array_cache *shared_array = l3->shared; | |
b28a02de | 2882 | int max = shared_array->limit - shared_array->avail; |
1da177e4 LT |
2883 | if (max) { |
2884 | if (batchcount > max) | |
2885 | batchcount = max; | |
e498be7d | 2886 | memcpy(&(shared_array->entry[shared_array->avail]), |
b28a02de | 2887 | ac->entry, sizeof(void *) * batchcount); |
1da177e4 LT |
2888 | shared_array->avail += batchcount; |
2889 | goto free_done; | |
2890 | } | |
2891 | } | |
2892 | ||
ff69416e | 2893 | free_block(cachep, ac->entry, batchcount, node); |
b28a02de | 2894 | free_done: |
1da177e4 LT |
2895 | #if STATS |
2896 | { | |
2897 | int i = 0; | |
2898 | struct list_head *p; | |
2899 | ||
e498be7d CL |
2900 | p = l3->slabs_free.next; |
2901 | while (p != &(l3->slabs_free)) { | |
1da177e4 LT |
2902 | struct slab *slabp; |
2903 | ||
2904 | slabp = list_entry(p, struct slab, list); | |
2905 | BUG_ON(slabp->inuse); | |
2906 | ||
2907 | i++; | |
2908 | p = p->next; | |
2909 | } | |
2910 | STATS_SET_FREEABLE(cachep, i); | |
2911 | } | |
2912 | #endif | |
e498be7d | 2913 | spin_unlock(&l3->list_lock); |
1da177e4 | 2914 | ac->avail -= batchcount; |
e498be7d | 2915 | memmove(ac->entry, &(ac->entry[batchcount]), |
b28a02de | 2916 | sizeof(void *) * ac->avail); |
1da177e4 LT |
2917 | } |
2918 | ||
2919 | /* | |
2920 | * __cache_free | |
2921 | * Release an obj back to its cache. If the obj has a constructed | |
2922 | * state, it must be in this state _before_ it is released. | |
2923 | * | |
2924 | * Called with disabled ints. | |
2925 | */ | |
343e0d7a | 2926 | static inline void __cache_free(struct kmem_cache *cachep, void *objp) |
1da177e4 | 2927 | { |
9a2dba4b | 2928 | struct array_cache *ac = cpu_cache_get(cachep); |
1da177e4 LT |
2929 | |
2930 | check_irq_off(); | |
2931 | objp = cache_free_debugcheck(cachep, objp, __builtin_return_address(0)); | |
2932 | ||
e498be7d CL |
2933 | /* Make sure we are not freeing a object from another |
2934 | * node to the array cache on this cpu. | |
2935 | */ | |
2936 | #ifdef CONFIG_NUMA | |
2937 | { | |
2938 | struct slab *slabp; | |
6ed5eb22 | 2939 | slabp = virt_to_slab(objp); |
e498be7d CL |
2940 | if (unlikely(slabp->nodeid != numa_node_id())) { |
2941 | struct array_cache *alien = NULL; | |
2942 | int nodeid = slabp->nodeid; | |
b28a02de PE |
2943 | struct kmem_list3 *l3 = |
2944 | cachep->nodelists[numa_node_id()]; | |
e498be7d CL |
2945 | |
2946 | STATS_INC_NODEFREES(cachep); | |
2947 | if (l3->alien && l3->alien[nodeid]) { | |
2948 | alien = l3->alien[nodeid]; | |
2949 | spin_lock(&alien->lock); | |
2950 | if (unlikely(alien->avail == alien->limit)) | |
2951 | __drain_alien_cache(cachep, | |
b28a02de | 2952 | alien, nodeid); |
e498be7d CL |
2953 | alien->entry[alien->avail++] = objp; |
2954 | spin_unlock(&alien->lock); | |
2955 | } else { | |
2956 | spin_lock(&(cachep->nodelists[nodeid])-> | |
b28a02de | 2957 | list_lock); |
ff69416e | 2958 | free_block(cachep, &objp, 1, nodeid); |
e498be7d | 2959 | spin_unlock(&(cachep->nodelists[nodeid])-> |
b28a02de | 2960 | list_lock); |
e498be7d CL |
2961 | } |
2962 | return; | |
2963 | } | |
2964 | } | |
2965 | #endif | |
1da177e4 LT |
2966 | if (likely(ac->avail < ac->limit)) { |
2967 | STATS_INC_FREEHIT(cachep); | |
e498be7d | 2968 | ac->entry[ac->avail++] = objp; |
1da177e4 LT |
2969 | return; |
2970 | } else { | |
2971 | STATS_INC_FREEMISS(cachep); | |
2972 | cache_flusharray(cachep, ac); | |
e498be7d | 2973 | ac->entry[ac->avail++] = objp; |
1da177e4 LT |
2974 | } |
2975 | } | |
2976 | ||
2977 | /** | |
2978 | * kmem_cache_alloc - Allocate an object | |
2979 | * @cachep: The cache to allocate from. | |
2980 | * @flags: See kmalloc(). | |
2981 | * | |
2982 | * Allocate an object from this cache. The flags are only relevant | |
2983 | * if the cache has no available objects. | |
2984 | */ | |
343e0d7a | 2985 | void *kmem_cache_alloc(struct kmem_cache *cachep, gfp_t flags) |
1da177e4 | 2986 | { |
7fd6b141 | 2987 | return __cache_alloc(cachep, flags, __builtin_return_address(0)); |
1da177e4 LT |
2988 | } |
2989 | EXPORT_SYMBOL(kmem_cache_alloc); | |
2990 | ||
2991 | /** | |
2992 | * kmem_ptr_validate - check if an untrusted pointer might | |
2993 | * be a slab entry. | |
2994 | * @cachep: the cache we're checking against | |
2995 | * @ptr: pointer to validate | |
2996 | * | |
2997 | * This verifies that the untrusted pointer looks sane: | |
2998 | * it is _not_ a guarantee that the pointer is actually | |
2999 | * part of the slab cache in question, but it at least | |
3000 | * validates that the pointer can be dereferenced and | |
3001 | * looks half-way sane. | |
3002 | * | |
3003 | * Currently only used for dentry validation. | |
3004 | */ | |
343e0d7a | 3005 | int fastcall kmem_ptr_validate(struct kmem_cache *cachep, void *ptr) |
1da177e4 | 3006 | { |
b28a02de | 3007 | unsigned long addr = (unsigned long)ptr; |
1da177e4 | 3008 | unsigned long min_addr = PAGE_OFFSET; |
b28a02de | 3009 | unsigned long align_mask = BYTES_PER_WORD - 1; |
3dafccf2 | 3010 | unsigned long size = cachep->buffer_size; |
1da177e4 LT |
3011 | struct page *page; |
3012 | ||
3013 | if (unlikely(addr < min_addr)) | |
3014 | goto out; | |
3015 | if (unlikely(addr > (unsigned long)high_memory - size)) | |
3016 | goto out; | |
3017 | if (unlikely(addr & align_mask)) | |
3018 | goto out; | |
3019 | if (unlikely(!kern_addr_valid(addr))) | |
3020 | goto out; | |
3021 | if (unlikely(!kern_addr_valid(addr + size - 1))) | |
3022 | goto out; | |
3023 | page = virt_to_page(ptr); | |
3024 | if (unlikely(!PageSlab(page))) | |
3025 | goto out; | |
065d41cb | 3026 | if (unlikely(page_get_cache(page) != cachep)) |
1da177e4 LT |
3027 | goto out; |
3028 | return 1; | |
b28a02de | 3029 | out: |
1da177e4 LT |
3030 | return 0; |
3031 | } | |
3032 | ||
3033 | #ifdef CONFIG_NUMA | |
3034 | /** | |
3035 | * kmem_cache_alloc_node - Allocate an object on the specified node | |
3036 | * @cachep: The cache to allocate from. | |
3037 | * @flags: See kmalloc(). | |
3038 | * @nodeid: node number of the target node. | |
3039 | * | |
3040 | * Identical to kmem_cache_alloc, except that this function is slow | |
3041 | * and can sleep. And it will allocate memory on the given node, which | |
3042 | * can improve the performance for cpu bound structures. | |
e498be7d CL |
3043 | * New and improved: it will now make sure that the object gets |
3044 | * put on the correct node list so that there is no false sharing. | |
1da177e4 | 3045 | */ |
343e0d7a | 3046 | void *kmem_cache_alloc_node(struct kmem_cache *cachep, gfp_t flags, int nodeid) |
1da177e4 | 3047 | { |
e498be7d CL |
3048 | unsigned long save_flags; |
3049 | void *ptr; | |
1da177e4 | 3050 | |
e498be7d CL |
3051 | cache_alloc_debugcheck_before(cachep, flags); |
3052 | local_irq_save(save_flags); | |
18f820f6 CL |
3053 | |
3054 | if (nodeid == -1 || nodeid == numa_node_id() || | |
3055 | !cachep->nodelists[nodeid]) | |
5c382300 AK |
3056 | ptr = ____cache_alloc(cachep, flags); |
3057 | else | |
3058 | ptr = __cache_alloc_node(cachep, flags, nodeid); | |
e498be7d | 3059 | local_irq_restore(save_flags); |
18f820f6 CL |
3060 | |
3061 | ptr = cache_alloc_debugcheck_after(cachep, flags, ptr, | |
3062 | __builtin_return_address(0)); | |
1da177e4 | 3063 | |
e498be7d | 3064 | return ptr; |
1da177e4 LT |
3065 | } |
3066 | EXPORT_SYMBOL(kmem_cache_alloc_node); | |
3067 | ||
dd0fc66f | 3068 | void *kmalloc_node(size_t size, gfp_t flags, int node) |
97e2bde4 | 3069 | { |
343e0d7a | 3070 | struct kmem_cache *cachep; |
97e2bde4 MS |
3071 | |
3072 | cachep = kmem_find_general_cachep(size, flags); | |
3073 | if (unlikely(cachep == NULL)) | |
3074 | return NULL; | |
3075 | return kmem_cache_alloc_node(cachep, flags, node); | |
3076 | } | |
3077 | EXPORT_SYMBOL(kmalloc_node); | |
1da177e4 LT |
3078 | #endif |
3079 | ||
3080 | /** | |
3081 | * kmalloc - allocate memory | |
3082 | * @size: how many bytes of memory are required. | |
3083 | * @flags: the type of memory to allocate. | |
3084 | * | |
3085 | * kmalloc is the normal method of allocating memory | |
3086 | * in the kernel. | |
3087 | * | |
3088 | * The @flags argument may be one of: | |
3089 | * | |
3090 | * %GFP_USER - Allocate memory on behalf of user. May sleep. | |
3091 | * | |
3092 | * %GFP_KERNEL - Allocate normal kernel ram. May sleep. | |
3093 | * | |
3094 | * %GFP_ATOMIC - Allocation will not sleep. Use inside interrupt handlers. | |
3095 | * | |
3096 | * Additionally, the %GFP_DMA flag may be set to indicate the memory | |
3097 | * must be suitable for DMA. This can mean different things on different | |
3098 | * platforms. For example, on i386, it means that the memory must come | |
3099 | * from the first 16MB. | |
3100 | */ | |
7fd6b141 PE |
3101 | static __always_inline void *__do_kmalloc(size_t size, gfp_t flags, |
3102 | void *caller) | |
1da177e4 | 3103 | { |
343e0d7a | 3104 | struct kmem_cache *cachep; |
1da177e4 | 3105 | |
97e2bde4 MS |
3106 | /* If you want to save a few bytes .text space: replace |
3107 | * __ with kmem_. | |
3108 | * Then kmalloc uses the uninlined functions instead of the inline | |
3109 | * functions. | |
3110 | */ | |
3111 | cachep = __find_general_cachep(size, flags); | |
dbdb9045 AM |
3112 | if (unlikely(cachep == NULL)) |
3113 | return NULL; | |
7fd6b141 PE |
3114 | return __cache_alloc(cachep, flags, caller); |
3115 | } | |
3116 | ||
3117 | #ifndef CONFIG_DEBUG_SLAB | |
3118 | ||
3119 | void *__kmalloc(size_t size, gfp_t flags) | |
3120 | { | |
3121 | return __do_kmalloc(size, flags, NULL); | |
1da177e4 LT |
3122 | } |
3123 | EXPORT_SYMBOL(__kmalloc); | |
3124 | ||
7fd6b141 PE |
3125 | #else |
3126 | ||
3127 | void *__kmalloc_track_caller(size_t size, gfp_t flags, void *caller) | |
3128 | { | |
3129 | return __do_kmalloc(size, flags, caller); | |
3130 | } | |
3131 | EXPORT_SYMBOL(__kmalloc_track_caller); | |
3132 | ||
3133 | #endif | |
3134 | ||
1da177e4 LT |
3135 | #ifdef CONFIG_SMP |
3136 | /** | |
3137 | * __alloc_percpu - allocate one copy of the object for every present | |
3138 | * cpu in the system, zeroing them. | |
3139 | * Objects should be dereferenced using the per_cpu_ptr macro only. | |
3140 | * | |
3141 | * @size: how many bytes of memory are required. | |
1da177e4 | 3142 | */ |
f9f75005 | 3143 | void *__alloc_percpu(size_t size) |
1da177e4 LT |
3144 | { |
3145 | int i; | |
b28a02de | 3146 | struct percpu_data *pdata = kmalloc(sizeof(*pdata), GFP_KERNEL); |
1da177e4 LT |
3147 | |
3148 | if (!pdata) | |
3149 | return NULL; | |
3150 | ||
e498be7d CL |
3151 | /* |
3152 | * Cannot use for_each_online_cpu since a cpu may come online | |
3153 | * and we have no way of figuring out how to fix the array | |
3154 | * that we have allocated then.... | |
3155 | */ | |
3156 | for_each_cpu(i) { | |
3157 | int node = cpu_to_node(i); | |
3158 | ||
3159 | if (node_online(node)) | |
3160 | pdata->ptrs[i] = kmalloc_node(size, GFP_KERNEL, node); | |
3161 | else | |
3162 | pdata->ptrs[i] = kmalloc(size, GFP_KERNEL); | |
1da177e4 LT |
3163 | |
3164 | if (!pdata->ptrs[i]) | |
3165 | goto unwind_oom; | |
3166 | memset(pdata->ptrs[i], 0, size); | |
3167 | } | |
3168 | ||
3169 | /* Catch derefs w/o wrappers */ | |
b28a02de | 3170 | return (void *)(~(unsigned long)pdata); |
1da177e4 | 3171 | |
b28a02de | 3172 | unwind_oom: |
1da177e4 LT |
3173 | while (--i >= 0) { |
3174 | if (!cpu_possible(i)) | |
3175 | continue; | |
3176 | kfree(pdata->ptrs[i]); | |
3177 | } | |
3178 | kfree(pdata); | |
3179 | return NULL; | |
3180 | } | |
3181 | EXPORT_SYMBOL(__alloc_percpu); | |
3182 | #endif | |
3183 | ||
3184 | /** | |
3185 | * kmem_cache_free - Deallocate an object | |
3186 | * @cachep: The cache the allocation was from. | |
3187 | * @objp: The previously allocated object. | |
3188 | * | |
3189 | * Free an object which was previously allocated from this | |
3190 | * cache. | |
3191 | */ | |
343e0d7a | 3192 | void kmem_cache_free(struct kmem_cache *cachep, void *objp) |
1da177e4 LT |
3193 | { |
3194 | unsigned long flags; | |
3195 | ||
3196 | local_irq_save(flags); | |
3197 | __cache_free(cachep, objp); | |
3198 | local_irq_restore(flags); | |
3199 | } | |
3200 | EXPORT_SYMBOL(kmem_cache_free); | |
3201 | ||
1da177e4 LT |
3202 | /** |
3203 | * kfree - free previously allocated memory | |
3204 | * @objp: pointer returned by kmalloc. | |
3205 | * | |
80e93eff PE |
3206 | * If @objp is NULL, no operation is performed. |
3207 | * | |
1da177e4 LT |
3208 | * Don't free memory not originally allocated by kmalloc() |
3209 | * or you will run into trouble. | |
3210 | */ | |
3211 | void kfree(const void *objp) | |
3212 | { | |
343e0d7a | 3213 | struct kmem_cache *c; |
1da177e4 LT |
3214 | unsigned long flags; |
3215 | ||
3216 | if (unlikely(!objp)) | |
3217 | return; | |
3218 | local_irq_save(flags); | |
3219 | kfree_debugcheck(objp); | |
6ed5eb22 | 3220 | c = virt_to_cache(objp); |
3dafccf2 | 3221 | mutex_debug_check_no_locks_freed(objp, obj_size(c)); |
b28a02de | 3222 | __cache_free(c, (void *)objp); |
1da177e4 LT |
3223 | local_irq_restore(flags); |
3224 | } | |
3225 | EXPORT_SYMBOL(kfree); | |
3226 | ||
3227 | #ifdef CONFIG_SMP | |
3228 | /** | |
3229 | * free_percpu - free previously allocated percpu memory | |
3230 | * @objp: pointer returned by alloc_percpu. | |
3231 | * | |
3232 | * Don't free memory not originally allocated by alloc_percpu() | |
3233 | * The complemented objp is to check for that. | |
3234 | */ | |
b28a02de | 3235 | void free_percpu(const void *objp) |
1da177e4 LT |
3236 | { |
3237 | int i; | |
b28a02de | 3238 | struct percpu_data *p = (struct percpu_data *)(~(unsigned long)objp); |
1da177e4 | 3239 | |
e498be7d CL |
3240 | /* |
3241 | * We allocate for all cpus so we cannot use for online cpu here. | |
3242 | */ | |
3243 | for_each_cpu(i) | |
b28a02de | 3244 | kfree(p->ptrs[i]); |
1da177e4 LT |
3245 | kfree(p); |
3246 | } | |
3247 | EXPORT_SYMBOL(free_percpu); | |
3248 | #endif | |
3249 | ||
343e0d7a | 3250 | unsigned int kmem_cache_size(struct kmem_cache *cachep) |
1da177e4 | 3251 | { |
3dafccf2 | 3252 | return obj_size(cachep); |
1da177e4 LT |
3253 | } |
3254 | EXPORT_SYMBOL(kmem_cache_size); | |
3255 | ||
343e0d7a | 3256 | const char *kmem_cache_name(struct kmem_cache *cachep) |
1944972d ACM |
3257 | { |
3258 | return cachep->name; | |
3259 | } | |
3260 | EXPORT_SYMBOL_GPL(kmem_cache_name); | |
3261 | ||
e498be7d CL |
3262 | /* |
3263 | * This initializes kmem_list3 for all nodes. | |
3264 | */ | |
343e0d7a | 3265 | static int alloc_kmemlist(struct kmem_cache *cachep) |
e498be7d CL |
3266 | { |
3267 | int node; | |
3268 | struct kmem_list3 *l3; | |
3269 | int err = 0; | |
3270 | ||
3271 | for_each_online_node(node) { | |
3272 | struct array_cache *nc = NULL, *new; | |
3273 | struct array_cache **new_alien = NULL; | |
3274 | #ifdef CONFIG_NUMA | |
3275 | if (!(new_alien = alloc_alien_cache(node, cachep->limit))) | |
3276 | goto fail; | |
3277 | #endif | |
b28a02de PE |
3278 | if (!(new = alloc_arraycache(node, (cachep->shared * |
3279 | cachep->batchcount), | |
3280 | 0xbaadf00d))) | |
e498be7d CL |
3281 | goto fail; |
3282 | if ((l3 = cachep->nodelists[node])) { | |
3283 | ||
3284 | spin_lock_irq(&l3->list_lock); | |
3285 | ||
3286 | if ((nc = cachep->nodelists[node]->shared)) | |
b28a02de | 3287 | free_block(cachep, nc->entry, nc->avail, node); |
e498be7d CL |
3288 | |
3289 | l3->shared = new; | |
3290 | if (!cachep->nodelists[node]->alien) { | |
3291 | l3->alien = new_alien; | |
3292 | new_alien = NULL; | |
3293 | } | |
b28a02de PE |
3294 | l3->free_limit = (1 + nr_cpus_node(node)) * |
3295 | cachep->batchcount + cachep->num; | |
e498be7d CL |
3296 | spin_unlock_irq(&l3->list_lock); |
3297 | kfree(nc); | |
3298 | free_alien_cache(new_alien); | |
3299 | continue; | |
3300 | } | |
3301 | if (!(l3 = kmalloc_node(sizeof(struct kmem_list3), | |
b28a02de | 3302 | GFP_KERNEL, node))) |
e498be7d CL |
3303 | goto fail; |
3304 | ||
3305 | kmem_list3_init(l3); | |
3306 | l3->next_reap = jiffies + REAPTIMEOUT_LIST3 + | |
b28a02de | 3307 | ((unsigned long)cachep) % REAPTIMEOUT_LIST3; |
e498be7d CL |
3308 | l3->shared = new; |
3309 | l3->alien = new_alien; | |
b28a02de PE |
3310 | l3->free_limit = (1 + nr_cpus_node(node)) * |
3311 | cachep->batchcount + cachep->num; | |
e498be7d CL |
3312 | cachep->nodelists[node] = l3; |
3313 | } | |
3314 | return err; | |
b28a02de | 3315 | fail: |
e498be7d CL |
3316 | err = -ENOMEM; |
3317 | return err; | |
3318 | } | |
3319 | ||
1da177e4 | 3320 | struct ccupdate_struct { |
343e0d7a | 3321 | struct kmem_cache *cachep; |
1da177e4 LT |
3322 | struct array_cache *new[NR_CPUS]; |
3323 | }; | |
3324 | ||
3325 | static void do_ccupdate_local(void *info) | |
3326 | { | |
3327 | struct ccupdate_struct *new = (struct ccupdate_struct *)info; | |
3328 | struct array_cache *old; | |
3329 | ||
3330 | check_irq_off(); | |
9a2dba4b | 3331 | old = cpu_cache_get(new->cachep); |
e498be7d | 3332 | |
1da177e4 LT |
3333 | new->cachep->array[smp_processor_id()] = new->new[smp_processor_id()]; |
3334 | new->new[smp_processor_id()] = old; | |
3335 | } | |
3336 | ||
343e0d7a | 3337 | static int do_tune_cpucache(struct kmem_cache *cachep, int limit, int batchcount, |
b28a02de | 3338 | int shared) |
1da177e4 LT |
3339 | { |
3340 | struct ccupdate_struct new; | |
e498be7d | 3341 | int i, err; |
1da177e4 | 3342 | |
b28a02de | 3343 | memset(&new.new, 0, sizeof(new.new)); |
e498be7d | 3344 | for_each_online_cpu(i) { |
b28a02de PE |
3345 | new.new[i] = |
3346 | alloc_arraycache(cpu_to_node(i), limit, batchcount); | |
e498be7d | 3347 | if (!new.new[i]) { |
b28a02de PE |
3348 | for (i--; i >= 0; i--) |
3349 | kfree(new.new[i]); | |
e498be7d | 3350 | return -ENOMEM; |
1da177e4 LT |
3351 | } |
3352 | } | |
3353 | new.cachep = cachep; | |
3354 | ||
3355 | smp_call_function_all_cpus(do_ccupdate_local, (void *)&new); | |
e498be7d | 3356 | |
1da177e4 | 3357 | check_irq_on(); |
ca3b9b91 | 3358 | spin_lock(&cachep->spinlock); |
1da177e4 LT |
3359 | cachep->batchcount = batchcount; |
3360 | cachep->limit = limit; | |
e498be7d | 3361 | cachep->shared = shared; |
ca3b9b91 | 3362 | spin_unlock(&cachep->spinlock); |
1da177e4 | 3363 | |
e498be7d | 3364 | for_each_online_cpu(i) { |
1da177e4 LT |
3365 | struct array_cache *ccold = new.new[i]; |
3366 | if (!ccold) | |
3367 | continue; | |
e498be7d | 3368 | spin_lock_irq(&cachep->nodelists[cpu_to_node(i)]->list_lock); |
ff69416e | 3369 | free_block(cachep, ccold->entry, ccold->avail, cpu_to_node(i)); |
e498be7d | 3370 | spin_unlock_irq(&cachep->nodelists[cpu_to_node(i)]->list_lock); |
1da177e4 LT |
3371 | kfree(ccold); |
3372 | } | |
1da177e4 | 3373 | |
e498be7d CL |
3374 | err = alloc_kmemlist(cachep); |
3375 | if (err) { | |
3376 | printk(KERN_ERR "alloc_kmemlist failed for %s, error %d.\n", | |
b28a02de | 3377 | cachep->name, -err); |
e498be7d | 3378 | BUG(); |
1da177e4 | 3379 | } |
1da177e4 LT |
3380 | return 0; |
3381 | } | |
3382 | ||
343e0d7a | 3383 | static void enable_cpucache(struct kmem_cache *cachep) |
1da177e4 LT |
3384 | { |
3385 | int err; | |
3386 | int limit, shared; | |
3387 | ||
3388 | /* The head array serves three purposes: | |
3389 | * - create a LIFO ordering, i.e. return objects that are cache-warm | |
3390 | * - reduce the number of spinlock operations. | |
3391 | * - reduce the number of linked list operations on the slab and | |
3392 | * bufctl chains: array operations are cheaper. | |
3393 | * The numbers are guessed, we should auto-tune as described by | |
3394 | * Bonwick. | |
3395 | */ | |
3dafccf2 | 3396 | if (cachep->buffer_size > 131072) |
1da177e4 | 3397 | limit = 1; |
3dafccf2 | 3398 | else if (cachep->buffer_size > PAGE_SIZE) |
1da177e4 | 3399 | limit = 8; |
3dafccf2 | 3400 | else if (cachep->buffer_size > 1024) |
1da177e4 | 3401 | limit = 24; |
3dafccf2 | 3402 | else if (cachep->buffer_size > 256) |
1da177e4 LT |
3403 | limit = 54; |
3404 | else | |
3405 | limit = 120; | |
3406 | ||
3407 | /* Cpu bound tasks (e.g. network routing) can exhibit cpu bound | |
3408 | * allocation behaviour: Most allocs on one cpu, most free operations | |
3409 | * on another cpu. For these cases, an efficient object passing between | |
3410 | * cpus is necessary. This is provided by a shared array. The array | |
3411 | * replaces Bonwick's magazine layer. | |
3412 | * On uniprocessor, it's functionally equivalent (but less efficient) | |
3413 | * to a larger limit. Thus disabled by default. | |
3414 | */ | |
3415 | shared = 0; | |
3416 | #ifdef CONFIG_SMP | |
3dafccf2 | 3417 | if (cachep->buffer_size <= PAGE_SIZE) |
1da177e4 LT |
3418 | shared = 8; |
3419 | #endif | |
3420 | ||
3421 | #if DEBUG | |
3422 | /* With debugging enabled, large batchcount lead to excessively | |
3423 | * long periods with disabled local interrupts. Limit the | |
3424 | * batchcount | |
3425 | */ | |
3426 | if (limit > 32) | |
3427 | limit = 32; | |
3428 | #endif | |
b28a02de | 3429 | err = do_tune_cpucache(cachep, limit, (limit + 1) / 2, shared); |
1da177e4 LT |
3430 | if (err) |
3431 | printk(KERN_ERR "enable_cpucache failed for %s, error %d.\n", | |
b28a02de | 3432 | cachep->name, -err); |
1da177e4 LT |
3433 | } |
3434 | ||
343e0d7a | 3435 | static void drain_array_locked(struct kmem_cache *cachep, struct array_cache *ac, |
b28a02de | 3436 | int force, int node) |
1da177e4 LT |
3437 | { |
3438 | int tofree; | |
3439 | ||
e498be7d | 3440 | check_spinlock_acquired_node(cachep, node); |
1da177e4 LT |
3441 | if (ac->touched && !force) { |
3442 | ac->touched = 0; | |
3443 | } else if (ac->avail) { | |
b28a02de | 3444 | tofree = force ? ac->avail : (ac->limit + 4) / 5; |
1da177e4 | 3445 | if (tofree > ac->avail) { |
b28a02de | 3446 | tofree = (ac->avail + 1) / 2; |
1da177e4 | 3447 | } |
ff69416e | 3448 | free_block(cachep, ac->entry, tofree, node); |
1da177e4 | 3449 | ac->avail -= tofree; |
e498be7d | 3450 | memmove(ac->entry, &(ac->entry[tofree]), |
b28a02de | 3451 | sizeof(void *) * ac->avail); |
1da177e4 LT |
3452 | } |
3453 | } | |
3454 | ||
3455 | /** | |
3456 | * cache_reap - Reclaim memory from caches. | |
1e5d5331 | 3457 | * @unused: unused parameter |
1da177e4 LT |
3458 | * |
3459 | * Called from workqueue/eventd every few seconds. | |
3460 | * Purpose: | |
3461 | * - clear the per-cpu caches for this CPU. | |
3462 | * - return freeable pages to the main free memory pool. | |
3463 | * | |
fc0abb14 | 3464 | * If we cannot acquire the cache chain mutex then just give up - we'll |
1da177e4 LT |
3465 | * try again on the next iteration. |
3466 | */ | |
3467 | static void cache_reap(void *unused) | |
3468 | { | |
3469 | struct list_head *walk; | |
e498be7d | 3470 | struct kmem_list3 *l3; |
1da177e4 | 3471 | |
fc0abb14 | 3472 | if (!mutex_trylock(&cache_chain_mutex)) { |
1da177e4 | 3473 | /* Give up. Setup the next iteration. */ |
b28a02de PE |
3474 | schedule_delayed_work(&__get_cpu_var(reap_work), |
3475 | REAPTIMEOUT_CPUC); | |
1da177e4 LT |
3476 | return; |
3477 | } | |
3478 | ||
3479 | list_for_each(walk, &cache_chain) { | |
343e0d7a | 3480 | struct kmem_cache *searchp; |
b28a02de | 3481 | struct list_head *p; |
1da177e4 LT |
3482 | int tofree; |
3483 | struct slab *slabp; | |
3484 | ||
343e0d7a | 3485 | searchp = list_entry(walk, struct kmem_cache, next); |
1da177e4 LT |
3486 | |
3487 | if (searchp->flags & SLAB_NO_REAP) | |
3488 | goto next; | |
3489 | ||
3490 | check_irq_on(); | |
3491 | ||
e498be7d CL |
3492 | l3 = searchp->nodelists[numa_node_id()]; |
3493 | if (l3->alien) | |
4484ebf1 | 3494 | drain_alien_cache(searchp, l3->alien); |
e498be7d | 3495 | spin_lock_irq(&l3->list_lock); |
1da177e4 | 3496 | |
9a2dba4b | 3497 | drain_array_locked(searchp, cpu_cache_get(searchp), 0, |
b28a02de | 3498 | numa_node_id()); |
1da177e4 | 3499 | |
e498be7d | 3500 | if (time_after(l3->next_reap, jiffies)) |
1da177e4 LT |
3501 | goto next_unlock; |
3502 | ||
e498be7d | 3503 | l3->next_reap = jiffies + REAPTIMEOUT_LIST3; |
1da177e4 | 3504 | |
e498be7d CL |
3505 | if (l3->shared) |
3506 | drain_array_locked(searchp, l3->shared, 0, | |
b28a02de | 3507 | numa_node_id()); |
1da177e4 | 3508 | |
e498be7d CL |
3509 | if (l3->free_touched) { |
3510 | l3->free_touched = 0; | |
1da177e4 LT |
3511 | goto next_unlock; |
3512 | } | |
3513 | ||
b28a02de PE |
3514 | tofree = |
3515 | (l3->free_limit + 5 * searchp->num - | |
3516 | 1) / (5 * searchp->num); | |
1da177e4 | 3517 | do { |
e498be7d CL |
3518 | p = l3->slabs_free.next; |
3519 | if (p == &(l3->slabs_free)) | |
1da177e4 LT |
3520 | break; |
3521 | ||
3522 | slabp = list_entry(p, struct slab, list); | |
3523 | BUG_ON(slabp->inuse); | |
3524 | list_del(&slabp->list); | |
3525 | STATS_INC_REAPED(searchp); | |
3526 | ||
3527 | /* Safe to drop the lock. The slab is no longer | |
3528 | * linked to the cache. | |
3529 | * searchp cannot disappear, we hold | |
3530 | * cache_chain_lock | |
3531 | */ | |
e498be7d CL |
3532 | l3->free_objects -= searchp->num; |
3533 | spin_unlock_irq(&l3->list_lock); | |
1da177e4 | 3534 | slab_destroy(searchp, slabp); |
e498be7d | 3535 | spin_lock_irq(&l3->list_lock); |
b28a02de PE |
3536 | } while (--tofree > 0); |
3537 | next_unlock: | |
e498be7d | 3538 | spin_unlock_irq(&l3->list_lock); |
b28a02de | 3539 | next: |
1da177e4 LT |
3540 | cond_resched(); |
3541 | } | |
3542 | check_irq_on(); | |
fc0abb14 | 3543 | mutex_unlock(&cache_chain_mutex); |
4ae7c039 | 3544 | drain_remote_pages(); |
1da177e4 | 3545 | /* Setup the next iteration */ |
cd61ef62 | 3546 | schedule_delayed_work(&__get_cpu_var(reap_work), REAPTIMEOUT_CPUC); |
1da177e4 LT |
3547 | } |
3548 | ||
3549 | #ifdef CONFIG_PROC_FS | |
3550 | ||
85289f98 | 3551 | static void print_slabinfo_header(struct seq_file *m) |
1da177e4 | 3552 | { |
85289f98 PE |
3553 | /* |
3554 | * Output format version, so at least we can change it | |
3555 | * without _too_ many complaints. | |
3556 | */ | |
1da177e4 | 3557 | #if STATS |
85289f98 | 3558 | seq_puts(m, "slabinfo - version: 2.1 (statistics)\n"); |
1da177e4 | 3559 | #else |
85289f98 | 3560 | seq_puts(m, "slabinfo - version: 2.1\n"); |
1da177e4 | 3561 | #endif |
85289f98 PE |
3562 | seq_puts(m, "# name <active_objs> <num_objs> <objsize> " |
3563 | "<objperslab> <pagesperslab>"); | |
3564 | seq_puts(m, " : tunables <limit> <batchcount> <sharedfactor>"); | |
3565 | seq_puts(m, " : slabdata <active_slabs> <num_slabs> <sharedavail>"); | |
1da177e4 | 3566 | #if STATS |
85289f98 PE |
3567 | seq_puts(m, " : globalstat <listallocs> <maxobjs> <grown> <reaped> " |
3568 | "<error> <maxfreeable> <nodeallocs> <remotefrees>"); | |
3569 | seq_puts(m, " : cpustat <allochit> <allocmiss> <freehit> <freemiss>"); | |
1da177e4 | 3570 | #endif |
85289f98 PE |
3571 | seq_putc(m, '\n'); |
3572 | } | |
3573 | ||
3574 | static void *s_start(struct seq_file *m, loff_t *pos) | |
3575 | { | |
3576 | loff_t n = *pos; | |
3577 | struct list_head *p; | |
3578 | ||
fc0abb14 | 3579 | mutex_lock(&cache_chain_mutex); |
85289f98 PE |
3580 | if (!n) |
3581 | print_slabinfo_header(m); | |
1da177e4 LT |
3582 | p = cache_chain.next; |
3583 | while (n--) { | |
3584 | p = p->next; | |
3585 | if (p == &cache_chain) | |
3586 | return NULL; | |
3587 | } | |
343e0d7a | 3588 | return list_entry(p, struct kmem_cache, next); |
1da177e4 LT |
3589 | } |
3590 | ||
3591 | static void *s_next(struct seq_file *m, void *p, loff_t *pos) | |
3592 | { | |
343e0d7a | 3593 | struct kmem_cache *cachep = p; |
1da177e4 LT |
3594 | ++*pos; |
3595 | return cachep->next.next == &cache_chain ? NULL | |
343e0d7a | 3596 | : list_entry(cachep->next.next, struct kmem_cache, next); |
1da177e4 LT |
3597 | } |
3598 | ||
3599 | static void s_stop(struct seq_file *m, void *p) | |
3600 | { | |
fc0abb14 | 3601 | mutex_unlock(&cache_chain_mutex); |
1da177e4 LT |
3602 | } |
3603 | ||
3604 | static int s_show(struct seq_file *m, void *p) | |
3605 | { | |
343e0d7a | 3606 | struct kmem_cache *cachep = p; |
1da177e4 | 3607 | struct list_head *q; |
b28a02de PE |
3608 | struct slab *slabp; |
3609 | unsigned long active_objs; | |
3610 | unsigned long num_objs; | |
3611 | unsigned long active_slabs = 0; | |
3612 | unsigned long num_slabs, free_objects = 0, shared_avail = 0; | |
e498be7d | 3613 | const char *name; |
1da177e4 | 3614 | char *error = NULL; |
e498be7d CL |
3615 | int node; |
3616 | struct kmem_list3 *l3; | |
1da177e4 | 3617 | |
ca3b9b91 | 3618 | spin_lock(&cachep->spinlock); |
1da177e4 LT |
3619 | active_objs = 0; |
3620 | num_slabs = 0; | |
e498be7d CL |
3621 | for_each_online_node(node) { |
3622 | l3 = cachep->nodelists[node]; | |
3623 | if (!l3) | |
3624 | continue; | |
3625 | ||
ca3b9b91 RT |
3626 | check_irq_on(); |
3627 | spin_lock_irq(&l3->list_lock); | |
e498be7d | 3628 | |
b28a02de | 3629 | list_for_each(q, &l3->slabs_full) { |
e498be7d CL |
3630 | slabp = list_entry(q, struct slab, list); |
3631 | if (slabp->inuse != cachep->num && !error) | |
3632 | error = "slabs_full accounting error"; | |
3633 | active_objs += cachep->num; | |
3634 | active_slabs++; | |
3635 | } | |
b28a02de | 3636 | list_for_each(q, &l3->slabs_partial) { |
e498be7d CL |
3637 | slabp = list_entry(q, struct slab, list); |
3638 | if (slabp->inuse == cachep->num && !error) | |
3639 | error = "slabs_partial inuse accounting error"; | |
3640 | if (!slabp->inuse && !error) | |
3641 | error = "slabs_partial/inuse accounting error"; | |
3642 | active_objs += slabp->inuse; | |
3643 | active_slabs++; | |
3644 | } | |
b28a02de | 3645 | list_for_each(q, &l3->slabs_free) { |
e498be7d CL |
3646 | slabp = list_entry(q, struct slab, list); |
3647 | if (slabp->inuse && !error) | |
3648 | error = "slabs_free/inuse accounting error"; | |
3649 | num_slabs++; | |
3650 | } | |
3651 | free_objects += l3->free_objects; | |
4484ebf1 RT |
3652 | if (l3->shared) |
3653 | shared_avail += l3->shared->avail; | |
e498be7d | 3654 | |
ca3b9b91 | 3655 | spin_unlock_irq(&l3->list_lock); |
1da177e4 | 3656 | } |
b28a02de PE |
3657 | num_slabs += active_slabs; |
3658 | num_objs = num_slabs * cachep->num; | |
e498be7d | 3659 | if (num_objs - active_objs != free_objects && !error) |
1da177e4 LT |
3660 | error = "free_objects accounting error"; |
3661 | ||
b28a02de | 3662 | name = cachep->name; |
1da177e4 LT |
3663 | if (error) |
3664 | printk(KERN_ERR "slab: cache %s error: %s\n", name, error); | |
3665 | ||
3666 | seq_printf(m, "%-17s %6lu %6lu %6u %4u %4d", | |
3dafccf2 | 3667 | name, active_objs, num_objs, cachep->buffer_size, |
b28a02de | 3668 | cachep->num, (1 << cachep->gfporder)); |
1da177e4 | 3669 | seq_printf(m, " : tunables %4u %4u %4u", |
b28a02de | 3670 | cachep->limit, cachep->batchcount, cachep->shared); |
e498be7d | 3671 | seq_printf(m, " : slabdata %6lu %6lu %6lu", |
b28a02de | 3672 | active_slabs, num_slabs, shared_avail); |
1da177e4 | 3673 | #if STATS |
b28a02de | 3674 | { /* list3 stats */ |
1da177e4 LT |
3675 | unsigned long high = cachep->high_mark; |
3676 | unsigned long allocs = cachep->num_allocations; | |
3677 | unsigned long grown = cachep->grown; | |
3678 | unsigned long reaped = cachep->reaped; | |
3679 | unsigned long errors = cachep->errors; | |
3680 | unsigned long max_freeable = cachep->max_freeable; | |
1da177e4 | 3681 | unsigned long node_allocs = cachep->node_allocs; |
e498be7d | 3682 | unsigned long node_frees = cachep->node_frees; |
1da177e4 | 3683 | |
e498be7d | 3684 | seq_printf(m, " : globalstat %7lu %6lu %5lu %4lu \ |
b28a02de | 3685 | %4lu %4lu %4lu %4lu", allocs, high, grown, reaped, errors, max_freeable, node_allocs, node_frees); |
1da177e4 LT |
3686 | } |
3687 | /* cpu stats */ | |
3688 | { | |
3689 | unsigned long allochit = atomic_read(&cachep->allochit); | |
3690 | unsigned long allocmiss = atomic_read(&cachep->allocmiss); | |
3691 | unsigned long freehit = atomic_read(&cachep->freehit); | |
3692 | unsigned long freemiss = atomic_read(&cachep->freemiss); | |
3693 | ||
3694 | seq_printf(m, " : cpustat %6lu %6lu %6lu %6lu", | |
b28a02de | 3695 | allochit, allocmiss, freehit, freemiss); |
1da177e4 LT |
3696 | } |
3697 | #endif | |
3698 | seq_putc(m, '\n'); | |
ca3b9b91 | 3699 | spin_unlock(&cachep->spinlock); |
1da177e4 LT |
3700 | return 0; |
3701 | } | |
3702 | ||
3703 | /* | |
3704 | * slabinfo_op - iterator that generates /proc/slabinfo | |
3705 | * | |
3706 | * Output layout: | |
3707 | * cache-name | |
3708 | * num-active-objs | |
3709 | * total-objs | |
3710 | * object size | |
3711 | * num-active-slabs | |
3712 | * total-slabs | |
3713 | * num-pages-per-slab | |
3714 | * + further values on SMP and with statistics enabled | |
3715 | */ | |
3716 | ||
3717 | struct seq_operations slabinfo_op = { | |
b28a02de PE |
3718 | .start = s_start, |
3719 | .next = s_next, | |
3720 | .stop = s_stop, | |
3721 | .show = s_show, | |
1da177e4 LT |
3722 | }; |
3723 | ||
3724 | #define MAX_SLABINFO_WRITE 128 | |
3725 | /** | |
3726 | * slabinfo_write - Tuning for the slab allocator | |
3727 | * @file: unused | |
3728 | * @buffer: user buffer | |
3729 | * @count: data length | |
3730 | * @ppos: unused | |
3731 | */ | |
b28a02de PE |
3732 | ssize_t slabinfo_write(struct file *file, const char __user * buffer, |
3733 | size_t count, loff_t *ppos) | |
1da177e4 | 3734 | { |
b28a02de | 3735 | char kbuf[MAX_SLABINFO_WRITE + 1], *tmp; |
1da177e4 LT |
3736 | int limit, batchcount, shared, res; |
3737 | struct list_head *p; | |
b28a02de | 3738 | |
1da177e4 LT |
3739 | if (count > MAX_SLABINFO_WRITE) |
3740 | return -EINVAL; | |
3741 | if (copy_from_user(&kbuf, buffer, count)) | |
3742 | return -EFAULT; | |
b28a02de | 3743 | kbuf[MAX_SLABINFO_WRITE] = '\0'; |
1da177e4 LT |
3744 | |
3745 | tmp = strchr(kbuf, ' '); | |
3746 | if (!tmp) | |
3747 | return -EINVAL; | |
3748 | *tmp = '\0'; | |
3749 | tmp++; | |
3750 | if (sscanf(tmp, " %d %d %d", &limit, &batchcount, &shared) != 3) | |
3751 | return -EINVAL; | |
3752 | ||
3753 | /* Find the cache in the chain of caches. */ | |
fc0abb14 | 3754 | mutex_lock(&cache_chain_mutex); |
1da177e4 | 3755 | res = -EINVAL; |
b28a02de | 3756 | list_for_each(p, &cache_chain) { |
343e0d7a PE |
3757 | struct kmem_cache *cachep = list_entry(p, struct kmem_cache, |
3758 | next); | |
1da177e4 LT |
3759 | |
3760 | if (!strcmp(cachep->name, kbuf)) { | |
3761 | if (limit < 1 || | |
3762 | batchcount < 1 || | |
b28a02de | 3763 | batchcount > limit || shared < 0) { |
e498be7d | 3764 | res = 0; |
1da177e4 | 3765 | } else { |
e498be7d | 3766 | res = do_tune_cpucache(cachep, limit, |
b28a02de | 3767 | batchcount, shared); |
1da177e4 LT |
3768 | } |
3769 | break; | |
3770 | } | |
3771 | } | |
fc0abb14 | 3772 | mutex_unlock(&cache_chain_mutex); |
1da177e4 LT |
3773 | if (res >= 0) |
3774 | res = count; | |
3775 | return res; | |
3776 | } | |
3777 | #endif | |
3778 | ||
00e145b6 MS |
3779 | /** |
3780 | * ksize - get the actual amount of memory allocated for a given object | |
3781 | * @objp: Pointer to the object | |
3782 | * | |
3783 | * kmalloc may internally round up allocations and return more memory | |
3784 | * than requested. ksize() can be used to determine the actual amount of | |
3785 | * memory allocated. The caller may use this additional memory, even though | |
3786 | * a smaller amount of memory was initially specified with the kmalloc call. | |
3787 | * The caller must guarantee that objp points to a valid object previously | |
3788 | * allocated with either kmalloc() or kmem_cache_alloc(). The object | |
3789 | * must not be freed during the duration of the call. | |
3790 | */ | |
1da177e4 LT |
3791 | unsigned int ksize(const void *objp) |
3792 | { | |
00e145b6 MS |
3793 | if (unlikely(objp == NULL)) |
3794 | return 0; | |
1da177e4 | 3795 | |
6ed5eb22 | 3796 | return obj_size(virt_to_cache(objp)); |
1da177e4 | 3797 | } |