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 | |
183ff22b | 29 | * slabs and you must pass objects with the same initializations to |
1da177e4 LT |
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 | |
18004c5d | 71 | * The global cache-chain is protected by the mutex 'slab_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 | ||
1da177e4 LT |
89 | #include <linux/slab.h> |
90 | #include <linux/mm.h> | |
c9cf5528 | 91 | #include <linux/poison.h> |
1da177e4 LT |
92 | #include <linux/swap.h> |
93 | #include <linux/cache.h> | |
94 | #include <linux/interrupt.h> | |
95 | #include <linux/init.h> | |
96 | #include <linux/compiler.h> | |
101a5001 | 97 | #include <linux/cpuset.h> |
a0ec95a8 | 98 | #include <linux/proc_fs.h> |
1da177e4 LT |
99 | #include <linux/seq_file.h> |
100 | #include <linux/notifier.h> | |
101 | #include <linux/kallsyms.h> | |
102 | #include <linux/cpu.h> | |
103 | #include <linux/sysctl.h> | |
104 | #include <linux/module.h> | |
105 | #include <linux/rcupdate.h> | |
543537bd | 106 | #include <linux/string.h> |
138ae663 | 107 | #include <linux/uaccess.h> |
e498be7d | 108 | #include <linux/nodemask.h> |
d5cff635 | 109 | #include <linux/kmemleak.h> |
dc85da15 | 110 | #include <linux/mempolicy.h> |
fc0abb14 | 111 | #include <linux/mutex.h> |
8a8b6502 | 112 | #include <linux/fault-inject.h> |
e7eebaf6 | 113 | #include <linux/rtmutex.h> |
6a2d7a95 | 114 | #include <linux/reciprocal_div.h> |
3ac7fe5a | 115 | #include <linux/debugobjects.h> |
c175eea4 | 116 | #include <linux/kmemcheck.h> |
8f9f8d9e | 117 | #include <linux/memory.h> |
268bb0ce | 118 | #include <linux/prefetch.h> |
1da177e4 | 119 | |
381760ea MG |
120 | #include <net/sock.h> |
121 | ||
1da177e4 LT |
122 | #include <asm/cacheflush.h> |
123 | #include <asm/tlbflush.h> | |
124 | #include <asm/page.h> | |
125 | ||
4dee6b64 SR |
126 | #include <trace/events/kmem.h> |
127 | ||
072bb0aa MG |
128 | #include "internal.h" |
129 | ||
b9ce5ef4 GC |
130 | #include "slab.h" |
131 | ||
1da177e4 | 132 | /* |
50953fe9 | 133 | * DEBUG - 1 for kmem_cache_create() to honour; SLAB_RED_ZONE & SLAB_POISON. |
1da177e4 LT |
134 | * 0 for faster, smaller code (especially in the critical paths). |
135 | * | |
136 | * STATS - 1 to collect stats for /proc/slabinfo. | |
137 | * 0 for faster, smaller code (especially in the critical paths). | |
138 | * | |
139 | * FORCED_DEBUG - 1 enables SLAB_RED_ZONE and SLAB_POISON (if possible) | |
140 | */ | |
141 | ||
142 | #ifdef CONFIG_DEBUG_SLAB | |
143 | #define DEBUG 1 | |
144 | #define STATS 1 | |
145 | #define FORCED_DEBUG 1 | |
146 | #else | |
147 | #define DEBUG 0 | |
148 | #define STATS 0 | |
149 | #define FORCED_DEBUG 0 | |
150 | #endif | |
151 | ||
1da177e4 LT |
152 | /* Shouldn't this be in a header file somewhere? */ |
153 | #define BYTES_PER_WORD sizeof(void *) | |
87a927c7 | 154 | #define REDZONE_ALIGN max(BYTES_PER_WORD, __alignof__(unsigned long long)) |
1da177e4 | 155 | |
1da177e4 LT |
156 | #ifndef ARCH_KMALLOC_FLAGS |
157 | #define ARCH_KMALLOC_FLAGS SLAB_HWCACHE_ALIGN | |
158 | #endif | |
159 | ||
072bb0aa MG |
160 | /* |
161 | * true if a page was allocated from pfmemalloc reserves for network-based | |
162 | * swap | |
163 | */ | |
164 | static bool pfmemalloc_active __read_mostly; | |
165 | ||
1da177e4 LT |
166 | /* |
167 | * kmem_bufctl_t: | |
168 | * | |
169 | * Bufctl's are used for linking objs within a slab | |
170 | * linked offsets. | |
171 | * | |
172 | * This implementation relies on "struct page" for locating the cache & | |
173 | * slab an object belongs to. | |
174 | * This allows the bufctl structure to be small (one int), but limits | |
175 | * the number of objects a slab (not a cache) can contain when off-slab | |
176 | * bufctls are used. The limit is the size of the largest general cache | |
177 | * that does not use off-slab slabs. | |
178 | * For 32bit archs with 4 kB pages, is this 56. | |
179 | * This is not serious, as it is only for large objects, when it is unwise | |
180 | * to have too many per slab. | |
181 | * Note: This limit can be raised by introducing a general cache whose size | |
182 | * is less than 512 (PAGE_SIZE<<3), but greater than 256. | |
183 | */ | |
184 | ||
fa5b08d5 | 185 | typedef unsigned int kmem_bufctl_t; |
1da177e4 LT |
186 | #define BUFCTL_END (((kmem_bufctl_t)(~0U))-0) |
187 | #define BUFCTL_FREE (((kmem_bufctl_t)(~0U))-1) | |
871751e2 AV |
188 | #define BUFCTL_ACTIVE (((kmem_bufctl_t)(~0U))-2) |
189 | #define SLAB_LIMIT (((kmem_bufctl_t)(~0U))-3) | |
1da177e4 | 190 | |
1da177e4 LT |
191 | /* |
192 | * struct slab_rcu | |
193 | * | |
194 | * slab_destroy on a SLAB_DESTROY_BY_RCU cache uses this structure to | |
195 | * arrange for kmem_freepages to be called via RCU. This is useful if | |
196 | * we need to approach a kernel structure obliquely, from its address | |
197 | * obtained without the usual locking. We can lock the structure to | |
198 | * stabilize it and check it's still at the given address, only if we | |
199 | * can be sure that the memory has not been meanwhile reused for some | |
200 | * other kind of object (which our subsystem's lock might corrupt). | |
201 | * | |
202 | * rcu_read_lock before reading the address, then rcu_read_unlock after | |
203 | * taking the spinlock within the structure expected at that address. | |
1da177e4 LT |
204 | */ |
205 | struct slab_rcu { | |
b28a02de | 206 | struct rcu_head head; |
343e0d7a | 207 | struct kmem_cache *cachep; |
b28a02de | 208 | void *addr; |
1da177e4 LT |
209 | }; |
210 | ||
5bfe53a7 LJ |
211 | /* |
212 | * struct slab | |
213 | * | |
214 | * Manages the objs in a slab. Placed either at the beginning of mem allocated | |
215 | * for a slab, or allocated from an general cache. | |
216 | * Slabs are chained into three list: fully used, partial, fully free slabs. | |
217 | */ | |
218 | struct slab { | |
219 | union { | |
220 | struct { | |
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; | |
227 | }; | |
228 | struct slab_rcu __slab_cover_slab_rcu; | |
229 | }; | |
230 | }; | |
231 | ||
1da177e4 LT |
232 | /* |
233 | * struct array_cache | |
234 | * | |
1da177e4 LT |
235 | * Purpose: |
236 | * - LIFO ordering, to hand out cache-warm objects from _alloc | |
237 | * - reduce the number of linked list operations | |
238 | * - reduce spinlock operations | |
239 | * | |
240 | * The limit is stored in the per-cpu structure to reduce the data cache | |
241 | * footprint. | |
242 | * | |
243 | */ | |
244 | struct array_cache { | |
245 | unsigned int avail; | |
246 | unsigned int limit; | |
247 | unsigned int batchcount; | |
248 | unsigned int touched; | |
e498be7d | 249 | spinlock_t lock; |
bda5b655 | 250 | void *entry[]; /* |
a737b3e2 AM |
251 | * Must have this definition in here for the proper |
252 | * alignment of array_cache. Also simplifies accessing | |
253 | * the entries. | |
072bb0aa MG |
254 | * |
255 | * Entries should not be directly dereferenced as | |
256 | * entries belonging to slabs marked pfmemalloc will | |
257 | * have the lower bits set SLAB_OBJ_PFMEMALLOC | |
a737b3e2 | 258 | */ |
1da177e4 LT |
259 | }; |
260 | ||
072bb0aa MG |
261 | #define SLAB_OBJ_PFMEMALLOC 1 |
262 | static inline bool is_obj_pfmemalloc(void *objp) | |
263 | { | |
264 | return (unsigned long)objp & SLAB_OBJ_PFMEMALLOC; | |
265 | } | |
266 | ||
267 | static inline void set_obj_pfmemalloc(void **objp) | |
268 | { | |
269 | *objp = (void *)((unsigned long)*objp | SLAB_OBJ_PFMEMALLOC); | |
270 | return; | |
271 | } | |
272 | ||
273 | static inline void clear_obj_pfmemalloc(void **objp) | |
274 | { | |
275 | *objp = (void *)((unsigned long)*objp & ~SLAB_OBJ_PFMEMALLOC); | |
276 | } | |
277 | ||
a737b3e2 AM |
278 | /* |
279 | * bootstrap: The caches do not work without cpuarrays anymore, but the | |
280 | * cpuarrays are allocated from the generic caches... | |
1da177e4 LT |
281 | */ |
282 | #define BOOT_CPUCACHE_ENTRIES 1 | |
283 | struct arraycache_init { | |
284 | struct array_cache cache; | |
b28a02de | 285 | void *entries[BOOT_CPUCACHE_ENTRIES]; |
1da177e4 LT |
286 | }; |
287 | ||
288 | /* | |
e498be7d | 289 | * The slab lists for all objects. |
1da177e4 LT |
290 | */ |
291 | struct kmem_list3 { | |
b28a02de PE |
292 | struct list_head slabs_partial; /* partial list first, better asm code */ |
293 | struct list_head slabs_full; | |
294 | struct list_head slabs_free; | |
295 | unsigned long free_objects; | |
b28a02de | 296 | unsigned int free_limit; |
2e1217cf | 297 | unsigned int colour_next; /* Per-node cache coloring */ |
b28a02de PE |
298 | spinlock_t list_lock; |
299 | struct array_cache *shared; /* shared per node */ | |
300 | struct array_cache **alien; /* on other nodes */ | |
35386e3b CL |
301 | unsigned long next_reap; /* updated without locking */ |
302 | int free_touched; /* updated without locking */ | |
1da177e4 LT |
303 | }; |
304 | ||
e498be7d CL |
305 | /* |
306 | * Need this for bootstrapping a per node allocator. | |
307 | */ | |
556a169d | 308 | #define NUM_INIT_LISTS (3 * MAX_NUMNODES) |
68a1b195 | 309 | static struct kmem_list3 __initdata initkmem_list3[NUM_INIT_LISTS]; |
e498be7d | 310 | #define CACHE_CACHE 0 |
556a169d PE |
311 | #define SIZE_AC MAX_NUMNODES |
312 | #define SIZE_L3 (2 * MAX_NUMNODES) | |
e498be7d | 313 | |
ed11d9eb CL |
314 | static int drain_freelist(struct kmem_cache *cache, |
315 | struct kmem_list3 *l3, int tofree); | |
316 | static void free_block(struct kmem_cache *cachep, void **objpp, int len, | |
317 | int node); | |
83b519e8 | 318 | static int enable_cpucache(struct kmem_cache *cachep, gfp_t gfp); |
65f27f38 | 319 | static void cache_reap(struct work_struct *unused); |
ed11d9eb | 320 | |
e498be7d | 321 | /* |
a737b3e2 AM |
322 | * This function must be completely optimized away if a constant is passed to |
323 | * it. Mostly the same as what is in linux/slab.h except it returns an index. | |
e498be7d | 324 | */ |
7243cc05 | 325 | static __always_inline int index_of(const size_t size) |
e498be7d | 326 | { |
5ec8a847 SR |
327 | extern void __bad_size(void); |
328 | ||
e498be7d CL |
329 | if (__builtin_constant_p(size)) { |
330 | int i = 0; | |
331 | ||
332 | #define CACHE(x) \ | |
333 | if (size <=x) \ | |
334 | return i; \ | |
335 | else \ | |
336 | i++; | |
1c61fc40 | 337 | #include <linux/kmalloc_sizes.h> |
e498be7d | 338 | #undef CACHE |
5ec8a847 | 339 | __bad_size(); |
7243cc05 | 340 | } else |
5ec8a847 | 341 | __bad_size(); |
e498be7d CL |
342 | return 0; |
343 | } | |
344 | ||
e0a42726 IM |
345 | static int slab_early_init = 1; |
346 | ||
e498be7d CL |
347 | #define INDEX_AC index_of(sizeof(struct arraycache_init)) |
348 | #define INDEX_L3 index_of(sizeof(struct kmem_list3)) | |
1da177e4 | 349 | |
5295a74c | 350 | static void kmem_list3_init(struct kmem_list3 *parent) |
e498be7d CL |
351 | { |
352 | INIT_LIST_HEAD(&parent->slabs_full); | |
353 | INIT_LIST_HEAD(&parent->slabs_partial); | |
354 | INIT_LIST_HEAD(&parent->slabs_free); | |
355 | parent->shared = NULL; | |
356 | parent->alien = NULL; | |
2e1217cf | 357 | parent->colour_next = 0; |
e498be7d CL |
358 | spin_lock_init(&parent->list_lock); |
359 | parent->free_objects = 0; | |
360 | parent->free_touched = 0; | |
361 | } | |
362 | ||
a737b3e2 AM |
363 | #define MAKE_LIST(cachep, listp, slab, nodeid) \ |
364 | do { \ | |
365 | INIT_LIST_HEAD(listp); \ | |
366 | list_splice(&(cachep->nodelists[nodeid]->slab), listp); \ | |
e498be7d CL |
367 | } while (0) |
368 | ||
a737b3e2 AM |
369 | #define MAKE_ALL_LISTS(cachep, ptr, nodeid) \ |
370 | do { \ | |
e498be7d CL |
371 | MAKE_LIST((cachep), (&(ptr)->slabs_full), slabs_full, nodeid); \ |
372 | MAKE_LIST((cachep), (&(ptr)->slabs_partial), slabs_partial, nodeid); \ | |
373 | MAKE_LIST((cachep), (&(ptr)->slabs_free), slabs_free, nodeid); \ | |
374 | } while (0) | |
1da177e4 | 375 | |
1da177e4 LT |
376 | #define CFLGS_OFF_SLAB (0x80000000UL) |
377 | #define OFF_SLAB(x) ((x)->flags & CFLGS_OFF_SLAB) | |
378 | ||
379 | #define BATCHREFILL_LIMIT 16 | |
a737b3e2 AM |
380 | /* |
381 | * Optimization question: fewer reaps means less probability for unnessary | |
382 | * cpucache drain/refill cycles. | |
1da177e4 | 383 | * |
dc6f3f27 | 384 | * OTOH the cpuarrays can contain lots of objects, |
1da177e4 LT |
385 | * which could lock up otherwise freeable slabs. |
386 | */ | |
387 | #define REAPTIMEOUT_CPUC (2*HZ) | |
388 | #define REAPTIMEOUT_LIST3 (4*HZ) | |
389 | ||
390 | #if STATS | |
391 | #define STATS_INC_ACTIVE(x) ((x)->num_active++) | |
392 | #define STATS_DEC_ACTIVE(x) ((x)->num_active--) | |
393 | #define STATS_INC_ALLOCED(x) ((x)->num_allocations++) | |
394 | #define STATS_INC_GROWN(x) ((x)->grown++) | |
ed11d9eb | 395 | #define STATS_ADD_REAPED(x,y) ((x)->reaped += (y)) |
a737b3e2 AM |
396 | #define STATS_SET_HIGH(x) \ |
397 | do { \ | |
398 | if ((x)->num_active > (x)->high_mark) \ | |
399 | (x)->high_mark = (x)->num_active; \ | |
400 | } while (0) | |
1da177e4 LT |
401 | #define STATS_INC_ERR(x) ((x)->errors++) |
402 | #define STATS_INC_NODEALLOCS(x) ((x)->node_allocs++) | |
e498be7d | 403 | #define STATS_INC_NODEFREES(x) ((x)->node_frees++) |
fb7faf33 | 404 | #define STATS_INC_ACOVERFLOW(x) ((x)->node_overflow++) |
a737b3e2 AM |
405 | #define STATS_SET_FREEABLE(x, i) \ |
406 | do { \ | |
407 | if ((x)->max_freeable < i) \ | |
408 | (x)->max_freeable = i; \ | |
409 | } while (0) | |
1da177e4 LT |
410 | #define STATS_INC_ALLOCHIT(x) atomic_inc(&(x)->allochit) |
411 | #define STATS_INC_ALLOCMISS(x) atomic_inc(&(x)->allocmiss) | |
412 | #define STATS_INC_FREEHIT(x) atomic_inc(&(x)->freehit) | |
413 | #define STATS_INC_FREEMISS(x) atomic_inc(&(x)->freemiss) | |
414 | #else | |
415 | #define STATS_INC_ACTIVE(x) do { } while (0) | |
416 | #define STATS_DEC_ACTIVE(x) do { } while (0) | |
417 | #define STATS_INC_ALLOCED(x) do { } while (0) | |
418 | #define STATS_INC_GROWN(x) do { } while (0) | |
4e60c86b | 419 | #define STATS_ADD_REAPED(x,y) do { (void)(y); } while (0) |
1da177e4 LT |
420 | #define STATS_SET_HIGH(x) do { } while (0) |
421 | #define STATS_INC_ERR(x) do { } while (0) | |
422 | #define STATS_INC_NODEALLOCS(x) do { } while (0) | |
e498be7d | 423 | #define STATS_INC_NODEFREES(x) do { } while (0) |
fb7faf33 | 424 | #define STATS_INC_ACOVERFLOW(x) do { } while (0) |
a737b3e2 | 425 | #define STATS_SET_FREEABLE(x, i) do { } while (0) |
1da177e4 LT |
426 | #define STATS_INC_ALLOCHIT(x) do { } while (0) |
427 | #define STATS_INC_ALLOCMISS(x) do { } while (0) | |
428 | #define STATS_INC_FREEHIT(x) do { } while (0) | |
429 | #define STATS_INC_FREEMISS(x) do { } while (0) | |
430 | #endif | |
431 | ||
432 | #if DEBUG | |
1da177e4 | 433 | |
a737b3e2 AM |
434 | /* |
435 | * memory layout of objects: | |
1da177e4 | 436 | * 0 : objp |
3dafccf2 | 437 | * 0 .. cachep->obj_offset - BYTES_PER_WORD - 1: padding. This ensures that |
1da177e4 LT |
438 | * the end of an object is aligned with the end of the real |
439 | * allocation. Catches writes behind the end of the allocation. | |
3dafccf2 | 440 | * cachep->obj_offset - BYTES_PER_WORD .. cachep->obj_offset - 1: |
1da177e4 | 441 | * redzone word. |
3dafccf2 | 442 | * cachep->obj_offset: The real object. |
3b0efdfa CL |
443 | * cachep->size - 2* BYTES_PER_WORD: redzone word [BYTES_PER_WORD long] |
444 | * cachep->size - 1* BYTES_PER_WORD: last caller address | |
a737b3e2 | 445 | * [BYTES_PER_WORD long] |
1da177e4 | 446 | */ |
343e0d7a | 447 | static int obj_offset(struct kmem_cache *cachep) |
1da177e4 | 448 | { |
3dafccf2 | 449 | return cachep->obj_offset; |
1da177e4 LT |
450 | } |
451 | ||
b46b8f19 | 452 | static unsigned long long *dbg_redzone1(struct kmem_cache *cachep, void *objp) |
1da177e4 LT |
453 | { |
454 | BUG_ON(!(cachep->flags & SLAB_RED_ZONE)); | |
b46b8f19 DW |
455 | return (unsigned long long*) (objp + obj_offset(cachep) - |
456 | sizeof(unsigned long long)); | |
1da177e4 LT |
457 | } |
458 | ||
b46b8f19 | 459 | static unsigned long long *dbg_redzone2(struct kmem_cache *cachep, void *objp) |
1da177e4 LT |
460 | { |
461 | BUG_ON(!(cachep->flags & SLAB_RED_ZONE)); | |
462 | if (cachep->flags & SLAB_STORE_USER) | |
3b0efdfa | 463 | return (unsigned long long *)(objp + cachep->size - |
b46b8f19 | 464 | sizeof(unsigned long long) - |
87a927c7 | 465 | REDZONE_ALIGN); |
3b0efdfa | 466 | return (unsigned long long *) (objp + cachep->size - |
b46b8f19 | 467 | sizeof(unsigned long long)); |
1da177e4 LT |
468 | } |
469 | ||
343e0d7a | 470 | static void **dbg_userword(struct kmem_cache *cachep, void *objp) |
1da177e4 LT |
471 | { |
472 | BUG_ON(!(cachep->flags & SLAB_STORE_USER)); | |
3b0efdfa | 473 | return (void **)(objp + cachep->size - BYTES_PER_WORD); |
1da177e4 LT |
474 | } |
475 | ||
476 | #else | |
477 | ||
3dafccf2 | 478 | #define obj_offset(x) 0 |
b46b8f19 DW |
479 | #define dbg_redzone1(cachep, objp) ({BUG(); (unsigned long long *)NULL;}) |
480 | #define dbg_redzone2(cachep, objp) ({BUG(); (unsigned long long *)NULL;}) | |
1da177e4 LT |
481 | #define dbg_userword(cachep, objp) ({BUG(); (void **)NULL;}) |
482 | ||
483 | #endif | |
484 | ||
1da177e4 | 485 | /* |
3df1cccd DR |
486 | * Do not go above this order unless 0 objects fit into the slab or |
487 | * overridden on the command line. | |
1da177e4 | 488 | */ |
543585cc DR |
489 | #define SLAB_MAX_ORDER_HI 1 |
490 | #define SLAB_MAX_ORDER_LO 0 | |
491 | static int slab_max_order = SLAB_MAX_ORDER_LO; | |
3df1cccd | 492 | static bool slab_max_order_set __initdata; |
1da177e4 | 493 | |
6ed5eb22 PE |
494 | static inline struct kmem_cache *virt_to_cache(const void *obj) |
495 | { | |
b49af68f | 496 | struct page *page = virt_to_head_page(obj); |
35026088 | 497 | return page->slab_cache; |
6ed5eb22 PE |
498 | } |
499 | ||
500 | static inline struct slab *virt_to_slab(const void *obj) | |
501 | { | |
b49af68f | 502 | struct page *page = virt_to_head_page(obj); |
35026088 CL |
503 | |
504 | VM_BUG_ON(!PageSlab(page)); | |
505 | return page->slab_page; | |
6ed5eb22 PE |
506 | } |
507 | ||
8fea4e96 PE |
508 | static inline void *index_to_obj(struct kmem_cache *cache, struct slab *slab, |
509 | unsigned int idx) | |
510 | { | |
3b0efdfa | 511 | return slab->s_mem + cache->size * idx; |
8fea4e96 PE |
512 | } |
513 | ||
6a2d7a95 | 514 | /* |
3b0efdfa CL |
515 | * We want to avoid an expensive divide : (offset / cache->size) |
516 | * Using the fact that size is a constant for a particular cache, | |
517 | * we can replace (offset / cache->size) by | |
6a2d7a95 ED |
518 | * reciprocal_divide(offset, cache->reciprocal_buffer_size) |
519 | */ | |
520 | static inline unsigned int obj_to_index(const struct kmem_cache *cache, | |
521 | const struct slab *slab, void *obj) | |
8fea4e96 | 522 | { |
6a2d7a95 ED |
523 | u32 offset = (obj - slab->s_mem); |
524 | return reciprocal_divide(offset, cache->reciprocal_buffer_size); | |
8fea4e96 PE |
525 | } |
526 | ||
a737b3e2 AM |
527 | /* |
528 | * These are the default caches for kmalloc. Custom caches can have other sizes. | |
529 | */ | |
1da177e4 LT |
530 | struct cache_sizes malloc_sizes[] = { |
531 | #define CACHE(x) { .cs_size = (x) }, | |
532 | #include <linux/kmalloc_sizes.h> | |
533 | CACHE(ULONG_MAX) | |
534 | #undef CACHE | |
535 | }; | |
536 | EXPORT_SYMBOL(malloc_sizes); | |
537 | ||
538 | /* Must match cache_sizes above. Out of line to keep cache footprint low. */ | |
539 | struct cache_names { | |
540 | char *name; | |
541 | char *name_dma; | |
542 | }; | |
543 | ||
544 | static struct cache_names __initdata cache_names[] = { | |
545 | #define CACHE(x) { .name = "size-" #x, .name_dma = "size-" #x "(DMA)" }, | |
546 | #include <linux/kmalloc_sizes.h> | |
b28a02de | 547 | {NULL,} |
1da177e4 LT |
548 | #undef CACHE |
549 | }; | |
550 | ||
1da177e4 | 551 | static struct arraycache_init initarray_generic = |
b28a02de | 552 | { {0, BOOT_CPUCACHE_ENTRIES, 1, 0} }; |
1da177e4 LT |
553 | |
554 | /* internal cache of cache description objs */ | |
9b030cb8 | 555 | static struct kmem_cache kmem_cache_boot = { |
b28a02de PE |
556 | .batchcount = 1, |
557 | .limit = BOOT_CPUCACHE_ENTRIES, | |
558 | .shared = 1, | |
3b0efdfa | 559 | .size = sizeof(struct kmem_cache), |
b28a02de | 560 | .name = "kmem_cache", |
1da177e4 LT |
561 | }; |
562 | ||
056c6241 RT |
563 | #define BAD_ALIEN_MAGIC 0x01020304ul |
564 | ||
f1aaee53 AV |
565 | #ifdef CONFIG_LOCKDEP |
566 | ||
567 | /* | |
568 | * Slab sometimes uses the kmalloc slabs to store the slab headers | |
569 | * for other slabs "off slab". | |
570 | * The locking for this is tricky in that it nests within the locks | |
571 | * of all other slabs in a few places; to deal with this special | |
572 | * locking we put on-slab caches into a separate lock-class. | |
056c6241 RT |
573 | * |
574 | * We set lock class for alien array caches which are up during init. | |
575 | * The lock annotation will be lost if all cpus of a node goes down and | |
576 | * then comes back up during hotplug | |
f1aaee53 | 577 | */ |
056c6241 RT |
578 | static struct lock_class_key on_slab_l3_key; |
579 | static struct lock_class_key on_slab_alc_key; | |
580 | ||
83835b3d PZ |
581 | static struct lock_class_key debugobj_l3_key; |
582 | static struct lock_class_key debugobj_alc_key; | |
583 | ||
584 | static void slab_set_lock_classes(struct kmem_cache *cachep, | |
585 | struct lock_class_key *l3_key, struct lock_class_key *alc_key, | |
586 | int q) | |
587 | { | |
588 | struct array_cache **alc; | |
589 | struct kmem_list3 *l3; | |
590 | int r; | |
591 | ||
592 | l3 = cachep->nodelists[q]; | |
593 | if (!l3) | |
594 | return; | |
595 | ||
596 | lockdep_set_class(&l3->list_lock, l3_key); | |
597 | alc = l3->alien; | |
598 | /* | |
599 | * FIXME: This check for BAD_ALIEN_MAGIC | |
600 | * should go away when common slab code is taught to | |
601 | * work even without alien caches. | |
602 | * Currently, non NUMA code returns BAD_ALIEN_MAGIC | |
603 | * for alloc_alien_cache, | |
604 | */ | |
605 | if (!alc || (unsigned long)alc == BAD_ALIEN_MAGIC) | |
606 | return; | |
607 | for_each_node(r) { | |
608 | if (alc[r]) | |
609 | lockdep_set_class(&alc[r]->lock, alc_key); | |
610 | } | |
611 | } | |
612 | ||
613 | static void slab_set_debugobj_lock_classes_node(struct kmem_cache *cachep, int node) | |
614 | { | |
615 | slab_set_lock_classes(cachep, &debugobj_l3_key, &debugobj_alc_key, node); | |
616 | } | |
617 | ||
618 | static void slab_set_debugobj_lock_classes(struct kmem_cache *cachep) | |
619 | { | |
620 | int node; | |
621 | ||
622 | for_each_online_node(node) | |
623 | slab_set_debugobj_lock_classes_node(cachep, node); | |
624 | } | |
625 | ||
ce79ddc8 | 626 | static void init_node_lock_keys(int q) |
f1aaee53 | 627 | { |
056c6241 RT |
628 | struct cache_sizes *s = malloc_sizes; |
629 | ||
97d06609 | 630 | if (slab_state < UP) |
ce79ddc8 PE |
631 | return; |
632 | ||
633 | for (s = malloc_sizes; s->cs_size != ULONG_MAX; s++) { | |
ce79ddc8 | 634 | struct kmem_list3 *l3; |
ce79ddc8 PE |
635 | |
636 | l3 = s->cs_cachep->nodelists[q]; | |
637 | if (!l3 || OFF_SLAB(s->cs_cachep)) | |
00afa758 | 638 | continue; |
83835b3d PZ |
639 | |
640 | slab_set_lock_classes(s->cs_cachep, &on_slab_l3_key, | |
641 | &on_slab_alc_key, q); | |
f1aaee53 AV |
642 | } |
643 | } | |
ce79ddc8 | 644 | |
6ccfb5bc GC |
645 | static void on_slab_lock_classes_node(struct kmem_cache *cachep, int q) |
646 | { | |
647 | struct kmem_list3 *l3; | |
648 | l3 = cachep->nodelists[q]; | |
649 | if (!l3) | |
650 | return; | |
651 | ||
652 | slab_set_lock_classes(cachep, &on_slab_l3_key, | |
653 | &on_slab_alc_key, q); | |
654 | } | |
655 | ||
656 | static inline void on_slab_lock_classes(struct kmem_cache *cachep) | |
657 | { | |
658 | int node; | |
659 | ||
660 | VM_BUG_ON(OFF_SLAB(cachep)); | |
661 | for_each_node(node) | |
662 | on_slab_lock_classes_node(cachep, node); | |
663 | } | |
664 | ||
ce79ddc8 PE |
665 | static inline void init_lock_keys(void) |
666 | { | |
667 | int node; | |
668 | ||
669 | for_each_node(node) | |
670 | init_node_lock_keys(node); | |
671 | } | |
f1aaee53 | 672 | #else |
ce79ddc8 PE |
673 | static void init_node_lock_keys(int q) |
674 | { | |
675 | } | |
676 | ||
056c6241 | 677 | static inline void init_lock_keys(void) |
f1aaee53 AV |
678 | { |
679 | } | |
83835b3d | 680 | |
6ccfb5bc GC |
681 | static inline void on_slab_lock_classes(struct kmem_cache *cachep) |
682 | { | |
683 | } | |
684 | ||
685 | static inline void on_slab_lock_classes_node(struct kmem_cache *cachep, int node) | |
686 | { | |
687 | } | |
688 | ||
83835b3d PZ |
689 | static void slab_set_debugobj_lock_classes_node(struct kmem_cache *cachep, int node) |
690 | { | |
691 | } | |
692 | ||
693 | static void slab_set_debugobj_lock_classes(struct kmem_cache *cachep) | |
694 | { | |
695 | } | |
f1aaee53 AV |
696 | #endif |
697 | ||
1871e52c | 698 | static DEFINE_PER_CPU(struct delayed_work, slab_reap_work); |
1da177e4 | 699 | |
343e0d7a | 700 | static inline struct array_cache *cpu_cache_get(struct kmem_cache *cachep) |
1da177e4 LT |
701 | { |
702 | return cachep->array[smp_processor_id()]; | |
703 | } | |
704 | ||
a737b3e2 AM |
705 | static inline struct kmem_cache *__find_general_cachep(size_t size, |
706 | gfp_t gfpflags) | |
1da177e4 LT |
707 | { |
708 | struct cache_sizes *csizep = malloc_sizes; | |
709 | ||
710 | #if DEBUG | |
711 | /* This happens if someone tries to call | |
b28a02de PE |
712 | * kmem_cache_create(), or __kmalloc(), before |
713 | * the generic caches are initialized. | |
714 | */ | |
c7e43c78 | 715 | BUG_ON(malloc_sizes[INDEX_AC].cs_cachep == NULL); |
1da177e4 | 716 | #endif |
6cb8f913 CL |
717 | if (!size) |
718 | return ZERO_SIZE_PTR; | |
719 | ||
1da177e4 LT |
720 | while (size > csizep->cs_size) |
721 | csizep++; | |
722 | ||
723 | /* | |
0abf40c1 | 724 | * Really subtle: The last entry with cs->cs_size==ULONG_MAX |
1da177e4 LT |
725 | * has cs_{dma,}cachep==NULL. Thus no special case |
726 | * for large kmalloc calls required. | |
727 | */ | |
4b51d669 | 728 | #ifdef CONFIG_ZONE_DMA |
1da177e4 LT |
729 | if (unlikely(gfpflags & GFP_DMA)) |
730 | return csizep->cs_dmacachep; | |
4b51d669 | 731 | #endif |
1da177e4 LT |
732 | return csizep->cs_cachep; |
733 | } | |
734 | ||
b221385b | 735 | static struct kmem_cache *kmem_find_general_cachep(size_t size, gfp_t gfpflags) |
97e2bde4 MS |
736 | { |
737 | return __find_general_cachep(size, gfpflags); | |
738 | } | |
97e2bde4 | 739 | |
fbaccacf | 740 | static size_t slab_mgmt_size(size_t nr_objs, size_t align) |
1da177e4 | 741 | { |
fbaccacf SR |
742 | return ALIGN(sizeof(struct slab)+nr_objs*sizeof(kmem_bufctl_t), align); |
743 | } | |
1da177e4 | 744 | |
a737b3e2 AM |
745 | /* |
746 | * Calculate the number of objects and left-over bytes for a given buffer size. | |
747 | */ | |
fbaccacf SR |
748 | static void cache_estimate(unsigned long gfporder, size_t buffer_size, |
749 | size_t align, int flags, size_t *left_over, | |
750 | unsigned int *num) | |
751 | { | |
752 | int nr_objs; | |
753 | size_t mgmt_size; | |
754 | size_t slab_size = PAGE_SIZE << gfporder; | |
1da177e4 | 755 | |
fbaccacf SR |
756 | /* |
757 | * The slab management structure can be either off the slab or | |
758 | * on it. For the latter case, the memory allocated for a | |
759 | * slab is used for: | |
760 | * | |
761 | * - The struct slab | |
762 | * - One kmem_bufctl_t for each object | |
763 | * - Padding to respect alignment of @align | |
764 | * - @buffer_size bytes for each object | |
765 | * | |
766 | * If the slab management structure is off the slab, then the | |
767 | * alignment will already be calculated into the size. Because | |
768 | * the slabs are all pages aligned, the objects will be at the | |
769 | * correct alignment when allocated. | |
770 | */ | |
771 | if (flags & CFLGS_OFF_SLAB) { | |
772 | mgmt_size = 0; | |
773 | nr_objs = slab_size / buffer_size; | |
774 | ||
775 | if (nr_objs > SLAB_LIMIT) | |
776 | nr_objs = SLAB_LIMIT; | |
777 | } else { | |
778 | /* | |
779 | * Ignore padding for the initial guess. The padding | |
780 | * is at most @align-1 bytes, and @buffer_size is at | |
781 | * least @align. In the worst case, this result will | |
782 | * be one greater than the number of objects that fit | |
783 | * into the memory allocation when taking the padding | |
784 | * into account. | |
785 | */ | |
786 | nr_objs = (slab_size - sizeof(struct slab)) / | |
787 | (buffer_size + sizeof(kmem_bufctl_t)); | |
788 | ||
789 | /* | |
790 | * This calculated number will be either the right | |
791 | * amount, or one greater than what we want. | |
792 | */ | |
793 | if (slab_mgmt_size(nr_objs, align) + nr_objs*buffer_size | |
794 | > slab_size) | |
795 | nr_objs--; | |
796 | ||
797 | if (nr_objs > SLAB_LIMIT) | |
798 | nr_objs = SLAB_LIMIT; | |
799 | ||
800 | mgmt_size = slab_mgmt_size(nr_objs, align); | |
801 | } | |
802 | *num = nr_objs; | |
803 | *left_over = slab_size - nr_objs*buffer_size - mgmt_size; | |
1da177e4 LT |
804 | } |
805 | ||
f28510d3 | 806 | #if DEBUG |
d40cee24 | 807 | #define slab_error(cachep, msg) __slab_error(__func__, cachep, msg) |
1da177e4 | 808 | |
a737b3e2 AM |
809 | static void __slab_error(const char *function, struct kmem_cache *cachep, |
810 | char *msg) | |
1da177e4 LT |
811 | { |
812 | printk(KERN_ERR "slab error in %s(): cache `%s': %s\n", | |
b28a02de | 813 | function, cachep->name, msg); |
1da177e4 | 814 | dump_stack(); |
645df230 | 815 | add_taint(TAINT_BAD_PAGE); |
1da177e4 | 816 | } |
f28510d3 | 817 | #endif |
1da177e4 | 818 | |
3395ee05 PM |
819 | /* |
820 | * By default on NUMA we use alien caches to stage the freeing of | |
821 | * objects allocated from other nodes. This causes massive memory | |
822 | * inefficiencies when using fake NUMA setup to split memory into a | |
823 | * large number of small nodes, so it can be disabled on the command | |
824 | * line | |
825 | */ | |
826 | ||
827 | static int use_alien_caches __read_mostly = 1; | |
828 | static int __init noaliencache_setup(char *s) | |
829 | { | |
830 | use_alien_caches = 0; | |
831 | return 1; | |
832 | } | |
833 | __setup("noaliencache", noaliencache_setup); | |
834 | ||
3df1cccd DR |
835 | static int __init slab_max_order_setup(char *str) |
836 | { | |
837 | get_option(&str, &slab_max_order); | |
838 | slab_max_order = slab_max_order < 0 ? 0 : | |
839 | min(slab_max_order, MAX_ORDER - 1); | |
840 | slab_max_order_set = true; | |
841 | ||
842 | return 1; | |
843 | } | |
844 | __setup("slab_max_order=", slab_max_order_setup); | |
845 | ||
8fce4d8e CL |
846 | #ifdef CONFIG_NUMA |
847 | /* | |
848 | * Special reaping functions for NUMA systems called from cache_reap(). | |
849 | * These take care of doing round robin flushing of alien caches (containing | |
850 | * objects freed on different nodes from which they were allocated) and the | |
851 | * flushing of remote pcps by calling drain_node_pages. | |
852 | */ | |
1871e52c | 853 | static DEFINE_PER_CPU(unsigned long, slab_reap_node); |
8fce4d8e CL |
854 | |
855 | static void init_reap_node(int cpu) | |
856 | { | |
857 | int node; | |
858 | ||
7d6e6d09 | 859 | node = next_node(cpu_to_mem(cpu), node_online_map); |
8fce4d8e | 860 | if (node == MAX_NUMNODES) |
442295c9 | 861 | node = first_node(node_online_map); |
8fce4d8e | 862 | |
1871e52c | 863 | per_cpu(slab_reap_node, cpu) = node; |
8fce4d8e CL |
864 | } |
865 | ||
866 | static void next_reap_node(void) | |
867 | { | |
909ea964 | 868 | int node = __this_cpu_read(slab_reap_node); |
8fce4d8e | 869 | |
8fce4d8e CL |
870 | node = next_node(node, node_online_map); |
871 | if (unlikely(node >= MAX_NUMNODES)) | |
872 | node = first_node(node_online_map); | |
909ea964 | 873 | __this_cpu_write(slab_reap_node, node); |
8fce4d8e CL |
874 | } |
875 | ||
876 | #else | |
877 | #define init_reap_node(cpu) do { } while (0) | |
878 | #define next_reap_node(void) do { } while (0) | |
879 | #endif | |
880 | ||
1da177e4 LT |
881 | /* |
882 | * Initiate the reap timer running on the target CPU. We run at around 1 to 2Hz | |
883 | * via the workqueue/eventd. | |
884 | * Add the CPU number into the expiration time to minimize the possibility of | |
885 | * the CPUs getting into lockstep and contending for the global cache chain | |
886 | * lock. | |
887 | */ | |
897e679b | 888 | static void __cpuinit start_cpu_timer(int cpu) |
1da177e4 | 889 | { |
1871e52c | 890 | struct delayed_work *reap_work = &per_cpu(slab_reap_work, cpu); |
1da177e4 LT |
891 | |
892 | /* | |
893 | * When this gets called from do_initcalls via cpucache_init(), | |
894 | * init_workqueues() has already run, so keventd will be setup | |
895 | * at that time. | |
896 | */ | |
52bad64d | 897 | if (keventd_up() && reap_work->work.func == NULL) { |
8fce4d8e | 898 | init_reap_node(cpu); |
203b42f7 | 899 | INIT_DEFERRABLE_WORK(reap_work, cache_reap); |
2b284214 AV |
900 | schedule_delayed_work_on(cpu, reap_work, |
901 | __round_jiffies_relative(HZ, cpu)); | |
1da177e4 LT |
902 | } |
903 | } | |
904 | ||
e498be7d | 905 | static struct array_cache *alloc_arraycache(int node, int entries, |
83b519e8 | 906 | int batchcount, gfp_t gfp) |
1da177e4 | 907 | { |
b28a02de | 908 | int memsize = sizeof(void *) * entries + sizeof(struct array_cache); |
1da177e4 LT |
909 | struct array_cache *nc = NULL; |
910 | ||
83b519e8 | 911 | nc = kmalloc_node(memsize, gfp, node); |
d5cff635 CM |
912 | /* |
913 | * The array_cache structures contain pointers to free object. | |
25985edc | 914 | * However, when such objects are allocated or transferred to another |
d5cff635 CM |
915 | * cache the pointers are not cleared and they could be counted as |
916 | * valid references during a kmemleak scan. Therefore, kmemleak must | |
917 | * not scan such objects. | |
918 | */ | |
919 | kmemleak_no_scan(nc); | |
1da177e4 LT |
920 | if (nc) { |
921 | nc->avail = 0; | |
922 | nc->limit = entries; | |
923 | nc->batchcount = batchcount; | |
924 | nc->touched = 0; | |
e498be7d | 925 | spin_lock_init(&nc->lock); |
1da177e4 LT |
926 | } |
927 | return nc; | |
928 | } | |
929 | ||
072bb0aa MG |
930 | static inline bool is_slab_pfmemalloc(struct slab *slabp) |
931 | { | |
932 | struct page *page = virt_to_page(slabp->s_mem); | |
933 | ||
934 | return PageSlabPfmemalloc(page); | |
935 | } | |
936 | ||
937 | /* Clears pfmemalloc_active if no slabs have pfmalloc set */ | |
938 | static void recheck_pfmemalloc_active(struct kmem_cache *cachep, | |
939 | struct array_cache *ac) | |
940 | { | |
941 | struct kmem_list3 *l3 = cachep->nodelists[numa_mem_id()]; | |
942 | struct slab *slabp; | |
943 | unsigned long flags; | |
944 | ||
945 | if (!pfmemalloc_active) | |
946 | return; | |
947 | ||
948 | spin_lock_irqsave(&l3->list_lock, flags); | |
949 | list_for_each_entry(slabp, &l3->slabs_full, list) | |
950 | if (is_slab_pfmemalloc(slabp)) | |
951 | goto out; | |
952 | ||
953 | list_for_each_entry(slabp, &l3->slabs_partial, list) | |
954 | if (is_slab_pfmemalloc(slabp)) | |
955 | goto out; | |
956 | ||
957 | list_for_each_entry(slabp, &l3->slabs_free, list) | |
958 | if (is_slab_pfmemalloc(slabp)) | |
959 | goto out; | |
960 | ||
961 | pfmemalloc_active = false; | |
962 | out: | |
963 | spin_unlock_irqrestore(&l3->list_lock, flags); | |
964 | } | |
965 | ||
381760ea | 966 | static void *__ac_get_obj(struct kmem_cache *cachep, struct array_cache *ac, |
072bb0aa MG |
967 | gfp_t flags, bool force_refill) |
968 | { | |
969 | int i; | |
970 | void *objp = ac->entry[--ac->avail]; | |
971 | ||
972 | /* Ensure the caller is allowed to use objects from PFMEMALLOC slab */ | |
973 | if (unlikely(is_obj_pfmemalloc(objp))) { | |
974 | struct kmem_list3 *l3; | |
975 | ||
976 | if (gfp_pfmemalloc_allowed(flags)) { | |
977 | clear_obj_pfmemalloc(&objp); | |
978 | return objp; | |
979 | } | |
980 | ||
981 | /* The caller cannot use PFMEMALLOC objects, find another one */ | |
d014dc2e | 982 | for (i = 0; i < ac->avail; i++) { |
072bb0aa MG |
983 | /* If a !PFMEMALLOC object is found, swap them */ |
984 | if (!is_obj_pfmemalloc(ac->entry[i])) { | |
985 | objp = ac->entry[i]; | |
986 | ac->entry[i] = ac->entry[ac->avail]; | |
987 | ac->entry[ac->avail] = objp; | |
988 | return objp; | |
989 | } | |
990 | } | |
991 | ||
992 | /* | |
993 | * If there are empty slabs on the slabs_free list and we are | |
994 | * being forced to refill the cache, mark this one !pfmemalloc. | |
995 | */ | |
996 | l3 = cachep->nodelists[numa_mem_id()]; | |
997 | if (!list_empty(&l3->slabs_free) && force_refill) { | |
998 | struct slab *slabp = virt_to_slab(objp); | |
30c29bea | 999 | ClearPageSlabPfmemalloc(virt_to_head_page(slabp->s_mem)); |
072bb0aa MG |
1000 | clear_obj_pfmemalloc(&objp); |
1001 | recheck_pfmemalloc_active(cachep, ac); | |
1002 | return objp; | |
1003 | } | |
1004 | ||
1005 | /* No !PFMEMALLOC objects available */ | |
1006 | ac->avail++; | |
1007 | objp = NULL; | |
1008 | } | |
1009 | ||
1010 | return objp; | |
1011 | } | |
1012 | ||
381760ea MG |
1013 | static inline void *ac_get_obj(struct kmem_cache *cachep, |
1014 | struct array_cache *ac, gfp_t flags, bool force_refill) | |
1015 | { | |
1016 | void *objp; | |
1017 | ||
1018 | if (unlikely(sk_memalloc_socks())) | |
1019 | objp = __ac_get_obj(cachep, ac, flags, force_refill); | |
1020 | else | |
1021 | objp = ac->entry[--ac->avail]; | |
1022 | ||
1023 | return objp; | |
1024 | } | |
1025 | ||
1026 | static void *__ac_put_obj(struct kmem_cache *cachep, struct array_cache *ac, | |
072bb0aa MG |
1027 | void *objp) |
1028 | { | |
1029 | if (unlikely(pfmemalloc_active)) { | |
1030 | /* Some pfmemalloc slabs exist, check if this is one */ | |
30c29bea | 1031 | struct page *page = virt_to_head_page(objp); |
072bb0aa MG |
1032 | if (PageSlabPfmemalloc(page)) |
1033 | set_obj_pfmemalloc(&objp); | |
1034 | } | |
1035 | ||
381760ea MG |
1036 | return objp; |
1037 | } | |
1038 | ||
1039 | static inline void ac_put_obj(struct kmem_cache *cachep, struct array_cache *ac, | |
1040 | void *objp) | |
1041 | { | |
1042 | if (unlikely(sk_memalloc_socks())) | |
1043 | objp = __ac_put_obj(cachep, ac, objp); | |
1044 | ||
072bb0aa MG |
1045 | ac->entry[ac->avail++] = objp; |
1046 | } | |
1047 | ||
3ded175a CL |
1048 | /* |
1049 | * Transfer objects in one arraycache to another. | |
1050 | * Locking must be handled by the caller. | |
1051 | * | |
1052 | * Return the number of entries transferred. | |
1053 | */ | |
1054 | static int transfer_objects(struct array_cache *to, | |
1055 | struct array_cache *from, unsigned int max) | |
1056 | { | |
1057 | /* Figure out how many entries to transfer */ | |
732eacc0 | 1058 | int nr = min3(from->avail, max, to->limit - to->avail); |
3ded175a CL |
1059 | |
1060 | if (!nr) | |
1061 | return 0; | |
1062 | ||
1063 | memcpy(to->entry + to->avail, from->entry + from->avail -nr, | |
1064 | sizeof(void *) *nr); | |
1065 | ||
1066 | from->avail -= nr; | |
1067 | to->avail += nr; | |
3ded175a CL |
1068 | return nr; |
1069 | } | |
1070 | ||
765c4507 CL |
1071 | #ifndef CONFIG_NUMA |
1072 | ||
1073 | #define drain_alien_cache(cachep, alien) do { } while (0) | |
1074 | #define reap_alien(cachep, l3) do { } while (0) | |
1075 | ||
83b519e8 | 1076 | static inline struct array_cache **alloc_alien_cache(int node, int limit, gfp_t gfp) |
765c4507 CL |
1077 | { |
1078 | return (struct array_cache **)BAD_ALIEN_MAGIC; | |
1079 | } | |
1080 | ||
1081 | static inline void free_alien_cache(struct array_cache **ac_ptr) | |
1082 | { | |
1083 | } | |
1084 | ||
1085 | static inline int cache_free_alien(struct kmem_cache *cachep, void *objp) | |
1086 | { | |
1087 | return 0; | |
1088 | } | |
1089 | ||
1090 | static inline void *alternate_node_alloc(struct kmem_cache *cachep, | |
1091 | gfp_t flags) | |
1092 | { | |
1093 | return NULL; | |
1094 | } | |
1095 | ||
8b98c169 | 1096 | static inline void *____cache_alloc_node(struct kmem_cache *cachep, |
765c4507 CL |
1097 | gfp_t flags, int nodeid) |
1098 | { | |
1099 | return NULL; | |
1100 | } | |
1101 | ||
1102 | #else /* CONFIG_NUMA */ | |
1103 | ||
8b98c169 | 1104 | static void *____cache_alloc_node(struct kmem_cache *, gfp_t, int); |
c61afb18 | 1105 | static void *alternate_node_alloc(struct kmem_cache *, gfp_t); |
dc85da15 | 1106 | |
83b519e8 | 1107 | static struct array_cache **alloc_alien_cache(int node, int limit, gfp_t gfp) |
e498be7d CL |
1108 | { |
1109 | struct array_cache **ac_ptr; | |
8ef82866 | 1110 | int memsize = sizeof(void *) * nr_node_ids; |
e498be7d CL |
1111 | int i; |
1112 | ||
1113 | if (limit > 1) | |
1114 | limit = 12; | |
f3186a9c | 1115 | ac_ptr = kzalloc_node(memsize, gfp, node); |
e498be7d CL |
1116 | if (ac_ptr) { |
1117 | for_each_node(i) { | |
f3186a9c | 1118 | if (i == node || !node_online(i)) |
e498be7d | 1119 | continue; |
83b519e8 | 1120 | ac_ptr[i] = alloc_arraycache(node, limit, 0xbaadf00d, gfp); |
e498be7d | 1121 | if (!ac_ptr[i]) { |
cc550def | 1122 | for (i--; i >= 0; i--) |
e498be7d CL |
1123 | kfree(ac_ptr[i]); |
1124 | kfree(ac_ptr); | |
1125 | return NULL; | |
1126 | } | |
1127 | } | |
1128 | } | |
1129 | return ac_ptr; | |
1130 | } | |
1131 | ||
5295a74c | 1132 | static void free_alien_cache(struct array_cache **ac_ptr) |
e498be7d CL |
1133 | { |
1134 | int i; | |
1135 | ||
1136 | if (!ac_ptr) | |
1137 | return; | |
e498be7d | 1138 | for_each_node(i) |
b28a02de | 1139 | kfree(ac_ptr[i]); |
e498be7d CL |
1140 | kfree(ac_ptr); |
1141 | } | |
1142 | ||
343e0d7a | 1143 | static void __drain_alien_cache(struct kmem_cache *cachep, |
5295a74c | 1144 | struct array_cache *ac, int node) |
e498be7d CL |
1145 | { |
1146 | struct kmem_list3 *rl3 = cachep->nodelists[node]; | |
1147 | ||
1148 | if (ac->avail) { | |
1149 | spin_lock(&rl3->list_lock); | |
e00946fe CL |
1150 | /* |
1151 | * Stuff objects into the remote nodes shared array first. | |
1152 | * That way we could avoid the overhead of putting the objects | |
1153 | * into the free lists and getting them back later. | |
1154 | */ | |
693f7d36 | 1155 | if (rl3->shared) |
1156 | transfer_objects(rl3->shared, ac, ac->limit); | |
e00946fe | 1157 | |
ff69416e | 1158 | free_block(cachep, ac->entry, ac->avail, node); |
e498be7d CL |
1159 | ac->avail = 0; |
1160 | spin_unlock(&rl3->list_lock); | |
1161 | } | |
1162 | } | |
1163 | ||
8fce4d8e CL |
1164 | /* |
1165 | * Called from cache_reap() to regularly drain alien caches round robin. | |
1166 | */ | |
1167 | static void reap_alien(struct kmem_cache *cachep, struct kmem_list3 *l3) | |
1168 | { | |
909ea964 | 1169 | int node = __this_cpu_read(slab_reap_node); |
8fce4d8e CL |
1170 | |
1171 | if (l3->alien) { | |
1172 | struct array_cache *ac = l3->alien[node]; | |
e00946fe CL |
1173 | |
1174 | if (ac && ac->avail && spin_trylock_irq(&ac->lock)) { | |
8fce4d8e CL |
1175 | __drain_alien_cache(cachep, ac, node); |
1176 | spin_unlock_irq(&ac->lock); | |
1177 | } | |
1178 | } | |
1179 | } | |
1180 | ||
a737b3e2 AM |
1181 | static void drain_alien_cache(struct kmem_cache *cachep, |
1182 | struct array_cache **alien) | |
e498be7d | 1183 | { |
b28a02de | 1184 | int i = 0; |
e498be7d CL |
1185 | struct array_cache *ac; |
1186 | unsigned long flags; | |
1187 | ||
1188 | for_each_online_node(i) { | |
4484ebf1 | 1189 | ac = alien[i]; |
e498be7d CL |
1190 | if (ac) { |
1191 | spin_lock_irqsave(&ac->lock, flags); | |
1192 | __drain_alien_cache(cachep, ac, i); | |
1193 | spin_unlock_irqrestore(&ac->lock, flags); | |
1194 | } | |
1195 | } | |
1196 | } | |
729bd0b7 | 1197 | |
873623df | 1198 | static inline int cache_free_alien(struct kmem_cache *cachep, void *objp) |
729bd0b7 PE |
1199 | { |
1200 | struct slab *slabp = virt_to_slab(objp); | |
1201 | int nodeid = slabp->nodeid; | |
1202 | struct kmem_list3 *l3; | |
1203 | struct array_cache *alien = NULL; | |
1ca4cb24 PE |
1204 | int node; |
1205 | ||
7d6e6d09 | 1206 | node = numa_mem_id(); |
729bd0b7 PE |
1207 | |
1208 | /* | |
1209 | * Make sure we are not freeing a object from another node to the array | |
1210 | * cache on this cpu. | |
1211 | */ | |
62918a03 | 1212 | if (likely(slabp->nodeid == node)) |
729bd0b7 PE |
1213 | return 0; |
1214 | ||
1ca4cb24 | 1215 | l3 = cachep->nodelists[node]; |
729bd0b7 PE |
1216 | STATS_INC_NODEFREES(cachep); |
1217 | if (l3->alien && l3->alien[nodeid]) { | |
1218 | alien = l3->alien[nodeid]; | |
873623df | 1219 | spin_lock(&alien->lock); |
729bd0b7 PE |
1220 | if (unlikely(alien->avail == alien->limit)) { |
1221 | STATS_INC_ACOVERFLOW(cachep); | |
1222 | __drain_alien_cache(cachep, alien, nodeid); | |
1223 | } | |
072bb0aa | 1224 | ac_put_obj(cachep, alien, objp); |
729bd0b7 PE |
1225 | spin_unlock(&alien->lock); |
1226 | } else { | |
1227 | spin_lock(&(cachep->nodelists[nodeid])->list_lock); | |
1228 | free_block(cachep, &objp, 1, nodeid); | |
1229 | spin_unlock(&(cachep->nodelists[nodeid])->list_lock); | |
1230 | } | |
1231 | return 1; | |
1232 | } | |
e498be7d CL |
1233 | #endif |
1234 | ||
8f9f8d9e DR |
1235 | /* |
1236 | * Allocates and initializes nodelists for a node on each slab cache, used for | |
1237 | * either memory or cpu hotplug. If memory is being hot-added, the kmem_list3 | |
1238 | * will be allocated off-node since memory is not yet online for the new node. | |
1239 | * When hotplugging memory or a cpu, existing nodelists are not replaced if | |
1240 | * already in use. | |
1241 | * | |
18004c5d | 1242 | * Must hold slab_mutex. |
8f9f8d9e DR |
1243 | */ |
1244 | static int init_cache_nodelists_node(int node) | |
1245 | { | |
1246 | struct kmem_cache *cachep; | |
1247 | struct kmem_list3 *l3; | |
1248 | const int memsize = sizeof(struct kmem_list3); | |
1249 | ||
18004c5d | 1250 | list_for_each_entry(cachep, &slab_caches, list) { |
8f9f8d9e DR |
1251 | /* |
1252 | * Set up the size64 kmemlist for cpu before we can | |
1253 | * begin anything. Make sure some other cpu on this | |
1254 | * node has not already allocated this | |
1255 | */ | |
1256 | if (!cachep->nodelists[node]) { | |
1257 | l3 = kmalloc_node(memsize, GFP_KERNEL, node); | |
1258 | if (!l3) | |
1259 | return -ENOMEM; | |
1260 | kmem_list3_init(l3); | |
1261 | l3->next_reap = jiffies + REAPTIMEOUT_LIST3 + | |
1262 | ((unsigned long)cachep) % REAPTIMEOUT_LIST3; | |
1263 | ||
1264 | /* | |
1265 | * The l3s don't come and go as CPUs come and | |
18004c5d | 1266 | * go. slab_mutex is sufficient |
8f9f8d9e DR |
1267 | * protection here. |
1268 | */ | |
1269 | cachep->nodelists[node] = l3; | |
1270 | } | |
1271 | ||
1272 | spin_lock_irq(&cachep->nodelists[node]->list_lock); | |
1273 | cachep->nodelists[node]->free_limit = | |
1274 | (1 + nr_cpus_node(node)) * | |
1275 | cachep->batchcount + cachep->num; | |
1276 | spin_unlock_irq(&cachep->nodelists[node]->list_lock); | |
1277 | } | |
1278 | return 0; | |
1279 | } | |
1280 | ||
fbf1e473 AM |
1281 | static void __cpuinit cpuup_canceled(long cpu) |
1282 | { | |
1283 | struct kmem_cache *cachep; | |
1284 | struct kmem_list3 *l3 = NULL; | |
7d6e6d09 | 1285 | int node = cpu_to_mem(cpu); |
a70f7302 | 1286 | const struct cpumask *mask = cpumask_of_node(node); |
fbf1e473 | 1287 | |
18004c5d | 1288 | list_for_each_entry(cachep, &slab_caches, list) { |
fbf1e473 AM |
1289 | struct array_cache *nc; |
1290 | struct array_cache *shared; | |
1291 | struct array_cache **alien; | |
fbf1e473 | 1292 | |
fbf1e473 AM |
1293 | /* cpu is dead; no one can alloc from it. */ |
1294 | nc = cachep->array[cpu]; | |
1295 | cachep->array[cpu] = NULL; | |
1296 | l3 = cachep->nodelists[node]; | |
1297 | ||
1298 | if (!l3) | |
1299 | goto free_array_cache; | |
1300 | ||
1301 | spin_lock_irq(&l3->list_lock); | |
1302 | ||
1303 | /* Free limit for this kmem_list3 */ | |
1304 | l3->free_limit -= cachep->batchcount; | |
1305 | if (nc) | |
1306 | free_block(cachep, nc->entry, nc->avail, node); | |
1307 | ||
58463c1f | 1308 | if (!cpumask_empty(mask)) { |
fbf1e473 AM |
1309 | spin_unlock_irq(&l3->list_lock); |
1310 | goto free_array_cache; | |
1311 | } | |
1312 | ||
1313 | shared = l3->shared; | |
1314 | if (shared) { | |
1315 | free_block(cachep, shared->entry, | |
1316 | shared->avail, node); | |
1317 | l3->shared = NULL; | |
1318 | } | |
1319 | ||
1320 | alien = l3->alien; | |
1321 | l3->alien = NULL; | |
1322 | ||
1323 | spin_unlock_irq(&l3->list_lock); | |
1324 | ||
1325 | kfree(shared); | |
1326 | if (alien) { | |
1327 | drain_alien_cache(cachep, alien); | |
1328 | free_alien_cache(alien); | |
1329 | } | |
1330 | free_array_cache: | |
1331 | kfree(nc); | |
1332 | } | |
1333 | /* | |
1334 | * In the previous loop, all the objects were freed to | |
1335 | * the respective cache's slabs, now we can go ahead and | |
1336 | * shrink each nodelist to its limit. | |
1337 | */ | |
18004c5d | 1338 | list_for_each_entry(cachep, &slab_caches, list) { |
fbf1e473 AM |
1339 | l3 = cachep->nodelists[node]; |
1340 | if (!l3) | |
1341 | continue; | |
1342 | drain_freelist(cachep, l3, l3->free_objects); | |
1343 | } | |
1344 | } | |
1345 | ||
1346 | static int __cpuinit cpuup_prepare(long cpu) | |
1da177e4 | 1347 | { |
343e0d7a | 1348 | struct kmem_cache *cachep; |
e498be7d | 1349 | struct kmem_list3 *l3 = NULL; |
7d6e6d09 | 1350 | int node = cpu_to_mem(cpu); |
8f9f8d9e | 1351 | int err; |
1da177e4 | 1352 | |
fbf1e473 AM |
1353 | /* |
1354 | * We need to do this right in the beginning since | |
1355 | * alloc_arraycache's are going to use this list. | |
1356 | * kmalloc_node allows us to add the slab to the right | |
1357 | * kmem_list3 and not this cpu's kmem_list3 | |
1358 | */ | |
8f9f8d9e DR |
1359 | err = init_cache_nodelists_node(node); |
1360 | if (err < 0) | |
1361 | goto bad; | |
fbf1e473 AM |
1362 | |
1363 | /* | |
1364 | * Now we can go ahead with allocating the shared arrays and | |
1365 | * array caches | |
1366 | */ | |
18004c5d | 1367 | list_for_each_entry(cachep, &slab_caches, list) { |
fbf1e473 AM |
1368 | struct array_cache *nc; |
1369 | struct array_cache *shared = NULL; | |
1370 | struct array_cache **alien = NULL; | |
1371 | ||
1372 | nc = alloc_arraycache(node, cachep->limit, | |
83b519e8 | 1373 | cachep->batchcount, GFP_KERNEL); |
fbf1e473 AM |
1374 | if (!nc) |
1375 | goto bad; | |
1376 | if (cachep->shared) { | |
1377 | shared = alloc_arraycache(node, | |
1378 | cachep->shared * cachep->batchcount, | |
83b519e8 | 1379 | 0xbaadf00d, GFP_KERNEL); |
12d00f6a AM |
1380 | if (!shared) { |
1381 | kfree(nc); | |
1da177e4 | 1382 | goto bad; |
12d00f6a | 1383 | } |
fbf1e473 AM |
1384 | } |
1385 | if (use_alien_caches) { | |
83b519e8 | 1386 | alien = alloc_alien_cache(node, cachep->limit, GFP_KERNEL); |
12d00f6a AM |
1387 | if (!alien) { |
1388 | kfree(shared); | |
1389 | kfree(nc); | |
fbf1e473 | 1390 | goto bad; |
12d00f6a | 1391 | } |
fbf1e473 AM |
1392 | } |
1393 | cachep->array[cpu] = nc; | |
1394 | l3 = cachep->nodelists[node]; | |
1395 | BUG_ON(!l3); | |
1396 | ||
1397 | spin_lock_irq(&l3->list_lock); | |
1398 | if (!l3->shared) { | |
1399 | /* | |
1400 | * We are serialised from CPU_DEAD or | |
1401 | * CPU_UP_CANCELLED by the cpucontrol lock | |
1402 | */ | |
1403 | l3->shared = shared; | |
1404 | shared = NULL; | |
1405 | } | |
4484ebf1 | 1406 | #ifdef CONFIG_NUMA |
fbf1e473 AM |
1407 | if (!l3->alien) { |
1408 | l3->alien = alien; | |
1409 | alien = NULL; | |
1da177e4 | 1410 | } |
fbf1e473 AM |
1411 | #endif |
1412 | spin_unlock_irq(&l3->list_lock); | |
1413 | kfree(shared); | |
1414 | free_alien_cache(alien); | |
83835b3d PZ |
1415 | if (cachep->flags & SLAB_DEBUG_OBJECTS) |
1416 | slab_set_debugobj_lock_classes_node(cachep, node); | |
6ccfb5bc GC |
1417 | else if (!OFF_SLAB(cachep) && |
1418 | !(cachep->flags & SLAB_DESTROY_BY_RCU)) | |
1419 | on_slab_lock_classes_node(cachep, node); | |
fbf1e473 | 1420 | } |
ce79ddc8 PE |
1421 | init_node_lock_keys(node); |
1422 | ||
fbf1e473 AM |
1423 | return 0; |
1424 | bad: | |
12d00f6a | 1425 | cpuup_canceled(cpu); |
fbf1e473 AM |
1426 | return -ENOMEM; |
1427 | } | |
1428 | ||
1429 | static int __cpuinit cpuup_callback(struct notifier_block *nfb, | |
1430 | unsigned long action, void *hcpu) | |
1431 | { | |
1432 | long cpu = (long)hcpu; | |
1433 | int err = 0; | |
1434 | ||
1435 | switch (action) { | |
fbf1e473 AM |
1436 | case CPU_UP_PREPARE: |
1437 | case CPU_UP_PREPARE_FROZEN: | |
18004c5d | 1438 | mutex_lock(&slab_mutex); |
fbf1e473 | 1439 | err = cpuup_prepare(cpu); |
18004c5d | 1440 | mutex_unlock(&slab_mutex); |
1da177e4 LT |
1441 | break; |
1442 | case CPU_ONLINE: | |
8bb78442 | 1443 | case CPU_ONLINE_FROZEN: |
1da177e4 LT |
1444 | start_cpu_timer(cpu); |
1445 | break; | |
1446 | #ifdef CONFIG_HOTPLUG_CPU | |
5830c590 | 1447 | case CPU_DOWN_PREPARE: |
8bb78442 | 1448 | case CPU_DOWN_PREPARE_FROZEN: |
5830c590 | 1449 | /* |
18004c5d | 1450 | * Shutdown cache reaper. Note that the slab_mutex is |
5830c590 CL |
1451 | * held so that if cache_reap() is invoked it cannot do |
1452 | * anything expensive but will only modify reap_work | |
1453 | * and reschedule the timer. | |
1454 | */ | |
afe2c511 | 1455 | cancel_delayed_work_sync(&per_cpu(slab_reap_work, cpu)); |
5830c590 | 1456 | /* Now the cache_reaper is guaranteed to be not running. */ |
1871e52c | 1457 | per_cpu(slab_reap_work, cpu).work.func = NULL; |
5830c590 CL |
1458 | break; |
1459 | case CPU_DOWN_FAILED: | |
8bb78442 | 1460 | case CPU_DOWN_FAILED_FROZEN: |
5830c590 CL |
1461 | start_cpu_timer(cpu); |
1462 | break; | |
1da177e4 | 1463 | case CPU_DEAD: |
8bb78442 | 1464 | case CPU_DEAD_FROZEN: |
4484ebf1 RT |
1465 | /* |
1466 | * Even if all the cpus of a node are down, we don't free the | |
1467 | * kmem_list3 of any cache. This to avoid a race between | |
1468 | * cpu_down, and a kmalloc allocation from another cpu for | |
1469 | * memory from the node of the cpu going down. The list3 | |
1470 | * structure is usually allocated from kmem_cache_create() and | |
1471 | * gets destroyed at kmem_cache_destroy(). | |
1472 | */ | |
183ff22b | 1473 | /* fall through */ |
8f5be20b | 1474 | #endif |
1da177e4 | 1475 | case CPU_UP_CANCELED: |
8bb78442 | 1476 | case CPU_UP_CANCELED_FROZEN: |
18004c5d | 1477 | mutex_lock(&slab_mutex); |
fbf1e473 | 1478 | cpuup_canceled(cpu); |
18004c5d | 1479 | mutex_unlock(&slab_mutex); |
1da177e4 | 1480 | break; |
1da177e4 | 1481 | } |
eac40680 | 1482 | return notifier_from_errno(err); |
1da177e4 LT |
1483 | } |
1484 | ||
74b85f37 CS |
1485 | static struct notifier_block __cpuinitdata cpucache_notifier = { |
1486 | &cpuup_callback, NULL, 0 | |
1487 | }; | |
1da177e4 | 1488 | |
8f9f8d9e DR |
1489 | #if defined(CONFIG_NUMA) && defined(CONFIG_MEMORY_HOTPLUG) |
1490 | /* | |
1491 | * Drains freelist for a node on each slab cache, used for memory hot-remove. | |
1492 | * Returns -EBUSY if all objects cannot be drained so that the node is not | |
1493 | * removed. | |
1494 | * | |
18004c5d | 1495 | * Must hold slab_mutex. |
8f9f8d9e DR |
1496 | */ |
1497 | static int __meminit drain_cache_nodelists_node(int node) | |
1498 | { | |
1499 | struct kmem_cache *cachep; | |
1500 | int ret = 0; | |
1501 | ||
18004c5d | 1502 | list_for_each_entry(cachep, &slab_caches, list) { |
8f9f8d9e DR |
1503 | struct kmem_list3 *l3; |
1504 | ||
1505 | l3 = cachep->nodelists[node]; | |
1506 | if (!l3) | |
1507 | continue; | |
1508 | ||
1509 | drain_freelist(cachep, l3, l3->free_objects); | |
1510 | ||
1511 | if (!list_empty(&l3->slabs_full) || | |
1512 | !list_empty(&l3->slabs_partial)) { | |
1513 | ret = -EBUSY; | |
1514 | break; | |
1515 | } | |
1516 | } | |
1517 | return ret; | |
1518 | } | |
1519 | ||
1520 | static int __meminit slab_memory_callback(struct notifier_block *self, | |
1521 | unsigned long action, void *arg) | |
1522 | { | |
1523 | struct memory_notify *mnb = arg; | |
1524 | int ret = 0; | |
1525 | int nid; | |
1526 | ||
1527 | nid = mnb->status_change_nid; | |
1528 | if (nid < 0) | |
1529 | goto out; | |
1530 | ||
1531 | switch (action) { | |
1532 | case MEM_GOING_ONLINE: | |
18004c5d | 1533 | mutex_lock(&slab_mutex); |
8f9f8d9e | 1534 | ret = init_cache_nodelists_node(nid); |
18004c5d | 1535 | mutex_unlock(&slab_mutex); |
8f9f8d9e DR |
1536 | break; |
1537 | case MEM_GOING_OFFLINE: | |
18004c5d | 1538 | mutex_lock(&slab_mutex); |
8f9f8d9e | 1539 | ret = drain_cache_nodelists_node(nid); |
18004c5d | 1540 | mutex_unlock(&slab_mutex); |
8f9f8d9e DR |
1541 | break; |
1542 | case MEM_ONLINE: | |
1543 | case MEM_OFFLINE: | |
1544 | case MEM_CANCEL_ONLINE: | |
1545 | case MEM_CANCEL_OFFLINE: | |
1546 | break; | |
1547 | } | |
1548 | out: | |
5fda1bd5 | 1549 | return notifier_from_errno(ret); |
8f9f8d9e DR |
1550 | } |
1551 | #endif /* CONFIG_NUMA && CONFIG_MEMORY_HOTPLUG */ | |
1552 | ||
e498be7d CL |
1553 | /* |
1554 | * swap the static kmem_list3 with kmalloced memory | |
1555 | */ | |
8f9f8d9e DR |
1556 | static void __init init_list(struct kmem_cache *cachep, struct kmem_list3 *list, |
1557 | int nodeid) | |
e498be7d CL |
1558 | { |
1559 | struct kmem_list3 *ptr; | |
1560 | ||
83b519e8 | 1561 | ptr = kmalloc_node(sizeof(struct kmem_list3), GFP_NOWAIT, nodeid); |
e498be7d CL |
1562 | BUG_ON(!ptr); |
1563 | ||
e498be7d | 1564 | memcpy(ptr, list, sizeof(struct kmem_list3)); |
2b2d5493 IM |
1565 | /* |
1566 | * Do not assume that spinlocks can be initialized via memcpy: | |
1567 | */ | |
1568 | spin_lock_init(&ptr->list_lock); | |
1569 | ||
e498be7d CL |
1570 | MAKE_ALL_LISTS(cachep, ptr, nodeid); |
1571 | cachep->nodelists[nodeid] = ptr; | |
e498be7d CL |
1572 | } |
1573 | ||
556a169d PE |
1574 | /* |
1575 | * For setting up all the kmem_list3s for cache whose buffer_size is same as | |
1576 | * size of kmem_list3. | |
1577 | */ | |
1578 | static void __init set_up_list3s(struct kmem_cache *cachep, int index) | |
1579 | { | |
1580 | int node; | |
1581 | ||
1582 | for_each_online_node(node) { | |
1583 | cachep->nodelists[node] = &initkmem_list3[index + node]; | |
1584 | cachep->nodelists[node]->next_reap = jiffies + | |
1585 | REAPTIMEOUT_LIST3 + | |
1586 | ((unsigned long)cachep) % REAPTIMEOUT_LIST3; | |
1587 | } | |
1588 | } | |
1589 | ||
3c583465 CL |
1590 | /* |
1591 | * The memory after the last cpu cache pointer is used for the | |
1592 | * the nodelists pointer. | |
1593 | */ | |
1594 | static void setup_nodelists_pointer(struct kmem_cache *cachep) | |
1595 | { | |
1596 | cachep->nodelists = (struct kmem_list3 **)&cachep->array[nr_cpu_ids]; | |
1597 | } | |
1598 | ||
a737b3e2 AM |
1599 | /* |
1600 | * Initialisation. Called after the page allocator have been initialised and | |
1601 | * before smp_init(). | |
1da177e4 LT |
1602 | */ |
1603 | void __init kmem_cache_init(void) | |
1604 | { | |
1da177e4 LT |
1605 | struct cache_sizes *sizes; |
1606 | struct cache_names *names; | |
e498be7d CL |
1607 | int i; |
1608 | ||
9b030cb8 | 1609 | kmem_cache = &kmem_cache_boot; |
3c583465 | 1610 | setup_nodelists_pointer(kmem_cache); |
9b030cb8 | 1611 | |
b6e68bc1 | 1612 | if (num_possible_nodes() == 1) |
62918a03 SS |
1613 | use_alien_caches = 0; |
1614 | ||
3c583465 | 1615 | for (i = 0; i < NUM_INIT_LISTS; i++) |
e498be7d | 1616 | kmem_list3_init(&initkmem_list3[i]); |
3c583465 | 1617 | |
9b030cb8 | 1618 | set_up_list3s(kmem_cache, CACHE_CACHE); |
1da177e4 LT |
1619 | |
1620 | /* | |
1621 | * Fragmentation resistance on low memory - only use bigger | |
3df1cccd DR |
1622 | * page orders on machines with more than 32MB of memory if |
1623 | * not overridden on the command line. | |
1da177e4 | 1624 | */ |
3df1cccd | 1625 | if (!slab_max_order_set && totalram_pages > (32 << 20) >> PAGE_SHIFT) |
543585cc | 1626 | slab_max_order = SLAB_MAX_ORDER_HI; |
1da177e4 | 1627 | |
1da177e4 LT |
1628 | /* Bootstrap is tricky, because several objects are allocated |
1629 | * from caches that do not exist yet: | |
9b030cb8 CL |
1630 | * 1) initialize the kmem_cache cache: it contains the struct |
1631 | * kmem_cache structures of all caches, except kmem_cache itself: | |
1632 | * kmem_cache is statically allocated. | |
e498be7d CL |
1633 | * Initially an __init data area is used for the head array and the |
1634 | * kmem_list3 structures, it's replaced with a kmalloc allocated | |
1635 | * array at the end of the bootstrap. | |
1da177e4 | 1636 | * 2) Create the first kmalloc cache. |
343e0d7a | 1637 | * The struct kmem_cache for the new cache is allocated normally. |
e498be7d CL |
1638 | * An __init data area is used for the head array. |
1639 | * 3) Create the remaining kmalloc caches, with minimally sized | |
1640 | * head arrays. | |
9b030cb8 | 1641 | * 4) Replace the __init data head arrays for kmem_cache and the first |
1da177e4 | 1642 | * kmalloc cache with kmalloc allocated arrays. |
9b030cb8 | 1643 | * 5) Replace the __init data for kmem_list3 for kmem_cache and |
e498be7d CL |
1644 | * the other cache's with kmalloc allocated memory. |
1645 | * 6) Resize the head arrays of the kmalloc caches to their final sizes. | |
1da177e4 LT |
1646 | */ |
1647 | ||
9b030cb8 | 1648 | /* 1) create the kmem_cache */ |
1da177e4 | 1649 | |
8da3430d | 1650 | /* |
b56efcf0 | 1651 | * struct kmem_cache size depends on nr_node_ids & nr_cpu_ids |
8da3430d | 1652 | */ |
2f9baa9f CL |
1653 | create_boot_cache(kmem_cache, "kmem_cache", |
1654 | offsetof(struct kmem_cache, array[nr_cpu_ids]) + | |
1655 | nr_node_ids * sizeof(struct kmem_list3 *), | |
1656 | SLAB_HWCACHE_ALIGN); | |
1657 | list_add(&kmem_cache->list, &slab_caches); | |
1da177e4 LT |
1658 | |
1659 | /* 2+3) create the kmalloc caches */ | |
1660 | sizes = malloc_sizes; | |
1661 | names = cache_names; | |
1662 | ||
a737b3e2 AM |
1663 | /* |
1664 | * Initialize the caches that provide memory for the array cache and the | |
1665 | * kmem_list3 structures first. Without this, further allocations will | |
1666 | * bug. | |
e498be7d CL |
1667 | */ |
1668 | ||
45530c44 CL |
1669 | sizes[INDEX_AC].cs_cachep = create_kmalloc_cache(names[INDEX_AC].name, |
1670 | sizes[INDEX_AC].cs_size, ARCH_KMALLOC_FLAGS); | |
1671 | ||
1672 | if (INDEX_AC != INDEX_L3) | |
1673 | sizes[INDEX_L3].cs_cachep = | |
1674 | create_kmalloc_cache(names[INDEX_L3].name, | |
1675 | sizes[INDEX_L3].cs_size, ARCH_KMALLOC_FLAGS); | |
e498be7d | 1676 | |
e0a42726 IM |
1677 | slab_early_init = 0; |
1678 | ||
1da177e4 | 1679 | while (sizes->cs_size != ULONG_MAX) { |
e498be7d CL |
1680 | /* |
1681 | * For performance, all the general caches are L1 aligned. | |
1da177e4 LT |
1682 | * This should be particularly beneficial on SMP boxes, as it |
1683 | * eliminates "false sharing". | |
1684 | * Note for systems short on memory removing the alignment will | |
e498be7d CL |
1685 | * allow tighter packing of the smaller caches. |
1686 | */ | |
45530c44 CL |
1687 | if (!sizes->cs_cachep) |
1688 | sizes->cs_cachep = create_kmalloc_cache(names->name, | |
1689 | sizes->cs_size, ARCH_KMALLOC_FLAGS); | |
1690 | ||
4b51d669 | 1691 | #ifdef CONFIG_ZONE_DMA |
45530c44 CL |
1692 | sizes->cs_dmacachep = create_kmalloc_cache( |
1693 | names->name_dma, sizes->cs_size, | |
1694 | SLAB_CACHE_DMA|ARCH_KMALLOC_FLAGS); | |
4b51d669 | 1695 | #endif |
1da177e4 LT |
1696 | sizes++; |
1697 | names++; | |
1698 | } | |
1699 | /* 4) Replace the bootstrap head arrays */ | |
1700 | { | |
2b2d5493 | 1701 | struct array_cache *ptr; |
e498be7d | 1702 | |
83b519e8 | 1703 | ptr = kmalloc(sizeof(struct arraycache_init), GFP_NOWAIT); |
e498be7d | 1704 | |
9b030cb8 | 1705 | memcpy(ptr, cpu_cache_get(kmem_cache), |
b28a02de | 1706 | sizeof(struct arraycache_init)); |
2b2d5493 IM |
1707 | /* |
1708 | * Do not assume that spinlocks can be initialized via memcpy: | |
1709 | */ | |
1710 | spin_lock_init(&ptr->lock); | |
1711 | ||
9b030cb8 | 1712 | kmem_cache->array[smp_processor_id()] = ptr; |
e498be7d | 1713 | |
83b519e8 | 1714 | ptr = kmalloc(sizeof(struct arraycache_init), GFP_NOWAIT); |
e498be7d | 1715 | |
9a2dba4b | 1716 | BUG_ON(cpu_cache_get(malloc_sizes[INDEX_AC].cs_cachep) |
b28a02de | 1717 | != &initarray_generic.cache); |
9a2dba4b | 1718 | memcpy(ptr, cpu_cache_get(malloc_sizes[INDEX_AC].cs_cachep), |
b28a02de | 1719 | sizeof(struct arraycache_init)); |
2b2d5493 IM |
1720 | /* |
1721 | * Do not assume that spinlocks can be initialized via memcpy: | |
1722 | */ | |
1723 | spin_lock_init(&ptr->lock); | |
1724 | ||
e498be7d | 1725 | malloc_sizes[INDEX_AC].cs_cachep->array[smp_processor_id()] = |
b28a02de | 1726 | ptr; |
1da177e4 | 1727 | } |
e498be7d CL |
1728 | /* 5) Replace the bootstrap kmem_list3's */ |
1729 | { | |
1ca4cb24 PE |
1730 | int nid; |
1731 | ||
9c09a95c | 1732 | for_each_online_node(nid) { |
9b030cb8 | 1733 | init_list(kmem_cache, &initkmem_list3[CACHE_CACHE + nid], nid); |
556a169d | 1734 | |
e498be7d | 1735 | init_list(malloc_sizes[INDEX_AC].cs_cachep, |
1ca4cb24 | 1736 | &initkmem_list3[SIZE_AC + nid], nid); |
e498be7d CL |
1737 | |
1738 | if (INDEX_AC != INDEX_L3) { | |
1739 | init_list(malloc_sizes[INDEX_L3].cs_cachep, | |
1ca4cb24 | 1740 | &initkmem_list3[SIZE_L3 + nid], nid); |
e498be7d CL |
1741 | } |
1742 | } | |
1743 | } | |
1da177e4 | 1744 | |
97d06609 | 1745 | slab_state = UP; |
8429db5c PE |
1746 | } |
1747 | ||
1748 | void __init kmem_cache_init_late(void) | |
1749 | { | |
1750 | struct kmem_cache *cachep; | |
1751 | ||
97d06609 | 1752 | slab_state = UP; |
52cef189 | 1753 | |
8429db5c | 1754 | /* 6) resize the head arrays to their final sizes */ |
18004c5d CL |
1755 | mutex_lock(&slab_mutex); |
1756 | list_for_each_entry(cachep, &slab_caches, list) | |
8429db5c PE |
1757 | if (enable_cpucache(cachep, GFP_NOWAIT)) |
1758 | BUG(); | |
18004c5d | 1759 | mutex_unlock(&slab_mutex); |
056c6241 | 1760 | |
947ca185 MW |
1761 | /* Annotate slab for lockdep -- annotate the malloc caches */ |
1762 | init_lock_keys(); | |
1763 | ||
97d06609 CL |
1764 | /* Done! */ |
1765 | slab_state = FULL; | |
1766 | ||
a737b3e2 AM |
1767 | /* |
1768 | * Register a cpu startup notifier callback that initializes | |
1769 | * cpu_cache_get for all new cpus | |
1da177e4 LT |
1770 | */ |
1771 | register_cpu_notifier(&cpucache_notifier); | |
1da177e4 | 1772 | |
8f9f8d9e DR |
1773 | #ifdef CONFIG_NUMA |
1774 | /* | |
1775 | * Register a memory hotplug callback that initializes and frees | |
1776 | * nodelists. | |
1777 | */ | |
1778 | hotplug_memory_notifier(slab_memory_callback, SLAB_CALLBACK_PRI); | |
1779 | #endif | |
1780 | ||
a737b3e2 AM |
1781 | /* |
1782 | * The reap timers are started later, with a module init call: That part | |
1783 | * of the kernel is not yet operational. | |
1da177e4 LT |
1784 | */ |
1785 | } | |
1786 | ||
1787 | static int __init cpucache_init(void) | |
1788 | { | |
1789 | int cpu; | |
1790 | ||
a737b3e2 AM |
1791 | /* |
1792 | * Register the timers that return unneeded pages to the page allocator | |
1da177e4 | 1793 | */ |
e498be7d | 1794 | for_each_online_cpu(cpu) |
a737b3e2 | 1795 | start_cpu_timer(cpu); |
a164f896 GC |
1796 | |
1797 | /* Done! */ | |
97d06609 | 1798 | slab_state = FULL; |
1da177e4 LT |
1799 | return 0; |
1800 | } | |
1da177e4 LT |
1801 | __initcall(cpucache_init); |
1802 | ||
8bdec192 RA |
1803 | static noinline void |
1804 | slab_out_of_memory(struct kmem_cache *cachep, gfp_t gfpflags, int nodeid) | |
1805 | { | |
1806 | struct kmem_list3 *l3; | |
1807 | struct slab *slabp; | |
1808 | unsigned long flags; | |
1809 | int node; | |
1810 | ||
1811 | printk(KERN_WARNING | |
1812 | "SLAB: Unable to allocate memory on node %d (gfp=0x%x)\n", | |
1813 | nodeid, gfpflags); | |
1814 | printk(KERN_WARNING " cache: %s, object size: %d, order: %d\n", | |
3b0efdfa | 1815 | cachep->name, cachep->size, cachep->gfporder); |
8bdec192 RA |
1816 | |
1817 | for_each_online_node(node) { | |
1818 | unsigned long active_objs = 0, num_objs = 0, free_objects = 0; | |
1819 | unsigned long active_slabs = 0, num_slabs = 0; | |
1820 | ||
1821 | l3 = cachep->nodelists[node]; | |
1822 | if (!l3) | |
1823 | continue; | |
1824 | ||
1825 | spin_lock_irqsave(&l3->list_lock, flags); | |
1826 | list_for_each_entry(slabp, &l3->slabs_full, list) { | |
1827 | active_objs += cachep->num; | |
1828 | active_slabs++; | |
1829 | } | |
1830 | list_for_each_entry(slabp, &l3->slabs_partial, list) { | |
1831 | active_objs += slabp->inuse; | |
1832 | active_slabs++; | |
1833 | } | |
1834 | list_for_each_entry(slabp, &l3->slabs_free, list) | |
1835 | num_slabs++; | |
1836 | ||
1837 | free_objects += l3->free_objects; | |
1838 | spin_unlock_irqrestore(&l3->list_lock, flags); | |
1839 | ||
1840 | num_slabs += active_slabs; | |
1841 | num_objs = num_slabs * cachep->num; | |
1842 | printk(KERN_WARNING | |
1843 | " node %d: slabs: %ld/%ld, objs: %ld/%ld, free: %ld\n", | |
1844 | node, active_slabs, num_slabs, active_objs, num_objs, | |
1845 | free_objects); | |
1846 | } | |
1847 | } | |
1848 | ||
1da177e4 LT |
1849 | /* |
1850 | * Interface to system's page allocator. No need to hold the cache-lock. | |
1851 | * | |
1852 | * If we requested dmaable memory, we will get it. Even if we | |
1853 | * did not request dmaable memory, we might get it, but that | |
1854 | * would be relatively rare and ignorable. | |
1855 | */ | |
343e0d7a | 1856 | static void *kmem_getpages(struct kmem_cache *cachep, gfp_t flags, int nodeid) |
1da177e4 LT |
1857 | { |
1858 | struct page *page; | |
e1b6aa6f | 1859 | int nr_pages; |
1da177e4 LT |
1860 | int i; |
1861 | ||
d6fef9da | 1862 | #ifndef CONFIG_MMU |
e1b6aa6f CH |
1863 | /* |
1864 | * Nommu uses slab's for process anonymous memory allocations, and thus | |
1865 | * requires __GFP_COMP to properly refcount higher order allocations | |
d6fef9da | 1866 | */ |
e1b6aa6f | 1867 | flags |= __GFP_COMP; |
d6fef9da | 1868 | #endif |
765c4507 | 1869 | |
a618e89f | 1870 | flags |= cachep->allocflags; |
e12ba74d MG |
1871 | if (cachep->flags & SLAB_RECLAIM_ACCOUNT) |
1872 | flags |= __GFP_RECLAIMABLE; | |
e1b6aa6f | 1873 | |
517d0869 | 1874 | page = alloc_pages_exact_node(nodeid, flags | __GFP_NOTRACK, cachep->gfporder); |
8bdec192 RA |
1875 | if (!page) { |
1876 | if (!(flags & __GFP_NOWARN) && printk_ratelimit()) | |
1877 | slab_out_of_memory(cachep, flags, nodeid); | |
1da177e4 | 1878 | return NULL; |
8bdec192 | 1879 | } |
1da177e4 | 1880 | |
b37f1dd0 | 1881 | /* Record if ALLOC_NO_WATERMARKS was set when allocating the slab */ |
072bb0aa MG |
1882 | if (unlikely(page->pfmemalloc)) |
1883 | pfmemalloc_active = true; | |
1884 | ||
e1b6aa6f | 1885 | nr_pages = (1 << cachep->gfporder); |
1da177e4 | 1886 | if (cachep->flags & SLAB_RECLAIM_ACCOUNT) |
972d1a7b CL |
1887 | add_zone_page_state(page_zone(page), |
1888 | NR_SLAB_RECLAIMABLE, nr_pages); | |
1889 | else | |
1890 | add_zone_page_state(page_zone(page), | |
1891 | NR_SLAB_UNRECLAIMABLE, nr_pages); | |
072bb0aa | 1892 | for (i = 0; i < nr_pages; i++) { |
e1b6aa6f | 1893 | __SetPageSlab(page + i); |
c175eea4 | 1894 | |
072bb0aa MG |
1895 | if (page->pfmemalloc) |
1896 | SetPageSlabPfmemalloc(page + i); | |
1897 | } | |
1898 | ||
b1eeab67 VN |
1899 | if (kmemcheck_enabled && !(cachep->flags & SLAB_NOTRACK)) { |
1900 | kmemcheck_alloc_shadow(page, cachep->gfporder, flags, nodeid); | |
1901 | ||
1902 | if (cachep->ctor) | |
1903 | kmemcheck_mark_uninitialized_pages(page, nr_pages); | |
1904 | else | |
1905 | kmemcheck_mark_unallocated_pages(page, nr_pages); | |
1906 | } | |
c175eea4 | 1907 | |
e1b6aa6f | 1908 | return page_address(page); |
1da177e4 LT |
1909 | } |
1910 | ||
1911 | /* | |
1912 | * Interface to system's page release. | |
1913 | */ | |
343e0d7a | 1914 | static void kmem_freepages(struct kmem_cache *cachep, void *addr) |
1da177e4 | 1915 | { |
b28a02de | 1916 | unsigned long i = (1 << cachep->gfporder); |
1da177e4 LT |
1917 | struct page *page = virt_to_page(addr); |
1918 | const unsigned long nr_freed = i; | |
1919 | ||
b1eeab67 | 1920 | kmemcheck_free_shadow(page, cachep->gfporder); |
c175eea4 | 1921 | |
972d1a7b CL |
1922 | if (cachep->flags & SLAB_RECLAIM_ACCOUNT) |
1923 | sub_zone_page_state(page_zone(page), | |
1924 | NR_SLAB_RECLAIMABLE, nr_freed); | |
1925 | else | |
1926 | sub_zone_page_state(page_zone(page), | |
1927 | NR_SLAB_UNRECLAIMABLE, nr_freed); | |
1da177e4 | 1928 | while (i--) { |
f205b2fe | 1929 | BUG_ON(!PageSlab(page)); |
072bb0aa | 1930 | __ClearPageSlabPfmemalloc(page); |
f205b2fe | 1931 | __ClearPageSlab(page); |
1da177e4 LT |
1932 | page++; |
1933 | } | |
1da177e4 LT |
1934 | if (current->reclaim_state) |
1935 | current->reclaim_state->reclaimed_slab += nr_freed; | |
d79923fa | 1936 | free_memcg_kmem_pages((unsigned long)addr, cachep->gfporder); |
1da177e4 LT |
1937 | } |
1938 | ||
1939 | static void kmem_rcu_free(struct rcu_head *head) | |
1940 | { | |
b28a02de | 1941 | struct slab_rcu *slab_rcu = (struct slab_rcu *)head; |
343e0d7a | 1942 | struct kmem_cache *cachep = slab_rcu->cachep; |
1da177e4 LT |
1943 | |
1944 | kmem_freepages(cachep, slab_rcu->addr); | |
1945 | if (OFF_SLAB(cachep)) | |
1946 | kmem_cache_free(cachep->slabp_cache, slab_rcu); | |
1947 | } | |
1948 | ||
1949 | #if DEBUG | |
1950 | ||
1951 | #ifdef CONFIG_DEBUG_PAGEALLOC | |
343e0d7a | 1952 | static void store_stackinfo(struct kmem_cache *cachep, unsigned long *addr, |
b28a02de | 1953 | unsigned long caller) |
1da177e4 | 1954 | { |
8c138bc0 | 1955 | int size = cachep->object_size; |
1da177e4 | 1956 | |
3dafccf2 | 1957 | addr = (unsigned long *)&((char *)addr)[obj_offset(cachep)]; |
1da177e4 | 1958 | |
b28a02de | 1959 | if (size < 5 * sizeof(unsigned long)) |
1da177e4 LT |
1960 | return; |
1961 | ||
b28a02de PE |
1962 | *addr++ = 0x12345678; |
1963 | *addr++ = caller; | |
1964 | *addr++ = smp_processor_id(); | |
1965 | size -= 3 * sizeof(unsigned long); | |
1da177e4 LT |
1966 | { |
1967 | unsigned long *sptr = &caller; | |
1968 | unsigned long svalue; | |
1969 | ||
1970 | while (!kstack_end(sptr)) { | |
1971 | svalue = *sptr++; | |
1972 | if (kernel_text_address(svalue)) { | |
b28a02de | 1973 | *addr++ = svalue; |
1da177e4 LT |
1974 | size -= sizeof(unsigned long); |
1975 | if (size <= sizeof(unsigned long)) | |
1976 | break; | |
1977 | } | |
1978 | } | |
1979 | ||
1980 | } | |
b28a02de | 1981 | *addr++ = 0x87654321; |
1da177e4 LT |
1982 | } |
1983 | #endif | |
1984 | ||
343e0d7a | 1985 | static void poison_obj(struct kmem_cache *cachep, void *addr, unsigned char val) |
1da177e4 | 1986 | { |
8c138bc0 | 1987 | int size = cachep->object_size; |
3dafccf2 | 1988 | addr = &((char *)addr)[obj_offset(cachep)]; |
1da177e4 LT |
1989 | |
1990 | memset(addr, val, size); | |
b28a02de | 1991 | *(unsigned char *)(addr + size - 1) = POISON_END; |
1da177e4 LT |
1992 | } |
1993 | ||
1994 | static void dump_line(char *data, int offset, int limit) | |
1995 | { | |
1996 | int i; | |
aa83aa40 DJ |
1997 | unsigned char error = 0; |
1998 | int bad_count = 0; | |
1999 | ||
fdde6abb | 2000 | printk(KERN_ERR "%03x: ", offset); |
aa83aa40 DJ |
2001 | for (i = 0; i < limit; i++) { |
2002 | if (data[offset + i] != POISON_FREE) { | |
2003 | error = data[offset + i]; | |
2004 | bad_count++; | |
2005 | } | |
aa83aa40 | 2006 | } |
fdde6abb SAS |
2007 | print_hex_dump(KERN_CONT, "", 0, 16, 1, |
2008 | &data[offset], limit, 1); | |
aa83aa40 DJ |
2009 | |
2010 | if (bad_count == 1) { | |
2011 | error ^= POISON_FREE; | |
2012 | if (!(error & (error - 1))) { | |
2013 | printk(KERN_ERR "Single bit error detected. Probably " | |
2014 | "bad RAM.\n"); | |
2015 | #ifdef CONFIG_X86 | |
2016 | printk(KERN_ERR "Run memtest86+ or a similar memory " | |
2017 | "test tool.\n"); | |
2018 | #else | |
2019 | printk(KERN_ERR "Run a memory test tool.\n"); | |
2020 | #endif | |
2021 | } | |
2022 | } | |
1da177e4 LT |
2023 | } |
2024 | #endif | |
2025 | ||
2026 | #if DEBUG | |
2027 | ||
343e0d7a | 2028 | static void print_objinfo(struct kmem_cache *cachep, void *objp, int lines) |
1da177e4 LT |
2029 | { |
2030 | int i, size; | |
2031 | char *realobj; | |
2032 | ||
2033 | if (cachep->flags & SLAB_RED_ZONE) { | |
b46b8f19 | 2034 | printk(KERN_ERR "Redzone: 0x%llx/0x%llx.\n", |
a737b3e2 AM |
2035 | *dbg_redzone1(cachep, objp), |
2036 | *dbg_redzone2(cachep, objp)); | |
1da177e4 LT |
2037 | } |
2038 | ||
2039 | if (cachep->flags & SLAB_STORE_USER) { | |
2040 | printk(KERN_ERR "Last user: [<%p>]", | |
a737b3e2 | 2041 | *dbg_userword(cachep, objp)); |
1da177e4 | 2042 | print_symbol("(%s)", |
a737b3e2 | 2043 | (unsigned long)*dbg_userword(cachep, objp)); |
1da177e4 LT |
2044 | printk("\n"); |
2045 | } | |
3dafccf2 | 2046 | realobj = (char *)objp + obj_offset(cachep); |
8c138bc0 | 2047 | size = cachep->object_size; |
b28a02de | 2048 | for (i = 0; i < size && lines; i += 16, lines--) { |
1da177e4 LT |
2049 | int limit; |
2050 | limit = 16; | |
b28a02de PE |
2051 | if (i + limit > size) |
2052 | limit = size - i; | |
1da177e4 LT |
2053 | dump_line(realobj, i, limit); |
2054 | } | |
2055 | } | |
2056 | ||
343e0d7a | 2057 | static void check_poison_obj(struct kmem_cache *cachep, void *objp) |
1da177e4 LT |
2058 | { |
2059 | char *realobj; | |
2060 | int size, i; | |
2061 | int lines = 0; | |
2062 | ||
3dafccf2 | 2063 | realobj = (char *)objp + obj_offset(cachep); |
8c138bc0 | 2064 | size = cachep->object_size; |
1da177e4 | 2065 | |
b28a02de | 2066 | for (i = 0; i < size; i++) { |
1da177e4 | 2067 | char exp = POISON_FREE; |
b28a02de | 2068 | if (i == size - 1) |
1da177e4 LT |
2069 | exp = POISON_END; |
2070 | if (realobj[i] != exp) { | |
2071 | int limit; | |
2072 | /* Mismatch ! */ | |
2073 | /* Print header */ | |
2074 | if (lines == 0) { | |
b28a02de | 2075 | printk(KERN_ERR |
face37f5 DJ |
2076 | "Slab corruption (%s): %s start=%p, len=%d\n", |
2077 | print_tainted(), cachep->name, realobj, size); | |
1da177e4 LT |
2078 | print_objinfo(cachep, objp, 0); |
2079 | } | |
2080 | /* Hexdump the affected line */ | |
b28a02de | 2081 | i = (i / 16) * 16; |
1da177e4 | 2082 | limit = 16; |
b28a02de PE |
2083 | if (i + limit > size) |
2084 | limit = size - i; | |
1da177e4 LT |
2085 | dump_line(realobj, i, limit); |
2086 | i += 16; | |
2087 | lines++; | |
2088 | /* Limit to 5 lines */ | |
2089 | if (lines > 5) | |
2090 | break; | |
2091 | } | |
2092 | } | |
2093 | if (lines != 0) { | |
2094 | /* Print some data about the neighboring objects, if they | |
2095 | * exist: | |
2096 | */ | |
6ed5eb22 | 2097 | struct slab *slabp = virt_to_slab(objp); |
8fea4e96 | 2098 | unsigned int objnr; |
1da177e4 | 2099 | |
8fea4e96 | 2100 | objnr = obj_to_index(cachep, slabp, objp); |
1da177e4 | 2101 | if (objnr) { |
8fea4e96 | 2102 | objp = index_to_obj(cachep, slabp, objnr - 1); |
3dafccf2 | 2103 | realobj = (char *)objp + obj_offset(cachep); |
1da177e4 | 2104 | printk(KERN_ERR "Prev obj: start=%p, len=%d\n", |
b28a02de | 2105 | realobj, size); |
1da177e4 LT |
2106 | print_objinfo(cachep, objp, 2); |
2107 | } | |
b28a02de | 2108 | if (objnr + 1 < cachep->num) { |
8fea4e96 | 2109 | objp = index_to_obj(cachep, slabp, objnr + 1); |
3dafccf2 | 2110 | realobj = (char *)objp + obj_offset(cachep); |
1da177e4 | 2111 | printk(KERN_ERR "Next obj: start=%p, len=%d\n", |
b28a02de | 2112 | realobj, size); |
1da177e4 LT |
2113 | print_objinfo(cachep, objp, 2); |
2114 | } | |
2115 | } | |
2116 | } | |
2117 | #endif | |
2118 | ||
12dd36fa | 2119 | #if DEBUG |
e79aec29 | 2120 | static void slab_destroy_debugcheck(struct kmem_cache *cachep, struct slab *slabp) |
1da177e4 | 2121 | { |
1da177e4 LT |
2122 | int i; |
2123 | for (i = 0; i < cachep->num; i++) { | |
8fea4e96 | 2124 | void *objp = index_to_obj(cachep, slabp, i); |
1da177e4 LT |
2125 | |
2126 | if (cachep->flags & SLAB_POISON) { | |
2127 | #ifdef CONFIG_DEBUG_PAGEALLOC | |
3b0efdfa | 2128 | if (cachep->size % PAGE_SIZE == 0 && |
a737b3e2 | 2129 | OFF_SLAB(cachep)) |
b28a02de | 2130 | kernel_map_pages(virt_to_page(objp), |
3b0efdfa | 2131 | cachep->size / PAGE_SIZE, 1); |
1da177e4 LT |
2132 | else |
2133 | check_poison_obj(cachep, objp); | |
2134 | #else | |
2135 | check_poison_obj(cachep, objp); | |
2136 | #endif | |
2137 | } | |
2138 | if (cachep->flags & SLAB_RED_ZONE) { | |
2139 | if (*dbg_redzone1(cachep, objp) != RED_INACTIVE) | |
2140 | slab_error(cachep, "start of a freed object " | |
b28a02de | 2141 | "was overwritten"); |
1da177e4 LT |
2142 | if (*dbg_redzone2(cachep, objp) != RED_INACTIVE) |
2143 | slab_error(cachep, "end of a freed object " | |
b28a02de | 2144 | "was overwritten"); |
1da177e4 | 2145 | } |
1da177e4 | 2146 | } |
12dd36fa | 2147 | } |
1da177e4 | 2148 | #else |
e79aec29 | 2149 | static void slab_destroy_debugcheck(struct kmem_cache *cachep, struct slab *slabp) |
12dd36fa | 2150 | { |
12dd36fa | 2151 | } |
1da177e4 LT |
2152 | #endif |
2153 | ||
911851e6 RD |
2154 | /** |
2155 | * slab_destroy - destroy and release all objects in a slab | |
2156 | * @cachep: cache pointer being destroyed | |
2157 | * @slabp: slab pointer being destroyed | |
2158 | * | |
12dd36fa | 2159 | * Destroy all the objs in a slab, and release the mem back to the system. |
a737b3e2 AM |
2160 | * Before calling the slab must have been unlinked from the cache. The |
2161 | * cache-lock is not held/needed. | |
12dd36fa | 2162 | */ |
343e0d7a | 2163 | static void slab_destroy(struct kmem_cache *cachep, struct slab *slabp) |
12dd36fa MD |
2164 | { |
2165 | void *addr = slabp->s_mem - slabp->colouroff; | |
2166 | ||
e79aec29 | 2167 | slab_destroy_debugcheck(cachep, slabp); |
1da177e4 LT |
2168 | if (unlikely(cachep->flags & SLAB_DESTROY_BY_RCU)) { |
2169 | struct slab_rcu *slab_rcu; | |
2170 | ||
b28a02de | 2171 | slab_rcu = (struct slab_rcu *)slabp; |
1da177e4 LT |
2172 | slab_rcu->cachep = cachep; |
2173 | slab_rcu->addr = addr; | |
2174 | call_rcu(&slab_rcu->head, kmem_rcu_free); | |
2175 | } else { | |
2176 | kmem_freepages(cachep, addr); | |
873623df IM |
2177 | if (OFF_SLAB(cachep)) |
2178 | kmem_cache_free(cachep->slabp_cache, slabp); | |
1da177e4 LT |
2179 | } |
2180 | } | |
2181 | ||
4d268eba | 2182 | /** |
a70773dd RD |
2183 | * calculate_slab_order - calculate size (page order) of slabs |
2184 | * @cachep: pointer to the cache that is being created | |
2185 | * @size: size of objects to be created in this cache. | |
2186 | * @align: required alignment for the objects. | |
2187 | * @flags: slab allocation flags | |
2188 | * | |
2189 | * Also calculates the number of objects per slab. | |
4d268eba PE |
2190 | * |
2191 | * This could be made much more intelligent. For now, try to avoid using | |
2192 | * high order pages for slabs. When the gfp() functions are more friendly | |
2193 | * towards high-order requests, this should be changed. | |
2194 | */ | |
a737b3e2 | 2195 | static size_t calculate_slab_order(struct kmem_cache *cachep, |
ee13d785 | 2196 | size_t size, size_t align, unsigned long flags) |
4d268eba | 2197 | { |
b1ab41c4 | 2198 | unsigned long offslab_limit; |
4d268eba | 2199 | size_t left_over = 0; |
9888e6fa | 2200 | int gfporder; |
4d268eba | 2201 | |
0aa817f0 | 2202 | for (gfporder = 0; gfporder <= KMALLOC_MAX_ORDER; gfporder++) { |
4d268eba PE |
2203 | unsigned int num; |
2204 | size_t remainder; | |
2205 | ||
9888e6fa | 2206 | cache_estimate(gfporder, size, align, flags, &remainder, &num); |
4d268eba PE |
2207 | if (!num) |
2208 | continue; | |
9888e6fa | 2209 | |
b1ab41c4 IM |
2210 | if (flags & CFLGS_OFF_SLAB) { |
2211 | /* | |
2212 | * Max number of objs-per-slab for caches which | |
2213 | * use off-slab slabs. Needed to avoid a possible | |
2214 | * looping condition in cache_grow(). | |
2215 | */ | |
2216 | offslab_limit = size - sizeof(struct slab); | |
2217 | offslab_limit /= sizeof(kmem_bufctl_t); | |
2218 | ||
2219 | if (num > offslab_limit) | |
2220 | break; | |
2221 | } | |
4d268eba | 2222 | |
9888e6fa | 2223 | /* Found something acceptable - save it away */ |
4d268eba | 2224 | cachep->num = num; |
9888e6fa | 2225 | cachep->gfporder = gfporder; |
4d268eba PE |
2226 | left_over = remainder; |
2227 | ||
f78bb8ad LT |
2228 | /* |
2229 | * A VFS-reclaimable slab tends to have most allocations | |
2230 | * as GFP_NOFS and we really don't want to have to be allocating | |
2231 | * higher-order pages when we are unable to shrink dcache. | |
2232 | */ | |
2233 | if (flags & SLAB_RECLAIM_ACCOUNT) | |
2234 | break; | |
2235 | ||
4d268eba PE |
2236 | /* |
2237 | * Large number of objects is good, but very large slabs are | |
2238 | * currently bad for the gfp()s. | |
2239 | */ | |
543585cc | 2240 | if (gfporder >= slab_max_order) |
4d268eba PE |
2241 | break; |
2242 | ||
9888e6fa LT |
2243 | /* |
2244 | * Acceptable internal fragmentation? | |
2245 | */ | |
a737b3e2 | 2246 | if (left_over * 8 <= (PAGE_SIZE << gfporder)) |
4d268eba PE |
2247 | break; |
2248 | } | |
2249 | return left_over; | |
2250 | } | |
2251 | ||
83b519e8 | 2252 | static int __init_refok setup_cpu_cache(struct kmem_cache *cachep, gfp_t gfp) |
f30cf7d1 | 2253 | { |
97d06609 | 2254 | if (slab_state >= FULL) |
83b519e8 | 2255 | return enable_cpucache(cachep, gfp); |
2ed3a4ef | 2256 | |
97d06609 | 2257 | if (slab_state == DOWN) { |
f30cf7d1 | 2258 | /* |
2f9baa9f CL |
2259 | * Note: Creation of first cache (kmem_cache). |
2260 | * The setup_list3s is taken care | |
2261 | * of by the caller of __kmem_cache_create | |
2262 | */ | |
2263 | cachep->array[smp_processor_id()] = &initarray_generic.cache; | |
2264 | slab_state = PARTIAL; | |
2265 | } else if (slab_state == PARTIAL) { | |
2266 | /* | |
2267 | * Note: the second kmem_cache_create must create the cache | |
f30cf7d1 PE |
2268 | * that's used by kmalloc(24), otherwise the creation of |
2269 | * further caches will BUG(). | |
2270 | */ | |
2271 | cachep->array[smp_processor_id()] = &initarray_generic.cache; | |
2272 | ||
2273 | /* | |
2274 | * If the cache that's used by kmalloc(sizeof(kmem_list3)) is | |
2f9baa9f | 2275 | * the second cache, then we need to set up all its list3s, |
f30cf7d1 PE |
2276 | * otherwise the creation of further caches will BUG(). |
2277 | */ | |
2278 | set_up_list3s(cachep, SIZE_AC); | |
2279 | if (INDEX_AC == INDEX_L3) | |
97d06609 | 2280 | slab_state = PARTIAL_L3; |
f30cf7d1 | 2281 | else |
97d06609 | 2282 | slab_state = PARTIAL_ARRAYCACHE; |
f30cf7d1 | 2283 | } else { |
2f9baa9f | 2284 | /* Remaining boot caches */ |
f30cf7d1 | 2285 | cachep->array[smp_processor_id()] = |
83b519e8 | 2286 | kmalloc(sizeof(struct arraycache_init), gfp); |
f30cf7d1 | 2287 | |
97d06609 | 2288 | if (slab_state == PARTIAL_ARRAYCACHE) { |
f30cf7d1 | 2289 | set_up_list3s(cachep, SIZE_L3); |
97d06609 | 2290 | slab_state = PARTIAL_L3; |
f30cf7d1 PE |
2291 | } else { |
2292 | int node; | |
556a169d | 2293 | for_each_online_node(node) { |
f30cf7d1 PE |
2294 | cachep->nodelists[node] = |
2295 | kmalloc_node(sizeof(struct kmem_list3), | |
eb91f1d0 | 2296 | gfp, node); |
f30cf7d1 PE |
2297 | BUG_ON(!cachep->nodelists[node]); |
2298 | kmem_list3_init(cachep->nodelists[node]); | |
2299 | } | |
2300 | } | |
2301 | } | |
7d6e6d09 | 2302 | cachep->nodelists[numa_mem_id()]->next_reap = |
f30cf7d1 PE |
2303 | jiffies + REAPTIMEOUT_LIST3 + |
2304 | ((unsigned long)cachep) % REAPTIMEOUT_LIST3; | |
2305 | ||
2306 | cpu_cache_get(cachep)->avail = 0; | |
2307 | cpu_cache_get(cachep)->limit = BOOT_CPUCACHE_ENTRIES; | |
2308 | cpu_cache_get(cachep)->batchcount = 1; | |
2309 | cpu_cache_get(cachep)->touched = 0; | |
2310 | cachep->batchcount = 1; | |
2311 | cachep->limit = BOOT_CPUCACHE_ENTRIES; | |
2ed3a4ef | 2312 | return 0; |
f30cf7d1 PE |
2313 | } |
2314 | ||
1da177e4 | 2315 | /** |
039363f3 | 2316 | * __kmem_cache_create - Create a cache. |
a755b76a | 2317 | * @cachep: cache management descriptor |
1da177e4 | 2318 | * @flags: SLAB flags |
1da177e4 LT |
2319 | * |
2320 | * Returns a ptr to the cache on success, NULL on failure. | |
2321 | * Cannot be called within a int, but can be interrupted. | |
20c2df83 | 2322 | * The @ctor is run when new pages are allocated by the cache. |
1da177e4 | 2323 | * |
1da177e4 LT |
2324 | * The flags are |
2325 | * | |
2326 | * %SLAB_POISON - Poison the slab with a known test pattern (a5a5a5a5) | |
2327 | * to catch references to uninitialised memory. | |
2328 | * | |
2329 | * %SLAB_RED_ZONE - Insert `Red' zones around the allocated memory to check | |
2330 | * for buffer overruns. | |
2331 | * | |
1da177e4 LT |
2332 | * %SLAB_HWCACHE_ALIGN - Align the objects in this cache to a hardware |
2333 | * cacheline. This can be beneficial if you're counting cycles as closely | |
2334 | * as davem. | |
2335 | */ | |
278b1bb1 | 2336 | int |
8a13a4cc | 2337 | __kmem_cache_create (struct kmem_cache *cachep, unsigned long flags) |
1da177e4 LT |
2338 | { |
2339 | size_t left_over, slab_size, ralign; | |
83b519e8 | 2340 | gfp_t gfp; |
278b1bb1 | 2341 | int err; |
8a13a4cc | 2342 | size_t size = cachep->size; |
1da177e4 | 2343 | |
1da177e4 | 2344 | #if DEBUG |
1da177e4 LT |
2345 | #if FORCED_DEBUG |
2346 | /* | |
2347 | * Enable redzoning and last user accounting, except for caches with | |
2348 | * large objects, if the increased size would increase the object size | |
2349 | * above the next power of two: caches with object sizes just above a | |
2350 | * power of two have a significant amount of internal fragmentation. | |
2351 | */ | |
87a927c7 DW |
2352 | if (size < 4096 || fls(size - 1) == fls(size-1 + REDZONE_ALIGN + |
2353 | 2 * sizeof(unsigned long long))) | |
b28a02de | 2354 | flags |= SLAB_RED_ZONE | SLAB_STORE_USER; |
1da177e4 LT |
2355 | if (!(flags & SLAB_DESTROY_BY_RCU)) |
2356 | flags |= SLAB_POISON; | |
2357 | #endif | |
2358 | if (flags & SLAB_DESTROY_BY_RCU) | |
2359 | BUG_ON(flags & SLAB_POISON); | |
2360 | #endif | |
1da177e4 | 2361 | |
a737b3e2 AM |
2362 | /* |
2363 | * Check that size is in terms of words. This is needed to avoid | |
1da177e4 LT |
2364 | * unaligned accesses for some archs when redzoning is used, and makes |
2365 | * sure any on-slab bufctl's are also correctly aligned. | |
2366 | */ | |
b28a02de PE |
2367 | if (size & (BYTES_PER_WORD - 1)) { |
2368 | size += (BYTES_PER_WORD - 1); | |
2369 | size &= ~(BYTES_PER_WORD - 1); | |
1da177e4 LT |
2370 | } |
2371 | ||
ca5f9703 | 2372 | /* |
87a927c7 DW |
2373 | * Redzoning and user store require word alignment or possibly larger. |
2374 | * Note this will be overridden by architecture or caller mandated | |
2375 | * alignment if either is greater than BYTES_PER_WORD. | |
ca5f9703 | 2376 | */ |
87a927c7 DW |
2377 | if (flags & SLAB_STORE_USER) |
2378 | ralign = BYTES_PER_WORD; | |
2379 | ||
2380 | if (flags & SLAB_RED_ZONE) { | |
2381 | ralign = REDZONE_ALIGN; | |
2382 | /* If redzoning, ensure that the second redzone is suitably | |
2383 | * aligned, by adjusting the object size accordingly. */ | |
2384 | size += REDZONE_ALIGN - 1; | |
2385 | size &= ~(REDZONE_ALIGN - 1); | |
2386 | } | |
ca5f9703 | 2387 | |
a44b56d3 | 2388 | /* 3) caller mandated alignment */ |
8a13a4cc CL |
2389 | if (ralign < cachep->align) { |
2390 | ralign = cachep->align; | |
1da177e4 | 2391 | } |
3ff84a7f PE |
2392 | /* disable debug if necessary */ |
2393 | if (ralign > __alignof__(unsigned long long)) | |
a44b56d3 | 2394 | flags &= ~(SLAB_RED_ZONE | SLAB_STORE_USER); |
a737b3e2 | 2395 | /* |
ca5f9703 | 2396 | * 4) Store it. |
1da177e4 | 2397 | */ |
8a13a4cc | 2398 | cachep->align = ralign; |
1da177e4 | 2399 | |
83b519e8 PE |
2400 | if (slab_is_available()) |
2401 | gfp = GFP_KERNEL; | |
2402 | else | |
2403 | gfp = GFP_NOWAIT; | |
2404 | ||
3c583465 | 2405 | setup_nodelists_pointer(cachep); |
1da177e4 | 2406 | #if DEBUG |
1da177e4 | 2407 | |
ca5f9703 PE |
2408 | /* |
2409 | * Both debugging options require word-alignment which is calculated | |
2410 | * into align above. | |
2411 | */ | |
1da177e4 | 2412 | if (flags & SLAB_RED_ZONE) { |
1da177e4 | 2413 | /* add space for red zone words */ |
3ff84a7f PE |
2414 | cachep->obj_offset += sizeof(unsigned long long); |
2415 | size += 2 * sizeof(unsigned long long); | |
1da177e4 LT |
2416 | } |
2417 | if (flags & SLAB_STORE_USER) { | |
ca5f9703 | 2418 | /* user store requires one word storage behind the end of |
87a927c7 DW |
2419 | * the real object. But if the second red zone needs to be |
2420 | * aligned to 64 bits, we must allow that much space. | |
1da177e4 | 2421 | */ |
87a927c7 DW |
2422 | if (flags & SLAB_RED_ZONE) |
2423 | size += REDZONE_ALIGN; | |
2424 | else | |
2425 | size += BYTES_PER_WORD; | |
1da177e4 LT |
2426 | } |
2427 | #if FORCED_DEBUG && defined(CONFIG_DEBUG_PAGEALLOC) | |
b28a02de | 2428 | if (size >= malloc_sizes[INDEX_L3 + 1].cs_size |
608da7e3 TH |
2429 | && cachep->object_size > cache_line_size() |
2430 | && ALIGN(size, cachep->align) < PAGE_SIZE) { | |
2431 | cachep->obj_offset += PAGE_SIZE - ALIGN(size, cachep->align); | |
1da177e4 LT |
2432 | size = PAGE_SIZE; |
2433 | } | |
2434 | #endif | |
2435 | #endif | |
2436 | ||
e0a42726 IM |
2437 | /* |
2438 | * Determine if the slab management is 'on' or 'off' slab. | |
2439 | * (bootstrapping cannot cope with offslab caches so don't do | |
e7cb55b9 CM |
2440 | * it too early on. Always use on-slab management when |
2441 | * SLAB_NOLEAKTRACE to avoid recursive calls into kmemleak) | |
e0a42726 | 2442 | */ |
e7cb55b9 CM |
2443 | if ((size >= (PAGE_SIZE >> 3)) && !slab_early_init && |
2444 | !(flags & SLAB_NOLEAKTRACE)) | |
1da177e4 LT |
2445 | /* |
2446 | * Size is large, assume best to place the slab management obj | |
2447 | * off-slab (should allow better packing of objs). | |
2448 | */ | |
2449 | flags |= CFLGS_OFF_SLAB; | |
2450 | ||
8a13a4cc | 2451 | size = ALIGN(size, cachep->align); |
1da177e4 | 2452 | |
8a13a4cc | 2453 | left_over = calculate_slab_order(cachep, size, cachep->align, flags); |
1da177e4 | 2454 | |
8a13a4cc | 2455 | if (!cachep->num) |
278b1bb1 | 2456 | return -E2BIG; |
1da177e4 | 2457 | |
b28a02de | 2458 | slab_size = ALIGN(cachep->num * sizeof(kmem_bufctl_t) |
8a13a4cc | 2459 | + sizeof(struct slab), cachep->align); |
1da177e4 LT |
2460 | |
2461 | /* | |
2462 | * If the slab has been placed off-slab, and we have enough space then | |
2463 | * move it on-slab. This is at the expense of any extra colouring. | |
2464 | */ | |
2465 | if (flags & CFLGS_OFF_SLAB && left_over >= slab_size) { | |
2466 | flags &= ~CFLGS_OFF_SLAB; | |
2467 | left_over -= slab_size; | |
2468 | } | |
2469 | ||
2470 | if (flags & CFLGS_OFF_SLAB) { | |
2471 | /* really off slab. No need for manual alignment */ | |
b28a02de PE |
2472 | slab_size = |
2473 | cachep->num * sizeof(kmem_bufctl_t) + sizeof(struct slab); | |
67461365 RL |
2474 | |
2475 | #ifdef CONFIG_PAGE_POISONING | |
2476 | /* If we're going to use the generic kernel_map_pages() | |
2477 | * poisoning, then it's going to smash the contents of | |
2478 | * the redzone and userword anyhow, so switch them off. | |
2479 | */ | |
2480 | if (size % PAGE_SIZE == 0 && flags & SLAB_POISON) | |
2481 | flags &= ~(SLAB_RED_ZONE | SLAB_STORE_USER); | |
2482 | #endif | |
1da177e4 LT |
2483 | } |
2484 | ||
2485 | cachep->colour_off = cache_line_size(); | |
2486 | /* Offset must be a multiple of the alignment. */ | |
8a13a4cc CL |
2487 | if (cachep->colour_off < cachep->align) |
2488 | cachep->colour_off = cachep->align; | |
b28a02de | 2489 | cachep->colour = left_over / cachep->colour_off; |
1da177e4 LT |
2490 | cachep->slab_size = slab_size; |
2491 | cachep->flags = flags; | |
a618e89f | 2492 | cachep->allocflags = 0; |
4b51d669 | 2493 | if (CONFIG_ZONE_DMA_FLAG && (flags & SLAB_CACHE_DMA)) |
a618e89f | 2494 | cachep->allocflags |= GFP_DMA; |
3b0efdfa | 2495 | cachep->size = size; |
6a2d7a95 | 2496 | cachep->reciprocal_buffer_size = reciprocal_value(size); |
1da177e4 | 2497 | |
e5ac9c5a | 2498 | if (flags & CFLGS_OFF_SLAB) { |
b2d55073 | 2499 | cachep->slabp_cache = kmem_find_general_cachep(slab_size, 0u); |
e5ac9c5a RT |
2500 | /* |
2501 | * This is a possibility for one of the malloc_sizes caches. | |
2502 | * But since we go off slab only for object size greater than | |
2503 | * PAGE_SIZE/8, and malloc_sizes gets created in ascending order, | |
2504 | * this should not happen at all. | |
2505 | * But leave a BUG_ON for some lucky dude. | |
2506 | */ | |
6cb8f913 | 2507 | BUG_ON(ZERO_OR_NULL_PTR(cachep->slabp_cache)); |
e5ac9c5a | 2508 | } |
1da177e4 | 2509 | |
278b1bb1 CL |
2510 | err = setup_cpu_cache(cachep, gfp); |
2511 | if (err) { | |
12c3667f | 2512 | __kmem_cache_shutdown(cachep); |
278b1bb1 | 2513 | return err; |
2ed3a4ef | 2514 | } |
1da177e4 | 2515 | |
83835b3d PZ |
2516 | if (flags & SLAB_DEBUG_OBJECTS) { |
2517 | /* | |
2518 | * Would deadlock through slab_destroy()->call_rcu()-> | |
2519 | * debug_object_activate()->kmem_cache_alloc(). | |
2520 | */ | |
2521 | WARN_ON_ONCE(flags & SLAB_DESTROY_BY_RCU); | |
2522 | ||
2523 | slab_set_debugobj_lock_classes(cachep); | |
6ccfb5bc GC |
2524 | } else if (!OFF_SLAB(cachep) && !(flags & SLAB_DESTROY_BY_RCU)) |
2525 | on_slab_lock_classes(cachep); | |
83835b3d | 2526 | |
278b1bb1 | 2527 | return 0; |
1da177e4 | 2528 | } |
1da177e4 LT |
2529 | |
2530 | #if DEBUG | |
2531 | static void check_irq_off(void) | |
2532 | { | |
2533 | BUG_ON(!irqs_disabled()); | |
2534 | } | |
2535 | ||
2536 | static void check_irq_on(void) | |
2537 | { | |
2538 | BUG_ON(irqs_disabled()); | |
2539 | } | |
2540 | ||
343e0d7a | 2541 | static void check_spinlock_acquired(struct kmem_cache *cachep) |
1da177e4 LT |
2542 | { |
2543 | #ifdef CONFIG_SMP | |
2544 | check_irq_off(); | |
7d6e6d09 | 2545 | assert_spin_locked(&cachep->nodelists[numa_mem_id()]->list_lock); |
1da177e4 LT |
2546 | #endif |
2547 | } | |
e498be7d | 2548 | |
343e0d7a | 2549 | static void check_spinlock_acquired_node(struct kmem_cache *cachep, int node) |
e498be7d CL |
2550 | { |
2551 | #ifdef CONFIG_SMP | |
2552 | check_irq_off(); | |
2553 | assert_spin_locked(&cachep->nodelists[node]->list_lock); | |
2554 | #endif | |
2555 | } | |
2556 | ||
1da177e4 LT |
2557 | #else |
2558 | #define check_irq_off() do { } while(0) | |
2559 | #define check_irq_on() do { } while(0) | |
2560 | #define check_spinlock_acquired(x) do { } while(0) | |
e498be7d | 2561 | #define check_spinlock_acquired_node(x, y) do { } while(0) |
1da177e4 LT |
2562 | #endif |
2563 | ||
aab2207c CL |
2564 | static void drain_array(struct kmem_cache *cachep, struct kmem_list3 *l3, |
2565 | struct array_cache *ac, | |
2566 | int force, int node); | |
2567 | ||
1da177e4 LT |
2568 | static void do_drain(void *arg) |
2569 | { | |
a737b3e2 | 2570 | struct kmem_cache *cachep = arg; |
1da177e4 | 2571 | struct array_cache *ac; |
7d6e6d09 | 2572 | int node = numa_mem_id(); |
1da177e4 LT |
2573 | |
2574 | check_irq_off(); | |
9a2dba4b | 2575 | ac = cpu_cache_get(cachep); |
ff69416e CL |
2576 | spin_lock(&cachep->nodelists[node]->list_lock); |
2577 | free_block(cachep, ac->entry, ac->avail, node); | |
2578 | spin_unlock(&cachep->nodelists[node]->list_lock); | |
1da177e4 LT |
2579 | ac->avail = 0; |
2580 | } | |
2581 | ||
343e0d7a | 2582 | static void drain_cpu_caches(struct kmem_cache *cachep) |
1da177e4 | 2583 | { |
e498be7d CL |
2584 | struct kmem_list3 *l3; |
2585 | int node; | |
2586 | ||
15c8b6c1 | 2587 | on_each_cpu(do_drain, cachep, 1); |
1da177e4 | 2588 | check_irq_on(); |
b28a02de | 2589 | for_each_online_node(node) { |
e498be7d | 2590 | l3 = cachep->nodelists[node]; |
a4523a8b RD |
2591 | if (l3 && l3->alien) |
2592 | drain_alien_cache(cachep, l3->alien); | |
2593 | } | |
2594 | ||
2595 | for_each_online_node(node) { | |
2596 | l3 = cachep->nodelists[node]; | |
2597 | if (l3) | |
aab2207c | 2598 | drain_array(cachep, l3, l3->shared, 1, node); |
e498be7d | 2599 | } |
1da177e4 LT |
2600 | } |
2601 | ||
ed11d9eb CL |
2602 | /* |
2603 | * Remove slabs from the list of free slabs. | |
2604 | * Specify the number of slabs to drain in tofree. | |
2605 | * | |
2606 | * Returns the actual number of slabs released. | |
2607 | */ | |
2608 | static int drain_freelist(struct kmem_cache *cache, | |
2609 | struct kmem_list3 *l3, int tofree) | |
1da177e4 | 2610 | { |
ed11d9eb CL |
2611 | struct list_head *p; |
2612 | int nr_freed; | |
1da177e4 | 2613 | struct slab *slabp; |
1da177e4 | 2614 | |
ed11d9eb CL |
2615 | nr_freed = 0; |
2616 | while (nr_freed < tofree && !list_empty(&l3->slabs_free)) { | |
1da177e4 | 2617 | |
ed11d9eb | 2618 | spin_lock_irq(&l3->list_lock); |
e498be7d | 2619 | p = l3->slabs_free.prev; |
ed11d9eb CL |
2620 | if (p == &l3->slabs_free) { |
2621 | spin_unlock_irq(&l3->list_lock); | |
2622 | goto out; | |
2623 | } | |
1da177e4 | 2624 | |
ed11d9eb | 2625 | slabp = list_entry(p, struct slab, list); |
1da177e4 | 2626 | #if DEBUG |
40094fa6 | 2627 | BUG_ON(slabp->inuse); |
1da177e4 LT |
2628 | #endif |
2629 | list_del(&slabp->list); | |
ed11d9eb CL |
2630 | /* |
2631 | * Safe to drop the lock. The slab is no longer linked | |
2632 | * to the cache. | |
2633 | */ | |
2634 | l3->free_objects -= cache->num; | |
e498be7d | 2635 | spin_unlock_irq(&l3->list_lock); |
ed11d9eb CL |
2636 | slab_destroy(cache, slabp); |
2637 | nr_freed++; | |
1da177e4 | 2638 | } |
ed11d9eb CL |
2639 | out: |
2640 | return nr_freed; | |
1da177e4 LT |
2641 | } |
2642 | ||
18004c5d | 2643 | /* Called with slab_mutex held to protect against cpu hotplug */ |
343e0d7a | 2644 | static int __cache_shrink(struct kmem_cache *cachep) |
e498be7d CL |
2645 | { |
2646 | int ret = 0, i = 0; | |
2647 | struct kmem_list3 *l3; | |
2648 | ||
2649 | drain_cpu_caches(cachep); | |
2650 | ||
2651 | check_irq_on(); | |
2652 | for_each_online_node(i) { | |
2653 | l3 = cachep->nodelists[i]; | |
ed11d9eb CL |
2654 | if (!l3) |
2655 | continue; | |
2656 | ||
2657 | drain_freelist(cachep, l3, l3->free_objects); | |
2658 | ||
2659 | ret += !list_empty(&l3->slabs_full) || | |
2660 | !list_empty(&l3->slabs_partial); | |
e498be7d CL |
2661 | } |
2662 | return (ret ? 1 : 0); | |
2663 | } | |
2664 | ||
1da177e4 LT |
2665 | /** |
2666 | * kmem_cache_shrink - Shrink a cache. | |
2667 | * @cachep: The cache to shrink. | |
2668 | * | |
2669 | * Releases as many slabs as possible for a cache. | |
2670 | * To help debugging, a zero exit status indicates all slabs were released. | |
2671 | */ | |
343e0d7a | 2672 | int kmem_cache_shrink(struct kmem_cache *cachep) |
1da177e4 | 2673 | { |
8f5be20b | 2674 | int ret; |
40094fa6 | 2675 | BUG_ON(!cachep || in_interrupt()); |
1da177e4 | 2676 | |
95402b38 | 2677 | get_online_cpus(); |
18004c5d | 2678 | mutex_lock(&slab_mutex); |
8f5be20b | 2679 | ret = __cache_shrink(cachep); |
18004c5d | 2680 | mutex_unlock(&slab_mutex); |
95402b38 | 2681 | put_online_cpus(); |
8f5be20b | 2682 | return ret; |
1da177e4 LT |
2683 | } |
2684 | EXPORT_SYMBOL(kmem_cache_shrink); | |
2685 | ||
945cf2b6 | 2686 | int __kmem_cache_shutdown(struct kmem_cache *cachep) |
1da177e4 | 2687 | { |
12c3667f CL |
2688 | int i; |
2689 | struct kmem_list3 *l3; | |
2690 | int rc = __cache_shrink(cachep); | |
1da177e4 | 2691 | |
12c3667f CL |
2692 | if (rc) |
2693 | return rc; | |
1da177e4 | 2694 | |
12c3667f CL |
2695 | for_each_online_cpu(i) |
2696 | kfree(cachep->array[i]); | |
1da177e4 | 2697 | |
12c3667f CL |
2698 | /* NUMA: free the list3 structures */ |
2699 | for_each_online_node(i) { | |
2700 | l3 = cachep->nodelists[i]; | |
2701 | if (l3) { | |
2702 | kfree(l3->shared); | |
2703 | free_alien_cache(l3->alien); | |
2704 | kfree(l3); | |
2705 | } | |
2706 | } | |
2707 | return 0; | |
1da177e4 | 2708 | } |
1da177e4 | 2709 | |
e5ac9c5a RT |
2710 | /* |
2711 | * Get the memory for a slab management obj. | |
2712 | * For a slab cache when the slab descriptor is off-slab, slab descriptors | |
2713 | * always come from malloc_sizes caches. The slab descriptor cannot | |
2714 | * come from the same cache which is getting created because, | |
2715 | * when we are searching for an appropriate cache for these | |
2716 | * descriptors in kmem_cache_create, we search through the malloc_sizes array. | |
2717 | * If we are creating a malloc_sizes cache here it would not be visible to | |
2718 | * kmem_find_general_cachep till the initialization is complete. | |
2719 | * Hence we cannot have slabp_cache same as the original cache. | |
2720 | */ | |
343e0d7a | 2721 | static struct slab *alloc_slabmgmt(struct kmem_cache *cachep, void *objp, |
5b74ada7 RT |
2722 | int colour_off, gfp_t local_flags, |
2723 | int nodeid) | |
1da177e4 LT |
2724 | { |
2725 | struct slab *slabp; | |
b28a02de | 2726 | |
1da177e4 LT |
2727 | if (OFF_SLAB(cachep)) { |
2728 | /* Slab management obj is off-slab. */ | |
5b74ada7 | 2729 | slabp = kmem_cache_alloc_node(cachep->slabp_cache, |
8759ec50 | 2730 | local_flags, nodeid); |
d5cff635 CM |
2731 | /* |
2732 | * If the first object in the slab is leaked (it's allocated | |
2733 | * but no one has a reference to it), we want to make sure | |
2734 | * kmemleak does not treat the ->s_mem pointer as a reference | |
2735 | * to the object. Otherwise we will not report the leak. | |
2736 | */ | |
c017b4be CM |
2737 | kmemleak_scan_area(&slabp->list, sizeof(struct list_head), |
2738 | local_flags); | |
1da177e4 LT |
2739 | if (!slabp) |
2740 | return NULL; | |
2741 | } else { | |
b28a02de | 2742 | slabp = objp + colour_off; |
1da177e4 LT |
2743 | colour_off += cachep->slab_size; |
2744 | } | |
2745 | slabp->inuse = 0; | |
2746 | slabp->colouroff = colour_off; | |
b28a02de | 2747 | slabp->s_mem = objp + colour_off; |
5b74ada7 | 2748 | slabp->nodeid = nodeid; |
e51bfd0a | 2749 | slabp->free = 0; |
1da177e4 LT |
2750 | return slabp; |
2751 | } | |
2752 | ||
2753 | static inline kmem_bufctl_t *slab_bufctl(struct slab *slabp) | |
2754 | { | |
b28a02de | 2755 | return (kmem_bufctl_t *) (slabp + 1); |
1da177e4 LT |
2756 | } |
2757 | ||
343e0d7a | 2758 | static void cache_init_objs(struct kmem_cache *cachep, |
a35afb83 | 2759 | struct slab *slabp) |
1da177e4 LT |
2760 | { |
2761 | int i; | |
2762 | ||
2763 | for (i = 0; i < cachep->num; i++) { | |
8fea4e96 | 2764 | void *objp = index_to_obj(cachep, slabp, i); |
1da177e4 LT |
2765 | #if DEBUG |
2766 | /* need to poison the objs? */ | |
2767 | if (cachep->flags & SLAB_POISON) | |
2768 | poison_obj(cachep, objp, POISON_FREE); | |
2769 | if (cachep->flags & SLAB_STORE_USER) | |
2770 | *dbg_userword(cachep, objp) = NULL; | |
2771 | ||
2772 | if (cachep->flags & SLAB_RED_ZONE) { | |
2773 | *dbg_redzone1(cachep, objp) = RED_INACTIVE; | |
2774 | *dbg_redzone2(cachep, objp) = RED_INACTIVE; | |
2775 | } | |
2776 | /* | |
a737b3e2 AM |
2777 | * Constructors are not allowed to allocate memory from the same |
2778 | * cache which they are a constructor for. Otherwise, deadlock. | |
2779 | * They must also be threaded. | |
1da177e4 LT |
2780 | */ |
2781 | if (cachep->ctor && !(cachep->flags & SLAB_POISON)) | |
51cc5068 | 2782 | cachep->ctor(objp + obj_offset(cachep)); |
1da177e4 LT |
2783 | |
2784 | if (cachep->flags & SLAB_RED_ZONE) { | |
2785 | if (*dbg_redzone2(cachep, objp) != RED_INACTIVE) | |
2786 | slab_error(cachep, "constructor overwrote the" | |
b28a02de | 2787 | " end of an object"); |
1da177e4 LT |
2788 | if (*dbg_redzone1(cachep, objp) != RED_INACTIVE) |
2789 | slab_error(cachep, "constructor overwrote the" | |
b28a02de | 2790 | " start of an object"); |
1da177e4 | 2791 | } |
3b0efdfa | 2792 | if ((cachep->size % PAGE_SIZE) == 0 && |
a737b3e2 | 2793 | OFF_SLAB(cachep) && cachep->flags & SLAB_POISON) |
b28a02de | 2794 | kernel_map_pages(virt_to_page(objp), |
3b0efdfa | 2795 | cachep->size / PAGE_SIZE, 0); |
1da177e4 LT |
2796 | #else |
2797 | if (cachep->ctor) | |
51cc5068 | 2798 | cachep->ctor(objp); |
1da177e4 | 2799 | #endif |
b28a02de | 2800 | slab_bufctl(slabp)[i] = i + 1; |
1da177e4 | 2801 | } |
b28a02de | 2802 | slab_bufctl(slabp)[i - 1] = BUFCTL_END; |
1da177e4 LT |
2803 | } |
2804 | ||
343e0d7a | 2805 | static void kmem_flagcheck(struct kmem_cache *cachep, gfp_t flags) |
1da177e4 | 2806 | { |
4b51d669 CL |
2807 | if (CONFIG_ZONE_DMA_FLAG) { |
2808 | if (flags & GFP_DMA) | |
a618e89f | 2809 | BUG_ON(!(cachep->allocflags & GFP_DMA)); |
4b51d669 | 2810 | else |
a618e89f | 2811 | BUG_ON(cachep->allocflags & GFP_DMA); |
4b51d669 | 2812 | } |
1da177e4 LT |
2813 | } |
2814 | ||
a737b3e2 AM |
2815 | static void *slab_get_obj(struct kmem_cache *cachep, struct slab *slabp, |
2816 | int nodeid) | |
78d382d7 | 2817 | { |
8fea4e96 | 2818 | void *objp = index_to_obj(cachep, slabp, slabp->free); |
78d382d7 MD |
2819 | kmem_bufctl_t next; |
2820 | ||
2821 | slabp->inuse++; | |
2822 | next = slab_bufctl(slabp)[slabp->free]; | |
2823 | #if DEBUG | |
2824 | slab_bufctl(slabp)[slabp->free] = BUFCTL_FREE; | |
2825 | WARN_ON(slabp->nodeid != nodeid); | |
2826 | #endif | |
2827 | slabp->free = next; | |
2828 | ||
2829 | return objp; | |
2830 | } | |
2831 | ||
a737b3e2 AM |
2832 | static void slab_put_obj(struct kmem_cache *cachep, struct slab *slabp, |
2833 | void *objp, int nodeid) | |
78d382d7 | 2834 | { |
8fea4e96 | 2835 | unsigned int objnr = obj_to_index(cachep, slabp, objp); |
78d382d7 MD |
2836 | |
2837 | #if DEBUG | |
2838 | /* Verify that the slab belongs to the intended node */ | |
2839 | WARN_ON(slabp->nodeid != nodeid); | |
2840 | ||
871751e2 | 2841 | if (slab_bufctl(slabp)[objnr] + 1 <= SLAB_LIMIT + 1) { |
78d382d7 | 2842 | printk(KERN_ERR "slab: double free detected in cache " |
a737b3e2 | 2843 | "'%s', objp %p\n", cachep->name, objp); |
78d382d7 MD |
2844 | BUG(); |
2845 | } | |
2846 | #endif | |
2847 | slab_bufctl(slabp)[objnr] = slabp->free; | |
2848 | slabp->free = objnr; | |
2849 | slabp->inuse--; | |
2850 | } | |
2851 | ||
4776874f PE |
2852 | /* |
2853 | * Map pages beginning at addr to the given cache and slab. This is required | |
2854 | * for the slab allocator to be able to lookup the cache and slab of a | |
ccd35fb9 | 2855 | * virtual address for kfree, ksize, and slab debugging. |
4776874f PE |
2856 | */ |
2857 | static void slab_map_pages(struct kmem_cache *cache, struct slab *slab, | |
2858 | void *addr) | |
1da177e4 | 2859 | { |
4776874f | 2860 | int nr_pages; |
1da177e4 LT |
2861 | struct page *page; |
2862 | ||
4776874f | 2863 | page = virt_to_page(addr); |
84097518 | 2864 | |
4776874f | 2865 | nr_pages = 1; |
84097518 | 2866 | if (likely(!PageCompound(page))) |
4776874f PE |
2867 | nr_pages <<= cache->gfporder; |
2868 | ||
1da177e4 | 2869 | do { |
35026088 CL |
2870 | page->slab_cache = cache; |
2871 | page->slab_page = slab; | |
1da177e4 | 2872 | page++; |
4776874f | 2873 | } while (--nr_pages); |
1da177e4 LT |
2874 | } |
2875 | ||
2876 | /* | |
2877 | * Grow (by 1) the number of slabs within a cache. This is called by | |
2878 | * kmem_cache_alloc() when there are no active objs left in a cache. | |
2879 | */ | |
3c517a61 CL |
2880 | static int cache_grow(struct kmem_cache *cachep, |
2881 | gfp_t flags, int nodeid, void *objp) | |
1da177e4 | 2882 | { |
b28a02de | 2883 | struct slab *slabp; |
b28a02de PE |
2884 | size_t offset; |
2885 | gfp_t local_flags; | |
e498be7d | 2886 | struct kmem_list3 *l3; |
1da177e4 | 2887 | |
a737b3e2 AM |
2888 | /* |
2889 | * Be lazy and only check for valid flags here, keeping it out of the | |
2890 | * critical path in kmem_cache_alloc(). | |
1da177e4 | 2891 | */ |
6cb06229 CL |
2892 | BUG_ON(flags & GFP_SLAB_BUG_MASK); |
2893 | local_flags = flags & (GFP_CONSTRAINT_MASK|GFP_RECLAIM_MASK); | |
1da177e4 | 2894 | |
2e1217cf | 2895 | /* Take the l3 list lock to change the colour_next on this node */ |
1da177e4 | 2896 | check_irq_off(); |
2e1217cf RT |
2897 | l3 = cachep->nodelists[nodeid]; |
2898 | spin_lock(&l3->list_lock); | |
1da177e4 LT |
2899 | |
2900 | /* Get colour for the slab, and cal the next value. */ | |
2e1217cf RT |
2901 | offset = l3->colour_next; |
2902 | l3->colour_next++; | |
2903 | if (l3->colour_next >= cachep->colour) | |
2904 | l3->colour_next = 0; | |
2905 | spin_unlock(&l3->list_lock); | |
1da177e4 | 2906 | |
2e1217cf | 2907 | offset *= cachep->colour_off; |
1da177e4 LT |
2908 | |
2909 | if (local_flags & __GFP_WAIT) | |
2910 | local_irq_enable(); | |
2911 | ||
2912 | /* | |
2913 | * The test for missing atomic flag is performed here, rather than | |
2914 | * the more obvious place, simply to reduce the critical path length | |
2915 | * in kmem_cache_alloc(). If a caller is seriously mis-behaving they | |
2916 | * will eventually be caught here (where it matters). | |
2917 | */ | |
2918 | kmem_flagcheck(cachep, flags); | |
2919 | ||
a737b3e2 AM |
2920 | /* |
2921 | * Get mem for the objs. Attempt to allocate a physical page from | |
2922 | * 'nodeid'. | |
e498be7d | 2923 | */ |
3c517a61 | 2924 | if (!objp) |
b8c1c5da | 2925 | objp = kmem_getpages(cachep, local_flags, nodeid); |
a737b3e2 | 2926 | if (!objp) |
1da177e4 LT |
2927 | goto failed; |
2928 | ||
2929 | /* Get slab management. */ | |
3c517a61 | 2930 | slabp = alloc_slabmgmt(cachep, objp, offset, |
6cb06229 | 2931 | local_flags & ~GFP_CONSTRAINT_MASK, nodeid); |
a737b3e2 | 2932 | if (!slabp) |
1da177e4 LT |
2933 | goto opps1; |
2934 | ||
4776874f | 2935 | slab_map_pages(cachep, slabp, objp); |
1da177e4 | 2936 | |
a35afb83 | 2937 | cache_init_objs(cachep, slabp); |
1da177e4 LT |
2938 | |
2939 | if (local_flags & __GFP_WAIT) | |
2940 | local_irq_disable(); | |
2941 | check_irq_off(); | |
e498be7d | 2942 | spin_lock(&l3->list_lock); |
1da177e4 LT |
2943 | |
2944 | /* Make slab active. */ | |
e498be7d | 2945 | list_add_tail(&slabp->list, &(l3->slabs_free)); |
1da177e4 | 2946 | STATS_INC_GROWN(cachep); |
e498be7d CL |
2947 | l3->free_objects += cachep->num; |
2948 | spin_unlock(&l3->list_lock); | |
1da177e4 | 2949 | return 1; |
a737b3e2 | 2950 | opps1: |
1da177e4 | 2951 | kmem_freepages(cachep, objp); |
a737b3e2 | 2952 | failed: |
1da177e4 LT |
2953 | if (local_flags & __GFP_WAIT) |
2954 | local_irq_disable(); | |
2955 | return 0; | |
2956 | } | |
2957 | ||
2958 | #if DEBUG | |
2959 | ||
2960 | /* | |
2961 | * Perform extra freeing checks: | |
2962 | * - detect bad pointers. | |
2963 | * - POISON/RED_ZONE checking | |
1da177e4 LT |
2964 | */ |
2965 | static void kfree_debugcheck(const void *objp) | |
2966 | { | |
1da177e4 LT |
2967 | if (!virt_addr_valid(objp)) { |
2968 | printk(KERN_ERR "kfree_debugcheck: out of range ptr %lxh.\n", | |
b28a02de PE |
2969 | (unsigned long)objp); |
2970 | BUG(); | |
1da177e4 | 2971 | } |
1da177e4 LT |
2972 | } |
2973 | ||
58ce1fd5 PE |
2974 | static inline void verify_redzone_free(struct kmem_cache *cache, void *obj) |
2975 | { | |
b46b8f19 | 2976 | unsigned long long redzone1, redzone2; |
58ce1fd5 PE |
2977 | |
2978 | redzone1 = *dbg_redzone1(cache, obj); | |
2979 | redzone2 = *dbg_redzone2(cache, obj); | |
2980 | ||
2981 | /* | |
2982 | * Redzone is ok. | |
2983 | */ | |
2984 | if (redzone1 == RED_ACTIVE && redzone2 == RED_ACTIVE) | |
2985 | return; | |
2986 | ||
2987 | if (redzone1 == RED_INACTIVE && redzone2 == RED_INACTIVE) | |
2988 | slab_error(cache, "double free detected"); | |
2989 | else | |
2990 | slab_error(cache, "memory outside object was overwritten"); | |
2991 | ||
b46b8f19 | 2992 | printk(KERN_ERR "%p: redzone 1:0x%llx, redzone 2:0x%llx.\n", |
58ce1fd5 PE |
2993 | obj, redzone1, redzone2); |
2994 | } | |
2995 | ||
343e0d7a | 2996 | static void *cache_free_debugcheck(struct kmem_cache *cachep, void *objp, |
7c0cb9c6 | 2997 | unsigned long caller) |
1da177e4 LT |
2998 | { |
2999 | struct page *page; | |
3000 | unsigned int objnr; | |
3001 | struct slab *slabp; | |
3002 | ||
80cbd911 MW |
3003 | BUG_ON(virt_to_cache(objp) != cachep); |
3004 | ||
3dafccf2 | 3005 | objp -= obj_offset(cachep); |
1da177e4 | 3006 | kfree_debugcheck(objp); |
b49af68f | 3007 | page = virt_to_head_page(objp); |
1da177e4 | 3008 | |
35026088 | 3009 | slabp = page->slab_page; |
1da177e4 LT |
3010 | |
3011 | if (cachep->flags & SLAB_RED_ZONE) { | |
58ce1fd5 | 3012 | verify_redzone_free(cachep, objp); |
1da177e4 LT |
3013 | *dbg_redzone1(cachep, objp) = RED_INACTIVE; |
3014 | *dbg_redzone2(cachep, objp) = RED_INACTIVE; | |
3015 | } | |
3016 | if (cachep->flags & SLAB_STORE_USER) | |
7c0cb9c6 | 3017 | *dbg_userword(cachep, objp) = (void *)caller; |
1da177e4 | 3018 | |
8fea4e96 | 3019 | objnr = obj_to_index(cachep, slabp, objp); |
1da177e4 LT |
3020 | |
3021 | BUG_ON(objnr >= cachep->num); | |
8fea4e96 | 3022 | BUG_ON(objp != index_to_obj(cachep, slabp, objnr)); |
1da177e4 | 3023 | |
871751e2 AV |
3024 | #ifdef CONFIG_DEBUG_SLAB_LEAK |
3025 | slab_bufctl(slabp)[objnr] = BUFCTL_FREE; | |
3026 | #endif | |
1da177e4 LT |
3027 | if (cachep->flags & SLAB_POISON) { |
3028 | #ifdef CONFIG_DEBUG_PAGEALLOC | |
3b0efdfa | 3029 | if ((cachep->size % PAGE_SIZE)==0 && OFF_SLAB(cachep)) { |
7c0cb9c6 | 3030 | store_stackinfo(cachep, objp, caller); |
b28a02de | 3031 | kernel_map_pages(virt_to_page(objp), |
3b0efdfa | 3032 | cachep->size / PAGE_SIZE, 0); |
1da177e4 LT |
3033 | } else { |
3034 | poison_obj(cachep, objp, POISON_FREE); | |
3035 | } | |
3036 | #else | |
3037 | poison_obj(cachep, objp, POISON_FREE); | |
3038 | #endif | |
3039 | } | |
3040 | return objp; | |
3041 | } | |
3042 | ||
343e0d7a | 3043 | static void check_slabp(struct kmem_cache *cachep, struct slab *slabp) |
1da177e4 LT |
3044 | { |
3045 | kmem_bufctl_t i; | |
3046 | int entries = 0; | |
b28a02de | 3047 | |
1da177e4 LT |
3048 | /* Check slab's freelist to see if this obj is there. */ |
3049 | for (i = slabp->free; i != BUFCTL_END; i = slab_bufctl(slabp)[i]) { | |
3050 | entries++; | |
3051 | if (entries > cachep->num || i >= cachep->num) | |
3052 | goto bad; | |
3053 | } | |
3054 | if (entries != cachep->num - slabp->inuse) { | |
a737b3e2 AM |
3055 | bad: |
3056 | printk(KERN_ERR "slab: Internal list corruption detected in " | |
face37f5 DJ |
3057 | "cache '%s'(%d), slabp %p(%d). Tainted(%s). Hexdump:\n", |
3058 | cachep->name, cachep->num, slabp, slabp->inuse, | |
3059 | print_tainted()); | |
fdde6abb SAS |
3060 | print_hex_dump(KERN_ERR, "", DUMP_PREFIX_OFFSET, 16, 1, slabp, |
3061 | sizeof(*slabp) + cachep->num * sizeof(kmem_bufctl_t), | |
3062 | 1); | |
1da177e4 LT |
3063 | BUG(); |
3064 | } | |
3065 | } | |
3066 | #else | |
3067 | #define kfree_debugcheck(x) do { } while(0) | |
3068 | #define cache_free_debugcheck(x,objp,z) (objp) | |
3069 | #define check_slabp(x,y) do { } while(0) | |
3070 | #endif | |
3071 | ||
072bb0aa MG |
3072 | static void *cache_alloc_refill(struct kmem_cache *cachep, gfp_t flags, |
3073 | bool force_refill) | |
1da177e4 LT |
3074 | { |
3075 | int batchcount; | |
3076 | struct kmem_list3 *l3; | |
3077 | struct array_cache *ac; | |
1ca4cb24 PE |
3078 | int node; |
3079 | ||
1da177e4 | 3080 | check_irq_off(); |
7d6e6d09 | 3081 | node = numa_mem_id(); |
072bb0aa MG |
3082 | if (unlikely(force_refill)) |
3083 | goto force_grow; | |
3084 | retry: | |
9a2dba4b | 3085 | ac = cpu_cache_get(cachep); |
1da177e4 LT |
3086 | batchcount = ac->batchcount; |
3087 | if (!ac->touched && batchcount > BATCHREFILL_LIMIT) { | |
a737b3e2 AM |
3088 | /* |
3089 | * If there was little recent activity on this cache, then | |
3090 | * perform only a partial refill. Otherwise we could generate | |
3091 | * refill bouncing. | |
1da177e4 LT |
3092 | */ |
3093 | batchcount = BATCHREFILL_LIMIT; | |
3094 | } | |
1ca4cb24 | 3095 | l3 = cachep->nodelists[node]; |
e498be7d CL |
3096 | |
3097 | BUG_ON(ac->avail > 0 || !l3); | |
3098 | spin_lock(&l3->list_lock); | |
1da177e4 | 3099 | |
3ded175a | 3100 | /* See if we can refill from the shared array */ |
44b57f1c NP |
3101 | if (l3->shared && transfer_objects(ac, l3->shared, batchcount)) { |
3102 | l3->shared->touched = 1; | |
3ded175a | 3103 | goto alloc_done; |
44b57f1c | 3104 | } |
3ded175a | 3105 | |
1da177e4 LT |
3106 | while (batchcount > 0) { |
3107 | struct list_head *entry; | |
3108 | struct slab *slabp; | |
3109 | /* Get slab alloc is to come from. */ | |
3110 | entry = l3->slabs_partial.next; | |
3111 | if (entry == &l3->slabs_partial) { | |
3112 | l3->free_touched = 1; | |
3113 | entry = l3->slabs_free.next; | |
3114 | if (entry == &l3->slabs_free) | |
3115 | goto must_grow; | |
3116 | } | |
3117 | ||
3118 | slabp = list_entry(entry, struct slab, list); | |
3119 | check_slabp(cachep, slabp); | |
3120 | check_spinlock_acquired(cachep); | |
714b8171 PE |
3121 | |
3122 | /* | |
3123 | * The slab was either on partial or free list so | |
3124 | * there must be at least one object available for | |
3125 | * allocation. | |
3126 | */ | |
249b9f33 | 3127 | BUG_ON(slabp->inuse >= cachep->num); |
714b8171 | 3128 | |
1da177e4 | 3129 | while (slabp->inuse < cachep->num && batchcount--) { |
1da177e4 LT |
3130 | STATS_INC_ALLOCED(cachep); |
3131 | STATS_INC_ACTIVE(cachep); | |
3132 | STATS_SET_HIGH(cachep); | |
3133 | ||
072bb0aa MG |
3134 | ac_put_obj(cachep, ac, slab_get_obj(cachep, slabp, |
3135 | node)); | |
1da177e4 LT |
3136 | } |
3137 | check_slabp(cachep, slabp); | |
3138 | ||
3139 | /* move slabp to correct slabp list: */ | |
3140 | list_del(&slabp->list); | |
3141 | if (slabp->free == BUFCTL_END) | |
3142 | list_add(&slabp->list, &l3->slabs_full); | |
3143 | else | |
3144 | list_add(&slabp->list, &l3->slabs_partial); | |
3145 | } | |
3146 | ||
a737b3e2 | 3147 | must_grow: |
1da177e4 | 3148 | l3->free_objects -= ac->avail; |
a737b3e2 | 3149 | alloc_done: |
e498be7d | 3150 | spin_unlock(&l3->list_lock); |
1da177e4 LT |
3151 | |
3152 | if (unlikely(!ac->avail)) { | |
3153 | int x; | |
072bb0aa | 3154 | force_grow: |
3c517a61 | 3155 | x = cache_grow(cachep, flags | GFP_THISNODE, node, NULL); |
e498be7d | 3156 | |
a737b3e2 | 3157 | /* cache_grow can reenable interrupts, then ac could change. */ |
9a2dba4b | 3158 | ac = cpu_cache_get(cachep); |
51cd8e6f | 3159 | node = numa_mem_id(); |
072bb0aa MG |
3160 | |
3161 | /* no objects in sight? abort */ | |
3162 | if (!x && (ac->avail == 0 || force_refill)) | |
1da177e4 LT |
3163 | return NULL; |
3164 | ||
a737b3e2 | 3165 | if (!ac->avail) /* objects refilled by interrupt? */ |
1da177e4 LT |
3166 | goto retry; |
3167 | } | |
3168 | ac->touched = 1; | |
072bb0aa MG |
3169 | |
3170 | return ac_get_obj(cachep, ac, flags, force_refill); | |
1da177e4 LT |
3171 | } |
3172 | ||
a737b3e2 AM |
3173 | static inline void cache_alloc_debugcheck_before(struct kmem_cache *cachep, |
3174 | gfp_t flags) | |
1da177e4 LT |
3175 | { |
3176 | might_sleep_if(flags & __GFP_WAIT); | |
3177 | #if DEBUG | |
3178 | kmem_flagcheck(cachep, flags); | |
3179 | #endif | |
3180 | } | |
3181 | ||
3182 | #if DEBUG | |
a737b3e2 | 3183 | static void *cache_alloc_debugcheck_after(struct kmem_cache *cachep, |
7c0cb9c6 | 3184 | gfp_t flags, void *objp, unsigned long caller) |
1da177e4 | 3185 | { |
b28a02de | 3186 | if (!objp) |
1da177e4 | 3187 | return objp; |
b28a02de | 3188 | if (cachep->flags & SLAB_POISON) { |
1da177e4 | 3189 | #ifdef CONFIG_DEBUG_PAGEALLOC |
3b0efdfa | 3190 | if ((cachep->size % PAGE_SIZE) == 0 && OFF_SLAB(cachep)) |
b28a02de | 3191 | kernel_map_pages(virt_to_page(objp), |
3b0efdfa | 3192 | cachep->size / PAGE_SIZE, 1); |
1da177e4 LT |
3193 | else |
3194 | check_poison_obj(cachep, objp); | |
3195 | #else | |
3196 | check_poison_obj(cachep, objp); | |
3197 | #endif | |
3198 | poison_obj(cachep, objp, POISON_INUSE); | |
3199 | } | |
3200 | if (cachep->flags & SLAB_STORE_USER) | |
7c0cb9c6 | 3201 | *dbg_userword(cachep, objp) = (void *)caller; |
1da177e4 LT |
3202 | |
3203 | if (cachep->flags & SLAB_RED_ZONE) { | |
a737b3e2 AM |
3204 | if (*dbg_redzone1(cachep, objp) != RED_INACTIVE || |
3205 | *dbg_redzone2(cachep, objp) != RED_INACTIVE) { | |
3206 | slab_error(cachep, "double free, or memory outside" | |
3207 | " object was overwritten"); | |
b28a02de | 3208 | printk(KERN_ERR |
b46b8f19 | 3209 | "%p: redzone 1:0x%llx, redzone 2:0x%llx\n", |
a737b3e2 AM |
3210 | objp, *dbg_redzone1(cachep, objp), |
3211 | *dbg_redzone2(cachep, objp)); | |
1da177e4 LT |
3212 | } |
3213 | *dbg_redzone1(cachep, objp) = RED_ACTIVE; | |
3214 | *dbg_redzone2(cachep, objp) = RED_ACTIVE; | |
3215 | } | |
871751e2 AV |
3216 | #ifdef CONFIG_DEBUG_SLAB_LEAK |
3217 | { | |
3218 | struct slab *slabp; | |
3219 | unsigned objnr; | |
3220 | ||
35026088 | 3221 | slabp = virt_to_head_page(objp)->slab_page; |
3b0efdfa | 3222 | objnr = (unsigned)(objp - slabp->s_mem) / cachep->size; |
871751e2 AV |
3223 | slab_bufctl(slabp)[objnr] = BUFCTL_ACTIVE; |
3224 | } | |
3225 | #endif | |
3dafccf2 | 3226 | objp += obj_offset(cachep); |
4f104934 | 3227 | if (cachep->ctor && cachep->flags & SLAB_POISON) |
51cc5068 | 3228 | cachep->ctor(objp); |
7ea466f2 TH |
3229 | if (ARCH_SLAB_MINALIGN && |
3230 | ((unsigned long)objp & (ARCH_SLAB_MINALIGN-1))) { | |
a44b56d3 | 3231 | printk(KERN_ERR "0x%p: not aligned to ARCH_SLAB_MINALIGN=%d\n", |
c225150b | 3232 | objp, (int)ARCH_SLAB_MINALIGN); |
a44b56d3 | 3233 | } |
1da177e4 LT |
3234 | return objp; |
3235 | } | |
3236 | #else | |
3237 | #define cache_alloc_debugcheck_after(a,b,objp,d) (objp) | |
3238 | #endif | |
3239 | ||
773ff60e | 3240 | static bool slab_should_failslab(struct kmem_cache *cachep, gfp_t flags) |
8a8b6502 | 3241 | { |
9b030cb8 | 3242 | if (cachep == kmem_cache) |
773ff60e | 3243 | return false; |
8a8b6502 | 3244 | |
8c138bc0 | 3245 | return should_failslab(cachep->object_size, flags, cachep->flags); |
8a8b6502 AM |
3246 | } |
3247 | ||
343e0d7a | 3248 | static inline void *____cache_alloc(struct kmem_cache *cachep, gfp_t flags) |
1da177e4 | 3249 | { |
b28a02de | 3250 | void *objp; |
1da177e4 | 3251 | struct array_cache *ac; |
072bb0aa | 3252 | bool force_refill = false; |
1da177e4 | 3253 | |
5c382300 | 3254 | check_irq_off(); |
8a8b6502 | 3255 | |
9a2dba4b | 3256 | ac = cpu_cache_get(cachep); |
1da177e4 | 3257 | if (likely(ac->avail)) { |
1da177e4 | 3258 | ac->touched = 1; |
072bb0aa MG |
3259 | objp = ac_get_obj(cachep, ac, flags, false); |
3260 | ||
ddbf2e83 | 3261 | /* |
072bb0aa MG |
3262 | * Allow for the possibility all avail objects are not allowed |
3263 | * by the current flags | |
ddbf2e83 | 3264 | */ |
072bb0aa MG |
3265 | if (objp) { |
3266 | STATS_INC_ALLOCHIT(cachep); | |
3267 | goto out; | |
3268 | } | |
3269 | force_refill = true; | |
1da177e4 | 3270 | } |
072bb0aa MG |
3271 | |
3272 | STATS_INC_ALLOCMISS(cachep); | |
3273 | objp = cache_alloc_refill(cachep, flags, force_refill); | |
3274 | /* | |
3275 | * the 'ac' may be updated by cache_alloc_refill(), | |
3276 | * and kmemleak_erase() requires its correct value. | |
3277 | */ | |
3278 | ac = cpu_cache_get(cachep); | |
3279 | ||
3280 | out: | |
d5cff635 CM |
3281 | /* |
3282 | * To avoid a false negative, if an object that is in one of the | |
3283 | * per-CPU caches is leaked, we need to make sure kmemleak doesn't | |
3284 | * treat the array pointers as a reference to the object. | |
3285 | */ | |
f3d8b53a O |
3286 | if (objp) |
3287 | kmemleak_erase(&ac->entry[ac->avail]); | |
5c382300 AK |
3288 | return objp; |
3289 | } | |
3290 | ||
e498be7d | 3291 | #ifdef CONFIG_NUMA |
c61afb18 | 3292 | /* |
b2455396 | 3293 | * Try allocating on another node if PF_SPREAD_SLAB|PF_MEMPOLICY. |
c61afb18 PJ |
3294 | * |
3295 | * If we are in_interrupt, then process context, including cpusets and | |
3296 | * mempolicy, may not apply and should not be used for allocation policy. | |
3297 | */ | |
3298 | static void *alternate_node_alloc(struct kmem_cache *cachep, gfp_t flags) | |
3299 | { | |
3300 | int nid_alloc, nid_here; | |
3301 | ||
765c4507 | 3302 | if (in_interrupt() || (flags & __GFP_THISNODE)) |
c61afb18 | 3303 | return NULL; |
7d6e6d09 | 3304 | nid_alloc = nid_here = numa_mem_id(); |
c61afb18 | 3305 | if (cpuset_do_slab_mem_spread() && (cachep->flags & SLAB_MEM_SPREAD)) |
6adef3eb | 3306 | nid_alloc = cpuset_slab_spread_node(); |
c61afb18 | 3307 | else if (current->mempolicy) |
e7b691b0 | 3308 | nid_alloc = slab_node(); |
c61afb18 | 3309 | if (nid_alloc != nid_here) |
8b98c169 | 3310 | return ____cache_alloc_node(cachep, flags, nid_alloc); |
c61afb18 PJ |
3311 | return NULL; |
3312 | } | |
3313 | ||
765c4507 CL |
3314 | /* |
3315 | * Fallback function if there was no memory available and no objects on a | |
3c517a61 CL |
3316 | * certain node and fall back is permitted. First we scan all the |
3317 | * available nodelists for available objects. If that fails then we | |
3318 | * perform an allocation without specifying a node. This allows the page | |
3319 | * allocator to do its reclaim / fallback magic. We then insert the | |
3320 | * slab into the proper nodelist and then allocate from it. | |
765c4507 | 3321 | */ |
8c8cc2c1 | 3322 | static void *fallback_alloc(struct kmem_cache *cache, gfp_t flags) |
765c4507 | 3323 | { |
8c8cc2c1 PE |
3324 | struct zonelist *zonelist; |
3325 | gfp_t local_flags; | |
dd1a239f | 3326 | struct zoneref *z; |
54a6eb5c MG |
3327 | struct zone *zone; |
3328 | enum zone_type high_zoneidx = gfp_zone(flags); | |
765c4507 | 3329 | void *obj = NULL; |
3c517a61 | 3330 | int nid; |
cc9a6c87 | 3331 | unsigned int cpuset_mems_cookie; |
8c8cc2c1 PE |
3332 | |
3333 | if (flags & __GFP_THISNODE) | |
3334 | return NULL; | |
3335 | ||
6cb06229 | 3336 | local_flags = flags & (GFP_CONSTRAINT_MASK|GFP_RECLAIM_MASK); |
765c4507 | 3337 | |
cc9a6c87 MG |
3338 | retry_cpuset: |
3339 | cpuset_mems_cookie = get_mems_allowed(); | |
e7b691b0 | 3340 | zonelist = node_zonelist(slab_node(), flags); |
cc9a6c87 | 3341 | |
3c517a61 CL |
3342 | retry: |
3343 | /* | |
3344 | * Look through allowed nodes for objects available | |
3345 | * from existing per node queues. | |
3346 | */ | |
54a6eb5c MG |
3347 | for_each_zone_zonelist(zone, z, zonelist, high_zoneidx) { |
3348 | nid = zone_to_nid(zone); | |
aedb0eb1 | 3349 | |
54a6eb5c | 3350 | if (cpuset_zone_allowed_hardwall(zone, flags) && |
3c517a61 | 3351 | cache->nodelists[nid] && |
481c5346 | 3352 | cache->nodelists[nid]->free_objects) { |
3c517a61 CL |
3353 | obj = ____cache_alloc_node(cache, |
3354 | flags | GFP_THISNODE, nid); | |
481c5346 CL |
3355 | if (obj) |
3356 | break; | |
3357 | } | |
3c517a61 CL |
3358 | } |
3359 | ||
cfce6604 | 3360 | if (!obj) { |
3c517a61 CL |
3361 | /* |
3362 | * This allocation will be performed within the constraints | |
3363 | * of the current cpuset / memory policy requirements. | |
3364 | * We may trigger various forms of reclaim on the allowed | |
3365 | * set and go into memory reserves if necessary. | |
3366 | */ | |
dd47ea75 CL |
3367 | if (local_flags & __GFP_WAIT) |
3368 | local_irq_enable(); | |
3369 | kmem_flagcheck(cache, flags); | |
7d6e6d09 | 3370 | obj = kmem_getpages(cache, local_flags, numa_mem_id()); |
dd47ea75 CL |
3371 | if (local_flags & __GFP_WAIT) |
3372 | local_irq_disable(); | |
3c517a61 CL |
3373 | if (obj) { |
3374 | /* | |
3375 | * Insert into the appropriate per node queues | |
3376 | */ | |
3377 | nid = page_to_nid(virt_to_page(obj)); | |
3378 | if (cache_grow(cache, flags, nid, obj)) { | |
3379 | obj = ____cache_alloc_node(cache, | |
3380 | flags | GFP_THISNODE, nid); | |
3381 | if (!obj) | |
3382 | /* | |
3383 | * Another processor may allocate the | |
3384 | * objects in the slab since we are | |
3385 | * not holding any locks. | |
3386 | */ | |
3387 | goto retry; | |
3388 | } else { | |
b6a60451 | 3389 | /* cache_grow already freed obj */ |
3c517a61 CL |
3390 | obj = NULL; |
3391 | } | |
3392 | } | |
aedb0eb1 | 3393 | } |
cc9a6c87 MG |
3394 | |
3395 | if (unlikely(!put_mems_allowed(cpuset_mems_cookie) && !obj)) | |
3396 | goto retry_cpuset; | |
765c4507 CL |
3397 | return obj; |
3398 | } | |
3399 | ||
e498be7d CL |
3400 | /* |
3401 | * A interface to enable slab creation on nodeid | |
1da177e4 | 3402 | */ |
8b98c169 | 3403 | static void *____cache_alloc_node(struct kmem_cache *cachep, gfp_t flags, |
a737b3e2 | 3404 | int nodeid) |
e498be7d CL |
3405 | { |
3406 | struct list_head *entry; | |
b28a02de PE |
3407 | struct slab *slabp; |
3408 | struct kmem_list3 *l3; | |
3409 | void *obj; | |
b28a02de PE |
3410 | int x; |
3411 | ||
3412 | l3 = cachep->nodelists[nodeid]; | |
3413 | BUG_ON(!l3); | |
3414 | ||
a737b3e2 | 3415 | retry: |
ca3b9b91 | 3416 | check_irq_off(); |
b28a02de PE |
3417 | spin_lock(&l3->list_lock); |
3418 | entry = l3->slabs_partial.next; | |
3419 | if (entry == &l3->slabs_partial) { | |
3420 | l3->free_touched = 1; | |
3421 | entry = l3->slabs_free.next; | |
3422 | if (entry == &l3->slabs_free) | |
3423 | goto must_grow; | |
3424 | } | |
3425 | ||
3426 | slabp = list_entry(entry, struct slab, list); | |
3427 | check_spinlock_acquired_node(cachep, nodeid); | |
3428 | check_slabp(cachep, slabp); | |
3429 | ||
3430 | STATS_INC_NODEALLOCS(cachep); | |
3431 | STATS_INC_ACTIVE(cachep); | |
3432 | STATS_SET_HIGH(cachep); | |
3433 | ||
3434 | BUG_ON(slabp->inuse == cachep->num); | |
3435 | ||
78d382d7 | 3436 | obj = slab_get_obj(cachep, slabp, nodeid); |
b28a02de PE |
3437 | check_slabp(cachep, slabp); |
3438 | l3->free_objects--; | |
3439 | /* move slabp to correct slabp list: */ | |
3440 | list_del(&slabp->list); | |
3441 | ||
a737b3e2 | 3442 | if (slabp->free == BUFCTL_END) |
b28a02de | 3443 | list_add(&slabp->list, &l3->slabs_full); |
a737b3e2 | 3444 | else |
b28a02de | 3445 | list_add(&slabp->list, &l3->slabs_partial); |
e498be7d | 3446 | |
b28a02de PE |
3447 | spin_unlock(&l3->list_lock); |
3448 | goto done; | |
e498be7d | 3449 | |
a737b3e2 | 3450 | must_grow: |
b28a02de | 3451 | spin_unlock(&l3->list_lock); |
3c517a61 | 3452 | x = cache_grow(cachep, flags | GFP_THISNODE, nodeid, NULL); |
765c4507 CL |
3453 | if (x) |
3454 | goto retry; | |
1da177e4 | 3455 | |
8c8cc2c1 | 3456 | return fallback_alloc(cachep, flags); |
e498be7d | 3457 | |
a737b3e2 | 3458 | done: |
b28a02de | 3459 | return obj; |
e498be7d | 3460 | } |
8c8cc2c1 PE |
3461 | |
3462 | /** | |
3463 | * kmem_cache_alloc_node - Allocate an object on the specified node | |
3464 | * @cachep: The cache to allocate from. | |
3465 | * @flags: See kmalloc(). | |
3466 | * @nodeid: node number of the target node. | |
3467 | * @caller: return address of caller, used for debug information | |
3468 | * | |
3469 | * Identical to kmem_cache_alloc but it will allocate memory on the given | |
3470 | * node, which can improve the performance for cpu bound structures. | |
3471 | * | |
3472 | * Fallback to other node is possible if __GFP_THISNODE is not set. | |
3473 | */ | |
3474 | static __always_inline void * | |
48356303 | 3475 | slab_alloc_node(struct kmem_cache *cachep, gfp_t flags, int nodeid, |
7c0cb9c6 | 3476 | unsigned long caller) |
8c8cc2c1 PE |
3477 | { |
3478 | unsigned long save_flags; | |
3479 | void *ptr; | |
7d6e6d09 | 3480 | int slab_node = numa_mem_id(); |
8c8cc2c1 | 3481 | |
dcce284a | 3482 | flags &= gfp_allowed_mask; |
7e85ee0c | 3483 | |
cf40bd16 NP |
3484 | lockdep_trace_alloc(flags); |
3485 | ||
773ff60e | 3486 | if (slab_should_failslab(cachep, flags)) |
824ebef1 AM |
3487 | return NULL; |
3488 | ||
d79923fa GC |
3489 | cachep = memcg_kmem_get_cache(cachep, flags); |
3490 | ||
8c8cc2c1 PE |
3491 | cache_alloc_debugcheck_before(cachep, flags); |
3492 | local_irq_save(save_flags); | |
3493 | ||
eacbbae3 | 3494 | if (nodeid == NUMA_NO_NODE) |
7d6e6d09 | 3495 | nodeid = slab_node; |
8c8cc2c1 PE |
3496 | |
3497 | if (unlikely(!cachep->nodelists[nodeid])) { | |
3498 | /* Node not bootstrapped yet */ | |
3499 | ptr = fallback_alloc(cachep, flags); | |
3500 | goto out; | |
3501 | } | |
3502 | ||
7d6e6d09 | 3503 | if (nodeid == slab_node) { |
8c8cc2c1 PE |
3504 | /* |
3505 | * Use the locally cached objects if possible. | |
3506 | * However ____cache_alloc does not allow fallback | |
3507 | * to other nodes. It may fail while we still have | |
3508 | * objects on other nodes available. | |
3509 | */ | |
3510 | ptr = ____cache_alloc(cachep, flags); | |
3511 | if (ptr) | |
3512 | goto out; | |
3513 | } | |
3514 | /* ___cache_alloc_node can fall back to other nodes */ | |
3515 | ptr = ____cache_alloc_node(cachep, flags, nodeid); | |
3516 | out: | |
3517 | local_irq_restore(save_flags); | |
3518 | ptr = cache_alloc_debugcheck_after(cachep, flags, ptr, caller); | |
8c138bc0 | 3519 | kmemleak_alloc_recursive(ptr, cachep->object_size, 1, cachep->flags, |
d5cff635 | 3520 | flags); |
8c8cc2c1 | 3521 | |
c175eea4 | 3522 | if (likely(ptr)) |
8c138bc0 | 3523 | kmemcheck_slab_alloc(cachep, flags, ptr, cachep->object_size); |
c175eea4 | 3524 | |
d07dbea4 | 3525 | if (unlikely((flags & __GFP_ZERO) && ptr)) |
8c138bc0 | 3526 | memset(ptr, 0, cachep->object_size); |
d07dbea4 | 3527 | |
8c8cc2c1 PE |
3528 | return ptr; |
3529 | } | |
3530 | ||
3531 | static __always_inline void * | |
3532 | __do_cache_alloc(struct kmem_cache *cache, gfp_t flags) | |
3533 | { | |
3534 | void *objp; | |
3535 | ||
3536 | if (unlikely(current->flags & (PF_SPREAD_SLAB | PF_MEMPOLICY))) { | |
3537 | objp = alternate_node_alloc(cache, flags); | |
3538 | if (objp) | |
3539 | goto out; | |
3540 | } | |
3541 | objp = ____cache_alloc(cache, flags); | |
3542 | ||
3543 | /* | |
3544 | * We may just have run out of memory on the local node. | |
3545 | * ____cache_alloc_node() knows how to locate memory on other nodes | |
3546 | */ | |
7d6e6d09 LS |
3547 | if (!objp) |
3548 | objp = ____cache_alloc_node(cache, flags, numa_mem_id()); | |
8c8cc2c1 PE |
3549 | |
3550 | out: | |
3551 | return objp; | |
3552 | } | |
3553 | #else | |
3554 | ||
3555 | static __always_inline void * | |
3556 | __do_cache_alloc(struct kmem_cache *cachep, gfp_t flags) | |
3557 | { | |
3558 | return ____cache_alloc(cachep, flags); | |
3559 | } | |
3560 | ||
3561 | #endif /* CONFIG_NUMA */ | |
3562 | ||
3563 | static __always_inline void * | |
48356303 | 3564 | slab_alloc(struct kmem_cache *cachep, gfp_t flags, unsigned long caller) |
8c8cc2c1 PE |
3565 | { |
3566 | unsigned long save_flags; | |
3567 | void *objp; | |
3568 | ||
dcce284a | 3569 | flags &= gfp_allowed_mask; |
7e85ee0c | 3570 | |
cf40bd16 NP |
3571 | lockdep_trace_alloc(flags); |
3572 | ||
773ff60e | 3573 | if (slab_should_failslab(cachep, flags)) |
824ebef1 AM |
3574 | return NULL; |
3575 | ||
d79923fa GC |
3576 | cachep = memcg_kmem_get_cache(cachep, flags); |
3577 | ||
8c8cc2c1 PE |
3578 | cache_alloc_debugcheck_before(cachep, flags); |
3579 | local_irq_save(save_flags); | |
3580 | objp = __do_cache_alloc(cachep, flags); | |
3581 | local_irq_restore(save_flags); | |
3582 | objp = cache_alloc_debugcheck_after(cachep, flags, objp, caller); | |
8c138bc0 | 3583 | kmemleak_alloc_recursive(objp, cachep->object_size, 1, cachep->flags, |
d5cff635 | 3584 | flags); |
8c8cc2c1 PE |
3585 | prefetchw(objp); |
3586 | ||
c175eea4 | 3587 | if (likely(objp)) |
8c138bc0 | 3588 | kmemcheck_slab_alloc(cachep, flags, objp, cachep->object_size); |
c175eea4 | 3589 | |
d07dbea4 | 3590 | if (unlikely((flags & __GFP_ZERO) && objp)) |
8c138bc0 | 3591 | memset(objp, 0, cachep->object_size); |
d07dbea4 | 3592 | |
8c8cc2c1 PE |
3593 | return objp; |
3594 | } | |
e498be7d CL |
3595 | |
3596 | /* | |
3597 | * Caller needs to acquire correct kmem_list's list_lock | |
3598 | */ | |
343e0d7a | 3599 | static void free_block(struct kmem_cache *cachep, void **objpp, int nr_objects, |
b28a02de | 3600 | int node) |
1da177e4 LT |
3601 | { |
3602 | int i; | |
e498be7d | 3603 | struct kmem_list3 *l3; |
1da177e4 LT |
3604 | |
3605 | for (i = 0; i < nr_objects; i++) { | |
072bb0aa | 3606 | void *objp; |
1da177e4 | 3607 | struct slab *slabp; |
1da177e4 | 3608 | |
072bb0aa MG |
3609 | clear_obj_pfmemalloc(&objpp[i]); |
3610 | objp = objpp[i]; | |
3611 | ||
6ed5eb22 | 3612 | slabp = virt_to_slab(objp); |
ff69416e | 3613 | l3 = cachep->nodelists[node]; |
1da177e4 | 3614 | list_del(&slabp->list); |
ff69416e | 3615 | check_spinlock_acquired_node(cachep, node); |
1da177e4 | 3616 | check_slabp(cachep, slabp); |
78d382d7 | 3617 | slab_put_obj(cachep, slabp, objp, node); |
1da177e4 | 3618 | STATS_DEC_ACTIVE(cachep); |
e498be7d | 3619 | l3->free_objects++; |
1da177e4 LT |
3620 | check_slabp(cachep, slabp); |
3621 | ||
3622 | /* fixup slab chains */ | |
3623 | if (slabp->inuse == 0) { | |
e498be7d CL |
3624 | if (l3->free_objects > l3->free_limit) { |
3625 | l3->free_objects -= cachep->num; | |
e5ac9c5a RT |
3626 | /* No need to drop any previously held |
3627 | * lock here, even if we have a off-slab slab | |
3628 | * descriptor it is guaranteed to come from | |
3629 | * a different cache, refer to comments before | |
3630 | * alloc_slabmgmt. | |
3631 | */ | |
1da177e4 LT |
3632 | slab_destroy(cachep, slabp); |
3633 | } else { | |
e498be7d | 3634 | list_add(&slabp->list, &l3->slabs_free); |
1da177e4 LT |
3635 | } |
3636 | } else { | |
3637 | /* Unconditionally move a slab to the end of the | |
3638 | * partial list on free - maximum time for the | |
3639 | * other objects to be freed, too. | |
3640 | */ | |
e498be7d | 3641 | list_add_tail(&slabp->list, &l3->slabs_partial); |
1da177e4 LT |
3642 | } |
3643 | } | |
3644 | } | |
3645 | ||
343e0d7a | 3646 | static void cache_flusharray(struct kmem_cache *cachep, struct array_cache *ac) |
1da177e4 LT |
3647 | { |
3648 | int batchcount; | |
e498be7d | 3649 | struct kmem_list3 *l3; |
7d6e6d09 | 3650 | int node = numa_mem_id(); |
1da177e4 LT |
3651 | |
3652 | batchcount = ac->batchcount; | |
3653 | #if DEBUG | |
3654 | BUG_ON(!batchcount || batchcount > ac->avail); | |
3655 | #endif | |
3656 | check_irq_off(); | |
ff69416e | 3657 | l3 = cachep->nodelists[node]; |
873623df | 3658 | spin_lock(&l3->list_lock); |
e498be7d CL |
3659 | if (l3->shared) { |
3660 | struct array_cache *shared_array = l3->shared; | |
b28a02de | 3661 | int max = shared_array->limit - shared_array->avail; |
1da177e4 LT |
3662 | if (max) { |
3663 | if (batchcount > max) | |
3664 | batchcount = max; | |
e498be7d | 3665 | memcpy(&(shared_array->entry[shared_array->avail]), |
b28a02de | 3666 | ac->entry, sizeof(void *) * batchcount); |
1da177e4 LT |
3667 | shared_array->avail += batchcount; |
3668 | goto free_done; | |
3669 | } | |
3670 | } | |
3671 | ||
ff69416e | 3672 | free_block(cachep, ac->entry, batchcount, node); |
a737b3e2 | 3673 | free_done: |
1da177e4 LT |
3674 | #if STATS |
3675 | { | |
3676 | int i = 0; | |
3677 | struct list_head *p; | |
3678 | ||
e498be7d CL |
3679 | p = l3->slabs_free.next; |
3680 | while (p != &(l3->slabs_free)) { | |
1da177e4 LT |
3681 | struct slab *slabp; |
3682 | ||
3683 | slabp = list_entry(p, struct slab, list); | |
3684 | BUG_ON(slabp->inuse); | |
3685 | ||
3686 | i++; | |
3687 | p = p->next; | |
3688 | } | |
3689 | STATS_SET_FREEABLE(cachep, i); | |
3690 | } | |
3691 | #endif | |
e498be7d | 3692 | spin_unlock(&l3->list_lock); |
1da177e4 | 3693 | ac->avail -= batchcount; |
a737b3e2 | 3694 | memmove(ac->entry, &(ac->entry[batchcount]), sizeof(void *)*ac->avail); |
1da177e4 LT |
3695 | } |
3696 | ||
3697 | /* | |
a737b3e2 AM |
3698 | * Release an obj back to its cache. If the obj has a constructed state, it must |
3699 | * be in this state _before_ it is released. Called with disabled ints. | |
1da177e4 | 3700 | */ |
a947eb95 | 3701 | static inline void __cache_free(struct kmem_cache *cachep, void *objp, |
7c0cb9c6 | 3702 | unsigned long caller) |
1da177e4 | 3703 | { |
9a2dba4b | 3704 | struct array_cache *ac = cpu_cache_get(cachep); |
1da177e4 LT |
3705 | |
3706 | check_irq_off(); | |
d5cff635 | 3707 | kmemleak_free_recursive(objp, cachep->flags); |
a947eb95 | 3708 | objp = cache_free_debugcheck(cachep, objp, caller); |
1da177e4 | 3709 | |
8c138bc0 | 3710 | kmemcheck_slab_free(cachep, objp, cachep->object_size); |
c175eea4 | 3711 | |
1807a1aa SS |
3712 | /* |
3713 | * Skip calling cache_free_alien() when the platform is not numa. | |
3714 | * This will avoid cache misses that happen while accessing slabp (which | |
3715 | * is per page memory reference) to get nodeid. Instead use a global | |
3716 | * variable to skip the call, which is mostly likely to be present in | |
3717 | * the cache. | |
3718 | */ | |
b6e68bc1 | 3719 | if (nr_online_nodes > 1 && cache_free_alien(cachep, objp)) |
729bd0b7 PE |
3720 | return; |
3721 | ||
1da177e4 LT |
3722 | if (likely(ac->avail < ac->limit)) { |
3723 | STATS_INC_FREEHIT(cachep); | |
1da177e4 LT |
3724 | } else { |
3725 | STATS_INC_FREEMISS(cachep); | |
3726 | cache_flusharray(cachep, ac); | |
1da177e4 | 3727 | } |
42c8c99c | 3728 | |
072bb0aa | 3729 | ac_put_obj(cachep, ac, objp); |
1da177e4 LT |
3730 | } |
3731 | ||
3732 | /** | |
3733 | * kmem_cache_alloc - Allocate an object | |
3734 | * @cachep: The cache to allocate from. | |
3735 | * @flags: See kmalloc(). | |
3736 | * | |
3737 | * Allocate an object from this cache. The flags are only relevant | |
3738 | * if the cache has no available objects. | |
3739 | */ | |
343e0d7a | 3740 | void *kmem_cache_alloc(struct kmem_cache *cachep, gfp_t flags) |
1da177e4 | 3741 | { |
48356303 | 3742 | void *ret = slab_alloc(cachep, flags, _RET_IP_); |
36555751 | 3743 | |
ca2b84cb | 3744 | trace_kmem_cache_alloc(_RET_IP_, ret, |
8c138bc0 | 3745 | cachep->object_size, cachep->size, flags); |
36555751 EGM |
3746 | |
3747 | return ret; | |
1da177e4 LT |
3748 | } |
3749 | EXPORT_SYMBOL(kmem_cache_alloc); | |
3750 | ||
0f24f128 | 3751 | #ifdef CONFIG_TRACING |
85beb586 | 3752 | void * |
4052147c | 3753 | kmem_cache_alloc_trace(struct kmem_cache *cachep, gfp_t flags, size_t size) |
36555751 | 3754 | { |
85beb586 SR |
3755 | void *ret; |
3756 | ||
48356303 | 3757 | ret = slab_alloc(cachep, flags, _RET_IP_); |
85beb586 SR |
3758 | |
3759 | trace_kmalloc(_RET_IP_, ret, | |
ff4fcd01 | 3760 | size, cachep->size, flags); |
85beb586 | 3761 | return ret; |
36555751 | 3762 | } |
85beb586 | 3763 | EXPORT_SYMBOL(kmem_cache_alloc_trace); |
36555751 EGM |
3764 | #endif |
3765 | ||
1da177e4 | 3766 | #ifdef CONFIG_NUMA |
8b98c169 CH |
3767 | void *kmem_cache_alloc_node(struct kmem_cache *cachep, gfp_t flags, int nodeid) |
3768 | { | |
48356303 | 3769 | void *ret = slab_alloc_node(cachep, flags, nodeid, _RET_IP_); |
36555751 | 3770 | |
ca2b84cb | 3771 | trace_kmem_cache_alloc_node(_RET_IP_, ret, |
8c138bc0 | 3772 | cachep->object_size, cachep->size, |
ca2b84cb | 3773 | flags, nodeid); |
36555751 EGM |
3774 | |
3775 | return ret; | |
8b98c169 | 3776 | } |
1da177e4 LT |
3777 | EXPORT_SYMBOL(kmem_cache_alloc_node); |
3778 | ||
0f24f128 | 3779 | #ifdef CONFIG_TRACING |
4052147c | 3780 | void *kmem_cache_alloc_node_trace(struct kmem_cache *cachep, |
85beb586 | 3781 | gfp_t flags, |
4052147c EG |
3782 | int nodeid, |
3783 | size_t size) | |
36555751 | 3784 | { |
85beb586 SR |
3785 | void *ret; |
3786 | ||
592f4145 | 3787 | ret = slab_alloc_node(cachep, flags, nodeid, _RET_IP_); |
7c0cb9c6 | 3788 | |
85beb586 | 3789 | trace_kmalloc_node(_RET_IP_, ret, |
ff4fcd01 | 3790 | size, cachep->size, |
85beb586 SR |
3791 | flags, nodeid); |
3792 | return ret; | |
36555751 | 3793 | } |
85beb586 | 3794 | EXPORT_SYMBOL(kmem_cache_alloc_node_trace); |
36555751 EGM |
3795 | #endif |
3796 | ||
8b98c169 | 3797 | static __always_inline void * |
7c0cb9c6 | 3798 | __do_kmalloc_node(size_t size, gfp_t flags, int node, unsigned long caller) |
97e2bde4 | 3799 | { |
343e0d7a | 3800 | struct kmem_cache *cachep; |
97e2bde4 MS |
3801 | |
3802 | cachep = kmem_find_general_cachep(size, flags); | |
6cb8f913 CL |
3803 | if (unlikely(ZERO_OR_NULL_PTR(cachep))) |
3804 | return cachep; | |
4052147c | 3805 | return kmem_cache_alloc_node_trace(cachep, flags, node, size); |
97e2bde4 | 3806 | } |
8b98c169 | 3807 | |
0bb38a5c | 3808 | #if defined(CONFIG_DEBUG_SLAB) || defined(CONFIG_TRACING) |
8b98c169 CH |
3809 | void *__kmalloc_node(size_t size, gfp_t flags, int node) |
3810 | { | |
7c0cb9c6 | 3811 | return __do_kmalloc_node(size, flags, node, _RET_IP_); |
8b98c169 | 3812 | } |
dbe5e69d | 3813 | EXPORT_SYMBOL(__kmalloc_node); |
8b98c169 CH |
3814 | |
3815 | void *__kmalloc_node_track_caller(size_t size, gfp_t flags, | |
ce71e27c | 3816 | int node, unsigned long caller) |
8b98c169 | 3817 | { |
7c0cb9c6 | 3818 | return __do_kmalloc_node(size, flags, node, caller); |
8b98c169 CH |
3819 | } |
3820 | EXPORT_SYMBOL(__kmalloc_node_track_caller); | |
3821 | #else | |
3822 | void *__kmalloc_node(size_t size, gfp_t flags, int node) | |
3823 | { | |
7c0cb9c6 | 3824 | return __do_kmalloc_node(size, flags, node, 0); |
8b98c169 CH |
3825 | } |
3826 | EXPORT_SYMBOL(__kmalloc_node); | |
0bb38a5c | 3827 | #endif /* CONFIG_DEBUG_SLAB || CONFIG_TRACING */ |
8b98c169 | 3828 | #endif /* CONFIG_NUMA */ |
1da177e4 LT |
3829 | |
3830 | /** | |
800590f5 | 3831 | * __do_kmalloc - allocate memory |
1da177e4 | 3832 | * @size: how many bytes of memory are required. |
800590f5 | 3833 | * @flags: the type of memory to allocate (see kmalloc). |
911851e6 | 3834 | * @caller: function caller for debug tracking of the caller |
1da177e4 | 3835 | */ |
7fd6b141 | 3836 | static __always_inline void *__do_kmalloc(size_t size, gfp_t flags, |
7c0cb9c6 | 3837 | unsigned long caller) |
1da177e4 | 3838 | { |
343e0d7a | 3839 | struct kmem_cache *cachep; |
36555751 | 3840 | void *ret; |
1da177e4 | 3841 | |
97e2bde4 MS |
3842 | /* If you want to save a few bytes .text space: replace |
3843 | * __ with kmem_. | |
3844 | * Then kmalloc uses the uninlined functions instead of the inline | |
3845 | * functions. | |
3846 | */ | |
3847 | cachep = __find_general_cachep(size, flags); | |
a5c96d8a LT |
3848 | if (unlikely(ZERO_OR_NULL_PTR(cachep))) |
3849 | return cachep; | |
48356303 | 3850 | ret = slab_alloc(cachep, flags, caller); |
36555751 | 3851 | |
7c0cb9c6 | 3852 | trace_kmalloc(caller, ret, |
3b0efdfa | 3853 | size, cachep->size, flags); |
36555751 EGM |
3854 | |
3855 | return ret; | |
7fd6b141 PE |
3856 | } |
3857 | ||
7fd6b141 | 3858 | |
0bb38a5c | 3859 | #if defined(CONFIG_DEBUG_SLAB) || defined(CONFIG_TRACING) |
7fd6b141 PE |
3860 | void *__kmalloc(size_t size, gfp_t flags) |
3861 | { | |
7c0cb9c6 | 3862 | return __do_kmalloc(size, flags, _RET_IP_); |
1da177e4 LT |
3863 | } |
3864 | EXPORT_SYMBOL(__kmalloc); | |
3865 | ||
ce71e27c | 3866 | void *__kmalloc_track_caller(size_t size, gfp_t flags, unsigned long caller) |
7fd6b141 | 3867 | { |
7c0cb9c6 | 3868 | return __do_kmalloc(size, flags, caller); |
7fd6b141 PE |
3869 | } |
3870 | EXPORT_SYMBOL(__kmalloc_track_caller); | |
1d2c8eea CH |
3871 | |
3872 | #else | |
3873 | void *__kmalloc(size_t size, gfp_t flags) | |
3874 | { | |
7c0cb9c6 | 3875 | return __do_kmalloc(size, flags, 0); |
1d2c8eea CH |
3876 | } |
3877 | EXPORT_SYMBOL(__kmalloc); | |
7fd6b141 PE |
3878 | #endif |
3879 | ||
1da177e4 LT |
3880 | /** |
3881 | * kmem_cache_free - Deallocate an object | |
3882 | * @cachep: The cache the allocation was from. | |
3883 | * @objp: The previously allocated object. | |
3884 | * | |
3885 | * Free an object which was previously allocated from this | |
3886 | * cache. | |
3887 | */ | |
343e0d7a | 3888 | void kmem_cache_free(struct kmem_cache *cachep, void *objp) |
1da177e4 LT |
3889 | { |
3890 | unsigned long flags; | |
b9ce5ef4 GC |
3891 | cachep = cache_from_obj(cachep, objp); |
3892 | if (!cachep) | |
3893 | return; | |
1da177e4 LT |
3894 | |
3895 | local_irq_save(flags); | |
d97d476b | 3896 | debug_check_no_locks_freed(objp, cachep->object_size); |
3ac7fe5a | 3897 | if (!(cachep->flags & SLAB_DEBUG_OBJECTS)) |
8c138bc0 | 3898 | debug_check_no_obj_freed(objp, cachep->object_size); |
7c0cb9c6 | 3899 | __cache_free(cachep, objp, _RET_IP_); |
1da177e4 | 3900 | local_irq_restore(flags); |
36555751 | 3901 | |
ca2b84cb | 3902 | trace_kmem_cache_free(_RET_IP_, objp); |
1da177e4 LT |
3903 | } |
3904 | EXPORT_SYMBOL(kmem_cache_free); | |
3905 | ||
1da177e4 LT |
3906 | /** |
3907 | * kfree - free previously allocated memory | |
3908 | * @objp: pointer returned by kmalloc. | |
3909 | * | |
80e93eff PE |
3910 | * If @objp is NULL, no operation is performed. |
3911 | * | |
1da177e4 LT |
3912 | * Don't free memory not originally allocated by kmalloc() |
3913 | * or you will run into trouble. | |
3914 | */ | |
3915 | void kfree(const void *objp) | |
3916 | { | |
343e0d7a | 3917 | struct kmem_cache *c; |
1da177e4 LT |
3918 | unsigned long flags; |
3919 | ||
2121db74 PE |
3920 | trace_kfree(_RET_IP_, objp); |
3921 | ||
6cb8f913 | 3922 | if (unlikely(ZERO_OR_NULL_PTR(objp))) |
1da177e4 LT |
3923 | return; |
3924 | local_irq_save(flags); | |
3925 | kfree_debugcheck(objp); | |
6ed5eb22 | 3926 | c = virt_to_cache(objp); |
8c138bc0 CL |
3927 | debug_check_no_locks_freed(objp, c->object_size); |
3928 | ||
3929 | debug_check_no_obj_freed(objp, c->object_size); | |
7c0cb9c6 | 3930 | __cache_free(c, (void *)objp, _RET_IP_); |
1da177e4 LT |
3931 | local_irq_restore(flags); |
3932 | } | |
3933 | EXPORT_SYMBOL(kfree); | |
3934 | ||
e498be7d | 3935 | /* |
183ff22b | 3936 | * This initializes kmem_list3 or resizes various caches for all nodes. |
e498be7d | 3937 | */ |
83b519e8 | 3938 | static int alloc_kmemlist(struct kmem_cache *cachep, gfp_t gfp) |
e498be7d CL |
3939 | { |
3940 | int node; | |
3941 | struct kmem_list3 *l3; | |
cafeb02e | 3942 | struct array_cache *new_shared; |
3395ee05 | 3943 | struct array_cache **new_alien = NULL; |
e498be7d | 3944 | |
9c09a95c | 3945 | for_each_online_node(node) { |
cafeb02e | 3946 | |
3395ee05 | 3947 | if (use_alien_caches) { |
83b519e8 | 3948 | new_alien = alloc_alien_cache(node, cachep->limit, gfp); |
3395ee05 PM |
3949 | if (!new_alien) |
3950 | goto fail; | |
3951 | } | |
cafeb02e | 3952 | |
63109846 ED |
3953 | new_shared = NULL; |
3954 | if (cachep->shared) { | |
3955 | new_shared = alloc_arraycache(node, | |
0718dc2a | 3956 | cachep->shared*cachep->batchcount, |
83b519e8 | 3957 | 0xbaadf00d, gfp); |
63109846 ED |
3958 | if (!new_shared) { |
3959 | free_alien_cache(new_alien); | |
3960 | goto fail; | |
3961 | } | |
0718dc2a | 3962 | } |
cafeb02e | 3963 | |
a737b3e2 AM |
3964 | l3 = cachep->nodelists[node]; |
3965 | if (l3) { | |
cafeb02e CL |
3966 | struct array_cache *shared = l3->shared; |
3967 | ||
e498be7d CL |
3968 | spin_lock_irq(&l3->list_lock); |
3969 | ||
cafeb02e | 3970 | if (shared) |
0718dc2a CL |
3971 | free_block(cachep, shared->entry, |
3972 | shared->avail, node); | |
e498be7d | 3973 | |
cafeb02e CL |
3974 | l3->shared = new_shared; |
3975 | if (!l3->alien) { | |
e498be7d CL |
3976 | l3->alien = new_alien; |
3977 | new_alien = NULL; | |
3978 | } | |
b28a02de | 3979 | l3->free_limit = (1 + nr_cpus_node(node)) * |
a737b3e2 | 3980 | cachep->batchcount + cachep->num; |
e498be7d | 3981 | spin_unlock_irq(&l3->list_lock); |
cafeb02e | 3982 | kfree(shared); |
e498be7d CL |
3983 | free_alien_cache(new_alien); |
3984 | continue; | |
3985 | } | |
83b519e8 | 3986 | l3 = kmalloc_node(sizeof(struct kmem_list3), gfp, node); |
0718dc2a CL |
3987 | if (!l3) { |
3988 | free_alien_cache(new_alien); | |
3989 | kfree(new_shared); | |
e498be7d | 3990 | goto fail; |
0718dc2a | 3991 | } |
e498be7d CL |
3992 | |
3993 | kmem_list3_init(l3); | |
3994 | l3->next_reap = jiffies + REAPTIMEOUT_LIST3 + | |
a737b3e2 | 3995 | ((unsigned long)cachep) % REAPTIMEOUT_LIST3; |
cafeb02e | 3996 | l3->shared = new_shared; |
e498be7d | 3997 | l3->alien = new_alien; |
b28a02de | 3998 | l3->free_limit = (1 + nr_cpus_node(node)) * |
a737b3e2 | 3999 | cachep->batchcount + cachep->num; |
e498be7d CL |
4000 | cachep->nodelists[node] = l3; |
4001 | } | |
cafeb02e | 4002 | return 0; |
0718dc2a | 4003 | |
a737b3e2 | 4004 | fail: |
3b0efdfa | 4005 | if (!cachep->list.next) { |
0718dc2a CL |
4006 | /* Cache is not active yet. Roll back what we did */ |
4007 | node--; | |
4008 | while (node >= 0) { | |
4009 | if (cachep->nodelists[node]) { | |
4010 | l3 = cachep->nodelists[node]; | |
4011 | ||
4012 | kfree(l3->shared); | |
4013 | free_alien_cache(l3->alien); | |
4014 | kfree(l3); | |
4015 | cachep->nodelists[node] = NULL; | |
4016 | } | |
4017 | node--; | |
4018 | } | |
4019 | } | |
cafeb02e | 4020 | return -ENOMEM; |
e498be7d CL |
4021 | } |
4022 | ||
1da177e4 | 4023 | struct ccupdate_struct { |
343e0d7a | 4024 | struct kmem_cache *cachep; |
acfe7d74 | 4025 | struct array_cache *new[0]; |
1da177e4 LT |
4026 | }; |
4027 | ||
4028 | static void do_ccupdate_local(void *info) | |
4029 | { | |
a737b3e2 | 4030 | struct ccupdate_struct *new = info; |
1da177e4 LT |
4031 | struct array_cache *old; |
4032 | ||
4033 | check_irq_off(); | |
9a2dba4b | 4034 | old = cpu_cache_get(new->cachep); |
e498be7d | 4035 | |
1da177e4 LT |
4036 | new->cachep->array[smp_processor_id()] = new->new[smp_processor_id()]; |
4037 | new->new[smp_processor_id()] = old; | |
4038 | } | |
4039 | ||
18004c5d | 4040 | /* Always called with the slab_mutex held */ |
a737b3e2 | 4041 | static int do_tune_cpucache(struct kmem_cache *cachep, int limit, |
83b519e8 | 4042 | int batchcount, int shared, gfp_t gfp) |
1da177e4 | 4043 | { |
d2e7b7d0 | 4044 | struct ccupdate_struct *new; |
2ed3a4ef | 4045 | int i; |
1da177e4 | 4046 | |
acfe7d74 ED |
4047 | new = kzalloc(sizeof(*new) + nr_cpu_ids * sizeof(struct array_cache *), |
4048 | gfp); | |
d2e7b7d0 SS |
4049 | if (!new) |
4050 | return -ENOMEM; | |
4051 | ||
e498be7d | 4052 | for_each_online_cpu(i) { |
7d6e6d09 | 4053 | new->new[i] = alloc_arraycache(cpu_to_mem(i), limit, |
83b519e8 | 4054 | batchcount, gfp); |
d2e7b7d0 | 4055 | if (!new->new[i]) { |
b28a02de | 4056 | for (i--; i >= 0; i--) |
d2e7b7d0 SS |
4057 | kfree(new->new[i]); |
4058 | kfree(new); | |
e498be7d | 4059 | return -ENOMEM; |
1da177e4 LT |
4060 | } |
4061 | } | |
d2e7b7d0 | 4062 | new->cachep = cachep; |
1da177e4 | 4063 | |
15c8b6c1 | 4064 | on_each_cpu(do_ccupdate_local, (void *)new, 1); |
e498be7d | 4065 | |
1da177e4 | 4066 | check_irq_on(); |
1da177e4 LT |
4067 | cachep->batchcount = batchcount; |
4068 | cachep->limit = limit; | |
e498be7d | 4069 | cachep->shared = shared; |
1da177e4 | 4070 | |
e498be7d | 4071 | for_each_online_cpu(i) { |
d2e7b7d0 | 4072 | struct array_cache *ccold = new->new[i]; |
1da177e4 LT |
4073 | if (!ccold) |
4074 | continue; | |
7d6e6d09 LS |
4075 | spin_lock_irq(&cachep->nodelists[cpu_to_mem(i)]->list_lock); |
4076 | free_block(cachep, ccold->entry, ccold->avail, cpu_to_mem(i)); | |
4077 | spin_unlock_irq(&cachep->nodelists[cpu_to_mem(i)]->list_lock); | |
1da177e4 LT |
4078 | kfree(ccold); |
4079 | } | |
d2e7b7d0 | 4080 | kfree(new); |
83b519e8 | 4081 | return alloc_kmemlist(cachep, gfp); |
1da177e4 LT |
4082 | } |
4083 | ||
18004c5d | 4084 | /* Called with slab_mutex held always */ |
83b519e8 | 4085 | static int enable_cpucache(struct kmem_cache *cachep, gfp_t gfp) |
1da177e4 LT |
4086 | { |
4087 | int err; | |
4088 | int limit, shared; | |
4089 | ||
a737b3e2 AM |
4090 | /* |
4091 | * The head array serves three purposes: | |
1da177e4 LT |
4092 | * - create a LIFO ordering, i.e. return objects that are cache-warm |
4093 | * - reduce the number of spinlock operations. | |
a737b3e2 | 4094 | * - reduce the number of linked list operations on the slab and |
1da177e4 LT |
4095 | * bufctl chains: array operations are cheaper. |
4096 | * The numbers are guessed, we should auto-tune as described by | |
4097 | * Bonwick. | |
4098 | */ | |
3b0efdfa | 4099 | if (cachep->size > 131072) |
1da177e4 | 4100 | limit = 1; |
3b0efdfa | 4101 | else if (cachep->size > PAGE_SIZE) |
1da177e4 | 4102 | limit = 8; |
3b0efdfa | 4103 | else if (cachep->size > 1024) |
1da177e4 | 4104 | limit = 24; |
3b0efdfa | 4105 | else if (cachep->size > 256) |
1da177e4 LT |
4106 | limit = 54; |
4107 | else | |
4108 | limit = 120; | |
4109 | ||
a737b3e2 AM |
4110 | /* |
4111 | * CPU bound tasks (e.g. network routing) can exhibit cpu bound | |
1da177e4 LT |
4112 | * allocation behaviour: Most allocs on one cpu, most free operations |
4113 | * on another cpu. For these cases, an efficient object passing between | |
4114 | * cpus is necessary. This is provided by a shared array. The array | |
4115 | * replaces Bonwick's magazine layer. | |
4116 | * On uniprocessor, it's functionally equivalent (but less efficient) | |
4117 | * to a larger limit. Thus disabled by default. | |
4118 | */ | |
4119 | shared = 0; | |
3b0efdfa | 4120 | if (cachep->size <= PAGE_SIZE && num_possible_cpus() > 1) |
1da177e4 | 4121 | shared = 8; |
1da177e4 LT |
4122 | |
4123 | #if DEBUG | |
a737b3e2 AM |
4124 | /* |
4125 | * With debugging enabled, large batchcount lead to excessively long | |
4126 | * periods with disabled local interrupts. Limit the batchcount | |
1da177e4 LT |
4127 | */ |
4128 | if (limit > 32) | |
4129 | limit = 32; | |
4130 | #endif | |
83b519e8 | 4131 | err = do_tune_cpucache(cachep, limit, (limit + 1) / 2, shared, gfp); |
1da177e4 LT |
4132 | if (err) |
4133 | printk(KERN_ERR "enable_cpucache failed for %s, error %d.\n", | |
b28a02de | 4134 | cachep->name, -err); |
2ed3a4ef | 4135 | return err; |
1da177e4 LT |
4136 | } |
4137 | ||
1b55253a CL |
4138 | /* |
4139 | * Drain an array if it contains any elements taking the l3 lock only if | |
b18e7e65 CL |
4140 | * necessary. Note that the l3 listlock also protects the array_cache |
4141 | * if drain_array() is used on the shared array. | |
1b55253a | 4142 | */ |
68a1b195 | 4143 | static void drain_array(struct kmem_cache *cachep, struct kmem_list3 *l3, |
1b55253a | 4144 | struct array_cache *ac, int force, int node) |
1da177e4 LT |
4145 | { |
4146 | int tofree; | |
4147 | ||
1b55253a CL |
4148 | if (!ac || !ac->avail) |
4149 | return; | |
1da177e4 LT |
4150 | if (ac->touched && !force) { |
4151 | ac->touched = 0; | |
b18e7e65 | 4152 | } else { |
1b55253a | 4153 | spin_lock_irq(&l3->list_lock); |
b18e7e65 CL |
4154 | if (ac->avail) { |
4155 | tofree = force ? ac->avail : (ac->limit + 4) / 5; | |
4156 | if (tofree > ac->avail) | |
4157 | tofree = (ac->avail + 1) / 2; | |
4158 | free_block(cachep, ac->entry, tofree, node); | |
4159 | ac->avail -= tofree; | |
4160 | memmove(ac->entry, &(ac->entry[tofree]), | |
4161 | sizeof(void *) * ac->avail); | |
4162 | } | |
1b55253a | 4163 | spin_unlock_irq(&l3->list_lock); |
1da177e4 LT |
4164 | } |
4165 | } | |
4166 | ||
4167 | /** | |
4168 | * cache_reap - Reclaim memory from caches. | |
05fb6bf0 | 4169 | * @w: work descriptor |
1da177e4 LT |
4170 | * |
4171 | * Called from workqueue/eventd every few seconds. | |
4172 | * Purpose: | |
4173 | * - clear the per-cpu caches for this CPU. | |
4174 | * - return freeable pages to the main free memory pool. | |
4175 | * | |
a737b3e2 AM |
4176 | * If we cannot acquire the cache chain mutex then just give up - we'll try |
4177 | * again on the next iteration. | |
1da177e4 | 4178 | */ |
7c5cae36 | 4179 | static void cache_reap(struct work_struct *w) |
1da177e4 | 4180 | { |
7a7c381d | 4181 | struct kmem_cache *searchp; |
e498be7d | 4182 | struct kmem_list3 *l3; |
7d6e6d09 | 4183 | int node = numa_mem_id(); |
bf6aede7 | 4184 | struct delayed_work *work = to_delayed_work(w); |
1da177e4 | 4185 | |
18004c5d | 4186 | if (!mutex_trylock(&slab_mutex)) |
1da177e4 | 4187 | /* Give up. Setup the next iteration. */ |
7c5cae36 | 4188 | goto out; |
1da177e4 | 4189 | |
18004c5d | 4190 | list_for_each_entry(searchp, &slab_caches, list) { |
1da177e4 LT |
4191 | check_irq_on(); |
4192 | ||
35386e3b CL |
4193 | /* |
4194 | * We only take the l3 lock if absolutely necessary and we | |
4195 | * have established with reasonable certainty that | |
4196 | * we can do some work if the lock was obtained. | |
4197 | */ | |
aab2207c | 4198 | l3 = searchp->nodelists[node]; |
35386e3b | 4199 | |
8fce4d8e | 4200 | reap_alien(searchp, l3); |
1da177e4 | 4201 | |
aab2207c | 4202 | drain_array(searchp, l3, cpu_cache_get(searchp), 0, node); |
1da177e4 | 4203 | |
35386e3b CL |
4204 | /* |
4205 | * These are racy checks but it does not matter | |
4206 | * if we skip one check or scan twice. | |
4207 | */ | |
e498be7d | 4208 | if (time_after(l3->next_reap, jiffies)) |
35386e3b | 4209 | goto next; |
1da177e4 | 4210 | |
e498be7d | 4211 | l3->next_reap = jiffies + REAPTIMEOUT_LIST3; |
1da177e4 | 4212 | |
aab2207c | 4213 | drain_array(searchp, l3, l3->shared, 0, node); |
1da177e4 | 4214 | |
ed11d9eb | 4215 | if (l3->free_touched) |
e498be7d | 4216 | l3->free_touched = 0; |
ed11d9eb CL |
4217 | else { |
4218 | int freed; | |
1da177e4 | 4219 | |
ed11d9eb CL |
4220 | freed = drain_freelist(searchp, l3, (l3->free_limit + |
4221 | 5 * searchp->num - 1) / (5 * searchp->num)); | |
4222 | STATS_ADD_REAPED(searchp, freed); | |
4223 | } | |
35386e3b | 4224 | next: |
1da177e4 LT |
4225 | cond_resched(); |
4226 | } | |
4227 | check_irq_on(); | |
18004c5d | 4228 | mutex_unlock(&slab_mutex); |
8fce4d8e | 4229 | next_reap_node(); |
7c5cae36 | 4230 | out: |
a737b3e2 | 4231 | /* Set up the next iteration */ |
7c5cae36 | 4232 | schedule_delayed_work(work, round_jiffies_relative(REAPTIMEOUT_CPUC)); |
1da177e4 LT |
4233 | } |
4234 | ||
158a9624 | 4235 | #ifdef CONFIG_SLABINFO |
0d7561c6 | 4236 | void get_slabinfo(struct kmem_cache *cachep, struct slabinfo *sinfo) |
1da177e4 | 4237 | { |
b28a02de PE |
4238 | struct slab *slabp; |
4239 | unsigned long active_objs; | |
4240 | unsigned long num_objs; | |
4241 | unsigned long active_slabs = 0; | |
4242 | unsigned long num_slabs, free_objects = 0, shared_avail = 0; | |
e498be7d | 4243 | const char *name; |
1da177e4 | 4244 | char *error = NULL; |
e498be7d CL |
4245 | int node; |
4246 | struct kmem_list3 *l3; | |
1da177e4 | 4247 | |
1da177e4 LT |
4248 | active_objs = 0; |
4249 | num_slabs = 0; | |
e498be7d CL |
4250 | for_each_online_node(node) { |
4251 | l3 = cachep->nodelists[node]; | |
4252 | if (!l3) | |
4253 | continue; | |
4254 | ||
ca3b9b91 RT |
4255 | check_irq_on(); |
4256 | spin_lock_irq(&l3->list_lock); | |
e498be7d | 4257 | |
7a7c381d | 4258 | list_for_each_entry(slabp, &l3->slabs_full, list) { |
e498be7d CL |
4259 | if (slabp->inuse != cachep->num && !error) |
4260 | error = "slabs_full accounting error"; | |
4261 | active_objs += cachep->num; | |
4262 | active_slabs++; | |
4263 | } | |
7a7c381d | 4264 | list_for_each_entry(slabp, &l3->slabs_partial, list) { |
e498be7d CL |
4265 | if (slabp->inuse == cachep->num && !error) |
4266 | error = "slabs_partial inuse accounting error"; | |
4267 | if (!slabp->inuse && !error) | |
4268 | error = "slabs_partial/inuse accounting error"; | |
4269 | active_objs += slabp->inuse; | |
4270 | active_slabs++; | |
4271 | } | |
7a7c381d | 4272 | list_for_each_entry(slabp, &l3->slabs_free, list) { |
e498be7d CL |
4273 | if (slabp->inuse && !error) |
4274 | error = "slabs_free/inuse accounting error"; | |
4275 | num_slabs++; | |
4276 | } | |
4277 | free_objects += l3->free_objects; | |
4484ebf1 RT |
4278 | if (l3->shared) |
4279 | shared_avail += l3->shared->avail; | |
e498be7d | 4280 | |
ca3b9b91 | 4281 | spin_unlock_irq(&l3->list_lock); |
1da177e4 | 4282 | } |
b28a02de PE |
4283 | num_slabs += active_slabs; |
4284 | num_objs = num_slabs * cachep->num; | |
e498be7d | 4285 | if (num_objs - active_objs != free_objects && !error) |
1da177e4 LT |
4286 | error = "free_objects accounting error"; |
4287 | ||
b28a02de | 4288 | name = cachep->name; |
1da177e4 LT |
4289 | if (error) |
4290 | printk(KERN_ERR "slab: cache %s error: %s\n", name, error); | |
4291 | ||
0d7561c6 GC |
4292 | sinfo->active_objs = active_objs; |
4293 | sinfo->num_objs = num_objs; | |
4294 | sinfo->active_slabs = active_slabs; | |
4295 | sinfo->num_slabs = num_slabs; | |
4296 | sinfo->shared_avail = shared_avail; | |
4297 | sinfo->limit = cachep->limit; | |
4298 | sinfo->batchcount = cachep->batchcount; | |
4299 | sinfo->shared = cachep->shared; | |
4300 | sinfo->objects_per_slab = cachep->num; | |
4301 | sinfo->cache_order = cachep->gfporder; | |
4302 | } | |
4303 | ||
4304 | void slabinfo_show_stats(struct seq_file *m, struct kmem_cache *cachep) | |
4305 | { | |
1da177e4 | 4306 | #if STATS |
b28a02de | 4307 | { /* list3 stats */ |
1da177e4 LT |
4308 | unsigned long high = cachep->high_mark; |
4309 | unsigned long allocs = cachep->num_allocations; | |
4310 | unsigned long grown = cachep->grown; | |
4311 | unsigned long reaped = cachep->reaped; | |
4312 | unsigned long errors = cachep->errors; | |
4313 | unsigned long max_freeable = cachep->max_freeable; | |
1da177e4 | 4314 | unsigned long node_allocs = cachep->node_allocs; |
e498be7d | 4315 | unsigned long node_frees = cachep->node_frees; |
fb7faf33 | 4316 | unsigned long overflows = cachep->node_overflow; |
1da177e4 | 4317 | |
e92dd4fd JP |
4318 | seq_printf(m, " : globalstat %7lu %6lu %5lu %4lu " |
4319 | "%4lu %4lu %4lu %4lu %4lu", | |
4320 | allocs, high, grown, | |
4321 | reaped, errors, max_freeable, node_allocs, | |
4322 | node_frees, overflows); | |
1da177e4 LT |
4323 | } |
4324 | /* cpu stats */ | |
4325 | { | |
4326 | unsigned long allochit = atomic_read(&cachep->allochit); | |
4327 | unsigned long allocmiss = atomic_read(&cachep->allocmiss); | |
4328 | unsigned long freehit = atomic_read(&cachep->freehit); | |
4329 | unsigned long freemiss = atomic_read(&cachep->freemiss); | |
4330 | ||
4331 | seq_printf(m, " : cpustat %6lu %6lu %6lu %6lu", | |
b28a02de | 4332 | allochit, allocmiss, freehit, freemiss); |
1da177e4 LT |
4333 | } |
4334 | #endif | |
1da177e4 LT |
4335 | } |
4336 | ||
1da177e4 LT |
4337 | #define MAX_SLABINFO_WRITE 128 |
4338 | /** | |
4339 | * slabinfo_write - Tuning for the slab allocator | |
4340 | * @file: unused | |
4341 | * @buffer: user buffer | |
4342 | * @count: data length | |
4343 | * @ppos: unused | |
4344 | */ | |
b7454ad3 | 4345 | ssize_t slabinfo_write(struct file *file, const char __user *buffer, |
b28a02de | 4346 | size_t count, loff_t *ppos) |
1da177e4 | 4347 | { |
b28a02de | 4348 | char kbuf[MAX_SLABINFO_WRITE + 1], *tmp; |
1da177e4 | 4349 | int limit, batchcount, shared, res; |
7a7c381d | 4350 | struct kmem_cache *cachep; |
b28a02de | 4351 | |
1da177e4 LT |
4352 | if (count > MAX_SLABINFO_WRITE) |
4353 | return -EINVAL; | |
4354 | if (copy_from_user(&kbuf, buffer, count)) | |
4355 | return -EFAULT; | |
b28a02de | 4356 | kbuf[MAX_SLABINFO_WRITE] = '\0'; |
1da177e4 LT |
4357 | |
4358 | tmp = strchr(kbuf, ' '); | |
4359 | if (!tmp) | |
4360 | return -EINVAL; | |
4361 | *tmp = '\0'; | |
4362 | tmp++; | |
4363 | if (sscanf(tmp, " %d %d %d", &limit, &batchcount, &shared) != 3) | |
4364 | return -EINVAL; | |
4365 | ||
4366 | /* Find the cache in the chain of caches. */ | |
18004c5d | 4367 | mutex_lock(&slab_mutex); |
1da177e4 | 4368 | res = -EINVAL; |
18004c5d | 4369 | list_for_each_entry(cachep, &slab_caches, list) { |
1da177e4 | 4370 | if (!strcmp(cachep->name, kbuf)) { |
a737b3e2 AM |
4371 | if (limit < 1 || batchcount < 1 || |
4372 | batchcount > limit || shared < 0) { | |
e498be7d | 4373 | res = 0; |
1da177e4 | 4374 | } else { |
e498be7d | 4375 | res = do_tune_cpucache(cachep, limit, |
83b519e8 PE |
4376 | batchcount, shared, |
4377 | GFP_KERNEL); | |
1da177e4 LT |
4378 | } |
4379 | break; | |
4380 | } | |
4381 | } | |
18004c5d | 4382 | mutex_unlock(&slab_mutex); |
1da177e4 LT |
4383 | if (res >= 0) |
4384 | res = count; | |
4385 | return res; | |
4386 | } | |
871751e2 AV |
4387 | |
4388 | #ifdef CONFIG_DEBUG_SLAB_LEAK | |
4389 | ||
4390 | static void *leaks_start(struct seq_file *m, loff_t *pos) | |
4391 | { | |
18004c5d CL |
4392 | mutex_lock(&slab_mutex); |
4393 | return seq_list_start(&slab_caches, *pos); | |
871751e2 AV |
4394 | } |
4395 | ||
4396 | static inline int add_caller(unsigned long *n, unsigned long v) | |
4397 | { | |
4398 | unsigned long *p; | |
4399 | int l; | |
4400 | if (!v) | |
4401 | return 1; | |
4402 | l = n[1]; | |
4403 | p = n + 2; | |
4404 | while (l) { | |
4405 | int i = l/2; | |
4406 | unsigned long *q = p + 2 * i; | |
4407 | if (*q == v) { | |
4408 | q[1]++; | |
4409 | return 1; | |
4410 | } | |
4411 | if (*q > v) { | |
4412 | l = i; | |
4413 | } else { | |
4414 | p = q + 2; | |
4415 | l -= i + 1; | |
4416 | } | |
4417 | } | |
4418 | if (++n[1] == n[0]) | |
4419 | return 0; | |
4420 | memmove(p + 2, p, n[1] * 2 * sizeof(unsigned long) - ((void *)p - (void *)n)); | |
4421 | p[0] = v; | |
4422 | p[1] = 1; | |
4423 | return 1; | |
4424 | } | |
4425 | ||
4426 | static void handle_slab(unsigned long *n, struct kmem_cache *c, struct slab *s) | |
4427 | { | |
4428 | void *p; | |
4429 | int i; | |
4430 | if (n[0] == n[1]) | |
4431 | return; | |
3b0efdfa | 4432 | for (i = 0, p = s->s_mem; i < c->num; i++, p += c->size) { |
871751e2 AV |
4433 | if (slab_bufctl(s)[i] != BUFCTL_ACTIVE) |
4434 | continue; | |
4435 | if (!add_caller(n, (unsigned long)*dbg_userword(c, p))) | |
4436 | return; | |
4437 | } | |
4438 | } | |
4439 | ||
4440 | static void show_symbol(struct seq_file *m, unsigned long address) | |
4441 | { | |
4442 | #ifdef CONFIG_KALLSYMS | |
871751e2 | 4443 | unsigned long offset, size; |
9281acea | 4444 | char modname[MODULE_NAME_LEN], name[KSYM_NAME_LEN]; |
871751e2 | 4445 | |
a5c43dae | 4446 | if (lookup_symbol_attrs(address, &size, &offset, modname, name) == 0) { |
871751e2 | 4447 | seq_printf(m, "%s+%#lx/%#lx", name, offset, size); |
a5c43dae | 4448 | if (modname[0]) |
871751e2 AV |
4449 | seq_printf(m, " [%s]", modname); |
4450 | return; | |
4451 | } | |
4452 | #endif | |
4453 | seq_printf(m, "%p", (void *)address); | |
4454 | } | |
4455 | ||
4456 | static int leaks_show(struct seq_file *m, void *p) | |
4457 | { | |
0672aa7c | 4458 | struct kmem_cache *cachep = list_entry(p, struct kmem_cache, list); |
871751e2 AV |
4459 | struct slab *slabp; |
4460 | struct kmem_list3 *l3; | |
4461 | const char *name; | |
4462 | unsigned long *n = m->private; | |
4463 | int node; | |
4464 | int i; | |
4465 | ||
4466 | if (!(cachep->flags & SLAB_STORE_USER)) | |
4467 | return 0; | |
4468 | if (!(cachep->flags & SLAB_RED_ZONE)) | |
4469 | return 0; | |
4470 | ||
4471 | /* OK, we can do it */ | |
4472 | ||
4473 | n[1] = 0; | |
4474 | ||
4475 | for_each_online_node(node) { | |
4476 | l3 = cachep->nodelists[node]; | |
4477 | if (!l3) | |
4478 | continue; | |
4479 | ||
4480 | check_irq_on(); | |
4481 | spin_lock_irq(&l3->list_lock); | |
4482 | ||
7a7c381d | 4483 | list_for_each_entry(slabp, &l3->slabs_full, list) |
871751e2 | 4484 | handle_slab(n, cachep, slabp); |
7a7c381d | 4485 | list_for_each_entry(slabp, &l3->slabs_partial, list) |
871751e2 | 4486 | handle_slab(n, cachep, slabp); |
871751e2 AV |
4487 | spin_unlock_irq(&l3->list_lock); |
4488 | } | |
4489 | name = cachep->name; | |
4490 | if (n[0] == n[1]) { | |
4491 | /* Increase the buffer size */ | |
18004c5d | 4492 | mutex_unlock(&slab_mutex); |
871751e2 AV |
4493 | m->private = kzalloc(n[0] * 4 * sizeof(unsigned long), GFP_KERNEL); |
4494 | if (!m->private) { | |
4495 | /* Too bad, we are really out */ | |
4496 | m->private = n; | |
18004c5d | 4497 | mutex_lock(&slab_mutex); |
871751e2 AV |
4498 | return -ENOMEM; |
4499 | } | |
4500 | *(unsigned long *)m->private = n[0] * 2; | |
4501 | kfree(n); | |
18004c5d | 4502 | mutex_lock(&slab_mutex); |
871751e2 AV |
4503 | /* Now make sure this entry will be retried */ |
4504 | m->count = m->size; | |
4505 | return 0; | |
4506 | } | |
4507 | for (i = 0; i < n[1]; i++) { | |
4508 | seq_printf(m, "%s: %lu ", name, n[2*i+3]); | |
4509 | show_symbol(m, n[2*i+2]); | |
4510 | seq_putc(m, '\n'); | |
4511 | } | |
d2e7b7d0 | 4512 | |
871751e2 AV |
4513 | return 0; |
4514 | } | |
4515 | ||
b7454ad3 GC |
4516 | static void *s_next(struct seq_file *m, void *p, loff_t *pos) |
4517 | { | |
4518 | return seq_list_next(p, &slab_caches, pos); | |
4519 | } | |
4520 | ||
4521 | static void s_stop(struct seq_file *m, void *p) | |
4522 | { | |
4523 | mutex_unlock(&slab_mutex); | |
4524 | } | |
4525 | ||
a0ec95a8 | 4526 | static const struct seq_operations slabstats_op = { |
871751e2 AV |
4527 | .start = leaks_start, |
4528 | .next = s_next, | |
4529 | .stop = s_stop, | |
4530 | .show = leaks_show, | |
4531 | }; | |
a0ec95a8 AD |
4532 | |
4533 | static int slabstats_open(struct inode *inode, struct file *file) | |
4534 | { | |
4535 | unsigned long *n = kzalloc(PAGE_SIZE, GFP_KERNEL); | |
4536 | int ret = -ENOMEM; | |
4537 | if (n) { | |
4538 | ret = seq_open(file, &slabstats_op); | |
4539 | if (!ret) { | |
4540 | struct seq_file *m = file->private_data; | |
4541 | *n = PAGE_SIZE / (2 * sizeof(unsigned long)); | |
4542 | m->private = n; | |
4543 | n = NULL; | |
4544 | } | |
4545 | kfree(n); | |
4546 | } | |
4547 | return ret; | |
4548 | } | |
4549 | ||
4550 | static const struct file_operations proc_slabstats_operations = { | |
4551 | .open = slabstats_open, | |
4552 | .read = seq_read, | |
4553 | .llseek = seq_lseek, | |
4554 | .release = seq_release_private, | |
4555 | }; | |
4556 | #endif | |
4557 | ||
4558 | static int __init slab_proc_init(void) | |
4559 | { | |
4560 | #ifdef CONFIG_DEBUG_SLAB_LEAK | |
4561 | proc_create("slab_allocators", 0, NULL, &proc_slabstats_operations); | |
871751e2 | 4562 | #endif |
a0ec95a8 AD |
4563 | return 0; |
4564 | } | |
4565 | module_init(slab_proc_init); | |
1da177e4 LT |
4566 | #endif |
4567 | ||
00e145b6 MS |
4568 | /** |
4569 | * ksize - get the actual amount of memory allocated for a given object | |
4570 | * @objp: Pointer to the object | |
4571 | * | |
4572 | * kmalloc may internally round up allocations and return more memory | |
4573 | * than requested. ksize() can be used to determine the actual amount of | |
4574 | * memory allocated. The caller may use this additional memory, even though | |
4575 | * a smaller amount of memory was initially specified with the kmalloc call. | |
4576 | * The caller must guarantee that objp points to a valid object previously | |
4577 | * allocated with either kmalloc() or kmem_cache_alloc(). The object | |
4578 | * must not be freed during the duration of the call. | |
4579 | */ | |
fd76bab2 | 4580 | size_t ksize(const void *objp) |
1da177e4 | 4581 | { |
ef8b4520 CL |
4582 | BUG_ON(!objp); |
4583 | if (unlikely(objp == ZERO_SIZE_PTR)) | |
00e145b6 | 4584 | return 0; |
1da177e4 | 4585 | |
8c138bc0 | 4586 | return virt_to_cache(objp)->object_size; |
1da177e4 | 4587 | } |
b1aabecd | 4588 | EXPORT_SYMBOL(ksize); |