Commit | Line | Data |
---|---|---|
81819f0f CL |
1 | /* |
2 | * SLUB: A slab allocator that limits cache line use instead of queuing | |
3 | * objects in per cpu and per node lists. | |
4 | * | |
881db7fb CL |
5 | * The allocator synchronizes using per slab locks or atomic operatios |
6 | * and only uses a centralized lock to manage a pool of partial slabs. | |
81819f0f | 7 | * |
cde53535 | 8 | * (C) 2007 SGI, Christoph Lameter |
881db7fb | 9 | * (C) 2011 Linux Foundation, Christoph Lameter |
81819f0f CL |
10 | */ |
11 | ||
12 | #include <linux/mm.h> | |
1eb5ac64 | 13 | #include <linux/swap.h> /* struct reclaim_state */ |
81819f0f CL |
14 | #include <linux/module.h> |
15 | #include <linux/bit_spinlock.h> | |
16 | #include <linux/interrupt.h> | |
17 | #include <linux/bitops.h> | |
18 | #include <linux/slab.h> | |
97d06609 | 19 | #include "slab.h" |
7b3c3a50 | 20 | #include <linux/proc_fs.h> |
3ac38faa | 21 | #include <linux/notifier.h> |
81819f0f | 22 | #include <linux/seq_file.h> |
a79316c6 | 23 | #include <linux/kasan.h> |
5a896d9e | 24 | #include <linux/kmemcheck.h> |
81819f0f CL |
25 | #include <linux/cpu.h> |
26 | #include <linux/cpuset.h> | |
27 | #include <linux/mempolicy.h> | |
28 | #include <linux/ctype.h> | |
3ac7fe5a | 29 | #include <linux/debugobjects.h> |
81819f0f | 30 | #include <linux/kallsyms.h> |
b9049e23 | 31 | #include <linux/memory.h> |
f8bd2258 | 32 | #include <linux/math64.h> |
773ff60e | 33 | #include <linux/fault-inject.h> |
bfa71457 | 34 | #include <linux/stacktrace.h> |
4de900b4 | 35 | #include <linux/prefetch.h> |
2633d7a0 | 36 | #include <linux/memcontrol.h> |
81819f0f | 37 | |
4a92379b RK |
38 | #include <trace/events/kmem.h> |
39 | ||
072bb0aa MG |
40 | #include "internal.h" |
41 | ||
81819f0f CL |
42 | /* |
43 | * Lock order: | |
18004c5d | 44 | * 1. slab_mutex (Global Mutex) |
881db7fb CL |
45 | * 2. node->list_lock |
46 | * 3. slab_lock(page) (Only on some arches and for debugging) | |
81819f0f | 47 | * |
18004c5d | 48 | * slab_mutex |
881db7fb | 49 | * |
18004c5d | 50 | * The role of the slab_mutex is to protect the list of all the slabs |
881db7fb CL |
51 | * and to synchronize major metadata changes to slab cache structures. |
52 | * | |
53 | * The slab_lock is only used for debugging and on arches that do not | |
54 | * have the ability to do a cmpxchg_double. It only protects the second | |
55 | * double word in the page struct. Meaning | |
56 | * A. page->freelist -> List of object free in a page | |
57 | * B. page->counters -> Counters of objects | |
58 | * C. page->frozen -> frozen state | |
59 | * | |
60 | * If a slab is frozen then it is exempt from list management. It is not | |
61 | * on any list. The processor that froze the slab is the one who can | |
62 | * perform list operations on the page. Other processors may put objects | |
63 | * onto the freelist but the processor that froze the slab is the only | |
64 | * one that can retrieve the objects from the page's freelist. | |
81819f0f CL |
65 | * |
66 | * The list_lock protects the partial and full list on each node and | |
67 | * the partial slab counter. If taken then no new slabs may be added or | |
68 | * removed from the lists nor make the number of partial slabs be modified. | |
69 | * (Note that the total number of slabs is an atomic value that may be | |
70 | * modified without taking the list lock). | |
71 | * | |
72 | * The list_lock is a centralized lock and thus we avoid taking it as | |
73 | * much as possible. As long as SLUB does not have to handle partial | |
74 | * slabs, operations can continue without any centralized lock. F.e. | |
75 | * allocating a long series of objects that fill up slabs does not require | |
76 | * the list lock. | |
81819f0f CL |
77 | * Interrupts are disabled during allocation and deallocation in order to |
78 | * make the slab allocator safe to use in the context of an irq. In addition | |
79 | * interrupts are disabled to ensure that the processor does not change | |
80 | * while handling per_cpu slabs, due to kernel preemption. | |
81 | * | |
82 | * SLUB assigns one slab for allocation to each processor. | |
83 | * Allocations only occur from these slabs called cpu slabs. | |
84 | * | |
672bba3a CL |
85 | * Slabs with free elements are kept on a partial list and during regular |
86 | * operations no list for full slabs is used. If an object in a full slab is | |
81819f0f | 87 | * freed then the slab will show up again on the partial lists. |
672bba3a CL |
88 | * We track full slabs for debugging purposes though because otherwise we |
89 | * cannot scan all objects. | |
81819f0f CL |
90 | * |
91 | * Slabs are freed when they become empty. Teardown and setup is | |
92 | * minimal so we rely on the page allocators per cpu caches for | |
93 | * fast frees and allocs. | |
94 | * | |
95 | * Overloading of page flags that are otherwise used for LRU management. | |
96 | * | |
4b6f0750 CL |
97 | * PageActive The slab is frozen and exempt from list processing. |
98 | * This means that the slab is dedicated to a purpose | |
99 | * such as satisfying allocations for a specific | |
100 | * processor. Objects may be freed in the slab while | |
101 | * it is frozen but slab_free will then skip the usual | |
102 | * list operations. It is up to the processor holding | |
103 | * the slab to integrate the slab into the slab lists | |
104 | * when the slab is no longer needed. | |
105 | * | |
106 | * One use of this flag is to mark slabs that are | |
107 | * used for allocations. Then such a slab becomes a cpu | |
108 | * slab. The cpu slab may be equipped with an additional | |
dfb4f096 | 109 | * freelist that allows lockless access to |
894b8788 CL |
110 | * free objects in addition to the regular freelist |
111 | * that requires the slab lock. | |
81819f0f CL |
112 | * |
113 | * PageError Slab requires special handling due to debug | |
114 | * options set. This moves slab handling out of | |
894b8788 | 115 | * the fast path and disables lockless freelists. |
81819f0f CL |
116 | */ |
117 | ||
af537b0a CL |
118 | static inline int kmem_cache_debug(struct kmem_cache *s) |
119 | { | |
5577bd8a | 120 | #ifdef CONFIG_SLUB_DEBUG |
af537b0a | 121 | return unlikely(s->flags & SLAB_DEBUG_FLAGS); |
5577bd8a | 122 | #else |
af537b0a | 123 | return 0; |
5577bd8a | 124 | #endif |
af537b0a | 125 | } |
5577bd8a | 126 | |
345c905d JK |
127 | static inline bool kmem_cache_has_cpu_partial(struct kmem_cache *s) |
128 | { | |
129 | #ifdef CONFIG_SLUB_CPU_PARTIAL | |
130 | return !kmem_cache_debug(s); | |
131 | #else | |
132 | return false; | |
133 | #endif | |
134 | } | |
135 | ||
81819f0f CL |
136 | /* |
137 | * Issues still to be resolved: | |
138 | * | |
81819f0f CL |
139 | * - Support PAGE_ALLOC_DEBUG. Should be easy to do. |
140 | * | |
81819f0f CL |
141 | * - Variable sizing of the per node arrays |
142 | */ | |
143 | ||
144 | /* Enable to test recovery from slab corruption on boot */ | |
145 | #undef SLUB_RESILIENCY_TEST | |
146 | ||
b789ef51 CL |
147 | /* Enable to log cmpxchg failures */ |
148 | #undef SLUB_DEBUG_CMPXCHG | |
149 | ||
2086d26a CL |
150 | /* |
151 | * Mininum number of partial slabs. These will be left on the partial | |
152 | * lists even if they are empty. kmem_cache_shrink may reclaim them. | |
153 | */ | |
76be8950 | 154 | #define MIN_PARTIAL 5 |
e95eed57 | 155 | |
2086d26a CL |
156 | /* |
157 | * Maximum number of desirable partial slabs. | |
158 | * The existence of more partial slabs makes kmem_cache_shrink | |
721ae22a | 159 | * sort the partial list by the number of objects in use. |
2086d26a CL |
160 | */ |
161 | #define MAX_PARTIAL 10 | |
162 | ||
81819f0f CL |
163 | #define DEBUG_DEFAULT_FLAGS (SLAB_DEBUG_FREE | SLAB_RED_ZONE | \ |
164 | SLAB_POISON | SLAB_STORE_USER) | |
672bba3a | 165 | |
fa5ec8a1 | 166 | /* |
3de47213 DR |
167 | * Debugging flags that require metadata to be stored in the slab. These get |
168 | * disabled when slub_debug=O is used and a cache's min order increases with | |
169 | * metadata. | |
fa5ec8a1 | 170 | */ |
3de47213 | 171 | #define DEBUG_METADATA_FLAGS (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER) |
fa5ec8a1 | 172 | |
210b5c06 CG |
173 | #define OO_SHIFT 16 |
174 | #define OO_MASK ((1 << OO_SHIFT) - 1) | |
50d5c41c | 175 | #define MAX_OBJS_PER_PAGE 32767 /* since page.objects is u15 */ |
210b5c06 | 176 | |
81819f0f | 177 | /* Internal SLUB flags */ |
f90ec390 | 178 | #define __OBJECT_POISON 0x80000000UL /* Poison object */ |
b789ef51 | 179 | #define __CMPXCHG_DOUBLE 0x40000000UL /* Use cmpxchg_double */ |
81819f0f | 180 | |
81819f0f CL |
181 | #ifdef CONFIG_SMP |
182 | static struct notifier_block slab_notifier; | |
183 | #endif | |
184 | ||
02cbc874 CL |
185 | /* |
186 | * Tracking user of a slab. | |
187 | */ | |
d6543e39 | 188 | #define TRACK_ADDRS_COUNT 16 |
02cbc874 | 189 | struct track { |
ce71e27c | 190 | unsigned long addr; /* Called from address */ |
d6543e39 BG |
191 | #ifdef CONFIG_STACKTRACE |
192 | unsigned long addrs[TRACK_ADDRS_COUNT]; /* Called from address */ | |
193 | #endif | |
02cbc874 CL |
194 | int cpu; /* Was running on cpu */ |
195 | int pid; /* Pid context */ | |
196 | unsigned long when; /* When did the operation occur */ | |
197 | }; | |
198 | ||
199 | enum track_item { TRACK_ALLOC, TRACK_FREE }; | |
200 | ||
ab4d5ed5 | 201 | #ifdef CONFIG_SYSFS |
81819f0f CL |
202 | static int sysfs_slab_add(struct kmem_cache *); |
203 | static int sysfs_slab_alias(struct kmem_cache *, const char *); | |
107dab5c | 204 | static void memcg_propagate_slab_attrs(struct kmem_cache *s); |
81819f0f | 205 | #else |
0c710013 CL |
206 | static inline int sysfs_slab_add(struct kmem_cache *s) { return 0; } |
207 | static inline int sysfs_slab_alias(struct kmem_cache *s, const char *p) | |
208 | { return 0; } | |
107dab5c | 209 | static inline void memcg_propagate_slab_attrs(struct kmem_cache *s) { } |
81819f0f CL |
210 | #endif |
211 | ||
4fdccdfb | 212 | static inline void stat(const struct kmem_cache *s, enum stat_item si) |
8ff12cfc CL |
213 | { |
214 | #ifdef CONFIG_SLUB_STATS | |
88da03a6 CL |
215 | /* |
216 | * The rmw is racy on a preemptible kernel but this is acceptable, so | |
217 | * avoid this_cpu_add()'s irq-disable overhead. | |
218 | */ | |
219 | raw_cpu_inc(s->cpu_slab->stat[si]); | |
8ff12cfc CL |
220 | #endif |
221 | } | |
222 | ||
81819f0f CL |
223 | /******************************************************************** |
224 | * Core slab cache functions | |
225 | *******************************************************************/ | |
226 | ||
6446faa2 | 227 | /* Verify that a pointer has an address that is valid within a slab page */ |
02cbc874 CL |
228 | static inline int check_valid_pointer(struct kmem_cache *s, |
229 | struct page *page, const void *object) | |
230 | { | |
231 | void *base; | |
232 | ||
a973e9dd | 233 | if (!object) |
02cbc874 CL |
234 | return 1; |
235 | ||
a973e9dd | 236 | base = page_address(page); |
39b26464 | 237 | if (object < base || object >= base + page->objects * s->size || |
02cbc874 CL |
238 | (object - base) % s->size) { |
239 | return 0; | |
240 | } | |
241 | ||
242 | return 1; | |
243 | } | |
244 | ||
7656c72b CL |
245 | static inline void *get_freepointer(struct kmem_cache *s, void *object) |
246 | { | |
247 | return *(void **)(object + s->offset); | |
248 | } | |
249 | ||
0ad9500e ED |
250 | static void prefetch_freepointer(const struct kmem_cache *s, void *object) |
251 | { | |
252 | prefetch(object + s->offset); | |
253 | } | |
254 | ||
1393d9a1 CL |
255 | static inline void *get_freepointer_safe(struct kmem_cache *s, void *object) |
256 | { | |
257 | void *p; | |
258 | ||
259 | #ifdef CONFIG_DEBUG_PAGEALLOC | |
260 | probe_kernel_read(&p, (void **)(object + s->offset), sizeof(p)); | |
261 | #else | |
262 | p = get_freepointer(s, object); | |
263 | #endif | |
264 | return p; | |
265 | } | |
266 | ||
7656c72b CL |
267 | static inline void set_freepointer(struct kmem_cache *s, void *object, void *fp) |
268 | { | |
269 | *(void **)(object + s->offset) = fp; | |
270 | } | |
271 | ||
272 | /* Loop over all objects in a slab */ | |
224a88be CL |
273 | #define for_each_object(__p, __s, __addr, __objects) \ |
274 | for (__p = (__addr); __p < (__addr) + (__objects) * (__s)->size;\ | |
7656c72b CL |
275 | __p += (__s)->size) |
276 | ||
54266640 WY |
277 | #define for_each_object_idx(__p, __idx, __s, __addr, __objects) \ |
278 | for (__p = (__addr), __idx = 1; __idx <= __objects;\ | |
279 | __p += (__s)->size, __idx++) | |
280 | ||
7656c72b CL |
281 | /* Determine object index from a given position */ |
282 | static inline int slab_index(void *p, struct kmem_cache *s, void *addr) | |
283 | { | |
284 | return (p - addr) / s->size; | |
285 | } | |
286 | ||
ab9a0f19 LJ |
287 | static inline int order_objects(int order, unsigned long size, int reserved) |
288 | { | |
289 | return ((PAGE_SIZE << order) - reserved) / size; | |
290 | } | |
291 | ||
834f3d11 | 292 | static inline struct kmem_cache_order_objects oo_make(int order, |
ab9a0f19 | 293 | unsigned long size, int reserved) |
834f3d11 CL |
294 | { |
295 | struct kmem_cache_order_objects x = { | |
ab9a0f19 | 296 | (order << OO_SHIFT) + order_objects(order, size, reserved) |
834f3d11 CL |
297 | }; |
298 | ||
299 | return x; | |
300 | } | |
301 | ||
302 | static inline int oo_order(struct kmem_cache_order_objects x) | |
303 | { | |
210b5c06 | 304 | return x.x >> OO_SHIFT; |
834f3d11 CL |
305 | } |
306 | ||
307 | static inline int oo_objects(struct kmem_cache_order_objects x) | |
308 | { | |
210b5c06 | 309 | return x.x & OO_MASK; |
834f3d11 CL |
310 | } |
311 | ||
881db7fb CL |
312 | /* |
313 | * Per slab locking using the pagelock | |
314 | */ | |
315 | static __always_inline void slab_lock(struct page *page) | |
316 | { | |
48c935ad | 317 | VM_BUG_ON_PAGE(PageTail(page), page); |
881db7fb CL |
318 | bit_spin_lock(PG_locked, &page->flags); |
319 | } | |
320 | ||
321 | static __always_inline void slab_unlock(struct page *page) | |
322 | { | |
48c935ad | 323 | VM_BUG_ON_PAGE(PageTail(page), page); |
881db7fb CL |
324 | __bit_spin_unlock(PG_locked, &page->flags); |
325 | } | |
326 | ||
a0320865 DH |
327 | static inline void set_page_slub_counters(struct page *page, unsigned long counters_new) |
328 | { | |
329 | struct page tmp; | |
330 | tmp.counters = counters_new; | |
331 | /* | |
332 | * page->counters can cover frozen/inuse/objects as well | |
333 | * as page->_count. If we assign to ->counters directly | |
334 | * we run the risk of losing updates to page->_count, so | |
335 | * be careful and only assign to the fields we need. | |
336 | */ | |
337 | page->frozen = tmp.frozen; | |
338 | page->inuse = tmp.inuse; | |
339 | page->objects = tmp.objects; | |
340 | } | |
341 | ||
1d07171c CL |
342 | /* Interrupts must be disabled (for the fallback code to work right) */ |
343 | static inline bool __cmpxchg_double_slab(struct kmem_cache *s, struct page *page, | |
344 | void *freelist_old, unsigned long counters_old, | |
345 | void *freelist_new, unsigned long counters_new, | |
346 | const char *n) | |
347 | { | |
348 | VM_BUG_ON(!irqs_disabled()); | |
2565409f HC |
349 | #if defined(CONFIG_HAVE_CMPXCHG_DOUBLE) && \ |
350 | defined(CONFIG_HAVE_ALIGNED_STRUCT_PAGE) | |
1d07171c | 351 | if (s->flags & __CMPXCHG_DOUBLE) { |
cdcd6298 | 352 | if (cmpxchg_double(&page->freelist, &page->counters, |
0aa9a13d DC |
353 | freelist_old, counters_old, |
354 | freelist_new, counters_new)) | |
6f6528a1 | 355 | return true; |
1d07171c CL |
356 | } else |
357 | #endif | |
358 | { | |
359 | slab_lock(page); | |
d0e0ac97 CG |
360 | if (page->freelist == freelist_old && |
361 | page->counters == counters_old) { | |
1d07171c | 362 | page->freelist = freelist_new; |
a0320865 | 363 | set_page_slub_counters(page, counters_new); |
1d07171c | 364 | slab_unlock(page); |
6f6528a1 | 365 | return true; |
1d07171c CL |
366 | } |
367 | slab_unlock(page); | |
368 | } | |
369 | ||
370 | cpu_relax(); | |
371 | stat(s, CMPXCHG_DOUBLE_FAIL); | |
372 | ||
373 | #ifdef SLUB_DEBUG_CMPXCHG | |
f9f58285 | 374 | pr_info("%s %s: cmpxchg double redo ", n, s->name); |
1d07171c CL |
375 | #endif |
376 | ||
6f6528a1 | 377 | return false; |
1d07171c CL |
378 | } |
379 | ||
b789ef51 CL |
380 | static inline bool cmpxchg_double_slab(struct kmem_cache *s, struct page *page, |
381 | void *freelist_old, unsigned long counters_old, | |
382 | void *freelist_new, unsigned long counters_new, | |
383 | const char *n) | |
384 | { | |
2565409f HC |
385 | #if defined(CONFIG_HAVE_CMPXCHG_DOUBLE) && \ |
386 | defined(CONFIG_HAVE_ALIGNED_STRUCT_PAGE) | |
b789ef51 | 387 | if (s->flags & __CMPXCHG_DOUBLE) { |
cdcd6298 | 388 | if (cmpxchg_double(&page->freelist, &page->counters, |
0aa9a13d DC |
389 | freelist_old, counters_old, |
390 | freelist_new, counters_new)) | |
6f6528a1 | 391 | return true; |
b789ef51 CL |
392 | } else |
393 | #endif | |
394 | { | |
1d07171c CL |
395 | unsigned long flags; |
396 | ||
397 | local_irq_save(flags); | |
881db7fb | 398 | slab_lock(page); |
d0e0ac97 CG |
399 | if (page->freelist == freelist_old && |
400 | page->counters == counters_old) { | |
b789ef51 | 401 | page->freelist = freelist_new; |
a0320865 | 402 | set_page_slub_counters(page, counters_new); |
881db7fb | 403 | slab_unlock(page); |
1d07171c | 404 | local_irq_restore(flags); |
6f6528a1 | 405 | return true; |
b789ef51 | 406 | } |
881db7fb | 407 | slab_unlock(page); |
1d07171c | 408 | local_irq_restore(flags); |
b789ef51 CL |
409 | } |
410 | ||
411 | cpu_relax(); | |
412 | stat(s, CMPXCHG_DOUBLE_FAIL); | |
413 | ||
414 | #ifdef SLUB_DEBUG_CMPXCHG | |
f9f58285 | 415 | pr_info("%s %s: cmpxchg double redo ", n, s->name); |
b789ef51 CL |
416 | #endif |
417 | ||
6f6528a1 | 418 | return false; |
b789ef51 CL |
419 | } |
420 | ||
41ecc55b | 421 | #ifdef CONFIG_SLUB_DEBUG |
5f80b13a CL |
422 | /* |
423 | * Determine a map of object in use on a page. | |
424 | * | |
881db7fb | 425 | * Node listlock must be held to guarantee that the page does |
5f80b13a CL |
426 | * not vanish from under us. |
427 | */ | |
428 | static void get_map(struct kmem_cache *s, struct page *page, unsigned long *map) | |
429 | { | |
430 | void *p; | |
431 | void *addr = page_address(page); | |
432 | ||
433 | for (p = page->freelist; p; p = get_freepointer(s, p)) | |
434 | set_bit(slab_index(p, s, addr), map); | |
435 | } | |
436 | ||
41ecc55b CL |
437 | /* |
438 | * Debug settings: | |
439 | */ | |
89d3c87e | 440 | #if defined(CONFIG_SLUB_DEBUG_ON) |
f0630fff | 441 | static int slub_debug = DEBUG_DEFAULT_FLAGS; |
89d3c87e AR |
442 | #elif defined(CONFIG_KASAN) |
443 | static int slub_debug = SLAB_STORE_USER; | |
f0630fff | 444 | #else |
41ecc55b | 445 | static int slub_debug; |
f0630fff | 446 | #endif |
41ecc55b CL |
447 | |
448 | static char *slub_debug_slabs; | |
fa5ec8a1 | 449 | static int disable_higher_order_debug; |
41ecc55b | 450 | |
a79316c6 AR |
451 | /* |
452 | * slub is about to manipulate internal object metadata. This memory lies | |
453 | * outside the range of the allocated object, so accessing it would normally | |
454 | * be reported by kasan as a bounds error. metadata_access_enable() is used | |
455 | * to tell kasan that these accesses are OK. | |
456 | */ | |
457 | static inline void metadata_access_enable(void) | |
458 | { | |
459 | kasan_disable_current(); | |
460 | } | |
461 | ||
462 | static inline void metadata_access_disable(void) | |
463 | { | |
464 | kasan_enable_current(); | |
465 | } | |
466 | ||
81819f0f CL |
467 | /* |
468 | * Object debugging | |
469 | */ | |
470 | static void print_section(char *text, u8 *addr, unsigned int length) | |
471 | { | |
a79316c6 | 472 | metadata_access_enable(); |
ffc79d28 SAS |
473 | print_hex_dump(KERN_ERR, text, DUMP_PREFIX_ADDRESS, 16, 1, addr, |
474 | length, 1); | |
a79316c6 | 475 | metadata_access_disable(); |
81819f0f CL |
476 | } |
477 | ||
81819f0f CL |
478 | static struct track *get_track(struct kmem_cache *s, void *object, |
479 | enum track_item alloc) | |
480 | { | |
481 | struct track *p; | |
482 | ||
483 | if (s->offset) | |
484 | p = object + s->offset + sizeof(void *); | |
485 | else | |
486 | p = object + s->inuse; | |
487 | ||
488 | return p + alloc; | |
489 | } | |
490 | ||
491 | static void set_track(struct kmem_cache *s, void *object, | |
ce71e27c | 492 | enum track_item alloc, unsigned long addr) |
81819f0f | 493 | { |
1a00df4a | 494 | struct track *p = get_track(s, object, alloc); |
81819f0f | 495 | |
81819f0f | 496 | if (addr) { |
d6543e39 BG |
497 | #ifdef CONFIG_STACKTRACE |
498 | struct stack_trace trace; | |
499 | int i; | |
500 | ||
501 | trace.nr_entries = 0; | |
502 | trace.max_entries = TRACK_ADDRS_COUNT; | |
503 | trace.entries = p->addrs; | |
504 | trace.skip = 3; | |
a79316c6 | 505 | metadata_access_enable(); |
d6543e39 | 506 | save_stack_trace(&trace); |
a79316c6 | 507 | metadata_access_disable(); |
d6543e39 BG |
508 | |
509 | /* See rant in lockdep.c */ | |
510 | if (trace.nr_entries != 0 && | |
511 | trace.entries[trace.nr_entries - 1] == ULONG_MAX) | |
512 | trace.nr_entries--; | |
513 | ||
514 | for (i = trace.nr_entries; i < TRACK_ADDRS_COUNT; i++) | |
515 | p->addrs[i] = 0; | |
516 | #endif | |
81819f0f CL |
517 | p->addr = addr; |
518 | p->cpu = smp_processor_id(); | |
88e4ccf2 | 519 | p->pid = current->pid; |
81819f0f CL |
520 | p->when = jiffies; |
521 | } else | |
522 | memset(p, 0, sizeof(struct track)); | |
523 | } | |
524 | ||
81819f0f CL |
525 | static void init_tracking(struct kmem_cache *s, void *object) |
526 | { | |
24922684 CL |
527 | if (!(s->flags & SLAB_STORE_USER)) |
528 | return; | |
529 | ||
ce71e27c EGM |
530 | set_track(s, object, TRACK_FREE, 0UL); |
531 | set_track(s, object, TRACK_ALLOC, 0UL); | |
81819f0f CL |
532 | } |
533 | ||
534 | static void print_track(const char *s, struct track *t) | |
535 | { | |
536 | if (!t->addr) | |
537 | return; | |
538 | ||
f9f58285 FF |
539 | pr_err("INFO: %s in %pS age=%lu cpu=%u pid=%d\n", |
540 | s, (void *)t->addr, jiffies - t->when, t->cpu, t->pid); | |
d6543e39 BG |
541 | #ifdef CONFIG_STACKTRACE |
542 | { | |
543 | int i; | |
544 | for (i = 0; i < TRACK_ADDRS_COUNT; i++) | |
545 | if (t->addrs[i]) | |
f9f58285 | 546 | pr_err("\t%pS\n", (void *)t->addrs[i]); |
d6543e39 BG |
547 | else |
548 | break; | |
549 | } | |
550 | #endif | |
24922684 CL |
551 | } |
552 | ||
553 | static void print_tracking(struct kmem_cache *s, void *object) | |
554 | { | |
555 | if (!(s->flags & SLAB_STORE_USER)) | |
556 | return; | |
557 | ||
558 | print_track("Allocated", get_track(s, object, TRACK_ALLOC)); | |
559 | print_track("Freed", get_track(s, object, TRACK_FREE)); | |
560 | } | |
561 | ||
562 | static void print_page_info(struct page *page) | |
563 | { | |
f9f58285 | 564 | pr_err("INFO: Slab 0x%p objects=%u used=%u fp=0x%p flags=0x%04lx\n", |
d0e0ac97 | 565 | page, page->objects, page->inuse, page->freelist, page->flags); |
24922684 CL |
566 | |
567 | } | |
568 | ||
569 | static void slab_bug(struct kmem_cache *s, char *fmt, ...) | |
570 | { | |
ecc42fbe | 571 | struct va_format vaf; |
24922684 | 572 | va_list args; |
24922684 CL |
573 | |
574 | va_start(args, fmt); | |
ecc42fbe FF |
575 | vaf.fmt = fmt; |
576 | vaf.va = &args; | |
f9f58285 | 577 | pr_err("=============================================================================\n"); |
ecc42fbe | 578 | pr_err("BUG %s (%s): %pV\n", s->name, print_tainted(), &vaf); |
f9f58285 | 579 | pr_err("-----------------------------------------------------------------------------\n\n"); |
645df230 | 580 | |
373d4d09 | 581 | add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE); |
ecc42fbe | 582 | va_end(args); |
81819f0f CL |
583 | } |
584 | ||
24922684 CL |
585 | static void slab_fix(struct kmem_cache *s, char *fmt, ...) |
586 | { | |
ecc42fbe | 587 | struct va_format vaf; |
24922684 | 588 | va_list args; |
24922684 CL |
589 | |
590 | va_start(args, fmt); | |
ecc42fbe FF |
591 | vaf.fmt = fmt; |
592 | vaf.va = &args; | |
593 | pr_err("FIX %s: %pV\n", s->name, &vaf); | |
24922684 | 594 | va_end(args); |
24922684 CL |
595 | } |
596 | ||
597 | static void print_trailer(struct kmem_cache *s, struct page *page, u8 *p) | |
81819f0f CL |
598 | { |
599 | unsigned int off; /* Offset of last byte */ | |
a973e9dd | 600 | u8 *addr = page_address(page); |
24922684 CL |
601 | |
602 | print_tracking(s, p); | |
603 | ||
604 | print_page_info(page); | |
605 | ||
f9f58285 FF |
606 | pr_err("INFO: Object 0x%p @offset=%tu fp=0x%p\n\n", |
607 | p, p - addr, get_freepointer(s, p)); | |
24922684 CL |
608 | |
609 | if (p > addr + 16) | |
ffc79d28 | 610 | print_section("Bytes b4 ", p - 16, 16); |
81819f0f | 611 | |
3b0efdfa | 612 | print_section("Object ", p, min_t(unsigned long, s->object_size, |
ffc79d28 | 613 | PAGE_SIZE)); |
81819f0f | 614 | if (s->flags & SLAB_RED_ZONE) |
3b0efdfa CL |
615 | print_section("Redzone ", p + s->object_size, |
616 | s->inuse - s->object_size); | |
81819f0f | 617 | |
81819f0f CL |
618 | if (s->offset) |
619 | off = s->offset + sizeof(void *); | |
620 | else | |
621 | off = s->inuse; | |
622 | ||
24922684 | 623 | if (s->flags & SLAB_STORE_USER) |
81819f0f | 624 | off += 2 * sizeof(struct track); |
81819f0f CL |
625 | |
626 | if (off != s->size) | |
627 | /* Beginning of the filler is the free pointer */ | |
ffc79d28 | 628 | print_section("Padding ", p + off, s->size - off); |
24922684 CL |
629 | |
630 | dump_stack(); | |
81819f0f CL |
631 | } |
632 | ||
75c66def | 633 | void object_err(struct kmem_cache *s, struct page *page, |
81819f0f CL |
634 | u8 *object, char *reason) |
635 | { | |
3dc50637 | 636 | slab_bug(s, "%s", reason); |
24922684 | 637 | print_trailer(s, page, object); |
81819f0f CL |
638 | } |
639 | ||
d0e0ac97 CG |
640 | static void slab_err(struct kmem_cache *s, struct page *page, |
641 | const char *fmt, ...) | |
81819f0f CL |
642 | { |
643 | va_list args; | |
644 | char buf[100]; | |
645 | ||
24922684 CL |
646 | va_start(args, fmt); |
647 | vsnprintf(buf, sizeof(buf), fmt, args); | |
81819f0f | 648 | va_end(args); |
3dc50637 | 649 | slab_bug(s, "%s", buf); |
24922684 | 650 | print_page_info(page); |
81819f0f CL |
651 | dump_stack(); |
652 | } | |
653 | ||
f7cb1933 | 654 | static void init_object(struct kmem_cache *s, void *object, u8 val) |
81819f0f CL |
655 | { |
656 | u8 *p = object; | |
657 | ||
658 | if (s->flags & __OBJECT_POISON) { | |
3b0efdfa CL |
659 | memset(p, POISON_FREE, s->object_size - 1); |
660 | p[s->object_size - 1] = POISON_END; | |
81819f0f CL |
661 | } |
662 | ||
663 | if (s->flags & SLAB_RED_ZONE) | |
3b0efdfa | 664 | memset(p + s->object_size, val, s->inuse - s->object_size); |
81819f0f CL |
665 | } |
666 | ||
24922684 CL |
667 | static void restore_bytes(struct kmem_cache *s, char *message, u8 data, |
668 | void *from, void *to) | |
669 | { | |
670 | slab_fix(s, "Restoring 0x%p-0x%p=0x%x\n", from, to - 1, data); | |
671 | memset(from, data, to - from); | |
672 | } | |
673 | ||
674 | static int check_bytes_and_report(struct kmem_cache *s, struct page *page, | |
675 | u8 *object, char *what, | |
06428780 | 676 | u8 *start, unsigned int value, unsigned int bytes) |
24922684 CL |
677 | { |
678 | u8 *fault; | |
679 | u8 *end; | |
680 | ||
a79316c6 | 681 | metadata_access_enable(); |
79824820 | 682 | fault = memchr_inv(start, value, bytes); |
a79316c6 | 683 | metadata_access_disable(); |
24922684 CL |
684 | if (!fault) |
685 | return 1; | |
686 | ||
687 | end = start + bytes; | |
688 | while (end > fault && end[-1] == value) | |
689 | end--; | |
690 | ||
691 | slab_bug(s, "%s overwritten", what); | |
f9f58285 | 692 | pr_err("INFO: 0x%p-0x%p. First byte 0x%x instead of 0x%x\n", |
24922684 CL |
693 | fault, end - 1, fault[0], value); |
694 | print_trailer(s, page, object); | |
695 | ||
696 | restore_bytes(s, what, value, fault, end); | |
697 | return 0; | |
81819f0f CL |
698 | } |
699 | ||
81819f0f CL |
700 | /* |
701 | * Object layout: | |
702 | * | |
703 | * object address | |
704 | * Bytes of the object to be managed. | |
705 | * If the freepointer may overlay the object then the free | |
706 | * pointer is the first word of the object. | |
672bba3a | 707 | * |
81819f0f CL |
708 | * Poisoning uses 0x6b (POISON_FREE) and the last byte is |
709 | * 0xa5 (POISON_END) | |
710 | * | |
3b0efdfa | 711 | * object + s->object_size |
81819f0f | 712 | * Padding to reach word boundary. This is also used for Redzoning. |
672bba3a | 713 | * Padding is extended by another word if Redzoning is enabled and |
3b0efdfa | 714 | * object_size == inuse. |
672bba3a | 715 | * |
81819f0f CL |
716 | * We fill with 0xbb (RED_INACTIVE) for inactive objects and with |
717 | * 0xcc (RED_ACTIVE) for objects in use. | |
718 | * | |
719 | * object + s->inuse | |
672bba3a CL |
720 | * Meta data starts here. |
721 | * | |
81819f0f CL |
722 | * A. Free pointer (if we cannot overwrite object on free) |
723 | * B. Tracking data for SLAB_STORE_USER | |
672bba3a | 724 | * C. Padding to reach required alignment boundary or at mininum |
6446faa2 | 725 | * one word if debugging is on to be able to detect writes |
672bba3a CL |
726 | * before the word boundary. |
727 | * | |
728 | * Padding is done using 0x5a (POISON_INUSE) | |
81819f0f CL |
729 | * |
730 | * object + s->size | |
672bba3a | 731 | * Nothing is used beyond s->size. |
81819f0f | 732 | * |
3b0efdfa | 733 | * If slabcaches are merged then the object_size and inuse boundaries are mostly |
672bba3a | 734 | * ignored. And therefore no slab options that rely on these boundaries |
81819f0f CL |
735 | * may be used with merged slabcaches. |
736 | */ | |
737 | ||
81819f0f CL |
738 | static int check_pad_bytes(struct kmem_cache *s, struct page *page, u8 *p) |
739 | { | |
740 | unsigned long off = s->inuse; /* The end of info */ | |
741 | ||
742 | if (s->offset) | |
743 | /* Freepointer is placed after the object. */ | |
744 | off += sizeof(void *); | |
745 | ||
746 | if (s->flags & SLAB_STORE_USER) | |
747 | /* We also have user information there */ | |
748 | off += 2 * sizeof(struct track); | |
749 | ||
750 | if (s->size == off) | |
751 | return 1; | |
752 | ||
24922684 CL |
753 | return check_bytes_and_report(s, page, p, "Object padding", |
754 | p + off, POISON_INUSE, s->size - off); | |
81819f0f CL |
755 | } |
756 | ||
39b26464 | 757 | /* Check the pad bytes at the end of a slab page */ |
81819f0f CL |
758 | static int slab_pad_check(struct kmem_cache *s, struct page *page) |
759 | { | |
24922684 CL |
760 | u8 *start; |
761 | u8 *fault; | |
762 | u8 *end; | |
763 | int length; | |
764 | int remainder; | |
81819f0f CL |
765 | |
766 | if (!(s->flags & SLAB_POISON)) | |
767 | return 1; | |
768 | ||
a973e9dd | 769 | start = page_address(page); |
ab9a0f19 | 770 | length = (PAGE_SIZE << compound_order(page)) - s->reserved; |
39b26464 CL |
771 | end = start + length; |
772 | remainder = length % s->size; | |
81819f0f CL |
773 | if (!remainder) |
774 | return 1; | |
775 | ||
a79316c6 | 776 | metadata_access_enable(); |
79824820 | 777 | fault = memchr_inv(end - remainder, POISON_INUSE, remainder); |
a79316c6 | 778 | metadata_access_disable(); |
24922684 CL |
779 | if (!fault) |
780 | return 1; | |
781 | while (end > fault && end[-1] == POISON_INUSE) | |
782 | end--; | |
783 | ||
784 | slab_err(s, page, "Padding overwritten. 0x%p-0x%p", fault, end - 1); | |
ffc79d28 | 785 | print_section("Padding ", end - remainder, remainder); |
24922684 | 786 | |
8a3d271d | 787 | restore_bytes(s, "slab padding", POISON_INUSE, end - remainder, end); |
24922684 | 788 | return 0; |
81819f0f CL |
789 | } |
790 | ||
791 | static int check_object(struct kmem_cache *s, struct page *page, | |
f7cb1933 | 792 | void *object, u8 val) |
81819f0f CL |
793 | { |
794 | u8 *p = object; | |
3b0efdfa | 795 | u8 *endobject = object + s->object_size; |
81819f0f CL |
796 | |
797 | if (s->flags & SLAB_RED_ZONE) { | |
24922684 | 798 | if (!check_bytes_and_report(s, page, object, "Redzone", |
3b0efdfa | 799 | endobject, val, s->inuse - s->object_size)) |
81819f0f | 800 | return 0; |
81819f0f | 801 | } else { |
3b0efdfa | 802 | if ((s->flags & SLAB_POISON) && s->object_size < s->inuse) { |
3adbefee | 803 | check_bytes_and_report(s, page, p, "Alignment padding", |
d0e0ac97 CG |
804 | endobject, POISON_INUSE, |
805 | s->inuse - s->object_size); | |
3adbefee | 806 | } |
81819f0f CL |
807 | } |
808 | ||
809 | if (s->flags & SLAB_POISON) { | |
f7cb1933 | 810 | if (val != SLUB_RED_ACTIVE && (s->flags & __OBJECT_POISON) && |
24922684 | 811 | (!check_bytes_and_report(s, page, p, "Poison", p, |
3b0efdfa | 812 | POISON_FREE, s->object_size - 1) || |
24922684 | 813 | !check_bytes_and_report(s, page, p, "Poison", |
3b0efdfa | 814 | p + s->object_size - 1, POISON_END, 1))) |
81819f0f | 815 | return 0; |
81819f0f CL |
816 | /* |
817 | * check_pad_bytes cleans up on its own. | |
818 | */ | |
819 | check_pad_bytes(s, page, p); | |
820 | } | |
821 | ||
f7cb1933 | 822 | if (!s->offset && val == SLUB_RED_ACTIVE) |
81819f0f CL |
823 | /* |
824 | * Object and freepointer overlap. Cannot check | |
825 | * freepointer while object is allocated. | |
826 | */ | |
827 | return 1; | |
828 | ||
829 | /* Check free pointer validity */ | |
830 | if (!check_valid_pointer(s, page, get_freepointer(s, p))) { | |
831 | object_err(s, page, p, "Freepointer corrupt"); | |
832 | /* | |
9f6c708e | 833 | * No choice but to zap it and thus lose the remainder |
81819f0f | 834 | * of the free objects in this slab. May cause |
672bba3a | 835 | * another error because the object count is now wrong. |
81819f0f | 836 | */ |
a973e9dd | 837 | set_freepointer(s, p, NULL); |
81819f0f CL |
838 | return 0; |
839 | } | |
840 | return 1; | |
841 | } | |
842 | ||
843 | static int check_slab(struct kmem_cache *s, struct page *page) | |
844 | { | |
39b26464 CL |
845 | int maxobj; |
846 | ||
81819f0f CL |
847 | VM_BUG_ON(!irqs_disabled()); |
848 | ||
849 | if (!PageSlab(page)) { | |
24922684 | 850 | slab_err(s, page, "Not a valid slab page"); |
81819f0f CL |
851 | return 0; |
852 | } | |
39b26464 | 853 | |
ab9a0f19 | 854 | maxobj = order_objects(compound_order(page), s->size, s->reserved); |
39b26464 CL |
855 | if (page->objects > maxobj) { |
856 | slab_err(s, page, "objects %u > max %u", | |
f6edde9c | 857 | page->objects, maxobj); |
39b26464 CL |
858 | return 0; |
859 | } | |
860 | if (page->inuse > page->objects) { | |
24922684 | 861 | slab_err(s, page, "inuse %u > max %u", |
f6edde9c | 862 | page->inuse, page->objects); |
81819f0f CL |
863 | return 0; |
864 | } | |
865 | /* Slab_pad_check fixes things up after itself */ | |
866 | slab_pad_check(s, page); | |
867 | return 1; | |
868 | } | |
869 | ||
870 | /* | |
672bba3a CL |
871 | * Determine if a certain object on a page is on the freelist. Must hold the |
872 | * slab lock to guarantee that the chains are in a consistent state. | |
81819f0f CL |
873 | */ |
874 | static int on_freelist(struct kmem_cache *s, struct page *page, void *search) | |
875 | { | |
876 | int nr = 0; | |
881db7fb | 877 | void *fp; |
81819f0f | 878 | void *object = NULL; |
f6edde9c | 879 | int max_objects; |
81819f0f | 880 | |
881db7fb | 881 | fp = page->freelist; |
39b26464 | 882 | while (fp && nr <= page->objects) { |
81819f0f CL |
883 | if (fp == search) |
884 | return 1; | |
885 | if (!check_valid_pointer(s, page, fp)) { | |
886 | if (object) { | |
887 | object_err(s, page, object, | |
888 | "Freechain corrupt"); | |
a973e9dd | 889 | set_freepointer(s, object, NULL); |
81819f0f | 890 | } else { |
24922684 | 891 | slab_err(s, page, "Freepointer corrupt"); |
a973e9dd | 892 | page->freelist = NULL; |
39b26464 | 893 | page->inuse = page->objects; |
24922684 | 894 | slab_fix(s, "Freelist cleared"); |
81819f0f CL |
895 | return 0; |
896 | } | |
897 | break; | |
898 | } | |
899 | object = fp; | |
900 | fp = get_freepointer(s, object); | |
901 | nr++; | |
902 | } | |
903 | ||
ab9a0f19 | 904 | max_objects = order_objects(compound_order(page), s->size, s->reserved); |
210b5c06 CG |
905 | if (max_objects > MAX_OBJS_PER_PAGE) |
906 | max_objects = MAX_OBJS_PER_PAGE; | |
224a88be CL |
907 | |
908 | if (page->objects != max_objects) { | |
909 | slab_err(s, page, "Wrong number of objects. Found %d but " | |
910 | "should be %d", page->objects, max_objects); | |
911 | page->objects = max_objects; | |
912 | slab_fix(s, "Number of objects adjusted."); | |
913 | } | |
39b26464 | 914 | if (page->inuse != page->objects - nr) { |
70d71228 | 915 | slab_err(s, page, "Wrong object count. Counter is %d but " |
39b26464 CL |
916 | "counted were %d", page->inuse, page->objects - nr); |
917 | page->inuse = page->objects - nr; | |
24922684 | 918 | slab_fix(s, "Object count adjusted."); |
81819f0f CL |
919 | } |
920 | return search == NULL; | |
921 | } | |
922 | ||
0121c619 CL |
923 | static void trace(struct kmem_cache *s, struct page *page, void *object, |
924 | int alloc) | |
3ec09742 CL |
925 | { |
926 | if (s->flags & SLAB_TRACE) { | |
f9f58285 | 927 | pr_info("TRACE %s %s 0x%p inuse=%d fp=0x%p\n", |
3ec09742 CL |
928 | s->name, |
929 | alloc ? "alloc" : "free", | |
930 | object, page->inuse, | |
931 | page->freelist); | |
932 | ||
933 | if (!alloc) | |
d0e0ac97 CG |
934 | print_section("Object ", (void *)object, |
935 | s->object_size); | |
3ec09742 CL |
936 | |
937 | dump_stack(); | |
938 | } | |
939 | } | |
940 | ||
643b1138 | 941 | /* |
672bba3a | 942 | * Tracking of fully allocated slabs for debugging purposes. |
643b1138 | 943 | */ |
5cc6eee8 CL |
944 | static void add_full(struct kmem_cache *s, |
945 | struct kmem_cache_node *n, struct page *page) | |
643b1138 | 946 | { |
5cc6eee8 CL |
947 | if (!(s->flags & SLAB_STORE_USER)) |
948 | return; | |
949 | ||
255d0884 | 950 | lockdep_assert_held(&n->list_lock); |
643b1138 | 951 | list_add(&page->lru, &n->full); |
643b1138 CL |
952 | } |
953 | ||
c65c1877 | 954 | static void remove_full(struct kmem_cache *s, struct kmem_cache_node *n, struct page *page) |
643b1138 | 955 | { |
643b1138 CL |
956 | if (!(s->flags & SLAB_STORE_USER)) |
957 | return; | |
958 | ||
255d0884 | 959 | lockdep_assert_held(&n->list_lock); |
643b1138 | 960 | list_del(&page->lru); |
643b1138 CL |
961 | } |
962 | ||
0f389ec6 CL |
963 | /* Tracking of the number of slabs for debugging purposes */ |
964 | static inline unsigned long slabs_node(struct kmem_cache *s, int node) | |
965 | { | |
966 | struct kmem_cache_node *n = get_node(s, node); | |
967 | ||
968 | return atomic_long_read(&n->nr_slabs); | |
969 | } | |
970 | ||
26c02cf0 AB |
971 | static inline unsigned long node_nr_slabs(struct kmem_cache_node *n) |
972 | { | |
973 | return atomic_long_read(&n->nr_slabs); | |
974 | } | |
975 | ||
205ab99d | 976 | static inline void inc_slabs_node(struct kmem_cache *s, int node, int objects) |
0f389ec6 CL |
977 | { |
978 | struct kmem_cache_node *n = get_node(s, node); | |
979 | ||
980 | /* | |
981 | * May be called early in order to allocate a slab for the | |
982 | * kmem_cache_node structure. Solve the chicken-egg | |
983 | * dilemma by deferring the increment of the count during | |
984 | * bootstrap (see early_kmem_cache_node_alloc). | |
985 | */ | |
338b2642 | 986 | if (likely(n)) { |
0f389ec6 | 987 | atomic_long_inc(&n->nr_slabs); |
205ab99d CL |
988 | atomic_long_add(objects, &n->total_objects); |
989 | } | |
0f389ec6 | 990 | } |
205ab99d | 991 | static inline void dec_slabs_node(struct kmem_cache *s, int node, int objects) |
0f389ec6 CL |
992 | { |
993 | struct kmem_cache_node *n = get_node(s, node); | |
994 | ||
995 | atomic_long_dec(&n->nr_slabs); | |
205ab99d | 996 | atomic_long_sub(objects, &n->total_objects); |
0f389ec6 CL |
997 | } |
998 | ||
999 | /* Object debug checks for alloc/free paths */ | |
3ec09742 CL |
1000 | static void setup_object_debug(struct kmem_cache *s, struct page *page, |
1001 | void *object) | |
1002 | { | |
1003 | if (!(s->flags & (SLAB_STORE_USER|SLAB_RED_ZONE|__OBJECT_POISON))) | |
1004 | return; | |
1005 | ||
f7cb1933 | 1006 | init_object(s, object, SLUB_RED_INACTIVE); |
3ec09742 CL |
1007 | init_tracking(s, object); |
1008 | } | |
1009 | ||
d0e0ac97 CG |
1010 | static noinline int alloc_debug_processing(struct kmem_cache *s, |
1011 | struct page *page, | |
ce71e27c | 1012 | void *object, unsigned long addr) |
81819f0f CL |
1013 | { |
1014 | if (!check_slab(s, page)) | |
1015 | goto bad; | |
1016 | ||
81819f0f CL |
1017 | if (!check_valid_pointer(s, page, object)) { |
1018 | object_err(s, page, object, "Freelist Pointer check fails"); | |
70d71228 | 1019 | goto bad; |
81819f0f CL |
1020 | } |
1021 | ||
f7cb1933 | 1022 | if (!check_object(s, page, object, SLUB_RED_INACTIVE)) |
81819f0f | 1023 | goto bad; |
81819f0f | 1024 | |
3ec09742 CL |
1025 | /* Success perform special debug activities for allocs */ |
1026 | if (s->flags & SLAB_STORE_USER) | |
1027 | set_track(s, object, TRACK_ALLOC, addr); | |
1028 | trace(s, page, object, 1); | |
f7cb1933 | 1029 | init_object(s, object, SLUB_RED_ACTIVE); |
81819f0f | 1030 | return 1; |
3ec09742 | 1031 | |
81819f0f CL |
1032 | bad: |
1033 | if (PageSlab(page)) { | |
1034 | /* | |
1035 | * If this is a slab page then lets do the best we can | |
1036 | * to avoid issues in the future. Marking all objects | |
672bba3a | 1037 | * as used avoids touching the remaining objects. |
81819f0f | 1038 | */ |
24922684 | 1039 | slab_fix(s, "Marking all objects used"); |
39b26464 | 1040 | page->inuse = page->objects; |
a973e9dd | 1041 | page->freelist = NULL; |
81819f0f CL |
1042 | } |
1043 | return 0; | |
1044 | } | |
1045 | ||
81084651 | 1046 | /* Supports checking bulk free of a constructed freelist */ |
282acb43 | 1047 | static noinline int free_debug_processing( |
81084651 JDB |
1048 | struct kmem_cache *s, struct page *page, |
1049 | void *head, void *tail, int bulk_cnt, | |
282acb43 | 1050 | unsigned long addr) |
81819f0f | 1051 | { |
19c7ff9e | 1052 | struct kmem_cache_node *n = get_node(s, page_to_nid(page)); |
81084651 JDB |
1053 | void *object = head; |
1054 | int cnt = 0; | |
282acb43 | 1055 | unsigned long uninitialized_var(flags); |
804aa132 | 1056 | int ret = 0; |
5c2e4bbb | 1057 | |
282acb43 | 1058 | spin_lock_irqsave(&n->list_lock, flags); |
881db7fb CL |
1059 | slab_lock(page); |
1060 | ||
81819f0f | 1061 | if (!check_slab(s, page)) |
804aa132 | 1062 | goto out; |
81819f0f | 1063 | |
81084651 JDB |
1064 | next_object: |
1065 | cnt++; | |
1066 | ||
81819f0f | 1067 | if (!check_valid_pointer(s, page, object)) { |
70d71228 | 1068 | slab_err(s, page, "Invalid object pointer 0x%p", object); |
804aa132 | 1069 | goto out; |
81819f0f CL |
1070 | } |
1071 | ||
1072 | if (on_freelist(s, page, object)) { | |
24922684 | 1073 | object_err(s, page, object, "Object already free"); |
804aa132 | 1074 | goto out; |
81819f0f CL |
1075 | } |
1076 | ||
f7cb1933 | 1077 | if (!check_object(s, page, object, SLUB_RED_ACTIVE)) |
5c2e4bbb | 1078 | goto out; |
81819f0f | 1079 | |
1b4f59e3 | 1080 | if (unlikely(s != page->slab_cache)) { |
3adbefee | 1081 | if (!PageSlab(page)) { |
70d71228 CL |
1082 | slab_err(s, page, "Attempt to free object(0x%p) " |
1083 | "outside of slab", object); | |
1b4f59e3 | 1084 | } else if (!page->slab_cache) { |
f9f58285 FF |
1085 | pr_err("SLUB <none>: no slab for object 0x%p.\n", |
1086 | object); | |
70d71228 | 1087 | dump_stack(); |
06428780 | 1088 | } else |
24922684 CL |
1089 | object_err(s, page, object, |
1090 | "page slab pointer corrupt."); | |
804aa132 | 1091 | goto out; |
81819f0f | 1092 | } |
3ec09742 | 1093 | |
3ec09742 CL |
1094 | if (s->flags & SLAB_STORE_USER) |
1095 | set_track(s, object, TRACK_FREE, addr); | |
1096 | trace(s, page, object, 0); | |
81084651 | 1097 | /* Freepointer not overwritten by init_object(), SLAB_POISON moved it */ |
f7cb1933 | 1098 | init_object(s, object, SLUB_RED_INACTIVE); |
81084651 JDB |
1099 | |
1100 | /* Reached end of constructed freelist yet? */ | |
1101 | if (object != tail) { | |
1102 | object = get_freepointer(s, object); | |
1103 | goto next_object; | |
1104 | } | |
804aa132 LA |
1105 | ret = 1; |
1106 | ||
5c2e4bbb | 1107 | out: |
81084651 JDB |
1108 | if (cnt != bulk_cnt) |
1109 | slab_err(s, page, "Bulk freelist count(%d) invalid(%d)\n", | |
1110 | bulk_cnt, cnt); | |
1111 | ||
881db7fb | 1112 | slab_unlock(page); |
282acb43 | 1113 | spin_unlock_irqrestore(&n->list_lock, flags); |
804aa132 LA |
1114 | if (!ret) |
1115 | slab_fix(s, "Object at 0x%p not freed", object); | |
1116 | return ret; | |
81819f0f CL |
1117 | } |
1118 | ||
41ecc55b CL |
1119 | static int __init setup_slub_debug(char *str) |
1120 | { | |
f0630fff CL |
1121 | slub_debug = DEBUG_DEFAULT_FLAGS; |
1122 | if (*str++ != '=' || !*str) | |
1123 | /* | |
1124 | * No options specified. Switch on full debugging. | |
1125 | */ | |
1126 | goto out; | |
1127 | ||
1128 | if (*str == ',') | |
1129 | /* | |
1130 | * No options but restriction on slabs. This means full | |
1131 | * debugging for slabs matching a pattern. | |
1132 | */ | |
1133 | goto check_slabs; | |
1134 | ||
1135 | slub_debug = 0; | |
1136 | if (*str == '-') | |
1137 | /* | |
1138 | * Switch off all debugging measures. | |
1139 | */ | |
1140 | goto out; | |
1141 | ||
1142 | /* | |
1143 | * Determine which debug features should be switched on | |
1144 | */ | |
06428780 | 1145 | for (; *str && *str != ','; str++) { |
f0630fff CL |
1146 | switch (tolower(*str)) { |
1147 | case 'f': | |
1148 | slub_debug |= SLAB_DEBUG_FREE; | |
1149 | break; | |
1150 | case 'z': | |
1151 | slub_debug |= SLAB_RED_ZONE; | |
1152 | break; | |
1153 | case 'p': | |
1154 | slub_debug |= SLAB_POISON; | |
1155 | break; | |
1156 | case 'u': | |
1157 | slub_debug |= SLAB_STORE_USER; | |
1158 | break; | |
1159 | case 't': | |
1160 | slub_debug |= SLAB_TRACE; | |
1161 | break; | |
4c13dd3b DM |
1162 | case 'a': |
1163 | slub_debug |= SLAB_FAILSLAB; | |
1164 | break; | |
08303a73 CA |
1165 | case 'o': |
1166 | /* | |
1167 | * Avoid enabling debugging on caches if its minimum | |
1168 | * order would increase as a result. | |
1169 | */ | |
1170 | disable_higher_order_debug = 1; | |
1171 | break; | |
f0630fff | 1172 | default: |
f9f58285 FF |
1173 | pr_err("slub_debug option '%c' unknown. skipped\n", |
1174 | *str); | |
f0630fff | 1175 | } |
41ecc55b CL |
1176 | } |
1177 | ||
f0630fff | 1178 | check_slabs: |
41ecc55b CL |
1179 | if (*str == ',') |
1180 | slub_debug_slabs = str + 1; | |
f0630fff | 1181 | out: |
41ecc55b CL |
1182 | return 1; |
1183 | } | |
1184 | ||
1185 | __setup("slub_debug", setup_slub_debug); | |
1186 | ||
423c929c | 1187 | unsigned long kmem_cache_flags(unsigned long object_size, |
ba0268a8 | 1188 | unsigned long flags, const char *name, |
51cc5068 | 1189 | void (*ctor)(void *)) |
41ecc55b CL |
1190 | { |
1191 | /* | |
e153362a | 1192 | * Enable debugging if selected on the kernel commandline. |
41ecc55b | 1193 | */ |
c6f58d9b CL |
1194 | if (slub_debug && (!slub_debug_slabs || (name && |
1195 | !strncmp(slub_debug_slabs, name, strlen(slub_debug_slabs))))) | |
3de47213 | 1196 | flags |= slub_debug; |
ba0268a8 CL |
1197 | |
1198 | return flags; | |
41ecc55b | 1199 | } |
b4a64718 | 1200 | #else /* !CONFIG_SLUB_DEBUG */ |
3ec09742 CL |
1201 | static inline void setup_object_debug(struct kmem_cache *s, |
1202 | struct page *page, void *object) {} | |
41ecc55b | 1203 | |
3ec09742 | 1204 | static inline int alloc_debug_processing(struct kmem_cache *s, |
ce71e27c | 1205 | struct page *page, void *object, unsigned long addr) { return 0; } |
41ecc55b | 1206 | |
282acb43 | 1207 | static inline int free_debug_processing( |
81084651 JDB |
1208 | struct kmem_cache *s, struct page *page, |
1209 | void *head, void *tail, int bulk_cnt, | |
282acb43 | 1210 | unsigned long addr) { return 0; } |
41ecc55b | 1211 | |
41ecc55b CL |
1212 | static inline int slab_pad_check(struct kmem_cache *s, struct page *page) |
1213 | { return 1; } | |
1214 | static inline int check_object(struct kmem_cache *s, struct page *page, | |
f7cb1933 | 1215 | void *object, u8 val) { return 1; } |
5cc6eee8 CL |
1216 | static inline void add_full(struct kmem_cache *s, struct kmem_cache_node *n, |
1217 | struct page *page) {} | |
c65c1877 PZ |
1218 | static inline void remove_full(struct kmem_cache *s, struct kmem_cache_node *n, |
1219 | struct page *page) {} | |
423c929c | 1220 | unsigned long kmem_cache_flags(unsigned long object_size, |
ba0268a8 | 1221 | unsigned long flags, const char *name, |
51cc5068 | 1222 | void (*ctor)(void *)) |
ba0268a8 CL |
1223 | { |
1224 | return flags; | |
1225 | } | |
41ecc55b | 1226 | #define slub_debug 0 |
0f389ec6 | 1227 | |
fdaa45e9 IM |
1228 | #define disable_higher_order_debug 0 |
1229 | ||
0f389ec6 CL |
1230 | static inline unsigned long slabs_node(struct kmem_cache *s, int node) |
1231 | { return 0; } | |
26c02cf0 AB |
1232 | static inline unsigned long node_nr_slabs(struct kmem_cache_node *n) |
1233 | { return 0; } | |
205ab99d CL |
1234 | static inline void inc_slabs_node(struct kmem_cache *s, int node, |
1235 | int objects) {} | |
1236 | static inline void dec_slabs_node(struct kmem_cache *s, int node, | |
1237 | int objects) {} | |
7d550c56 | 1238 | |
02e72cc6 AR |
1239 | #endif /* CONFIG_SLUB_DEBUG */ |
1240 | ||
1241 | /* | |
1242 | * Hooks for other subsystems that check memory allocations. In a typical | |
1243 | * production configuration these hooks all should produce no code at all. | |
1244 | */ | |
d56791b3 RB |
1245 | static inline void kmalloc_large_node_hook(void *ptr, size_t size, gfp_t flags) |
1246 | { | |
1247 | kmemleak_alloc(ptr, size, 1, flags); | |
0316bec2 | 1248 | kasan_kmalloc_large(ptr, size); |
d56791b3 RB |
1249 | } |
1250 | ||
1251 | static inline void kfree_hook(const void *x) | |
1252 | { | |
1253 | kmemleak_free(x); | |
0316bec2 | 1254 | kasan_kfree_large(x); |
d56791b3 RB |
1255 | } |
1256 | ||
d56791b3 RB |
1257 | static inline void slab_free_hook(struct kmem_cache *s, void *x) |
1258 | { | |
1259 | kmemleak_free_recursive(x, s->flags); | |
7d550c56 | 1260 | |
02e72cc6 AR |
1261 | /* |
1262 | * Trouble is that we may no longer disable interrupts in the fast path | |
1263 | * So in order to make the debug calls that expect irqs to be | |
1264 | * disabled we need to disable interrupts temporarily. | |
1265 | */ | |
1266 | #if defined(CONFIG_KMEMCHECK) || defined(CONFIG_LOCKDEP) | |
1267 | { | |
1268 | unsigned long flags; | |
1269 | ||
1270 | local_irq_save(flags); | |
1271 | kmemcheck_slab_free(s, x, s->object_size); | |
1272 | debug_check_no_locks_freed(x, s->object_size); | |
1273 | local_irq_restore(flags); | |
1274 | } | |
1275 | #endif | |
1276 | if (!(s->flags & SLAB_DEBUG_OBJECTS)) | |
1277 | debug_check_no_obj_freed(x, s->object_size); | |
0316bec2 AR |
1278 | |
1279 | kasan_slab_free(s, x); | |
02e72cc6 | 1280 | } |
205ab99d | 1281 | |
81084651 JDB |
1282 | static inline void slab_free_freelist_hook(struct kmem_cache *s, |
1283 | void *head, void *tail) | |
1284 | { | |
1285 | /* | |
1286 | * Compiler cannot detect this function can be removed if slab_free_hook() | |
1287 | * evaluates to nothing. Thus, catch all relevant config debug options here. | |
1288 | */ | |
1289 | #if defined(CONFIG_KMEMCHECK) || \ | |
1290 | defined(CONFIG_LOCKDEP) || \ | |
1291 | defined(CONFIG_DEBUG_KMEMLEAK) || \ | |
1292 | defined(CONFIG_DEBUG_OBJECTS_FREE) || \ | |
1293 | defined(CONFIG_KASAN) | |
1294 | ||
1295 | void *object = head; | |
1296 | void *tail_obj = tail ? : head; | |
1297 | ||
1298 | do { | |
1299 | slab_free_hook(s, object); | |
1300 | } while ((object != tail_obj) && | |
1301 | (object = get_freepointer(s, object))); | |
1302 | #endif | |
1303 | } | |
1304 | ||
588f8ba9 TG |
1305 | static void setup_object(struct kmem_cache *s, struct page *page, |
1306 | void *object) | |
1307 | { | |
1308 | setup_object_debug(s, page, object); | |
1309 | if (unlikely(s->ctor)) { | |
1310 | kasan_unpoison_object_data(s, object); | |
1311 | s->ctor(object); | |
1312 | kasan_poison_object_data(s, object); | |
1313 | } | |
1314 | } | |
1315 | ||
81819f0f CL |
1316 | /* |
1317 | * Slab allocation and freeing | |
1318 | */ | |
5dfb4175 VD |
1319 | static inline struct page *alloc_slab_page(struct kmem_cache *s, |
1320 | gfp_t flags, int node, struct kmem_cache_order_objects oo) | |
65c3376a | 1321 | { |
5dfb4175 | 1322 | struct page *page; |
65c3376a CL |
1323 | int order = oo_order(oo); |
1324 | ||
b1eeab67 VN |
1325 | flags |= __GFP_NOTRACK; |
1326 | ||
2154a336 | 1327 | if (node == NUMA_NO_NODE) |
5dfb4175 | 1328 | page = alloc_pages(flags, order); |
65c3376a | 1329 | else |
96db800f | 1330 | page = __alloc_pages_node(node, flags, order); |
5dfb4175 | 1331 | |
f3ccb2c4 VD |
1332 | if (page && memcg_charge_slab(page, flags, order, s)) { |
1333 | __free_pages(page, order); | |
1334 | page = NULL; | |
1335 | } | |
5dfb4175 VD |
1336 | |
1337 | return page; | |
65c3376a CL |
1338 | } |
1339 | ||
81819f0f CL |
1340 | static struct page *allocate_slab(struct kmem_cache *s, gfp_t flags, int node) |
1341 | { | |
06428780 | 1342 | struct page *page; |
834f3d11 | 1343 | struct kmem_cache_order_objects oo = s->oo; |
ba52270d | 1344 | gfp_t alloc_gfp; |
588f8ba9 TG |
1345 | void *start, *p; |
1346 | int idx, order; | |
81819f0f | 1347 | |
7e0528da CL |
1348 | flags &= gfp_allowed_mask; |
1349 | ||
d0164adc | 1350 | if (gfpflags_allow_blocking(flags)) |
7e0528da CL |
1351 | local_irq_enable(); |
1352 | ||
b7a49f0d | 1353 | flags |= s->allocflags; |
e12ba74d | 1354 | |
ba52270d PE |
1355 | /* |
1356 | * Let the initial higher-order allocation fail under memory pressure | |
1357 | * so we fall-back to the minimum order allocation. | |
1358 | */ | |
1359 | alloc_gfp = (flags | __GFP_NOWARN | __GFP_NORETRY) & ~__GFP_NOFAIL; | |
d0164adc MG |
1360 | if ((alloc_gfp & __GFP_DIRECT_RECLAIM) && oo_order(oo) > oo_order(s->min)) |
1361 | alloc_gfp = (alloc_gfp | __GFP_NOMEMALLOC) & ~__GFP_DIRECT_RECLAIM; | |
ba52270d | 1362 | |
5dfb4175 | 1363 | page = alloc_slab_page(s, alloc_gfp, node, oo); |
65c3376a CL |
1364 | if (unlikely(!page)) { |
1365 | oo = s->min; | |
80c3a998 | 1366 | alloc_gfp = flags; |
65c3376a CL |
1367 | /* |
1368 | * Allocation may have failed due to fragmentation. | |
1369 | * Try a lower order alloc if possible | |
1370 | */ | |
5dfb4175 | 1371 | page = alloc_slab_page(s, alloc_gfp, node, oo); |
588f8ba9 TG |
1372 | if (unlikely(!page)) |
1373 | goto out; | |
1374 | stat(s, ORDER_FALLBACK); | |
65c3376a | 1375 | } |
5a896d9e | 1376 | |
588f8ba9 TG |
1377 | if (kmemcheck_enabled && |
1378 | !(s->flags & (SLAB_NOTRACK | DEBUG_DEFAULT_FLAGS))) { | |
b1eeab67 VN |
1379 | int pages = 1 << oo_order(oo); |
1380 | ||
80c3a998 | 1381 | kmemcheck_alloc_shadow(page, oo_order(oo), alloc_gfp, node); |
b1eeab67 VN |
1382 | |
1383 | /* | |
1384 | * Objects from caches that have a constructor don't get | |
1385 | * cleared when they're allocated, so we need to do it here. | |
1386 | */ | |
1387 | if (s->ctor) | |
1388 | kmemcheck_mark_uninitialized_pages(page, pages); | |
1389 | else | |
1390 | kmemcheck_mark_unallocated_pages(page, pages); | |
5a896d9e VN |
1391 | } |
1392 | ||
834f3d11 | 1393 | page->objects = oo_objects(oo); |
81819f0f | 1394 | |
1f458cbf | 1395 | order = compound_order(page); |
1b4f59e3 | 1396 | page->slab_cache = s; |
c03f94cc | 1397 | __SetPageSlab(page); |
2f064f34 | 1398 | if (page_is_pfmemalloc(page)) |
072bb0aa | 1399 | SetPageSlabPfmemalloc(page); |
81819f0f CL |
1400 | |
1401 | start = page_address(page); | |
81819f0f CL |
1402 | |
1403 | if (unlikely(s->flags & SLAB_POISON)) | |
1f458cbf | 1404 | memset(start, POISON_INUSE, PAGE_SIZE << order); |
81819f0f | 1405 | |
0316bec2 AR |
1406 | kasan_poison_slab(page); |
1407 | ||
54266640 WY |
1408 | for_each_object_idx(p, idx, s, start, page->objects) { |
1409 | setup_object(s, page, p); | |
1410 | if (likely(idx < page->objects)) | |
1411 | set_freepointer(s, p, p + s->size); | |
1412 | else | |
1413 | set_freepointer(s, p, NULL); | |
81819f0f | 1414 | } |
81819f0f CL |
1415 | |
1416 | page->freelist = start; | |
e6e82ea1 | 1417 | page->inuse = page->objects; |
8cb0a506 | 1418 | page->frozen = 1; |
588f8ba9 | 1419 | |
81819f0f | 1420 | out: |
d0164adc | 1421 | if (gfpflags_allow_blocking(flags)) |
588f8ba9 TG |
1422 | local_irq_disable(); |
1423 | if (!page) | |
1424 | return NULL; | |
1425 | ||
1426 | mod_zone_page_state(page_zone(page), | |
1427 | (s->flags & SLAB_RECLAIM_ACCOUNT) ? | |
1428 | NR_SLAB_RECLAIMABLE : NR_SLAB_UNRECLAIMABLE, | |
1429 | 1 << oo_order(oo)); | |
1430 | ||
1431 | inc_slabs_node(s, page_to_nid(page), page->objects); | |
1432 | ||
81819f0f CL |
1433 | return page; |
1434 | } | |
1435 | ||
588f8ba9 TG |
1436 | static struct page *new_slab(struct kmem_cache *s, gfp_t flags, int node) |
1437 | { | |
1438 | if (unlikely(flags & GFP_SLAB_BUG_MASK)) { | |
1439 | pr_emerg("gfp: %u\n", flags & GFP_SLAB_BUG_MASK); | |
1440 | BUG(); | |
1441 | } | |
1442 | ||
1443 | return allocate_slab(s, | |
1444 | flags & (GFP_RECLAIM_MASK | GFP_CONSTRAINT_MASK), node); | |
1445 | } | |
1446 | ||
81819f0f CL |
1447 | static void __free_slab(struct kmem_cache *s, struct page *page) |
1448 | { | |
834f3d11 CL |
1449 | int order = compound_order(page); |
1450 | int pages = 1 << order; | |
81819f0f | 1451 | |
af537b0a | 1452 | if (kmem_cache_debug(s)) { |
81819f0f CL |
1453 | void *p; |
1454 | ||
1455 | slab_pad_check(s, page); | |
224a88be CL |
1456 | for_each_object(p, s, page_address(page), |
1457 | page->objects) | |
f7cb1933 | 1458 | check_object(s, page, p, SLUB_RED_INACTIVE); |
81819f0f CL |
1459 | } |
1460 | ||
b1eeab67 | 1461 | kmemcheck_free_shadow(page, compound_order(page)); |
5a896d9e | 1462 | |
81819f0f CL |
1463 | mod_zone_page_state(page_zone(page), |
1464 | (s->flags & SLAB_RECLAIM_ACCOUNT) ? | |
1465 | NR_SLAB_RECLAIMABLE : NR_SLAB_UNRECLAIMABLE, | |
06428780 | 1466 | -pages); |
81819f0f | 1467 | |
072bb0aa | 1468 | __ClearPageSlabPfmemalloc(page); |
49bd5221 | 1469 | __ClearPageSlab(page); |
1f458cbf | 1470 | |
22b751c3 | 1471 | page_mapcount_reset(page); |
1eb5ac64 NP |
1472 | if (current->reclaim_state) |
1473 | current->reclaim_state->reclaimed_slab += pages; | |
f3ccb2c4 | 1474 | __free_kmem_pages(page, order); |
81819f0f CL |
1475 | } |
1476 | ||
da9a638c LJ |
1477 | #define need_reserve_slab_rcu \ |
1478 | (sizeof(((struct page *)NULL)->lru) < sizeof(struct rcu_head)) | |
1479 | ||
81819f0f CL |
1480 | static void rcu_free_slab(struct rcu_head *h) |
1481 | { | |
1482 | struct page *page; | |
1483 | ||
da9a638c LJ |
1484 | if (need_reserve_slab_rcu) |
1485 | page = virt_to_head_page(h); | |
1486 | else | |
1487 | page = container_of((struct list_head *)h, struct page, lru); | |
1488 | ||
1b4f59e3 | 1489 | __free_slab(page->slab_cache, page); |
81819f0f CL |
1490 | } |
1491 | ||
1492 | static void free_slab(struct kmem_cache *s, struct page *page) | |
1493 | { | |
1494 | if (unlikely(s->flags & SLAB_DESTROY_BY_RCU)) { | |
da9a638c LJ |
1495 | struct rcu_head *head; |
1496 | ||
1497 | if (need_reserve_slab_rcu) { | |
1498 | int order = compound_order(page); | |
1499 | int offset = (PAGE_SIZE << order) - s->reserved; | |
1500 | ||
1501 | VM_BUG_ON(s->reserved != sizeof(*head)); | |
1502 | head = page_address(page) + offset; | |
1503 | } else { | |
bc4f610d | 1504 | head = &page->rcu_head; |
da9a638c | 1505 | } |
81819f0f CL |
1506 | |
1507 | call_rcu(head, rcu_free_slab); | |
1508 | } else | |
1509 | __free_slab(s, page); | |
1510 | } | |
1511 | ||
1512 | static void discard_slab(struct kmem_cache *s, struct page *page) | |
1513 | { | |
205ab99d | 1514 | dec_slabs_node(s, page_to_nid(page), page->objects); |
81819f0f CL |
1515 | free_slab(s, page); |
1516 | } | |
1517 | ||
1518 | /* | |
5cc6eee8 | 1519 | * Management of partially allocated slabs. |
81819f0f | 1520 | */ |
1e4dd946 SR |
1521 | static inline void |
1522 | __add_partial(struct kmem_cache_node *n, struct page *page, int tail) | |
81819f0f | 1523 | { |
e95eed57 | 1524 | n->nr_partial++; |
136333d1 | 1525 | if (tail == DEACTIVATE_TO_TAIL) |
7c2e132c CL |
1526 | list_add_tail(&page->lru, &n->partial); |
1527 | else | |
1528 | list_add(&page->lru, &n->partial); | |
81819f0f CL |
1529 | } |
1530 | ||
1e4dd946 SR |
1531 | static inline void add_partial(struct kmem_cache_node *n, |
1532 | struct page *page, int tail) | |
62e346a8 | 1533 | { |
c65c1877 | 1534 | lockdep_assert_held(&n->list_lock); |
1e4dd946 SR |
1535 | __add_partial(n, page, tail); |
1536 | } | |
c65c1877 | 1537 | |
1e4dd946 SR |
1538 | static inline void remove_partial(struct kmem_cache_node *n, |
1539 | struct page *page) | |
1540 | { | |
1541 | lockdep_assert_held(&n->list_lock); | |
52b4b950 DS |
1542 | list_del(&page->lru); |
1543 | n->nr_partial--; | |
1e4dd946 SR |
1544 | } |
1545 | ||
81819f0f | 1546 | /* |
7ced3719 CL |
1547 | * Remove slab from the partial list, freeze it and |
1548 | * return the pointer to the freelist. | |
81819f0f | 1549 | * |
497b66f2 | 1550 | * Returns a list of objects or NULL if it fails. |
81819f0f | 1551 | */ |
497b66f2 | 1552 | static inline void *acquire_slab(struct kmem_cache *s, |
acd19fd1 | 1553 | struct kmem_cache_node *n, struct page *page, |
633b0764 | 1554 | int mode, int *objects) |
81819f0f | 1555 | { |
2cfb7455 CL |
1556 | void *freelist; |
1557 | unsigned long counters; | |
1558 | struct page new; | |
1559 | ||
c65c1877 PZ |
1560 | lockdep_assert_held(&n->list_lock); |
1561 | ||
2cfb7455 CL |
1562 | /* |
1563 | * Zap the freelist and set the frozen bit. | |
1564 | * The old freelist is the list of objects for the | |
1565 | * per cpu allocation list. | |
1566 | */ | |
7ced3719 CL |
1567 | freelist = page->freelist; |
1568 | counters = page->counters; | |
1569 | new.counters = counters; | |
633b0764 | 1570 | *objects = new.objects - new.inuse; |
23910c50 | 1571 | if (mode) { |
7ced3719 | 1572 | new.inuse = page->objects; |
23910c50 PE |
1573 | new.freelist = NULL; |
1574 | } else { | |
1575 | new.freelist = freelist; | |
1576 | } | |
2cfb7455 | 1577 | |
a0132ac0 | 1578 | VM_BUG_ON(new.frozen); |
7ced3719 | 1579 | new.frozen = 1; |
2cfb7455 | 1580 | |
7ced3719 | 1581 | if (!__cmpxchg_double_slab(s, page, |
2cfb7455 | 1582 | freelist, counters, |
02d7633f | 1583 | new.freelist, new.counters, |
7ced3719 | 1584 | "acquire_slab")) |
7ced3719 | 1585 | return NULL; |
2cfb7455 CL |
1586 | |
1587 | remove_partial(n, page); | |
7ced3719 | 1588 | WARN_ON(!freelist); |
49e22585 | 1589 | return freelist; |
81819f0f CL |
1590 | } |
1591 | ||
633b0764 | 1592 | static void put_cpu_partial(struct kmem_cache *s, struct page *page, int drain); |
8ba00bb6 | 1593 | static inline bool pfmemalloc_match(struct page *page, gfp_t gfpflags); |
49e22585 | 1594 | |
81819f0f | 1595 | /* |
672bba3a | 1596 | * Try to allocate a partial slab from a specific node. |
81819f0f | 1597 | */ |
8ba00bb6 JK |
1598 | static void *get_partial_node(struct kmem_cache *s, struct kmem_cache_node *n, |
1599 | struct kmem_cache_cpu *c, gfp_t flags) | |
81819f0f | 1600 | { |
49e22585 CL |
1601 | struct page *page, *page2; |
1602 | void *object = NULL; | |
633b0764 JK |
1603 | int available = 0; |
1604 | int objects; | |
81819f0f CL |
1605 | |
1606 | /* | |
1607 | * Racy check. If we mistakenly see no partial slabs then we | |
1608 | * just allocate an empty slab. If we mistakenly try to get a | |
672bba3a CL |
1609 | * partial slab and there is none available then get_partials() |
1610 | * will return NULL. | |
81819f0f CL |
1611 | */ |
1612 | if (!n || !n->nr_partial) | |
1613 | return NULL; | |
1614 | ||
1615 | spin_lock(&n->list_lock); | |
49e22585 | 1616 | list_for_each_entry_safe(page, page2, &n->partial, lru) { |
8ba00bb6 | 1617 | void *t; |
49e22585 | 1618 | |
8ba00bb6 JK |
1619 | if (!pfmemalloc_match(page, flags)) |
1620 | continue; | |
1621 | ||
633b0764 | 1622 | t = acquire_slab(s, n, page, object == NULL, &objects); |
49e22585 CL |
1623 | if (!t) |
1624 | break; | |
1625 | ||
633b0764 | 1626 | available += objects; |
12d79634 | 1627 | if (!object) { |
49e22585 | 1628 | c->page = page; |
49e22585 | 1629 | stat(s, ALLOC_FROM_PARTIAL); |
49e22585 | 1630 | object = t; |
49e22585 | 1631 | } else { |
633b0764 | 1632 | put_cpu_partial(s, page, 0); |
8028dcea | 1633 | stat(s, CPU_PARTIAL_NODE); |
49e22585 | 1634 | } |
345c905d JK |
1635 | if (!kmem_cache_has_cpu_partial(s) |
1636 | || available > s->cpu_partial / 2) | |
49e22585 CL |
1637 | break; |
1638 | ||
497b66f2 | 1639 | } |
81819f0f | 1640 | spin_unlock(&n->list_lock); |
497b66f2 | 1641 | return object; |
81819f0f CL |
1642 | } |
1643 | ||
1644 | /* | |
672bba3a | 1645 | * Get a page from somewhere. Search in increasing NUMA distances. |
81819f0f | 1646 | */ |
de3ec035 | 1647 | static void *get_any_partial(struct kmem_cache *s, gfp_t flags, |
acd19fd1 | 1648 | struct kmem_cache_cpu *c) |
81819f0f CL |
1649 | { |
1650 | #ifdef CONFIG_NUMA | |
1651 | struct zonelist *zonelist; | |
dd1a239f | 1652 | struct zoneref *z; |
54a6eb5c MG |
1653 | struct zone *zone; |
1654 | enum zone_type high_zoneidx = gfp_zone(flags); | |
497b66f2 | 1655 | void *object; |
cc9a6c87 | 1656 | unsigned int cpuset_mems_cookie; |
81819f0f CL |
1657 | |
1658 | /* | |
672bba3a CL |
1659 | * The defrag ratio allows a configuration of the tradeoffs between |
1660 | * inter node defragmentation and node local allocations. A lower | |
1661 | * defrag_ratio increases the tendency to do local allocations | |
1662 | * instead of attempting to obtain partial slabs from other nodes. | |
81819f0f | 1663 | * |
672bba3a CL |
1664 | * If the defrag_ratio is set to 0 then kmalloc() always |
1665 | * returns node local objects. If the ratio is higher then kmalloc() | |
1666 | * may return off node objects because partial slabs are obtained | |
1667 | * from other nodes and filled up. | |
81819f0f | 1668 | * |
6446faa2 | 1669 | * If /sys/kernel/slab/xx/defrag_ratio is set to 100 (which makes |
672bba3a CL |
1670 | * defrag_ratio = 1000) then every (well almost) allocation will |
1671 | * first attempt to defrag slab caches on other nodes. This means | |
1672 | * scanning over all nodes to look for partial slabs which may be | |
1673 | * expensive if we do it every time we are trying to find a slab | |
1674 | * with available objects. | |
81819f0f | 1675 | */ |
9824601e CL |
1676 | if (!s->remote_node_defrag_ratio || |
1677 | get_cycles() % 1024 > s->remote_node_defrag_ratio) | |
81819f0f CL |
1678 | return NULL; |
1679 | ||
cc9a6c87 | 1680 | do { |
d26914d1 | 1681 | cpuset_mems_cookie = read_mems_allowed_begin(); |
2a389610 | 1682 | zonelist = node_zonelist(mempolicy_slab_node(), flags); |
cc9a6c87 MG |
1683 | for_each_zone_zonelist(zone, z, zonelist, high_zoneidx) { |
1684 | struct kmem_cache_node *n; | |
1685 | ||
1686 | n = get_node(s, zone_to_nid(zone)); | |
1687 | ||
dee2f8aa | 1688 | if (n && cpuset_zone_allowed(zone, flags) && |
cc9a6c87 | 1689 | n->nr_partial > s->min_partial) { |
8ba00bb6 | 1690 | object = get_partial_node(s, n, c, flags); |
cc9a6c87 MG |
1691 | if (object) { |
1692 | /* | |
d26914d1 MG |
1693 | * Don't check read_mems_allowed_retry() |
1694 | * here - if mems_allowed was updated in | |
1695 | * parallel, that was a harmless race | |
1696 | * between allocation and the cpuset | |
1697 | * update | |
cc9a6c87 | 1698 | */ |
cc9a6c87 MG |
1699 | return object; |
1700 | } | |
c0ff7453 | 1701 | } |
81819f0f | 1702 | } |
d26914d1 | 1703 | } while (read_mems_allowed_retry(cpuset_mems_cookie)); |
81819f0f CL |
1704 | #endif |
1705 | return NULL; | |
1706 | } | |
1707 | ||
1708 | /* | |
1709 | * Get a partial page, lock it and return it. | |
1710 | */ | |
497b66f2 | 1711 | static void *get_partial(struct kmem_cache *s, gfp_t flags, int node, |
acd19fd1 | 1712 | struct kmem_cache_cpu *c) |
81819f0f | 1713 | { |
497b66f2 | 1714 | void *object; |
a561ce00 JK |
1715 | int searchnode = node; |
1716 | ||
1717 | if (node == NUMA_NO_NODE) | |
1718 | searchnode = numa_mem_id(); | |
1719 | else if (!node_present_pages(node)) | |
1720 | searchnode = node_to_mem_node(node); | |
81819f0f | 1721 | |
8ba00bb6 | 1722 | object = get_partial_node(s, get_node(s, searchnode), c, flags); |
497b66f2 CL |
1723 | if (object || node != NUMA_NO_NODE) |
1724 | return object; | |
81819f0f | 1725 | |
acd19fd1 | 1726 | return get_any_partial(s, flags, c); |
81819f0f CL |
1727 | } |
1728 | ||
8a5ec0ba CL |
1729 | #ifdef CONFIG_PREEMPT |
1730 | /* | |
1731 | * Calculate the next globally unique transaction for disambiguiation | |
1732 | * during cmpxchg. The transactions start with the cpu number and are then | |
1733 | * incremented by CONFIG_NR_CPUS. | |
1734 | */ | |
1735 | #define TID_STEP roundup_pow_of_two(CONFIG_NR_CPUS) | |
1736 | #else | |
1737 | /* | |
1738 | * No preemption supported therefore also no need to check for | |
1739 | * different cpus. | |
1740 | */ | |
1741 | #define TID_STEP 1 | |
1742 | #endif | |
1743 | ||
1744 | static inline unsigned long next_tid(unsigned long tid) | |
1745 | { | |
1746 | return tid + TID_STEP; | |
1747 | } | |
1748 | ||
1749 | static inline unsigned int tid_to_cpu(unsigned long tid) | |
1750 | { | |
1751 | return tid % TID_STEP; | |
1752 | } | |
1753 | ||
1754 | static inline unsigned long tid_to_event(unsigned long tid) | |
1755 | { | |
1756 | return tid / TID_STEP; | |
1757 | } | |
1758 | ||
1759 | static inline unsigned int init_tid(int cpu) | |
1760 | { | |
1761 | return cpu; | |
1762 | } | |
1763 | ||
1764 | static inline void note_cmpxchg_failure(const char *n, | |
1765 | const struct kmem_cache *s, unsigned long tid) | |
1766 | { | |
1767 | #ifdef SLUB_DEBUG_CMPXCHG | |
1768 | unsigned long actual_tid = __this_cpu_read(s->cpu_slab->tid); | |
1769 | ||
f9f58285 | 1770 | pr_info("%s %s: cmpxchg redo ", n, s->name); |
8a5ec0ba CL |
1771 | |
1772 | #ifdef CONFIG_PREEMPT | |
1773 | if (tid_to_cpu(tid) != tid_to_cpu(actual_tid)) | |
f9f58285 | 1774 | pr_warn("due to cpu change %d -> %d\n", |
8a5ec0ba CL |
1775 | tid_to_cpu(tid), tid_to_cpu(actual_tid)); |
1776 | else | |
1777 | #endif | |
1778 | if (tid_to_event(tid) != tid_to_event(actual_tid)) | |
f9f58285 | 1779 | pr_warn("due to cpu running other code. Event %ld->%ld\n", |
8a5ec0ba CL |
1780 | tid_to_event(tid), tid_to_event(actual_tid)); |
1781 | else | |
f9f58285 | 1782 | pr_warn("for unknown reason: actual=%lx was=%lx target=%lx\n", |
8a5ec0ba CL |
1783 | actual_tid, tid, next_tid(tid)); |
1784 | #endif | |
4fdccdfb | 1785 | stat(s, CMPXCHG_DOUBLE_CPU_FAIL); |
8a5ec0ba CL |
1786 | } |
1787 | ||
788e1aad | 1788 | static void init_kmem_cache_cpus(struct kmem_cache *s) |
8a5ec0ba | 1789 | { |
8a5ec0ba CL |
1790 | int cpu; |
1791 | ||
1792 | for_each_possible_cpu(cpu) | |
1793 | per_cpu_ptr(s->cpu_slab, cpu)->tid = init_tid(cpu); | |
8a5ec0ba | 1794 | } |
2cfb7455 | 1795 | |
81819f0f CL |
1796 | /* |
1797 | * Remove the cpu slab | |
1798 | */ | |
d0e0ac97 CG |
1799 | static void deactivate_slab(struct kmem_cache *s, struct page *page, |
1800 | void *freelist) | |
81819f0f | 1801 | { |
2cfb7455 | 1802 | enum slab_modes { M_NONE, M_PARTIAL, M_FULL, M_FREE }; |
2cfb7455 CL |
1803 | struct kmem_cache_node *n = get_node(s, page_to_nid(page)); |
1804 | int lock = 0; | |
1805 | enum slab_modes l = M_NONE, m = M_NONE; | |
2cfb7455 | 1806 | void *nextfree; |
136333d1 | 1807 | int tail = DEACTIVATE_TO_HEAD; |
2cfb7455 CL |
1808 | struct page new; |
1809 | struct page old; | |
1810 | ||
1811 | if (page->freelist) { | |
84e554e6 | 1812 | stat(s, DEACTIVATE_REMOTE_FREES); |
136333d1 | 1813 | tail = DEACTIVATE_TO_TAIL; |
2cfb7455 CL |
1814 | } |
1815 | ||
894b8788 | 1816 | /* |
2cfb7455 CL |
1817 | * Stage one: Free all available per cpu objects back |
1818 | * to the page freelist while it is still frozen. Leave the | |
1819 | * last one. | |
1820 | * | |
1821 | * There is no need to take the list->lock because the page | |
1822 | * is still frozen. | |
1823 | */ | |
1824 | while (freelist && (nextfree = get_freepointer(s, freelist))) { | |
1825 | void *prior; | |
1826 | unsigned long counters; | |
1827 | ||
1828 | do { | |
1829 | prior = page->freelist; | |
1830 | counters = page->counters; | |
1831 | set_freepointer(s, freelist, prior); | |
1832 | new.counters = counters; | |
1833 | new.inuse--; | |
a0132ac0 | 1834 | VM_BUG_ON(!new.frozen); |
2cfb7455 | 1835 | |
1d07171c | 1836 | } while (!__cmpxchg_double_slab(s, page, |
2cfb7455 CL |
1837 | prior, counters, |
1838 | freelist, new.counters, | |
1839 | "drain percpu freelist")); | |
1840 | ||
1841 | freelist = nextfree; | |
1842 | } | |
1843 | ||
894b8788 | 1844 | /* |
2cfb7455 CL |
1845 | * Stage two: Ensure that the page is unfrozen while the |
1846 | * list presence reflects the actual number of objects | |
1847 | * during unfreeze. | |
1848 | * | |
1849 | * We setup the list membership and then perform a cmpxchg | |
1850 | * with the count. If there is a mismatch then the page | |
1851 | * is not unfrozen but the page is on the wrong list. | |
1852 | * | |
1853 | * Then we restart the process which may have to remove | |
1854 | * the page from the list that we just put it on again | |
1855 | * because the number of objects in the slab may have | |
1856 | * changed. | |
894b8788 | 1857 | */ |
2cfb7455 | 1858 | redo: |
894b8788 | 1859 | |
2cfb7455 CL |
1860 | old.freelist = page->freelist; |
1861 | old.counters = page->counters; | |
a0132ac0 | 1862 | VM_BUG_ON(!old.frozen); |
7c2e132c | 1863 | |
2cfb7455 CL |
1864 | /* Determine target state of the slab */ |
1865 | new.counters = old.counters; | |
1866 | if (freelist) { | |
1867 | new.inuse--; | |
1868 | set_freepointer(s, freelist, old.freelist); | |
1869 | new.freelist = freelist; | |
1870 | } else | |
1871 | new.freelist = old.freelist; | |
1872 | ||
1873 | new.frozen = 0; | |
1874 | ||
8a5b20ae | 1875 | if (!new.inuse && n->nr_partial >= s->min_partial) |
2cfb7455 CL |
1876 | m = M_FREE; |
1877 | else if (new.freelist) { | |
1878 | m = M_PARTIAL; | |
1879 | if (!lock) { | |
1880 | lock = 1; | |
1881 | /* | |
1882 | * Taking the spinlock removes the possiblity | |
1883 | * that acquire_slab() will see a slab page that | |
1884 | * is frozen | |
1885 | */ | |
1886 | spin_lock(&n->list_lock); | |
1887 | } | |
1888 | } else { | |
1889 | m = M_FULL; | |
1890 | if (kmem_cache_debug(s) && !lock) { | |
1891 | lock = 1; | |
1892 | /* | |
1893 | * This also ensures that the scanning of full | |
1894 | * slabs from diagnostic functions will not see | |
1895 | * any frozen slabs. | |
1896 | */ | |
1897 | spin_lock(&n->list_lock); | |
1898 | } | |
1899 | } | |
1900 | ||
1901 | if (l != m) { | |
1902 | ||
1903 | if (l == M_PARTIAL) | |
1904 | ||
1905 | remove_partial(n, page); | |
1906 | ||
1907 | else if (l == M_FULL) | |
894b8788 | 1908 | |
c65c1877 | 1909 | remove_full(s, n, page); |
2cfb7455 CL |
1910 | |
1911 | if (m == M_PARTIAL) { | |
1912 | ||
1913 | add_partial(n, page, tail); | |
136333d1 | 1914 | stat(s, tail); |
2cfb7455 CL |
1915 | |
1916 | } else if (m == M_FULL) { | |
894b8788 | 1917 | |
2cfb7455 CL |
1918 | stat(s, DEACTIVATE_FULL); |
1919 | add_full(s, n, page); | |
1920 | ||
1921 | } | |
1922 | } | |
1923 | ||
1924 | l = m; | |
1d07171c | 1925 | if (!__cmpxchg_double_slab(s, page, |
2cfb7455 CL |
1926 | old.freelist, old.counters, |
1927 | new.freelist, new.counters, | |
1928 | "unfreezing slab")) | |
1929 | goto redo; | |
1930 | ||
2cfb7455 CL |
1931 | if (lock) |
1932 | spin_unlock(&n->list_lock); | |
1933 | ||
1934 | if (m == M_FREE) { | |
1935 | stat(s, DEACTIVATE_EMPTY); | |
1936 | discard_slab(s, page); | |
1937 | stat(s, FREE_SLAB); | |
894b8788 | 1938 | } |
81819f0f CL |
1939 | } |
1940 | ||
d24ac77f JK |
1941 | /* |
1942 | * Unfreeze all the cpu partial slabs. | |
1943 | * | |
59a09917 CL |
1944 | * This function must be called with interrupts disabled |
1945 | * for the cpu using c (or some other guarantee must be there | |
1946 | * to guarantee no concurrent accesses). | |
d24ac77f | 1947 | */ |
59a09917 CL |
1948 | static void unfreeze_partials(struct kmem_cache *s, |
1949 | struct kmem_cache_cpu *c) | |
49e22585 | 1950 | { |
345c905d | 1951 | #ifdef CONFIG_SLUB_CPU_PARTIAL |
43d77867 | 1952 | struct kmem_cache_node *n = NULL, *n2 = NULL; |
9ada1934 | 1953 | struct page *page, *discard_page = NULL; |
49e22585 CL |
1954 | |
1955 | while ((page = c->partial)) { | |
49e22585 CL |
1956 | struct page new; |
1957 | struct page old; | |
1958 | ||
1959 | c->partial = page->next; | |
43d77867 JK |
1960 | |
1961 | n2 = get_node(s, page_to_nid(page)); | |
1962 | if (n != n2) { | |
1963 | if (n) | |
1964 | spin_unlock(&n->list_lock); | |
1965 | ||
1966 | n = n2; | |
1967 | spin_lock(&n->list_lock); | |
1968 | } | |
49e22585 CL |
1969 | |
1970 | do { | |
1971 | ||
1972 | old.freelist = page->freelist; | |
1973 | old.counters = page->counters; | |
a0132ac0 | 1974 | VM_BUG_ON(!old.frozen); |
49e22585 CL |
1975 | |
1976 | new.counters = old.counters; | |
1977 | new.freelist = old.freelist; | |
1978 | ||
1979 | new.frozen = 0; | |
1980 | ||
d24ac77f | 1981 | } while (!__cmpxchg_double_slab(s, page, |
49e22585 CL |
1982 | old.freelist, old.counters, |
1983 | new.freelist, new.counters, | |
1984 | "unfreezing slab")); | |
1985 | ||
8a5b20ae | 1986 | if (unlikely(!new.inuse && n->nr_partial >= s->min_partial)) { |
9ada1934 SL |
1987 | page->next = discard_page; |
1988 | discard_page = page; | |
43d77867 JK |
1989 | } else { |
1990 | add_partial(n, page, DEACTIVATE_TO_TAIL); | |
1991 | stat(s, FREE_ADD_PARTIAL); | |
49e22585 CL |
1992 | } |
1993 | } | |
1994 | ||
1995 | if (n) | |
1996 | spin_unlock(&n->list_lock); | |
9ada1934 SL |
1997 | |
1998 | while (discard_page) { | |
1999 | page = discard_page; | |
2000 | discard_page = discard_page->next; | |
2001 | ||
2002 | stat(s, DEACTIVATE_EMPTY); | |
2003 | discard_slab(s, page); | |
2004 | stat(s, FREE_SLAB); | |
2005 | } | |
345c905d | 2006 | #endif |
49e22585 CL |
2007 | } |
2008 | ||
2009 | /* | |
2010 | * Put a page that was just frozen (in __slab_free) into a partial page | |
2011 | * slot if available. This is done without interrupts disabled and without | |
2012 | * preemption disabled. The cmpxchg is racy and may put the partial page | |
2013 | * onto a random cpus partial slot. | |
2014 | * | |
2015 | * If we did not find a slot then simply move all the partials to the | |
2016 | * per node partial list. | |
2017 | */ | |
633b0764 | 2018 | static void put_cpu_partial(struct kmem_cache *s, struct page *page, int drain) |
49e22585 | 2019 | { |
345c905d | 2020 | #ifdef CONFIG_SLUB_CPU_PARTIAL |
49e22585 CL |
2021 | struct page *oldpage; |
2022 | int pages; | |
2023 | int pobjects; | |
2024 | ||
d6e0b7fa | 2025 | preempt_disable(); |
49e22585 CL |
2026 | do { |
2027 | pages = 0; | |
2028 | pobjects = 0; | |
2029 | oldpage = this_cpu_read(s->cpu_slab->partial); | |
2030 | ||
2031 | if (oldpage) { | |
2032 | pobjects = oldpage->pobjects; | |
2033 | pages = oldpage->pages; | |
2034 | if (drain && pobjects > s->cpu_partial) { | |
2035 | unsigned long flags; | |
2036 | /* | |
2037 | * partial array is full. Move the existing | |
2038 | * set to the per node partial list. | |
2039 | */ | |
2040 | local_irq_save(flags); | |
59a09917 | 2041 | unfreeze_partials(s, this_cpu_ptr(s->cpu_slab)); |
49e22585 | 2042 | local_irq_restore(flags); |
e24fc410 | 2043 | oldpage = NULL; |
49e22585 CL |
2044 | pobjects = 0; |
2045 | pages = 0; | |
8028dcea | 2046 | stat(s, CPU_PARTIAL_DRAIN); |
49e22585 CL |
2047 | } |
2048 | } | |
2049 | ||
2050 | pages++; | |
2051 | pobjects += page->objects - page->inuse; | |
2052 | ||
2053 | page->pages = pages; | |
2054 | page->pobjects = pobjects; | |
2055 | page->next = oldpage; | |
2056 | ||
d0e0ac97 CG |
2057 | } while (this_cpu_cmpxchg(s->cpu_slab->partial, oldpage, page) |
2058 | != oldpage); | |
d6e0b7fa VD |
2059 | if (unlikely(!s->cpu_partial)) { |
2060 | unsigned long flags; | |
2061 | ||
2062 | local_irq_save(flags); | |
2063 | unfreeze_partials(s, this_cpu_ptr(s->cpu_slab)); | |
2064 | local_irq_restore(flags); | |
2065 | } | |
2066 | preempt_enable(); | |
345c905d | 2067 | #endif |
49e22585 CL |
2068 | } |
2069 | ||
dfb4f096 | 2070 | static inline void flush_slab(struct kmem_cache *s, struct kmem_cache_cpu *c) |
81819f0f | 2071 | { |
84e554e6 | 2072 | stat(s, CPUSLAB_FLUSH); |
c17dda40 CL |
2073 | deactivate_slab(s, c->page, c->freelist); |
2074 | ||
2075 | c->tid = next_tid(c->tid); | |
2076 | c->page = NULL; | |
2077 | c->freelist = NULL; | |
81819f0f CL |
2078 | } |
2079 | ||
2080 | /* | |
2081 | * Flush cpu slab. | |
6446faa2 | 2082 | * |
81819f0f CL |
2083 | * Called from IPI handler with interrupts disabled. |
2084 | */ | |
0c710013 | 2085 | static inline void __flush_cpu_slab(struct kmem_cache *s, int cpu) |
81819f0f | 2086 | { |
9dfc6e68 | 2087 | struct kmem_cache_cpu *c = per_cpu_ptr(s->cpu_slab, cpu); |
81819f0f | 2088 | |
49e22585 CL |
2089 | if (likely(c)) { |
2090 | if (c->page) | |
2091 | flush_slab(s, c); | |
2092 | ||
59a09917 | 2093 | unfreeze_partials(s, c); |
49e22585 | 2094 | } |
81819f0f CL |
2095 | } |
2096 | ||
2097 | static void flush_cpu_slab(void *d) | |
2098 | { | |
2099 | struct kmem_cache *s = d; | |
81819f0f | 2100 | |
dfb4f096 | 2101 | __flush_cpu_slab(s, smp_processor_id()); |
81819f0f CL |
2102 | } |
2103 | ||
a8364d55 GBY |
2104 | static bool has_cpu_slab(int cpu, void *info) |
2105 | { | |
2106 | struct kmem_cache *s = info; | |
2107 | struct kmem_cache_cpu *c = per_cpu_ptr(s->cpu_slab, cpu); | |
2108 | ||
02e1a9cd | 2109 | return c->page || c->partial; |
a8364d55 GBY |
2110 | } |
2111 | ||
81819f0f CL |
2112 | static void flush_all(struct kmem_cache *s) |
2113 | { | |
a8364d55 | 2114 | on_each_cpu_cond(has_cpu_slab, flush_cpu_slab, s, 1, GFP_ATOMIC); |
81819f0f CL |
2115 | } |
2116 | ||
dfb4f096 CL |
2117 | /* |
2118 | * Check if the objects in a per cpu structure fit numa | |
2119 | * locality expectations. | |
2120 | */ | |
57d437d2 | 2121 | static inline int node_match(struct page *page, int node) |
dfb4f096 CL |
2122 | { |
2123 | #ifdef CONFIG_NUMA | |
4d7868e6 | 2124 | if (!page || (node != NUMA_NO_NODE && page_to_nid(page) != node)) |
dfb4f096 CL |
2125 | return 0; |
2126 | #endif | |
2127 | return 1; | |
2128 | } | |
2129 | ||
9a02d699 | 2130 | #ifdef CONFIG_SLUB_DEBUG |
781b2ba6 PE |
2131 | static int count_free(struct page *page) |
2132 | { | |
2133 | return page->objects - page->inuse; | |
2134 | } | |
2135 | ||
9a02d699 DR |
2136 | static inline unsigned long node_nr_objs(struct kmem_cache_node *n) |
2137 | { | |
2138 | return atomic_long_read(&n->total_objects); | |
2139 | } | |
2140 | #endif /* CONFIG_SLUB_DEBUG */ | |
2141 | ||
2142 | #if defined(CONFIG_SLUB_DEBUG) || defined(CONFIG_SYSFS) | |
781b2ba6 PE |
2143 | static unsigned long count_partial(struct kmem_cache_node *n, |
2144 | int (*get_count)(struct page *)) | |
2145 | { | |
2146 | unsigned long flags; | |
2147 | unsigned long x = 0; | |
2148 | struct page *page; | |
2149 | ||
2150 | spin_lock_irqsave(&n->list_lock, flags); | |
2151 | list_for_each_entry(page, &n->partial, lru) | |
2152 | x += get_count(page); | |
2153 | spin_unlock_irqrestore(&n->list_lock, flags); | |
2154 | return x; | |
2155 | } | |
9a02d699 | 2156 | #endif /* CONFIG_SLUB_DEBUG || CONFIG_SYSFS */ |
26c02cf0 | 2157 | |
781b2ba6 PE |
2158 | static noinline void |
2159 | slab_out_of_memory(struct kmem_cache *s, gfp_t gfpflags, int nid) | |
2160 | { | |
9a02d699 DR |
2161 | #ifdef CONFIG_SLUB_DEBUG |
2162 | static DEFINE_RATELIMIT_STATE(slub_oom_rs, DEFAULT_RATELIMIT_INTERVAL, | |
2163 | DEFAULT_RATELIMIT_BURST); | |
781b2ba6 | 2164 | int node; |
fa45dc25 | 2165 | struct kmem_cache_node *n; |
781b2ba6 | 2166 | |
9a02d699 DR |
2167 | if ((gfpflags & __GFP_NOWARN) || !__ratelimit(&slub_oom_rs)) |
2168 | return; | |
2169 | ||
f9f58285 | 2170 | pr_warn("SLUB: Unable to allocate memory on node %d (gfp=0x%x)\n", |
781b2ba6 | 2171 | nid, gfpflags); |
f9f58285 FF |
2172 | pr_warn(" cache: %s, object size: %d, buffer size: %d, default order: %d, min order: %d\n", |
2173 | s->name, s->object_size, s->size, oo_order(s->oo), | |
2174 | oo_order(s->min)); | |
781b2ba6 | 2175 | |
3b0efdfa | 2176 | if (oo_order(s->min) > get_order(s->object_size)) |
f9f58285 FF |
2177 | pr_warn(" %s debugging increased min order, use slub_debug=O to disable.\n", |
2178 | s->name); | |
fa5ec8a1 | 2179 | |
fa45dc25 | 2180 | for_each_kmem_cache_node(s, node, n) { |
781b2ba6 PE |
2181 | unsigned long nr_slabs; |
2182 | unsigned long nr_objs; | |
2183 | unsigned long nr_free; | |
2184 | ||
26c02cf0 AB |
2185 | nr_free = count_partial(n, count_free); |
2186 | nr_slabs = node_nr_slabs(n); | |
2187 | nr_objs = node_nr_objs(n); | |
781b2ba6 | 2188 | |
f9f58285 | 2189 | pr_warn(" node %d: slabs: %ld, objs: %ld, free: %ld\n", |
781b2ba6 PE |
2190 | node, nr_slabs, nr_objs, nr_free); |
2191 | } | |
9a02d699 | 2192 | #endif |
781b2ba6 PE |
2193 | } |
2194 | ||
497b66f2 CL |
2195 | static inline void *new_slab_objects(struct kmem_cache *s, gfp_t flags, |
2196 | int node, struct kmem_cache_cpu **pc) | |
2197 | { | |
6faa6833 | 2198 | void *freelist; |
188fd063 CL |
2199 | struct kmem_cache_cpu *c = *pc; |
2200 | struct page *page; | |
497b66f2 | 2201 | |
188fd063 | 2202 | freelist = get_partial(s, flags, node, c); |
497b66f2 | 2203 | |
188fd063 CL |
2204 | if (freelist) |
2205 | return freelist; | |
2206 | ||
2207 | page = new_slab(s, flags, node); | |
497b66f2 | 2208 | if (page) { |
7c8e0181 | 2209 | c = raw_cpu_ptr(s->cpu_slab); |
497b66f2 CL |
2210 | if (c->page) |
2211 | flush_slab(s, c); | |
2212 | ||
2213 | /* | |
2214 | * No other reference to the page yet so we can | |
2215 | * muck around with it freely without cmpxchg | |
2216 | */ | |
6faa6833 | 2217 | freelist = page->freelist; |
497b66f2 CL |
2218 | page->freelist = NULL; |
2219 | ||
2220 | stat(s, ALLOC_SLAB); | |
497b66f2 CL |
2221 | c->page = page; |
2222 | *pc = c; | |
2223 | } else | |
6faa6833 | 2224 | freelist = NULL; |
497b66f2 | 2225 | |
6faa6833 | 2226 | return freelist; |
497b66f2 CL |
2227 | } |
2228 | ||
072bb0aa MG |
2229 | static inline bool pfmemalloc_match(struct page *page, gfp_t gfpflags) |
2230 | { | |
2231 | if (unlikely(PageSlabPfmemalloc(page))) | |
2232 | return gfp_pfmemalloc_allowed(gfpflags); | |
2233 | ||
2234 | return true; | |
2235 | } | |
2236 | ||
213eeb9f | 2237 | /* |
d0e0ac97 CG |
2238 | * Check the page->freelist of a page and either transfer the freelist to the |
2239 | * per cpu freelist or deactivate the page. | |
213eeb9f CL |
2240 | * |
2241 | * The page is still frozen if the return value is not NULL. | |
2242 | * | |
2243 | * If this function returns NULL then the page has been unfrozen. | |
d24ac77f JK |
2244 | * |
2245 | * This function must be called with interrupt disabled. | |
213eeb9f CL |
2246 | */ |
2247 | static inline void *get_freelist(struct kmem_cache *s, struct page *page) | |
2248 | { | |
2249 | struct page new; | |
2250 | unsigned long counters; | |
2251 | void *freelist; | |
2252 | ||
2253 | do { | |
2254 | freelist = page->freelist; | |
2255 | counters = page->counters; | |
6faa6833 | 2256 | |
213eeb9f | 2257 | new.counters = counters; |
a0132ac0 | 2258 | VM_BUG_ON(!new.frozen); |
213eeb9f CL |
2259 | |
2260 | new.inuse = page->objects; | |
2261 | new.frozen = freelist != NULL; | |
2262 | ||
d24ac77f | 2263 | } while (!__cmpxchg_double_slab(s, page, |
213eeb9f CL |
2264 | freelist, counters, |
2265 | NULL, new.counters, | |
2266 | "get_freelist")); | |
2267 | ||
2268 | return freelist; | |
2269 | } | |
2270 | ||
81819f0f | 2271 | /* |
894b8788 CL |
2272 | * Slow path. The lockless freelist is empty or we need to perform |
2273 | * debugging duties. | |
2274 | * | |
894b8788 CL |
2275 | * Processing is still very fast if new objects have been freed to the |
2276 | * regular freelist. In that case we simply take over the regular freelist | |
2277 | * as the lockless freelist and zap the regular freelist. | |
81819f0f | 2278 | * |
894b8788 CL |
2279 | * If that is not working then we fall back to the partial lists. We take the |
2280 | * first element of the freelist as the object to allocate now and move the | |
2281 | * rest of the freelist to the lockless freelist. | |
81819f0f | 2282 | * |
894b8788 | 2283 | * And if we were unable to get a new slab from the partial slab lists then |
6446faa2 CL |
2284 | * we need to allocate a new slab. This is the slowest path since it involves |
2285 | * a call to the page allocator and the setup of a new slab. | |
a380a3c7 CL |
2286 | * |
2287 | * Version of __slab_alloc to use when we know that interrupts are | |
2288 | * already disabled (which is the case for bulk allocation). | |
81819f0f | 2289 | */ |
a380a3c7 | 2290 | static void *___slab_alloc(struct kmem_cache *s, gfp_t gfpflags, int node, |
ce71e27c | 2291 | unsigned long addr, struct kmem_cache_cpu *c) |
81819f0f | 2292 | { |
6faa6833 | 2293 | void *freelist; |
f6e7def7 | 2294 | struct page *page; |
81819f0f | 2295 | |
f6e7def7 CL |
2296 | page = c->page; |
2297 | if (!page) | |
81819f0f | 2298 | goto new_slab; |
49e22585 | 2299 | redo: |
6faa6833 | 2300 | |
57d437d2 | 2301 | if (unlikely(!node_match(page, node))) { |
a561ce00 JK |
2302 | int searchnode = node; |
2303 | ||
2304 | if (node != NUMA_NO_NODE && !node_present_pages(node)) | |
2305 | searchnode = node_to_mem_node(node); | |
2306 | ||
2307 | if (unlikely(!node_match(page, searchnode))) { | |
2308 | stat(s, ALLOC_NODE_MISMATCH); | |
2309 | deactivate_slab(s, page, c->freelist); | |
2310 | c->page = NULL; | |
2311 | c->freelist = NULL; | |
2312 | goto new_slab; | |
2313 | } | |
fc59c053 | 2314 | } |
6446faa2 | 2315 | |
072bb0aa MG |
2316 | /* |
2317 | * By rights, we should be searching for a slab page that was | |
2318 | * PFMEMALLOC but right now, we are losing the pfmemalloc | |
2319 | * information when the page leaves the per-cpu allocator | |
2320 | */ | |
2321 | if (unlikely(!pfmemalloc_match(page, gfpflags))) { | |
2322 | deactivate_slab(s, page, c->freelist); | |
2323 | c->page = NULL; | |
2324 | c->freelist = NULL; | |
2325 | goto new_slab; | |
2326 | } | |
2327 | ||
73736e03 | 2328 | /* must check again c->freelist in case of cpu migration or IRQ */ |
6faa6833 CL |
2329 | freelist = c->freelist; |
2330 | if (freelist) | |
73736e03 | 2331 | goto load_freelist; |
03e404af | 2332 | |
f6e7def7 | 2333 | freelist = get_freelist(s, page); |
6446faa2 | 2334 | |
6faa6833 | 2335 | if (!freelist) { |
03e404af CL |
2336 | c->page = NULL; |
2337 | stat(s, DEACTIVATE_BYPASS); | |
fc59c053 | 2338 | goto new_slab; |
03e404af | 2339 | } |
6446faa2 | 2340 | |
84e554e6 | 2341 | stat(s, ALLOC_REFILL); |
6446faa2 | 2342 | |
894b8788 | 2343 | load_freelist: |
507effea CL |
2344 | /* |
2345 | * freelist is pointing to the list of objects to be used. | |
2346 | * page is pointing to the page from which the objects are obtained. | |
2347 | * That page must be frozen for per cpu allocations to work. | |
2348 | */ | |
a0132ac0 | 2349 | VM_BUG_ON(!c->page->frozen); |
6faa6833 | 2350 | c->freelist = get_freepointer(s, freelist); |
8a5ec0ba | 2351 | c->tid = next_tid(c->tid); |
6faa6833 | 2352 | return freelist; |
81819f0f | 2353 | |
81819f0f | 2354 | new_slab: |
2cfb7455 | 2355 | |
49e22585 | 2356 | if (c->partial) { |
f6e7def7 CL |
2357 | page = c->page = c->partial; |
2358 | c->partial = page->next; | |
49e22585 CL |
2359 | stat(s, CPU_PARTIAL_ALLOC); |
2360 | c->freelist = NULL; | |
2361 | goto redo; | |
81819f0f CL |
2362 | } |
2363 | ||
188fd063 | 2364 | freelist = new_slab_objects(s, gfpflags, node, &c); |
01ad8a7b | 2365 | |
f4697436 | 2366 | if (unlikely(!freelist)) { |
9a02d699 | 2367 | slab_out_of_memory(s, gfpflags, node); |
f4697436 | 2368 | return NULL; |
81819f0f | 2369 | } |
2cfb7455 | 2370 | |
f6e7def7 | 2371 | page = c->page; |
5091b74a | 2372 | if (likely(!kmem_cache_debug(s) && pfmemalloc_match(page, gfpflags))) |
4b6f0750 | 2373 | goto load_freelist; |
2cfb7455 | 2374 | |
497b66f2 | 2375 | /* Only entered in the debug case */ |
d0e0ac97 CG |
2376 | if (kmem_cache_debug(s) && |
2377 | !alloc_debug_processing(s, page, freelist, addr)) | |
497b66f2 | 2378 | goto new_slab; /* Slab failed checks. Next slab needed */ |
894b8788 | 2379 | |
f6e7def7 | 2380 | deactivate_slab(s, page, get_freepointer(s, freelist)); |
c17dda40 CL |
2381 | c->page = NULL; |
2382 | c->freelist = NULL; | |
6faa6833 | 2383 | return freelist; |
894b8788 CL |
2384 | } |
2385 | ||
a380a3c7 CL |
2386 | /* |
2387 | * Another one that disabled interrupt and compensates for possible | |
2388 | * cpu changes by refetching the per cpu area pointer. | |
2389 | */ | |
2390 | static void *__slab_alloc(struct kmem_cache *s, gfp_t gfpflags, int node, | |
2391 | unsigned long addr, struct kmem_cache_cpu *c) | |
2392 | { | |
2393 | void *p; | |
2394 | unsigned long flags; | |
2395 | ||
2396 | local_irq_save(flags); | |
2397 | #ifdef CONFIG_PREEMPT | |
2398 | /* | |
2399 | * We may have been preempted and rescheduled on a different | |
2400 | * cpu before disabling interrupts. Need to reload cpu area | |
2401 | * pointer. | |
2402 | */ | |
2403 | c = this_cpu_ptr(s->cpu_slab); | |
2404 | #endif | |
2405 | ||
2406 | p = ___slab_alloc(s, gfpflags, node, addr, c); | |
2407 | local_irq_restore(flags); | |
2408 | return p; | |
2409 | } | |
2410 | ||
894b8788 CL |
2411 | /* |
2412 | * Inlined fastpath so that allocation functions (kmalloc, kmem_cache_alloc) | |
2413 | * have the fastpath folded into their functions. So no function call | |
2414 | * overhead for requests that can be satisfied on the fastpath. | |
2415 | * | |
2416 | * The fastpath works by first checking if the lockless freelist can be used. | |
2417 | * If not then __slab_alloc is called for slow processing. | |
2418 | * | |
2419 | * Otherwise we can simply pick the next object from the lockless free list. | |
2420 | */ | |
2b847c3c | 2421 | static __always_inline void *slab_alloc_node(struct kmem_cache *s, |
ce71e27c | 2422 | gfp_t gfpflags, int node, unsigned long addr) |
894b8788 | 2423 | { |
03ec0ed5 | 2424 | void *object; |
dfb4f096 | 2425 | struct kmem_cache_cpu *c; |
57d437d2 | 2426 | struct page *page; |
8a5ec0ba | 2427 | unsigned long tid; |
1f84260c | 2428 | |
8135be5a VD |
2429 | s = slab_pre_alloc_hook(s, gfpflags); |
2430 | if (!s) | |
773ff60e | 2431 | return NULL; |
8a5ec0ba | 2432 | redo: |
8a5ec0ba CL |
2433 | /* |
2434 | * Must read kmem_cache cpu data via this cpu ptr. Preemption is | |
2435 | * enabled. We may switch back and forth between cpus while | |
2436 | * reading from one cpu area. That does not matter as long | |
2437 | * as we end up on the original cpu again when doing the cmpxchg. | |
7cccd80b | 2438 | * |
9aabf810 JK |
2439 | * We should guarantee that tid and kmem_cache are retrieved on |
2440 | * the same cpu. It could be different if CONFIG_PREEMPT so we need | |
2441 | * to check if it is matched or not. | |
8a5ec0ba | 2442 | */ |
9aabf810 JK |
2443 | do { |
2444 | tid = this_cpu_read(s->cpu_slab->tid); | |
2445 | c = raw_cpu_ptr(s->cpu_slab); | |
859b7a0e MR |
2446 | } while (IS_ENABLED(CONFIG_PREEMPT) && |
2447 | unlikely(tid != READ_ONCE(c->tid))); | |
9aabf810 JK |
2448 | |
2449 | /* | |
2450 | * Irqless object alloc/free algorithm used here depends on sequence | |
2451 | * of fetching cpu_slab's data. tid should be fetched before anything | |
2452 | * on c to guarantee that object and page associated with previous tid | |
2453 | * won't be used with current tid. If we fetch tid first, object and | |
2454 | * page could be one associated with next tid and our alloc/free | |
2455 | * request will be failed. In this case, we will retry. So, no problem. | |
2456 | */ | |
2457 | barrier(); | |
8a5ec0ba | 2458 | |
8a5ec0ba CL |
2459 | /* |
2460 | * The transaction ids are globally unique per cpu and per operation on | |
2461 | * a per cpu queue. Thus they can be guarantee that the cmpxchg_double | |
2462 | * occurs on the right processor and that there was no operation on the | |
2463 | * linked list in between. | |
2464 | */ | |
8a5ec0ba | 2465 | |
9dfc6e68 | 2466 | object = c->freelist; |
57d437d2 | 2467 | page = c->page; |
8eae1492 | 2468 | if (unlikely(!object || !node_match(page, node))) { |
dfb4f096 | 2469 | object = __slab_alloc(s, gfpflags, node, addr, c); |
8eae1492 DH |
2470 | stat(s, ALLOC_SLOWPATH); |
2471 | } else { | |
0ad9500e ED |
2472 | void *next_object = get_freepointer_safe(s, object); |
2473 | ||
8a5ec0ba | 2474 | /* |
25985edc | 2475 | * The cmpxchg will only match if there was no additional |
8a5ec0ba CL |
2476 | * operation and if we are on the right processor. |
2477 | * | |
d0e0ac97 CG |
2478 | * The cmpxchg does the following atomically (without lock |
2479 | * semantics!) | |
8a5ec0ba CL |
2480 | * 1. Relocate first pointer to the current per cpu area. |
2481 | * 2. Verify that tid and freelist have not been changed | |
2482 | * 3. If they were not changed replace tid and freelist | |
2483 | * | |
d0e0ac97 CG |
2484 | * Since this is without lock semantics the protection is only |
2485 | * against code executing on this cpu *not* from access by | |
2486 | * other cpus. | |
8a5ec0ba | 2487 | */ |
933393f5 | 2488 | if (unlikely(!this_cpu_cmpxchg_double( |
8a5ec0ba CL |
2489 | s->cpu_slab->freelist, s->cpu_slab->tid, |
2490 | object, tid, | |
0ad9500e | 2491 | next_object, next_tid(tid)))) { |
8a5ec0ba CL |
2492 | |
2493 | note_cmpxchg_failure("slab_alloc", s, tid); | |
2494 | goto redo; | |
2495 | } | |
0ad9500e | 2496 | prefetch_freepointer(s, next_object); |
84e554e6 | 2497 | stat(s, ALLOC_FASTPATH); |
894b8788 | 2498 | } |
8a5ec0ba | 2499 | |
74e2134f | 2500 | if (unlikely(gfpflags & __GFP_ZERO) && object) |
3b0efdfa | 2501 | memset(object, 0, s->object_size); |
d07dbea4 | 2502 | |
03ec0ed5 | 2503 | slab_post_alloc_hook(s, gfpflags, 1, &object); |
5a896d9e | 2504 | |
894b8788 | 2505 | return object; |
81819f0f CL |
2506 | } |
2507 | ||
2b847c3c EG |
2508 | static __always_inline void *slab_alloc(struct kmem_cache *s, |
2509 | gfp_t gfpflags, unsigned long addr) | |
2510 | { | |
2511 | return slab_alloc_node(s, gfpflags, NUMA_NO_NODE, addr); | |
2512 | } | |
2513 | ||
81819f0f CL |
2514 | void *kmem_cache_alloc(struct kmem_cache *s, gfp_t gfpflags) |
2515 | { | |
2b847c3c | 2516 | void *ret = slab_alloc(s, gfpflags, _RET_IP_); |
5b882be4 | 2517 | |
d0e0ac97 CG |
2518 | trace_kmem_cache_alloc(_RET_IP_, ret, s->object_size, |
2519 | s->size, gfpflags); | |
5b882be4 EGM |
2520 | |
2521 | return ret; | |
81819f0f CL |
2522 | } |
2523 | EXPORT_SYMBOL(kmem_cache_alloc); | |
2524 | ||
0f24f128 | 2525 | #ifdef CONFIG_TRACING |
4a92379b RK |
2526 | void *kmem_cache_alloc_trace(struct kmem_cache *s, gfp_t gfpflags, size_t size) |
2527 | { | |
2b847c3c | 2528 | void *ret = slab_alloc(s, gfpflags, _RET_IP_); |
4a92379b | 2529 | trace_kmalloc(_RET_IP_, ret, size, s->size, gfpflags); |
0316bec2 | 2530 | kasan_kmalloc(s, ret, size); |
4a92379b RK |
2531 | return ret; |
2532 | } | |
2533 | EXPORT_SYMBOL(kmem_cache_alloc_trace); | |
5b882be4 EGM |
2534 | #endif |
2535 | ||
81819f0f CL |
2536 | #ifdef CONFIG_NUMA |
2537 | void *kmem_cache_alloc_node(struct kmem_cache *s, gfp_t gfpflags, int node) | |
2538 | { | |
2b847c3c | 2539 | void *ret = slab_alloc_node(s, gfpflags, node, _RET_IP_); |
5b882be4 | 2540 | |
ca2b84cb | 2541 | trace_kmem_cache_alloc_node(_RET_IP_, ret, |
3b0efdfa | 2542 | s->object_size, s->size, gfpflags, node); |
5b882be4 EGM |
2543 | |
2544 | return ret; | |
81819f0f CL |
2545 | } |
2546 | EXPORT_SYMBOL(kmem_cache_alloc_node); | |
81819f0f | 2547 | |
0f24f128 | 2548 | #ifdef CONFIG_TRACING |
4a92379b | 2549 | void *kmem_cache_alloc_node_trace(struct kmem_cache *s, |
5b882be4 | 2550 | gfp_t gfpflags, |
4a92379b | 2551 | int node, size_t size) |
5b882be4 | 2552 | { |
2b847c3c | 2553 | void *ret = slab_alloc_node(s, gfpflags, node, _RET_IP_); |
4a92379b RK |
2554 | |
2555 | trace_kmalloc_node(_RET_IP_, ret, | |
2556 | size, s->size, gfpflags, node); | |
0316bec2 AR |
2557 | |
2558 | kasan_kmalloc(s, ret, size); | |
4a92379b | 2559 | return ret; |
5b882be4 | 2560 | } |
4a92379b | 2561 | EXPORT_SYMBOL(kmem_cache_alloc_node_trace); |
5b882be4 | 2562 | #endif |
5d1f57e4 | 2563 | #endif |
5b882be4 | 2564 | |
81819f0f | 2565 | /* |
94e4d712 | 2566 | * Slow path handling. This may still be called frequently since objects |
894b8788 | 2567 | * have a longer lifetime than the cpu slabs in most processing loads. |
81819f0f | 2568 | * |
894b8788 CL |
2569 | * So we still attempt to reduce cache line usage. Just take the slab |
2570 | * lock and free the item. If there is no additional partial page | |
2571 | * handling required then we can return immediately. | |
81819f0f | 2572 | */ |
894b8788 | 2573 | static void __slab_free(struct kmem_cache *s, struct page *page, |
81084651 JDB |
2574 | void *head, void *tail, int cnt, |
2575 | unsigned long addr) | |
2576 | ||
81819f0f CL |
2577 | { |
2578 | void *prior; | |
2cfb7455 | 2579 | int was_frozen; |
2cfb7455 CL |
2580 | struct page new; |
2581 | unsigned long counters; | |
2582 | struct kmem_cache_node *n = NULL; | |
61728d1e | 2583 | unsigned long uninitialized_var(flags); |
81819f0f | 2584 | |
8a5ec0ba | 2585 | stat(s, FREE_SLOWPATH); |
81819f0f | 2586 | |
19c7ff9e | 2587 | if (kmem_cache_debug(s) && |
282acb43 | 2588 | !free_debug_processing(s, page, head, tail, cnt, addr)) |
80f08c19 | 2589 | return; |
6446faa2 | 2590 | |
2cfb7455 | 2591 | do { |
837d678d JK |
2592 | if (unlikely(n)) { |
2593 | spin_unlock_irqrestore(&n->list_lock, flags); | |
2594 | n = NULL; | |
2595 | } | |
2cfb7455 CL |
2596 | prior = page->freelist; |
2597 | counters = page->counters; | |
81084651 | 2598 | set_freepointer(s, tail, prior); |
2cfb7455 CL |
2599 | new.counters = counters; |
2600 | was_frozen = new.frozen; | |
81084651 | 2601 | new.inuse -= cnt; |
837d678d | 2602 | if ((!new.inuse || !prior) && !was_frozen) { |
49e22585 | 2603 | |
c65c1877 | 2604 | if (kmem_cache_has_cpu_partial(s) && !prior) { |
49e22585 CL |
2605 | |
2606 | /* | |
d0e0ac97 CG |
2607 | * Slab was on no list before and will be |
2608 | * partially empty | |
2609 | * We can defer the list move and instead | |
2610 | * freeze it. | |
49e22585 CL |
2611 | */ |
2612 | new.frozen = 1; | |
2613 | ||
c65c1877 | 2614 | } else { /* Needs to be taken off a list */ |
49e22585 | 2615 | |
b455def2 | 2616 | n = get_node(s, page_to_nid(page)); |
49e22585 CL |
2617 | /* |
2618 | * Speculatively acquire the list_lock. | |
2619 | * If the cmpxchg does not succeed then we may | |
2620 | * drop the list_lock without any processing. | |
2621 | * | |
2622 | * Otherwise the list_lock will synchronize with | |
2623 | * other processors updating the list of slabs. | |
2624 | */ | |
2625 | spin_lock_irqsave(&n->list_lock, flags); | |
2626 | ||
2627 | } | |
2cfb7455 | 2628 | } |
81819f0f | 2629 | |
2cfb7455 CL |
2630 | } while (!cmpxchg_double_slab(s, page, |
2631 | prior, counters, | |
81084651 | 2632 | head, new.counters, |
2cfb7455 | 2633 | "__slab_free")); |
81819f0f | 2634 | |
2cfb7455 | 2635 | if (likely(!n)) { |
49e22585 CL |
2636 | |
2637 | /* | |
2638 | * If we just froze the page then put it onto the | |
2639 | * per cpu partial list. | |
2640 | */ | |
8028dcea | 2641 | if (new.frozen && !was_frozen) { |
49e22585 | 2642 | put_cpu_partial(s, page, 1); |
8028dcea AS |
2643 | stat(s, CPU_PARTIAL_FREE); |
2644 | } | |
49e22585 | 2645 | /* |
2cfb7455 CL |
2646 | * The list lock was not taken therefore no list |
2647 | * activity can be necessary. | |
2648 | */ | |
b455def2 L |
2649 | if (was_frozen) |
2650 | stat(s, FREE_FROZEN); | |
2651 | return; | |
2652 | } | |
81819f0f | 2653 | |
8a5b20ae | 2654 | if (unlikely(!new.inuse && n->nr_partial >= s->min_partial)) |
837d678d JK |
2655 | goto slab_empty; |
2656 | ||
81819f0f | 2657 | /* |
837d678d JK |
2658 | * Objects left in the slab. If it was not on the partial list before |
2659 | * then add it. | |
81819f0f | 2660 | */ |
345c905d JK |
2661 | if (!kmem_cache_has_cpu_partial(s) && unlikely(!prior)) { |
2662 | if (kmem_cache_debug(s)) | |
c65c1877 | 2663 | remove_full(s, n, page); |
837d678d JK |
2664 | add_partial(n, page, DEACTIVATE_TO_TAIL); |
2665 | stat(s, FREE_ADD_PARTIAL); | |
8ff12cfc | 2666 | } |
80f08c19 | 2667 | spin_unlock_irqrestore(&n->list_lock, flags); |
81819f0f CL |
2668 | return; |
2669 | ||
2670 | slab_empty: | |
a973e9dd | 2671 | if (prior) { |
81819f0f | 2672 | /* |
6fbabb20 | 2673 | * Slab on the partial list. |
81819f0f | 2674 | */ |
5cc6eee8 | 2675 | remove_partial(n, page); |
84e554e6 | 2676 | stat(s, FREE_REMOVE_PARTIAL); |
c65c1877 | 2677 | } else { |
6fbabb20 | 2678 | /* Slab must be on the full list */ |
c65c1877 PZ |
2679 | remove_full(s, n, page); |
2680 | } | |
2cfb7455 | 2681 | |
80f08c19 | 2682 | spin_unlock_irqrestore(&n->list_lock, flags); |
84e554e6 | 2683 | stat(s, FREE_SLAB); |
81819f0f | 2684 | discard_slab(s, page); |
81819f0f CL |
2685 | } |
2686 | ||
894b8788 CL |
2687 | /* |
2688 | * Fastpath with forced inlining to produce a kfree and kmem_cache_free that | |
2689 | * can perform fastpath freeing without additional function calls. | |
2690 | * | |
2691 | * The fastpath is only possible if we are freeing to the current cpu slab | |
2692 | * of this processor. This typically the case if we have just allocated | |
2693 | * the item before. | |
2694 | * | |
2695 | * If fastpath is not possible then fall back to __slab_free where we deal | |
2696 | * with all sorts of special processing. | |
81084651 JDB |
2697 | * |
2698 | * Bulk free of a freelist with several objects (all pointing to the | |
2699 | * same page) possible by specifying head and tail ptr, plus objects | |
2700 | * count (cnt). Bulk free indicated by tail pointer being set. | |
894b8788 | 2701 | */ |
81084651 JDB |
2702 | static __always_inline void slab_free(struct kmem_cache *s, struct page *page, |
2703 | void *head, void *tail, int cnt, | |
2704 | unsigned long addr) | |
894b8788 | 2705 | { |
81084651 | 2706 | void *tail_obj = tail ? : head; |
dfb4f096 | 2707 | struct kmem_cache_cpu *c; |
8a5ec0ba | 2708 | unsigned long tid; |
1f84260c | 2709 | |
81084651 | 2710 | slab_free_freelist_hook(s, head, tail); |
c016b0bd | 2711 | |
8a5ec0ba CL |
2712 | redo: |
2713 | /* | |
2714 | * Determine the currently cpus per cpu slab. | |
2715 | * The cpu may change afterward. However that does not matter since | |
2716 | * data is retrieved via this pointer. If we are on the same cpu | |
2ae44005 | 2717 | * during the cmpxchg then the free will succeed. |
8a5ec0ba | 2718 | */ |
9aabf810 JK |
2719 | do { |
2720 | tid = this_cpu_read(s->cpu_slab->tid); | |
2721 | c = raw_cpu_ptr(s->cpu_slab); | |
859b7a0e MR |
2722 | } while (IS_ENABLED(CONFIG_PREEMPT) && |
2723 | unlikely(tid != READ_ONCE(c->tid))); | |
c016b0bd | 2724 | |
9aabf810 JK |
2725 | /* Same with comment on barrier() in slab_alloc_node() */ |
2726 | barrier(); | |
c016b0bd | 2727 | |
442b06bc | 2728 | if (likely(page == c->page)) { |
81084651 | 2729 | set_freepointer(s, tail_obj, c->freelist); |
8a5ec0ba | 2730 | |
933393f5 | 2731 | if (unlikely(!this_cpu_cmpxchg_double( |
8a5ec0ba CL |
2732 | s->cpu_slab->freelist, s->cpu_slab->tid, |
2733 | c->freelist, tid, | |
81084651 | 2734 | head, next_tid(tid)))) { |
8a5ec0ba CL |
2735 | |
2736 | note_cmpxchg_failure("slab_free", s, tid); | |
2737 | goto redo; | |
2738 | } | |
84e554e6 | 2739 | stat(s, FREE_FASTPATH); |
894b8788 | 2740 | } else |
81084651 | 2741 | __slab_free(s, page, head, tail_obj, cnt, addr); |
894b8788 | 2742 | |
894b8788 CL |
2743 | } |
2744 | ||
81819f0f CL |
2745 | void kmem_cache_free(struct kmem_cache *s, void *x) |
2746 | { | |
b9ce5ef4 GC |
2747 | s = cache_from_obj(s, x); |
2748 | if (!s) | |
79576102 | 2749 | return; |
81084651 | 2750 | slab_free(s, virt_to_head_page(x), x, NULL, 1, _RET_IP_); |
ca2b84cb | 2751 | trace_kmem_cache_free(_RET_IP_, x); |
81819f0f CL |
2752 | } |
2753 | EXPORT_SYMBOL(kmem_cache_free); | |
2754 | ||
d0ecd894 | 2755 | struct detached_freelist { |
fbd02630 | 2756 | struct page *page; |
d0ecd894 JDB |
2757 | void *tail; |
2758 | void *freelist; | |
2759 | int cnt; | |
376bf125 | 2760 | struct kmem_cache *s; |
d0ecd894 | 2761 | }; |
fbd02630 | 2762 | |
d0ecd894 JDB |
2763 | /* |
2764 | * This function progressively scans the array with free objects (with | |
2765 | * a limited look ahead) and extract objects belonging to the same | |
2766 | * page. It builds a detached freelist directly within the given | |
2767 | * page/objects. This can happen without any need for | |
2768 | * synchronization, because the objects are owned by running process. | |
2769 | * The freelist is build up as a single linked list in the objects. | |
2770 | * The idea is, that this detached freelist can then be bulk | |
2771 | * transferred to the real freelist(s), but only requiring a single | |
2772 | * synchronization primitive. Look ahead in the array is limited due | |
2773 | * to performance reasons. | |
2774 | */ | |
376bf125 JDB |
2775 | static inline |
2776 | int build_detached_freelist(struct kmem_cache *s, size_t size, | |
2777 | void **p, struct detached_freelist *df) | |
d0ecd894 JDB |
2778 | { |
2779 | size_t first_skipped_index = 0; | |
2780 | int lookahead = 3; | |
2781 | void *object; | |
ca257195 | 2782 | struct page *page; |
fbd02630 | 2783 | |
d0ecd894 JDB |
2784 | /* Always re-init detached_freelist */ |
2785 | df->page = NULL; | |
fbd02630 | 2786 | |
d0ecd894 JDB |
2787 | do { |
2788 | object = p[--size]; | |
ca257195 | 2789 | /* Do we need !ZERO_OR_NULL_PTR(object) here? (for kfree) */ |
d0ecd894 | 2790 | } while (!object && size); |
3eed034d | 2791 | |
d0ecd894 JDB |
2792 | if (!object) |
2793 | return 0; | |
fbd02630 | 2794 | |
ca257195 JDB |
2795 | page = virt_to_head_page(object); |
2796 | if (!s) { | |
2797 | /* Handle kalloc'ed objects */ | |
2798 | if (unlikely(!PageSlab(page))) { | |
2799 | BUG_ON(!PageCompound(page)); | |
2800 | kfree_hook(object); | |
2801 | __free_kmem_pages(page, compound_order(page)); | |
2802 | p[size] = NULL; /* mark object processed */ | |
2803 | return size; | |
2804 | } | |
2805 | /* Derive kmem_cache from object */ | |
2806 | df->s = page->slab_cache; | |
2807 | } else { | |
2808 | df->s = cache_from_obj(s, object); /* Support for memcg */ | |
2809 | } | |
376bf125 | 2810 | |
d0ecd894 | 2811 | /* Start new detached freelist */ |
ca257195 | 2812 | df->page = page; |
376bf125 | 2813 | set_freepointer(df->s, object, NULL); |
d0ecd894 JDB |
2814 | df->tail = object; |
2815 | df->freelist = object; | |
2816 | p[size] = NULL; /* mark object processed */ | |
2817 | df->cnt = 1; | |
2818 | ||
2819 | while (size) { | |
2820 | object = p[--size]; | |
2821 | if (!object) | |
2822 | continue; /* Skip processed objects */ | |
2823 | ||
2824 | /* df->page is always set at this point */ | |
2825 | if (df->page == virt_to_head_page(object)) { | |
2826 | /* Opportunity build freelist */ | |
376bf125 | 2827 | set_freepointer(df->s, object, df->freelist); |
d0ecd894 JDB |
2828 | df->freelist = object; |
2829 | df->cnt++; | |
2830 | p[size] = NULL; /* mark object processed */ | |
2831 | ||
2832 | continue; | |
fbd02630 | 2833 | } |
d0ecd894 JDB |
2834 | |
2835 | /* Limit look ahead search */ | |
2836 | if (!--lookahead) | |
2837 | break; | |
2838 | ||
2839 | if (!first_skipped_index) | |
2840 | first_skipped_index = size + 1; | |
fbd02630 | 2841 | } |
d0ecd894 JDB |
2842 | |
2843 | return first_skipped_index; | |
2844 | } | |
2845 | ||
d0ecd894 | 2846 | /* Note that interrupts must be enabled when calling this function. */ |
376bf125 | 2847 | void kmem_cache_free_bulk(struct kmem_cache *s, size_t size, void **p) |
d0ecd894 JDB |
2848 | { |
2849 | if (WARN_ON(!size)) | |
2850 | return; | |
2851 | ||
2852 | do { | |
2853 | struct detached_freelist df; | |
2854 | ||
2855 | size = build_detached_freelist(s, size, p, &df); | |
2856 | if (unlikely(!df.page)) | |
2857 | continue; | |
2858 | ||
376bf125 | 2859 | slab_free(df.s, df.page, df.freelist, df.tail, df.cnt,_RET_IP_); |
d0ecd894 | 2860 | } while (likely(size)); |
484748f0 CL |
2861 | } |
2862 | EXPORT_SYMBOL(kmem_cache_free_bulk); | |
2863 | ||
994eb764 | 2864 | /* Note that interrupts must be enabled when calling this function. */ |
865762a8 JDB |
2865 | int kmem_cache_alloc_bulk(struct kmem_cache *s, gfp_t flags, size_t size, |
2866 | void **p) | |
484748f0 | 2867 | { |
994eb764 JDB |
2868 | struct kmem_cache_cpu *c; |
2869 | int i; | |
2870 | ||
03ec0ed5 JDB |
2871 | /* memcg and kmem_cache debug support */ |
2872 | s = slab_pre_alloc_hook(s, flags); | |
2873 | if (unlikely(!s)) | |
2874 | return false; | |
994eb764 JDB |
2875 | /* |
2876 | * Drain objects in the per cpu slab, while disabling local | |
2877 | * IRQs, which protects against PREEMPT and interrupts | |
2878 | * handlers invoking normal fastpath. | |
2879 | */ | |
2880 | local_irq_disable(); | |
2881 | c = this_cpu_ptr(s->cpu_slab); | |
2882 | ||
2883 | for (i = 0; i < size; i++) { | |
2884 | void *object = c->freelist; | |
2885 | ||
ebe909e0 | 2886 | if (unlikely(!object)) { |
ebe909e0 JDB |
2887 | /* |
2888 | * Invoking slow path likely have side-effect | |
2889 | * of re-populating per CPU c->freelist | |
2890 | */ | |
87098373 | 2891 | p[i] = ___slab_alloc(s, flags, NUMA_NO_NODE, |
ebe909e0 | 2892 | _RET_IP_, c); |
87098373 CL |
2893 | if (unlikely(!p[i])) |
2894 | goto error; | |
2895 | ||
ebe909e0 JDB |
2896 | c = this_cpu_ptr(s->cpu_slab); |
2897 | continue; /* goto for-loop */ | |
2898 | } | |
994eb764 JDB |
2899 | c->freelist = get_freepointer(s, object); |
2900 | p[i] = object; | |
2901 | } | |
2902 | c->tid = next_tid(c->tid); | |
2903 | local_irq_enable(); | |
2904 | ||
2905 | /* Clear memory outside IRQ disabled fastpath loop */ | |
2906 | if (unlikely(flags & __GFP_ZERO)) { | |
2907 | int j; | |
2908 | ||
2909 | for (j = 0; j < i; j++) | |
2910 | memset(p[j], 0, s->object_size); | |
2911 | } | |
2912 | ||
03ec0ed5 JDB |
2913 | /* memcg and kmem_cache debug support */ |
2914 | slab_post_alloc_hook(s, flags, size, p); | |
865762a8 | 2915 | return i; |
87098373 | 2916 | error: |
87098373 | 2917 | local_irq_enable(); |
03ec0ed5 JDB |
2918 | slab_post_alloc_hook(s, flags, i, p); |
2919 | __kmem_cache_free_bulk(s, i, p); | |
865762a8 | 2920 | return 0; |
484748f0 CL |
2921 | } |
2922 | EXPORT_SYMBOL(kmem_cache_alloc_bulk); | |
2923 | ||
2924 | ||
81819f0f | 2925 | /* |
672bba3a CL |
2926 | * Object placement in a slab is made very easy because we always start at |
2927 | * offset 0. If we tune the size of the object to the alignment then we can | |
2928 | * get the required alignment by putting one properly sized object after | |
2929 | * another. | |
81819f0f CL |
2930 | * |
2931 | * Notice that the allocation order determines the sizes of the per cpu | |
2932 | * caches. Each processor has always one slab available for allocations. | |
2933 | * Increasing the allocation order reduces the number of times that slabs | |
672bba3a | 2934 | * must be moved on and off the partial lists and is therefore a factor in |
81819f0f | 2935 | * locking overhead. |
81819f0f CL |
2936 | */ |
2937 | ||
2938 | /* | |
2939 | * Mininum / Maximum order of slab pages. This influences locking overhead | |
2940 | * and slab fragmentation. A higher order reduces the number of partial slabs | |
2941 | * and increases the number of allocations possible without having to | |
2942 | * take the list_lock. | |
2943 | */ | |
2944 | static int slub_min_order; | |
114e9e89 | 2945 | static int slub_max_order = PAGE_ALLOC_COSTLY_ORDER; |
9b2cd506 | 2946 | static int slub_min_objects; |
81819f0f | 2947 | |
81819f0f CL |
2948 | /* |
2949 | * Calculate the order of allocation given an slab object size. | |
2950 | * | |
672bba3a CL |
2951 | * The order of allocation has significant impact on performance and other |
2952 | * system components. Generally order 0 allocations should be preferred since | |
2953 | * order 0 does not cause fragmentation in the page allocator. Larger objects | |
2954 | * be problematic to put into order 0 slabs because there may be too much | |
c124f5b5 | 2955 | * unused space left. We go to a higher order if more than 1/16th of the slab |
672bba3a CL |
2956 | * would be wasted. |
2957 | * | |
2958 | * In order to reach satisfactory performance we must ensure that a minimum | |
2959 | * number of objects is in one slab. Otherwise we may generate too much | |
2960 | * activity on the partial lists which requires taking the list_lock. This is | |
2961 | * less a concern for large slabs though which are rarely used. | |
81819f0f | 2962 | * |
672bba3a CL |
2963 | * slub_max_order specifies the order where we begin to stop considering the |
2964 | * number of objects in a slab as critical. If we reach slub_max_order then | |
2965 | * we try to keep the page order as low as possible. So we accept more waste | |
2966 | * of space in favor of a small page order. | |
81819f0f | 2967 | * |
672bba3a CL |
2968 | * Higher order allocations also allow the placement of more objects in a |
2969 | * slab and thereby reduce object handling overhead. If the user has | |
2970 | * requested a higher mininum order then we start with that one instead of | |
2971 | * the smallest order which will fit the object. | |
81819f0f | 2972 | */ |
5e6d444e | 2973 | static inline int slab_order(int size, int min_objects, |
ab9a0f19 | 2974 | int max_order, int fract_leftover, int reserved) |
81819f0f CL |
2975 | { |
2976 | int order; | |
2977 | int rem; | |
6300ea75 | 2978 | int min_order = slub_min_order; |
81819f0f | 2979 | |
ab9a0f19 | 2980 | if (order_objects(min_order, size, reserved) > MAX_OBJS_PER_PAGE) |
210b5c06 | 2981 | return get_order(size * MAX_OBJS_PER_PAGE) - 1; |
39b26464 | 2982 | |
9f835703 | 2983 | for (order = max(min_order, get_order(min_objects * size + reserved)); |
5e6d444e | 2984 | order <= max_order; order++) { |
81819f0f | 2985 | |
5e6d444e | 2986 | unsigned long slab_size = PAGE_SIZE << order; |
81819f0f | 2987 | |
ab9a0f19 | 2988 | rem = (slab_size - reserved) % size; |
81819f0f | 2989 | |
5e6d444e | 2990 | if (rem <= slab_size / fract_leftover) |
81819f0f | 2991 | break; |
81819f0f | 2992 | } |
672bba3a | 2993 | |
81819f0f CL |
2994 | return order; |
2995 | } | |
2996 | ||
ab9a0f19 | 2997 | static inline int calculate_order(int size, int reserved) |
5e6d444e CL |
2998 | { |
2999 | int order; | |
3000 | int min_objects; | |
3001 | int fraction; | |
e8120ff1 | 3002 | int max_objects; |
5e6d444e CL |
3003 | |
3004 | /* | |
3005 | * Attempt to find best configuration for a slab. This | |
3006 | * works by first attempting to generate a layout with | |
3007 | * the best configuration and backing off gradually. | |
3008 | * | |
422ff4d7 | 3009 | * First we increase the acceptable waste in a slab. Then |
5e6d444e CL |
3010 | * we reduce the minimum objects required in a slab. |
3011 | */ | |
3012 | min_objects = slub_min_objects; | |
9b2cd506 CL |
3013 | if (!min_objects) |
3014 | min_objects = 4 * (fls(nr_cpu_ids) + 1); | |
ab9a0f19 | 3015 | max_objects = order_objects(slub_max_order, size, reserved); |
e8120ff1 ZY |
3016 | min_objects = min(min_objects, max_objects); |
3017 | ||
5e6d444e | 3018 | while (min_objects > 1) { |
c124f5b5 | 3019 | fraction = 16; |
5e6d444e CL |
3020 | while (fraction >= 4) { |
3021 | order = slab_order(size, min_objects, | |
ab9a0f19 | 3022 | slub_max_order, fraction, reserved); |
5e6d444e CL |
3023 | if (order <= slub_max_order) |
3024 | return order; | |
3025 | fraction /= 2; | |
3026 | } | |
5086c389 | 3027 | min_objects--; |
5e6d444e CL |
3028 | } |
3029 | ||
3030 | /* | |
3031 | * We were unable to place multiple objects in a slab. Now | |
3032 | * lets see if we can place a single object there. | |
3033 | */ | |
ab9a0f19 | 3034 | order = slab_order(size, 1, slub_max_order, 1, reserved); |
5e6d444e CL |
3035 | if (order <= slub_max_order) |
3036 | return order; | |
3037 | ||
3038 | /* | |
3039 | * Doh this slab cannot be placed using slub_max_order. | |
3040 | */ | |
ab9a0f19 | 3041 | order = slab_order(size, 1, MAX_ORDER, 1, reserved); |
818cf590 | 3042 | if (order < MAX_ORDER) |
5e6d444e CL |
3043 | return order; |
3044 | return -ENOSYS; | |
3045 | } | |
3046 | ||
5595cffc | 3047 | static void |
4053497d | 3048 | init_kmem_cache_node(struct kmem_cache_node *n) |
81819f0f CL |
3049 | { |
3050 | n->nr_partial = 0; | |
81819f0f CL |
3051 | spin_lock_init(&n->list_lock); |
3052 | INIT_LIST_HEAD(&n->partial); | |
8ab1372f | 3053 | #ifdef CONFIG_SLUB_DEBUG |
0f389ec6 | 3054 | atomic_long_set(&n->nr_slabs, 0); |
02b71b70 | 3055 | atomic_long_set(&n->total_objects, 0); |
643b1138 | 3056 | INIT_LIST_HEAD(&n->full); |
8ab1372f | 3057 | #endif |
81819f0f CL |
3058 | } |
3059 | ||
55136592 | 3060 | static inline int alloc_kmem_cache_cpus(struct kmem_cache *s) |
4c93c355 | 3061 | { |
6c182dc0 | 3062 | BUILD_BUG_ON(PERCPU_DYNAMIC_EARLY_SIZE < |
95a05b42 | 3063 | KMALLOC_SHIFT_HIGH * sizeof(struct kmem_cache_cpu)); |
4c93c355 | 3064 | |
8a5ec0ba | 3065 | /* |
d4d84fef CM |
3066 | * Must align to double word boundary for the double cmpxchg |
3067 | * instructions to work; see __pcpu_double_call_return_bool(). | |
8a5ec0ba | 3068 | */ |
d4d84fef CM |
3069 | s->cpu_slab = __alloc_percpu(sizeof(struct kmem_cache_cpu), |
3070 | 2 * sizeof(void *)); | |
8a5ec0ba CL |
3071 | |
3072 | if (!s->cpu_slab) | |
3073 | return 0; | |
3074 | ||
3075 | init_kmem_cache_cpus(s); | |
4c93c355 | 3076 | |
8a5ec0ba | 3077 | return 1; |
4c93c355 | 3078 | } |
4c93c355 | 3079 | |
51df1142 CL |
3080 | static struct kmem_cache *kmem_cache_node; |
3081 | ||
81819f0f CL |
3082 | /* |
3083 | * No kmalloc_node yet so do it by hand. We know that this is the first | |
3084 | * slab on the node for this slabcache. There are no concurrent accesses | |
3085 | * possible. | |
3086 | * | |
721ae22a ZYW |
3087 | * Note that this function only works on the kmem_cache_node |
3088 | * when allocating for the kmem_cache_node. This is used for bootstrapping | |
4c93c355 | 3089 | * memory on a fresh node that has no slab structures yet. |
81819f0f | 3090 | */ |
55136592 | 3091 | static void early_kmem_cache_node_alloc(int node) |
81819f0f CL |
3092 | { |
3093 | struct page *page; | |
3094 | struct kmem_cache_node *n; | |
3095 | ||
51df1142 | 3096 | BUG_ON(kmem_cache_node->size < sizeof(struct kmem_cache_node)); |
81819f0f | 3097 | |
51df1142 | 3098 | page = new_slab(kmem_cache_node, GFP_NOWAIT, node); |
81819f0f CL |
3099 | |
3100 | BUG_ON(!page); | |
a2f92ee7 | 3101 | if (page_to_nid(page) != node) { |
f9f58285 FF |
3102 | pr_err("SLUB: Unable to allocate memory from node %d\n", node); |
3103 | pr_err("SLUB: Allocating a useless per node structure in order to be able to continue\n"); | |
a2f92ee7 CL |
3104 | } |
3105 | ||
81819f0f CL |
3106 | n = page->freelist; |
3107 | BUG_ON(!n); | |
51df1142 | 3108 | page->freelist = get_freepointer(kmem_cache_node, n); |
e6e82ea1 | 3109 | page->inuse = 1; |
8cb0a506 | 3110 | page->frozen = 0; |
51df1142 | 3111 | kmem_cache_node->node[node] = n; |
8ab1372f | 3112 | #ifdef CONFIG_SLUB_DEBUG |
f7cb1933 | 3113 | init_object(kmem_cache_node, n, SLUB_RED_ACTIVE); |
51df1142 | 3114 | init_tracking(kmem_cache_node, n); |
8ab1372f | 3115 | #endif |
0316bec2 | 3116 | kasan_kmalloc(kmem_cache_node, n, sizeof(struct kmem_cache_node)); |
4053497d | 3117 | init_kmem_cache_node(n); |
51df1142 | 3118 | inc_slabs_node(kmem_cache_node, node, page->objects); |
6446faa2 | 3119 | |
67b6c900 | 3120 | /* |
1e4dd946 SR |
3121 | * No locks need to be taken here as it has just been |
3122 | * initialized and there is no concurrent access. | |
67b6c900 | 3123 | */ |
1e4dd946 | 3124 | __add_partial(n, page, DEACTIVATE_TO_HEAD); |
81819f0f CL |
3125 | } |
3126 | ||
3127 | static void free_kmem_cache_nodes(struct kmem_cache *s) | |
3128 | { | |
3129 | int node; | |
fa45dc25 | 3130 | struct kmem_cache_node *n; |
81819f0f | 3131 | |
fa45dc25 CL |
3132 | for_each_kmem_cache_node(s, node, n) { |
3133 | kmem_cache_free(kmem_cache_node, n); | |
81819f0f CL |
3134 | s->node[node] = NULL; |
3135 | } | |
3136 | } | |
3137 | ||
52b4b950 DS |
3138 | void __kmem_cache_release(struct kmem_cache *s) |
3139 | { | |
3140 | free_percpu(s->cpu_slab); | |
3141 | free_kmem_cache_nodes(s); | |
3142 | } | |
3143 | ||
55136592 | 3144 | static int init_kmem_cache_nodes(struct kmem_cache *s) |
81819f0f CL |
3145 | { |
3146 | int node; | |
81819f0f | 3147 | |
f64dc58c | 3148 | for_each_node_state(node, N_NORMAL_MEMORY) { |
81819f0f CL |
3149 | struct kmem_cache_node *n; |
3150 | ||
73367bd8 | 3151 | if (slab_state == DOWN) { |
55136592 | 3152 | early_kmem_cache_node_alloc(node); |
73367bd8 AD |
3153 | continue; |
3154 | } | |
51df1142 | 3155 | n = kmem_cache_alloc_node(kmem_cache_node, |
55136592 | 3156 | GFP_KERNEL, node); |
81819f0f | 3157 | |
73367bd8 AD |
3158 | if (!n) { |
3159 | free_kmem_cache_nodes(s); | |
3160 | return 0; | |
81819f0f | 3161 | } |
73367bd8 | 3162 | |
81819f0f | 3163 | s->node[node] = n; |
4053497d | 3164 | init_kmem_cache_node(n); |
81819f0f CL |
3165 | } |
3166 | return 1; | |
3167 | } | |
81819f0f | 3168 | |
c0bdb232 | 3169 | static void set_min_partial(struct kmem_cache *s, unsigned long min) |
3b89d7d8 DR |
3170 | { |
3171 | if (min < MIN_PARTIAL) | |
3172 | min = MIN_PARTIAL; | |
3173 | else if (min > MAX_PARTIAL) | |
3174 | min = MAX_PARTIAL; | |
3175 | s->min_partial = min; | |
3176 | } | |
3177 | ||
81819f0f CL |
3178 | /* |
3179 | * calculate_sizes() determines the order and the distribution of data within | |
3180 | * a slab object. | |
3181 | */ | |
06b285dc | 3182 | static int calculate_sizes(struct kmem_cache *s, int forced_order) |
81819f0f CL |
3183 | { |
3184 | unsigned long flags = s->flags; | |
3b0efdfa | 3185 | unsigned long size = s->object_size; |
834f3d11 | 3186 | int order; |
81819f0f | 3187 | |
d8b42bf5 CL |
3188 | /* |
3189 | * Round up object size to the next word boundary. We can only | |
3190 | * place the free pointer at word boundaries and this determines | |
3191 | * the possible location of the free pointer. | |
3192 | */ | |
3193 | size = ALIGN(size, sizeof(void *)); | |
3194 | ||
3195 | #ifdef CONFIG_SLUB_DEBUG | |
81819f0f CL |
3196 | /* |
3197 | * Determine if we can poison the object itself. If the user of | |
3198 | * the slab may touch the object after free or before allocation | |
3199 | * then we should never poison the object itself. | |
3200 | */ | |
3201 | if ((flags & SLAB_POISON) && !(flags & SLAB_DESTROY_BY_RCU) && | |
c59def9f | 3202 | !s->ctor) |
81819f0f CL |
3203 | s->flags |= __OBJECT_POISON; |
3204 | else | |
3205 | s->flags &= ~__OBJECT_POISON; | |
3206 | ||
81819f0f CL |
3207 | |
3208 | /* | |
672bba3a | 3209 | * If we are Redzoning then check if there is some space between the |
81819f0f | 3210 | * end of the object and the free pointer. If not then add an |
672bba3a | 3211 | * additional word to have some bytes to store Redzone information. |
81819f0f | 3212 | */ |
3b0efdfa | 3213 | if ((flags & SLAB_RED_ZONE) && size == s->object_size) |
81819f0f | 3214 | size += sizeof(void *); |
41ecc55b | 3215 | #endif |
81819f0f CL |
3216 | |
3217 | /* | |
672bba3a CL |
3218 | * With that we have determined the number of bytes in actual use |
3219 | * by the object. This is the potential offset to the free pointer. | |
81819f0f CL |
3220 | */ |
3221 | s->inuse = size; | |
3222 | ||
3223 | if (((flags & (SLAB_DESTROY_BY_RCU | SLAB_POISON)) || | |
c59def9f | 3224 | s->ctor)) { |
81819f0f CL |
3225 | /* |
3226 | * Relocate free pointer after the object if it is not | |
3227 | * permitted to overwrite the first word of the object on | |
3228 | * kmem_cache_free. | |
3229 | * | |
3230 | * This is the case if we do RCU, have a constructor or | |
3231 | * destructor or are poisoning the objects. | |
3232 | */ | |
3233 | s->offset = size; | |
3234 | size += sizeof(void *); | |
3235 | } | |
3236 | ||
c12b3c62 | 3237 | #ifdef CONFIG_SLUB_DEBUG |
81819f0f CL |
3238 | if (flags & SLAB_STORE_USER) |
3239 | /* | |
3240 | * Need to store information about allocs and frees after | |
3241 | * the object. | |
3242 | */ | |
3243 | size += 2 * sizeof(struct track); | |
3244 | ||
be7b3fbc | 3245 | if (flags & SLAB_RED_ZONE) |
81819f0f CL |
3246 | /* |
3247 | * Add some empty padding so that we can catch | |
3248 | * overwrites from earlier objects rather than let | |
3249 | * tracking information or the free pointer be | |
0211a9c8 | 3250 | * corrupted if a user writes before the start |
81819f0f CL |
3251 | * of the object. |
3252 | */ | |
3253 | size += sizeof(void *); | |
41ecc55b | 3254 | #endif |
672bba3a | 3255 | |
81819f0f CL |
3256 | /* |
3257 | * SLUB stores one object immediately after another beginning from | |
3258 | * offset 0. In order to align the objects we have to simply size | |
3259 | * each object to conform to the alignment. | |
3260 | */ | |
45906855 | 3261 | size = ALIGN(size, s->align); |
81819f0f | 3262 | s->size = size; |
06b285dc CL |
3263 | if (forced_order >= 0) |
3264 | order = forced_order; | |
3265 | else | |
ab9a0f19 | 3266 | order = calculate_order(size, s->reserved); |
81819f0f | 3267 | |
834f3d11 | 3268 | if (order < 0) |
81819f0f CL |
3269 | return 0; |
3270 | ||
b7a49f0d | 3271 | s->allocflags = 0; |
834f3d11 | 3272 | if (order) |
b7a49f0d CL |
3273 | s->allocflags |= __GFP_COMP; |
3274 | ||
3275 | if (s->flags & SLAB_CACHE_DMA) | |
2c59dd65 | 3276 | s->allocflags |= GFP_DMA; |
b7a49f0d CL |
3277 | |
3278 | if (s->flags & SLAB_RECLAIM_ACCOUNT) | |
3279 | s->allocflags |= __GFP_RECLAIMABLE; | |
3280 | ||
81819f0f CL |
3281 | /* |
3282 | * Determine the number of objects per slab | |
3283 | */ | |
ab9a0f19 LJ |
3284 | s->oo = oo_make(order, size, s->reserved); |
3285 | s->min = oo_make(get_order(size), size, s->reserved); | |
205ab99d CL |
3286 | if (oo_objects(s->oo) > oo_objects(s->max)) |
3287 | s->max = s->oo; | |
81819f0f | 3288 | |
834f3d11 | 3289 | return !!oo_objects(s->oo); |
81819f0f CL |
3290 | } |
3291 | ||
8a13a4cc | 3292 | static int kmem_cache_open(struct kmem_cache *s, unsigned long flags) |
81819f0f | 3293 | { |
8a13a4cc | 3294 | s->flags = kmem_cache_flags(s->size, flags, s->name, s->ctor); |
ab9a0f19 | 3295 | s->reserved = 0; |
81819f0f | 3296 | |
da9a638c LJ |
3297 | if (need_reserve_slab_rcu && (s->flags & SLAB_DESTROY_BY_RCU)) |
3298 | s->reserved = sizeof(struct rcu_head); | |
81819f0f | 3299 | |
06b285dc | 3300 | if (!calculate_sizes(s, -1)) |
81819f0f | 3301 | goto error; |
3de47213 DR |
3302 | if (disable_higher_order_debug) { |
3303 | /* | |
3304 | * Disable debugging flags that store metadata if the min slab | |
3305 | * order increased. | |
3306 | */ | |
3b0efdfa | 3307 | if (get_order(s->size) > get_order(s->object_size)) { |
3de47213 DR |
3308 | s->flags &= ~DEBUG_METADATA_FLAGS; |
3309 | s->offset = 0; | |
3310 | if (!calculate_sizes(s, -1)) | |
3311 | goto error; | |
3312 | } | |
3313 | } | |
81819f0f | 3314 | |
2565409f HC |
3315 | #if defined(CONFIG_HAVE_CMPXCHG_DOUBLE) && \ |
3316 | defined(CONFIG_HAVE_ALIGNED_STRUCT_PAGE) | |
b789ef51 CL |
3317 | if (system_has_cmpxchg_double() && (s->flags & SLAB_DEBUG_FLAGS) == 0) |
3318 | /* Enable fast mode */ | |
3319 | s->flags |= __CMPXCHG_DOUBLE; | |
3320 | #endif | |
3321 | ||
3b89d7d8 DR |
3322 | /* |
3323 | * The larger the object size is, the more pages we want on the partial | |
3324 | * list to avoid pounding the page allocator excessively. | |
3325 | */ | |
49e22585 CL |
3326 | set_min_partial(s, ilog2(s->size) / 2); |
3327 | ||
3328 | /* | |
3329 | * cpu_partial determined the maximum number of objects kept in the | |
3330 | * per cpu partial lists of a processor. | |
3331 | * | |
3332 | * Per cpu partial lists mainly contain slabs that just have one | |
3333 | * object freed. If they are used for allocation then they can be | |
3334 | * filled up again with minimal effort. The slab will never hit the | |
3335 | * per node partial lists and therefore no locking will be required. | |
3336 | * | |
3337 | * This setting also determines | |
3338 | * | |
3339 | * A) The number of objects from per cpu partial slabs dumped to the | |
3340 | * per node list when we reach the limit. | |
9f264904 | 3341 | * B) The number of objects in cpu partial slabs to extract from the |
d0e0ac97 CG |
3342 | * per node list when we run out of per cpu objects. We only fetch |
3343 | * 50% to keep some capacity around for frees. | |
49e22585 | 3344 | */ |
345c905d | 3345 | if (!kmem_cache_has_cpu_partial(s)) |
8f1e33da CL |
3346 | s->cpu_partial = 0; |
3347 | else if (s->size >= PAGE_SIZE) | |
49e22585 CL |
3348 | s->cpu_partial = 2; |
3349 | else if (s->size >= 1024) | |
3350 | s->cpu_partial = 6; | |
3351 | else if (s->size >= 256) | |
3352 | s->cpu_partial = 13; | |
3353 | else | |
3354 | s->cpu_partial = 30; | |
3355 | ||
81819f0f | 3356 | #ifdef CONFIG_NUMA |
e2cb96b7 | 3357 | s->remote_node_defrag_ratio = 1000; |
81819f0f | 3358 | #endif |
55136592 | 3359 | if (!init_kmem_cache_nodes(s)) |
dfb4f096 | 3360 | goto error; |
81819f0f | 3361 | |
55136592 | 3362 | if (alloc_kmem_cache_cpus(s)) |
278b1bb1 | 3363 | return 0; |
ff12059e | 3364 | |
4c93c355 | 3365 | free_kmem_cache_nodes(s); |
81819f0f CL |
3366 | error: |
3367 | if (flags & SLAB_PANIC) | |
3368 | panic("Cannot create slab %s size=%lu realsize=%u " | |
3369 | "order=%u offset=%u flags=%lx\n", | |
d0e0ac97 CG |
3370 | s->name, (unsigned long)s->size, s->size, |
3371 | oo_order(s->oo), s->offset, flags); | |
278b1bb1 | 3372 | return -EINVAL; |
81819f0f | 3373 | } |
81819f0f | 3374 | |
33b12c38 CL |
3375 | static void list_slab_objects(struct kmem_cache *s, struct page *page, |
3376 | const char *text) | |
3377 | { | |
3378 | #ifdef CONFIG_SLUB_DEBUG | |
3379 | void *addr = page_address(page); | |
3380 | void *p; | |
a5dd5c11 NK |
3381 | unsigned long *map = kzalloc(BITS_TO_LONGS(page->objects) * |
3382 | sizeof(long), GFP_ATOMIC); | |
bbd7d57b ED |
3383 | if (!map) |
3384 | return; | |
945cf2b6 | 3385 | slab_err(s, page, text, s->name); |
33b12c38 | 3386 | slab_lock(page); |
33b12c38 | 3387 | |
5f80b13a | 3388 | get_map(s, page, map); |
33b12c38 CL |
3389 | for_each_object(p, s, addr, page->objects) { |
3390 | ||
3391 | if (!test_bit(slab_index(p, s, addr), map)) { | |
f9f58285 | 3392 | pr_err("INFO: Object 0x%p @offset=%tu\n", p, p - addr); |
33b12c38 CL |
3393 | print_tracking(s, p); |
3394 | } | |
3395 | } | |
3396 | slab_unlock(page); | |
bbd7d57b | 3397 | kfree(map); |
33b12c38 CL |
3398 | #endif |
3399 | } | |
3400 | ||
81819f0f | 3401 | /* |
599870b1 | 3402 | * Attempt to free all partial slabs on a node. |
52b4b950 DS |
3403 | * This is called from __kmem_cache_shutdown(). We must take list_lock |
3404 | * because sysfs file might still access partial list after the shutdowning. | |
81819f0f | 3405 | */ |
599870b1 | 3406 | static void free_partial(struct kmem_cache *s, struct kmem_cache_node *n) |
81819f0f | 3407 | { |
81819f0f CL |
3408 | struct page *page, *h; |
3409 | ||
52b4b950 DS |
3410 | BUG_ON(irqs_disabled()); |
3411 | spin_lock_irq(&n->list_lock); | |
33b12c38 | 3412 | list_for_each_entry_safe(page, h, &n->partial, lru) { |
81819f0f | 3413 | if (!page->inuse) { |
52b4b950 | 3414 | remove_partial(n, page); |
81819f0f | 3415 | discard_slab(s, page); |
33b12c38 CL |
3416 | } else { |
3417 | list_slab_objects(s, page, | |
52b4b950 | 3418 | "Objects remaining in %s on __kmem_cache_shutdown()"); |
599870b1 | 3419 | } |
33b12c38 | 3420 | } |
52b4b950 | 3421 | spin_unlock_irq(&n->list_lock); |
81819f0f CL |
3422 | } |
3423 | ||
3424 | /* | |
672bba3a | 3425 | * Release all resources used by a slab cache. |
81819f0f | 3426 | */ |
52b4b950 | 3427 | int __kmem_cache_shutdown(struct kmem_cache *s) |
81819f0f CL |
3428 | { |
3429 | int node; | |
fa45dc25 | 3430 | struct kmem_cache_node *n; |
81819f0f CL |
3431 | |
3432 | flush_all(s); | |
81819f0f | 3433 | /* Attempt to free all objects */ |
fa45dc25 | 3434 | for_each_kmem_cache_node(s, node, n) { |
599870b1 CL |
3435 | free_partial(s, n); |
3436 | if (n->nr_partial || slabs_node(s, node)) | |
81819f0f CL |
3437 | return 1; |
3438 | } | |
81819f0f CL |
3439 | return 0; |
3440 | } | |
3441 | ||
81819f0f CL |
3442 | /******************************************************************** |
3443 | * Kmalloc subsystem | |
3444 | *******************************************************************/ | |
3445 | ||
81819f0f CL |
3446 | static int __init setup_slub_min_order(char *str) |
3447 | { | |
06428780 | 3448 | get_option(&str, &slub_min_order); |
81819f0f CL |
3449 | |
3450 | return 1; | |
3451 | } | |
3452 | ||
3453 | __setup("slub_min_order=", setup_slub_min_order); | |
3454 | ||
3455 | static int __init setup_slub_max_order(char *str) | |
3456 | { | |
06428780 | 3457 | get_option(&str, &slub_max_order); |
818cf590 | 3458 | slub_max_order = min(slub_max_order, MAX_ORDER - 1); |
81819f0f CL |
3459 | |
3460 | return 1; | |
3461 | } | |
3462 | ||
3463 | __setup("slub_max_order=", setup_slub_max_order); | |
3464 | ||
3465 | static int __init setup_slub_min_objects(char *str) | |
3466 | { | |
06428780 | 3467 | get_option(&str, &slub_min_objects); |
81819f0f CL |
3468 | |
3469 | return 1; | |
3470 | } | |
3471 | ||
3472 | __setup("slub_min_objects=", setup_slub_min_objects); | |
3473 | ||
81819f0f CL |
3474 | void *__kmalloc(size_t size, gfp_t flags) |
3475 | { | |
aadb4bc4 | 3476 | struct kmem_cache *s; |
5b882be4 | 3477 | void *ret; |
81819f0f | 3478 | |
95a05b42 | 3479 | if (unlikely(size > KMALLOC_MAX_CACHE_SIZE)) |
eada35ef | 3480 | return kmalloc_large(size, flags); |
aadb4bc4 | 3481 | |
2c59dd65 | 3482 | s = kmalloc_slab(size, flags); |
aadb4bc4 CL |
3483 | |
3484 | if (unlikely(ZERO_OR_NULL_PTR(s))) | |
6cb8f913 CL |
3485 | return s; |
3486 | ||
2b847c3c | 3487 | ret = slab_alloc(s, flags, _RET_IP_); |
5b882be4 | 3488 | |
ca2b84cb | 3489 | trace_kmalloc(_RET_IP_, ret, size, s->size, flags); |
5b882be4 | 3490 | |
0316bec2 AR |
3491 | kasan_kmalloc(s, ret, size); |
3492 | ||
5b882be4 | 3493 | return ret; |
81819f0f CL |
3494 | } |
3495 | EXPORT_SYMBOL(__kmalloc); | |
3496 | ||
5d1f57e4 | 3497 | #ifdef CONFIG_NUMA |
f619cfe1 CL |
3498 | static void *kmalloc_large_node(size_t size, gfp_t flags, int node) |
3499 | { | |
b1eeab67 | 3500 | struct page *page; |
e4f7c0b4 | 3501 | void *ptr = NULL; |
f619cfe1 | 3502 | |
52383431 VD |
3503 | flags |= __GFP_COMP | __GFP_NOTRACK; |
3504 | page = alloc_kmem_pages_node(node, flags, get_order(size)); | |
f619cfe1 | 3505 | if (page) |
e4f7c0b4 CM |
3506 | ptr = page_address(page); |
3507 | ||
d56791b3 | 3508 | kmalloc_large_node_hook(ptr, size, flags); |
e4f7c0b4 | 3509 | return ptr; |
f619cfe1 CL |
3510 | } |
3511 | ||
81819f0f CL |
3512 | void *__kmalloc_node(size_t size, gfp_t flags, int node) |
3513 | { | |
aadb4bc4 | 3514 | struct kmem_cache *s; |
5b882be4 | 3515 | void *ret; |
81819f0f | 3516 | |
95a05b42 | 3517 | if (unlikely(size > KMALLOC_MAX_CACHE_SIZE)) { |
5b882be4 EGM |
3518 | ret = kmalloc_large_node(size, flags, node); |
3519 | ||
ca2b84cb EGM |
3520 | trace_kmalloc_node(_RET_IP_, ret, |
3521 | size, PAGE_SIZE << get_order(size), | |
3522 | flags, node); | |
5b882be4 EGM |
3523 | |
3524 | return ret; | |
3525 | } | |
aadb4bc4 | 3526 | |
2c59dd65 | 3527 | s = kmalloc_slab(size, flags); |
aadb4bc4 CL |
3528 | |
3529 | if (unlikely(ZERO_OR_NULL_PTR(s))) | |
6cb8f913 CL |
3530 | return s; |
3531 | ||
2b847c3c | 3532 | ret = slab_alloc_node(s, flags, node, _RET_IP_); |
5b882be4 | 3533 | |
ca2b84cb | 3534 | trace_kmalloc_node(_RET_IP_, ret, size, s->size, flags, node); |
5b882be4 | 3535 | |
0316bec2 AR |
3536 | kasan_kmalloc(s, ret, size); |
3537 | ||
5b882be4 | 3538 | return ret; |
81819f0f CL |
3539 | } |
3540 | EXPORT_SYMBOL(__kmalloc_node); | |
3541 | #endif | |
3542 | ||
0316bec2 | 3543 | static size_t __ksize(const void *object) |
81819f0f | 3544 | { |
272c1d21 | 3545 | struct page *page; |
81819f0f | 3546 | |
ef8b4520 | 3547 | if (unlikely(object == ZERO_SIZE_PTR)) |
272c1d21 CL |
3548 | return 0; |
3549 | ||
294a80a8 | 3550 | page = virt_to_head_page(object); |
294a80a8 | 3551 | |
76994412 PE |
3552 | if (unlikely(!PageSlab(page))) { |
3553 | WARN_ON(!PageCompound(page)); | |
294a80a8 | 3554 | return PAGE_SIZE << compound_order(page); |
76994412 | 3555 | } |
81819f0f | 3556 | |
1b4f59e3 | 3557 | return slab_ksize(page->slab_cache); |
81819f0f | 3558 | } |
0316bec2 AR |
3559 | |
3560 | size_t ksize(const void *object) | |
3561 | { | |
3562 | size_t size = __ksize(object); | |
3563 | /* We assume that ksize callers could use whole allocated area, | |
3564 | so we need unpoison this area. */ | |
3565 | kasan_krealloc(object, size); | |
3566 | return size; | |
3567 | } | |
b1aabecd | 3568 | EXPORT_SYMBOL(ksize); |
81819f0f CL |
3569 | |
3570 | void kfree(const void *x) | |
3571 | { | |
81819f0f | 3572 | struct page *page; |
5bb983b0 | 3573 | void *object = (void *)x; |
81819f0f | 3574 | |
2121db74 PE |
3575 | trace_kfree(_RET_IP_, x); |
3576 | ||
2408c550 | 3577 | if (unlikely(ZERO_OR_NULL_PTR(x))) |
81819f0f CL |
3578 | return; |
3579 | ||
b49af68f | 3580 | page = virt_to_head_page(x); |
aadb4bc4 | 3581 | if (unlikely(!PageSlab(page))) { |
0937502a | 3582 | BUG_ON(!PageCompound(page)); |
d56791b3 | 3583 | kfree_hook(x); |
52383431 | 3584 | __free_kmem_pages(page, compound_order(page)); |
aadb4bc4 CL |
3585 | return; |
3586 | } | |
81084651 | 3587 | slab_free(page->slab_cache, page, object, NULL, 1, _RET_IP_); |
81819f0f CL |
3588 | } |
3589 | EXPORT_SYMBOL(kfree); | |
3590 | ||
832f37f5 VD |
3591 | #define SHRINK_PROMOTE_MAX 32 |
3592 | ||
2086d26a | 3593 | /* |
832f37f5 VD |
3594 | * kmem_cache_shrink discards empty slabs and promotes the slabs filled |
3595 | * up most to the head of the partial lists. New allocations will then | |
3596 | * fill those up and thus they can be removed from the partial lists. | |
672bba3a CL |
3597 | * |
3598 | * The slabs with the least items are placed last. This results in them | |
3599 | * being allocated from last increasing the chance that the last objects | |
3600 | * are freed in them. | |
2086d26a | 3601 | */ |
d6e0b7fa | 3602 | int __kmem_cache_shrink(struct kmem_cache *s, bool deactivate) |
2086d26a CL |
3603 | { |
3604 | int node; | |
3605 | int i; | |
3606 | struct kmem_cache_node *n; | |
3607 | struct page *page; | |
3608 | struct page *t; | |
832f37f5 VD |
3609 | struct list_head discard; |
3610 | struct list_head promote[SHRINK_PROMOTE_MAX]; | |
2086d26a | 3611 | unsigned long flags; |
ce3712d7 | 3612 | int ret = 0; |
2086d26a | 3613 | |
d6e0b7fa VD |
3614 | if (deactivate) { |
3615 | /* | |
3616 | * Disable empty slabs caching. Used to avoid pinning offline | |
3617 | * memory cgroups by kmem pages that can be freed. | |
3618 | */ | |
3619 | s->cpu_partial = 0; | |
3620 | s->min_partial = 0; | |
3621 | ||
3622 | /* | |
3623 | * s->cpu_partial is checked locklessly (see put_cpu_partial), | |
3624 | * so we have to make sure the change is visible. | |
3625 | */ | |
3626 | kick_all_cpus_sync(); | |
3627 | } | |
3628 | ||
2086d26a | 3629 | flush_all(s); |
fa45dc25 | 3630 | for_each_kmem_cache_node(s, node, n) { |
832f37f5 VD |
3631 | INIT_LIST_HEAD(&discard); |
3632 | for (i = 0; i < SHRINK_PROMOTE_MAX; i++) | |
3633 | INIT_LIST_HEAD(promote + i); | |
2086d26a CL |
3634 | |
3635 | spin_lock_irqsave(&n->list_lock, flags); | |
3636 | ||
3637 | /* | |
832f37f5 | 3638 | * Build lists of slabs to discard or promote. |
2086d26a | 3639 | * |
672bba3a CL |
3640 | * Note that concurrent frees may occur while we hold the |
3641 | * list_lock. page->inuse here is the upper limit. | |
2086d26a CL |
3642 | */ |
3643 | list_for_each_entry_safe(page, t, &n->partial, lru) { | |
832f37f5 VD |
3644 | int free = page->objects - page->inuse; |
3645 | ||
3646 | /* Do not reread page->inuse */ | |
3647 | barrier(); | |
3648 | ||
3649 | /* We do not keep full slabs on the list */ | |
3650 | BUG_ON(free <= 0); | |
3651 | ||
3652 | if (free == page->objects) { | |
3653 | list_move(&page->lru, &discard); | |
69cb8e6b | 3654 | n->nr_partial--; |
832f37f5 VD |
3655 | } else if (free <= SHRINK_PROMOTE_MAX) |
3656 | list_move(&page->lru, promote + free - 1); | |
2086d26a CL |
3657 | } |
3658 | ||
2086d26a | 3659 | /* |
832f37f5 VD |
3660 | * Promote the slabs filled up most to the head of the |
3661 | * partial list. | |
2086d26a | 3662 | */ |
832f37f5 VD |
3663 | for (i = SHRINK_PROMOTE_MAX - 1; i >= 0; i--) |
3664 | list_splice(promote + i, &n->partial); | |
2086d26a | 3665 | |
2086d26a | 3666 | spin_unlock_irqrestore(&n->list_lock, flags); |
69cb8e6b CL |
3667 | |
3668 | /* Release empty slabs */ | |
832f37f5 | 3669 | list_for_each_entry_safe(page, t, &discard, lru) |
69cb8e6b | 3670 | discard_slab(s, page); |
ce3712d7 VD |
3671 | |
3672 | if (slabs_node(s, node)) | |
3673 | ret = 1; | |
2086d26a CL |
3674 | } |
3675 | ||
ce3712d7 | 3676 | return ret; |
2086d26a | 3677 | } |
2086d26a | 3678 | |
b9049e23 YG |
3679 | static int slab_mem_going_offline_callback(void *arg) |
3680 | { | |
3681 | struct kmem_cache *s; | |
3682 | ||
18004c5d | 3683 | mutex_lock(&slab_mutex); |
b9049e23 | 3684 | list_for_each_entry(s, &slab_caches, list) |
d6e0b7fa | 3685 | __kmem_cache_shrink(s, false); |
18004c5d | 3686 | mutex_unlock(&slab_mutex); |
b9049e23 YG |
3687 | |
3688 | return 0; | |
3689 | } | |
3690 | ||
3691 | static void slab_mem_offline_callback(void *arg) | |
3692 | { | |
3693 | struct kmem_cache_node *n; | |
3694 | struct kmem_cache *s; | |
3695 | struct memory_notify *marg = arg; | |
3696 | int offline_node; | |
3697 | ||
b9d5ab25 | 3698 | offline_node = marg->status_change_nid_normal; |
b9049e23 YG |
3699 | |
3700 | /* | |
3701 | * If the node still has available memory. we need kmem_cache_node | |
3702 | * for it yet. | |
3703 | */ | |
3704 | if (offline_node < 0) | |
3705 | return; | |
3706 | ||
18004c5d | 3707 | mutex_lock(&slab_mutex); |
b9049e23 YG |
3708 | list_for_each_entry(s, &slab_caches, list) { |
3709 | n = get_node(s, offline_node); | |
3710 | if (n) { | |
3711 | /* | |
3712 | * if n->nr_slabs > 0, slabs still exist on the node | |
3713 | * that is going down. We were unable to free them, | |
c9404c9c | 3714 | * and offline_pages() function shouldn't call this |
b9049e23 YG |
3715 | * callback. So, we must fail. |
3716 | */ | |
0f389ec6 | 3717 | BUG_ON(slabs_node(s, offline_node)); |
b9049e23 YG |
3718 | |
3719 | s->node[offline_node] = NULL; | |
8de66a0c | 3720 | kmem_cache_free(kmem_cache_node, n); |
b9049e23 YG |
3721 | } |
3722 | } | |
18004c5d | 3723 | mutex_unlock(&slab_mutex); |
b9049e23 YG |
3724 | } |
3725 | ||
3726 | static int slab_mem_going_online_callback(void *arg) | |
3727 | { | |
3728 | struct kmem_cache_node *n; | |
3729 | struct kmem_cache *s; | |
3730 | struct memory_notify *marg = arg; | |
b9d5ab25 | 3731 | int nid = marg->status_change_nid_normal; |
b9049e23 YG |
3732 | int ret = 0; |
3733 | ||
3734 | /* | |
3735 | * If the node's memory is already available, then kmem_cache_node is | |
3736 | * already created. Nothing to do. | |
3737 | */ | |
3738 | if (nid < 0) | |
3739 | return 0; | |
3740 | ||
3741 | /* | |
0121c619 | 3742 | * We are bringing a node online. No memory is available yet. We must |
b9049e23 YG |
3743 | * allocate a kmem_cache_node structure in order to bring the node |
3744 | * online. | |
3745 | */ | |
18004c5d | 3746 | mutex_lock(&slab_mutex); |
b9049e23 YG |
3747 | list_for_each_entry(s, &slab_caches, list) { |
3748 | /* | |
3749 | * XXX: kmem_cache_alloc_node will fallback to other nodes | |
3750 | * since memory is not yet available from the node that | |
3751 | * is brought up. | |
3752 | */ | |
8de66a0c | 3753 | n = kmem_cache_alloc(kmem_cache_node, GFP_KERNEL); |
b9049e23 YG |
3754 | if (!n) { |
3755 | ret = -ENOMEM; | |
3756 | goto out; | |
3757 | } | |
4053497d | 3758 | init_kmem_cache_node(n); |
b9049e23 YG |
3759 | s->node[nid] = n; |
3760 | } | |
3761 | out: | |
18004c5d | 3762 | mutex_unlock(&slab_mutex); |
b9049e23 YG |
3763 | return ret; |
3764 | } | |
3765 | ||
3766 | static int slab_memory_callback(struct notifier_block *self, | |
3767 | unsigned long action, void *arg) | |
3768 | { | |
3769 | int ret = 0; | |
3770 | ||
3771 | switch (action) { | |
3772 | case MEM_GOING_ONLINE: | |
3773 | ret = slab_mem_going_online_callback(arg); | |
3774 | break; | |
3775 | case MEM_GOING_OFFLINE: | |
3776 | ret = slab_mem_going_offline_callback(arg); | |
3777 | break; | |
3778 | case MEM_OFFLINE: | |
3779 | case MEM_CANCEL_ONLINE: | |
3780 | slab_mem_offline_callback(arg); | |
3781 | break; | |
3782 | case MEM_ONLINE: | |
3783 | case MEM_CANCEL_OFFLINE: | |
3784 | break; | |
3785 | } | |
dc19f9db KH |
3786 | if (ret) |
3787 | ret = notifier_from_errno(ret); | |
3788 | else | |
3789 | ret = NOTIFY_OK; | |
b9049e23 YG |
3790 | return ret; |
3791 | } | |
3792 | ||
3ac38faa AM |
3793 | static struct notifier_block slab_memory_callback_nb = { |
3794 | .notifier_call = slab_memory_callback, | |
3795 | .priority = SLAB_CALLBACK_PRI, | |
3796 | }; | |
b9049e23 | 3797 | |
81819f0f CL |
3798 | /******************************************************************** |
3799 | * Basic setup of slabs | |
3800 | *******************************************************************/ | |
3801 | ||
51df1142 CL |
3802 | /* |
3803 | * Used for early kmem_cache structures that were allocated using | |
dffb4d60 CL |
3804 | * the page allocator. Allocate them properly then fix up the pointers |
3805 | * that may be pointing to the wrong kmem_cache structure. | |
51df1142 CL |
3806 | */ |
3807 | ||
dffb4d60 | 3808 | static struct kmem_cache * __init bootstrap(struct kmem_cache *static_cache) |
51df1142 CL |
3809 | { |
3810 | int node; | |
dffb4d60 | 3811 | struct kmem_cache *s = kmem_cache_zalloc(kmem_cache, GFP_NOWAIT); |
fa45dc25 | 3812 | struct kmem_cache_node *n; |
51df1142 | 3813 | |
dffb4d60 | 3814 | memcpy(s, static_cache, kmem_cache->object_size); |
51df1142 | 3815 | |
7d557b3c GC |
3816 | /* |
3817 | * This runs very early, and only the boot processor is supposed to be | |
3818 | * up. Even if it weren't true, IRQs are not up so we couldn't fire | |
3819 | * IPIs around. | |
3820 | */ | |
3821 | __flush_cpu_slab(s, smp_processor_id()); | |
fa45dc25 | 3822 | for_each_kmem_cache_node(s, node, n) { |
51df1142 CL |
3823 | struct page *p; |
3824 | ||
fa45dc25 CL |
3825 | list_for_each_entry(p, &n->partial, lru) |
3826 | p->slab_cache = s; | |
51df1142 | 3827 | |
607bf324 | 3828 | #ifdef CONFIG_SLUB_DEBUG |
fa45dc25 CL |
3829 | list_for_each_entry(p, &n->full, lru) |
3830 | p->slab_cache = s; | |
51df1142 | 3831 | #endif |
51df1142 | 3832 | } |
f7ce3190 | 3833 | slab_init_memcg_params(s); |
dffb4d60 CL |
3834 | list_add(&s->list, &slab_caches); |
3835 | return s; | |
51df1142 CL |
3836 | } |
3837 | ||
81819f0f CL |
3838 | void __init kmem_cache_init(void) |
3839 | { | |
dffb4d60 CL |
3840 | static __initdata struct kmem_cache boot_kmem_cache, |
3841 | boot_kmem_cache_node; | |
51df1142 | 3842 | |
fc8d8620 SG |
3843 | if (debug_guardpage_minorder()) |
3844 | slub_max_order = 0; | |
3845 | ||
dffb4d60 CL |
3846 | kmem_cache_node = &boot_kmem_cache_node; |
3847 | kmem_cache = &boot_kmem_cache; | |
51df1142 | 3848 | |
dffb4d60 CL |
3849 | create_boot_cache(kmem_cache_node, "kmem_cache_node", |
3850 | sizeof(struct kmem_cache_node), SLAB_HWCACHE_ALIGN); | |
b9049e23 | 3851 | |
3ac38faa | 3852 | register_hotmemory_notifier(&slab_memory_callback_nb); |
81819f0f CL |
3853 | |
3854 | /* Able to allocate the per node structures */ | |
3855 | slab_state = PARTIAL; | |
3856 | ||
dffb4d60 CL |
3857 | create_boot_cache(kmem_cache, "kmem_cache", |
3858 | offsetof(struct kmem_cache, node) + | |
3859 | nr_node_ids * sizeof(struct kmem_cache_node *), | |
3860 | SLAB_HWCACHE_ALIGN); | |
8a13a4cc | 3861 | |
dffb4d60 | 3862 | kmem_cache = bootstrap(&boot_kmem_cache); |
81819f0f | 3863 | |
51df1142 CL |
3864 | /* |
3865 | * Allocate kmem_cache_node properly from the kmem_cache slab. | |
3866 | * kmem_cache_node is separately allocated so no need to | |
3867 | * update any list pointers. | |
3868 | */ | |
dffb4d60 | 3869 | kmem_cache_node = bootstrap(&boot_kmem_cache_node); |
51df1142 CL |
3870 | |
3871 | /* Now we can use the kmem_cache to allocate kmalloc slabs */ | |
34cc6990 | 3872 | setup_kmalloc_cache_index_table(); |
f97d5f63 | 3873 | create_kmalloc_caches(0); |
81819f0f CL |
3874 | |
3875 | #ifdef CONFIG_SMP | |
3876 | register_cpu_notifier(&slab_notifier); | |
9dfc6e68 | 3877 | #endif |
81819f0f | 3878 | |
f9f58285 | 3879 | pr_info("SLUB: HWalign=%d, Order=%d-%d, MinObjects=%d, CPUs=%d, Nodes=%d\n", |
f97d5f63 | 3880 | cache_line_size(), |
81819f0f CL |
3881 | slub_min_order, slub_max_order, slub_min_objects, |
3882 | nr_cpu_ids, nr_node_ids); | |
3883 | } | |
3884 | ||
7e85ee0c PE |
3885 | void __init kmem_cache_init_late(void) |
3886 | { | |
7e85ee0c PE |
3887 | } |
3888 | ||
2633d7a0 | 3889 | struct kmem_cache * |
a44cb944 VD |
3890 | __kmem_cache_alias(const char *name, size_t size, size_t align, |
3891 | unsigned long flags, void (*ctor)(void *)) | |
81819f0f | 3892 | { |
426589f5 | 3893 | struct kmem_cache *s, *c; |
81819f0f | 3894 | |
a44cb944 | 3895 | s = find_mergeable(size, align, flags, name, ctor); |
81819f0f CL |
3896 | if (s) { |
3897 | s->refcount++; | |
84d0ddd6 | 3898 | |
81819f0f CL |
3899 | /* |
3900 | * Adjust the object sizes so that we clear | |
3901 | * the complete object on kzalloc. | |
3902 | */ | |
3b0efdfa | 3903 | s->object_size = max(s->object_size, (int)size); |
81819f0f | 3904 | s->inuse = max_t(int, s->inuse, ALIGN(size, sizeof(void *))); |
6446faa2 | 3905 | |
426589f5 | 3906 | for_each_memcg_cache(c, s) { |
84d0ddd6 VD |
3907 | c->object_size = s->object_size; |
3908 | c->inuse = max_t(int, c->inuse, | |
3909 | ALIGN(size, sizeof(void *))); | |
3910 | } | |
3911 | ||
7b8f3b66 | 3912 | if (sysfs_slab_alias(s, name)) { |
7b8f3b66 | 3913 | s->refcount--; |
cbb79694 | 3914 | s = NULL; |
7b8f3b66 | 3915 | } |
a0e1d1be | 3916 | } |
6446faa2 | 3917 | |
cbb79694 CL |
3918 | return s; |
3919 | } | |
84c1cf62 | 3920 | |
8a13a4cc | 3921 | int __kmem_cache_create(struct kmem_cache *s, unsigned long flags) |
cbb79694 | 3922 | { |
aac3a166 PE |
3923 | int err; |
3924 | ||
3925 | err = kmem_cache_open(s, flags); | |
3926 | if (err) | |
3927 | return err; | |
20cea968 | 3928 | |
45530c44 CL |
3929 | /* Mutex is not taken during early boot */ |
3930 | if (slab_state <= UP) | |
3931 | return 0; | |
3932 | ||
107dab5c | 3933 | memcg_propagate_slab_attrs(s); |
aac3a166 | 3934 | err = sysfs_slab_add(s); |
aac3a166 | 3935 | if (err) |
52b4b950 | 3936 | __kmem_cache_release(s); |
20cea968 | 3937 | |
aac3a166 | 3938 | return err; |
81819f0f | 3939 | } |
81819f0f | 3940 | |
81819f0f | 3941 | #ifdef CONFIG_SMP |
81819f0f | 3942 | /* |
672bba3a CL |
3943 | * Use the cpu notifier to insure that the cpu slabs are flushed when |
3944 | * necessary. | |
81819f0f | 3945 | */ |
0db0628d | 3946 | static int slab_cpuup_callback(struct notifier_block *nfb, |
81819f0f CL |
3947 | unsigned long action, void *hcpu) |
3948 | { | |
3949 | long cpu = (long)hcpu; | |
5b95a4ac CL |
3950 | struct kmem_cache *s; |
3951 | unsigned long flags; | |
81819f0f CL |
3952 | |
3953 | switch (action) { | |
3954 | case CPU_UP_CANCELED: | |
8bb78442 | 3955 | case CPU_UP_CANCELED_FROZEN: |
81819f0f | 3956 | case CPU_DEAD: |
8bb78442 | 3957 | case CPU_DEAD_FROZEN: |
18004c5d | 3958 | mutex_lock(&slab_mutex); |
5b95a4ac CL |
3959 | list_for_each_entry(s, &slab_caches, list) { |
3960 | local_irq_save(flags); | |
3961 | __flush_cpu_slab(s, cpu); | |
3962 | local_irq_restore(flags); | |
3963 | } | |
18004c5d | 3964 | mutex_unlock(&slab_mutex); |
81819f0f CL |
3965 | break; |
3966 | default: | |
3967 | break; | |
3968 | } | |
3969 | return NOTIFY_OK; | |
3970 | } | |
3971 | ||
0db0628d | 3972 | static struct notifier_block slab_notifier = { |
3adbefee | 3973 | .notifier_call = slab_cpuup_callback |
06428780 | 3974 | }; |
81819f0f CL |
3975 | |
3976 | #endif | |
3977 | ||
ce71e27c | 3978 | void *__kmalloc_track_caller(size_t size, gfp_t gfpflags, unsigned long caller) |
81819f0f | 3979 | { |
aadb4bc4 | 3980 | struct kmem_cache *s; |
94b528d0 | 3981 | void *ret; |
aadb4bc4 | 3982 | |
95a05b42 | 3983 | if (unlikely(size > KMALLOC_MAX_CACHE_SIZE)) |
eada35ef PE |
3984 | return kmalloc_large(size, gfpflags); |
3985 | ||
2c59dd65 | 3986 | s = kmalloc_slab(size, gfpflags); |
81819f0f | 3987 | |
2408c550 | 3988 | if (unlikely(ZERO_OR_NULL_PTR(s))) |
6cb8f913 | 3989 | return s; |
81819f0f | 3990 | |
2b847c3c | 3991 | ret = slab_alloc(s, gfpflags, caller); |
94b528d0 | 3992 | |
25985edc | 3993 | /* Honor the call site pointer we received. */ |
ca2b84cb | 3994 | trace_kmalloc(caller, ret, size, s->size, gfpflags); |
94b528d0 EGM |
3995 | |
3996 | return ret; | |
81819f0f CL |
3997 | } |
3998 | ||
5d1f57e4 | 3999 | #ifdef CONFIG_NUMA |
81819f0f | 4000 | void *__kmalloc_node_track_caller(size_t size, gfp_t gfpflags, |
ce71e27c | 4001 | int node, unsigned long caller) |
81819f0f | 4002 | { |
aadb4bc4 | 4003 | struct kmem_cache *s; |
94b528d0 | 4004 | void *ret; |
aadb4bc4 | 4005 | |
95a05b42 | 4006 | if (unlikely(size > KMALLOC_MAX_CACHE_SIZE)) { |
d3e14aa3 XF |
4007 | ret = kmalloc_large_node(size, gfpflags, node); |
4008 | ||
4009 | trace_kmalloc_node(caller, ret, | |
4010 | size, PAGE_SIZE << get_order(size), | |
4011 | gfpflags, node); | |
4012 | ||
4013 | return ret; | |
4014 | } | |
eada35ef | 4015 | |
2c59dd65 | 4016 | s = kmalloc_slab(size, gfpflags); |
81819f0f | 4017 | |
2408c550 | 4018 | if (unlikely(ZERO_OR_NULL_PTR(s))) |
6cb8f913 | 4019 | return s; |
81819f0f | 4020 | |
2b847c3c | 4021 | ret = slab_alloc_node(s, gfpflags, node, caller); |
94b528d0 | 4022 | |
25985edc | 4023 | /* Honor the call site pointer we received. */ |
ca2b84cb | 4024 | trace_kmalloc_node(caller, ret, size, s->size, gfpflags, node); |
94b528d0 EGM |
4025 | |
4026 | return ret; | |
81819f0f | 4027 | } |
5d1f57e4 | 4028 | #endif |
81819f0f | 4029 | |
ab4d5ed5 | 4030 | #ifdef CONFIG_SYSFS |
205ab99d CL |
4031 | static int count_inuse(struct page *page) |
4032 | { | |
4033 | return page->inuse; | |
4034 | } | |
4035 | ||
4036 | static int count_total(struct page *page) | |
4037 | { | |
4038 | return page->objects; | |
4039 | } | |
ab4d5ed5 | 4040 | #endif |
205ab99d | 4041 | |
ab4d5ed5 | 4042 | #ifdef CONFIG_SLUB_DEBUG |
434e245d CL |
4043 | static int validate_slab(struct kmem_cache *s, struct page *page, |
4044 | unsigned long *map) | |
53e15af0 CL |
4045 | { |
4046 | void *p; | |
a973e9dd | 4047 | void *addr = page_address(page); |
53e15af0 CL |
4048 | |
4049 | if (!check_slab(s, page) || | |
4050 | !on_freelist(s, page, NULL)) | |
4051 | return 0; | |
4052 | ||
4053 | /* Now we know that a valid freelist exists */ | |
39b26464 | 4054 | bitmap_zero(map, page->objects); |
53e15af0 | 4055 | |
5f80b13a CL |
4056 | get_map(s, page, map); |
4057 | for_each_object(p, s, addr, page->objects) { | |
4058 | if (test_bit(slab_index(p, s, addr), map)) | |
4059 | if (!check_object(s, page, p, SLUB_RED_INACTIVE)) | |
4060 | return 0; | |
53e15af0 CL |
4061 | } |
4062 | ||
224a88be | 4063 | for_each_object(p, s, addr, page->objects) |
7656c72b | 4064 | if (!test_bit(slab_index(p, s, addr), map)) |
37d57443 | 4065 | if (!check_object(s, page, p, SLUB_RED_ACTIVE)) |
53e15af0 CL |
4066 | return 0; |
4067 | return 1; | |
4068 | } | |
4069 | ||
434e245d CL |
4070 | static void validate_slab_slab(struct kmem_cache *s, struct page *page, |
4071 | unsigned long *map) | |
53e15af0 | 4072 | { |
881db7fb CL |
4073 | slab_lock(page); |
4074 | validate_slab(s, page, map); | |
4075 | slab_unlock(page); | |
53e15af0 CL |
4076 | } |
4077 | ||
434e245d CL |
4078 | static int validate_slab_node(struct kmem_cache *s, |
4079 | struct kmem_cache_node *n, unsigned long *map) | |
53e15af0 CL |
4080 | { |
4081 | unsigned long count = 0; | |
4082 | struct page *page; | |
4083 | unsigned long flags; | |
4084 | ||
4085 | spin_lock_irqsave(&n->list_lock, flags); | |
4086 | ||
4087 | list_for_each_entry(page, &n->partial, lru) { | |
434e245d | 4088 | validate_slab_slab(s, page, map); |
53e15af0 CL |
4089 | count++; |
4090 | } | |
4091 | if (count != n->nr_partial) | |
f9f58285 FF |
4092 | pr_err("SLUB %s: %ld partial slabs counted but counter=%ld\n", |
4093 | s->name, count, n->nr_partial); | |
53e15af0 CL |
4094 | |
4095 | if (!(s->flags & SLAB_STORE_USER)) | |
4096 | goto out; | |
4097 | ||
4098 | list_for_each_entry(page, &n->full, lru) { | |
434e245d | 4099 | validate_slab_slab(s, page, map); |
53e15af0 CL |
4100 | count++; |
4101 | } | |
4102 | if (count != atomic_long_read(&n->nr_slabs)) | |
f9f58285 FF |
4103 | pr_err("SLUB: %s %ld slabs counted but counter=%ld\n", |
4104 | s->name, count, atomic_long_read(&n->nr_slabs)); | |
53e15af0 CL |
4105 | |
4106 | out: | |
4107 | spin_unlock_irqrestore(&n->list_lock, flags); | |
4108 | return count; | |
4109 | } | |
4110 | ||
434e245d | 4111 | static long validate_slab_cache(struct kmem_cache *s) |
53e15af0 CL |
4112 | { |
4113 | int node; | |
4114 | unsigned long count = 0; | |
205ab99d | 4115 | unsigned long *map = kmalloc(BITS_TO_LONGS(oo_objects(s->max)) * |
434e245d | 4116 | sizeof(unsigned long), GFP_KERNEL); |
fa45dc25 | 4117 | struct kmem_cache_node *n; |
434e245d CL |
4118 | |
4119 | if (!map) | |
4120 | return -ENOMEM; | |
53e15af0 CL |
4121 | |
4122 | flush_all(s); | |
fa45dc25 | 4123 | for_each_kmem_cache_node(s, node, n) |
434e245d | 4124 | count += validate_slab_node(s, n, map); |
434e245d | 4125 | kfree(map); |
53e15af0 CL |
4126 | return count; |
4127 | } | |
88a420e4 | 4128 | /* |
672bba3a | 4129 | * Generate lists of code addresses where slabcache objects are allocated |
88a420e4 CL |
4130 | * and freed. |
4131 | */ | |
4132 | ||
4133 | struct location { | |
4134 | unsigned long count; | |
ce71e27c | 4135 | unsigned long addr; |
45edfa58 CL |
4136 | long long sum_time; |
4137 | long min_time; | |
4138 | long max_time; | |
4139 | long min_pid; | |
4140 | long max_pid; | |
174596a0 | 4141 | DECLARE_BITMAP(cpus, NR_CPUS); |
45edfa58 | 4142 | nodemask_t nodes; |
88a420e4 CL |
4143 | }; |
4144 | ||
4145 | struct loc_track { | |
4146 | unsigned long max; | |
4147 | unsigned long count; | |
4148 | struct location *loc; | |
4149 | }; | |
4150 | ||
4151 | static void free_loc_track(struct loc_track *t) | |
4152 | { | |
4153 | if (t->max) | |
4154 | free_pages((unsigned long)t->loc, | |
4155 | get_order(sizeof(struct location) * t->max)); | |
4156 | } | |
4157 | ||
68dff6a9 | 4158 | static int alloc_loc_track(struct loc_track *t, unsigned long max, gfp_t flags) |
88a420e4 CL |
4159 | { |
4160 | struct location *l; | |
4161 | int order; | |
4162 | ||
88a420e4 CL |
4163 | order = get_order(sizeof(struct location) * max); |
4164 | ||
68dff6a9 | 4165 | l = (void *)__get_free_pages(flags, order); |
88a420e4 CL |
4166 | if (!l) |
4167 | return 0; | |
4168 | ||
4169 | if (t->count) { | |
4170 | memcpy(l, t->loc, sizeof(struct location) * t->count); | |
4171 | free_loc_track(t); | |
4172 | } | |
4173 | t->max = max; | |
4174 | t->loc = l; | |
4175 | return 1; | |
4176 | } | |
4177 | ||
4178 | static int add_location(struct loc_track *t, struct kmem_cache *s, | |
45edfa58 | 4179 | const struct track *track) |
88a420e4 CL |
4180 | { |
4181 | long start, end, pos; | |
4182 | struct location *l; | |
ce71e27c | 4183 | unsigned long caddr; |
45edfa58 | 4184 | unsigned long age = jiffies - track->when; |
88a420e4 CL |
4185 | |
4186 | start = -1; | |
4187 | end = t->count; | |
4188 | ||
4189 | for ( ; ; ) { | |
4190 | pos = start + (end - start + 1) / 2; | |
4191 | ||
4192 | /* | |
4193 | * There is nothing at "end". If we end up there | |
4194 | * we need to add something to before end. | |
4195 | */ | |
4196 | if (pos == end) | |
4197 | break; | |
4198 | ||
4199 | caddr = t->loc[pos].addr; | |
45edfa58 CL |
4200 | if (track->addr == caddr) { |
4201 | ||
4202 | l = &t->loc[pos]; | |
4203 | l->count++; | |
4204 | if (track->when) { | |
4205 | l->sum_time += age; | |
4206 | if (age < l->min_time) | |
4207 | l->min_time = age; | |
4208 | if (age > l->max_time) | |
4209 | l->max_time = age; | |
4210 | ||
4211 | if (track->pid < l->min_pid) | |
4212 | l->min_pid = track->pid; | |
4213 | if (track->pid > l->max_pid) | |
4214 | l->max_pid = track->pid; | |
4215 | ||
174596a0 RR |
4216 | cpumask_set_cpu(track->cpu, |
4217 | to_cpumask(l->cpus)); | |
45edfa58 CL |
4218 | } |
4219 | node_set(page_to_nid(virt_to_page(track)), l->nodes); | |
88a420e4 CL |
4220 | return 1; |
4221 | } | |
4222 | ||
45edfa58 | 4223 | if (track->addr < caddr) |
88a420e4 CL |
4224 | end = pos; |
4225 | else | |
4226 | start = pos; | |
4227 | } | |
4228 | ||
4229 | /* | |
672bba3a | 4230 | * Not found. Insert new tracking element. |
88a420e4 | 4231 | */ |
68dff6a9 | 4232 | if (t->count >= t->max && !alloc_loc_track(t, 2 * t->max, GFP_ATOMIC)) |
88a420e4 CL |
4233 | return 0; |
4234 | ||
4235 | l = t->loc + pos; | |
4236 | if (pos < t->count) | |
4237 | memmove(l + 1, l, | |
4238 | (t->count - pos) * sizeof(struct location)); | |
4239 | t->count++; | |
4240 | l->count = 1; | |
45edfa58 CL |
4241 | l->addr = track->addr; |
4242 | l->sum_time = age; | |
4243 | l->min_time = age; | |
4244 | l->max_time = age; | |
4245 | l->min_pid = track->pid; | |
4246 | l->max_pid = track->pid; | |
174596a0 RR |
4247 | cpumask_clear(to_cpumask(l->cpus)); |
4248 | cpumask_set_cpu(track->cpu, to_cpumask(l->cpus)); | |
45edfa58 CL |
4249 | nodes_clear(l->nodes); |
4250 | node_set(page_to_nid(virt_to_page(track)), l->nodes); | |
88a420e4 CL |
4251 | return 1; |
4252 | } | |
4253 | ||
4254 | static void process_slab(struct loc_track *t, struct kmem_cache *s, | |
bbd7d57b | 4255 | struct page *page, enum track_item alloc, |
a5dd5c11 | 4256 | unsigned long *map) |
88a420e4 | 4257 | { |
a973e9dd | 4258 | void *addr = page_address(page); |
88a420e4 CL |
4259 | void *p; |
4260 | ||
39b26464 | 4261 | bitmap_zero(map, page->objects); |
5f80b13a | 4262 | get_map(s, page, map); |
88a420e4 | 4263 | |
224a88be | 4264 | for_each_object(p, s, addr, page->objects) |
45edfa58 CL |
4265 | if (!test_bit(slab_index(p, s, addr), map)) |
4266 | add_location(t, s, get_track(s, p, alloc)); | |
88a420e4 CL |
4267 | } |
4268 | ||
4269 | static int list_locations(struct kmem_cache *s, char *buf, | |
4270 | enum track_item alloc) | |
4271 | { | |
e374d483 | 4272 | int len = 0; |
88a420e4 | 4273 | unsigned long i; |
68dff6a9 | 4274 | struct loc_track t = { 0, 0, NULL }; |
88a420e4 | 4275 | int node; |
bbd7d57b ED |
4276 | unsigned long *map = kmalloc(BITS_TO_LONGS(oo_objects(s->max)) * |
4277 | sizeof(unsigned long), GFP_KERNEL); | |
fa45dc25 | 4278 | struct kmem_cache_node *n; |
88a420e4 | 4279 | |
bbd7d57b ED |
4280 | if (!map || !alloc_loc_track(&t, PAGE_SIZE / sizeof(struct location), |
4281 | GFP_TEMPORARY)) { | |
4282 | kfree(map); | |
68dff6a9 | 4283 | return sprintf(buf, "Out of memory\n"); |
bbd7d57b | 4284 | } |
88a420e4 CL |
4285 | /* Push back cpu slabs */ |
4286 | flush_all(s); | |
4287 | ||
fa45dc25 | 4288 | for_each_kmem_cache_node(s, node, n) { |
88a420e4 CL |
4289 | unsigned long flags; |
4290 | struct page *page; | |
4291 | ||
9e86943b | 4292 | if (!atomic_long_read(&n->nr_slabs)) |
88a420e4 CL |
4293 | continue; |
4294 | ||
4295 | spin_lock_irqsave(&n->list_lock, flags); | |
4296 | list_for_each_entry(page, &n->partial, lru) | |
bbd7d57b | 4297 | process_slab(&t, s, page, alloc, map); |
88a420e4 | 4298 | list_for_each_entry(page, &n->full, lru) |
bbd7d57b | 4299 | process_slab(&t, s, page, alloc, map); |
88a420e4 CL |
4300 | spin_unlock_irqrestore(&n->list_lock, flags); |
4301 | } | |
4302 | ||
4303 | for (i = 0; i < t.count; i++) { | |
45edfa58 | 4304 | struct location *l = &t.loc[i]; |
88a420e4 | 4305 | |
9c246247 | 4306 | if (len > PAGE_SIZE - KSYM_SYMBOL_LEN - 100) |
88a420e4 | 4307 | break; |
e374d483 | 4308 | len += sprintf(buf + len, "%7ld ", l->count); |
45edfa58 CL |
4309 | |
4310 | if (l->addr) | |
62c70bce | 4311 | len += sprintf(buf + len, "%pS", (void *)l->addr); |
88a420e4 | 4312 | else |
e374d483 | 4313 | len += sprintf(buf + len, "<not-available>"); |
45edfa58 CL |
4314 | |
4315 | if (l->sum_time != l->min_time) { | |
e374d483 | 4316 | len += sprintf(buf + len, " age=%ld/%ld/%ld", |
f8bd2258 RZ |
4317 | l->min_time, |
4318 | (long)div_u64(l->sum_time, l->count), | |
4319 | l->max_time); | |
45edfa58 | 4320 | } else |
e374d483 | 4321 | len += sprintf(buf + len, " age=%ld", |
45edfa58 CL |
4322 | l->min_time); |
4323 | ||
4324 | if (l->min_pid != l->max_pid) | |
e374d483 | 4325 | len += sprintf(buf + len, " pid=%ld-%ld", |
45edfa58 CL |
4326 | l->min_pid, l->max_pid); |
4327 | else | |
e374d483 | 4328 | len += sprintf(buf + len, " pid=%ld", |
45edfa58 CL |
4329 | l->min_pid); |
4330 | ||
174596a0 RR |
4331 | if (num_online_cpus() > 1 && |
4332 | !cpumask_empty(to_cpumask(l->cpus)) && | |
5024c1d7 TH |
4333 | len < PAGE_SIZE - 60) |
4334 | len += scnprintf(buf + len, PAGE_SIZE - len - 50, | |
4335 | " cpus=%*pbl", | |
4336 | cpumask_pr_args(to_cpumask(l->cpus))); | |
45edfa58 | 4337 | |
62bc62a8 | 4338 | if (nr_online_nodes > 1 && !nodes_empty(l->nodes) && |
5024c1d7 TH |
4339 | len < PAGE_SIZE - 60) |
4340 | len += scnprintf(buf + len, PAGE_SIZE - len - 50, | |
4341 | " nodes=%*pbl", | |
4342 | nodemask_pr_args(&l->nodes)); | |
45edfa58 | 4343 | |
e374d483 | 4344 | len += sprintf(buf + len, "\n"); |
88a420e4 CL |
4345 | } |
4346 | ||
4347 | free_loc_track(&t); | |
bbd7d57b | 4348 | kfree(map); |
88a420e4 | 4349 | if (!t.count) |
e374d483 HH |
4350 | len += sprintf(buf, "No data\n"); |
4351 | return len; | |
88a420e4 | 4352 | } |
ab4d5ed5 | 4353 | #endif |
88a420e4 | 4354 | |
a5a84755 | 4355 | #ifdef SLUB_RESILIENCY_TEST |
c07b8183 | 4356 | static void __init resiliency_test(void) |
a5a84755 CL |
4357 | { |
4358 | u8 *p; | |
4359 | ||
95a05b42 | 4360 | BUILD_BUG_ON(KMALLOC_MIN_SIZE > 16 || KMALLOC_SHIFT_HIGH < 10); |
a5a84755 | 4361 | |
f9f58285 FF |
4362 | pr_err("SLUB resiliency testing\n"); |
4363 | pr_err("-----------------------\n"); | |
4364 | pr_err("A. Corruption after allocation\n"); | |
a5a84755 CL |
4365 | |
4366 | p = kzalloc(16, GFP_KERNEL); | |
4367 | p[16] = 0x12; | |
f9f58285 FF |
4368 | pr_err("\n1. kmalloc-16: Clobber Redzone/next pointer 0x12->0x%p\n\n", |
4369 | p + 16); | |
a5a84755 CL |
4370 | |
4371 | validate_slab_cache(kmalloc_caches[4]); | |
4372 | ||
4373 | /* Hmmm... The next two are dangerous */ | |
4374 | p = kzalloc(32, GFP_KERNEL); | |
4375 | p[32 + sizeof(void *)] = 0x34; | |
f9f58285 FF |
4376 | pr_err("\n2. kmalloc-32: Clobber next pointer/next slab 0x34 -> -0x%p\n", |
4377 | p); | |
4378 | pr_err("If allocated object is overwritten then not detectable\n\n"); | |
a5a84755 CL |
4379 | |
4380 | validate_slab_cache(kmalloc_caches[5]); | |
4381 | p = kzalloc(64, GFP_KERNEL); | |
4382 | p += 64 + (get_cycles() & 0xff) * sizeof(void *); | |
4383 | *p = 0x56; | |
f9f58285 FF |
4384 | pr_err("\n3. kmalloc-64: corrupting random byte 0x56->0x%p\n", |
4385 | p); | |
4386 | pr_err("If allocated object is overwritten then not detectable\n\n"); | |
a5a84755 CL |
4387 | validate_slab_cache(kmalloc_caches[6]); |
4388 | ||
f9f58285 | 4389 | pr_err("\nB. Corruption after free\n"); |
a5a84755 CL |
4390 | p = kzalloc(128, GFP_KERNEL); |
4391 | kfree(p); | |
4392 | *p = 0x78; | |
f9f58285 | 4393 | pr_err("1. kmalloc-128: Clobber first word 0x78->0x%p\n\n", p); |
a5a84755 CL |
4394 | validate_slab_cache(kmalloc_caches[7]); |
4395 | ||
4396 | p = kzalloc(256, GFP_KERNEL); | |
4397 | kfree(p); | |
4398 | p[50] = 0x9a; | |
f9f58285 | 4399 | pr_err("\n2. kmalloc-256: Clobber 50th byte 0x9a->0x%p\n\n", p); |
a5a84755 CL |
4400 | validate_slab_cache(kmalloc_caches[8]); |
4401 | ||
4402 | p = kzalloc(512, GFP_KERNEL); | |
4403 | kfree(p); | |
4404 | p[512] = 0xab; | |
f9f58285 | 4405 | pr_err("\n3. kmalloc-512: Clobber redzone 0xab->0x%p\n\n", p); |
a5a84755 CL |
4406 | validate_slab_cache(kmalloc_caches[9]); |
4407 | } | |
4408 | #else | |
4409 | #ifdef CONFIG_SYSFS | |
4410 | static void resiliency_test(void) {}; | |
4411 | #endif | |
4412 | #endif | |
4413 | ||
ab4d5ed5 | 4414 | #ifdef CONFIG_SYSFS |
81819f0f | 4415 | enum slab_stat_type { |
205ab99d CL |
4416 | SL_ALL, /* All slabs */ |
4417 | SL_PARTIAL, /* Only partially allocated slabs */ | |
4418 | SL_CPU, /* Only slabs used for cpu caches */ | |
4419 | SL_OBJECTS, /* Determine allocated objects not slabs */ | |
4420 | SL_TOTAL /* Determine object capacity not slabs */ | |
81819f0f CL |
4421 | }; |
4422 | ||
205ab99d | 4423 | #define SO_ALL (1 << SL_ALL) |
81819f0f CL |
4424 | #define SO_PARTIAL (1 << SL_PARTIAL) |
4425 | #define SO_CPU (1 << SL_CPU) | |
4426 | #define SO_OBJECTS (1 << SL_OBJECTS) | |
205ab99d | 4427 | #define SO_TOTAL (1 << SL_TOTAL) |
81819f0f | 4428 | |
62e5c4b4 CG |
4429 | static ssize_t show_slab_objects(struct kmem_cache *s, |
4430 | char *buf, unsigned long flags) | |
81819f0f CL |
4431 | { |
4432 | unsigned long total = 0; | |
81819f0f CL |
4433 | int node; |
4434 | int x; | |
4435 | unsigned long *nodes; | |
81819f0f | 4436 | |
e35e1a97 | 4437 | nodes = kzalloc(sizeof(unsigned long) * nr_node_ids, GFP_KERNEL); |
62e5c4b4 CG |
4438 | if (!nodes) |
4439 | return -ENOMEM; | |
81819f0f | 4440 | |
205ab99d CL |
4441 | if (flags & SO_CPU) { |
4442 | int cpu; | |
81819f0f | 4443 | |
205ab99d | 4444 | for_each_possible_cpu(cpu) { |
d0e0ac97 CG |
4445 | struct kmem_cache_cpu *c = per_cpu_ptr(s->cpu_slab, |
4446 | cpu); | |
ec3ab083 | 4447 | int node; |
49e22585 | 4448 | struct page *page; |
dfb4f096 | 4449 | |
4db0c3c2 | 4450 | page = READ_ONCE(c->page); |
ec3ab083 CL |
4451 | if (!page) |
4452 | continue; | |
205ab99d | 4453 | |
ec3ab083 CL |
4454 | node = page_to_nid(page); |
4455 | if (flags & SO_TOTAL) | |
4456 | x = page->objects; | |
4457 | else if (flags & SO_OBJECTS) | |
4458 | x = page->inuse; | |
4459 | else | |
4460 | x = 1; | |
49e22585 | 4461 | |
ec3ab083 CL |
4462 | total += x; |
4463 | nodes[node] += x; | |
4464 | ||
4db0c3c2 | 4465 | page = READ_ONCE(c->partial); |
49e22585 | 4466 | if (page) { |
8afb1474 LZ |
4467 | node = page_to_nid(page); |
4468 | if (flags & SO_TOTAL) | |
4469 | WARN_ON_ONCE(1); | |
4470 | else if (flags & SO_OBJECTS) | |
4471 | WARN_ON_ONCE(1); | |
4472 | else | |
4473 | x = page->pages; | |
bc6697d8 ED |
4474 | total += x; |
4475 | nodes[node] += x; | |
49e22585 | 4476 | } |
81819f0f CL |
4477 | } |
4478 | } | |
4479 | ||
bfc8c901 | 4480 | get_online_mems(); |
ab4d5ed5 | 4481 | #ifdef CONFIG_SLUB_DEBUG |
205ab99d | 4482 | if (flags & SO_ALL) { |
fa45dc25 CL |
4483 | struct kmem_cache_node *n; |
4484 | ||
4485 | for_each_kmem_cache_node(s, node, n) { | |
205ab99d | 4486 | |
d0e0ac97 CG |
4487 | if (flags & SO_TOTAL) |
4488 | x = atomic_long_read(&n->total_objects); | |
4489 | else if (flags & SO_OBJECTS) | |
4490 | x = atomic_long_read(&n->total_objects) - | |
4491 | count_partial(n, count_free); | |
81819f0f | 4492 | else |
205ab99d | 4493 | x = atomic_long_read(&n->nr_slabs); |
81819f0f CL |
4494 | total += x; |
4495 | nodes[node] += x; | |
4496 | } | |
4497 | ||
ab4d5ed5 CL |
4498 | } else |
4499 | #endif | |
4500 | if (flags & SO_PARTIAL) { | |
fa45dc25 | 4501 | struct kmem_cache_node *n; |
81819f0f | 4502 | |
fa45dc25 | 4503 | for_each_kmem_cache_node(s, node, n) { |
205ab99d CL |
4504 | if (flags & SO_TOTAL) |
4505 | x = count_partial(n, count_total); | |
4506 | else if (flags & SO_OBJECTS) | |
4507 | x = count_partial(n, count_inuse); | |
81819f0f | 4508 | else |
205ab99d | 4509 | x = n->nr_partial; |
81819f0f CL |
4510 | total += x; |
4511 | nodes[node] += x; | |
4512 | } | |
4513 | } | |
81819f0f CL |
4514 | x = sprintf(buf, "%lu", total); |
4515 | #ifdef CONFIG_NUMA | |
fa45dc25 | 4516 | for (node = 0; node < nr_node_ids; node++) |
81819f0f CL |
4517 | if (nodes[node]) |
4518 | x += sprintf(buf + x, " N%d=%lu", | |
4519 | node, nodes[node]); | |
4520 | #endif | |
bfc8c901 | 4521 | put_online_mems(); |
81819f0f CL |
4522 | kfree(nodes); |
4523 | return x + sprintf(buf + x, "\n"); | |
4524 | } | |
4525 | ||
ab4d5ed5 | 4526 | #ifdef CONFIG_SLUB_DEBUG |
81819f0f CL |
4527 | static int any_slab_objects(struct kmem_cache *s) |
4528 | { | |
4529 | int node; | |
fa45dc25 | 4530 | struct kmem_cache_node *n; |
81819f0f | 4531 | |
fa45dc25 | 4532 | for_each_kmem_cache_node(s, node, n) |
4ea33e2d | 4533 | if (atomic_long_read(&n->total_objects)) |
81819f0f | 4534 | return 1; |
fa45dc25 | 4535 | |
81819f0f CL |
4536 | return 0; |
4537 | } | |
ab4d5ed5 | 4538 | #endif |
81819f0f CL |
4539 | |
4540 | #define to_slab_attr(n) container_of(n, struct slab_attribute, attr) | |
497888cf | 4541 | #define to_slab(n) container_of(n, struct kmem_cache, kobj) |
81819f0f CL |
4542 | |
4543 | struct slab_attribute { | |
4544 | struct attribute attr; | |
4545 | ssize_t (*show)(struct kmem_cache *s, char *buf); | |
4546 | ssize_t (*store)(struct kmem_cache *s, const char *x, size_t count); | |
4547 | }; | |
4548 | ||
4549 | #define SLAB_ATTR_RO(_name) \ | |
ab067e99 VK |
4550 | static struct slab_attribute _name##_attr = \ |
4551 | __ATTR(_name, 0400, _name##_show, NULL) | |
81819f0f CL |
4552 | |
4553 | #define SLAB_ATTR(_name) \ | |
4554 | static struct slab_attribute _name##_attr = \ | |
ab067e99 | 4555 | __ATTR(_name, 0600, _name##_show, _name##_store) |
81819f0f | 4556 | |
81819f0f CL |
4557 | static ssize_t slab_size_show(struct kmem_cache *s, char *buf) |
4558 | { | |
4559 | return sprintf(buf, "%d\n", s->size); | |
4560 | } | |
4561 | SLAB_ATTR_RO(slab_size); | |
4562 | ||
4563 | static ssize_t align_show(struct kmem_cache *s, char *buf) | |
4564 | { | |
4565 | return sprintf(buf, "%d\n", s->align); | |
4566 | } | |
4567 | SLAB_ATTR_RO(align); | |
4568 | ||
4569 | static ssize_t object_size_show(struct kmem_cache *s, char *buf) | |
4570 | { | |
3b0efdfa | 4571 | return sprintf(buf, "%d\n", s->object_size); |
81819f0f CL |
4572 | } |
4573 | SLAB_ATTR_RO(object_size); | |
4574 | ||
4575 | static ssize_t objs_per_slab_show(struct kmem_cache *s, char *buf) | |
4576 | { | |
834f3d11 | 4577 | return sprintf(buf, "%d\n", oo_objects(s->oo)); |
81819f0f CL |
4578 | } |
4579 | SLAB_ATTR_RO(objs_per_slab); | |
4580 | ||
06b285dc CL |
4581 | static ssize_t order_store(struct kmem_cache *s, |
4582 | const char *buf, size_t length) | |
4583 | { | |
0121c619 CL |
4584 | unsigned long order; |
4585 | int err; | |
4586 | ||
3dbb95f7 | 4587 | err = kstrtoul(buf, 10, &order); |
0121c619 CL |
4588 | if (err) |
4589 | return err; | |
06b285dc CL |
4590 | |
4591 | if (order > slub_max_order || order < slub_min_order) | |
4592 | return -EINVAL; | |
4593 | ||
4594 | calculate_sizes(s, order); | |
4595 | return length; | |
4596 | } | |
4597 | ||
81819f0f CL |
4598 | static ssize_t order_show(struct kmem_cache *s, char *buf) |
4599 | { | |
834f3d11 | 4600 | return sprintf(buf, "%d\n", oo_order(s->oo)); |
81819f0f | 4601 | } |
06b285dc | 4602 | SLAB_ATTR(order); |
81819f0f | 4603 | |
73d342b1 DR |
4604 | static ssize_t min_partial_show(struct kmem_cache *s, char *buf) |
4605 | { | |
4606 | return sprintf(buf, "%lu\n", s->min_partial); | |
4607 | } | |
4608 | ||
4609 | static ssize_t min_partial_store(struct kmem_cache *s, const char *buf, | |
4610 | size_t length) | |
4611 | { | |
4612 | unsigned long min; | |
4613 | int err; | |
4614 | ||
3dbb95f7 | 4615 | err = kstrtoul(buf, 10, &min); |
73d342b1 DR |
4616 | if (err) |
4617 | return err; | |
4618 | ||
c0bdb232 | 4619 | set_min_partial(s, min); |
73d342b1 DR |
4620 | return length; |
4621 | } | |
4622 | SLAB_ATTR(min_partial); | |
4623 | ||
49e22585 CL |
4624 | static ssize_t cpu_partial_show(struct kmem_cache *s, char *buf) |
4625 | { | |
4626 | return sprintf(buf, "%u\n", s->cpu_partial); | |
4627 | } | |
4628 | ||
4629 | static ssize_t cpu_partial_store(struct kmem_cache *s, const char *buf, | |
4630 | size_t length) | |
4631 | { | |
4632 | unsigned long objects; | |
4633 | int err; | |
4634 | ||
3dbb95f7 | 4635 | err = kstrtoul(buf, 10, &objects); |
49e22585 CL |
4636 | if (err) |
4637 | return err; | |
345c905d | 4638 | if (objects && !kmem_cache_has_cpu_partial(s)) |
74ee4ef1 | 4639 | return -EINVAL; |
49e22585 CL |
4640 | |
4641 | s->cpu_partial = objects; | |
4642 | flush_all(s); | |
4643 | return length; | |
4644 | } | |
4645 | SLAB_ATTR(cpu_partial); | |
4646 | ||
81819f0f CL |
4647 | static ssize_t ctor_show(struct kmem_cache *s, char *buf) |
4648 | { | |
62c70bce JP |
4649 | if (!s->ctor) |
4650 | return 0; | |
4651 | return sprintf(buf, "%pS\n", s->ctor); | |
81819f0f CL |
4652 | } |
4653 | SLAB_ATTR_RO(ctor); | |
4654 | ||
81819f0f CL |
4655 | static ssize_t aliases_show(struct kmem_cache *s, char *buf) |
4656 | { | |
4307c14f | 4657 | return sprintf(buf, "%d\n", s->refcount < 0 ? 0 : s->refcount - 1); |
81819f0f CL |
4658 | } |
4659 | SLAB_ATTR_RO(aliases); | |
4660 | ||
81819f0f CL |
4661 | static ssize_t partial_show(struct kmem_cache *s, char *buf) |
4662 | { | |
d9acf4b7 | 4663 | return show_slab_objects(s, buf, SO_PARTIAL); |
81819f0f CL |
4664 | } |
4665 | SLAB_ATTR_RO(partial); | |
4666 | ||
4667 | static ssize_t cpu_slabs_show(struct kmem_cache *s, char *buf) | |
4668 | { | |
d9acf4b7 | 4669 | return show_slab_objects(s, buf, SO_CPU); |
81819f0f CL |
4670 | } |
4671 | SLAB_ATTR_RO(cpu_slabs); | |
4672 | ||
4673 | static ssize_t objects_show(struct kmem_cache *s, char *buf) | |
4674 | { | |
205ab99d | 4675 | return show_slab_objects(s, buf, SO_ALL|SO_OBJECTS); |
81819f0f CL |
4676 | } |
4677 | SLAB_ATTR_RO(objects); | |
4678 | ||
205ab99d CL |
4679 | static ssize_t objects_partial_show(struct kmem_cache *s, char *buf) |
4680 | { | |
4681 | return show_slab_objects(s, buf, SO_PARTIAL|SO_OBJECTS); | |
4682 | } | |
4683 | SLAB_ATTR_RO(objects_partial); | |
4684 | ||
49e22585 CL |
4685 | static ssize_t slabs_cpu_partial_show(struct kmem_cache *s, char *buf) |
4686 | { | |
4687 | int objects = 0; | |
4688 | int pages = 0; | |
4689 | int cpu; | |
4690 | int len; | |
4691 | ||
4692 | for_each_online_cpu(cpu) { | |
4693 | struct page *page = per_cpu_ptr(s->cpu_slab, cpu)->partial; | |
4694 | ||
4695 | if (page) { | |
4696 | pages += page->pages; | |
4697 | objects += page->pobjects; | |
4698 | } | |
4699 | } | |
4700 | ||
4701 | len = sprintf(buf, "%d(%d)", objects, pages); | |
4702 | ||
4703 | #ifdef CONFIG_SMP | |
4704 | for_each_online_cpu(cpu) { | |
4705 | struct page *page = per_cpu_ptr(s->cpu_slab, cpu) ->partial; | |
4706 | ||
4707 | if (page && len < PAGE_SIZE - 20) | |
4708 | len += sprintf(buf + len, " C%d=%d(%d)", cpu, | |
4709 | page->pobjects, page->pages); | |
4710 | } | |
4711 | #endif | |
4712 | return len + sprintf(buf + len, "\n"); | |
4713 | } | |
4714 | SLAB_ATTR_RO(slabs_cpu_partial); | |
4715 | ||
a5a84755 CL |
4716 | static ssize_t reclaim_account_show(struct kmem_cache *s, char *buf) |
4717 | { | |
4718 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_RECLAIM_ACCOUNT)); | |
4719 | } | |
4720 | ||
4721 | static ssize_t reclaim_account_store(struct kmem_cache *s, | |
4722 | const char *buf, size_t length) | |
4723 | { | |
4724 | s->flags &= ~SLAB_RECLAIM_ACCOUNT; | |
4725 | if (buf[0] == '1') | |
4726 | s->flags |= SLAB_RECLAIM_ACCOUNT; | |
4727 | return length; | |
4728 | } | |
4729 | SLAB_ATTR(reclaim_account); | |
4730 | ||
4731 | static ssize_t hwcache_align_show(struct kmem_cache *s, char *buf) | |
4732 | { | |
4733 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_HWCACHE_ALIGN)); | |
4734 | } | |
4735 | SLAB_ATTR_RO(hwcache_align); | |
4736 | ||
4737 | #ifdef CONFIG_ZONE_DMA | |
4738 | static ssize_t cache_dma_show(struct kmem_cache *s, char *buf) | |
4739 | { | |
4740 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_CACHE_DMA)); | |
4741 | } | |
4742 | SLAB_ATTR_RO(cache_dma); | |
4743 | #endif | |
4744 | ||
4745 | static ssize_t destroy_by_rcu_show(struct kmem_cache *s, char *buf) | |
4746 | { | |
4747 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_DESTROY_BY_RCU)); | |
4748 | } | |
4749 | SLAB_ATTR_RO(destroy_by_rcu); | |
4750 | ||
ab9a0f19 LJ |
4751 | static ssize_t reserved_show(struct kmem_cache *s, char *buf) |
4752 | { | |
4753 | return sprintf(buf, "%d\n", s->reserved); | |
4754 | } | |
4755 | SLAB_ATTR_RO(reserved); | |
4756 | ||
ab4d5ed5 | 4757 | #ifdef CONFIG_SLUB_DEBUG |
a5a84755 CL |
4758 | static ssize_t slabs_show(struct kmem_cache *s, char *buf) |
4759 | { | |
4760 | return show_slab_objects(s, buf, SO_ALL); | |
4761 | } | |
4762 | SLAB_ATTR_RO(slabs); | |
4763 | ||
205ab99d CL |
4764 | static ssize_t total_objects_show(struct kmem_cache *s, char *buf) |
4765 | { | |
4766 | return show_slab_objects(s, buf, SO_ALL|SO_TOTAL); | |
4767 | } | |
4768 | SLAB_ATTR_RO(total_objects); | |
4769 | ||
81819f0f CL |
4770 | static ssize_t sanity_checks_show(struct kmem_cache *s, char *buf) |
4771 | { | |
4772 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_DEBUG_FREE)); | |
4773 | } | |
4774 | ||
4775 | static ssize_t sanity_checks_store(struct kmem_cache *s, | |
4776 | const char *buf, size_t length) | |
4777 | { | |
4778 | s->flags &= ~SLAB_DEBUG_FREE; | |
b789ef51 CL |
4779 | if (buf[0] == '1') { |
4780 | s->flags &= ~__CMPXCHG_DOUBLE; | |
81819f0f | 4781 | s->flags |= SLAB_DEBUG_FREE; |
b789ef51 | 4782 | } |
81819f0f CL |
4783 | return length; |
4784 | } | |
4785 | SLAB_ATTR(sanity_checks); | |
4786 | ||
4787 | static ssize_t trace_show(struct kmem_cache *s, char *buf) | |
4788 | { | |
4789 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_TRACE)); | |
4790 | } | |
4791 | ||
4792 | static ssize_t trace_store(struct kmem_cache *s, const char *buf, | |
4793 | size_t length) | |
4794 | { | |
c9e16131 CL |
4795 | /* |
4796 | * Tracing a merged cache is going to give confusing results | |
4797 | * as well as cause other issues like converting a mergeable | |
4798 | * cache into an umergeable one. | |
4799 | */ | |
4800 | if (s->refcount > 1) | |
4801 | return -EINVAL; | |
4802 | ||
81819f0f | 4803 | s->flags &= ~SLAB_TRACE; |
b789ef51 CL |
4804 | if (buf[0] == '1') { |
4805 | s->flags &= ~__CMPXCHG_DOUBLE; | |
81819f0f | 4806 | s->flags |= SLAB_TRACE; |
b789ef51 | 4807 | } |
81819f0f CL |
4808 | return length; |
4809 | } | |
4810 | SLAB_ATTR(trace); | |
4811 | ||
81819f0f CL |
4812 | static ssize_t red_zone_show(struct kmem_cache *s, char *buf) |
4813 | { | |
4814 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_RED_ZONE)); | |
4815 | } | |
4816 | ||
4817 | static ssize_t red_zone_store(struct kmem_cache *s, | |
4818 | const char *buf, size_t length) | |
4819 | { | |
4820 | if (any_slab_objects(s)) | |
4821 | return -EBUSY; | |
4822 | ||
4823 | s->flags &= ~SLAB_RED_ZONE; | |
b789ef51 CL |
4824 | if (buf[0] == '1') { |
4825 | s->flags &= ~__CMPXCHG_DOUBLE; | |
81819f0f | 4826 | s->flags |= SLAB_RED_ZONE; |
b789ef51 | 4827 | } |
06b285dc | 4828 | calculate_sizes(s, -1); |
81819f0f CL |
4829 | return length; |
4830 | } | |
4831 | SLAB_ATTR(red_zone); | |
4832 | ||
4833 | static ssize_t poison_show(struct kmem_cache *s, char *buf) | |
4834 | { | |
4835 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_POISON)); | |
4836 | } | |
4837 | ||
4838 | static ssize_t poison_store(struct kmem_cache *s, | |
4839 | const char *buf, size_t length) | |
4840 | { | |
4841 | if (any_slab_objects(s)) | |
4842 | return -EBUSY; | |
4843 | ||
4844 | s->flags &= ~SLAB_POISON; | |
b789ef51 CL |
4845 | if (buf[0] == '1') { |
4846 | s->flags &= ~__CMPXCHG_DOUBLE; | |
81819f0f | 4847 | s->flags |= SLAB_POISON; |
b789ef51 | 4848 | } |
06b285dc | 4849 | calculate_sizes(s, -1); |
81819f0f CL |
4850 | return length; |
4851 | } | |
4852 | SLAB_ATTR(poison); | |
4853 | ||
4854 | static ssize_t store_user_show(struct kmem_cache *s, char *buf) | |
4855 | { | |
4856 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_STORE_USER)); | |
4857 | } | |
4858 | ||
4859 | static ssize_t store_user_store(struct kmem_cache *s, | |
4860 | const char *buf, size_t length) | |
4861 | { | |
4862 | if (any_slab_objects(s)) | |
4863 | return -EBUSY; | |
4864 | ||
4865 | s->flags &= ~SLAB_STORE_USER; | |
b789ef51 CL |
4866 | if (buf[0] == '1') { |
4867 | s->flags &= ~__CMPXCHG_DOUBLE; | |
81819f0f | 4868 | s->flags |= SLAB_STORE_USER; |
b789ef51 | 4869 | } |
06b285dc | 4870 | calculate_sizes(s, -1); |
81819f0f CL |
4871 | return length; |
4872 | } | |
4873 | SLAB_ATTR(store_user); | |
4874 | ||
53e15af0 CL |
4875 | static ssize_t validate_show(struct kmem_cache *s, char *buf) |
4876 | { | |
4877 | return 0; | |
4878 | } | |
4879 | ||
4880 | static ssize_t validate_store(struct kmem_cache *s, | |
4881 | const char *buf, size_t length) | |
4882 | { | |
434e245d CL |
4883 | int ret = -EINVAL; |
4884 | ||
4885 | if (buf[0] == '1') { | |
4886 | ret = validate_slab_cache(s); | |
4887 | if (ret >= 0) | |
4888 | ret = length; | |
4889 | } | |
4890 | return ret; | |
53e15af0 CL |
4891 | } |
4892 | SLAB_ATTR(validate); | |
a5a84755 CL |
4893 | |
4894 | static ssize_t alloc_calls_show(struct kmem_cache *s, char *buf) | |
4895 | { | |
4896 | if (!(s->flags & SLAB_STORE_USER)) | |
4897 | return -ENOSYS; | |
4898 | return list_locations(s, buf, TRACK_ALLOC); | |
4899 | } | |
4900 | SLAB_ATTR_RO(alloc_calls); | |
4901 | ||
4902 | static ssize_t free_calls_show(struct kmem_cache *s, char *buf) | |
4903 | { | |
4904 | if (!(s->flags & SLAB_STORE_USER)) | |
4905 | return -ENOSYS; | |
4906 | return list_locations(s, buf, TRACK_FREE); | |
4907 | } | |
4908 | SLAB_ATTR_RO(free_calls); | |
4909 | #endif /* CONFIG_SLUB_DEBUG */ | |
4910 | ||
4911 | #ifdef CONFIG_FAILSLAB | |
4912 | static ssize_t failslab_show(struct kmem_cache *s, char *buf) | |
4913 | { | |
4914 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_FAILSLAB)); | |
4915 | } | |
4916 | ||
4917 | static ssize_t failslab_store(struct kmem_cache *s, const char *buf, | |
4918 | size_t length) | |
4919 | { | |
c9e16131 CL |
4920 | if (s->refcount > 1) |
4921 | return -EINVAL; | |
4922 | ||
a5a84755 CL |
4923 | s->flags &= ~SLAB_FAILSLAB; |
4924 | if (buf[0] == '1') | |
4925 | s->flags |= SLAB_FAILSLAB; | |
4926 | return length; | |
4927 | } | |
4928 | SLAB_ATTR(failslab); | |
ab4d5ed5 | 4929 | #endif |
53e15af0 | 4930 | |
2086d26a CL |
4931 | static ssize_t shrink_show(struct kmem_cache *s, char *buf) |
4932 | { | |
4933 | return 0; | |
4934 | } | |
4935 | ||
4936 | static ssize_t shrink_store(struct kmem_cache *s, | |
4937 | const char *buf, size_t length) | |
4938 | { | |
832f37f5 VD |
4939 | if (buf[0] == '1') |
4940 | kmem_cache_shrink(s); | |
4941 | else | |
2086d26a CL |
4942 | return -EINVAL; |
4943 | return length; | |
4944 | } | |
4945 | SLAB_ATTR(shrink); | |
4946 | ||
81819f0f | 4947 | #ifdef CONFIG_NUMA |
9824601e | 4948 | static ssize_t remote_node_defrag_ratio_show(struct kmem_cache *s, char *buf) |
81819f0f | 4949 | { |
9824601e | 4950 | return sprintf(buf, "%d\n", s->remote_node_defrag_ratio / 10); |
81819f0f CL |
4951 | } |
4952 | ||
9824601e | 4953 | static ssize_t remote_node_defrag_ratio_store(struct kmem_cache *s, |
81819f0f CL |
4954 | const char *buf, size_t length) |
4955 | { | |
0121c619 CL |
4956 | unsigned long ratio; |
4957 | int err; | |
4958 | ||
3dbb95f7 | 4959 | err = kstrtoul(buf, 10, &ratio); |
0121c619 CL |
4960 | if (err) |
4961 | return err; | |
4962 | ||
e2cb96b7 | 4963 | if (ratio <= 100) |
0121c619 | 4964 | s->remote_node_defrag_ratio = ratio * 10; |
81819f0f | 4965 | |
81819f0f CL |
4966 | return length; |
4967 | } | |
9824601e | 4968 | SLAB_ATTR(remote_node_defrag_ratio); |
81819f0f CL |
4969 | #endif |
4970 | ||
8ff12cfc | 4971 | #ifdef CONFIG_SLUB_STATS |
8ff12cfc CL |
4972 | static int show_stat(struct kmem_cache *s, char *buf, enum stat_item si) |
4973 | { | |
4974 | unsigned long sum = 0; | |
4975 | int cpu; | |
4976 | int len; | |
4977 | int *data = kmalloc(nr_cpu_ids * sizeof(int), GFP_KERNEL); | |
4978 | ||
4979 | if (!data) | |
4980 | return -ENOMEM; | |
4981 | ||
4982 | for_each_online_cpu(cpu) { | |
9dfc6e68 | 4983 | unsigned x = per_cpu_ptr(s->cpu_slab, cpu)->stat[si]; |
8ff12cfc CL |
4984 | |
4985 | data[cpu] = x; | |
4986 | sum += x; | |
4987 | } | |
4988 | ||
4989 | len = sprintf(buf, "%lu", sum); | |
4990 | ||
50ef37b9 | 4991 | #ifdef CONFIG_SMP |
8ff12cfc CL |
4992 | for_each_online_cpu(cpu) { |
4993 | if (data[cpu] && len < PAGE_SIZE - 20) | |
50ef37b9 | 4994 | len += sprintf(buf + len, " C%d=%u", cpu, data[cpu]); |
8ff12cfc | 4995 | } |
50ef37b9 | 4996 | #endif |
8ff12cfc CL |
4997 | kfree(data); |
4998 | return len + sprintf(buf + len, "\n"); | |
4999 | } | |
5000 | ||
78eb00cc DR |
5001 | static void clear_stat(struct kmem_cache *s, enum stat_item si) |
5002 | { | |
5003 | int cpu; | |
5004 | ||
5005 | for_each_online_cpu(cpu) | |
9dfc6e68 | 5006 | per_cpu_ptr(s->cpu_slab, cpu)->stat[si] = 0; |
78eb00cc DR |
5007 | } |
5008 | ||
8ff12cfc CL |
5009 | #define STAT_ATTR(si, text) \ |
5010 | static ssize_t text##_show(struct kmem_cache *s, char *buf) \ | |
5011 | { \ | |
5012 | return show_stat(s, buf, si); \ | |
5013 | } \ | |
78eb00cc DR |
5014 | static ssize_t text##_store(struct kmem_cache *s, \ |
5015 | const char *buf, size_t length) \ | |
5016 | { \ | |
5017 | if (buf[0] != '0') \ | |
5018 | return -EINVAL; \ | |
5019 | clear_stat(s, si); \ | |
5020 | return length; \ | |
5021 | } \ | |
5022 | SLAB_ATTR(text); \ | |
8ff12cfc CL |
5023 | |
5024 | STAT_ATTR(ALLOC_FASTPATH, alloc_fastpath); | |
5025 | STAT_ATTR(ALLOC_SLOWPATH, alloc_slowpath); | |
5026 | STAT_ATTR(FREE_FASTPATH, free_fastpath); | |
5027 | STAT_ATTR(FREE_SLOWPATH, free_slowpath); | |
5028 | STAT_ATTR(FREE_FROZEN, free_frozen); | |
5029 | STAT_ATTR(FREE_ADD_PARTIAL, free_add_partial); | |
5030 | STAT_ATTR(FREE_REMOVE_PARTIAL, free_remove_partial); | |
5031 | STAT_ATTR(ALLOC_FROM_PARTIAL, alloc_from_partial); | |
5032 | STAT_ATTR(ALLOC_SLAB, alloc_slab); | |
5033 | STAT_ATTR(ALLOC_REFILL, alloc_refill); | |
e36a2652 | 5034 | STAT_ATTR(ALLOC_NODE_MISMATCH, alloc_node_mismatch); |
8ff12cfc CL |
5035 | STAT_ATTR(FREE_SLAB, free_slab); |
5036 | STAT_ATTR(CPUSLAB_FLUSH, cpuslab_flush); | |
5037 | STAT_ATTR(DEACTIVATE_FULL, deactivate_full); | |
5038 | STAT_ATTR(DEACTIVATE_EMPTY, deactivate_empty); | |
5039 | STAT_ATTR(DEACTIVATE_TO_HEAD, deactivate_to_head); | |
5040 | STAT_ATTR(DEACTIVATE_TO_TAIL, deactivate_to_tail); | |
5041 | STAT_ATTR(DEACTIVATE_REMOTE_FREES, deactivate_remote_frees); | |
03e404af | 5042 | STAT_ATTR(DEACTIVATE_BYPASS, deactivate_bypass); |
65c3376a | 5043 | STAT_ATTR(ORDER_FALLBACK, order_fallback); |
b789ef51 CL |
5044 | STAT_ATTR(CMPXCHG_DOUBLE_CPU_FAIL, cmpxchg_double_cpu_fail); |
5045 | STAT_ATTR(CMPXCHG_DOUBLE_FAIL, cmpxchg_double_fail); | |
49e22585 CL |
5046 | STAT_ATTR(CPU_PARTIAL_ALLOC, cpu_partial_alloc); |
5047 | STAT_ATTR(CPU_PARTIAL_FREE, cpu_partial_free); | |
8028dcea AS |
5048 | STAT_ATTR(CPU_PARTIAL_NODE, cpu_partial_node); |
5049 | STAT_ATTR(CPU_PARTIAL_DRAIN, cpu_partial_drain); | |
8ff12cfc CL |
5050 | #endif |
5051 | ||
06428780 | 5052 | static struct attribute *slab_attrs[] = { |
81819f0f CL |
5053 | &slab_size_attr.attr, |
5054 | &object_size_attr.attr, | |
5055 | &objs_per_slab_attr.attr, | |
5056 | &order_attr.attr, | |
73d342b1 | 5057 | &min_partial_attr.attr, |
49e22585 | 5058 | &cpu_partial_attr.attr, |
81819f0f | 5059 | &objects_attr.attr, |
205ab99d | 5060 | &objects_partial_attr.attr, |
81819f0f CL |
5061 | &partial_attr.attr, |
5062 | &cpu_slabs_attr.attr, | |
5063 | &ctor_attr.attr, | |
81819f0f CL |
5064 | &aliases_attr.attr, |
5065 | &align_attr.attr, | |
81819f0f CL |
5066 | &hwcache_align_attr.attr, |
5067 | &reclaim_account_attr.attr, | |
5068 | &destroy_by_rcu_attr.attr, | |
a5a84755 | 5069 | &shrink_attr.attr, |
ab9a0f19 | 5070 | &reserved_attr.attr, |
49e22585 | 5071 | &slabs_cpu_partial_attr.attr, |
ab4d5ed5 | 5072 | #ifdef CONFIG_SLUB_DEBUG |
a5a84755 CL |
5073 | &total_objects_attr.attr, |
5074 | &slabs_attr.attr, | |
5075 | &sanity_checks_attr.attr, | |
5076 | &trace_attr.attr, | |
81819f0f CL |
5077 | &red_zone_attr.attr, |
5078 | &poison_attr.attr, | |
5079 | &store_user_attr.attr, | |
53e15af0 | 5080 | &validate_attr.attr, |
88a420e4 CL |
5081 | &alloc_calls_attr.attr, |
5082 | &free_calls_attr.attr, | |
ab4d5ed5 | 5083 | #endif |
81819f0f CL |
5084 | #ifdef CONFIG_ZONE_DMA |
5085 | &cache_dma_attr.attr, | |
5086 | #endif | |
5087 | #ifdef CONFIG_NUMA | |
9824601e | 5088 | &remote_node_defrag_ratio_attr.attr, |
8ff12cfc CL |
5089 | #endif |
5090 | #ifdef CONFIG_SLUB_STATS | |
5091 | &alloc_fastpath_attr.attr, | |
5092 | &alloc_slowpath_attr.attr, | |
5093 | &free_fastpath_attr.attr, | |
5094 | &free_slowpath_attr.attr, | |
5095 | &free_frozen_attr.attr, | |
5096 | &free_add_partial_attr.attr, | |
5097 | &free_remove_partial_attr.attr, | |
5098 | &alloc_from_partial_attr.attr, | |
5099 | &alloc_slab_attr.attr, | |
5100 | &alloc_refill_attr.attr, | |
e36a2652 | 5101 | &alloc_node_mismatch_attr.attr, |
8ff12cfc CL |
5102 | &free_slab_attr.attr, |
5103 | &cpuslab_flush_attr.attr, | |
5104 | &deactivate_full_attr.attr, | |
5105 | &deactivate_empty_attr.attr, | |
5106 | &deactivate_to_head_attr.attr, | |
5107 | &deactivate_to_tail_attr.attr, | |
5108 | &deactivate_remote_frees_attr.attr, | |
03e404af | 5109 | &deactivate_bypass_attr.attr, |
65c3376a | 5110 | &order_fallback_attr.attr, |
b789ef51 CL |
5111 | &cmpxchg_double_fail_attr.attr, |
5112 | &cmpxchg_double_cpu_fail_attr.attr, | |
49e22585 CL |
5113 | &cpu_partial_alloc_attr.attr, |
5114 | &cpu_partial_free_attr.attr, | |
8028dcea AS |
5115 | &cpu_partial_node_attr.attr, |
5116 | &cpu_partial_drain_attr.attr, | |
81819f0f | 5117 | #endif |
4c13dd3b DM |
5118 | #ifdef CONFIG_FAILSLAB |
5119 | &failslab_attr.attr, | |
5120 | #endif | |
5121 | ||
81819f0f CL |
5122 | NULL |
5123 | }; | |
5124 | ||
5125 | static struct attribute_group slab_attr_group = { | |
5126 | .attrs = slab_attrs, | |
5127 | }; | |
5128 | ||
5129 | static ssize_t slab_attr_show(struct kobject *kobj, | |
5130 | struct attribute *attr, | |
5131 | char *buf) | |
5132 | { | |
5133 | struct slab_attribute *attribute; | |
5134 | struct kmem_cache *s; | |
5135 | int err; | |
5136 | ||
5137 | attribute = to_slab_attr(attr); | |
5138 | s = to_slab(kobj); | |
5139 | ||
5140 | if (!attribute->show) | |
5141 | return -EIO; | |
5142 | ||
5143 | err = attribute->show(s, buf); | |
5144 | ||
5145 | return err; | |
5146 | } | |
5147 | ||
5148 | static ssize_t slab_attr_store(struct kobject *kobj, | |
5149 | struct attribute *attr, | |
5150 | const char *buf, size_t len) | |
5151 | { | |
5152 | struct slab_attribute *attribute; | |
5153 | struct kmem_cache *s; | |
5154 | int err; | |
5155 | ||
5156 | attribute = to_slab_attr(attr); | |
5157 | s = to_slab(kobj); | |
5158 | ||
5159 | if (!attribute->store) | |
5160 | return -EIO; | |
5161 | ||
5162 | err = attribute->store(s, buf, len); | |
127424c8 | 5163 | #ifdef CONFIG_MEMCG |
107dab5c | 5164 | if (slab_state >= FULL && err >= 0 && is_root_cache(s)) { |
426589f5 | 5165 | struct kmem_cache *c; |
81819f0f | 5166 | |
107dab5c GC |
5167 | mutex_lock(&slab_mutex); |
5168 | if (s->max_attr_size < len) | |
5169 | s->max_attr_size = len; | |
5170 | ||
ebe945c2 GC |
5171 | /* |
5172 | * This is a best effort propagation, so this function's return | |
5173 | * value will be determined by the parent cache only. This is | |
5174 | * basically because not all attributes will have a well | |
5175 | * defined semantics for rollbacks - most of the actions will | |
5176 | * have permanent effects. | |
5177 | * | |
5178 | * Returning the error value of any of the children that fail | |
5179 | * is not 100 % defined, in the sense that users seeing the | |
5180 | * error code won't be able to know anything about the state of | |
5181 | * the cache. | |
5182 | * | |
5183 | * Only returning the error code for the parent cache at least | |
5184 | * has well defined semantics. The cache being written to | |
5185 | * directly either failed or succeeded, in which case we loop | |
5186 | * through the descendants with best-effort propagation. | |
5187 | */ | |
426589f5 VD |
5188 | for_each_memcg_cache(c, s) |
5189 | attribute->store(c, buf, len); | |
107dab5c GC |
5190 | mutex_unlock(&slab_mutex); |
5191 | } | |
5192 | #endif | |
81819f0f CL |
5193 | return err; |
5194 | } | |
5195 | ||
107dab5c GC |
5196 | static void memcg_propagate_slab_attrs(struct kmem_cache *s) |
5197 | { | |
127424c8 | 5198 | #ifdef CONFIG_MEMCG |
107dab5c GC |
5199 | int i; |
5200 | char *buffer = NULL; | |
93030d83 | 5201 | struct kmem_cache *root_cache; |
107dab5c | 5202 | |
93030d83 | 5203 | if (is_root_cache(s)) |
107dab5c GC |
5204 | return; |
5205 | ||
f7ce3190 | 5206 | root_cache = s->memcg_params.root_cache; |
93030d83 | 5207 | |
107dab5c GC |
5208 | /* |
5209 | * This mean this cache had no attribute written. Therefore, no point | |
5210 | * in copying default values around | |
5211 | */ | |
93030d83 | 5212 | if (!root_cache->max_attr_size) |
107dab5c GC |
5213 | return; |
5214 | ||
5215 | for (i = 0; i < ARRAY_SIZE(slab_attrs); i++) { | |
5216 | char mbuf[64]; | |
5217 | char *buf; | |
5218 | struct slab_attribute *attr = to_slab_attr(slab_attrs[i]); | |
5219 | ||
5220 | if (!attr || !attr->store || !attr->show) | |
5221 | continue; | |
5222 | ||
5223 | /* | |
5224 | * It is really bad that we have to allocate here, so we will | |
5225 | * do it only as a fallback. If we actually allocate, though, | |
5226 | * we can just use the allocated buffer until the end. | |
5227 | * | |
5228 | * Most of the slub attributes will tend to be very small in | |
5229 | * size, but sysfs allows buffers up to a page, so they can | |
5230 | * theoretically happen. | |
5231 | */ | |
5232 | if (buffer) | |
5233 | buf = buffer; | |
93030d83 | 5234 | else if (root_cache->max_attr_size < ARRAY_SIZE(mbuf)) |
107dab5c GC |
5235 | buf = mbuf; |
5236 | else { | |
5237 | buffer = (char *) get_zeroed_page(GFP_KERNEL); | |
5238 | if (WARN_ON(!buffer)) | |
5239 | continue; | |
5240 | buf = buffer; | |
5241 | } | |
5242 | ||
93030d83 | 5243 | attr->show(root_cache, buf); |
107dab5c GC |
5244 | attr->store(s, buf, strlen(buf)); |
5245 | } | |
5246 | ||
5247 | if (buffer) | |
5248 | free_page((unsigned long)buffer); | |
5249 | #endif | |
5250 | } | |
5251 | ||
41a21285 CL |
5252 | static void kmem_cache_release(struct kobject *k) |
5253 | { | |
5254 | slab_kmem_cache_release(to_slab(k)); | |
5255 | } | |
5256 | ||
52cf25d0 | 5257 | static const struct sysfs_ops slab_sysfs_ops = { |
81819f0f CL |
5258 | .show = slab_attr_show, |
5259 | .store = slab_attr_store, | |
5260 | }; | |
5261 | ||
5262 | static struct kobj_type slab_ktype = { | |
5263 | .sysfs_ops = &slab_sysfs_ops, | |
41a21285 | 5264 | .release = kmem_cache_release, |
81819f0f CL |
5265 | }; |
5266 | ||
5267 | static int uevent_filter(struct kset *kset, struct kobject *kobj) | |
5268 | { | |
5269 | struct kobj_type *ktype = get_ktype(kobj); | |
5270 | ||
5271 | if (ktype == &slab_ktype) | |
5272 | return 1; | |
5273 | return 0; | |
5274 | } | |
5275 | ||
9cd43611 | 5276 | static const struct kset_uevent_ops slab_uevent_ops = { |
81819f0f CL |
5277 | .filter = uevent_filter, |
5278 | }; | |
5279 | ||
27c3a314 | 5280 | static struct kset *slab_kset; |
81819f0f | 5281 | |
9a41707b VD |
5282 | static inline struct kset *cache_kset(struct kmem_cache *s) |
5283 | { | |
127424c8 | 5284 | #ifdef CONFIG_MEMCG |
9a41707b | 5285 | if (!is_root_cache(s)) |
f7ce3190 | 5286 | return s->memcg_params.root_cache->memcg_kset; |
9a41707b VD |
5287 | #endif |
5288 | return slab_kset; | |
5289 | } | |
5290 | ||
81819f0f CL |
5291 | #define ID_STR_LENGTH 64 |
5292 | ||
5293 | /* Create a unique string id for a slab cache: | |
6446faa2 CL |
5294 | * |
5295 | * Format :[flags-]size | |
81819f0f CL |
5296 | */ |
5297 | static char *create_unique_id(struct kmem_cache *s) | |
5298 | { | |
5299 | char *name = kmalloc(ID_STR_LENGTH, GFP_KERNEL); | |
5300 | char *p = name; | |
5301 | ||
5302 | BUG_ON(!name); | |
5303 | ||
5304 | *p++ = ':'; | |
5305 | /* | |
5306 | * First flags affecting slabcache operations. We will only | |
5307 | * get here for aliasable slabs so we do not need to support | |
5308 | * too many flags. The flags here must cover all flags that | |
5309 | * are matched during merging to guarantee that the id is | |
5310 | * unique. | |
5311 | */ | |
5312 | if (s->flags & SLAB_CACHE_DMA) | |
5313 | *p++ = 'd'; | |
5314 | if (s->flags & SLAB_RECLAIM_ACCOUNT) | |
5315 | *p++ = 'a'; | |
5316 | if (s->flags & SLAB_DEBUG_FREE) | |
5317 | *p++ = 'F'; | |
5a896d9e VN |
5318 | if (!(s->flags & SLAB_NOTRACK)) |
5319 | *p++ = 't'; | |
230e9fc2 VD |
5320 | if (s->flags & SLAB_ACCOUNT) |
5321 | *p++ = 'A'; | |
81819f0f CL |
5322 | if (p != name + 1) |
5323 | *p++ = '-'; | |
5324 | p += sprintf(p, "%07d", s->size); | |
2633d7a0 | 5325 | |
81819f0f CL |
5326 | BUG_ON(p > name + ID_STR_LENGTH - 1); |
5327 | return name; | |
5328 | } | |
5329 | ||
5330 | static int sysfs_slab_add(struct kmem_cache *s) | |
5331 | { | |
5332 | int err; | |
5333 | const char *name; | |
45530c44 | 5334 | int unmergeable = slab_unmergeable(s); |
81819f0f | 5335 | |
81819f0f CL |
5336 | if (unmergeable) { |
5337 | /* | |
5338 | * Slabcache can never be merged so we can use the name proper. | |
5339 | * This is typically the case for debug situations. In that | |
5340 | * case we can catch duplicate names easily. | |
5341 | */ | |
27c3a314 | 5342 | sysfs_remove_link(&slab_kset->kobj, s->name); |
81819f0f CL |
5343 | name = s->name; |
5344 | } else { | |
5345 | /* | |
5346 | * Create a unique name for the slab as a target | |
5347 | * for the symlinks. | |
5348 | */ | |
5349 | name = create_unique_id(s); | |
5350 | } | |
5351 | ||
9a41707b | 5352 | s->kobj.kset = cache_kset(s); |
26e4f205 | 5353 | err = kobject_init_and_add(&s->kobj, &slab_ktype, NULL, "%s", name); |
54b6a731 | 5354 | if (err) |
80da026a | 5355 | goto out; |
81819f0f CL |
5356 | |
5357 | err = sysfs_create_group(&s->kobj, &slab_attr_group); | |
54b6a731 DJ |
5358 | if (err) |
5359 | goto out_del_kobj; | |
9a41707b | 5360 | |
127424c8 | 5361 | #ifdef CONFIG_MEMCG |
9a41707b VD |
5362 | if (is_root_cache(s)) { |
5363 | s->memcg_kset = kset_create_and_add("cgroup", NULL, &s->kobj); | |
5364 | if (!s->memcg_kset) { | |
54b6a731 DJ |
5365 | err = -ENOMEM; |
5366 | goto out_del_kobj; | |
9a41707b VD |
5367 | } |
5368 | } | |
5369 | #endif | |
5370 | ||
81819f0f CL |
5371 | kobject_uevent(&s->kobj, KOBJ_ADD); |
5372 | if (!unmergeable) { | |
5373 | /* Setup first alias */ | |
5374 | sysfs_slab_alias(s, s->name); | |
81819f0f | 5375 | } |
54b6a731 DJ |
5376 | out: |
5377 | if (!unmergeable) | |
5378 | kfree(name); | |
5379 | return err; | |
5380 | out_del_kobj: | |
5381 | kobject_del(&s->kobj); | |
54b6a731 | 5382 | goto out; |
81819f0f CL |
5383 | } |
5384 | ||
41a21285 | 5385 | void sysfs_slab_remove(struct kmem_cache *s) |
81819f0f | 5386 | { |
97d06609 | 5387 | if (slab_state < FULL) |
2bce6485 CL |
5388 | /* |
5389 | * Sysfs has not been setup yet so no need to remove the | |
5390 | * cache from sysfs. | |
5391 | */ | |
5392 | return; | |
5393 | ||
127424c8 | 5394 | #ifdef CONFIG_MEMCG |
9a41707b VD |
5395 | kset_unregister(s->memcg_kset); |
5396 | #endif | |
81819f0f CL |
5397 | kobject_uevent(&s->kobj, KOBJ_REMOVE); |
5398 | kobject_del(&s->kobj); | |
151c602f | 5399 | kobject_put(&s->kobj); |
81819f0f CL |
5400 | } |
5401 | ||
5402 | /* | |
5403 | * Need to buffer aliases during bootup until sysfs becomes | |
9f6c708e | 5404 | * available lest we lose that information. |
81819f0f CL |
5405 | */ |
5406 | struct saved_alias { | |
5407 | struct kmem_cache *s; | |
5408 | const char *name; | |
5409 | struct saved_alias *next; | |
5410 | }; | |
5411 | ||
5af328a5 | 5412 | static struct saved_alias *alias_list; |
81819f0f CL |
5413 | |
5414 | static int sysfs_slab_alias(struct kmem_cache *s, const char *name) | |
5415 | { | |
5416 | struct saved_alias *al; | |
5417 | ||
97d06609 | 5418 | if (slab_state == FULL) { |
81819f0f CL |
5419 | /* |
5420 | * If we have a leftover link then remove it. | |
5421 | */ | |
27c3a314 GKH |
5422 | sysfs_remove_link(&slab_kset->kobj, name); |
5423 | return sysfs_create_link(&slab_kset->kobj, &s->kobj, name); | |
81819f0f CL |
5424 | } |
5425 | ||
5426 | al = kmalloc(sizeof(struct saved_alias), GFP_KERNEL); | |
5427 | if (!al) | |
5428 | return -ENOMEM; | |
5429 | ||
5430 | al->s = s; | |
5431 | al->name = name; | |
5432 | al->next = alias_list; | |
5433 | alias_list = al; | |
5434 | return 0; | |
5435 | } | |
5436 | ||
5437 | static int __init slab_sysfs_init(void) | |
5438 | { | |
5b95a4ac | 5439 | struct kmem_cache *s; |
81819f0f CL |
5440 | int err; |
5441 | ||
18004c5d | 5442 | mutex_lock(&slab_mutex); |
2bce6485 | 5443 | |
0ff21e46 | 5444 | slab_kset = kset_create_and_add("slab", &slab_uevent_ops, kernel_kobj); |
27c3a314 | 5445 | if (!slab_kset) { |
18004c5d | 5446 | mutex_unlock(&slab_mutex); |
f9f58285 | 5447 | pr_err("Cannot register slab subsystem.\n"); |
81819f0f CL |
5448 | return -ENOSYS; |
5449 | } | |
5450 | ||
97d06609 | 5451 | slab_state = FULL; |
26a7bd03 | 5452 | |
5b95a4ac | 5453 | list_for_each_entry(s, &slab_caches, list) { |
26a7bd03 | 5454 | err = sysfs_slab_add(s); |
5d540fb7 | 5455 | if (err) |
f9f58285 FF |
5456 | pr_err("SLUB: Unable to add boot slab %s to sysfs\n", |
5457 | s->name); | |
26a7bd03 | 5458 | } |
81819f0f CL |
5459 | |
5460 | while (alias_list) { | |
5461 | struct saved_alias *al = alias_list; | |
5462 | ||
5463 | alias_list = alias_list->next; | |
5464 | err = sysfs_slab_alias(al->s, al->name); | |
5d540fb7 | 5465 | if (err) |
f9f58285 FF |
5466 | pr_err("SLUB: Unable to add boot slab alias %s to sysfs\n", |
5467 | al->name); | |
81819f0f CL |
5468 | kfree(al); |
5469 | } | |
5470 | ||
18004c5d | 5471 | mutex_unlock(&slab_mutex); |
81819f0f CL |
5472 | resiliency_test(); |
5473 | return 0; | |
5474 | } | |
5475 | ||
5476 | __initcall(slab_sysfs_init); | |
ab4d5ed5 | 5477 | #endif /* CONFIG_SYSFS */ |
57ed3eda PE |
5478 | |
5479 | /* | |
5480 | * The /proc/slabinfo ABI | |
5481 | */ | |
158a9624 | 5482 | #ifdef CONFIG_SLABINFO |
0d7561c6 | 5483 | void get_slabinfo(struct kmem_cache *s, struct slabinfo *sinfo) |
57ed3eda | 5484 | { |
57ed3eda | 5485 | unsigned long nr_slabs = 0; |
205ab99d CL |
5486 | unsigned long nr_objs = 0; |
5487 | unsigned long nr_free = 0; | |
57ed3eda | 5488 | int node; |
fa45dc25 | 5489 | struct kmem_cache_node *n; |
57ed3eda | 5490 | |
fa45dc25 | 5491 | for_each_kmem_cache_node(s, node, n) { |
c17fd13e WL |
5492 | nr_slabs += node_nr_slabs(n); |
5493 | nr_objs += node_nr_objs(n); | |
205ab99d | 5494 | nr_free += count_partial(n, count_free); |
57ed3eda PE |
5495 | } |
5496 | ||
0d7561c6 GC |
5497 | sinfo->active_objs = nr_objs - nr_free; |
5498 | sinfo->num_objs = nr_objs; | |
5499 | sinfo->active_slabs = nr_slabs; | |
5500 | sinfo->num_slabs = nr_slabs; | |
5501 | sinfo->objects_per_slab = oo_objects(s->oo); | |
5502 | sinfo->cache_order = oo_order(s->oo); | |
57ed3eda PE |
5503 | } |
5504 | ||
0d7561c6 | 5505 | void slabinfo_show_stats(struct seq_file *m, struct kmem_cache *s) |
7b3c3a50 | 5506 | { |
7b3c3a50 AD |
5507 | } |
5508 | ||
b7454ad3 GC |
5509 | ssize_t slabinfo_write(struct file *file, const char __user *buffer, |
5510 | size_t count, loff_t *ppos) | |
7b3c3a50 | 5511 | { |
b7454ad3 | 5512 | return -EIO; |
7b3c3a50 | 5513 | } |
158a9624 | 5514 | #endif /* CONFIG_SLABINFO */ |