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