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