]>
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 | * | |
5 | * The allocator synchronizes using per slab locks and only | |
6 | * uses a centralized lock to manage a pool of partial slabs. | |
7 | * | |
cde53535 | 8 | * (C) 2007 SGI, Christoph Lameter |
81819f0f CL |
9 | */ |
10 | ||
11 | #include <linux/mm.h> | |
1eb5ac64 | 12 | #include <linux/swap.h> /* struct reclaim_state */ |
81819f0f CL |
13 | #include <linux/module.h> |
14 | #include <linux/bit_spinlock.h> | |
15 | #include <linux/interrupt.h> | |
16 | #include <linux/bitops.h> | |
17 | #include <linux/slab.h> | |
7b3c3a50 | 18 | #include <linux/proc_fs.h> |
81819f0f | 19 | #include <linux/seq_file.h> |
5a896d9e | 20 | #include <linux/kmemcheck.h> |
81819f0f CL |
21 | #include <linux/cpu.h> |
22 | #include <linux/cpuset.h> | |
23 | #include <linux/mempolicy.h> | |
24 | #include <linux/ctype.h> | |
3ac7fe5a | 25 | #include <linux/debugobjects.h> |
81819f0f | 26 | #include <linux/kallsyms.h> |
b9049e23 | 27 | #include <linux/memory.h> |
f8bd2258 | 28 | #include <linux/math64.h> |
773ff60e | 29 | #include <linux/fault-inject.h> |
81819f0f CL |
30 | |
31 | /* | |
32 | * Lock order: | |
33 | * 1. slab_lock(page) | |
34 | * 2. slab->list_lock | |
35 | * | |
36 | * The slab_lock protects operations on the object of a particular | |
37 | * slab and its metadata in the page struct. If the slab lock | |
38 | * has been taken then no allocations nor frees can be performed | |
39 | * on the objects in the slab nor can the slab be added or removed | |
40 | * from the partial or full lists since this would mean modifying | |
41 | * the page_struct of the slab. | |
42 | * | |
43 | * The list_lock protects the partial and full list on each node and | |
44 | * the partial slab counter. If taken then no new slabs may be added or | |
45 | * removed from the lists nor make the number of partial slabs be modified. | |
46 | * (Note that the total number of slabs is an atomic value that may be | |
47 | * modified without taking the list lock). | |
48 | * | |
49 | * The list_lock is a centralized lock and thus we avoid taking it as | |
50 | * much as possible. As long as SLUB does not have to handle partial | |
51 | * slabs, operations can continue without any centralized lock. F.e. | |
52 | * allocating a long series of objects that fill up slabs does not require | |
53 | * the list lock. | |
54 | * | |
55 | * The lock order is sometimes inverted when we are trying to get a slab | |
56 | * off a list. We take the list_lock and then look for a page on the list | |
57 | * to use. While we do that objects in the slabs may be freed. We can | |
58 | * only operate on the slab if we have also taken the slab_lock. So we use | |
59 | * a slab_trylock() on the slab. If trylock was successful then no frees | |
60 | * can occur anymore and we can use the slab for allocations etc. If the | |
61 | * slab_trylock() does not succeed then frees are in progress in the slab and | |
62 | * we must stay away from it for a while since we may cause a bouncing | |
63 | * cacheline if we try to acquire the lock. So go onto the next slab. | |
64 | * If all pages are busy then we may allocate a new slab instead of reusing | |
65 | * a partial slab. A new slab has noone operating on it and thus there is | |
66 | * no danger of cacheline contention. | |
67 | * | |
68 | * Interrupts are disabled during allocation and deallocation in order to | |
69 | * make the slab allocator safe to use in the context of an irq. In addition | |
70 | * interrupts are disabled to ensure that the processor does not change | |
71 | * while handling per_cpu slabs, due to kernel preemption. | |
72 | * | |
73 | * SLUB assigns one slab for allocation to each processor. | |
74 | * Allocations only occur from these slabs called cpu slabs. | |
75 | * | |
672bba3a CL |
76 | * Slabs with free elements are kept on a partial list and during regular |
77 | * operations no list for full slabs is used. If an object in a full slab is | |
81819f0f | 78 | * freed then the slab will show up again on the partial lists. |
672bba3a CL |
79 | * We track full slabs for debugging purposes though because otherwise we |
80 | * cannot scan all objects. | |
81819f0f CL |
81 | * |
82 | * Slabs are freed when they become empty. Teardown and setup is | |
83 | * minimal so we rely on the page allocators per cpu caches for | |
84 | * fast frees and allocs. | |
85 | * | |
86 | * Overloading of page flags that are otherwise used for LRU management. | |
87 | * | |
4b6f0750 CL |
88 | * PageActive The slab is frozen and exempt from list processing. |
89 | * This means that the slab is dedicated to a purpose | |
90 | * such as satisfying allocations for a specific | |
91 | * processor. Objects may be freed in the slab while | |
92 | * it is frozen but slab_free will then skip the usual | |
93 | * list operations. It is up to the processor holding | |
94 | * the slab to integrate the slab into the slab lists | |
95 | * when the slab is no longer needed. | |
96 | * | |
97 | * One use of this flag is to mark slabs that are | |
98 | * used for allocations. Then such a slab becomes a cpu | |
99 | * slab. The cpu slab may be equipped with an additional | |
dfb4f096 | 100 | * freelist that allows lockless access to |
894b8788 CL |
101 | * free objects in addition to the regular freelist |
102 | * that requires the slab lock. | |
81819f0f CL |
103 | * |
104 | * PageError Slab requires special handling due to debug | |
105 | * options set. This moves slab handling out of | |
894b8788 | 106 | * the fast path and disables lockless freelists. |
81819f0f CL |
107 | */ |
108 | ||
af537b0a CL |
109 | #define SLAB_DEBUG_FLAGS (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER | \ |
110 | SLAB_TRACE | SLAB_DEBUG_FREE) | |
111 | ||
112 | static inline int kmem_cache_debug(struct kmem_cache *s) | |
113 | { | |
5577bd8a | 114 | #ifdef CONFIG_SLUB_DEBUG |
af537b0a | 115 | return unlikely(s->flags & SLAB_DEBUG_FLAGS); |
5577bd8a | 116 | #else |
af537b0a | 117 | return 0; |
5577bd8a | 118 | #endif |
af537b0a | 119 | } |
5577bd8a | 120 | |
81819f0f CL |
121 | /* |
122 | * Issues still to be resolved: | |
123 | * | |
81819f0f CL |
124 | * - Support PAGE_ALLOC_DEBUG. Should be easy to do. |
125 | * | |
81819f0f CL |
126 | * - Variable sizing of the per node arrays |
127 | */ | |
128 | ||
129 | /* Enable to test recovery from slab corruption on boot */ | |
130 | #undef SLUB_RESILIENCY_TEST | |
131 | ||
2086d26a CL |
132 | /* |
133 | * Mininum number of partial slabs. These will be left on the partial | |
134 | * lists even if they are empty. kmem_cache_shrink may reclaim them. | |
135 | */ | |
76be8950 | 136 | #define MIN_PARTIAL 5 |
e95eed57 | 137 | |
2086d26a CL |
138 | /* |
139 | * Maximum number of desirable partial slabs. | |
140 | * The existence of more partial slabs makes kmem_cache_shrink | |
141 | * sort the partial list by the number of objects in the. | |
142 | */ | |
143 | #define MAX_PARTIAL 10 | |
144 | ||
81819f0f CL |
145 | #define DEBUG_DEFAULT_FLAGS (SLAB_DEBUG_FREE | SLAB_RED_ZONE | \ |
146 | SLAB_POISON | SLAB_STORE_USER) | |
672bba3a | 147 | |
fa5ec8a1 | 148 | /* |
3de47213 DR |
149 | * Debugging flags that require metadata to be stored in the slab. These get |
150 | * disabled when slub_debug=O is used and a cache's min order increases with | |
151 | * metadata. | |
fa5ec8a1 | 152 | */ |
3de47213 | 153 | #define DEBUG_METADATA_FLAGS (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER) |
fa5ec8a1 | 154 | |
81819f0f CL |
155 | /* |
156 | * Set of flags that will prevent slab merging | |
157 | */ | |
158 | #define SLUB_NEVER_MERGE (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER | \ | |
4c13dd3b DM |
159 | SLAB_TRACE | SLAB_DESTROY_BY_RCU | SLAB_NOLEAKTRACE | \ |
160 | SLAB_FAILSLAB) | |
81819f0f CL |
161 | |
162 | #define SLUB_MERGE_SAME (SLAB_DEBUG_FREE | SLAB_RECLAIM_ACCOUNT | \ | |
5a896d9e | 163 | SLAB_CACHE_DMA | SLAB_NOTRACK) |
81819f0f | 164 | |
210b5c06 CG |
165 | #define OO_SHIFT 16 |
166 | #define OO_MASK ((1 << OO_SHIFT) - 1) | |
167 | #define MAX_OBJS_PER_PAGE 65535 /* since page.objects is u16 */ | |
168 | ||
81819f0f | 169 | /* Internal SLUB flags */ |
f90ec390 | 170 | #define __OBJECT_POISON 0x80000000UL /* Poison object */ |
81819f0f CL |
171 | |
172 | static int kmem_size = sizeof(struct kmem_cache); | |
173 | ||
174 | #ifdef CONFIG_SMP | |
175 | static struct notifier_block slab_notifier; | |
176 | #endif | |
177 | ||
178 | static enum { | |
179 | DOWN, /* No slab functionality available */ | |
51df1142 | 180 | PARTIAL, /* Kmem_cache_node works */ |
672bba3a | 181 | UP, /* Everything works but does not show up in sysfs */ |
81819f0f CL |
182 | SYSFS /* Sysfs up */ |
183 | } slab_state = DOWN; | |
184 | ||
185 | /* A list of all slab caches on the system */ | |
186 | static DECLARE_RWSEM(slub_lock); | |
5af328a5 | 187 | static LIST_HEAD(slab_caches); |
81819f0f | 188 | |
02cbc874 CL |
189 | /* |
190 | * Tracking user of a slab. | |
191 | */ | |
192 | struct track { | |
ce71e27c | 193 | unsigned long addr; /* Called from address */ |
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 | ||
f6acb635 | 201 | #ifdef CONFIG_SLUB_DEBUG |
81819f0f CL |
202 | static int sysfs_slab_add(struct kmem_cache *); |
203 | static int sysfs_slab_alias(struct kmem_cache *, const char *); | |
204 | static void sysfs_slab_remove(struct kmem_cache *); | |
8ff12cfc | 205 | |
81819f0f | 206 | #else |
0c710013 CL |
207 | static inline int sysfs_slab_add(struct kmem_cache *s) { return 0; } |
208 | static inline int sysfs_slab_alias(struct kmem_cache *s, const char *p) | |
209 | { return 0; } | |
151c602f CL |
210 | static inline void sysfs_slab_remove(struct kmem_cache *s) |
211 | { | |
212 | kfree(s); | |
213 | } | |
8ff12cfc | 214 | |
81819f0f CL |
215 | #endif |
216 | ||
84e554e6 | 217 | static inline void stat(struct kmem_cache *s, enum stat_item si) |
8ff12cfc CL |
218 | { |
219 | #ifdef CONFIG_SLUB_STATS | |
84e554e6 | 220 | __this_cpu_inc(s->cpu_slab->stat[si]); |
8ff12cfc CL |
221 | #endif |
222 | } | |
223 | ||
81819f0f CL |
224 | /******************************************************************** |
225 | * Core slab cache functions | |
226 | *******************************************************************/ | |
227 | ||
228 | int slab_is_available(void) | |
229 | { | |
230 | return slab_state >= UP; | |
231 | } | |
232 | ||
233 | static inline struct kmem_cache_node *get_node(struct kmem_cache *s, int node) | |
234 | { | |
235 | #ifdef CONFIG_NUMA | |
236 | return s->node[node]; | |
237 | #else | |
238 | return &s->local_node; | |
239 | #endif | |
240 | } | |
241 | ||
6446faa2 | 242 | /* Verify that a pointer has an address that is valid within a slab page */ |
02cbc874 CL |
243 | static inline int check_valid_pointer(struct kmem_cache *s, |
244 | struct page *page, const void *object) | |
245 | { | |
246 | void *base; | |
247 | ||
a973e9dd | 248 | if (!object) |
02cbc874 CL |
249 | return 1; |
250 | ||
a973e9dd | 251 | base = page_address(page); |
39b26464 | 252 | if (object < base || object >= base + page->objects * s->size || |
02cbc874 CL |
253 | (object - base) % s->size) { |
254 | return 0; | |
255 | } | |
256 | ||
257 | return 1; | |
258 | } | |
259 | ||
7656c72b CL |
260 | static inline void *get_freepointer(struct kmem_cache *s, void *object) |
261 | { | |
262 | return *(void **)(object + s->offset); | |
263 | } | |
264 | ||
265 | static inline void set_freepointer(struct kmem_cache *s, void *object, void *fp) | |
266 | { | |
267 | *(void **)(object + s->offset) = fp; | |
268 | } | |
269 | ||
270 | /* Loop over all objects in a slab */ | |
224a88be CL |
271 | #define for_each_object(__p, __s, __addr, __objects) \ |
272 | for (__p = (__addr); __p < (__addr) + (__objects) * (__s)->size;\ | |
7656c72b CL |
273 | __p += (__s)->size) |
274 | ||
275 | /* Scan freelist */ | |
276 | #define for_each_free_object(__p, __s, __free) \ | |
a973e9dd | 277 | for (__p = (__free); __p; __p = get_freepointer((__s), __p)) |
7656c72b CL |
278 | |
279 | /* Determine object index from a given position */ | |
280 | static inline int slab_index(void *p, struct kmem_cache *s, void *addr) | |
281 | { | |
282 | return (p - addr) / s->size; | |
283 | } | |
284 | ||
834f3d11 CL |
285 | static inline struct kmem_cache_order_objects oo_make(int order, |
286 | unsigned long size) | |
287 | { | |
288 | struct kmem_cache_order_objects x = { | |
210b5c06 | 289 | (order << OO_SHIFT) + (PAGE_SIZE << order) / size |
834f3d11 CL |
290 | }; |
291 | ||
292 | return x; | |
293 | } | |
294 | ||
295 | static inline int oo_order(struct kmem_cache_order_objects x) | |
296 | { | |
210b5c06 | 297 | return x.x >> OO_SHIFT; |
834f3d11 CL |
298 | } |
299 | ||
300 | static inline int oo_objects(struct kmem_cache_order_objects x) | |
301 | { | |
210b5c06 | 302 | return x.x & OO_MASK; |
834f3d11 CL |
303 | } |
304 | ||
41ecc55b CL |
305 | #ifdef CONFIG_SLUB_DEBUG |
306 | /* | |
307 | * Debug settings: | |
308 | */ | |
f0630fff CL |
309 | #ifdef CONFIG_SLUB_DEBUG_ON |
310 | static int slub_debug = DEBUG_DEFAULT_FLAGS; | |
311 | #else | |
41ecc55b | 312 | static int slub_debug; |
f0630fff | 313 | #endif |
41ecc55b CL |
314 | |
315 | static char *slub_debug_slabs; | |
fa5ec8a1 | 316 | static int disable_higher_order_debug; |
41ecc55b | 317 | |
81819f0f CL |
318 | /* |
319 | * Object debugging | |
320 | */ | |
321 | static void print_section(char *text, u8 *addr, unsigned int length) | |
322 | { | |
323 | int i, offset; | |
324 | int newline = 1; | |
325 | char ascii[17]; | |
326 | ||
327 | ascii[16] = 0; | |
328 | ||
329 | for (i = 0; i < length; i++) { | |
330 | if (newline) { | |
24922684 | 331 | printk(KERN_ERR "%8s 0x%p: ", text, addr + i); |
81819f0f CL |
332 | newline = 0; |
333 | } | |
06428780 | 334 | printk(KERN_CONT " %02x", addr[i]); |
81819f0f CL |
335 | offset = i % 16; |
336 | ascii[offset] = isgraph(addr[i]) ? addr[i] : '.'; | |
337 | if (offset == 15) { | |
06428780 | 338 | printk(KERN_CONT " %s\n", ascii); |
81819f0f CL |
339 | newline = 1; |
340 | } | |
341 | } | |
342 | if (!newline) { | |
343 | i %= 16; | |
344 | while (i < 16) { | |
06428780 | 345 | printk(KERN_CONT " "); |
81819f0f CL |
346 | ascii[i] = ' '; |
347 | i++; | |
348 | } | |
06428780 | 349 | printk(KERN_CONT " %s\n", ascii); |
81819f0f CL |
350 | } |
351 | } | |
352 | ||
81819f0f CL |
353 | static struct track *get_track(struct kmem_cache *s, void *object, |
354 | enum track_item alloc) | |
355 | { | |
356 | struct track *p; | |
357 | ||
358 | if (s->offset) | |
359 | p = object + s->offset + sizeof(void *); | |
360 | else | |
361 | p = object + s->inuse; | |
362 | ||
363 | return p + alloc; | |
364 | } | |
365 | ||
366 | static void set_track(struct kmem_cache *s, void *object, | |
ce71e27c | 367 | enum track_item alloc, unsigned long addr) |
81819f0f | 368 | { |
1a00df4a | 369 | struct track *p = get_track(s, object, alloc); |
81819f0f | 370 | |
81819f0f CL |
371 | if (addr) { |
372 | p->addr = addr; | |
373 | p->cpu = smp_processor_id(); | |
88e4ccf2 | 374 | p->pid = current->pid; |
81819f0f CL |
375 | p->when = jiffies; |
376 | } else | |
377 | memset(p, 0, sizeof(struct track)); | |
378 | } | |
379 | ||
81819f0f CL |
380 | static void init_tracking(struct kmem_cache *s, void *object) |
381 | { | |
24922684 CL |
382 | if (!(s->flags & SLAB_STORE_USER)) |
383 | return; | |
384 | ||
ce71e27c EGM |
385 | set_track(s, object, TRACK_FREE, 0UL); |
386 | set_track(s, object, TRACK_ALLOC, 0UL); | |
81819f0f CL |
387 | } |
388 | ||
389 | static void print_track(const char *s, struct track *t) | |
390 | { | |
391 | if (!t->addr) | |
392 | return; | |
393 | ||
7daf705f | 394 | printk(KERN_ERR "INFO: %s in %pS age=%lu cpu=%u pid=%d\n", |
ce71e27c | 395 | s, (void *)t->addr, jiffies - t->when, t->cpu, t->pid); |
24922684 CL |
396 | } |
397 | ||
398 | static void print_tracking(struct kmem_cache *s, void *object) | |
399 | { | |
400 | if (!(s->flags & SLAB_STORE_USER)) | |
401 | return; | |
402 | ||
403 | print_track("Allocated", get_track(s, object, TRACK_ALLOC)); | |
404 | print_track("Freed", get_track(s, object, TRACK_FREE)); | |
405 | } | |
406 | ||
407 | static void print_page_info(struct page *page) | |
408 | { | |
39b26464 CL |
409 | printk(KERN_ERR "INFO: Slab 0x%p objects=%u used=%u fp=0x%p flags=0x%04lx\n", |
410 | page, page->objects, page->inuse, page->freelist, page->flags); | |
24922684 CL |
411 | |
412 | } | |
413 | ||
414 | static void slab_bug(struct kmem_cache *s, char *fmt, ...) | |
415 | { | |
416 | va_list args; | |
417 | char buf[100]; | |
418 | ||
419 | va_start(args, fmt); | |
420 | vsnprintf(buf, sizeof(buf), fmt, args); | |
421 | va_end(args); | |
422 | printk(KERN_ERR "========================================" | |
423 | "=====================================\n"); | |
424 | printk(KERN_ERR "BUG %s: %s\n", s->name, buf); | |
425 | printk(KERN_ERR "----------------------------------------" | |
426 | "-------------------------------------\n\n"); | |
81819f0f CL |
427 | } |
428 | ||
24922684 CL |
429 | static void slab_fix(struct kmem_cache *s, char *fmt, ...) |
430 | { | |
431 | va_list args; | |
432 | char buf[100]; | |
433 | ||
434 | va_start(args, fmt); | |
435 | vsnprintf(buf, sizeof(buf), fmt, args); | |
436 | va_end(args); | |
437 | printk(KERN_ERR "FIX %s: %s\n", s->name, buf); | |
438 | } | |
439 | ||
440 | static void print_trailer(struct kmem_cache *s, struct page *page, u8 *p) | |
81819f0f CL |
441 | { |
442 | unsigned int off; /* Offset of last byte */ | |
a973e9dd | 443 | u8 *addr = page_address(page); |
24922684 CL |
444 | |
445 | print_tracking(s, p); | |
446 | ||
447 | print_page_info(page); | |
448 | ||
449 | printk(KERN_ERR "INFO: Object 0x%p @offset=%tu fp=0x%p\n\n", | |
450 | p, p - addr, get_freepointer(s, p)); | |
451 | ||
452 | if (p > addr + 16) | |
453 | print_section("Bytes b4", p - 16, 16); | |
454 | ||
0ebd652b | 455 | print_section("Object", p, min_t(unsigned long, s->objsize, PAGE_SIZE)); |
81819f0f CL |
456 | |
457 | if (s->flags & SLAB_RED_ZONE) | |
458 | print_section("Redzone", p + s->objsize, | |
459 | s->inuse - s->objsize); | |
460 | ||
81819f0f CL |
461 | if (s->offset) |
462 | off = s->offset + sizeof(void *); | |
463 | else | |
464 | off = s->inuse; | |
465 | ||
24922684 | 466 | if (s->flags & SLAB_STORE_USER) |
81819f0f | 467 | off += 2 * sizeof(struct track); |
81819f0f CL |
468 | |
469 | if (off != s->size) | |
470 | /* Beginning of the filler is the free pointer */ | |
24922684 CL |
471 | print_section("Padding", p + off, s->size - off); |
472 | ||
473 | dump_stack(); | |
81819f0f CL |
474 | } |
475 | ||
476 | static void object_err(struct kmem_cache *s, struct page *page, | |
477 | u8 *object, char *reason) | |
478 | { | |
3dc50637 | 479 | slab_bug(s, "%s", reason); |
24922684 | 480 | print_trailer(s, page, object); |
81819f0f CL |
481 | } |
482 | ||
24922684 | 483 | static void slab_err(struct kmem_cache *s, struct page *page, char *fmt, ...) |
81819f0f CL |
484 | { |
485 | va_list args; | |
486 | char buf[100]; | |
487 | ||
24922684 CL |
488 | va_start(args, fmt); |
489 | vsnprintf(buf, sizeof(buf), fmt, args); | |
81819f0f | 490 | va_end(args); |
3dc50637 | 491 | slab_bug(s, "%s", buf); |
24922684 | 492 | print_page_info(page); |
81819f0f CL |
493 | dump_stack(); |
494 | } | |
495 | ||
496 | static void init_object(struct kmem_cache *s, void *object, int active) | |
497 | { | |
498 | u8 *p = object; | |
499 | ||
500 | if (s->flags & __OBJECT_POISON) { | |
501 | memset(p, POISON_FREE, s->objsize - 1); | |
06428780 | 502 | p[s->objsize - 1] = POISON_END; |
81819f0f CL |
503 | } |
504 | ||
505 | if (s->flags & SLAB_RED_ZONE) | |
506 | memset(p + s->objsize, | |
507 | active ? SLUB_RED_ACTIVE : SLUB_RED_INACTIVE, | |
508 | s->inuse - s->objsize); | |
509 | } | |
510 | ||
24922684 | 511 | static u8 *check_bytes(u8 *start, unsigned int value, unsigned int bytes) |
81819f0f CL |
512 | { |
513 | while (bytes) { | |
514 | if (*start != (u8)value) | |
24922684 | 515 | return start; |
81819f0f CL |
516 | start++; |
517 | bytes--; | |
518 | } | |
24922684 CL |
519 | return NULL; |
520 | } | |
521 | ||
522 | static void restore_bytes(struct kmem_cache *s, char *message, u8 data, | |
523 | void *from, void *to) | |
524 | { | |
525 | slab_fix(s, "Restoring 0x%p-0x%p=0x%x\n", from, to - 1, data); | |
526 | memset(from, data, to - from); | |
527 | } | |
528 | ||
529 | static int check_bytes_and_report(struct kmem_cache *s, struct page *page, | |
530 | u8 *object, char *what, | |
06428780 | 531 | u8 *start, unsigned int value, unsigned int bytes) |
24922684 CL |
532 | { |
533 | u8 *fault; | |
534 | u8 *end; | |
535 | ||
536 | fault = check_bytes(start, value, bytes); | |
537 | if (!fault) | |
538 | return 1; | |
539 | ||
540 | end = start + bytes; | |
541 | while (end > fault && end[-1] == value) | |
542 | end--; | |
543 | ||
544 | slab_bug(s, "%s overwritten", what); | |
545 | printk(KERN_ERR "INFO: 0x%p-0x%p. First byte 0x%x instead of 0x%x\n", | |
546 | fault, end - 1, fault[0], value); | |
547 | print_trailer(s, page, object); | |
548 | ||
549 | restore_bytes(s, what, value, fault, end); | |
550 | return 0; | |
81819f0f CL |
551 | } |
552 | ||
81819f0f CL |
553 | /* |
554 | * Object layout: | |
555 | * | |
556 | * object address | |
557 | * Bytes of the object to be managed. | |
558 | * If the freepointer may overlay the object then the free | |
559 | * pointer is the first word of the object. | |
672bba3a | 560 | * |
81819f0f CL |
561 | * Poisoning uses 0x6b (POISON_FREE) and the last byte is |
562 | * 0xa5 (POISON_END) | |
563 | * | |
564 | * object + s->objsize | |
565 | * Padding to reach word boundary. This is also used for Redzoning. | |
672bba3a CL |
566 | * Padding is extended by another word if Redzoning is enabled and |
567 | * objsize == inuse. | |
568 | * | |
81819f0f CL |
569 | * We fill with 0xbb (RED_INACTIVE) for inactive objects and with |
570 | * 0xcc (RED_ACTIVE) for objects in use. | |
571 | * | |
572 | * object + s->inuse | |
672bba3a CL |
573 | * Meta data starts here. |
574 | * | |
81819f0f CL |
575 | * A. Free pointer (if we cannot overwrite object on free) |
576 | * B. Tracking data for SLAB_STORE_USER | |
672bba3a | 577 | * C. Padding to reach required alignment boundary or at mininum |
6446faa2 | 578 | * one word if debugging is on to be able to detect writes |
672bba3a CL |
579 | * before the word boundary. |
580 | * | |
581 | * Padding is done using 0x5a (POISON_INUSE) | |
81819f0f CL |
582 | * |
583 | * object + s->size | |
672bba3a | 584 | * Nothing is used beyond s->size. |
81819f0f | 585 | * |
672bba3a CL |
586 | * If slabcaches are merged then the objsize and inuse boundaries are mostly |
587 | * ignored. And therefore no slab options that rely on these boundaries | |
81819f0f CL |
588 | * may be used with merged slabcaches. |
589 | */ | |
590 | ||
81819f0f CL |
591 | static int check_pad_bytes(struct kmem_cache *s, struct page *page, u8 *p) |
592 | { | |
593 | unsigned long off = s->inuse; /* The end of info */ | |
594 | ||
595 | if (s->offset) | |
596 | /* Freepointer is placed after the object. */ | |
597 | off += sizeof(void *); | |
598 | ||
599 | if (s->flags & SLAB_STORE_USER) | |
600 | /* We also have user information there */ | |
601 | off += 2 * sizeof(struct track); | |
602 | ||
603 | if (s->size == off) | |
604 | return 1; | |
605 | ||
24922684 CL |
606 | return check_bytes_and_report(s, page, p, "Object padding", |
607 | p + off, POISON_INUSE, s->size - off); | |
81819f0f CL |
608 | } |
609 | ||
39b26464 | 610 | /* Check the pad bytes at the end of a slab page */ |
81819f0f CL |
611 | static int slab_pad_check(struct kmem_cache *s, struct page *page) |
612 | { | |
24922684 CL |
613 | u8 *start; |
614 | u8 *fault; | |
615 | u8 *end; | |
616 | int length; | |
617 | int remainder; | |
81819f0f CL |
618 | |
619 | if (!(s->flags & SLAB_POISON)) | |
620 | return 1; | |
621 | ||
a973e9dd | 622 | start = page_address(page); |
834f3d11 | 623 | length = (PAGE_SIZE << compound_order(page)); |
39b26464 CL |
624 | end = start + length; |
625 | remainder = length % s->size; | |
81819f0f CL |
626 | if (!remainder) |
627 | return 1; | |
628 | ||
39b26464 | 629 | fault = check_bytes(end - remainder, POISON_INUSE, remainder); |
24922684 CL |
630 | if (!fault) |
631 | return 1; | |
632 | while (end > fault && end[-1] == POISON_INUSE) | |
633 | end--; | |
634 | ||
635 | slab_err(s, page, "Padding overwritten. 0x%p-0x%p", fault, end - 1); | |
39b26464 | 636 | print_section("Padding", end - remainder, remainder); |
24922684 | 637 | |
8a3d271d | 638 | restore_bytes(s, "slab padding", POISON_INUSE, end - remainder, end); |
24922684 | 639 | return 0; |
81819f0f CL |
640 | } |
641 | ||
642 | static int check_object(struct kmem_cache *s, struct page *page, | |
643 | void *object, int active) | |
644 | { | |
645 | u8 *p = object; | |
646 | u8 *endobject = object + s->objsize; | |
647 | ||
648 | if (s->flags & SLAB_RED_ZONE) { | |
649 | unsigned int red = | |
650 | active ? SLUB_RED_ACTIVE : SLUB_RED_INACTIVE; | |
651 | ||
24922684 CL |
652 | if (!check_bytes_and_report(s, page, object, "Redzone", |
653 | endobject, red, s->inuse - s->objsize)) | |
81819f0f | 654 | return 0; |
81819f0f | 655 | } else { |
3adbefee IM |
656 | if ((s->flags & SLAB_POISON) && s->objsize < s->inuse) { |
657 | check_bytes_and_report(s, page, p, "Alignment padding", | |
658 | endobject, POISON_INUSE, s->inuse - s->objsize); | |
659 | } | |
81819f0f CL |
660 | } |
661 | ||
662 | if (s->flags & SLAB_POISON) { | |
663 | if (!active && (s->flags & __OBJECT_POISON) && | |
24922684 CL |
664 | (!check_bytes_and_report(s, page, p, "Poison", p, |
665 | POISON_FREE, s->objsize - 1) || | |
666 | !check_bytes_and_report(s, page, p, "Poison", | |
06428780 | 667 | p + s->objsize - 1, POISON_END, 1))) |
81819f0f | 668 | return 0; |
81819f0f CL |
669 | /* |
670 | * check_pad_bytes cleans up on its own. | |
671 | */ | |
672 | check_pad_bytes(s, page, p); | |
673 | } | |
674 | ||
675 | if (!s->offset && active) | |
676 | /* | |
677 | * Object and freepointer overlap. Cannot check | |
678 | * freepointer while object is allocated. | |
679 | */ | |
680 | return 1; | |
681 | ||
682 | /* Check free pointer validity */ | |
683 | if (!check_valid_pointer(s, page, get_freepointer(s, p))) { | |
684 | object_err(s, page, p, "Freepointer corrupt"); | |
685 | /* | |
9f6c708e | 686 | * No choice but to zap it and thus lose the remainder |
81819f0f | 687 | * of the free objects in this slab. May cause |
672bba3a | 688 | * another error because the object count is now wrong. |
81819f0f | 689 | */ |
a973e9dd | 690 | set_freepointer(s, p, NULL); |
81819f0f CL |
691 | return 0; |
692 | } | |
693 | return 1; | |
694 | } | |
695 | ||
696 | static int check_slab(struct kmem_cache *s, struct page *page) | |
697 | { | |
39b26464 CL |
698 | int maxobj; |
699 | ||
81819f0f CL |
700 | VM_BUG_ON(!irqs_disabled()); |
701 | ||
702 | if (!PageSlab(page)) { | |
24922684 | 703 | slab_err(s, page, "Not a valid slab page"); |
81819f0f CL |
704 | return 0; |
705 | } | |
39b26464 CL |
706 | |
707 | maxobj = (PAGE_SIZE << compound_order(page)) / s->size; | |
708 | if (page->objects > maxobj) { | |
709 | slab_err(s, page, "objects %u > max %u", | |
710 | s->name, page->objects, maxobj); | |
711 | return 0; | |
712 | } | |
713 | if (page->inuse > page->objects) { | |
24922684 | 714 | slab_err(s, page, "inuse %u > max %u", |
39b26464 | 715 | s->name, page->inuse, page->objects); |
81819f0f CL |
716 | return 0; |
717 | } | |
718 | /* Slab_pad_check fixes things up after itself */ | |
719 | slab_pad_check(s, page); | |
720 | return 1; | |
721 | } | |
722 | ||
723 | /* | |
672bba3a CL |
724 | * Determine if a certain object on a page is on the freelist. Must hold the |
725 | * slab lock to guarantee that the chains are in a consistent state. | |
81819f0f CL |
726 | */ |
727 | static int on_freelist(struct kmem_cache *s, struct page *page, void *search) | |
728 | { | |
729 | int nr = 0; | |
730 | void *fp = page->freelist; | |
731 | void *object = NULL; | |
224a88be | 732 | unsigned long max_objects; |
81819f0f | 733 | |
39b26464 | 734 | while (fp && nr <= page->objects) { |
81819f0f CL |
735 | if (fp == search) |
736 | return 1; | |
737 | if (!check_valid_pointer(s, page, fp)) { | |
738 | if (object) { | |
739 | object_err(s, page, object, | |
740 | "Freechain corrupt"); | |
a973e9dd | 741 | set_freepointer(s, object, NULL); |
81819f0f CL |
742 | break; |
743 | } else { | |
24922684 | 744 | slab_err(s, page, "Freepointer corrupt"); |
a973e9dd | 745 | page->freelist = NULL; |
39b26464 | 746 | page->inuse = page->objects; |
24922684 | 747 | slab_fix(s, "Freelist cleared"); |
81819f0f CL |
748 | return 0; |
749 | } | |
750 | break; | |
751 | } | |
752 | object = fp; | |
753 | fp = get_freepointer(s, object); | |
754 | nr++; | |
755 | } | |
756 | ||
224a88be | 757 | max_objects = (PAGE_SIZE << compound_order(page)) / s->size; |
210b5c06 CG |
758 | if (max_objects > MAX_OBJS_PER_PAGE) |
759 | max_objects = MAX_OBJS_PER_PAGE; | |
224a88be CL |
760 | |
761 | if (page->objects != max_objects) { | |
762 | slab_err(s, page, "Wrong number of objects. Found %d but " | |
763 | "should be %d", page->objects, max_objects); | |
764 | page->objects = max_objects; | |
765 | slab_fix(s, "Number of objects adjusted."); | |
766 | } | |
39b26464 | 767 | if (page->inuse != page->objects - nr) { |
70d71228 | 768 | slab_err(s, page, "Wrong object count. Counter is %d but " |
39b26464 CL |
769 | "counted were %d", page->inuse, page->objects - nr); |
770 | page->inuse = page->objects - nr; | |
24922684 | 771 | slab_fix(s, "Object count adjusted."); |
81819f0f CL |
772 | } |
773 | return search == NULL; | |
774 | } | |
775 | ||
0121c619 CL |
776 | static void trace(struct kmem_cache *s, struct page *page, void *object, |
777 | int alloc) | |
3ec09742 CL |
778 | { |
779 | if (s->flags & SLAB_TRACE) { | |
780 | printk(KERN_INFO "TRACE %s %s 0x%p inuse=%d fp=0x%p\n", | |
781 | s->name, | |
782 | alloc ? "alloc" : "free", | |
783 | object, page->inuse, | |
784 | page->freelist); | |
785 | ||
786 | if (!alloc) | |
787 | print_section("Object", (void *)object, s->objsize); | |
788 | ||
789 | dump_stack(); | |
790 | } | |
791 | } | |
792 | ||
c016b0bd CL |
793 | /* |
794 | * Hooks for other subsystems that check memory allocations. In a typical | |
795 | * production configuration these hooks all should produce no code at all. | |
796 | */ | |
797 | static inline int slab_pre_alloc_hook(struct kmem_cache *s, gfp_t flags) | |
798 | { | |
799 | lockdep_trace_alloc(flags); | |
800 | might_sleep_if(flags & __GFP_WAIT); | |
801 | ||
802 | return should_failslab(s->objsize, flags, s->flags); | |
803 | } | |
804 | ||
805 | static inline void slab_post_alloc_hook(struct kmem_cache *s, gfp_t flags, void *object) | |
806 | { | |
807 | kmemcheck_slab_alloc(s, flags, object, s->objsize); | |
808 | kmemleak_alloc_recursive(object, s->objsize, 1, s->flags, flags); | |
809 | } | |
810 | ||
811 | static inline void slab_free_hook(struct kmem_cache *s, void *x) | |
812 | { | |
813 | kmemleak_free_recursive(x, s->flags); | |
814 | } | |
815 | ||
816 | static inline void slab_free_hook_irq(struct kmem_cache *s, void *object) | |
817 | { | |
818 | kmemcheck_slab_free(s, object, s->objsize); | |
819 | debug_check_no_locks_freed(object, s->objsize); | |
820 | if (!(s->flags & SLAB_DEBUG_OBJECTS)) | |
821 | debug_check_no_obj_freed(object, s->objsize); | |
822 | } | |
823 | ||
643b1138 | 824 | /* |
672bba3a | 825 | * Tracking of fully allocated slabs for debugging purposes. |
643b1138 | 826 | */ |
e95eed57 | 827 | static void add_full(struct kmem_cache_node *n, struct page *page) |
643b1138 | 828 | { |
643b1138 CL |
829 | spin_lock(&n->list_lock); |
830 | list_add(&page->lru, &n->full); | |
831 | spin_unlock(&n->list_lock); | |
832 | } | |
833 | ||
834 | static void remove_full(struct kmem_cache *s, struct page *page) | |
835 | { | |
836 | struct kmem_cache_node *n; | |
837 | ||
838 | if (!(s->flags & SLAB_STORE_USER)) | |
839 | return; | |
840 | ||
841 | n = get_node(s, page_to_nid(page)); | |
842 | ||
843 | spin_lock(&n->list_lock); | |
844 | list_del(&page->lru); | |
845 | spin_unlock(&n->list_lock); | |
846 | } | |
847 | ||
0f389ec6 CL |
848 | /* Tracking of the number of slabs for debugging purposes */ |
849 | static inline unsigned long slabs_node(struct kmem_cache *s, int node) | |
850 | { | |
851 | struct kmem_cache_node *n = get_node(s, node); | |
852 | ||
853 | return atomic_long_read(&n->nr_slabs); | |
854 | } | |
855 | ||
26c02cf0 AB |
856 | static inline unsigned long node_nr_slabs(struct kmem_cache_node *n) |
857 | { | |
858 | return atomic_long_read(&n->nr_slabs); | |
859 | } | |
860 | ||
205ab99d | 861 | static inline void inc_slabs_node(struct kmem_cache *s, int node, int objects) |
0f389ec6 CL |
862 | { |
863 | struct kmem_cache_node *n = get_node(s, node); | |
864 | ||
865 | /* | |
866 | * May be called early in order to allocate a slab for the | |
867 | * kmem_cache_node structure. Solve the chicken-egg | |
868 | * dilemma by deferring the increment of the count during | |
869 | * bootstrap (see early_kmem_cache_node_alloc). | |
870 | */ | |
205ab99d | 871 | if (!NUMA_BUILD || n) { |
0f389ec6 | 872 | atomic_long_inc(&n->nr_slabs); |
205ab99d CL |
873 | atomic_long_add(objects, &n->total_objects); |
874 | } | |
0f389ec6 | 875 | } |
205ab99d | 876 | static inline void dec_slabs_node(struct kmem_cache *s, int node, int objects) |
0f389ec6 CL |
877 | { |
878 | struct kmem_cache_node *n = get_node(s, node); | |
879 | ||
880 | atomic_long_dec(&n->nr_slabs); | |
205ab99d | 881 | atomic_long_sub(objects, &n->total_objects); |
0f389ec6 CL |
882 | } |
883 | ||
884 | /* Object debug checks for alloc/free paths */ | |
3ec09742 CL |
885 | static void setup_object_debug(struct kmem_cache *s, struct page *page, |
886 | void *object) | |
887 | { | |
888 | if (!(s->flags & (SLAB_STORE_USER|SLAB_RED_ZONE|__OBJECT_POISON))) | |
889 | return; | |
890 | ||
891 | init_object(s, object, 0); | |
892 | init_tracking(s, object); | |
893 | } | |
894 | ||
1537066c | 895 | static noinline int alloc_debug_processing(struct kmem_cache *s, struct page *page, |
ce71e27c | 896 | void *object, unsigned long addr) |
81819f0f CL |
897 | { |
898 | if (!check_slab(s, page)) | |
899 | goto bad; | |
900 | ||
d692ef6d | 901 | if (!on_freelist(s, page, object)) { |
24922684 | 902 | object_err(s, page, object, "Object already allocated"); |
70d71228 | 903 | goto bad; |
81819f0f CL |
904 | } |
905 | ||
906 | if (!check_valid_pointer(s, page, object)) { | |
907 | object_err(s, page, object, "Freelist Pointer check fails"); | |
70d71228 | 908 | goto bad; |
81819f0f CL |
909 | } |
910 | ||
d692ef6d | 911 | if (!check_object(s, page, object, 0)) |
81819f0f | 912 | goto bad; |
81819f0f | 913 | |
3ec09742 CL |
914 | /* Success perform special debug activities for allocs */ |
915 | if (s->flags & SLAB_STORE_USER) | |
916 | set_track(s, object, TRACK_ALLOC, addr); | |
917 | trace(s, page, object, 1); | |
918 | init_object(s, object, 1); | |
81819f0f | 919 | return 1; |
3ec09742 | 920 | |
81819f0f CL |
921 | bad: |
922 | if (PageSlab(page)) { | |
923 | /* | |
924 | * If this is a slab page then lets do the best we can | |
925 | * to avoid issues in the future. Marking all objects | |
672bba3a | 926 | * as used avoids touching the remaining objects. |
81819f0f | 927 | */ |
24922684 | 928 | slab_fix(s, "Marking all objects used"); |
39b26464 | 929 | page->inuse = page->objects; |
a973e9dd | 930 | page->freelist = NULL; |
81819f0f CL |
931 | } |
932 | return 0; | |
933 | } | |
934 | ||
1537066c CL |
935 | static noinline int free_debug_processing(struct kmem_cache *s, |
936 | struct page *page, void *object, unsigned long addr) | |
81819f0f CL |
937 | { |
938 | if (!check_slab(s, page)) | |
939 | goto fail; | |
940 | ||
941 | if (!check_valid_pointer(s, page, object)) { | |
70d71228 | 942 | slab_err(s, page, "Invalid object pointer 0x%p", object); |
81819f0f CL |
943 | goto fail; |
944 | } | |
945 | ||
946 | if (on_freelist(s, page, object)) { | |
24922684 | 947 | object_err(s, page, object, "Object already free"); |
81819f0f CL |
948 | goto fail; |
949 | } | |
950 | ||
951 | if (!check_object(s, page, object, 1)) | |
952 | return 0; | |
953 | ||
954 | if (unlikely(s != page->slab)) { | |
3adbefee | 955 | if (!PageSlab(page)) { |
70d71228 CL |
956 | slab_err(s, page, "Attempt to free object(0x%p) " |
957 | "outside of slab", object); | |
3adbefee | 958 | } else if (!page->slab) { |
81819f0f | 959 | printk(KERN_ERR |
70d71228 | 960 | "SLUB <none>: no slab for object 0x%p.\n", |
81819f0f | 961 | object); |
70d71228 | 962 | dump_stack(); |
06428780 | 963 | } else |
24922684 CL |
964 | object_err(s, page, object, |
965 | "page slab pointer corrupt."); | |
81819f0f CL |
966 | goto fail; |
967 | } | |
3ec09742 CL |
968 | |
969 | /* Special debug activities for freeing objects */ | |
8a38082d | 970 | if (!PageSlubFrozen(page) && !page->freelist) |
3ec09742 CL |
971 | remove_full(s, page); |
972 | if (s->flags & SLAB_STORE_USER) | |
973 | set_track(s, object, TRACK_FREE, addr); | |
974 | trace(s, page, object, 0); | |
975 | init_object(s, object, 0); | |
81819f0f | 976 | return 1; |
3ec09742 | 977 | |
81819f0f | 978 | fail: |
24922684 | 979 | slab_fix(s, "Object at 0x%p not freed", object); |
81819f0f CL |
980 | return 0; |
981 | } | |
982 | ||
41ecc55b CL |
983 | static int __init setup_slub_debug(char *str) |
984 | { | |
f0630fff CL |
985 | slub_debug = DEBUG_DEFAULT_FLAGS; |
986 | if (*str++ != '=' || !*str) | |
987 | /* | |
988 | * No options specified. Switch on full debugging. | |
989 | */ | |
990 | goto out; | |
991 | ||
992 | if (*str == ',') | |
993 | /* | |
994 | * No options but restriction on slabs. This means full | |
995 | * debugging for slabs matching a pattern. | |
996 | */ | |
997 | goto check_slabs; | |
998 | ||
fa5ec8a1 DR |
999 | if (tolower(*str) == 'o') { |
1000 | /* | |
1001 | * Avoid enabling debugging on caches if its minimum order | |
1002 | * would increase as a result. | |
1003 | */ | |
1004 | disable_higher_order_debug = 1; | |
1005 | goto out; | |
1006 | } | |
1007 | ||
f0630fff CL |
1008 | slub_debug = 0; |
1009 | if (*str == '-') | |
1010 | /* | |
1011 | * Switch off all debugging measures. | |
1012 | */ | |
1013 | goto out; | |
1014 | ||
1015 | /* | |
1016 | * Determine which debug features should be switched on | |
1017 | */ | |
06428780 | 1018 | for (; *str && *str != ','; str++) { |
f0630fff CL |
1019 | switch (tolower(*str)) { |
1020 | case 'f': | |
1021 | slub_debug |= SLAB_DEBUG_FREE; | |
1022 | break; | |
1023 | case 'z': | |
1024 | slub_debug |= SLAB_RED_ZONE; | |
1025 | break; | |
1026 | case 'p': | |
1027 | slub_debug |= SLAB_POISON; | |
1028 | break; | |
1029 | case 'u': | |
1030 | slub_debug |= SLAB_STORE_USER; | |
1031 | break; | |
1032 | case 't': | |
1033 | slub_debug |= SLAB_TRACE; | |
1034 | break; | |
4c13dd3b DM |
1035 | case 'a': |
1036 | slub_debug |= SLAB_FAILSLAB; | |
1037 | break; | |
f0630fff CL |
1038 | default: |
1039 | printk(KERN_ERR "slub_debug option '%c' " | |
06428780 | 1040 | "unknown. skipped\n", *str); |
f0630fff | 1041 | } |
41ecc55b CL |
1042 | } |
1043 | ||
f0630fff | 1044 | check_slabs: |
41ecc55b CL |
1045 | if (*str == ',') |
1046 | slub_debug_slabs = str + 1; | |
f0630fff | 1047 | out: |
41ecc55b CL |
1048 | return 1; |
1049 | } | |
1050 | ||
1051 | __setup("slub_debug", setup_slub_debug); | |
1052 | ||
ba0268a8 CL |
1053 | static unsigned long kmem_cache_flags(unsigned long objsize, |
1054 | unsigned long flags, const char *name, | |
51cc5068 | 1055 | void (*ctor)(void *)) |
41ecc55b CL |
1056 | { |
1057 | /* | |
e153362a | 1058 | * Enable debugging if selected on the kernel commandline. |
41ecc55b | 1059 | */ |
e153362a | 1060 | if (slub_debug && (!slub_debug_slabs || |
3de47213 DR |
1061 | !strncmp(slub_debug_slabs, name, strlen(slub_debug_slabs)))) |
1062 | flags |= slub_debug; | |
ba0268a8 CL |
1063 | |
1064 | return flags; | |
41ecc55b CL |
1065 | } |
1066 | #else | |
3ec09742 CL |
1067 | static inline void setup_object_debug(struct kmem_cache *s, |
1068 | struct page *page, void *object) {} | |
41ecc55b | 1069 | |
3ec09742 | 1070 | static inline int alloc_debug_processing(struct kmem_cache *s, |
ce71e27c | 1071 | struct page *page, void *object, unsigned long addr) { return 0; } |
41ecc55b | 1072 | |
3ec09742 | 1073 | static inline int free_debug_processing(struct kmem_cache *s, |
ce71e27c | 1074 | struct page *page, void *object, unsigned long addr) { return 0; } |
41ecc55b | 1075 | |
41ecc55b CL |
1076 | static inline int slab_pad_check(struct kmem_cache *s, struct page *page) |
1077 | { return 1; } | |
1078 | static inline int check_object(struct kmem_cache *s, struct page *page, | |
1079 | void *object, int active) { return 1; } | |
3ec09742 | 1080 | static inline void add_full(struct kmem_cache_node *n, struct page *page) {} |
ba0268a8 CL |
1081 | static inline unsigned long kmem_cache_flags(unsigned long objsize, |
1082 | unsigned long flags, const char *name, | |
51cc5068 | 1083 | void (*ctor)(void *)) |
ba0268a8 CL |
1084 | { |
1085 | return flags; | |
1086 | } | |
41ecc55b | 1087 | #define slub_debug 0 |
0f389ec6 | 1088 | |
fdaa45e9 IM |
1089 | #define disable_higher_order_debug 0 |
1090 | ||
0f389ec6 CL |
1091 | static inline unsigned long slabs_node(struct kmem_cache *s, int node) |
1092 | { return 0; } | |
26c02cf0 AB |
1093 | static inline unsigned long node_nr_slabs(struct kmem_cache_node *n) |
1094 | { return 0; } | |
205ab99d CL |
1095 | static inline void inc_slabs_node(struct kmem_cache *s, int node, |
1096 | int objects) {} | |
1097 | static inline void dec_slabs_node(struct kmem_cache *s, int node, | |
1098 | int objects) {} | |
41ecc55b | 1099 | #endif |
205ab99d | 1100 | |
81819f0f CL |
1101 | /* |
1102 | * Slab allocation and freeing | |
1103 | */ | |
65c3376a CL |
1104 | static inline struct page *alloc_slab_page(gfp_t flags, int node, |
1105 | struct kmem_cache_order_objects oo) | |
1106 | { | |
1107 | int order = oo_order(oo); | |
1108 | ||
b1eeab67 VN |
1109 | flags |= __GFP_NOTRACK; |
1110 | ||
2154a336 | 1111 | if (node == NUMA_NO_NODE) |
65c3376a CL |
1112 | return alloc_pages(flags, order); |
1113 | else | |
6b65aaf3 | 1114 | return alloc_pages_exact_node(node, flags, order); |
65c3376a CL |
1115 | } |
1116 | ||
81819f0f CL |
1117 | static struct page *allocate_slab(struct kmem_cache *s, gfp_t flags, int node) |
1118 | { | |
06428780 | 1119 | struct page *page; |
834f3d11 | 1120 | struct kmem_cache_order_objects oo = s->oo; |
ba52270d | 1121 | gfp_t alloc_gfp; |
81819f0f | 1122 | |
b7a49f0d | 1123 | flags |= s->allocflags; |
e12ba74d | 1124 | |
ba52270d PE |
1125 | /* |
1126 | * Let the initial higher-order allocation fail under memory pressure | |
1127 | * so we fall-back to the minimum order allocation. | |
1128 | */ | |
1129 | alloc_gfp = (flags | __GFP_NOWARN | __GFP_NORETRY) & ~__GFP_NOFAIL; | |
1130 | ||
1131 | page = alloc_slab_page(alloc_gfp, node, oo); | |
65c3376a CL |
1132 | if (unlikely(!page)) { |
1133 | oo = s->min; | |
1134 | /* | |
1135 | * Allocation may have failed due to fragmentation. | |
1136 | * Try a lower order alloc if possible | |
1137 | */ | |
1138 | page = alloc_slab_page(flags, node, oo); | |
1139 | if (!page) | |
1140 | return NULL; | |
81819f0f | 1141 | |
84e554e6 | 1142 | stat(s, ORDER_FALLBACK); |
65c3376a | 1143 | } |
5a896d9e VN |
1144 | |
1145 | if (kmemcheck_enabled | |
5086c389 | 1146 | && !(s->flags & (SLAB_NOTRACK | DEBUG_DEFAULT_FLAGS))) { |
b1eeab67 VN |
1147 | int pages = 1 << oo_order(oo); |
1148 | ||
1149 | kmemcheck_alloc_shadow(page, oo_order(oo), flags, node); | |
1150 | ||
1151 | /* | |
1152 | * Objects from caches that have a constructor don't get | |
1153 | * cleared when they're allocated, so we need to do it here. | |
1154 | */ | |
1155 | if (s->ctor) | |
1156 | kmemcheck_mark_uninitialized_pages(page, pages); | |
1157 | else | |
1158 | kmemcheck_mark_unallocated_pages(page, pages); | |
5a896d9e VN |
1159 | } |
1160 | ||
834f3d11 | 1161 | page->objects = oo_objects(oo); |
81819f0f CL |
1162 | mod_zone_page_state(page_zone(page), |
1163 | (s->flags & SLAB_RECLAIM_ACCOUNT) ? | |
1164 | NR_SLAB_RECLAIMABLE : NR_SLAB_UNRECLAIMABLE, | |
65c3376a | 1165 | 1 << oo_order(oo)); |
81819f0f CL |
1166 | |
1167 | return page; | |
1168 | } | |
1169 | ||
1170 | static void setup_object(struct kmem_cache *s, struct page *page, | |
1171 | void *object) | |
1172 | { | |
3ec09742 | 1173 | setup_object_debug(s, page, object); |
4f104934 | 1174 | if (unlikely(s->ctor)) |
51cc5068 | 1175 | s->ctor(object); |
81819f0f CL |
1176 | } |
1177 | ||
1178 | static struct page *new_slab(struct kmem_cache *s, gfp_t flags, int node) | |
1179 | { | |
1180 | struct page *page; | |
81819f0f | 1181 | void *start; |
81819f0f CL |
1182 | void *last; |
1183 | void *p; | |
1184 | ||
6cb06229 | 1185 | BUG_ON(flags & GFP_SLAB_BUG_MASK); |
81819f0f | 1186 | |
6cb06229 CL |
1187 | page = allocate_slab(s, |
1188 | flags & (GFP_RECLAIM_MASK | GFP_CONSTRAINT_MASK), node); | |
81819f0f CL |
1189 | if (!page) |
1190 | goto out; | |
1191 | ||
205ab99d | 1192 | inc_slabs_node(s, page_to_nid(page), page->objects); |
81819f0f CL |
1193 | page->slab = s; |
1194 | page->flags |= 1 << PG_slab; | |
81819f0f CL |
1195 | |
1196 | start = page_address(page); | |
81819f0f CL |
1197 | |
1198 | if (unlikely(s->flags & SLAB_POISON)) | |
834f3d11 | 1199 | memset(start, POISON_INUSE, PAGE_SIZE << compound_order(page)); |
81819f0f CL |
1200 | |
1201 | last = start; | |
224a88be | 1202 | for_each_object(p, s, start, page->objects) { |
81819f0f CL |
1203 | setup_object(s, page, last); |
1204 | set_freepointer(s, last, p); | |
1205 | last = p; | |
1206 | } | |
1207 | setup_object(s, page, last); | |
a973e9dd | 1208 | set_freepointer(s, last, NULL); |
81819f0f CL |
1209 | |
1210 | page->freelist = start; | |
1211 | page->inuse = 0; | |
1212 | out: | |
81819f0f CL |
1213 | return page; |
1214 | } | |
1215 | ||
1216 | static void __free_slab(struct kmem_cache *s, struct page *page) | |
1217 | { | |
834f3d11 CL |
1218 | int order = compound_order(page); |
1219 | int pages = 1 << order; | |
81819f0f | 1220 | |
af537b0a | 1221 | if (kmem_cache_debug(s)) { |
81819f0f CL |
1222 | void *p; |
1223 | ||
1224 | slab_pad_check(s, page); | |
224a88be CL |
1225 | for_each_object(p, s, page_address(page), |
1226 | page->objects) | |
81819f0f | 1227 | check_object(s, page, p, 0); |
81819f0f CL |
1228 | } |
1229 | ||
b1eeab67 | 1230 | kmemcheck_free_shadow(page, compound_order(page)); |
5a896d9e | 1231 | |
81819f0f CL |
1232 | mod_zone_page_state(page_zone(page), |
1233 | (s->flags & SLAB_RECLAIM_ACCOUNT) ? | |
1234 | NR_SLAB_RECLAIMABLE : NR_SLAB_UNRECLAIMABLE, | |
06428780 | 1235 | -pages); |
81819f0f | 1236 | |
49bd5221 CL |
1237 | __ClearPageSlab(page); |
1238 | reset_page_mapcount(page); | |
1eb5ac64 NP |
1239 | if (current->reclaim_state) |
1240 | current->reclaim_state->reclaimed_slab += pages; | |
834f3d11 | 1241 | __free_pages(page, order); |
81819f0f CL |
1242 | } |
1243 | ||
1244 | static void rcu_free_slab(struct rcu_head *h) | |
1245 | { | |
1246 | struct page *page; | |
1247 | ||
1248 | page = container_of((struct list_head *)h, struct page, lru); | |
1249 | __free_slab(page->slab, page); | |
1250 | } | |
1251 | ||
1252 | static void free_slab(struct kmem_cache *s, struct page *page) | |
1253 | { | |
1254 | if (unlikely(s->flags & SLAB_DESTROY_BY_RCU)) { | |
1255 | /* | |
1256 | * RCU free overloads the RCU head over the LRU | |
1257 | */ | |
1258 | struct rcu_head *head = (void *)&page->lru; | |
1259 | ||
1260 | call_rcu(head, rcu_free_slab); | |
1261 | } else | |
1262 | __free_slab(s, page); | |
1263 | } | |
1264 | ||
1265 | static void discard_slab(struct kmem_cache *s, struct page *page) | |
1266 | { | |
205ab99d | 1267 | dec_slabs_node(s, page_to_nid(page), page->objects); |
81819f0f CL |
1268 | free_slab(s, page); |
1269 | } | |
1270 | ||
1271 | /* | |
1272 | * Per slab locking using the pagelock | |
1273 | */ | |
1274 | static __always_inline void slab_lock(struct page *page) | |
1275 | { | |
1276 | bit_spin_lock(PG_locked, &page->flags); | |
1277 | } | |
1278 | ||
1279 | static __always_inline void slab_unlock(struct page *page) | |
1280 | { | |
a76d3546 | 1281 | __bit_spin_unlock(PG_locked, &page->flags); |
81819f0f CL |
1282 | } |
1283 | ||
1284 | static __always_inline int slab_trylock(struct page *page) | |
1285 | { | |
1286 | int rc = 1; | |
1287 | ||
1288 | rc = bit_spin_trylock(PG_locked, &page->flags); | |
1289 | return rc; | |
1290 | } | |
1291 | ||
1292 | /* | |
1293 | * Management of partially allocated slabs | |
1294 | */ | |
7c2e132c CL |
1295 | static void add_partial(struct kmem_cache_node *n, |
1296 | struct page *page, int tail) | |
81819f0f | 1297 | { |
e95eed57 CL |
1298 | spin_lock(&n->list_lock); |
1299 | n->nr_partial++; | |
7c2e132c CL |
1300 | if (tail) |
1301 | list_add_tail(&page->lru, &n->partial); | |
1302 | else | |
1303 | list_add(&page->lru, &n->partial); | |
81819f0f CL |
1304 | spin_unlock(&n->list_lock); |
1305 | } | |
1306 | ||
0121c619 | 1307 | static void remove_partial(struct kmem_cache *s, struct page *page) |
81819f0f CL |
1308 | { |
1309 | struct kmem_cache_node *n = get_node(s, page_to_nid(page)); | |
1310 | ||
1311 | spin_lock(&n->list_lock); | |
1312 | list_del(&page->lru); | |
1313 | n->nr_partial--; | |
1314 | spin_unlock(&n->list_lock); | |
1315 | } | |
1316 | ||
1317 | /* | |
672bba3a | 1318 | * Lock slab and remove from the partial list. |
81819f0f | 1319 | * |
672bba3a | 1320 | * Must hold list_lock. |
81819f0f | 1321 | */ |
0121c619 CL |
1322 | static inline int lock_and_freeze_slab(struct kmem_cache_node *n, |
1323 | struct page *page) | |
81819f0f CL |
1324 | { |
1325 | if (slab_trylock(page)) { | |
1326 | list_del(&page->lru); | |
1327 | n->nr_partial--; | |
8a38082d | 1328 | __SetPageSlubFrozen(page); |
81819f0f CL |
1329 | return 1; |
1330 | } | |
1331 | return 0; | |
1332 | } | |
1333 | ||
1334 | /* | |
672bba3a | 1335 | * Try to allocate a partial slab from a specific node. |
81819f0f CL |
1336 | */ |
1337 | static struct page *get_partial_node(struct kmem_cache_node *n) | |
1338 | { | |
1339 | struct page *page; | |
1340 | ||
1341 | /* | |
1342 | * Racy check. If we mistakenly see no partial slabs then we | |
1343 | * just allocate an empty slab. If we mistakenly try to get a | |
672bba3a CL |
1344 | * partial slab and there is none available then get_partials() |
1345 | * will return NULL. | |
81819f0f CL |
1346 | */ |
1347 | if (!n || !n->nr_partial) | |
1348 | return NULL; | |
1349 | ||
1350 | spin_lock(&n->list_lock); | |
1351 | list_for_each_entry(page, &n->partial, lru) | |
4b6f0750 | 1352 | if (lock_and_freeze_slab(n, page)) |
81819f0f CL |
1353 | goto out; |
1354 | page = NULL; | |
1355 | out: | |
1356 | spin_unlock(&n->list_lock); | |
1357 | return page; | |
1358 | } | |
1359 | ||
1360 | /* | |
672bba3a | 1361 | * Get a page from somewhere. Search in increasing NUMA distances. |
81819f0f CL |
1362 | */ |
1363 | static struct page *get_any_partial(struct kmem_cache *s, gfp_t flags) | |
1364 | { | |
1365 | #ifdef CONFIG_NUMA | |
1366 | struct zonelist *zonelist; | |
dd1a239f | 1367 | struct zoneref *z; |
54a6eb5c MG |
1368 | struct zone *zone; |
1369 | enum zone_type high_zoneidx = gfp_zone(flags); | |
81819f0f CL |
1370 | struct page *page; |
1371 | ||
1372 | /* | |
672bba3a CL |
1373 | * The defrag ratio allows a configuration of the tradeoffs between |
1374 | * inter node defragmentation and node local allocations. A lower | |
1375 | * defrag_ratio increases the tendency to do local allocations | |
1376 | * instead of attempting to obtain partial slabs from other nodes. | |
81819f0f | 1377 | * |
672bba3a CL |
1378 | * If the defrag_ratio is set to 0 then kmalloc() always |
1379 | * returns node local objects. If the ratio is higher then kmalloc() | |
1380 | * may return off node objects because partial slabs are obtained | |
1381 | * from other nodes and filled up. | |
81819f0f | 1382 | * |
6446faa2 | 1383 | * If /sys/kernel/slab/xx/defrag_ratio is set to 100 (which makes |
672bba3a CL |
1384 | * defrag_ratio = 1000) then every (well almost) allocation will |
1385 | * first attempt to defrag slab caches on other nodes. This means | |
1386 | * scanning over all nodes to look for partial slabs which may be | |
1387 | * expensive if we do it every time we are trying to find a slab | |
1388 | * with available objects. | |
81819f0f | 1389 | */ |
9824601e CL |
1390 | if (!s->remote_node_defrag_ratio || |
1391 | get_cycles() % 1024 > s->remote_node_defrag_ratio) | |
81819f0f CL |
1392 | return NULL; |
1393 | ||
c0ff7453 | 1394 | get_mems_allowed(); |
0e88460d | 1395 | zonelist = node_zonelist(slab_node(current->mempolicy), flags); |
54a6eb5c | 1396 | for_each_zone_zonelist(zone, z, zonelist, high_zoneidx) { |
81819f0f CL |
1397 | struct kmem_cache_node *n; |
1398 | ||
54a6eb5c | 1399 | n = get_node(s, zone_to_nid(zone)); |
81819f0f | 1400 | |
54a6eb5c | 1401 | if (n && cpuset_zone_allowed_hardwall(zone, flags) && |
3b89d7d8 | 1402 | n->nr_partial > s->min_partial) { |
81819f0f | 1403 | page = get_partial_node(n); |
c0ff7453 MX |
1404 | if (page) { |
1405 | put_mems_allowed(); | |
81819f0f | 1406 | return page; |
c0ff7453 | 1407 | } |
81819f0f CL |
1408 | } |
1409 | } | |
c0ff7453 | 1410 | put_mems_allowed(); |
81819f0f CL |
1411 | #endif |
1412 | return NULL; | |
1413 | } | |
1414 | ||
1415 | /* | |
1416 | * Get a partial page, lock it and return it. | |
1417 | */ | |
1418 | static struct page *get_partial(struct kmem_cache *s, gfp_t flags, int node) | |
1419 | { | |
1420 | struct page *page; | |
2154a336 | 1421 | int searchnode = (node == NUMA_NO_NODE) ? numa_node_id() : node; |
81819f0f CL |
1422 | |
1423 | page = get_partial_node(get_node(s, searchnode)); | |
bc6488e9 | 1424 | if (page || node != -1) |
81819f0f CL |
1425 | return page; |
1426 | ||
1427 | return get_any_partial(s, flags); | |
1428 | } | |
1429 | ||
1430 | /* | |
1431 | * Move a page back to the lists. | |
1432 | * | |
1433 | * Must be called with the slab lock held. | |
1434 | * | |
1435 | * On exit the slab lock will have been dropped. | |
1436 | */ | |
7c2e132c | 1437 | static void unfreeze_slab(struct kmem_cache *s, struct page *page, int tail) |
81819f0f | 1438 | { |
e95eed57 CL |
1439 | struct kmem_cache_node *n = get_node(s, page_to_nid(page)); |
1440 | ||
8a38082d | 1441 | __ClearPageSlubFrozen(page); |
81819f0f | 1442 | if (page->inuse) { |
e95eed57 | 1443 | |
a973e9dd | 1444 | if (page->freelist) { |
7c2e132c | 1445 | add_partial(n, page, tail); |
84e554e6 | 1446 | stat(s, tail ? DEACTIVATE_TO_TAIL : DEACTIVATE_TO_HEAD); |
8ff12cfc | 1447 | } else { |
84e554e6 | 1448 | stat(s, DEACTIVATE_FULL); |
af537b0a | 1449 | if (kmem_cache_debug(s) && (s->flags & SLAB_STORE_USER)) |
8ff12cfc CL |
1450 | add_full(n, page); |
1451 | } | |
81819f0f CL |
1452 | slab_unlock(page); |
1453 | } else { | |
84e554e6 | 1454 | stat(s, DEACTIVATE_EMPTY); |
3b89d7d8 | 1455 | if (n->nr_partial < s->min_partial) { |
e95eed57 | 1456 | /* |
672bba3a CL |
1457 | * Adding an empty slab to the partial slabs in order |
1458 | * to avoid page allocator overhead. This slab needs | |
1459 | * to come after the other slabs with objects in | |
6446faa2 CL |
1460 | * so that the others get filled first. That way the |
1461 | * size of the partial list stays small. | |
1462 | * | |
0121c619 CL |
1463 | * kmem_cache_shrink can reclaim any empty slabs from |
1464 | * the partial list. | |
e95eed57 | 1465 | */ |
7c2e132c | 1466 | add_partial(n, page, 1); |
e95eed57 CL |
1467 | slab_unlock(page); |
1468 | } else { | |
1469 | slab_unlock(page); | |
84e554e6 | 1470 | stat(s, FREE_SLAB); |
e95eed57 CL |
1471 | discard_slab(s, page); |
1472 | } | |
81819f0f CL |
1473 | } |
1474 | } | |
1475 | ||
1476 | /* | |
1477 | * Remove the cpu slab | |
1478 | */ | |
dfb4f096 | 1479 | static void deactivate_slab(struct kmem_cache *s, struct kmem_cache_cpu *c) |
81819f0f | 1480 | { |
dfb4f096 | 1481 | struct page *page = c->page; |
7c2e132c | 1482 | int tail = 1; |
8ff12cfc | 1483 | |
b773ad73 | 1484 | if (page->freelist) |
84e554e6 | 1485 | stat(s, DEACTIVATE_REMOTE_FREES); |
894b8788 | 1486 | /* |
6446faa2 | 1487 | * Merge cpu freelist into slab freelist. Typically we get here |
894b8788 CL |
1488 | * because both freelists are empty. So this is unlikely |
1489 | * to occur. | |
1490 | */ | |
a973e9dd | 1491 | while (unlikely(c->freelist)) { |
894b8788 CL |
1492 | void **object; |
1493 | ||
7c2e132c CL |
1494 | tail = 0; /* Hot objects. Put the slab first */ |
1495 | ||
894b8788 | 1496 | /* Retrieve object from cpu_freelist */ |
dfb4f096 | 1497 | object = c->freelist; |
ff12059e | 1498 | c->freelist = get_freepointer(s, c->freelist); |
894b8788 CL |
1499 | |
1500 | /* And put onto the regular freelist */ | |
ff12059e | 1501 | set_freepointer(s, object, page->freelist); |
894b8788 CL |
1502 | page->freelist = object; |
1503 | page->inuse--; | |
1504 | } | |
dfb4f096 | 1505 | c->page = NULL; |
7c2e132c | 1506 | unfreeze_slab(s, page, tail); |
81819f0f CL |
1507 | } |
1508 | ||
dfb4f096 | 1509 | static inline void flush_slab(struct kmem_cache *s, struct kmem_cache_cpu *c) |
81819f0f | 1510 | { |
84e554e6 | 1511 | stat(s, CPUSLAB_FLUSH); |
dfb4f096 CL |
1512 | slab_lock(c->page); |
1513 | deactivate_slab(s, c); | |
81819f0f CL |
1514 | } |
1515 | ||
1516 | /* | |
1517 | * Flush cpu slab. | |
6446faa2 | 1518 | * |
81819f0f CL |
1519 | * Called from IPI handler with interrupts disabled. |
1520 | */ | |
0c710013 | 1521 | static inline void __flush_cpu_slab(struct kmem_cache *s, int cpu) |
81819f0f | 1522 | { |
9dfc6e68 | 1523 | struct kmem_cache_cpu *c = per_cpu_ptr(s->cpu_slab, cpu); |
81819f0f | 1524 | |
dfb4f096 CL |
1525 | if (likely(c && c->page)) |
1526 | flush_slab(s, c); | |
81819f0f CL |
1527 | } |
1528 | ||
1529 | static void flush_cpu_slab(void *d) | |
1530 | { | |
1531 | struct kmem_cache *s = d; | |
81819f0f | 1532 | |
dfb4f096 | 1533 | __flush_cpu_slab(s, smp_processor_id()); |
81819f0f CL |
1534 | } |
1535 | ||
1536 | static void flush_all(struct kmem_cache *s) | |
1537 | { | |
15c8b6c1 | 1538 | on_each_cpu(flush_cpu_slab, s, 1); |
81819f0f CL |
1539 | } |
1540 | ||
dfb4f096 CL |
1541 | /* |
1542 | * Check if the objects in a per cpu structure fit numa | |
1543 | * locality expectations. | |
1544 | */ | |
1545 | static inline int node_match(struct kmem_cache_cpu *c, int node) | |
1546 | { | |
1547 | #ifdef CONFIG_NUMA | |
2154a336 | 1548 | if (node != NUMA_NO_NODE && c->node != node) |
dfb4f096 CL |
1549 | return 0; |
1550 | #endif | |
1551 | return 1; | |
1552 | } | |
1553 | ||
781b2ba6 PE |
1554 | static int count_free(struct page *page) |
1555 | { | |
1556 | return page->objects - page->inuse; | |
1557 | } | |
1558 | ||
1559 | static unsigned long count_partial(struct kmem_cache_node *n, | |
1560 | int (*get_count)(struct page *)) | |
1561 | { | |
1562 | unsigned long flags; | |
1563 | unsigned long x = 0; | |
1564 | struct page *page; | |
1565 | ||
1566 | spin_lock_irqsave(&n->list_lock, flags); | |
1567 | list_for_each_entry(page, &n->partial, lru) | |
1568 | x += get_count(page); | |
1569 | spin_unlock_irqrestore(&n->list_lock, flags); | |
1570 | return x; | |
1571 | } | |
1572 | ||
26c02cf0 AB |
1573 | static inline unsigned long node_nr_objs(struct kmem_cache_node *n) |
1574 | { | |
1575 | #ifdef CONFIG_SLUB_DEBUG | |
1576 | return atomic_long_read(&n->total_objects); | |
1577 | #else | |
1578 | return 0; | |
1579 | #endif | |
1580 | } | |
1581 | ||
781b2ba6 PE |
1582 | static noinline void |
1583 | slab_out_of_memory(struct kmem_cache *s, gfp_t gfpflags, int nid) | |
1584 | { | |
1585 | int node; | |
1586 | ||
1587 | printk(KERN_WARNING | |
1588 | "SLUB: Unable to allocate memory on node %d (gfp=0x%x)\n", | |
1589 | nid, gfpflags); | |
1590 | printk(KERN_WARNING " cache: %s, object size: %d, buffer size: %d, " | |
1591 | "default order: %d, min order: %d\n", s->name, s->objsize, | |
1592 | s->size, oo_order(s->oo), oo_order(s->min)); | |
1593 | ||
fa5ec8a1 DR |
1594 | if (oo_order(s->min) > get_order(s->objsize)) |
1595 | printk(KERN_WARNING " %s debugging increased min order, use " | |
1596 | "slub_debug=O to disable.\n", s->name); | |
1597 | ||
781b2ba6 PE |
1598 | for_each_online_node(node) { |
1599 | struct kmem_cache_node *n = get_node(s, node); | |
1600 | unsigned long nr_slabs; | |
1601 | unsigned long nr_objs; | |
1602 | unsigned long nr_free; | |
1603 | ||
1604 | if (!n) | |
1605 | continue; | |
1606 | ||
26c02cf0 AB |
1607 | nr_free = count_partial(n, count_free); |
1608 | nr_slabs = node_nr_slabs(n); | |
1609 | nr_objs = node_nr_objs(n); | |
781b2ba6 PE |
1610 | |
1611 | printk(KERN_WARNING | |
1612 | " node %d: slabs: %ld, objs: %ld, free: %ld\n", | |
1613 | node, nr_slabs, nr_objs, nr_free); | |
1614 | } | |
1615 | } | |
1616 | ||
81819f0f | 1617 | /* |
894b8788 CL |
1618 | * Slow path. The lockless freelist is empty or we need to perform |
1619 | * debugging duties. | |
1620 | * | |
1621 | * Interrupts are disabled. | |
81819f0f | 1622 | * |
894b8788 CL |
1623 | * Processing is still very fast if new objects have been freed to the |
1624 | * regular freelist. In that case we simply take over the regular freelist | |
1625 | * as the lockless freelist and zap the regular freelist. | |
81819f0f | 1626 | * |
894b8788 CL |
1627 | * If that is not working then we fall back to the partial lists. We take the |
1628 | * first element of the freelist as the object to allocate now and move the | |
1629 | * rest of the freelist to the lockless freelist. | |
81819f0f | 1630 | * |
894b8788 | 1631 | * And if we were unable to get a new slab from the partial slab lists then |
6446faa2 CL |
1632 | * we need to allocate a new slab. This is the slowest path since it involves |
1633 | * a call to the page allocator and the setup of a new slab. | |
81819f0f | 1634 | */ |
ce71e27c EGM |
1635 | static void *__slab_alloc(struct kmem_cache *s, gfp_t gfpflags, int node, |
1636 | unsigned long addr, struct kmem_cache_cpu *c) | |
81819f0f | 1637 | { |
81819f0f | 1638 | void **object; |
dfb4f096 | 1639 | struct page *new; |
81819f0f | 1640 | |
e72e9c23 LT |
1641 | /* We handle __GFP_ZERO in the caller */ |
1642 | gfpflags &= ~__GFP_ZERO; | |
1643 | ||
dfb4f096 | 1644 | if (!c->page) |
81819f0f CL |
1645 | goto new_slab; |
1646 | ||
dfb4f096 CL |
1647 | slab_lock(c->page); |
1648 | if (unlikely(!node_match(c, node))) | |
81819f0f | 1649 | goto another_slab; |
6446faa2 | 1650 | |
84e554e6 | 1651 | stat(s, ALLOC_REFILL); |
6446faa2 | 1652 | |
894b8788 | 1653 | load_freelist: |
dfb4f096 | 1654 | object = c->page->freelist; |
a973e9dd | 1655 | if (unlikely(!object)) |
81819f0f | 1656 | goto another_slab; |
af537b0a | 1657 | if (kmem_cache_debug(s)) |
81819f0f CL |
1658 | goto debug; |
1659 | ||
ff12059e | 1660 | c->freelist = get_freepointer(s, object); |
39b26464 | 1661 | c->page->inuse = c->page->objects; |
a973e9dd | 1662 | c->page->freelist = NULL; |
dfb4f096 | 1663 | c->node = page_to_nid(c->page); |
1f84260c | 1664 | unlock_out: |
dfb4f096 | 1665 | slab_unlock(c->page); |
84e554e6 | 1666 | stat(s, ALLOC_SLOWPATH); |
81819f0f CL |
1667 | return object; |
1668 | ||
1669 | another_slab: | |
dfb4f096 | 1670 | deactivate_slab(s, c); |
81819f0f CL |
1671 | |
1672 | new_slab: | |
dfb4f096 CL |
1673 | new = get_partial(s, gfpflags, node); |
1674 | if (new) { | |
1675 | c->page = new; | |
84e554e6 | 1676 | stat(s, ALLOC_FROM_PARTIAL); |
894b8788 | 1677 | goto load_freelist; |
81819f0f CL |
1678 | } |
1679 | ||
b811c202 CL |
1680 | if (gfpflags & __GFP_WAIT) |
1681 | local_irq_enable(); | |
1682 | ||
dfb4f096 | 1683 | new = new_slab(s, gfpflags, node); |
b811c202 CL |
1684 | |
1685 | if (gfpflags & __GFP_WAIT) | |
1686 | local_irq_disable(); | |
1687 | ||
dfb4f096 | 1688 | if (new) { |
9dfc6e68 | 1689 | c = __this_cpu_ptr(s->cpu_slab); |
84e554e6 | 1690 | stat(s, ALLOC_SLAB); |
05aa3450 | 1691 | if (c->page) |
dfb4f096 | 1692 | flush_slab(s, c); |
dfb4f096 | 1693 | slab_lock(new); |
8a38082d | 1694 | __SetPageSlubFrozen(new); |
dfb4f096 | 1695 | c->page = new; |
4b6f0750 | 1696 | goto load_freelist; |
81819f0f | 1697 | } |
95f85989 PE |
1698 | if (!(gfpflags & __GFP_NOWARN) && printk_ratelimit()) |
1699 | slab_out_of_memory(s, gfpflags, node); | |
71c7a06f | 1700 | return NULL; |
81819f0f | 1701 | debug: |
dfb4f096 | 1702 | if (!alloc_debug_processing(s, c->page, object, addr)) |
81819f0f | 1703 | goto another_slab; |
894b8788 | 1704 | |
dfb4f096 | 1705 | c->page->inuse++; |
ff12059e | 1706 | c->page->freelist = get_freepointer(s, object); |
ee3c72a1 | 1707 | c->node = -1; |
1f84260c | 1708 | goto unlock_out; |
894b8788 CL |
1709 | } |
1710 | ||
1711 | /* | |
1712 | * Inlined fastpath so that allocation functions (kmalloc, kmem_cache_alloc) | |
1713 | * have the fastpath folded into their functions. So no function call | |
1714 | * overhead for requests that can be satisfied on the fastpath. | |
1715 | * | |
1716 | * The fastpath works by first checking if the lockless freelist can be used. | |
1717 | * If not then __slab_alloc is called for slow processing. | |
1718 | * | |
1719 | * Otherwise we can simply pick the next object from the lockless free list. | |
1720 | */ | |
06428780 | 1721 | static __always_inline void *slab_alloc(struct kmem_cache *s, |
ce71e27c | 1722 | gfp_t gfpflags, int node, unsigned long addr) |
894b8788 | 1723 | { |
894b8788 | 1724 | void **object; |
dfb4f096 | 1725 | struct kmem_cache_cpu *c; |
1f84260c CL |
1726 | unsigned long flags; |
1727 | ||
dcce284a | 1728 | gfpflags &= gfp_allowed_mask; |
7e85ee0c | 1729 | |
c016b0bd | 1730 | if (slab_pre_alloc_hook(s, gfpflags)) |
773ff60e | 1731 | return NULL; |
1f84260c | 1732 | |
894b8788 | 1733 | local_irq_save(flags); |
9dfc6e68 CL |
1734 | c = __this_cpu_ptr(s->cpu_slab); |
1735 | object = c->freelist; | |
9dfc6e68 | 1736 | if (unlikely(!object || !node_match(c, node))) |
894b8788 | 1737 | |
dfb4f096 | 1738 | object = __slab_alloc(s, gfpflags, node, addr, c); |
894b8788 CL |
1739 | |
1740 | else { | |
ff12059e | 1741 | c->freelist = get_freepointer(s, object); |
84e554e6 | 1742 | stat(s, ALLOC_FASTPATH); |
894b8788 CL |
1743 | } |
1744 | local_irq_restore(flags); | |
d07dbea4 | 1745 | |
74e2134f | 1746 | if (unlikely(gfpflags & __GFP_ZERO) && object) |
ff12059e | 1747 | memset(object, 0, s->objsize); |
d07dbea4 | 1748 | |
c016b0bd | 1749 | slab_post_alloc_hook(s, gfpflags, object); |
5a896d9e | 1750 | |
894b8788 | 1751 | return object; |
81819f0f CL |
1752 | } |
1753 | ||
1754 | void *kmem_cache_alloc(struct kmem_cache *s, gfp_t gfpflags) | |
1755 | { | |
2154a336 | 1756 | void *ret = slab_alloc(s, gfpflags, NUMA_NO_NODE, _RET_IP_); |
5b882be4 | 1757 | |
ca2b84cb | 1758 | trace_kmem_cache_alloc(_RET_IP_, ret, s->objsize, s->size, gfpflags); |
5b882be4 EGM |
1759 | |
1760 | return ret; | |
81819f0f CL |
1761 | } |
1762 | EXPORT_SYMBOL(kmem_cache_alloc); | |
1763 | ||
0f24f128 | 1764 | #ifdef CONFIG_TRACING |
5b882be4 EGM |
1765 | void *kmem_cache_alloc_notrace(struct kmem_cache *s, gfp_t gfpflags) |
1766 | { | |
2154a336 | 1767 | return slab_alloc(s, gfpflags, NUMA_NO_NODE, _RET_IP_); |
5b882be4 EGM |
1768 | } |
1769 | EXPORT_SYMBOL(kmem_cache_alloc_notrace); | |
1770 | #endif | |
1771 | ||
81819f0f CL |
1772 | #ifdef CONFIG_NUMA |
1773 | void *kmem_cache_alloc_node(struct kmem_cache *s, gfp_t gfpflags, int node) | |
1774 | { | |
5b882be4 EGM |
1775 | void *ret = slab_alloc(s, gfpflags, node, _RET_IP_); |
1776 | ||
ca2b84cb EGM |
1777 | trace_kmem_cache_alloc_node(_RET_IP_, ret, |
1778 | s->objsize, s->size, gfpflags, node); | |
5b882be4 EGM |
1779 | |
1780 | return ret; | |
81819f0f CL |
1781 | } |
1782 | EXPORT_SYMBOL(kmem_cache_alloc_node); | |
1783 | #endif | |
1784 | ||
0f24f128 | 1785 | #ifdef CONFIG_TRACING |
5b882be4 EGM |
1786 | void *kmem_cache_alloc_node_notrace(struct kmem_cache *s, |
1787 | gfp_t gfpflags, | |
1788 | int node) | |
1789 | { | |
1790 | return slab_alloc(s, gfpflags, node, _RET_IP_); | |
1791 | } | |
1792 | EXPORT_SYMBOL(kmem_cache_alloc_node_notrace); | |
1793 | #endif | |
1794 | ||
81819f0f | 1795 | /* |
894b8788 CL |
1796 | * Slow patch handling. This may still be called frequently since objects |
1797 | * have a longer lifetime than the cpu slabs in most processing loads. | |
81819f0f | 1798 | * |
894b8788 CL |
1799 | * So we still attempt to reduce cache line usage. Just take the slab |
1800 | * lock and free the item. If there is no additional partial page | |
1801 | * handling required then we can return immediately. | |
81819f0f | 1802 | */ |
894b8788 | 1803 | static void __slab_free(struct kmem_cache *s, struct page *page, |
ff12059e | 1804 | void *x, unsigned long addr) |
81819f0f CL |
1805 | { |
1806 | void *prior; | |
1807 | void **object = (void *)x; | |
81819f0f | 1808 | |
84e554e6 | 1809 | stat(s, FREE_SLOWPATH); |
81819f0f CL |
1810 | slab_lock(page); |
1811 | ||
af537b0a | 1812 | if (kmem_cache_debug(s)) |
81819f0f | 1813 | goto debug; |
6446faa2 | 1814 | |
81819f0f | 1815 | checks_ok: |
ff12059e CL |
1816 | prior = page->freelist; |
1817 | set_freepointer(s, object, prior); | |
81819f0f CL |
1818 | page->freelist = object; |
1819 | page->inuse--; | |
1820 | ||
8a38082d | 1821 | if (unlikely(PageSlubFrozen(page))) { |
84e554e6 | 1822 | stat(s, FREE_FROZEN); |
81819f0f | 1823 | goto out_unlock; |
8ff12cfc | 1824 | } |
81819f0f CL |
1825 | |
1826 | if (unlikely(!page->inuse)) | |
1827 | goto slab_empty; | |
1828 | ||
1829 | /* | |
6446faa2 | 1830 | * Objects left in the slab. If it was not on the partial list before |
81819f0f CL |
1831 | * then add it. |
1832 | */ | |
a973e9dd | 1833 | if (unlikely(!prior)) { |
7c2e132c | 1834 | add_partial(get_node(s, page_to_nid(page)), page, 1); |
84e554e6 | 1835 | stat(s, FREE_ADD_PARTIAL); |
8ff12cfc | 1836 | } |
81819f0f CL |
1837 | |
1838 | out_unlock: | |
1839 | slab_unlock(page); | |
81819f0f CL |
1840 | return; |
1841 | ||
1842 | slab_empty: | |
a973e9dd | 1843 | if (prior) { |
81819f0f | 1844 | /* |
672bba3a | 1845 | * Slab still on the partial list. |
81819f0f CL |
1846 | */ |
1847 | remove_partial(s, page); | |
84e554e6 | 1848 | stat(s, FREE_REMOVE_PARTIAL); |
8ff12cfc | 1849 | } |
81819f0f | 1850 | slab_unlock(page); |
84e554e6 | 1851 | stat(s, FREE_SLAB); |
81819f0f | 1852 | discard_slab(s, page); |
81819f0f CL |
1853 | return; |
1854 | ||
1855 | debug: | |
3ec09742 | 1856 | if (!free_debug_processing(s, page, x, addr)) |
77c5e2d0 | 1857 | goto out_unlock; |
77c5e2d0 | 1858 | goto checks_ok; |
81819f0f CL |
1859 | } |
1860 | ||
894b8788 CL |
1861 | /* |
1862 | * Fastpath with forced inlining to produce a kfree and kmem_cache_free that | |
1863 | * can perform fastpath freeing without additional function calls. | |
1864 | * | |
1865 | * The fastpath is only possible if we are freeing to the current cpu slab | |
1866 | * of this processor. This typically the case if we have just allocated | |
1867 | * the item before. | |
1868 | * | |
1869 | * If fastpath is not possible then fall back to __slab_free where we deal | |
1870 | * with all sorts of special processing. | |
1871 | */ | |
06428780 | 1872 | static __always_inline void slab_free(struct kmem_cache *s, |
ce71e27c | 1873 | struct page *page, void *x, unsigned long addr) |
894b8788 CL |
1874 | { |
1875 | void **object = (void *)x; | |
dfb4f096 | 1876 | struct kmem_cache_cpu *c; |
1f84260c CL |
1877 | unsigned long flags; |
1878 | ||
c016b0bd CL |
1879 | slab_free_hook(s, x); |
1880 | ||
894b8788 | 1881 | local_irq_save(flags); |
9dfc6e68 | 1882 | c = __this_cpu_ptr(s->cpu_slab); |
c016b0bd CL |
1883 | |
1884 | slab_free_hook_irq(s, x); | |
1885 | ||
ee3c72a1 | 1886 | if (likely(page == c->page && c->node >= 0)) { |
ff12059e | 1887 | set_freepointer(s, object, c->freelist); |
dfb4f096 | 1888 | c->freelist = object; |
84e554e6 | 1889 | stat(s, FREE_FASTPATH); |
894b8788 | 1890 | } else |
ff12059e | 1891 | __slab_free(s, page, x, addr); |
894b8788 CL |
1892 | |
1893 | local_irq_restore(flags); | |
1894 | } | |
1895 | ||
81819f0f CL |
1896 | void kmem_cache_free(struct kmem_cache *s, void *x) |
1897 | { | |
77c5e2d0 | 1898 | struct page *page; |
81819f0f | 1899 | |
b49af68f | 1900 | page = virt_to_head_page(x); |
81819f0f | 1901 | |
ce71e27c | 1902 | slab_free(s, page, x, _RET_IP_); |
5b882be4 | 1903 | |
ca2b84cb | 1904 | trace_kmem_cache_free(_RET_IP_, x); |
81819f0f CL |
1905 | } |
1906 | EXPORT_SYMBOL(kmem_cache_free); | |
1907 | ||
e9beef18 | 1908 | /* Figure out on which slab page the object resides */ |
81819f0f CL |
1909 | static struct page *get_object_page(const void *x) |
1910 | { | |
b49af68f | 1911 | struct page *page = virt_to_head_page(x); |
81819f0f CL |
1912 | |
1913 | if (!PageSlab(page)) | |
1914 | return NULL; | |
1915 | ||
1916 | return page; | |
1917 | } | |
1918 | ||
1919 | /* | |
672bba3a CL |
1920 | * Object placement in a slab is made very easy because we always start at |
1921 | * offset 0. If we tune the size of the object to the alignment then we can | |
1922 | * get the required alignment by putting one properly sized object after | |
1923 | * another. | |
81819f0f CL |
1924 | * |
1925 | * Notice that the allocation order determines the sizes of the per cpu | |
1926 | * caches. Each processor has always one slab available for allocations. | |
1927 | * Increasing the allocation order reduces the number of times that slabs | |
672bba3a | 1928 | * must be moved on and off the partial lists and is therefore a factor in |
81819f0f | 1929 | * locking overhead. |
81819f0f CL |
1930 | */ |
1931 | ||
1932 | /* | |
1933 | * Mininum / Maximum order of slab pages. This influences locking overhead | |
1934 | * and slab fragmentation. A higher order reduces the number of partial slabs | |
1935 | * and increases the number of allocations possible without having to | |
1936 | * take the list_lock. | |
1937 | */ | |
1938 | static int slub_min_order; | |
114e9e89 | 1939 | static int slub_max_order = PAGE_ALLOC_COSTLY_ORDER; |
9b2cd506 | 1940 | static int slub_min_objects; |
81819f0f CL |
1941 | |
1942 | /* | |
1943 | * Merge control. If this is set then no merging of slab caches will occur. | |
672bba3a | 1944 | * (Could be removed. This was introduced to pacify the merge skeptics.) |
81819f0f CL |
1945 | */ |
1946 | static int slub_nomerge; | |
1947 | ||
81819f0f CL |
1948 | /* |
1949 | * Calculate the order of allocation given an slab object size. | |
1950 | * | |
672bba3a CL |
1951 | * The order of allocation has significant impact on performance and other |
1952 | * system components. Generally order 0 allocations should be preferred since | |
1953 | * order 0 does not cause fragmentation in the page allocator. Larger objects | |
1954 | * be problematic to put into order 0 slabs because there may be too much | |
c124f5b5 | 1955 | * unused space left. We go to a higher order if more than 1/16th of the slab |
672bba3a CL |
1956 | * would be wasted. |
1957 | * | |
1958 | * In order to reach satisfactory performance we must ensure that a minimum | |
1959 | * number of objects is in one slab. Otherwise we may generate too much | |
1960 | * activity on the partial lists which requires taking the list_lock. This is | |
1961 | * less a concern for large slabs though which are rarely used. | |
81819f0f | 1962 | * |
672bba3a CL |
1963 | * slub_max_order specifies the order where we begin to stop considering the |
1964 | * number of objects in a slab as critical. If we reach slub_max_order then | |
1965 | * we try to keep the page order as low as possible. So we accept more waste | |
1966 | * of space in favor of a small page order. | |
81819f0f | 1967 | * |
672bba3a CL |
1968 | * Higher order allocations also allow the placement of more objects in a |
1969 | * slab and thereby reduce object handling overhead. If the user has | |
1970 | * requested a higher mininum order then we start with that one instead of | |
1971 | * the smallest order which will fit the object. | |
81819f0f | 1972 | */ |
5e6d444e CL |
1973 | static inline int slab_order(int size, int min_objects, |
1974 | int max_order, int fract_leftover) | |
81819f0f CL |
1975 | { |
1976 | int order; | |
1977 | int rem; | |
6300ea75 | 1978 | int min_order = slub_min_order; |
81819f0f | 1979 | |
210b5c06 CG |
1980 | if ((PAGE_SIZE << min_order) / size > MAX_OBJS_PER_PAGE) |
1981 | return get_order(size * MAX_OBJS_PER_PAGE) - 1; | |
39b26464 | 1982 | |
6300ea75 | 1983 | for (order = max(min_order, |
5e6d444e CL |
1984 | fls(min_objects * size - 1) - PAGE_SHIFT); |
1985 | order <= max_order; order++) { | |
81819f0f | 1986 | |
5e6d444e | 1987 | unsigned long slab_size = PAGE_SIZE << order; |
81819f0f | 1988 | |
5e6d444e | 1989 | if (slab_size < min_objects * size) |
81819f0f CL |
1990 | continue; |
1991 | ||
1992 | rem = slab_size % size; | |
1993 | ||
5e6d444e | 1994 | if (rem <= slab_size / fract_leftover) |
81819f0f CL |
1995 | break; |
1996 | ||
1997 | } | |
672bba3a | 1998 | |
81819f0f CL |
1999 | return order; |
2000 | } | |
2001 | ||
5e6d444e CL |
2002 | static inline int calculate_order(int size) |
2003 | { | |
2004 | int order; | |
2005 | int min_objects; | |
2006 | int fraction; | |
e8120ff1 | 2007 | int max_objects; |
5e6d444e CL |
2008 | |
2009 | /* | |
2010 | * Attempt to find best configuration for a slab. This | |
2011 | * works by first attempting to generate a layout with | |
2012 | * the best configuration and backing off gradually. | |
2013 | * | |
2014 | * First we reduce the acceptable waste in a slab. Then | |
2015 | * we reduce the minimum objects required in a slab. | |
2016 | */ | |
2017 | min_objects = slub_min_objects; | |
9b2cd506 CL |
2018 | if (!min_objects) |
2019 | min_objects = 4 * (fls(nr_cpu_ids) + 1); | |
e8120ff1 ZY |
2020 | max_objects = (PAGE_SIZE << slub_max_order)/size; |
2021 | min_objects = min(min_objects, max_objects); | |
2022 | ||
5e6d444e | 2023 | while (min_objects > 1) { |
c124f5b5 | 2024 | fraction = 16; |
5e6d444e CL |
2025 | while (fraction >= 4) { |
2026 | order = slab_order(size, min_objects, | |
2027 | slub_max_order, fraction); | |
2028 | if (order <= slub_max_order) | |
2029 | return order; | |
2030 | fraction /= 2; | |
2031 | } | |
5086c389 | 2032 | min_objects--; |
5e6d444e CL |
2033 | } |
2034 | ||
2035 | /* | |
2036 | * We were unable to place multiple objects in a slab. Now | |
2037 | * lets see if we can place a single object there. | |
2038 | */ | |
2039 | order = slab_order(size, 1, slub_max_order, 1); | |
2040 | if (order <= slub_max_order) | |
2041 | return order; | |
2042 | ||
2043 | /* | |
2044 | * Doh this slab cannot be placed using slub_max_order. | |
2045 | */ | |
2046 | order = slab_order(size, 1, MAX_ORDER, 1); | |
818cf590 | 2047 | if (order < MAX_ORDER) |
5e6d444e CL |
2048 | return order; |
2049 | return -ENOSYS; | |
2050 | } | |
2051 | ||
81819f0f | 2052 | /* |
672bba3a | 2053 | * Figure out what the alignment of the objects will be. |
81819f0f CL |
2054 | */ |
2055 | static unsigned long calculate_alignment(unsigned long flags, | |
2056 | unsigned long align, unsigned long size) | |
2057 | { | |
2058 | /* | |
6446faa2 CL |
2059 | * If the user wants hardware cache aligned objects then follow that |
2060 | * suggestion if the object is sufficiently large. | |
81819f0f | 2061 | * |
6446faa2 CL |
2062 | * The hardware cache alignment cannot override the specified |
2063 | * alignment though. If that is greater then use it. | |
81819f0f | 2064 | */ |
b6210386 NP |
2065 | if (flags & SLAB_HWCACHE_ALIGN) { |
2066 | unsigned long ralign = cache_line_size(); | |
2067 | while (size <= ralign / 2) | |
2068 | ralign /= 2; | |
2069 | align = max(align, ralign); | |
2070 | } | |
81819f0f CL |
2071 | |
2072 | if (align < ARCH_SLAB_MINALIGN) | |
b6210386 | 2073 | align = ARCH_SLAB_MINALIGN; |
81819f0f CL |
2074 | |
2075 | return ALIGN(align, sizeof(void *)); | |
2076 | } | |
2077 | ||
5595cffc PE |
2078 | static void |
2079 | init_kmem_cache_node(struct kmem_cache_node *n, struct kmem_cache *s) | |
81819f0f CL |
2080 | { |
2081 | n->nr_partial = 0; | |
81819f0f CL |
2082 | spin_lock_init(&n->list_lock); |
2083 | INIT_LIST_HEAD(&n->partial); | |
8ab1372f | 2084 | #ifdef CONFIG_SLUB_DEBUG |
0f389ec6 | 2085 | atomic_long_set(&n->nr_slabs, 0); |
02b71b70 | 2086 | atomic_long_set(&n->total_objects, 0); |
643b1138 | 2087 | INIT_LIST_HEAD(&n->full); |
8ab1372f | 2088 | #endif |
81819f0f CL |
2089 | } |
2090 | ||
55136592 | 2091 | static inline int alloc_kmem_cache_cpus(struct kmem_cache *s) |
4c93c355 | 2092 | { |
6c182dc0 CL |
2093 | BUILD_BUG_ON(PERCPU_DYNAMIC_EARLY_SIZE < |
2094 | SLUB_PAGE_SHIFT * sizeof(struct kmem_cache_cpu)); | |
4c93c355 | 2095 | |
6c182dc0 | 2096 | s->cpu_slab = alloc_percpu(struct kmem_cache_cpu); |
4c93c355 | 2097 | |
6c182dc0 | 2098 | return s->cpu_slab != NULL; |
4c93c355 | 2099 | } |
4c93c355 | 2100 | |
81819f0f | 2101 | #ifdef CONFIG_NUMA |
51df1142 CL |
2102 | static struct kmem_cache *kmem_cache_node; |
2103 | ||
81819f0f CL |
2104 | /* |
2105 | * No kmalloc_node yet so do it by hand. We know that this is the first | |
2106 | * slab on the node for this slabcache. There are no concurrent accesses | |
2107 | * possible. | |
2108 | * | |
2109 | * Note that this function only works on the kmalloc_node_cache | |
4c93c355 CL |
2110 | * when allocating for the kmalloc_node_cache. This is used for bootstrapping |
2111 | * memory on a fresh node that has no slab structures yet. | |
81819f0f | 2112 | */ |
55136592 | 2113 | static void early_kmem_cache_node_alloc(int node) |
81819f0f CL |
2114 | { |
2115 | struct page *page; | |
2116 | struct kmem_cache_node *n; | |
ba84c73c | 2117 | unsigned long flags; |
81819f0f | 2118 | |
51df1142 | 2119 | BUG_ON(kmem_cache_node->size < sizeof(struct kmem_cache_node)); |
81819f0f | 2120 | |
51df1142 | 2121 | page = new_slab(kmem_cache_node, GFP_NOWAIT, node); |
81819f0f CL |
2122 | |
2123 | BUG_ON(!page); | |
a2f92ee7 CL |
2124 | if (page_to_nid(page) != node) { |
2125 | printk(KERN_ERR "SLUB: Unable to allocate memory from " | |
2126 | "node %d\n", node); | |
2127 | printk(KERN_ERR "SLUB: Allocating a useless per node structure " | |
2128 | "in order to be able to continue\n"); | |
2129 | } | |
2130 | ||
81819f0f CL |
2131 | n = page->freelist; |
2132 | BUG_ON(!n); | |
51df1142 | 2133 | page->freelist = get_freepointer(kmem_cache_node, n); |
81819f0f | 2134 | page->inuse++; |
51df1142 | 2135 | kmem_cache_node->node[node] = n; |
8ab1372f | 2136 | #ifdef CONFIG_SLUB_DEBUG |
51df1142 CL |
2137 | init_object(kmem_cache_node, n, 1); |
2138 | init_tracking(kmem_cache_node, n); | |
8ab1372f | 2139 | #endif |
51df1142 CL |
2140 | init_kmem_cache_node(n, kmem_cache_node); |
2141 | inc_slabs_node(kmem_cache_node, node, page->objects); | |
6446faa2 | 2142 | |
ba84c73c | 2143 | /* |
2144 | * lockdep requires consistent irq usage for each lock | |
2145 | * so even though there cannot be a race this early in | |
2146 | * the boot sequence, we still disable irqs. | |
2147 | */ | |
2148 | local_irq_save(flags); | |
7c2e132c | 2149 | add_partial(n, page, 0); |
ba84c73c | 2150 | local_irq_restore(flags); |
81819f0f CL |
2151 | } |
2152 | ||
2153 | static void free_kmem_cache_nodes(struct kmem_cache *s) | |
2154 | { | |
2155 | int node; | |
2156 | ||
f64dc58c | 2157 | for_each_node_state(node, N_NORMAL_MEMORY) { |
81819f0f | 2158 | struct kmem_cache_node *n = s->node[node]; |
51df1142 | 2159 | |
73367bd8 | 2160 | if (n) |
51df1142 CL |
2161 | kmem_cache_free(kmem_cache_node, n); |
2162 | ||
81819f0f CL |
2163 | s->node[node] = NULL; |
2164 | } | |
2165 | } | |
2166 | ||
55136592 | 2167 | static int init_kmem_cache_nodes(struct kmem_cache *s) |
81819f0f CL |
2168 | { |
2169 | int node; | |
81819f0f | 2170 | |
f64dc58c | 2171 | for_each_node_state(node, N_NORMAL_MEMORY) { |
81819f0f CL |
2172 | struct kmem_cache_node *n; |
2173 | ||
73367bd8 | 2174 | if (slab_state == DOWN) { |
55136592 | 2175 | early_kmem_cache_node_alloc(node); |
73367bd8 AD |
2176 | continue; |
2177 | } | |
51df1142 | 2178 | n = kmem_cache_alloc_node(kmem_cache_node, |
55136592 | 2179 | GFP_KERNEL, node); |
81819f0f | 2180 | |
73367bd8 AD |
2181 | if (!n) { |
2182 | free_kmem_cache_nodes(s); | |
2183 | return 0; | |
81819f0f | 2184 | } |
73367bd8 | 2185 | |
81819f0f | 2186 | s->node[node] = n; |
5595cffc | 2187 | init_kmem_cache_node(n, s); |
81819f0f CL |
2188 | } |
2189 | return 1; | |
2190 | } | |
2191 | #else | |
2192 | static void free_kmem_cache_nodes(struct kmem_cache *s) | |
2193 | { | |
2194 | } | |
2195 | ||
55136592 | 2196 | static int init_kmem_cache_nodes(struct kmem_cache *s) |
81819f0f | 2197 | { |
5595cffc | 2198 | init_kmem_cache_node(&s->local_node, s); |
81819f0f CL |
2199 | return 1; |
2200 | } | |
2201 | #endif | |
2202 | ||
c0bdb232 | 2203 | static void set_min_partial(struct kmem_cache *s, unsigned long min) |
3b89d7d8 DR |
2204 | { |
2205 | if (min < MIN_PARTIAL) | |
2206 | min = MIN_PARTIAL; | |
2207 | else if (min > MAX_PARTIAL) | |
2208 | min = MAX_PARTIAL; | |
2209 | s->min_partial = min; | |
2210 | } | |
2211 | ||
81819f0f CL |
2212 | /* |
2213 | * calculate_sizes() determines the order and the distribution of data within | |
2214 | * a slab object. | |
2215 | */ | |
06b285dc | 2216 | static int calculate_sizes(struct kmem_cache *s, int forced_order) |
81819f0f CL |
2217 | { |
2218 | unsigned long flags = s->flags; | |
2219 | unsigned long size = s->objsize; | |
2220 | unsigned long align = s->align; | |
834f3d11 | 2221 | int order; |
81819f0f | 2222 | |
d8b42bf5 CL |
2223 | /* |
2224 | * Round up object size to the next word boundary. We can only | |
2225 | * place the free pointer at word boundaries and this determines | |
2226 | * the possible location of the free pointer. | |
2227 | */ | |
2228 | size = ALIGN(size, sizeof(void *)); | |
2229 | ||
2230 | #ifdef CONFIG_SLUB_DEBUG | |
81819f0f CL |
2231 | /* |
2232 | * Determine if we can poison the object itself. If the user of | |
2233 | * the slab may touch the object after free or before allocation | |
2234 | * then we should never poison the object itself. | |
2235 | */ | |
2236 | if ((flags & SLAB_POISON) && !(flags & SLAB_DESTROY_BY_RCU) && | |
c59def9f | 2237 | !s->ctor) |
81819f0f CL |
2238 | s->flags |= __OBJECT_POISON; |
2239 | else | |
2240 | s->flags &= ~__OBJECT_POISON; | |
2241 | ||
81819f0f CL |
2242 | |
2243 | /* | |
672bba3a | 2244 | * If we are Redzoning then check if there is some space between the |
81819f0f | 2245 | * end of the object and the free pointer. If not then add an |
672bba3a | 2246 | * additional word to have some bytes to store Redzone information. |
81819f0f CL |
2247 | */ |
2248 | if ((flags & SLAB_RED_ZONE) && size == s->objsize) | |
2249 | size += sizeof(void *); | |
41ecc55b | 2250 | #endif |
81819f0f CL |
2251 | |
2252 | /* | |
672bba3a CL |
2253 | * With that we have determined the number of bytes in actual use |
2254 | * by the object. This is the potential offset to the free pointer. | |
81819f0f CL |
2255 | */ |
2256 | s->inuse = size; | |
2257 | ||
2258 | if (((flags & (SLAB_DESTROY_BY_RCU | SLAB_POISON)) || | |
c59def9f | 2259 | s->ctor)) { |
81819f0f CL |
2260 | /* |
2261 | * Relocate free pointer after the object if it is not | |
2262 | * permitted to overwrite the first word of the object on | |
2263 | * kmem_cache_free. | |
2264 | * | |
2265 | * This is the case if we do RCU, have a constructor or | |
2266 | * destructor or are poisoning the objects. | |
2267 | */ | |
2268 | s->offset = size; | |
2269 | size += sizeof(void *); | |
2270 | } | |
2271 | ||
c12b3c62 | 2272 | #ifdef CONFIG_SLUB_DEBUG |
81819f0f CL |
2273 | if (flags & SLAB_STORE_USER) |
2274 | /* | |
2275 | * Need to store information about allocs and frees after | |
2276 | * the object. | |
2277 | */ | |
2278 | size += 2 * sizeof(struct track); | |
2279 | ||
be7b3fbc | 2280 | if (flags & SLAB_RED_ZONE) |
81819f0f CL |
2281 | /* |
2282 | * Add some empty padding so that we can catch | |
2283 | * overwrites from earlier objects rather than let | |
2284 | * tracking information or the free pointer be | |
0211a9c8 | 2285 | * corrupted if a user writes before the start |
81819f0f CL |
2286 | * of the object. |
2287 | */ | |
2288 | size += sizeof(void *); | |
41ecc55b | 2289 | #endif |
672bba3a | 2290 | |
81819f0f CL |
2291 | /* |
2292 | * Determine the alignment based on various parameters that the | |
65c02d4c CL |
2293 | * user specified and the dynamic determination of cache line size |
2294 | * on bootup. | |
81819f0f CL |
2295 | */ |
2296 | align = calculate_alignment(flags, align, s->objsize); | |
dcb0ce1b | 2297 | s->align = align; |
81819f0f CL |
2298 | |
2299 | /* | |
2300 | * SLUB stores one object immediately after another beginning from | |
2301 | * offset 0. In order to align the objects we have to simply size | |
2302 | * each object to conform to the alignment. | |
2303 | */ | |
2304 | size = ALIGN(size, align); | |
2305 | s->size = size; | |
06b285dc CL |
2306 | if (forced_order >= 0) |
2307 | order = forced_order; | |
2308 | else | |
2309 | order = calculate_order(size); | |
81819f0f | 2310 | |
834f3d11 | 2311 | if (order < 0) |
81819f0f CL |
2312 | return 0; |
2313 | ||
b7a49f0d | 2314 | s->allocflags = 0; |
834f3d11 | 2315 | if (order) |
b7a49f0d CL |
2316 | s->allocflags |= __GFP_COMP; |
2317 | ||
2318 | if (s->flags & SLAB_CACHE_DMA) | |
2319 | s->allocflags |= SLUB_DMA; | |
2320 | ||
2321 | if (s->flags & SLAB_RECLAIM_ACCOUNT) | |
2322 | s->allocflags |= __GFP_RECLAIMABLE; | |
2323 | ||
81819f0f CL |
2324 | /* |
2325 | * Determine the number of objects per slab | |
2326 | */ | |
834f3d11 | 2327 | s->oo = oo_make(order, size); |
65c3376a | 2328 | s->min = oo_make(get_order(size), size); |
205ab99d CL |
2329 | if (oo_objects(s->oo) > oo_objects(s->max)) |
2330 | s->max = s->oo; | |
81819f0f | 2331 | |
834f3d11 | 2332 | return !!oo_objects(s->oo); |
81819f0f CL |
2333 | |
2334 | } | |
2335 | ||
55136592 | 2336 | static int kmem_cache_open(struct kmem_cache *s, |
81819f0f CL |
2337 | const char *name, size_t size, |
2338 | size_t align, unsigned long flags, | |
51cc5068 | 2339 | void (*ctor)(void *)) |
81819f0f CL |
2340 | { |
2341 | memset(s, 0, kmem_size); | |
2342 | s->name = name; | |
2343 | s->ctor = ctor; | |
81819f0f | 2344 | s->objsize = size; |
81819f0f | 2345 | s->align = align; |
ba0268a8 | 2346 | s->flags = kmem_cache_flags(size, flags, name, ctor); |
81819f0f | 2347 | |
06b285dc | 2348 | if (!calculate_sizes(s, -1)) |
81819f0f | 2349 | goto error; |
3de47213 DR |
2350 | if (disable_higher_order_debug) { |
2351 | /* | |
2352 | * Disable debugging flags that store metadata if the min slab | |
2353 | * order increased. | |
2354 | */ | |
2355 | if (get_order(s->size) > get_order(s->objsize)) { | |
2356 | s->flags &= ~DEBUG_METADATA_FLAGS; | |
2357 | s->offset = 0; | |
2358 | if (!calculate_sizes(s, -1)) | |
2359 | goto error; | |
2360 | } | |
2361 | } | |
81819f0f | 2362 | |
3b89d7d8 DR |
2363 | /* |
2364 | * The larger the object size is, the more pages we want on the partial | |
2365 | * list to avoid pounding the page allocator excessively. | |
2366 | */ | |
c0bdb232 | 2367 | set_min_partial(s, ilog2(s->size)); |
81819f0f CL |
2368 | s->refcount = 1; |
2369 | #ifdef CONFIG_NUMA | |
e2cb96b7 | 2370 | s->remote_node_defrag_ratio = 1000; |
81819f0f | 2371 | #endif |
55136592 | 2372 | if (!init_kmem_cache_nodes(s)) |
dfb4f096 | 2373 | goto error; |
81819f0f | 2374 | |
55136592 | 2375 | if (alloc_kmem_cache_cpus(s)) |
81819f0f | 2376 | return 1; |
ff12059e | 2377 | |
4c93c355 | 2378 | free_kmem_cache_nodes(s); |
81819f0f CL |
2379 | error: |
2380 | if (flags & SLAB_PANIC) | |
2381 | panic("Cannot create slab %s size=%lu realsize=%u " | |
2382 | "order=%u offset=%u flags=%lx\n", | |
834f3d11 | 2383 | s->name, (unsigned long)size, s->size, oo_order(s->oo), |
81819f0f CL |
2384 | s->offset, flags); |
2385 | return 0; | |
2386 | } | |
81819f0f CL |
2387 | |
2388 | /* | |
2389 | * Check if a given pointer is valid | |
2390 | */ | |
2391 | int kmem_ptr_validate(struct kmem_cache *s, const void *object) | |
2392 | { | |
06428780 | 2393 | struct page *page; |
81819f0f | 2394 | |
d3e06e2b PE |
2395 | if (!kern_ptr_validate(object, s->size)) |
2396 | return 0; | |
2397 | ||
81819f0f CL |
2398 | page = get_object_page(object); |
2399 | ||
2400 | if (!page || s != page->slab) | |
2401 | /* No slab or wrong slab */ | |
2402 | return 0; | |
2403 | ||
abcd08a6 | 2404 | if (!check_valid_pointer(s, page, object)) |
81819f0f CL |
2405 | return 0; |
2406 | ||
2407 | /* | |
2408 | * We could also check if the object is on the slabs freelist. | |
2409 | * But this would be too expensive and it seems that the main | |
6446faa2 | 2410 | * purpose of kmem_ptr_valid() is to check if the object belongs |
81819f0f CL |
2411 | * to a certain slab. |
2412 | */ | |
2413 | return 1; | |
2414 | } | |
2415 | EXPORT_SYMBOL(kmem_ptr_validate); | |
2416 | ||
2417 | /* | |
2418 | * Determine the size of a slab object | |
2419 | */ | |
2420 | unsigned int kmem_cache_size(struct kmem_cache *s) | |
2421 | { | |
2422 | return s->objsize; | |
2423 | } | |
2424 | EXPORT_SYMBOL(kmem_cache_size); | |
2425 | ||
2426 | const char *kmem_cache_name(struct kmem_cache *s) | |
2427 | { | |
2428 | return s->name; | |
2429 | } | |
2430 | EXPORT_SYMBOL(kmem_cache_name); | |
2431 | ||
33b12c38 CL |
2432 | static void list_slab_objects(struct kmem_cache *s, struct page *page, |
2433 | const char *text) | |
2434 | { | |
2435 | #ifdef CONFIG_SLUB_DEBUG | |
2436 | void *addr = page_address(page); | |
2437 | void *p; | |
bbd7d57b ED |
2438 | long *map = kzalloc(BITS_TO_LONGS(page->objects) * sizeof(long), |
2439 | GFP_ATOMIC); | |
33b12c38 | 2440 | |
bbd7d57b ED |
2441 | if (!map) |
2442 | return; | |
33b12c38 CL |
2443 | slab_err(s, page, "%s", text); |
2444 | slab_lock(page); | |
2445 | for_each_free_object(p, s, page->freelist) | |
2446 | set_bit(slab_index(p, s, addr), map); | |
2447 | ||
2448 | for_each_object(p, s, addr, page->objects) { | |
2449 | ||
2450 | if (!test_bit(slab_index(p, s, addr), map)) { | |
2451 | printk(KERN_ERR "INFO: Object 0x%p @offset=%tu\n", | |
2452 | p, p - addr); | |
2453 | print_tracking(s, p); | |
2454 | } | |
2455 | } | |
2456 | slab_unlock(page); | |
bbd7d57b | 2457 | kfree(map); |
33b12c38 CL |
2458 | #endif |
2459 | } | |
2460 | ||
81819f0f | 2461 | /* |
599870b1 | 2462 | * Attempt to free all partial slabs on a node. |
81819f0f | 2463 | */ |
599870b1 | 2464 | static void free_partial(struct kmem_cache *s, struct kmem_cache_node *n) |
81819f0f | 2465 | { |
81819f0f CL |
2466 | unsigned long flags; |
2467 | struct page *page, *h; | |
2468 | ||
2469 | spin_lock_irqsave(&n->list_lock, flags); | |
33b12c38 | 2470 | list_for_each_entry_safe(page, h, &n->partial, lru) { |
81819f0f CL |
2471 | if (!page->inuse) { |
2472 | list_del(&page->lru); | |
2473 | discard_slab(s, page); | |
599870b1 | 2474 | n->nr_partial--; |
33b12c38 CL |
2475 | } else { |
2476 | list_slab_objects(s, page, | |
2477 | "Objects remaining on kmem_cache_close()"); | |
599870b1 | 2478 | } |
33b12c38 | 2479 | } |
81819f0f | 2480 | spin_unlock_irqrestore(&n->list_lock, flags); |
81819f0f CL |
2481 | } |
2482 | ||
2483 | /* | |
672bba3a | 2484 | * Release all resources used by a slab cache. |
81819f0f | 2485 | */ |
0c710013 | 2486 | static inline int kmem_cache_close(struct kmem_cache *s) |
81819f0f CL |
2487 | { |
2488 | int node; | |
2489 | ||
2490 | flush_all(s); | |
9dfc6e68 | 2491 | free_percpu(s->cpu_slab); |
81819f0f | 2492 | /* Attempt to free all objects */ |
f64dc58c | 2493 | for_each_node_state(node, N_NORMAL_MEMORY) { |
81819f0f CL |
2494 | struct kmem_cache_node *n = get_node(s, node); |
2495 | ||
599870b1 CL |
2496 | free_partial(s, n); |
2497 | if (n->nr_partial || slabs_node(s, node)) | |
81819f0f CL |
2498 | return 1; |
2499 | } | |
2500 | free_kmem_cache_nodes(s); | |
2501 | return 0; | |
2502 | } | |
2503 | ||
2504 | /* | |
2505 | * Close a cache and release the kmem_cache structure | |
2506 | * (must be used for caches created using kmem_cache_create) | |
2507 | */ | |
2508 | void kmem_cache_destroy(struct kmem_cache *s) | |
2509 | { | |
2510 | down_write(&slub_lock); | |
2511 | s->refcount--; | |
2512 | if (!s->refcount) { | |
2513 | list_del(&s->list); | |
d629d819 PE |
2514 | if (kmem_cache_close(s)) { |
2515 | printk(KERN_ERR "SLUB %s: %s called for cache that " | |
2516 | "still has objects.\n", s->name, __func__); | |
2517 | dump_stack(); | |
2518 | } | |
d76b1590 ED |
2519 | if (s->flags & SLAB_DESTROY_BY_RCU) |
2520 | rcu_barrier(); | |
81819f0f | 2521 | sysfs_slab_remove(s); |
2bce6485 CL |
2522 | } |
2523 | up_write(&slub_lock); | |
81819f0f CL |
2524 | } |
2525 | EXPORT_SYMBOL(kmem_cache_destroy); | |
2526 | ||
2527 | /******************************************************************** | |
2528 | * Kmalloc subsystem | |
2529 | *******************************************************************/ | |
2530 | ||
51df1142 | 2531 | struct kmem_cache *kmalloc_caches[SLUB_PAGE_SHIFT]; |
81819f0f CL |
2532 | EXPORT_SYMBOL(kmalloc_caches); |
2533 | ||
51df1142 CL |
2534 | static struct kmem_cache *kmem_cache; |
2535 | ||
55136592 | 2536 | #ifdef CONFIG_ZONE_DMA |
51df1142 | 2537 | static struct kmem_cache *kmalloc_dma_caches[SLUB_PAGE_SHIFT]; |
55136592 CL |
2538 | #endif |
2539 | ||
81819f0f CL |
2540 | static int __init setup_slub_min_order(char *str) |
2541 | { | |
06428780 | 2542 | get_option(&str, &slub_min_order); |
81819f0f CL |
2543 | |
2544 | return 1; | |
2545 | } | |
2546 | ||
2547 | __setup("slub_min_order=", setup_slub_min_order); | |
2548 | ||
2549 | static int __init setup_slub_max_order(char *str) | |
2550 | { | |
06428780 | 2551 | get_option(&str, &slub_max_order); |
818cf590 | 2552 | slub_max_order = min(slub_max_order, MAX_ORDER - 1); |
81819f0f CL |
2553 | |
2554 | return 1; | |
2555 | } | |
2556 | ||
2557 | __setup("slub_max_order=", setup_slub_max_order); | |
2558 | ||
2559 | static int __init setup_slub_min_objects(char *str) | |
2560 | { | |
06428780 | 2561 | get_option(&str, &slub_min_objects); |
81819f0f CL |
2562 | |
2563 | return 1; | |
2564 | } | |
2565 | ||
2566 | __setup("slub_min_objects=", setup_slub_min_objects); | |
2567 | ||
2568 | static int __init setup_slub_nomerge(char *str) | |
2569 | { | |
2570 | slub_nomerge = 1; | |
2571 | return 1; | |
2572 | } | |
2573 | ||
2574 | __setup("slub_nomerge", setup_slub_nomerge); | |
2575 | ||
51df1142 CL |
2576 | static struct kmem_cache *__init create_kmalloc_cache(const char *name, |
2577 | int size, unsigned int flags) | |
81819f0f | 2578 | { |
51df1142 CL |
2579 | struct kmem_cache *s; |
2580 | ||
2581 | s = kmem_cache_alloc(kmem_cache, GFP_NOWAIT); | |
2582 | ||
83b519e8 PE |
2583 | /* |
2584 | * This function is called with IRQs disabled during early-boot on | |
2585 | * single CPU so there's no need to take slub_lock here. | |
2586 | */ | |
55136592 | 2587 | if (!kmem_cache_open(s, name, size, ARCH_KMALLOC_MINALIGN, |
319d1e24 | 2588 | flags, NULL)) |
81819f0f CL |
2589 | goto panic; |
2590 | ||
2591 | list_add(&s->list, &slab_caches); | |
51df1142 | 2592 | return s; |
81819f0f CL |
2593 | |
2594 | panic: | |
2595 | panic("Creation of kmalloc slab %s size=%d failed.\n", name, size); | |
51df1142 | 2596 | return NULL; |
81819f0f CL |
2597 | } |
2598 | ||
f1b26339 CL |
2599 | /* |
2600 | * Conversion table for small slabs sizes / 8 to the index in the | |
2601 | * kmalloc array. This is necessary for slabs < 192 since we have non power | |
2602 | * of two cache sizes there. The size of larger slabs can be determined using | |
2603 | * fls. | |
2604 | */ | |
2605 | static s8 size_index[24] = { | |
2606 | 3, /* 8 */ | |
2607 | 4, /* 16 */ | |
2608 | 5, /* 24 */ | |
2609 | 5, /* 32 */ | |
2610 | 6, /* 40 */ | |
2611 | 6, /* 48 */ | |
2612 | 6, /* 56 */ | |
2613 | 6, /* 64 */ | |
2614 | 1, /* 72 */ | |
2615 | 1, /* 80 */ | |
2616 | 1, /* 88 */ | |
2617 | 1, /* 96 */ | |
2618 | 7, /* 104 */ | |
2619 | 7, /* 112 */ | |
2620 | 7, /* 120 */ | |
2621 | 7, /* 128 */ | |
2622 | 2, /* 136 */ | |
2623 | 2, /* 144 */ | |
2624 | 2, /* 152 */ | |
2625 | 2, /* 160 */ | |
2626 | 2, /* 168 */ | |
2627 | 2, /* 176 */ | |
2628 | 2, /* 184 */ | |
2629 | 2 /* 192 */ | |
2630 | }; | |
2631 | ||
acdfcd04 AK |
2632 | static inline int size_index_elem(size_t bytes) |
2633 | { | |
2634 | return (bytes - 1) / 8; | |
2635 | } | |
2636 | ||
81819f0f CL |
2637 | static struct kmem_cache *get_slab(size_t size, gfp_t flags) |
2638 | { | |
f1b26339 | 2639 | int index; |
81819f0f | 2640 | |
f1b26339 CL |
2641 | if (size <= 192) { |
2642 | if (!size) | |
2643 | return ZERO_SIZE_PTR; | |
81819f0f | 2644 | |
acdfcd04 | 2645 | index = size_index[size_index_elem(size)]; |
aadb4bc4 | 2646 | } else |
f1b26339 | 2647 | index = fls(size - 1); |
81819f0f CL |
2648 | |
2649 | #ifdef CONFIG_ZONE_DMA | |
f1b26339 | 2650 | if (unlikely((flags & SLUB_DMA))) |
51df1142 | 2651 | return kmalloc_dma_caches[index]; |
f1b26339 | 2652 | |
81819f0f | 2653 | #endif |
51df1142 | 2654 | return kmalloc_caches[index]; |
81819f0f CL |
2655 | } |
2656 | ||
2657 | void *__kmalloc(size_t size, gfp_t flags) | |
2658 | { | |
aadb4bc4 | 2659 | struct kmem_cache *s; |
5b882be4 | 2660 | void *ret; |
81819f0f | 2661 | |
ffadd4d0 | 2662 | if (unlikely(size > SLUB_MAX_SIZE)) |
eada35ef | 2663 | return kmalloc_large(size, flags); |
aadb4bc4 CL |
2664 | |
2665 | s = get_slab(size, flags); | |
2666 | ||
2667 | if (unlikely(ZERO_OR_NULL_PTR(s))) | |
6cb8f913 CL |
2668 | return s; |
2669 | ||
2154a336 | 2670 | ret = slab_alloc(s, flags, NUMA_NO_NODE, _RET_IP_); |
5b882be4 | 2671 | |
ca2b84cb | 2672 | trace_kmalloc(_RET_IP_, ret, size, s->size, flags); |
5b882be4 EGM |
2673 | |
2674 | return ret; | |
81819f0f CL |
2675 | } |
2676 | EXPORT_SYMBOL(__kmalloc); | |
2677 | ||
f619cfe1 CL |
2678 | static void *kmalloc_large_node(size_t size, gfp_t flags, int node) |
2679 | { | |
b1eeab67 | 2680 | struct page *page; |
e4f7c0b4 | 2681 | void *ptr = NULL; |
f619cfe1 | 2682 | |
b1eeab67 VN |
2683 | flags |= __GFP_COMP | __GFP_NOTRACK; |
2684 | page = alloc_pages_node(node, flags, get_order(size)); | |
f619cfe1 | 2685 | if (page) |
e4f7c0b4 CM |
2686 | ptr = page_address(page); |
2687 | ||
2688 | kmemleak_alloc(ptr, size, 1, flags); | |
2689 | return ptr; | |
f619cfe1 CL |
2690 | } |
2691 | ||
81819f0f CL |
2692 | #ifdef CONFIG_NUMA |
2693 | void *__kmalloc_node(size_t size, gfp_t flags, int node) | |
2694 | { | |
aadb4bc4 | 2695 | struct kmem_cache *s; |
5b882be4 | 2696 | void *ret; |
81819f0f | 2697 | |
057685cf | 2698 | if (unlikely(size > SLUB_MAX_SIZE)) { |
5b882be4 EGM |
2699 | ret = kmalloc_large_node(size, flags, node); |
2700 | ||
ca2b84cb EGM |
2701 | trace_kmalloc_node(_RET_IP_, ret, |
2702 | size, PAGE_SIZE << get_order(size), | |
2703 | flags, node); | |
5b882be4 EGM |
2704 | |
2705 | return ret; | |
2706 | } | |
aadb4bc4 CL |
2707 | |
2708 | s = get_slab(size, flags); | |
2709 | ||
2710 | if (unlikely(ZERO_OR_NULL_PTR(s))) | |
6cb8f913 CL |
2711 | return s; |
2712 | ||
5b882be4 EGM |
2713 | ret = slab_alloc(s, flags, node, _RET_IP_); |
2714 | ||
ca2b84cb | 2715 | trace_kmalloc_node(_RET_IP_, ret, size, s->size, flags, node); |
5b882be4 EGM |
2716 | |
2717 | return ret; | |
81819f0f CL |
2718 | } |
2719 | EXPORT_SYMBOL(__kmalloc_node); | |
2720 | #endif | |
2721 | ||
2722 | size_t ksize(const void *object) | |
2723 | { | |
272c1d21 | 2724 | struct page *page; |
81819f0f CL |
2725 | struct kmem_cache *s; |
2726 | ||
ef8b4520 | 2727 | if (unlikely(object == ZERO_SIZE_PTR)) |
272c1d21 CL |
2728 | return 0; |
2729 | ||
294a80a8 | 2730 | page = virt_to_head_page(object); |
294a80a8 | 2731 | |
76994412 PE |
2732 | if (unlikely(!PageSlab(page))) { |
2733 | WARN_ON(!PageCompound(page)); | |
294a80a8 | 2734 | return PAGE_SIZE << compound_order(page); |
76994412 | 2735 | } |
81819f0f | 2736 | s = page->slab; |
81819f0f | 2737 | |
ae20bfda | 2738 | #ifdef CONFIG_SLUB_DEBUG |
81819f0f CL |
2739 | /* |
2740 | * Debugging requires use of the padding between object | |
2741 | * and whatever may come after it. | |
2742 | */ | |
2743 | if (s->flags & (SLAB_RED_ZONE | SLAB_POISON)) | |
2744 | return s->objsize; | |
2745 | ||
ae20bfda | 2746 | #endif |
81819f0f CL |
2747 | /* |
2748 | * If we have the need to store the freelist pointer | |
2749 | * back there or track user information then we can | |
2750 | * only use the space before that information. | |
2751 | */ | |
2752 | if (s->flags & (SLAB_DESTROY_BY_RCU | SLAB_STORE_USER)) | |
2753 | return s->inuse; | |
81819f0f CL |
2754 | /* |
2755 | * Else we can use all the padding etc for the allocation | |
2756 | */ | |
2757 | return s->size; | |
2758 | } | |
b1aabecd | 2759 | EXPORT_SYMBOL(ksize); |
81819f0f CL |
2760 | |
2761 | void kfree(const void *x) | |
2762 | { | |
81819f0f | 2763 | struct page *page; |
5bb983b0 | 2764 | void *object = (void *)x; |
81819f0f | 2765 | |
2121db74 PE |
2766 | trace_kfree(_RET_IP_, x); |
2767 | ||
2408c550 | 2768 | if (unlikely(ZERO_OR_NULL_PTR(x))) |
81819f0f CL |
2769 | return; |
2770 | ||
b49af68f | 2771 | page = virt_to_head_page(x); |
aadb4bc4 | 2772 | if (unlikely(!PageSlab(page))) { |
0937502a | 2773 | BUG_ON(!PageCompound(page)); |
e4f7c0b4 | 2774 | kmemleak_free(x); |
aadb4bc4 CL |
2775 | put_page(page); |
2776 | return; | |
2777 | } | |
ce71e27c | 2778 | slab_free(page->slab, page, object, _RET_IP_); |
81819f0f CL |
2779 | } |
2780 | EXPORT_SYMBOL(kfree); | |
2781 | ||
2086d26a | 2782 | /* |
672bba3a CL |
2783 | * kmem_cache_shrink removes empty slabs from the partial lists and sorts |
2784 | * the remaining slabs by the number of items in use. The slabs with the | |
2785 | * most items in use come first. New allocations will then fill those up | |
2786 | * and thus they can be removed from the partial lists. | |
2787 | * | |
2788 | * The slabs with the least items are placed last. This results in them | |
2789 | * being allocated from last increasing the chance that the last objects | |
2790 | * are freed in them. | |
2086d26a CL |
2791 | */ |
2792 | int kmem_cache_shrink(struct kmem_cache *s) | |
2793 | { | |
2794 | int node; | |
2795 | int i; | |
2796 | struct kmem_cache_node *n; | |
2797 | struct page *page; | |
2798 | struct page *t; | |
205ab99d | 2799 | int objects = oo_objects(s->max); |
2086d26a | 2800 | struct list_head *slabs_by_inuse = |
834f3d11 | 2801 | kmalloc(sizeof(struct list_head) * objects, GFP_KERNEL); |
2086d26a CL |
2802 | unsigned long flags; |
2803 | ||
2804 | if (!slabs_by_inuse) | |
2805 | return -ENOMEM; | |
2806 | ||
2807 | flush_all(s); | |
f64dc58c | 2808 | for_each_node_state(node, N_NORMAL_MEMORY) { |
2086d26a CL |
2809 | n = get_node(s, node); |
2810 | ||
2811 | if (!n->nr_partial) | |
2812 | continue; | |
2813 | ||
834f3d11 | 2814 | for (i = 0; i < objects; i++) |
2086d26a CL |
2815 | INIT_LIST_HEAD(slabs_by_inuse + i); |
2816 | ||
2817 | spin_lock_irqsave(&n->list_lock, flags); | |
2818 | ||
2819 | /* | |
672bba3a | 2820 | * Build lists indexed by the items in use in each slab. |
2086d26a | 2821 | * |
672bba3a CL |
2822 | * Note that concurrent frees may occur while we hold the |
2823 | * list_lock. page->inuse here is the upper limit. | |
2086d26a CL |
2824 | */ |
2825 | list_for_each_entry_safe(page, t, &n->partial, lru) { | |
2826 | if (!page->inuse && slab_trylock(page)) { | |
2827 | /* | |
2828 | * Must hold slab lock here because slab_free | |
2829 | * may have freed the last object and be | |
2830 | * waiting to release the slab. | |
2831 | */ | |
2832 | list_del(&page->lru); | |
2833 | n->nr_partial--; | |
2834 | slab_unlock(page); | |
2835 | discard_slab(s, page); | |
2836 | } else { | |
fcda3d89 CL |
2837 | list_move(&page->lru, |
2838 | slabs_by_inuse + page->inuse); | |
2086d26a CL |
2839 | } |
2840 | } | |
2841 | ||
2086d26a | 2842 | /* |
672bba3a CL |
2843 | * Rebuild the partial list with the slabs filled up most |
2844 | * first and the least used slabs at the end. | |
2086d26a | 2845 | */ |
834f3d11 | 2846 | for (i = objects - 1; i >= 0; i--) |
2086d26a CL |
2847 | list_splice(slabs_by_inuse + i, n->partial.prev); |
2848 | ||
2086d26a CL |
2849 | spin_unlock_irqrestore(&n->list_lock, flags); |
2850 | } | |
2851 | ||
2852 | kfree(slabs_by_inuse); | |
2853 | return 0; | |
2854 | } | |
2855 | EXPORT_SYMBOL(kmem_cache_shrink); | |
2856 | ||
b9049e23 YG |
2857 | #if defined(CONFIG_NUMA) && defined(CONFIG_MEMORY_HOTPLUG) |
2858 | static int slab_mem_going_offline_callback(void *arg) | |
2859 | { | |
2860 | struct kmem_cache *s; | |
2861 | ||
2862 | down_read(&slub_lock); | |
2863 | list_for_each_entry(s, &slab_caches, list) | |
2864 | kmem_cache_shrink(s); | |
2865 | up_read(&slub_lock); | |
2866 | ||
2867 | return 0; | |
2868 | } | |
2869 | ||
2870 | static void slab_mem_offline_callback(void *arg) | |
2871 | { | |
2872 | struct kmem_cache_node *n; | |
2873 | struct kmem_cache *s; | |
2874 | struct memory_notify *marg = arg; | |
2875 | int offline_node; | |
2876 | ||
2877 | offline_node = marg->status_change_nid; | |
2878 | ||
2879 | /* | |
2880 | * If the node still has available memory. we need kmem_cache_node | |
2881 | * for it yet. | |
2882 | */ | |
2883 | if (offline_node < 0) | |
2884 | return; | |
2885 | ||
2886 | down_read(&slub_lock); | |
2887 | list_for_each_entry(s, &slab_caches, list) { | |
2888 | n = get_node(s, offline_node); | |
2889 | if (n) { | |
2890 | /* | |
2891 | * if n->nr_slabs > 0, slabs still exist on the node | |
2892 | * that is going down. We were unable to free them, | |
c9404c9c | 2893 | * and offline_pages() function shouldn't call this |
b9049e23 YG |
2894 | * callback. So, we must fail. |
2895 | */ | |
0f389ec6 | 2896 | BUG_ON(slabs_node(s, offline_node)); |
b9049e23 YG |
2897 | |
2898 | s->node[offline_node] = NULL; | |
2899 | kmem_cache_free(kmalloc_caches, n); | |
2900 | } | |
2901 | } | |
2902 | up_read(&slub_lock); | |
2903 | } | |
2904 | ||
2905 | static int slab_mem_going_online_callback(void *arg) | |
2906 | { | |
2907 | struct kmem_cache_node *n; | |
2908 | struct kmem_cache *s; | |
2909 | struct memory_notify *marg = arg; | |
2910 | int nid = marg->status_change_nid; | |
2911 | int ret = 0; | |
2912 | ||
2913 | /* | |
2914 | * If the node's memory is already available, then kmem_cache_node is | |
2915 | * already created. Nothing to do. | |
2916 | */ | |
2917 | if (nid < 0) | |
2918 | return 0; | |
2919 | ||
2920 | /* | |
0121c619 | 2921 | * We are bringing a node online. No memory is available yet. We must |
b9049e23 YG |
2922 | * allocate a kmem_cache_node structure in order to bring the node |
2923 | * online. | |
2924 | */ | |
2925 | down_read(&slub_lock); | |
2926 | list_for_each_entry(s, &slab_caches, list) { | |
2927 | /* | |
2928 | * XXX: kmem_cache_alloc_node will fallback to other nodes | |
2929 | * since memory is not yet available from the node that | |
2930 | * is brought up. | |
2931 | */ | |
2932 | n = kmem_cache_alloc(kmalloc_caches, GFP_KERNEL); | |
2933 | if (!n) { | |
2934 | ret = -ENOMEM; | |
2935 | goto out; | |
2936 | } | |
5595cffc | 2937 | init_kmem_cache_node(n, s); |
b9049e23 YG |
2938 | s->node[nid] = n; |
2939 | } | |
2940 | out: | |
2941 | up_read(&slub_lock); | |
2942 | return ret; | |
2943 | } | |
2944 | ||
2945 | static int slab_memory_callback(struct notifier_block *self, | |
2946 | unsigned long action, void *arg) | |
2947 | { | |
2948 | int ret = 0; | |
2949 | ||
2950 | switch (action) { | |
2951 | case MEM_GOING_ONLINE: | |
2952 | ret = slab_mem_going_online_callback(arg); | |
2953 | break; | |
2954 | case MEM_GOING_OFFLINE: | |
2955 | ret = slab_mem_going_offline_callback(arg); | |
2956 | break; | |
2957 | case MEM_OFFLINE: | |
2958 | case MEM_CANCEL_ONLINE: | |
2959 | slab_mem_offline_callback(arg); | |
2960 | break; | |
2961 | case MEM_ONLINE: | |
2962 | case MEM_CANCEL_OFFLINE: | |
2963 | break; | |
2964 | } | |
dc19f9db KH |
2965 | if (ret) |
2966 | ret = notifier_from_errno(ret); | |
2967 | else | |
2968 | ret = NOTIFY_OK; | |
b9049e23 YG |
2969 | return ret; |
2970 | } | |
2971 | ||
2972 | #endif /* CONFIG_MEMORY_HOTPLUG */ | |
2973 | ||
81819f0f CL |
2974 | /******************************************************************** |
2975 | * Basic setup of slabs | |
2976 | *******************************************************************/ | |
2977 | ||
51df1142 CL |
2978 | /* |
2979 | * Used for early kmem_cache structures that were allocated using | |
2980 | * the page allocator | |
2981 | */ | |
2982 | ||
2983 | static void __init kmem_cache_bootstrap_fixup(struct kmem_cache *s) | |
2984 | { | |
2985 | int node; | |
2986 | ||
2987 | list_add(&s->list, &slab_caches); | |
2988 | s->refcount = -1; | |
2989 | ||
2990 | for_each_node_state(node, N_NORMAL_MEMORY) { | |
2991 | struct kmem_cache_node *n = get_node(s, node); | |
2992 | struct page *p; | |
2993 | ||
2994 | if (n) { | |
2995 | list_for_each_entry(p, &n->partial, lru) | |
2996 | p->slab = s; | |
2997 | ||
2998 | #ifdef CONFIG_SLAB_DEBUG | |
2999 | list_for_each_entry(p, &n->full, lru) | |
3000 | p->slab = s; | |
3001 | #endif | |
3002 | } | |
3003 | } | |
3004 | } | |
3005 | ||
81819f0f CL |
3006 | void __init kmem_cache_init(void) |
3007 | { | |
3008 | int i; | |
4b356be0 | 3009 | int caches = 0; |
51df1142 CL |
3010 | struct kmem_cache *temp_kmem_cache; |
3011 | int order; | |
81819f0f CL |
3012 | |
3013 | #ifdef CONFIG_NUMA | |
51df1142 CL |
3014 | struct kmem_cache *temp_kmem_cache_node; |
3015 | unsigned long kmalloc_size; | |
3016 | ||
3017 | kmem_size = offsetof(struct kmem_cache, node) + | |
3018 | nr_node_ids * sizeof(struct kmem_cache_node *); | |
3019 | ||
3020 | /* Allocate two kmem_caches from the page allocator */ | |
3021 | kmalloc_size = ALIGN(kmem_size, cache_line_size()); | |
3022 | order = get_order(2 * kmalloc_size); | |
3023 | kmem_cache = (void *)__get_free_pages(GFP_NOWAIT, order); | |
3024 | ||
81819f0f CL |
3025 | /* |
3026 | * Must first have the slab cache available for the allocations of the | |
672bba3a | 3027 | * struct kmem_cache_node's. There is special bootstrap code in |
81819f0f CL |
3028 | * kmem_cache_open for slab_state == DOWN. |
3029 | */ | |
51df1142 CL |
3030 | kmem_cache_node = (void *)kmem_cache + kmalloc_size; |
3031 | ||
3032 | kmem_cache_open(kmem_cache_node, "kmem_cache_node", | |
3033 | sizeof(struct kmem_cache_node), | |
3034 | 0, SLAB_HWCACHE_ALIGN | SLAB_PANIC, NULL); | |
b9049e23 | 3035 | |
0c40ba4f | 3036 | hotplug_memory_notifier(slab_memory_callback, SLAB_CALLBACK_PRI); |
51df1142 CL |
3037 | #else |
3038 | /* Allocate a single kmem_cache from the page allocator */ | |
3039 | kmem_size = sizeof(struct kmem_cache); | |
3040 | order = get_order(kmem_size); | |
3041 | kmem_cache = (void *)__get_free_pages(GFP_NOWAIT, order); | |
81819f0f CL |
3042 | #endif |
3043 | ||
3044 | /* Able to allocate the per node structures */ | |
3045 | slab_state = PARTIAL; | |
3046 | ||
51df1142 CL |
3047 | temp_kmem_cache = kmem_cache; |
3048 | kmem_cache_open(kmem_cache, "kmem_cache", kmem_size, | |
3049 | 0, SLAB_HWCACHE_ALIGN | SLAB_PANIC, NULL); | |
3050 | kmem_cache = kmem_cache_alloc(kmem_cache, GFP_NOWAIT); | |
3051 | memcpy(kmem_cache, temp_kmem_cache, kmem_size); | |
81819f0f | 3052 | |
51df1142 CL |
3053 | #ifdef CONFIG_NUMA |
3054 | /* | |
3055 | * Allocate kmem_cache_node properly from the kmem_cache slab. | |
3056 | * kmem_cache_node is separately allocated so no need to | |
3057 | * update any list pointers. | |
3058 | */ | |
3059 | temp_kmem_cache_node = kmem_cache_node; | |
81819f0f | 3060 | |
51df1142 CL |
3061 | kmem_cache_node = kmem_cache_alloc(kmem_cache, GFP_NOWAIT); |
3062 | memcpy(kmem_cache_node, temp_kmem_cache_node, kmem_size); | |
3063 | ||
3064 | kmem_cache_bootstrap_fixup(kmem_cache_node); | |
3065 | ||
3066 | caches++; | |
3067 | #else | |
3068 | /* | |
3069 | * kmem_cache has kmem_cache_node embedded and we moved it! | |
3070 | * Update the list heads | |
3071 | */ | |
3072 | INIT_LIST_HEAD(&kmem_cache->local_node.partial); | |
3073 | list_splice(&temp_kmem_cache->local_node.partial, &kmem_cache->local_node.partial); | |
3074 | #ifdef CONFIG_SLUB_DEBUG | |
3075 | INIT_LIST_HEAD(&kmem_cache->local_node.full); | |
3076 | list_splice(&temp_kmem_cache->local_node.full, &kmem_cache->local_node.full); | |
3077 | #endif | |
3078 | #endif | |
3079 | kmem_cache_bootstrap_fixup(kmem_cache); | |
3080 | caches++; | |
3081 | /* Free temporary boot structure */ | |
3082 | free_pages((unsigned long)temp_kmem_cache, order); | |
3083 | ||
3084 | /* Now we can use the kmem_cache to allocate kmalloc slabs */ | |
f1b26339 CL |
3085 | |
3086 | /* | |
3087 | * Patch up the size_index table if we have strange large alignment | |
3088 | * requirements for the kmalloc array. This is only the case for | |
6446faa2 | 3089 | * MIPS it seems. The standard arches will not generate any code here. |
f1b26339 CL |
3090 | * |
3091 | * Largest permitted alignment is 256 bytes due to the way we | |
3092 | * handle the index determination for the smaller caches. | |
3093 | * | |
3094 | * Make sure that nothing crazy happens if someone starts tinkering | |
3095 | * around with ARCH_KMALLOC_MINALIGN | |
3096 | */ | |
3097 | BUILD_BUG_ON(KMALLOC_MIN_SIZE > 256 || | |
3098 | (KMALLOC_MIN_SIZE & (KMALLOC_MIN_SIZE - 1))); | |
3099 | ||
acdfcd04 AK |
3100 | for (i = 8; i < KMALLOC_MIN_SIZE; i += 8) { |
3101 | int elem = size_index_elem(i); | |
3102 | if (elem >= ARRAY_SIZE(size_index)) | |
3103 | break; | |
3104 | size_index[elem] = KMALLOC_SHIFT_LOW; | |
3105 | } | |
f1b26339 | 3106 | |
acdfcd04 AK |
3107 | if (KMALLOC_MIN_SIZE == 64) { |
3108 | /* | |
3109 | * The 96 byte size cache is not used if the alignment | |
3110 | * is 64 byte. | |
3111 | */ | |
3112 | for (i = 64 + 8; i <= 96; i += 8) | |
3113 | size_index[size_index_elem(i)] = 7; | |
3114 | } else if (KMALLOC_MIN_SIZE == 128) { | |
41d54d3b CL |
3115 | /* |
3116 | * The 192 byte sized cache is not used if the alignment | |
3117 | * is 128 byte. Redirect kmalloc to use the 256 byte cache | |
3118 | * instead. | |
3119 | */ | |
3120 | for (i = 128 + 8; i <= 192; i += 8) | |
acdfcd04 | 3121 | size_index[size_index_elem(i)] = 8; |
41d54d3b CL |
3122 | } |
3123 | ||
51df1142 CL |
3124 | /* Caches that are not of the two-to-the-power-of size */ |
3125 | if (KMALLOC_MIN_SIZE <= 32) { | |
3126 | kmalloc_caches[1] = create_kmalloc_cache("kmalloc-96", 96, 0); | |
3127 | caches++; | |
3128 | } | |
3129 | ||
3130 | if (KMALLOC_MIN_SIZE <= 64) { | |
3131 | kmalloc_caches[2] = create_kmalloc_cache("kmalloc-192", 192, 0); | |
3132 | caches++; | |
3133 | } | |
3134 | ||
3135 | for (i = KMALLOC_SHIFT_LOW; i < SLUB_PAGE_SHIFT; i++) { | |
3136 | kmalloc_caches[i] = create_kmalloc_cache("kmalloc", 1 << i, 0); | |
3137 | caches++; | |
3138 | } | |
3139 | ||
81819f0f CL |
3140 | slab_state = UP; |
3141 | ||
3142 | /* Provide the correct kmalloc names now that the caches are up */ | |
d7278bd7 CL |
3143 | for (i = KMALLOC_SHIFT_LOW; i < SLUB_PAGE_SHIFT; i++) { |
3144 | char *s = kasprintf(GFP_NOWAIT, "kmalloc-%d", 1 << i); | |
3145 | ||
3146 | BUG_ON(!s); | |
51df1142 | 3147 | kmalloc_caches[i]->name = s; |
d7278bd7 | 3148 | } |
81819f0f CL |
3149 | |
3150 | #ifdef CONFIG_SMP | |
3151 | register_cpu_notifier(&slab_notifier); | |
9dfc6e68 | 3152 | #endif |
81819f0f | 3153 | |
55136592 | 3154 | #ifdef CONFIG_ZONE_DMA |
51df1142 CL |
3155 | for (i = 0; i < SLUB_PAGE_SHIFT; i++) { |
3156 | struct kmem_cache *s = kmalloc_caches[i]; | |
55136592 | 3157 | |
51df1142 | 3158 | if (s && s->size) { |
55136592 CL |
3159 | char *name = kasprintf(GFP_NOWAIT, |
3160 | "dma-kmalloc-%d", s->objsize); | |
3161 | ||
3162 | BUG_ON(!name); | |
51df1142 CL |
3163 | kmalloc_dma_caches[i] = create_kmalloc_cache(name, |
3164 | s->objsize, SLAB_CACHE_DMA); | |
55136592 CL |
3165 | } |
3166 | } | |
3167 | #endif | |
3adbefee IM |
3168 | printk(KERN_INFO |
3169 | "SLUB: Genslabs=%d, HWalign=%d, Order=%d-%d, MinObjects=%d," | |
4b356be0 CL |
3170 | " CPUs=%d, Nodes=%d\n", |
3171 | caches, cache_line_size(), | |
81819f0f CL |
3172 | slub_min_order, slub_max_order, slub_min_objects, |
3173 | nr_cpu_ids, nr_node_ids); | |
3174 | } | |
3175 | ||
7e85ee0c PE |
3176 | void __init kmem_cache_init_late(void) |
3177 | { | |
7e85ee0c PE |
3178 | } |
3179 | ||
81819f0f CL |
3180 | /* |
3181 | * Find a mergeable slab cache | |
3182 | */ | |
3183 | static int slab_unmergeable(struct kmem_cache *s) | |
3184 | { | |
3185 | if (slub_nomerge || (s->flags & SLUB_NEVER_MERGE)) | |
3186 | return 1; | |
3187 | ||
c59def9f | 3188 | if (s->ctor) |
81819f0f CL |
3189 | return 1; |
3190 | ||
8ffa6875 CL |
3191 | /* |
3192 | * We may have set a slab to be unmergeable during bootstrap. | |
3193 | */ | |
3194 | if (s->refcount < 0) | |
3195 | return 1; | |
3196 | ||
81819f0f CL |
3197 | return 0; |
3198 | } | |
3199 | ||
3200 | static struct kmem_cache *find_mergeable(size_t size, | |
ba0268a8 | 3201 | size_t align, unsigned long flags, const char *name, |
51cc5068 | 3202 | void (*ctor)(void *)) |
81819f0f | 3203 | { |
5b95a4ac | 3204 | struct kmem_cache *s; |
81819f0f CL |
3205 | |
3206 | if (slub_nomerge || (flags & SLUB_NEVER_MERGE)) | |
3207 | return NULL; | |
3208 | ||
c59def9f | 3209 | if (ctor) |
81819f0f CL |
3210 | return NULL; |
3211 | ||
3212 | size = ALIGN(size, sizeof(void *)); | |
3213 | align = calculate_alignment(flags, align, size); | |
3214 | size = ALIGN(size, align); | |
ba0268a8 | 3215 | flags = kmem_cache_flags(size, flags, name, NULL); |
81819f0f | 3216 | |
5b95a4ac | 3217 | list_for_each_entry(s, &slab_caches, list) { |
81819f0f CL |
3218 | if (slab_unmergeable(s)) |
3219 | continue; | |
3220 | ||
3221 | if (size > s->size) | |
3222 | continue; | |
3223 | ||
ba0268a8 | 3224 | if ((flags & SLUB_MERGE_SAME) != (s->flags & SLUB_MERGE_SAME)) |
81819f0f CL |
3225 | continue; |
3226 | /* | |
3227 | * Check if alignment is compatible. | |
3228 | * Courtesy of Adrian Drzewiecki | |
3229 | */ | |
06428780 | 3230 | if ((s->size & ~(align - 1)) != s->size) |
81819f0f CL |
3231 | continue; |
3232 | ||
3233 | if (s->size - size >= sizeof(void *)) | |
3234 | continue; | |
3235 | ||
3236 | return s; | |
3237 | } | |
3238 | return NULL; | |
3239 | } | |
3240 | ||
3241 | struct kmem_cache *kmem_cache_create(const char *name, size_t size, | |
51cc5068 | 3242 | size_t align, unsigned long flags, void (*ctor)(void *)) |
81819f0f CL |
3243 | { |
3244 | struct kmem_cache *s; | |
3245 | ||
fe1ff49d BH |
3246 | if (WARN_ON(!name)) |
3247 | return NULL; | |
3248 | ||
81819f0f | 3249 | down_write(&slub_lock); |
ba0268a8 | 3250 | s = find_mergeable(size, align, flags, name, ctor); |
81819f0f CL |
3251 | if (s) { |
3252 | s->refcount++; | |
3253 | /* | |
3254 | * Adjust the object sizes so that we clear | |
3255 | * the complete object on kzalloc. | |
3256 | */ | |
3257 | s->objsize = max(s->objsize, (int)size); | |
3258 | s->inuse = max_t(int, s->inuse, ALIGN(size, sizeof(void *))); | |
6446faa2 | 3259 | |
7b8f3b66 | 3260 | if (sysfs_slab_alias(s, name)) { |
7b8f3b66 | 3261 | s->refcount--; |
81819f0f | 3262 | goto err; |
7b8f3b66 | 3263 | } |
2bce6485 | 3264 | up_write(&slub_lock); |
a0e1d1be CL |
3265 | return s; |
3266 | } | |
6446faa2 | 3267 | |
a0e1d1be CL |
3268 | s = kmalloc(kmem_size, GFP_KERNEL); |
3269 | if (s) { | |
55136592 | 3270 | if (kmem_cache_open(s, name, |
c59def9f | 3271 | size, align, flags, ctor)) { |
81819f0f | 3272 | list_add(&s->list, &slab_caches); |
7b8f3b66 | 3273 | if (sysfs_slab_add(s)) { |
7b8f3b66 | 3274 | list_del(&s->list); |
7b8f3b66 | 3275 | kfree(s); |
a0e1d1be | 3276 | goto err; |
7b8f3b66 | 3277 | } |
2bce6485 | 3278 | up_write(&slub_lock); |
a0e1d1be CL |
3279 | return s; |
3280 | } | |
3281 | kfree(s); | |
81819f0f CL |
3282 | } |
3283 | up_write(&slub_lock); | |
81819f0f CL |
3284 | |
3285 | err: | |
81819f0f CL |
3286 | if (flags & SLAB_PANIC) |
3287 | panic("Cannot create slabcache %s\n", name); | |
3288 | else | |
3289 | s = NULL; | |
3290 | return s; | |
3291 | } | |
3292 | EXPORT_SYMBOL(kmem_cache_create); | |
3293 | ||
81819f0f | 3294 | #ifdef CONFIG_SMP |
81819f0f | 3295 | /* |
672bba3a CL |
3296 | * Use the cpu notifier to insure that the cpu slabs are flushed when |
3297 | * necessary. | |
81819f0f CL |
3298 | */ |
3299 | static int __cpuinit slab_cpuup_callback(struct notifier_block *nfb, | |
3300 | unsigned long action, void *hcpu) | |
3301 | { | |
3302 | long cpu = (long)hcpu; | |
5b95a4ac CL |
3303 | struct kmem_cache *s; |
3304 | unsigned long flags; | |
81819f0f CL |
3305 | |
3306 | switch (action) { | |
3307 | case CPU_UP_CANCELED: | |
8bb78442 | 3308 | case CPU_UP_CANCELED_FROZEN: |
81819f0f | 3309 | case CPU_DEAD: |
8bb78442 | 3310 | case CPU_DEAD_FROZEN: |
5b95a4ac CL |
3311 | down_read(&slub_lock); |
3312 | list_for_each_entry(s, &slab_caches, list) { | |
3313 | local_irq_save(flags); | |
3314 | __flush_cpu_slab(s, cpu); | |
3315 | local_irq_restore(flags); | |
3316 | } | |
3317 | up_read(&slub_lock); | |
81819f0f CL |
3318 | break; |
3319 | default: | |
3320 | break; | |
3321 | } | |
3322 | return NOTIFY_OK; | |
3323 | } | |
3324 | ||
06428780 | 3325 | static struct notifier_block __cpuinitdata slab_notifier = { |
3adbefee | 3326 | .notifier_call = slab_cpuup_callback |
06428780 | 3327 | }; |
81819f0f CL |
3328 | |
3329 | #endif | |
3330 | ||
ce71e27c | 3331 | void *__kmalloc_track_caller(size_t size, gfp_t gfpflags, unsigned long caller) |
81819f0f | 3332 | { |
aadb4bc4 | 3333 | struct kmem_cache *s; |
94b528d0 | 3334 | void *ret; |
aadb4bc4 | 3335 | |
ffadd4d0 | 3336 | if (unlikely(size > SLUB_MAX_SIZE)) |
eada35ef PE |
3337 | return kmalloc_large(size, gfpflags); |
3338 | ||
aadb4bc4 | 3339 | s = get_slab(size, gfpflags); |
81819f0f | 3340 | |
2408c550 | 3341 | if (unlikely(ZERO_OR_NULL_PTR(s))) |
6cb8f913 | 3342 | return s; |
81819f0f | 3343 | |
2154a336 | 3344 | ret = slab_alloc(s, gfpflags, NUMA_NO_NODE, caller); |
94b528d0 EGM |
3345 | |
3346 | /* Honor the call site pointer we recieved. */ | |
ca2b84cb | 3347 | trace_kmalloc(caller, ret, size, s->size, gfpflags); |
94b528d0 EGM |
3348 | |
3349 | return ret; | |
81819f0f CL |
3350 | } |
3351 | ||
3352 | void *__kmalloc_node_track_caller(size_t size, gfp_t gfpflags, | |
ce71e27c | 3353 | int node, unsigned long caller) |
81819f0f | 3354 | { |
aadb4bc4 | 3355 | struct kmem_cache *s; |
94b528d0 | 3356 | void *ret; |
aadb4bc4 | 3357 | |
d3e14aa3 XF |
3358 | if (unlikely(size > SLUB_MAX_SIZE)) { |
3359 | ret = kmalloc_large_node(size, gfpflags, node); | |
3360 | ||
3361 | trace_kmalloc_node(caller, ret, | |
3362 | size, PAGE_SIZE << get_order(size), | |
3363 | gfpflags, node); | |
3364 | ||
3365 | return ret; | |
3366 | } | |
eada35ef | 3367 | |
aadb4bc4 | 3368 | s = get_slab(size, gfpflags); |
81819f0f | 3369 | |
2408c550 | 3370 | if (unlikely(ZERO_OR_NULL_PTR(s))) |
6cb8f913 | 3371 | return s; |
81819f0f | 3372 | |
94b528d0 EGM |
3373 | ret = slab_alloc(s, gfpflags, node, caller); |
3374 | ||
3375 | /* Honor the call site pointer we recieved. */ | |
ca2b84cb | 3376 | trace_kmalloc_node(caller, ret, size, s->size, gfpflags, node); |
94b528d0 EGM |
3377 | |
3378 | return ret; | |
81819f0f CL |
3379 | } |
3380 | ||
f6acb635 | 3381 | #ifdef CONFIG_SLUB_DEBUG |
205ab99d CL |
3382 | static int count_inuse(struct page *page) |
3383 | { | |
3384 | return page->inuse; | |
3385 | } | |
3386 | ||
3387 | static int count_total(struct page *page) | |
3388 | { | |
3389 | return page->objects; | |
3390 | } | |
3391 | ||
434e245d CL |
3392 | static int validate_slab(struct kmem_cache *s, struct page *page, |
3393 | unsigned long *map) | |
53e15af0 CL |
3394 | { |
3395 | void *p; | |
a973e9dd | 3396 | void *addr = page_address(page); |
53e15af0 CL |
3397 | |
3398 | if (!check_slab(s, page) || | |
3399 | !on_freelist(s, page, NULL)) | |
3400 | return 0; | |
3401 | ||
3402 | /* Now we know that a valid freelist exists */ | |
39b26464 | 3403 | bitmap_zero(map, page->objects); |
53e15af0 | 3404 | |
7656c72b CL |
3405 | for_each_free_object(p, s, page->freelist) { |
3406 | set_bit(slab_index(p, s, addr), map); | |
53e15af0 CL |
3407 | if (!check_object(s, page, p, 0)) |
3408 | return 0; | |
3409 | } | |
3410 | ||
224a88be | 3411 | for_each_object(p, s, addr, page->objects) |
7656c72b | 3412 | if (!test_bit(slab_index(p, s, addr), map)) |
53e15af0 CL |
3413 | if (!check_object(s, page, p, 1)) |
3414 | return 0; | |
3415 | return 1; | |
3416 | } | |
3417 | ||
434e245d CL |
3418 | static void validate_slab_slab(struct kmem_cache *s, struct page *page, |
3419 | unsigned long *map) | |
53e15af0 CL |
3420 | { |
3421 | if (slab_trylock(page)) { | |
434e245d | 3422 | validate_slab(s, page, map); |
53e15af0 CL |
3423 | slab_unlock(page); |
3424 | } else | |
3425 | printk(KERN_INFO "SLUB %s: Skipped busy slab 0x%p\n", | |
3426 | s->name, page); | |
53e15af0 CL |
3427 | } |
3428 | ||
434e245d CL |
3429 | static int validate_slab_node(struct kmem_cache *s, |
3430 | struct kmem_cache_node *n, unsigned long *map) | |
53e15af0 CL |
3431 | { |
3432 | unsigned long count = 0; | |
3433 | struct page *page; | |
3434 | unsigned long flags; | |
3435 | ||
3436 | spin_lock_irqsave(&n->list_lock, flags); | |
3437 | ||
3438 | list_for_each_entry(page, &n->partial, lru) { | |
434e245d | 3439 | validate_slab_slab(s, page, map); |
53e15af0 CL |
3440 | count++; |
3441 | } | |
3442 | if (count != n->nr_partial) | |
3443 | printk(KERN_ERR "SLUB %s: %ld partial slabs counted but " | |
3444 | "counter=%ld\n", s->name, count, n->nr_partial); | |
3445 | ||
3446 | if (!(s->flags & SLAB_STORE_USER)) | |
3447 | goto out; | |
3448 | ||
3449 | list_for_each_entry(page, &n->full, lru) { | |
434e245d | 3450 | validate_slab_slab(s, page, map); |
53e15af0 CL |
3451 | count++; |
3452 | } | |
3453 | if (count != atomic_long_read(&n->nr_slabs)) | |
3454 | printk(KERN_ERR "SLUB: %s %ld slabs counted but " | |
3455 | "counter=%ld\n", s->name, count, | |
3456 | atomic_long_read(&n->nr_slabs)); | |
3457 | ||
3458 | out: | |
3459 | spin_unlock_irqrestore(&n->list_lock, flags); | |
3460 | return count; | |
3461 | } | |
3462 | ||
434e245d | 3463 | static long validate_slab_cache(struct kmem_cache *s) |
53e15af0 CL |
3464 | { |
3465 | int node; | |
3466 | unsigned long count = 0; | |
205ab99d | 3467 | unsigned long *map = kmalloc(BITS_TO_LONGS(oo_objects(s->max)) * |
434e245d CL |
3468 | sizeof(unsigned long), GFP_KERNEL); |
3469 | ||
3470 | if (!map) | |
3471 | return -ENOMEM; | |
53e15af0 CL |
3472 | |
3473 | flush_all(s); | |
f64dc58c | 3474 | for_each_node_state(node, N_NORMAL_MEMORY) { |
53e15af0 CL |
3475 | struct kmem_cache_node *n = get_node(s, node); |
3476 | ||
434e245d | 3477 | count += validate_slab_node(s, n, map); |
53e15af0 | 3478 | } |
434e245d | 3479 | kfree(map); |
53e15af0 CL |
3480 | return count; |
3481 | } | |
3482 | ||
b3459709 CL |
3483 | #ifdef SLUB_RESILIENCY_TEST |
3484 | static void resiliency_test(void) | |
3485 | { | |
3486 | u8 *p; | |
3487 | ||
3488 | printk(KERN_ERR "SLUB resiliency testing\n"); | |
3489 | printk(KERN_ERR "-----------------------\n"); | |
3490 | printk(KERN_ERR "A. Corruption after allocation\n"); | |
3491 | ||
3492 | p = kzalloc(16, GFP_KERNEL); | |
3493 | p[16] = 0x12; | |
3494 | printk(KERN_ERR "\n1. kmalloc-16: Clobber Redzone/next pointer" | |
3495 | " 0x12->0x%p\n\n", p + 16); | |
3496 | ||
3497 | validate_slab_cache(kmalloc_caches + 4); | |
3498 | ||
3499 | /* Hmmm... The next two are dangerous */ | |
3500 | p = kzalloc(32, GFP_KERNEL); | |
3501 | p[32 + sizeof(void *)] = 0x34; | |
3502 | printk(KERN_ERR "\n2. kmalloc-32: Clobber next pointer/next slab" | |
3adbefee IM |
3503 | " 0x34 -> -0x%p\n", p); |
3504 | printk(KERN_ERR | |
3505 | "If allocated object is overwritten then not detectable\n\n"); | |
b3459709 CL |
3506 | |
3507 | validate_slab_cache(kmalloc_caches + 5); | |
3508 | p = kzalloc(64, GFP_KERNEL); | |
3509 | p += 64 + (get_cycles() & 0xff) * sizeof(void *); | |
3510 | *p = 0x56; | |
3511 | printk(KERN_ERR "\n3. kmalloc-64: corrupting random byte 0x56->0x%p\n", | |
3512 | p); | |
3adbefee IM |
3513 | printk(KERN_ERR |
3514 | "If allocated object is overwritten then not detectable\n\n"); | |
b3459709 CL |
3515 | validate_slab_cache(kmalloc_caches + 6); |
3516 | ||
3517 | printk(KERN_ERR "\nB. Corruption after free\n"); | |
3518 | p = kzalloc(128, GFP_KERNEL); | |
3519 | kfree(p); | |
3520 | *p = 0x78; | |
3521 | printk(KERN_ERR "1. kmalloc-128: Clobber first word 0x78->0x%p\n\n", p); | |
3522 | validate_slab_cache(kmalloc_caches + 7); | |
3523 | ||
3524 | p = kzalloc(256, GFP_KERNEL); | |
3525 | kfree(p); | |
3526 | p[50] = 0x9a; | |
3adbefee IM |
3527 | printk(KERN_ERR "\n2. kmalloc-256: Clobber 50th byte 0x9a->0x%p\n\n", |
3528 | p); | |
b3459709 CL |
3529 | validate_slab_cache(kmalloc_caches + 8); |
3530 | ||
3531 | p = kzalloc(512, GFP_KERNEL); | |
3532 | kfree(p); | |
3533 | p[512] = 0xab; | |
3534 | printk(KERN_ERR "\n3. kmalloc-512: Clobber redzone 0xab->0x%p\n\n", p); | |
3535 | validate_slab_cache(kmalloc_caches + 9); | |
3536 | } | |
3537 | #else | |
3538 | static void resiliency_test(void) {}; | |
3539 | #endif | |
3540 | ||
88a420e4 | 3541 | /* |
672bba3a | 3542 | * Generate lists of code addresses where slabcache objects are allocated |
88a420e4 CL |
3543 | * and freed. |
3544 | */ | |
3545 | ||
3546 | struct location { | |
3547 | unsigned long count; | |
ce71e27c | 3548 | unsigned long addr; |
45edfa58 CL |
3549 | long long sum_time; |
3550 | long min_time; | |
3551 | long max_time; | |
3552 | long min_pid; | |
3553 | long max_pid; | |
174596a0 | 3554 | DECLARE_BITMAP(cpus, NR_CPUS); |
45edfa58 | 3555 | nodemask_t nodes; |
88a420e4 CL |
3556 | }; |
3557 | ||
3558 | struct loc_track { | |
3559 | unsigned long max; | |
3560 | unsigned long count; | |
3561 | struct location *loc; | |
3562 | }; | |
3563 | ||
3564 | static void free_loc_track(struct loc_track *t) | |
3565 | { | |
3566 | if (t->max) | |
3567 | free_pages((unsigned long)t->loc, | |
3568 | get_order(sizeof(struct location) * t->max)); | |
3569 | } | |
3570 | ||
68dff6a9 | 3571 | static int alloc_loc_track(struct loc_track *t, unsigned long max, gfp_t flags) |
88a420e4 CL |
3572 | { |
3573 | struct location *l; | |
3574 | int order; | |
3575 | ||
88a420e4 CL |
3576 | order = get_order(sizeof(struct location) * max); |
3577 | ||
68dff6a9 | 3578 | l = (void *)__get_free_pages(flags, order); |
88a420e4 CL |
3579 | if (!l) |
3580 | return 0; | |
3581 | ||
3582 | if (t->count) { | |
3583 | memcpy(l, t->loc, sizeof(struct location) * t->count); | |
3584 | free_loc_track(t); | |
3585 | } | |
3586 | t->max = max; | |
3587 | t->loc = l; | |
3588 | return 1; | |
3589 | } | |
3590 | ||
3591 | static int add_location(struct loc_track *t, struct kmem_cache *s, | |
45edfa58 | 3592 | const struct track *track) |
88a420e4 CL |
3593 | { |
3594 | long start, end, pos; | |
3595 | struct location *l; | |
ce71e27c | 3596 | unsigned long caddr; |
45edfa58 | 3597 | unsigned long age = jiffies - track->when; |
88a420e4 CL |
3598 | |
3599 | start = -1; | |
3600 | end = t->count; | |
3601 | ||
3602 | for ( ; ; ) { | |
3603 | pos = start + (end - start + 1) / 2; | |
3604 | ||
3605 | /* | |
3606 | * There is nothing at "end". If we end up there | |
3607 | * we need to add something to before end. | |
3608 | */ | |
3609 | if (pos == end) | |
3610 | break; | |
3611 | ||
3612 | caddr = t->loc[pos].addr; | |
45edfa58 CL |
3613 | if (track->addr == caddr) { |
3614 | ||
3615 | l = &t->loc[pos]; | |
3616 | l->count++; | |
3617 | if (track->when) { | |
3618 | l->sum_time += age; | |
3619 | if (age < l->min_time) | |
3620 | l->min_time = age; | |
3621 | if (age > l->max_time) | |
3622 | l->max_time = age; | |
3623 | ||
3624 | if (track->pid < l->min_pid) | |
3625 | l->min_pid = track->pid; | |
3626 | if (track->pid > l->max_pid) | |
3627 | l->max_pid = track->pid; | |
3628 | ||
174596a0 RR |
3629 | cpumask_set_cpu(track->cpu, |
3630 | to_cpumask(l->cpus)); | |
45edfa58 CL |
3631 | } |
3632 | node_set(page_to_nid(virt_to_page(track)), l->nodes); | |
88a420e4 CL |
3633 | return 1; |
3634 | } | |
3635 | ||
45edfa58 | 3636 | if (track->addr < caddr) |
88a420e4 CL |
3637 | end = pos; |
3638 | else | |
3639 | start = pos; | |
3640 | } | |
3641 | ||
3642 | /* | |
672bba3a | 3643 | * Not found. Insert new tracking element. |
88a420e4 | 3644 | */ |
68dff6a9 | 3645 | if (t->count >= t->max && !alloc_loc_track(t, 2 * t->max, GFP_ATOMIC)) |
88a420e4 CL |
3646 | return 0; |
3647 | ||
3648 | l = t->loc + pos; | |
3649 | if (pos < t->count) | |
3650 | memmove(l + 1, l, | |
3651 | (t->count - pos) * sizeof(struct location)); | |
3652 | t->count++; | |
3653 | l->count = 1; | |
45edfa58 CL |
3654 | l->addr = track->addr; |
3655 | l->sum_time = age; | |
3656 | l->min_time = age; | |
3657 | l->max_time = age; | |
3658 | l->min_pid = track->pid; | |
3659 | l->max_pid = track->pid; | |
174596a0 RR |
3660 | cpumask_clear(to_cpumask(l->cpus)); |
3661 | cpumask_set_cpu(track->cpu, to_cpumask(l->cpus)); | |
45edfa58 CL |
3662 | nodes_clear(l->nodes); |
3663 | node_set(page_to_nid(virt_to_page(track)), l->nodes); | |
88a420e4 CL |
3664 | return 1; |
3665 | } | |
3666 | ||
3667 | static void process_slab(struct loc_track *t, struct kmem_cache *s, | |
bbd7d57b ED |
3668 | struct page *page, enum track_item alloc, |
3669 | long *map) | |
88a420e4 | 3670 | { |
a973e9dd | 3671 | void *addr = page_address(page); |
88a420e4 CL |
3672 | void *p; |
3673 | ||
39b26464 | 3674 | bitmap_zero(map, page->objects); |
7656c72b CL |
3675 | for_each_free_object(p, s, page->freelist) |
3676 | set_bit(slab_index(p, s, addr), map); | |
88a420e4 | 3677 | |
224a88be | 3678 | for_each_object(p, s, addr, page->objects) |
45edfa58 CL |
3679 | if (!test_bit(slab_index(p, s, addr), map)) |
3680 | add_location(t, s, get_track(s, p, alloc)); | |
88a420e4 CL |
3681 | } |
3682 | ||
3683 | static int list_locations(struct kmem_cache *s, char *buf, | |
3684 | enum track_item alloc) | |
3685 | { | |
e374d483 | 3686 | int len = 0; |
88a420e4 | 3687 | unsigned long i; |
68dff6a9 | 3688 | struct loc_track t = { 0, 0, NULL }; |
88a420e4 | 3689 | int node; |
bbd7d57b ED |
3690 | unsigned long *map = kmalloc(BITS_TO_LONGS(oo_objects(s->max)) * |
3691 | sizeof(unsigned long), GFP_KERNEL); | |
88a420e4 | 3692 | |
bbd7d57b ED |
3693 | if (!map || !alloc_loc_track(&t, PAGE_SIZE / sizeof(struct location), |
3694 | GFP_TEMPORARY)) { | |
3695 | kfree(map); | |
68dff6a9 | 3696 | return sprintf(buf, "Out of memory\n"); |
bbd7d57b | 3697 | } |
88a420e4 CL |
3698 | /* Push back cpu slabs */ |
3699 | flush_all(s); | |
3700 | ||
f64dc58c | 3701 | for_each_node_state(node, N_NORMAL_MEMORY) { |
88a420e4 CL |
3702 | struct kmem_cache_node *n = get_node(s, node); |
3703 | unsigned long flags; | |
3704 | struct page *page; | |
3705 | ||
9e86943b | 3706 | if (!atomic_long_read(&n->nr_slabs)) |
88a420e4 CL |
3707 | continue; |
3708 | ||
3709 | spin_lock_irqsave(&n->list_lock, flags); | |
3710 | list_for_each_entry(page, &n->partial, lru) | |
bbd7d57b | 3711 | process_slab(&t, s, page, alloc, map); |
88a420e4 | 3712 | list_for_each_entry(page, &n->full, lru) |
bbd7d57b | 3713 | process_slab(&t, s, page, alloc, map); |
88a420e4 CL |
3714 | spin_unlock_irqrestore(&n->list_lock, flags); |
3715 | } | |
3716 | ||
3717 | for (i = 0; i < t.count; i++) { | |
45edfa58 | 3718 | struct location *l = &t.loc[i]; |
88a420e4 | 3719 | |
9c246247 | 3720 | if (len > PAGE_SIZE - KSYM_SYMBOL_LEN - 100) |
88a420e4 | 3721 | break; |
e374d483 | 3722 | len += sprintf(buf + len, "%7ld ", l->count); |
45edfa58 CL |
3723 | |
3724 | if (l->addr) | |
e374d483 | 3725 | len += sprint_symbol(buf + len, (unsigned long)l->addr); |
88a420e4 | 3726 | else |
e374d483 | 3727 | len += sprintf(buf + len, "<not-available>"); |
45edfa58 CL |
3728 | |
3729 | if (l->sum_time != l->min_time) { | |
e374d483 | 3730 | len += sprintf(buf + len, " age=%ld/%ld/%ld", |
f8bd2258 RZ |
3731 | l->min_time, |
3732 | (long)div_u64(l->sum_time, l->count), | |
3733 | l->max_time); | |
45edfa58 | 3734 | } else |
e374d483 | 3735 | len += sprintf(buf + len, " age=%ld", |
45edfa58 CL |
3736 | l->min_time); |
3737 | ||
3738 | if (l->min_pid != l->max_pid) | |
e374d483 | 3739 | len += sprintf(buf + len, " pid=%ld-%ld", |
45edfa58 CL |
3740 | l->min_pid, l->max_pid); |
3741 | else | |
e374d483 | 3742 | len += sprintf(buf + len, " pid=%ld", |
45edfa58 CL |
3743 | l->min_pid); |
3744 | ||
174596a0 RR |
3745 | if (num_online_cpus() > 1 && |
3746 | !cpumask_empty(to_cpumask(l->cpus)) && | |
e374d483 HH |
3747 | len < PAGE_SIZE - 60) { |
3748 | len += sprintf(buf + len, " cpus="); | |
3749 | len += cpulist_scnprintf(buf + len, PAGE_SIZE - len - 50, | |
174596a0 | 3750 | to_cpumask(l->cpus)); |
45edfa58 CL |
3751 | } |
3752 | ||
62bc62a8 | 3753 | if (nr_online_nodes > 1 && !nodes_empty(l->nodes) && |
e374d483 HH |
3754 | len < PAGE_SIZE - 60) { |
3755 | len += sprintf(buf + len, " nodes="); | |
3756 | len += nodelist_scnprintf(buf + len, PAGE_SIZE - len - 50, | |
45edfa58 CL |
3757 | l->nodes); |
3758 | } | |
3759 | ||
e374d483 | 3760 | len += sprintf(buf + len, "\n"); |
88a420e4 CL |
3761 | } |
3762 | ||
3763 | free_loc_track(&t); | |
bbd7d57b | 3764 | kfree(map); |
88a420e4 | 3765 | if (!t.count) |
e374d483 HH |
3766 | len += sprintf(buf, "No data\n"); |
3767 | return len; | |
88a420e4 CL |
3768 | } |
3769 | ||
81819f0f | 3770 | enum slab_stat_type { |
205ab99d CL |
3771 | SL_ALL, /* All slabs */ |
3772 | SL_PARTIAL, /* Only partially allocated slabs */ | |
3773 | SL_CPU, /* Only slabs used for cpu caches */ | |
3774 | SL_OBJECTS, /* Determine allocated objects not slabs */ | |
3775 | SL_TOTAL /* Determine object capacity not slabs */ | |
81819f0f CL |
3776 | }; |
3777 | ||
205ab99d | 3778 | #define SO_ALL (1 << SL_ALL) |
81819f0f CL |
3779 | #define SO_PARTIAL (1 << SL_PARTIAL) |
3780 | #define SO_CPU (1 << SL_CPU) | |
3781 | #define SO_OBJECTS (1 << SL_OBJECTS) | |
205ab99d | 3782 | #define SO_TOTAL (1 << SL_TOTAL) |
81819f0f | 3783 | |
62e5c4b4 CG |
3784 | static ssize_t show_slab_objects(struct kmem_cache *s, |
3785 | char *buf, unsigned long flags) | |
81819f0f CL |
3786 | { |
3787 | unsigned long total = 0; | |
81819f0f CL |
3788 | int node; |
3789 | int x; | |
3790 | unsigned long *nodes; | |
3791 | unsigned long *per_cpu; | |
3792 | ||
3793 | nodes = kzalloc(2 * sizeof(unsigned long) * nr_node_ids, GFP_KERNEL); | |
62e5c4b4 CG |
3794 | if (!nodes) |
3795 | return -ENOMEM; | |
81819f0f CL |
3796 | per_cpu = nodes + nr_node_ids; |
3797 | ||
205ab99d CL |
3798 | if (flags & SO_CPU) { |
3799 | int cpu; | |
81819f0f | 3800 | |
205ab99d | 3801 | for_each_possible_cpu(cpu) { |
9dfc6e68 | 3802 | struct kmem_cache_cpu *c = per_cpu_ptr(s->cpu_slab, cpu); |
dfb4f096 | 3803 | |
205ab99d CL |
3804 | if (!c || c->node < 0) |
3805 | continue; | |
3806 | ||
3807 | if (c->page) { | |
3808 | if (flags & SO_TOTAL) | |
3809 | x = c->page->objects; | |
3810 | else if (flags & SO_OBJECTS) | |
3811 | x = c->page->inuse; | |
81819f0f CL |
3812 | else |
3813 | x = 1; | |
205ab99d | 3814 | |
81819f0f | 3815 | total += x; |
205ab99d | 3816 | nodes[c->node] += x; |
81819f0f | 3817 | } |
205ab99d | 3818 | per_cpu[c->node]++; |
81819f0f CL |
3819 | } |
3820 | } | |
3821 | ||
205ab99d CL |
3822 | if (flags & SO_ALL) { |
3823 | for_each_node_state(node, N_NORMAL_MEMORY) { | |
3824 | struct kmem_cache_node *n = get_node(s, node); | |
3825 | ||
3826 | if (flags & SO_TOTAL) | |
3827 | x = atomic_long_read(&n->total_objects); | |
3828 | else if (flags & SO_OBJECTS) | |
3829 | x = atomic_long_read(&n->total_objects) - | |
3830 | count_partial(n, count_free); | |
81819f0f | 3831 | |
81819f0f | 3832 | else |
205ab99d | 3833 | x = atomic_long_read(&n->nr_slabs); |
81819f0f CL |
3834 | total += x; |
3835 | nodes[node] += x; | |
3836 | } | |
3837 | ||
205ab99d CL |
3838 | } else if (flags & SO_PARTIAL) { |
3839 | for_each_node_state(node, N_NORMAL_MEMORY) { | |
3840 | struct kmem_cache_node *n = get_node(s, node); | |
81819f0f | 3841 | |
205ab99d CL |
3842 | if (flags & SO_TOTAL) |
3843 | x = count_partial(n, count_total); | |
3844 | else if (flags & SO_OBJECTS) | |
3845 | x = count_partial(n, count_inuse); | |
81819f0f | 3846 | else |
205ab99d | 3847 | x = n->nr_partial; |
81819f0f CL |
3848 | total += x; |
3849 | nodes[node] += x; | |
3850 | } | |
3851 | } | |
81819f0f CL |
3852 | x = sprintf(buf, "%lu", total); |
3853 | #ifdef CONFIG_NUMA | |
f64dc58c | 3854 | for_each_node_state(node, N_NORMAL_MEMORY) |
81819f0f CL |
3855 | if (nodes[node]) |
3856 | x += sprintf(buf + x, " N%d=%lu", | |
3857 | node, nodes[node]); | |
3858 | #endif | |
3859 | kfree(nodes); | |
3860 | return x + sprintf(buf + x, "\n"); | |
3861 | } | |
3862 | ||
3863 | static int any_slab_objects(struct kmem_cache *s) | |
3864 | { | |
3865 | int node; | |
81819f0f | 3866 | |
dfb4f096 | 3867 | for_each_online_node(node) { |
81819f0f CL |
3868 | struct kmem_cache_node *n = get_node(s, node); |
3869 | ||
dfb4f096 CL |
3870 | if (!n) |
3871 | continue; | |
3872 | ||
4ea33e2d | 3873 | if (atomic_long_read(&n->total_objects)) |
81819f0f CL |
3874 | return 1; |
3875 | } | |
3876 | return 0; | |
3877 | } | |
3878 | ||
3879 | #define to_slab_attr(n) container_of(n, struct slab_attribute, attr) | |
3880 | #define to_slab(n) container_of(n, struct kmem_cache, kobj); | |
3881 | ||
3882 | struct slab_attribute { | |
3883 | struct attribute attr; | |
3884 | ssize_t (*show)(struct kmem_cache *s, char *buf); | |
3885 | ssize_t (*store)(struct kmem_cache *s, const char *x, size_t count); | |
3886 | }; | |
3887 | ||
3888 | #define SLAB_ATTR_RO(_name) \ | |
3889 | static struct slab_attribute _name##_attr = __ATTR_RO(_name) | |
3890 | ||
3891 | #define SLAB_ATTR(_name) \ | |
3892 | static struct slab_attribute _name##_attr = \ | |
3893 | __ATTR(_name, 0644, _name##_show, _name##_store) | |
3894 | ||
81819f0f CL |
3895 | static ssize_t slab_size_show(struct kmem_cache *s, char *buf) |
3896 | { | |
3897 | return sprintf(buf, "%d\n", s->size); | |
3898 | } | |
3899 | SLAB_ATTR_RO(slab_size); | |
3900 | ||
3901 | static ssize_t align_show(struct kmem_cache *s, char *buf) | |
3902 | { | |
3903 | return sprintf(buf, "%d\n", s->align); | |
3904 | } | |
3905 | SLAB_ATTR_RO(align); | |
3906 | ||
3907 | static ssize_t object_size_show(struct kmem_cache *s, char *buf) | |
3908 | { | |
3909 | return sprintf(buf, "%d\n", s->objsize); | |
3910 | } | |
3911 | SLAB_ATTR_RO(object_size); | |
3912 | ||
3913 | static ssize_t objs_per_slab_show(struct kmem_cache *s, char *buf) | |
3914 | { | |
834f3d11 | 3915 | return sprintf(buf, "%d\n", oo_objects(s->oo)); |
81819f0f CL |
3916 | } |
3917 | SLAB_ATTR_RO(objs_per_slab); | |
3918 | ||
06b285dc CL |
3919 | static ssize_t order_store(struct kmem_cache *s, |
3920 | const char *buf, size_t length) | |
3921 | { | |
0121c619 CL |
3922 | unsigned long order; |
3923 | int err; | |
3924 | ||
3925 | err = strict_strtoul(buf, 10, &order); | |
3926 | if (err) | |
3927 | return err; | |
06b285dc CL |
3928 | |
3929 | if (order > slub_max_order || order < slub_min_order) | |
3930 | return -EINVAL; | |
3931 | ||
3932 | calculate_sizes(s, order); | |
3933 | return length; | |
3934 | } | |
3935 | ||
81819f0f CL |
3936 | static ssize_t order_show(struct kmem_cache *s, char *buf) |
3937 | { | |
834f3d11 | 3938 | return sprintf(buf, "%d\n", oo_order(s->oo)); |
81819f0f | 3939 | } |
06b285dc | 3940 | SLAB_ATTR(order); |
81819f0f | 3941 | |
73d342b1 DR |
3942 | static ssize_t min_partial_show(struct kmem_cache *s, char *buf) |
3943 | { | |
3944 | return sprintf(buf, "%lu\n", s->min_partial); | |
3945 | } | |
3946 | ||
3947 | static ssize_t min_partial_store(struct kmem_cache *s, const char *buf, | |
3948 | size_t length) | |
3949 | { | |
3950 | unsigned long min; | |
3951 | int err; | |
3952 | ||
3953 | err = strict_strtoul(buf, 10, &min); | |
3954 | if (err) | |
3955 | return err; | |
3956 | ||
c0bdb232 | 3957 | set_min_partial(s, min); |
73d342b1 DR |
3958 | return length; |
3959 | } | |
3960 | SLAB_ATTR(min_partial); | |
3961 | ||
81819f0f CL |
3962 | static ssize_t ctor_show(struct kmem_cache *s, char *buf) |
3963 | { | |
3964 | if (s->ctor) { | |
3965 | int n = sprint_symbol(buf, (unsigned long)s->ctor); | |
3966 | ||
3967 | return n + sprintf(buf + n, "\n"); | |
3968 | } | |
3969 | return 0; | |
3970 | } | |
3971 | SLAB_ATTR_RO(ctor); | |
3972 | ||
81819f0f CL |
3973 | static ssize_t aliases_show(struct kmem_cache *s, char *buf) |
3974 | { | |
3975 | return sprintf(buf, "%d\n", s->refcount - 1); | |
3976 | } | |
3977 | SLAB_ATTR_RO(aliases); | |
3978 | ||
3979 | static ssize_t slabs_show(struct kmem_cache *s, char *buf) | |
3980 | { | |
205ab99d | 3981 | return show_slab_objects(s, buf, SO_ALL); |
81819f0f CL |
3982 | } |
3983 | SLAB_ATTR_RO(slabs); | |
3984 | ||
3985 | static ssize_t partial_show(struct kmem_cache *s, char *buf) | |
3986 | { | |
d9acf4b7 | 3987 | return show_slab_objects(s, buf, SO_PARTIAL); |
81819f0f CL |
3988 | } |
3989 | SLAB_ATTR_RO(partial); | |
3990 | ||
3991 | static ssize_t cpu_slabs_show(struct kmem_cache *s, char *buf) | |
3992 | { | |
d9acf4b7 | 3993 | return show_slab_objects(s, buf, SO_CPU); |
81819f0f CL |
3994 | } |
3995 | SLAB_ATTR_RO(cpu_slabs); | |
3996 | ||
3997 | static ssize_t objects_show(struct kmem_cache *s, char *buf) | |
3998 | { | |
205ab99d | 3999 | return show_slab_objects(s, buf, SO_ALL|SO_OBJECTS); |
81819f0f CL |
4000 | } |
4001 | SLAB_ATTR_RO(objects); | |
4002 | ||
205ab99d CL |
4003 | static ssize_t objects_partial_show(struct kmem_cache *s, char *buf) |
4004 | { | |
4005 | return show_slab_objects(s, buf, SO_PARTIAL|SO_OBJECTS); | |
4006 | } | |
4007 | SLAB_ATTR_RO(objects_partial); | |
4008 | ||
4009 | static ssize_t total_objects_show(struct kmem_cache *s, char *buf) | |
4010 | { | |
4011 | return show_slab_objects(s, buf, SO_ALL|SO_TOTAL); | |
4012 | } | |
4013 | SLAB_ATTR_RO(total_objects); | |
4014 | ||
81819f0f CL |
4015 | static ssize_t sanity_checks_show(struct kmem_cache *s, char *buf) |
4016 | { | |
4017 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_DEBUG_FREE)); | |
4018 | } | |
4019 | ||
4020 | static ssize_t sanity_checks_store(struct kmem_cache *s, | |
4021 | const char *buf, size_t length) | |
4022 | { | |
4023 | s->flags &= ~SLAB_DEBUG_FREE; | |
4024 | if (buf[0] == '1') | |
4025 | s->flags |= SLAB_DEBUG_FREE; | |
4026 | return length; | |
4027 | } | |
4028 | SLAB_ATTR(sanity_checks); | |
4029 | ||
4030 | static ssize_t trace_show(struct kmem_cache *s, char *buf) | |
4031 | { | |
4032 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_TRACE)); | |
4033 | } | |
4034 | ||
4035 | static ssize_t trace_store(struct kmem_cache *s, const char *buf, | |
4036 | size_t length) | |
4037 | { | |
4038 | s->flags &= ~SLAB_TRACE; | |
4039 | if (buf[0] == '1') | |
4040 | s->flags |= SLAB_TRACE; | |
4041 | return length; | |
4042 | } | |
4043 | SLAB_ATTR(trace); | |
4044 | ||
4c13dd3b DM |
4045 | #ifdef CONFIG_FAILSLAB |
4046 | static ssize_t failslab_show(struct kmem_cache *s, char *buf) | |
4047 | { | |
4048 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_FAILSLAB)); | |
4049 | } | |
4050 | ||
4051 | static ssize_t failslab_store(struct kmem_cache *s, const char *buf, | |
4052 | size_t length) | |
4053 | { | |
4054 | s->flags &= ~SLAB_FAILSLAB; | |
4055 | if (buf[0] == '1') | |
4056 | s->flags |= SLAB_FAILSLAB; | |
4057 | return length; | |
4058 | } | |
4059 | SLAB_ATTR(failslab); | |
4060 | #endif | |
4061 | ||
81819f0f CL |
4062 | static ssize_t reclaim_account_show(struct kmem_cache *s, char *buf) |
4063 | { | |
4064 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_RECLAIM_ACCOUNT)); | |
4065 | } | |
4066 | ||
4067 | static ssize_t reclaim_account_store(struct kmem_cache *s, | |
4068 | const char *buf, size_t length) | |
4069 | { | |
4070 | s->flags &= ~SLAB_RECLAIM_ACCOUNT; | |
4071 | if (buf[0] == '1') | |
4072 | s->flags |= SLAB_RECLAIM_ACCOUNT; | |
4073 | return length; | |
4074 | } | |
4075 | SLAB_ATTR(reclaim_account); | |
4076 | ||
4077 | static ssize_t hwcache_align_show(struct kmem_cache *s, char *buf) | |
4078 | { | |
5af60839 | 4079 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_HWCACHE_ALIGN)); |
81819f0f CL |
4080 | } |
4081 | SLAB_ATTR_RO(hwcache_align); | |
4082 | ||
4083 | #ifdef CONFIG_ZONE_DMA | |
4084 | static ssize_t cache_dma_show(struct kmem_cache *s, char *buf) | |
4085 | { | |
4086 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_CACHE_DMA)); | |
4087 | } | |
4088 | SLAB_ATTR_RO(cache_dma); | |
4089 | #endif | |
4090 | ||
4091 | static ssize_t destroy_by_rcu_show(struct kmem_cache *s, char *buf) | |
4092 | { | |
4093 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_DESTROY_BY_RCU)); | |
4094 | } | |
4095 | SLAB_ATTR_RO(destroy_by_rcu); | |
4096 | ||
4097 | static ssize_t red_zone_show(struct kmem_cache *s, char *buf) | |
4098 | { | |
4099 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_RED_ZONE)); | |
4100 | } | |
4101 | ||
4102 | static ssize_t red_zone_store(struct kmem_cache *s, | |
4103 | const char *buf, size_t length) | |
4104 | { | |
4105 | if (any_slab_objects(s)) | |
4106 | return -EBUSY; | |
4107 | ||
4108 | s->flags &= ~SLAB_RED_ZONE; | |
4109 | if (buf[0] == '1') | |
4110 | s->flags |= SLAB_RED_ZONE; | |
06b285dc | 4111 | calculate_sizes(s, -1); |
81819f0f CL |
4112 | return length; |
4113 | } | |
4114 | SLAB_ATTR(red_zone); | |
4115 | ||
4116 | static ssize_t poison_show(struct kmem_cache *s, char *buf) | |
4117 | { | |
4118 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_POISON)); | |
4119 | } | |
4120 | ||
4121 | static ssize_t poison_store(struct kmem_cache *s, | |
4122 | const char *buf, size_t length) | |
4123 | { | |
4124 | if (any_slab_objects(s)) | |
4125 | return -EBUSY; | |
4126 | ||
4127 | s->flags &= ~SLAB_POISON; | |
4128 | if (buf[0] == '1') | |
4129 | s->flags |= SLAB_POISON; | |
06b285dc | 4130 | calculate_sizes(s, -1); |
81819f0f CL |
4131 | return length; |
4132 | } | |
4133 | SLAB_ATTR(poison); | |
4134 | ||
4135 | static ssize_t store_user_show(struct kmem_cache *s, char *buf) | |
4136 | { | |
4137 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_STORE_USER)); | |
4138 | } | |
4139 | ||
4140 | static ssize_t store_user_store(struct kmem_cache *s, | |
4141 | const char *buf, size_t length) | |
4142 | { | |
4143 | if (any_slab_objects(s)) | |
4144 | return -EBUSY; | |
4145 | ||
4146 | s->flags &= ~SLAB_STORE_USER; | |
4147 | if (buf[0] == '1') | |
4148 | s->flags |= SLAB_STORE_USER; | |
06b285dc | 4149 | calculate_sizes(s, -1); |
81819f0f CL |
4150 | return length; |
4151 | } | |
4152 | SLAB_ATTR(store_user); | |
4153 | ||
53e15af0 CL |
4154 | static ssize_t validate_show(struct kmem_cache *s, char *buf) |
4155 | { | |
4156 | return 0; | |
4157 | } | |
4158 | ||
4159 | static ssize_t validate_store(struct kmem_cache *s, | |
4160 | const char *buf, size_t length) | |
4161 | { | |
434e245d CL |
4162 | int ret = -EINVAL; |
4163 | ||
4164 | if (buf[0] == '1') { | |
4165 | ret = validate_slab_cache(s); | |
4166 | if (ret >= 0) | |
4167 | ret = length; | |
4168 | } | |
4169 | return ret; | |
53e15af0 CL |
4170 | } |
4171 | SLAB_ATTR(validate); | |
4172 | ||
2086d26a CL |
4173 | static ssize_t shrink_show(struct kmem_cache *s, char *buf) |
4174 | { | |
4175 | return 0; | |
4176 | } | |
4177 | ||
4178 | static ssize_t shrink_store(struct kmem_cache *s, | |
4179 | const char *buf, size_t length) | |
4180 | { | |
4181 | if (buf[0] == '1') { | |
4182 | int rc = kmem_cache_shrink(s); | |
4183 | ||
4184 | if (rc) | |
4185 | return rc; | |
4186 | } else | |
4187 | return -EINVAL; | |
4188 | return length; | |
4189 | } | |
4190 | SLAB_ATTR(shrink); | |
4191 | ||
88a420e4 CL |
4192 | static ssize_t alloc_calls_show(struct kmem_cache *s, char *buf) |
4193 | { | |
4194 | if (!(s->flags & SLAB_STORE_USER)) | |
4195 | return -ENOSYS; | |
4196 | return list_locations(s, buf, TRACK_ALLOC); | |
4197 | } | |
4198 | SLAB_ATTR_RO(alloc_calls); | |
4199 | ||
4200 | static ssize_t free_calls_show(struct kmem_cache *s, char *buf) | |
4201 | { | |
4202 | if (!(s->flags & SLAB_STORE_USER)) | |
4203 | return -ENOSYS; | |
4204 | return list_locations(s, buf, TRACK_FREE); | |
4205 | } | |
4206 | SLAB_ATTR_RO(free_calls); | |
4207 | ||
81819f0f | 4208 | #ifdef CONFIG_NUMA |
9824601e | 4209 | static ssize_t remote_node_defrag_ratio_show(struct kmem_cache *s, char *buf) |
81819f0f | 4210 | { |
9824601e | 4211 | return sprintf(buf, "%d\n", s->remote_node_defrag_ratio / 10); |
81819f0f CL |
4212 | } |
4213 | ||
9824601e | 4214 | static ssize_t remote_node_defrag_ratio_store(struct kmem_cache *s, |
81819f0f CL |
4215 | const char *buf, size_t length) |
4216 | { | |
0121c619 CL |
4217 | unsigned long ratio; |
4218 | int err; | |
4219 | ||
4220 | err = strict_strtoul(buf, 10, &ratio); | |
4221 | if (err) | |
4222 | return err; | |
4223 | ||
e2cb96b7 | 4224 | if (ratio <= 100) |
0121c619 | 4225 | s->remote_node_defrag_ratio = ratio * 10; |
81819f0f | 4226 | |
81819f0f CL |
4227 | return length; |
4228 | } | |
9824601e | 4229 | SLAB_ATTR(remote_node_defrag_ratio); |
81819f0f CL |
4230 | #endif |
4231 | ||
8ff12cfc | 4232 | #ifdef CONFIG_SLUB_STATS |
8ff12cfc CL |
4233 | static int show_stat(struct kmem_cache *s, char *buf, enum stat_item si) |
4234 | { | |
4235 | unsigned long sum = 0; | |
4236 | int cpu; | |
4237 | int len; | |
4238 | int *data = kmalloc(nr_cpu_ids * sizeof(int), GFP_KERNEL); | |
4239 | ||
4240 | if (!data) | |
4241 | return -ENOMEM; | |
4242 | ||
4243 | for_each_online_cpu(cpu) { | |
9dfc6e68 | 4244 | unsigned x = per_cpu_ptr(s->cpu_slab, cpu)->stat[si]; |
8ff12cfc CL |
4245 | |
4246 | data[cpu] = x; | |
4247 | sum += x; | |
4248 | } | |
4249 | ||
4250 | len = sprintf(buf, "%lu", sum); | |
4251 | ||
50ef37b9 | 4252 | #ifdef CONFIG_SMP |
8ff12cfc CL |
4253 | for_each_online_cpu(cpu) { |
4254 | if (data[cpu] && len < PAGE_SIZE - 20) | |
50ef37b9 | 4255 | len += sprintf(buf + len, " C%d=%u", cpu, data[cpu]); |
8ff12cfc | 4256 | } |
50ef37b9 | 4257 | #endif |
8ff12cfc CL |
4258 | kfree(data); |
4259 | return len + sprintf(buf + len, "\n"); | |
4260 | } | |
4261 | ||
78eb00cc DR |
4262 | static void clear_stat(struct kmem_cache *s, enum stat_item si) |
4263 | { | |
4264 | int cpu; | |
4265 | ||
4266 | for_each_online_cpu(cpu) | |
9dfc6e68 | 4267 | per_cpu_ptr(s->cpu_slab, cpu)->stat[si] = 0; |
78eb00cc DR |
4268 | } |
4269 | ||
8ff12cfc CL |
4270 | #define STAT_ATTR(si, text) \ |
4271 | static ssize_t text##_show(struct kmem_cache *s, char *buf) \ | |
4272 | { \ | |
4273 | return show_stat(s, buf, si); \ | |
4274 | } \ | |
78eb00cc DR |
4275 | static ssize_t text##_store(struct kmem_cache *s, \ |
4276 | const char *buf, size_t length) \ | |
4277 | { \ | |
4278 | if (buf[0] != '0') \ | |
4279 | return -EINVAL; \ | |
4280 | clear_stat(s, si); \ | |
4281 | return length; \ | |
4282 | } \ | |
4283 | SLAB_ATTR(text); \ | |
8ff12cfc CL |
4284 | |
4285 | STAT_ATTR(ALLOC_FASTPATH, alloc_fastpath); | |
4286 | STAT_ATTR(ALLOC_SLOWPATH, alloc_slowpath); | |
4287 | STAT_ATTR(FREE_FASTPATH, free_fastpath); | |
4288 | STAT_ATTR(FREE_SLOWPATH, free_slowpath); | |
4289 | STAT_ATTR(FREE_FROZEN, free_frozen); | |
4290 | STAT_ATTR(FREE_ADD_PARTIAL, free_add_partial); | |
4291 | STAT_ATTR(FREE_REMOVE_PARTIAL, free_remove_partial); | |
4292 | STAT_ATTR(ALLOC_FROM_PARTIAL, alloc_from_partial); | |
4293 | STAT_ATTR(ALLOC_SLAB, alloc_slab); | |
4294 | STAT_ATTR(ALLOC_REFILL, alloc_refill); | |
4295 | STAT_ATTR(FREE_SLAB, free_slab); | |
4296 | STAT_ATTR(CPUSLAB_FLUSH, cpuslab_flush); | |
4297 | STAT_ATTR(DEACTIVATE_FULL, deactivate_full); | |
4298 | STAT_ATTR(DEACTIVATE_EMPTY, deactivate_empty); | |
4299 | STAT_ATTR(DEACTIVATE_TO_HEAD, deactivate_to_head); | |
4300 | STAT_ATTR(DEACTIVATE_TO_TAIL, deactivate_to_tail); | |
4301 | STAT_ATTR(DEACTIVATE_REMOTE_FREES, deactivate_remote_frees); | |
65c3376a | 4302 | STAT_ATTR(ORDER_FALLBACK, order_fallback); |
8ff12cfc CL |
4303 | #endif |
4304 | ||
06428780 | 4305 | static struct attribute *slab_attrs[] = { |
81819f0f CL |
4306 | &slab_size_attr.attr, |
4307 | &object_size_attr.attr, | |
4308 | &objs_per_slab_attr.attr, | |
4309 | &order_attr.attr, | |
73d342b1 | 4310 | &min_partial_attr.attr, |
81819f0f | 4311 | &objects_attr.attr, |
205ab99d CL |
4312 | &objects_partial_attr.attr, |
4313 | &total_objects_attr.attr, | |
81819f0f CL |
4314 | &slabs_attr.attr, |
4315 | &partial_attr.attr, | |
4316 | &cpu_slabs_attr.attr, | |
4317 | &ctor_attr.attr, | |
81819f0f CL |
4318 | &aliases_attr.attr, |
4319 | &align_attr.attr, | |
4320 | &sanity_checks_attr.attr, | |
4321 | &trace_attr.attr, | |
4322 | &hwcache_align_attr.attr, | |
4323 | &reclaim_account_attr.attr, | |
4324 | &destroy_by_rcu_attr.attr, | |
4325 | &red_zone_attr.attr, | |
4326 | &poison_attr.attr, | |
4327 | &store_user_attr.attr, | |
53e15af0 | 4328 | &validate_attr.attr, |
2086d26a | 4329 | &shrink_attr.attr, |
88a420e4 CL |
4330 | &alloc_calls_attr.attr, |
4331 | &free_calls_attr.attr, | |
81819f0f CL |
4332 | #ifdef CONFIG_ZONE_DMA |
4333 | &cache_dma_attr.attr, | |
4334 | #endif | |
4335 | #ifdef CONFIG_NUMA | |
9824601e | 4336 | &remote_node_defrag_ratio_attr.attr, |
8ff12cfc CL |
4337 | #endif |
4338 | #ifdef CONFIG_SLUB_STATS | |
4339 | &alloc_fastpath_attr.attr, | |
4340 | &alloc_slowpath_attr.attr, | |
4341 | &free_fastpath_attr.attr, | |
4342 | &free_slowpath_attr.attr, | |
4343 | &free_frozen_attr.attr, | |
4344 | &free_add_partial_attr.attr, | |
4345 | &free_remove_partial_attr.attr, | |
4346 | &alloc_from_partial_attr.attr, | |
4347 | &alloc_slab_attr.attr, | |
4348 | &alloc_refill_attr.attr, | |
4349 | &free_slab_attr.attr, | |
4350 | &cpuslab_flush_attr.attr, | |
4351 | &deactivate_full_attr.attr, | |
4352 | &deactivate_empty_attr.attr, | |
4353 | &deactivate_to_head_attr.attr, | |
4354 | &deactivate_to_tail_attr.attr, | |
4355 | &deactivate_remote_frees_attr.attr, | |
65c3376a | 4356 | &order_fallback_attr.attr, |
81819f0f | 4357 | #endif |
4c13dd3b DM |
4358 | #ifdef CONFIG_FAILSLAB |
4359 | &failslab_attr.attr, | |
4360 | #endif | |
4361 | ||
81819f0f CL |
4362 | NULL |
4363 | }; | |
4364 | ||
4365 | static struct attribute_group slab_attr_group = { | |
4366 | .attrs = slab_attrs, | |
4367 | }; | |
4368 | ||
4369 | static ssize_t slab_attr_show(struct kobject *kobj, | |
4370 | struct attribute *attr, | |
4371 | char *buf) | |
4372 | { | |
4373 | struct slab_attribute *attribute; | |
4374 | struct kmem_cache *s; | |
4375 | int err; | |
4376 | ||
4377 | attribute = to_slab_attr(attr); | |
4378 | s = to_slab(kobj); | |
4379 | ||
4380 | if (!attribute->show) | |
4381 | return -EIO; | |
4382 | ||
4383 | err = attribute->show(s, buf); | |
4384 | ||
4385 | return err; | |
4386 | } | |
4387 | ||
4388 | static ssize_t slab_attr_store(struct kobject *kobj, | |
4389 | struct attribute *attr, | |
4390 | const char *buf, size_t len) | |
4391 | { | |
4392 | struct slab_attribute *attribute; | |
4393 | struct kmem_cache *s; | |
4394 | int err; | |
4395 | ||
4396 | attribute = to_slab_attr(attr); | |
4397 | s = to_slab(kobj); | |
4398 | ||
4399 | if (!attribute->store) | |
4400 | return -EIO; | |
4401 | ||
4402 | err = attribute->store(s, buf, len); | |
4403 | ||
4404 | return err; | |
4405 | } | |
4406 | ||
151c602f CL |
4407 | static void kmem_cache_release(struct kobject *kobj) |
4408 | { | |
4409 | struct kmem_cache *s = to_slab(kobj); | |
4410 | ||
4411 | kfree(s); | |
4412 | } | |
4413 | ||
52cf25d0 | 4414 | static const struct sysfs_ops slab_sysfs_ops = { |
81819f0f CL |
4415 | .show = slab_attr_show, |
4416 | .store = slab_attr_store, | |
4417 | }; | |
4418 | ||
4419 | static struct kobj_type slab_ktype = { | |
4420 | .sysfs_ops = &slab_sysfs_ops, | |
151c602f | 4421 | .release = kmem_cache_release |
81819f0f CL |
4422 | }; |
4423 | ||
4424 | static int uevent_filter(struct kset *kset, struct kobject *kobj) | |
4425 | { | |
4426 | struct kobj_type *ktype = get_ktype(kobj); | |
4427 | ||
4428 | if (ktype == &slab_ktype) | |
4429 | return 1; | |
4430 | return 0; | |
4431 | } | |
4432 | ||
9cd43611 | 4433 | static const struct kset_uevent_ops slab_uevent_ops = { |
81819f0f CL |
4434 | .filter = uevent_filter, |
4435 | }; | |
4436 | ||
27c3a314 | 4437 | static struct kset *slab_kset; |
81819f0f CL |
4438 | |
4439 | #define ID_STR_LENGTH 64 | |
4440 | ||
4441 | /* Create a unique string id for a slab cache: | |
6446faa2 CL |
4442 | * |
4443 | * Format :[flags-]size | |
81819f0f CL |
4444 | */ |
4445 | static char *create_unique_id(struct kmem_cache *s) | |
4446 | { | |
4447 | char *name = kmalloc(ID_STR_LENGTH, GFP_KERNEL); | |
4448 | char *p = name; | |
4449 | ||
4450 | BUG_ON(!name); | |
4451 | ||
4452 | *p++ = ':'; | |
4453 | /* | |
4454 | * First flags affecting slabcache operations. We will only | |
4455 | * get here for aliasable slabs so we do not need to support | |
4456 | * too many flags. The flags here must cover all flags that | |
4457 | * are matched during merging to guarantee that the id is | |
4458 | * unique. | |
4459 | */ | |
4460 | if (s->flags & SLAB_CACHE_DMA) | |
4461 | *p++ = 'd'; | |
4462 | if (s->flags & SLAB_RECLAIM_ACCOUNT) | |
4463 | *p++ = 'a'; | |
4464 | if (s->flags & SLAB_DEBUG_FREE) | |
4465 | *p++ = 'F'; | |
5a896d9e VN |
4466 | if (!(s->flags & SLAB_NOTRACK)) |
4467 | *p++ = 't'; | |
81819f0f CL |
4468 | if (p != name + 1) |
4469 | *p++ = '-'; | |
4470 | p += sprintf(p, "%07d", s->size); | |
4471 | BUG_ON(p > name + ID_STR_LENGTH - 1); | |
4472 | return name; | |
4473 | } | |
4474 | ||
4475 | static int sysfs_slab_add(struct kmem_cache *s) | |
4476 | { | |
4477 | int err; | |
4478 | const char *name; | |
4479 | int unmergeable; | |
4480 | ||
4481 | if (slab_state < SYSFS) | |
4482 | /* Defer until later */ | |
4483 | return 0; | |
4484 | ||
4485 | unmergeable = slab_unmergeable(s); | |
4486 | if (unmergeable) { | |
4487 | /* | |
4488 | * Slabcache can never be merged so we can use the name proper. | |
4489 | * This is typically the case for debug situations. In that | |
4490 | * case we can catch duplicate names easily. | |
4491 | */ | |
27c3a314 | 4492 | sysfs_remove_link(&slab_kset->kobj, s->name); |
81819f0f CL |
4493 | name = s->name; |
4494 | } else { | |
4495 | /* | |
4496 | * Create a unique name for the slab as a target | |
4497 | * for the symlinks. | |
4498 | */ | |
4499 | name = create_unique_id(s); | |
4500 | } | |
4501 | ||
27c3a314 | 4502 | s->kobj.kset = slab_kset; |
1eada11c GKH |
4503 | err = kobject_init_and_add(&s->kobj, &slab_ktype, NULL, name); |
4504 | if (err) { | |
4505 | kobject_put(&s->kobj); | |
81819f0f | 4506 | return err; |
1eada11c | 4507 | } |
81819f0f CL |
4508 | |
4509 | err = sysfs_create_group(&s->kobj, &slab_attr_group); | |
5788d8ad XF |
4510 | if (err) { |
4511 | kobject_del(&s->kobj); | |
4512 | kobject_put(&s->kobj); | |
81819f0f | 4513 | return err; |
5788d8ad | 4514 | } |
81819f0f CL |
4515 | kobject_uevent(&s->kobj, KOBJ_ADD); |
4516 | if (!unmergeable) { | |
4517 | /* Setup first alias */ | |
4518 | sysfs_slab_alias(s, s->name); | |
4519 | kfree(name); | |
4520 | } | |
4521 | return 0; | |
4522 | } | |
4523 | ||
4524 | static void sysfs_slab_remove(struct kmem_cache *s) | |
4525 | { | |
2bce6485 CL |
4526 | if (slab_state < SYSFS) |
4527 | /* | |
4528 | * Sysfs has not been setup yet so no need to remove the | |
4529 | * cache from sysfs. | |
4530 | */ | |
4531 | return; | |
4532 | ||
81819f0f CL |
4533 | kobject_uevent(&s->kobj, KOBJ_REMOVE); |
4534 | kobject_del(&s->kobj); | |
151c602f | 4535 | kobject_put(&s->kobj); |
81819f0f CL |
4536 | } |
4537 | ||
4538 | /* | |
4539 | * Need to buffer aliases during bootup until sysfs becomes | |
9f6c708e | 4540 | * available lest we lose that information. |
81819f0f CL |
4541 | */ |
4542 | struct saved_alias { | |
4543 | struct kmem_cache *s; | |
4544 | const char *name; | |
4545 | struct saved_alias *next; | |
4546 | }; | |
4547 | ||
5af328a5 | 4548 | static struct saved_alias *alias_list; |
81819f0f CL |
4549 | |
4550 | static int sysfs_slab_alias(struct kmem_cache *s, const char *name) | |
4551 | { | |
4552 | struct saved_alias *al; | |
4553 | ||
4554 | if (slab_state == SYSFS) { | |
4555 | /* | |
4556 | * If we have a leftover link then remove it. | |
4557 | */ | |
27c3a314 GKH |
4558 | sysfs_remove_link(&slab_kset->kobj, name); |
4559 | return sysfs_create_link(&slab_kset->kobj, &s->kobj, name); | |
81819f0f CL |
4560 | } |
4561 | ||
4562 | al = kmalloc(sizeof(struct saved_alias), GFP_KERNEL); | |
4563 | if (!al) | |
4564 | return -ENOMEM; | |
4565 | ||
4566 | al->s = s; | |
4567 | al->name = name; | |
4568 | al->next = alias_list; | |
4569 | alias_list = al; | |
4570 | return 0; | |
4571 | } | |
4572 | ||
4573 | static int __init slab_sysfs_init(void) | |
4574 | { | |
5b95a4ac | 4575 | struct kmem_cache *s; |
81819f0f CL |
4576 | int err; |
4577 | ||
2bce6485 CL |
4578 | down_write(&slub_lock); |
4579 | ||
0ff21e46 | 4580 | slab_kset = kset_create_and_add("slab", &slab_uevent_ops, kernel_kobj); |
27c3a314 | 4581 | if (!slab_kset) { |
2bce6485 | 4582 | up_write(&slub_lock); |
81819f0f CL |
4583 | printk(KERN_ERR "Cannot register slab subsystem.\n"); |
4584 | return -ENOSYS; | |
4585 | } | |
4586 | ||
26a7bd03 CL |
4587 | slab_state = SYSFS; |
4588 | ||
5b95a4ac | 4589 | list_for_each_entry(s, &slab_caches, list) { |
26a7bd03 | 4590 | err = sysfs_slab_add(s); |
5d540fb7 CL |
4591 | if (err) |
4592 | printk(KERN_ERR "SLUB: Unable to add boot slab %s" | |
4593 | " to sysfs\n", s->name); | |
26a7bd03 | 4594 | } |
81819f0f CL |
4595 | |
4596 | while (alias_list) { | |
4597 | struct saved_alias *al = alias_list; | |
4598 | ||
4599 | alias_list = alias_list->next; | |
4600 | err = sysfs_slab_alias(al->s, al->name); | |
5d540fb7 CL |
4601 | if (err) |
4602 | printk(KERN_ERR "SLUB: Unable to add boot slab alias" | |
4603 | " %s to sysfs\n", s->name); | |
81819f0f CL |
4604 | kfree(al); |
4605 | } | |
4606 | ||
2bce6485 | 4607 | up_write(&slub_lock); |
81819f0f CL |
4608 | resiliency_test(); |
4609 | return 0; | |
4610 | } | |
4611 | ||
4612 | __initcall(slab_sysfs_init); | |
81819f0f | 4613 | #endif |
57ed3eda PE |
4614 | |
4615 | /* | |
4616 | * The /proc/slabinfo ABI | |
4617 | */ | |
158a9624 | 4618 | #ifdef CONFIG_SLABINFO |
57ed3eda PE |
4619 | static void print_slabinfo_header(struct seq_file *m) |
4620 | { | |
4621 | seq_puts(m, "slabinfo - version: 2.1\n"); | |
4622 | seq_puts(m, "# name <active_objs> <num_objs> <objsize> " | |
4623 | "<objperslab> <pagesperslab>"); | |
4624 | seq_puts(m, " : tunables <limit> <batchcount> <sharedfactor>"); | |
4625 | seq_puts(m, " : slabdata <active_slabs> <num_slabs> <sharedavail>"); | |
4626 | seq_putc(m, '\n'); | |
4627 | } | |
4628 | ||
4629 | static void *s_start(struct seq_file *m, loff_t *pos) | |
4630 | { | |
4631 | loff_t n = *pos; | |
4632 | ||
4633 | down_read(&slub_lock); | |
4634 | if (!n) | |
4635 | print_slabinfo_header(m); | |
4636 | ||
4637 | return seq_list_start(&slab_caches, *pos); | |
4638 | } | |
4639 | ||
4640 | static void *s_next(struct seq_file *m, void *p, loff_t *pos) | |
4641 | { | |
4642 | return seq_list_next(p, &slab_caches, pos); | |
4643 | } | |
4644 | ||
4645 | static void s_stop(struct seq_file *m, void *p) | |
4646 | { | |
4647 | up_read(&slub_lock); | |
4648 | } | |
4649 | ||
4650 | static int s_show(struct seq_file *m, void *p) | |
4651 | { | |
4652 | unsigned long nr_partials = 0; | |
4653 | unsigned long nr_slabs = 0; | |
4654 | unsigned long nr_inuse = 0; | |
205ab99d CL |
4655 | unsigned long nr_objs = 0; |
4656 | unsigned long nr_free = 0; | |
57ed3eda PE |
4657 | struct kmem_cache *s; |
4658 | int node; | |
4659 | ||
4660 | s = list_entry(p, struct kmem_cache, list); | |
4661 | ||
4662 | for_each_online_node(node) { | |
4663 | struct kmem_cache_node *n = get_node(s, node); | |
4664 | ||
4665 | if (!n) | |
4666 | continue; | |
4667 | ||
4668 | nr_partials += n->nr_partial; | |
4669 | nr_slabs += atomic_long_read(&n->nr_slabs); | |
205ab99d CL |
4670 | nr_objs += atomic_long_read(&n->total_objects); |
4671 | nr_free += count_partial(n, count_free); | |
57ed3eda PE |
4672 | } |
4673 | ||
205ab99d | 4674 | nr_inuse = nr_objs - nr_free; |
57ed3eda PE |
4675 | |
4676 | seq_printf(m, "%-17s %6lu %6lu %6u %4u %4d", s->name, nr_inuse, | |
834f3d11 CL |
4677 | nr_objs, s->size, oo_objects(s->oo), |
4678 | (1 << oo_order(s->oo))); | |
57ed3eda PE |
4679 | seq_printf(m, " : tunables %4u %4u %4u", 0, 0, 0); |
4680 | seq_printf(m, " : slabdata %6lu %6lu %6lu", nr_slabs, nr_slabs, | |
4681 | 0UL); | |
4682 | seq_putc(m, '\n'); | |
4683 | return 0; | |
4684 | } | |
4685 | ||
7b3c3a50 | 4686 | static const struct seq_operations slabinfo_op = { |
57ed3eda PE |
4687 | .start = s_start, |
4688 | .next = s_next, | |
4689 | .stop = s_stop, | |
4690 | .show = s_show, | |
4691 | }; | |
4692 | ||
7b3c3a50 AD |
4693 | static int slabinfo_open(struct inode *inode, struct file *file) |
4694 | { | |
4695 | return seq_open(file, &slabinfo_op); | |
4696 | } | |
4697 | ||
4698 | static const struct file_operations proc_slabinfo_operations = { | |
4699 | .open = slabinfo_open, | |
4700 | .read = seq_read, | |
4701 | .llseek = seq_lseek, | |
4702 | .release = seq_release, | |
4703 | }; | |
4704 | ||
4705 | static int __init slab_proc_init(void) | |
4706 | { | |
cf5d1131 | 4707 | proc_create("slabinfo", S_IRUGO, NULL, &proc_slabinfo_operations); |
7b3c3a50 AD |
4708 | return 0; |
4709 | } | |
4710 | module_init(slab_proc_init); | |
158a9624 | 4711 | #endif /* CONFIG_SLABINFO */ |