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