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