]>
Commit | Line | Data |
---|---|---|
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 | * | |
8 | * (C) 2007 SGI, Christoph Lameter <clameter@sgi.com> | |
9 | */ | |
10 | ||
11 | #include <linux/mm.h> | |
12 | #include <linux/module.h> | |
13 | #include <linux/bit_spinlock.h> | |
14 | #include <linux/interrupt.h> | |
15 | #include <linux/bitops.h> | |
16 | #include <linux/slab.h> | |
17 | #include <linux/seq_file.h> | |
18 | #include <linux/cpu.h> | |
19 | #include <linux/cpuset.h> | |
20 | #include <linux/mempolicy.h> | |
21 | #include <linux/ctype.h> | |
22 | #include <linux/kallsyms.h> | |
23 | ||
24 | /* | |
25 | * Lock order: | |
26 | * 1. slab_lock(page) | |
27 | * 2. slab->list_lock | |
28 | * | |
29 | * The slab_lock protects operations on the object of a particular | |
30 | * slab and its metadata in the page struct. If the slab lock | |
31 | * has been taken then no allocations nor frees can be performed | |
32 | * on the objects in the slab nor can the slab be added or removed | |
33 | * from the partial or full lists since this would mean modifying | |
34 | * the page_struct of the slab. | |
35 | * | |
36 | * The list_lock protects the partial and full list on each node and | |
37 | * the partial slab counter. If taken then no new slabs may be added or | |
38 | * removed from the lists nor make the number of partial slabs be modified. | |
39 | * (Note that the total number of slabs is an atomic value that may be | |
40 | * modified without taking the list lock). | |
41 | * | |
42 | * The list_lock is a centralized lock and thus we avoid taking it as | |
43 | * much as possible. As long as SLUB does not have to handle partial | |
44 | * slabs, operations can continue without any centralized lock. F.e. | |
45 | * allocating a long series of objects that fill up slabs does not require | |
46 | * the list lock. | |
47 | * | |
48 | * The lock order is sometimes inverted when we are trying to get a slab | |
49 | * off a list. We take the list_lock and then look for a page on the list | |
50 | * to use. While we do that objects in the slabs may be freed. We can | |
51 | * only operate on the slab if we have also taken the slab_lock. So we use | |
52 | * a slab_trylock() on the slab. If trylock was successful then no frees | |
53 | * can occur anymore and we can use the slab for allocations etc. If the | |
54 | * slab_trylock() does not succeed then frees are in progress in the slab and | |
55 | * we must stay away from it for a while since we may cause a bouncing | |
56 | * cacheline if we try to acquire the lock. So go onto the next slab. | |
57 | * If all pages are busy then we may allocate a new slab instead of reusing | |
58 | * a partial slab. A new slab has noone operating on it and thus there is | |
59 | * no danger of cacheline contention. | |
60 | * | |
61 | * Interrupts are disabled during allocation and deallocation in order to | |
62 | * make the slab allocator safe to use in the context of an irq. In addition | |
63 | * interrupts are disabled to ensure that the processor does not change | |
64 | * while handling per_cpu slabs, due to kernel preemption. | |
65 | * | |
66 | * SLUB assigns one slab for allocation to each processor. | |
67 | * Allocations only occur from these slabs called cpu slabs. | |
68 | * | |
69 | * Slabs with free elements are kept on a partial list and during regular | |
70 | * operations no list for full slabs is used. If an object in a full slab is | |
71 | * freed then the slab will show up again on the partial lists. | |
72 | * We track full slabs for debugging purposes though because otherwise we | |
73 | * cannot scan all objects. | |
74 | * | |
75 | * Slabs are freed when they become empty. Teardown and setup is | |
76 | * minimal so we rely on the page allocators per cpu caches for | |
77 | * fast frees and allocs. | |
78 | * | |
79 | * Overloading of page flags that are otherwise used for LRU management. | |
80 | * | |
81 | * PageActive The slab is frozen and exempt from list processing. | |
82 | * This means that the slab is dedicated to a purpose | |
83 | * such as satisfying allocations for a specific | |
84 | * processor. Objects may be freed in the slab while | |
85 | * it is frozen but slab_free will then skip the usual | |
86 | * list operations. It is up to the processor holding | |
87 | * the slab to integrate the slab into the slab lists | |
88 | * when the slab is no longer needed. | |
89 | * | |
90 | * One use of this flag is to mark slabs that are | |
91 | * used for allocations. Then such a slab becomes a cpu | |
92 | * slab. The cpu slab may be equipped with an additional | |
93 | * lockless_freelist that allows lockless access to | |
94 | * free objects in addition to the regular freelist | |
95 | * that requires the slab lock. | |
96 | * | |
97 | * PageError Slab requires special handling due to debug | |
98 | * options set. This moves slab handling out of | |
99 | * the fast path and disables lockless freelists. | |
100 | */ | |
101 | ||
102 | #define FROZEN (1 << PG_active) | |
103 | ||
104 | #ifdef CONFIG_SLUB_DEBUG | |
105 | #define SLABDEBUG (1 << PG_error) | |
106 | #else | |
107 | #define SLABDEBUG 0 | |
108 | #endif | |
109 | ||
110 | static inline int SlabFrozen(struct page *page) | |
111 | { | |
112 | return page->flags & FROZEN; | |
113 | } | |
114 | ||
115 | static inline void SetSlabFrozen(struct page *page) | |
116 | { | |
117 | page->flags |= FROZEN; | |
118 | } | |
119 | ||
120 | static inline void ClearSlabFrozen(struct page *page) | |
121 | { | |
122 | page->flags &= ~FROZEN; | |
123 | } | |
124 | ||
125 | static inline int SlabDebug(struct page *page) | |
126 | { | |
127 | return page->flags & SLABDEBUG; | |
128 | } | |
129 | ||
130 | static inline void SetSlabDebug(struct page *page) | |
131 | { | |
132 | page->flags |= SLABDEBUG; | |
133 | } | |
134 | ||
135 | static inline void ClearSlabDebug(struct page *page) | |
136 | { | |
137 | page->flags &= ~SLABDEBUG; | |
138 | } | |
139 | ||
140 | /* | |
141 | * Issues still to be resolved: | |
142 | * | |
143 | * - The per cpu array is updated for each new slab and and is a remote | |
144 | * cacheline for most nodes. This could become a bouncing cacheline given | |
145 | * enough frequent updates. There are 16 pointers in a cacheline, so at | |
146 | * max 16 cpus could compete for the cacheline which may be okay. | |
147 | * | |
148 | * - Support PAGE_ALLOC_DEBUG. Should be easy to do. | |
149 | * | |
150 | * - Variable sizing of the per node arrays | |
151 | */ | |
152 | ||
153 | /* Enable to test recovery from slab corruption on boot */ | |
154 | #undef SLUB_RESILIENCY_TEST | |
155 | ||
156 | #if PAGE_SHIFT <= 12 | |
157 | ||
158 | /* | |
159 | * Small page size. Make sure that we do not fragment memory | |
160 | */ | |
161 | #define DEFAULT_MAX_ORDER 1 | |
162 | #define DEFAULT_MIN_OBJECTS 4 | |
163 | ||
164 | #else | |
165 | ||
166 | /* | |
167 | * Large page machines are customarily able to handle larger | |
168 | * page orders. | |
169 | */ | |
170 | #define DEFAULT_MAX_ORDER 2 | |
171 | #define DEFAULT_MIN_OBJECTS 8 | |
172 | ||
173 | #endif | |
174 | ||
175 | /* | |
176 | * Mininum number of partial slabs. These will be left on the partial | |
177 | * lists even if they are empty. kmem_cache_shrink may reclaim them. | |
178 | */ | |
179 | #define MIN_PARTIAL 2 | |
180 | ||
181 | /* | |
182 | * Maximum number of desirable partial slabs. | |
183 | * The existence of more partial slabs makes kmem_cache_shrink | |
184 | * sort the partial list by the number of objects in the. | |
185 | */ | |
186 | #define MAX_PARTIAL 10 | |
187 | ||
188 | #define DEBUG_DEFAULT_FLAGS (SLAB_DEBUG_FREE | SLAB_RED_ZONE | \ | |
189 | SLAB_POISON | SLAB_STORE_USER) | |
190 | ||
191 | /* | |
192 | * Set of flags that will prevent slab merging | |
193 | */ | |
194 | #define SLUB_NEVER_MERGE (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER | \ | |
195 | SLAB_TRACE | SLAB_DESTROY_BY_RCU) | |
196 | ||
197 | #define SLUB_MERGE_SAME (SLAB_DEBUG_FREE | SLAB_RECLAIM_ACCOUNT | \ | |
198 | SLAB_CACHE_DMA) | |
199 | ||
200 | #ifndef ARCH_KMALLOC_MINALIGN | |
201 | #define ARCH_KMALLOC_MINALIGN __alignof__(unsigned long long) | |
202 | #endif | |
203 | ||
204 | #ifndef ARCH_SLAB_MINALIGN | |
205 | #define ARCH_SLAB_MINALIGN __alignof__(unsigned long long) | |
206 | #endif | |
207 | ||
208 | /* | |
209 | * The page->inuse field is 16 bit thus we have this limitation | |
210 | */ | |
211 | #define MAX_OBJECTS_PER_SLAB 65535 | |
212 | ||
213 | /* Internal SLUB flags */ | |
214 | #define __OBJECT_POISON 0x80000000 /* Poison object */ | |
215 | ||
216 | /* Not all arches define cache_line_size */ | |
217 | #ifndef cache_line_size | |
218 | #define cache_line_size() L1_CACHE_BYTES | |
219 | #endif | |
220 | ||
221 | static int kmem_size = sizeof(struct kmem_cache); | |
222 | ||
223 | #ifdef CONFIG_SMP | |
224 | static struct notifier_block slab_notifier; | |
225 | #endif | |
226 | ||
227 | static enum { | |
228 | DOWN, /* No slab functionality available */ | |
229 | PARTIAL, /* kmem_cache_open() works but kmalloc does not */ | |
230 | UP, /* Everything works but does not show up in sysfs */ | |
231 | SYSFS /* Sysfs up */ | |
232 | } slab_state = DOWN; | |
233 | ||
234 | /* A list of all slab caches on the system */ | |
235 | static DECLARE_RWSEM(slub_lock); | |
236 | LIST_HEAD(slab_caches); | |
237 | ||
238 | /* | |
239 | * Tracking user of a slab. | |
240 | */ | |
241 | struct track { | |
242 | void *addr; /* Called from address */ | |
243 | int cpu; /* Was running on cpu */ | |
244 | int pid; /* Pid context */ | |
245 | unsigned long when; /* When did the operation occur */ | |
246 | }; | |
247 | ||
248 | enum track_item { TRACK_ALLOC, TRACK_FREE }; | |
249 | ||
250 | #if defined(CONFIG_SYSFS) && defined(CONFIG_SLUB_DEBUG) | |
251 | static int sysfs_slab_add(struct kmem_cache *); | |
252 | static int sysfs_slab_alias(struct kmem_cache *, const char *); | |
253 | static void sysfs_slab_remove(struct kmem_cache *); | |
254 | #else | |
255 | static inline int sysfs_slab_add(struct kmem_cache *s) { return 0; } | |
256 | static inline int sysfs_slab_alias(struct kmem_cache *s, const char *p) | |
257 | { return 0; } | |
258 | static inline void sysfs_slab_remove(struct kmem_cache *s) {} | |
259 | #endif | |
260 | ||
261 | /******************************************************************** | |
262 | * Core slab cache functions | |
263 | *******************************************************************/ | |
264 | ||
265 | int slab_is_available(void) | |
266 | { | |
267 | return slab_state >= UP; | |
268 | } | |
269 | ||
270 | static inline struct kmem_cache_node *get_node(struct kmem_cache *s, int node) | |
271 | { | |
272 | #ifdef CONFIG_NUMA | |
273 | return s->node[node]; | |
274 | #else | |
275 | return &s->local_node; | |
276 | #endif | |
277 | } | |
278 | ||
279 | static inline int check_valid_pointer(struct kmem_cache *s, | |
280 | struct page *page, const void *object) | |
281 | { | |
282 | void *base; | |
283 | ||
284 | if (!object) | |
285 | return 1; | |
286 | ||
287 | base = page_address(page); | |
288 | if (object < base || object >= base + s->objects * s->size || | |
289 | (object - base) % s->size) { | |
290 | return 0; | |
291 | } | |
292 | ||
293 | return 1; | |
294 | } | |
295 | ||
296 | /* | |
297 | * Slow version of get and set free pointer. | |
298 | * | |
299 | * This version requires touching the cache lines of kmem_cache which | |
300 | * we avoid to do in the fast alloc free paths. There we obtain the offset | |
301 | * from the page struct. | |
302 | */ | |
303 | static inline void *get_freepointer(struct kmem_cache *s, void *object) | |
304 | { | |
305 | return *(void **)(object + s->offset); | |
306 | } | |
307 | ||
308 | static inline void set_freepointer(struct kmem_cache *s, void *object, void *fp) | |
309 | { | |
310 | *(void **)(object + s->offset) = fp; | |
311 | } | |
312 | ||
313 | /* Loop over all objects in a slab */ | |
314 | #define for_each_object(__p, __s, __addr) \ | |
315 | for (__p = (__addr); __p < (__addr) + (__s)->objects * (__s)->size;\ | |
316 | __p += (__s)->size) | |
317 | ||
318 | /* Scan freelist */ | |
319 | #define for_each_free_object(__p, __s, __free) \ | |
320 | for (__p = (__free); __p; __p = get_freepointer((__s), __p)) | |
321 | ||
322 | /* Determine object index from a given position */ | |
323 | static inline int slab_index(void *p, struct kmem_cache *s, void *addr) | |
324 | { | |
325 | return (p - addr) / s->size; | |
326 | } | |
327 | ||
328 | #ifdef CONFIG_SLUB_DEBUG | |
329 | /* | |
330 | * Debug settings: | |
331 | */ | |
332 | #ifdef CONFIG_SLUB_DEBUG_ON | |
333 | static int slub_debug = DEBUG_DEFAULT_FLAGS; | |
334 | #else | |
335 | static int slub_debug; | |
336 | #endif | |
337 | ||
338 | static char *slub_debug_slabs; | |
339 | ||
340 | /* | |
341 | * Object debugging | |
342 | */ | |
343 | static void print_section(char *text, u8 *addr, unsigned int length) | |
344 | { | |
345 | int i, offset; | |
346 | int newline = 1; | |
347 | char ascii[17]; | |
348 | ||
349 | ascii[16] = 0; | |
350 | ||
351 | for (i = 0; i < length; i++) { | |
352 | if (newline) { | |
353 | printk(KERN_ERR "%8s 0x%p: ", text, addr + i); | |
354 | newline = 0; | |
355 | } | |
356 | printk(" %02x", addr[i]); | |
357 | offset = i % 16; | |
358 | ascii[offset] = isgraph(addr[i]) ? addr[i] : '.'; | |
359 | if (offset == 15) { | |
360 | printk(" %s\n",ascii); | |
361 | newline = 1; | |
362 | } | |
363 | } | |
364 | if (!newline) { | |
365 | i %= 16; | |
366 | while (i < 16) { | |
367 | printk(" "); | |
368 | ascii[i] = ' '; | |
369 | i++; | |
370 | } | |
371 | printk(" %s\n", ascii); | |
372 | } | |
373 | } | |
374 | ||
375 | static struct track *get_track(struct kmem_cache *s, void *object, | |
376 | enum track_item alloc) | |
377 | { | |
378 | struct track *p; | |
379 | ||
380 | if (s->offset) | |
381 | p = object + s->offset + sizeof(void *); | |
382 | else | |
383 | p = object + s->inuse; | |
384 | ||
385 | return p + alloc; | |
386 | } | |
387 | ||
388 | static void set_track(struct kmem_cache *s, void *object, | |
389 | enum track_item alloc, void *addr) | |
390 | { | |
391 | struct track *p; | |
392 | ||
393 | if (s->offset) | |
394 | p = object + s->offset + sizeof(void *); | |
395 | else | |
396 | p = object + s->inuse; | |
397 | ||
398 | p += alloc; | |
399 | if (addr) { | |
400 | p->addr = addr; | |
401 | p->cpu = smp_processor_id(); | |
402 | p->pid = current ? current->pid : -1; | |
403 | p->when = jiffies; | |
404 | } else | |
405 | memset(p, 0, sizeof(struct track)); | |
406 | } | |
407 | ||
408 | static void init_tracking(struct kmem_cache *s, void *object) | |
409 | { | |
410 | if (!(s->flags & SLAB_STORE_USER)) | |
411 | return; | |
412 | ||
413 | set_track(s, object, TRACK_FREE, NULL); | |
414 | set_track(s, object, TRACK_ALLOC, NULL); | |
415 | } | |
416 | ||
417 | static void print_track(const char *s, struct track *t) | |
418 | { | |
419 | if (!t->addr) | |
420 | return; | |
421 | ||
422 | printk(KERN_ERR "INFO: %s in ", s); | |
423 | __print_symbol("%s", (unsigned long)t->addr); | |
424 | printk(" age=%lu cpu=%u pid=%d\n", jiffies - t->when, t->cpu, t->pid); | |
425 | } | |
426 | ||
427 | static void print_tracking(struct kmem_cache *s, void *object) | |
428 | { | |
429 | if (!(s->flags & SLAB_STORE_USER)) | |
430 | return; | |
431 | ||
432 | print_track("Allocated", get_track(s, object, TRACK_ALLOC)); | |
433 | print_track("Freed", get_track(s, object, TRACK_FREE)); | |
434 | } | |
435 | ||
436 | static void print_page_info(struct page *page) | |
437 | { | |
438 | printk(KERN_ERR "INFO: Slab 0x%p used=%u fp=0x%p flags=0x%04lx\n", | |
439 | page, page->inuse, page->freelist, page->flags); | |
440 | ||
441 | } | |
442 | ||
443 | static void slab_bug(struct kmem_cache *s, char *fmt, ...) | |
444 | { | |
445 | va_list args; | |
446 | char buf[100]; | |
447 | ||
448 | va_start(args, fmt); | |
449 | vsnprintf(buf, sizeof(buf), fmt, args); | |
450 | va_end(args); | |
451 | printk(KERN_ERR "========================================" | |
452 | "=====================================\n"); | |
453 | printk(KERN_ERR "BUG %s: %s\n", s->name, buf); | |
454 | printk(KERN_ERR "----------------------------------------" | |
455 | "-------------------------------------\n\n"); | |
456 | } | |
457 | ||
458 | static void slab_fix(struct kmem_cache *s, char *fmt, ...) | |
459 | { | |
460 | va_list args; | |
461 | char buf[100]; | |
462 | ||
463 | va_start(args, fmt); | |
464 | vsnprintf(buf, sizeof(buf), fmt, args); | |
465 | va_end(args); | |
466 | printk(KERN_ERR "FIX %s: %s\n", s->name, buf); | |
467 | } | |
468 | ||
469 | static void print_trailer(struct kmem_cache *s, struct page *page, u8 *p) | |
470 | { | |
471 | unsigned int off; /* Offset of last byte */ | |
472 | u8 *addr = page_address(page); | |
473 | ||
474 | print_tracking(s, p); | |
475 | ||
476 | print_page_info(page); | |
477 | ||
478 | printk(KERN_ERR "INFO: Object 0x%p @offset=%tu fp=0x%p\n\n", | |
479 | p, p - addr, get_freepointer(s, p)); | |
480 | ||
481 | if (p > addr + 16) | |
482 | print_section("Bytes b4", p - 16, 16); | |
483 | ||
484 | print_section("Object", p, min(s->objsize, 128)); | |
485 | ||
486 | if (s->flags & SLAB_RED_ZONE) | |
487 | print_section("Redzone", p + s->objsize, | |
488 | s->inuse - s->objsize); | |
489 | ||
490 | if (s->offset) | |
491 | off = s->offset + sizeof(void *); | |
492 | else | |
493 | off = s->inuse; | |
494 | ||
495 | if (s->flags & SLAB_STORE_USER) | |
496 | off += 2 * sizeof(struct track); | |
497 | ||
498 | if (off != s->size) | |
499 | /* Beginning of the filler is the free pointer */ | |
500 | print_section("Padding", p + off, s->size - off); | |
501 | ||
502 | dump_stack(); | |
503 | } | |
504 | ||
505 | static void object_err(struct kmem_cache *s, struct page *page, | |
506 | u8 *object, char *reason) | |
507 | { | |
508 | slab_bug(s, reason); | |
509 | print_trailer(s, page, object); | |
510 | } | |
511 | ||
512 | static void slab_err(struct kmem_cache *s, struct page *page, char *fmt, ...) | |
513 | { | |
514 | va_list args; | |
515 | char buf[100]; | |
516 | ||
517 | va_start(args, fmt); | |
518 | vsnprintf(buf, sizeof(buf), fmt, args); | |
519 | va_end(args); | |
520 | slab_bug(s, fmt); | |
521 | print_page_info(page); | |
522 | dump_stack(); | |
523 | } | |
524 | ||
525 | static void init_object(struct kmem_cache *s, void *object, int active) | |
526 | { | |
527 | u8 *p = object; | |
528 | ||
529 | if (s->flags & __OBJECT_POISON) { | |
530 | memset(p, POISON_FREE, s->objsize - 1); | |
531 | p[s->objsize -1] = POISON_END; | |
532 | } | |
533 | ||
534 | if (s->flags & SLAB_RED_ZONE) | |
535 | memset(p + s->objsize, | |
536 | active ? SLUB_RED_ACTIVE : SLUB_RED_INACTIVE, | |
537 | s->inuse - s->objsize); | |
538 | } | |
539 | ||
540 | static u8 *check_bytes(u8 *start, unsigned int value, unsigned int bytes) | |
541 | { | |
542 | while (bytes) { | |
543 | if (*start != (u8)value) | |
544 | return start; | |
545 | start++; | |
546 | bytes--; | |
547 | } | |
548 | return NULL; | |
549 | } | |
550 | ||
551 | static void restore_bytes(struct kmem_cache *s, char *message, u8 data, | |
552 | void *from, void *to) | |
553 | { | |
554 | slab_fix(s, "Restoring 0x%p-0x%p=0x%x\n", from, to - 1, data); | |
555 | memset(from, data, to - from); | |
556 | } | |
557 | ||
558 | static int check_bytes_and_report(struct kmem_cache *s, struct page *page, | |
559 | u8 *object, char *what, | |
560 | u8* start, unsigned int value, unsigned int bytes) | |
561 | { | |
562 | u8 *fault; | |
563 | u8 *end; | |
564 | ||
565 | fault = check_bytes(start, value, bytes); | |
566 | if (!fault) | |
567 | return 1; | |
568 | ||
569 | end = start + bytes; | |
570 | while (end > fault && end[-1] == value) | |
571 | end--; | |
572 | ||
573 | slab_bug(s, "%s overwritten", what); | |
574 | printk(KERN_ERR "INFO: 0x%p-0x%p. First byte 0x%x instead of 0x%x\n", | |
575 | fault, end - 1, fault[0], value); | |
576 | print_trailer(s, page, object); | |
577 | ||
578 | restore_bytes(s, what, value, fault, end); | |
579 | return 0; | |
580 | } | |
581 | ||
582 | /* | |
583 | * Object layout: | |
584 | * | |
585 | * object address | |
586 | * Bytes of the object to be managed. | |
587 | * If the freepointer may overlay the object then the free | |
588 | * pointer is the first word of the object. | |
589 | * | |
590 | * Poisoning uses 0x6b (POISON_FREE) and the last byte is | |
591 | * 0xa5 (POISON_END) | |
592 | * | |
593 | * object + s->objsize | |
594 | * Padding to reach word boundary. This is also used for Redzoning. | |
595 | * Padding is extended by another word if Redzoning is enabled and | |
596 | * objsize == inuse. | |
597 | * | |
598 | * We fill with 0xbb (RED_INACTIVE) for inactive objects and with | |
599 | * 0xcc (RED_ACTIVE) for objects in use. | |
600 | * | |
601 | * object + s->inuse | |
602 | * Meta data starts here. | |
603 | * | |
604 | * A. Free pointer (if we cannot overwrite object on free) | |
605 | * B. Tracking data for SLAB_STORE_USER | |
606 | * C. Padding to reach required alignment boundary or at mininum | |
607 | * one word if debuggin is on to be able to detect writes | |
608 | * before the word boundary. | |
609 | * | |
610 | * Padding is done using 0x5a (POISON_INUSE) | |
611 | * | |
612 | * object + s->size | |
613 | * Nothing is used beyond s->size. | |
614 | * | |
615 | * If slabcaches are merged then the objsize and inuse boundaries are mostly | |
616 | * ignored. And therefore no slab options that rely on these boundaries | |
617 | * may be used with merged slabcaches. | |
618 | */ | |
619 | ||
620 | static int check_pad_bytes(struct kmem_cache *s, struct page *page, u8 *p) | |
621 | { | |
622 | unsigned long off = s->inuse; /* The end of info */ | |
623 | ||
624 | if (s->offset) | |
625 | /* Freepointer is placed after the object. */ | |
626 | off += sizeof(void *); | |
627 | ||
628 | if (s->flags & SLAB_STORE_USER) | |
629 | /* We also have user information there */ | |
630 | off += 2 * sizeof(struct track); | |
631 | ||
632 | if (s->size == off) | |
633 | return 1; | |
634 | ||
635 | return check_bytes_and_report(s, page, p, "Object padding", | |
636 | p + off, POISON_INUSE, s->size - off); | |
637 | } | |
638 | ||
639 | static int slab_pad_check(struct kmem_cache *s, struct page *page) | |
640 | { | |
641 | u8 *start; | |
642 | u8 *fault; | |
643 | u8 *end; | |
644 | int length; | |
645 | int remainder; | |
646 | ||
647 | if (!(s->flags & SLAB_POISON)) | |
648 | return 1; | |
649 | ||
650 | start = page_address(page); | |
651 | end = start + (PAGE_SIZE << s->order); | |
652 | length = s->objects * s->size; | |
653 | remainder = end - (start + length); | |
654 | if (!remainder) | |
655 | return 1; | |
656 | ||
657 | fault = check_bytes(start + length, POISON_INUSE, remainder); | |
658 | if (!fault) | |
659 | return 1; | |
660 | while (end > fault && end[-1] == POISON_INUSE) | |
661 | end--; | |
662 | ||
663 | slab_err(s, page, "Padding overwritten. 0x%p-0x%p", fault, end - 1); | |
664 | print_section("Padding", start, length); | |
665 | ||
666 | restore_bytes(s, "slab padding", POISON_INUSE, start, end); | |
667 | return 0; | |
668 | } | |
669 | ||
670 | static int check_object(struct kmem_cache *s, struct page *page, | |
671 | void *object, int active) | |
672 | { | |
673 | u8 *p = object; | |
674 | u8 *endobject = object + s->objsize; | |
675 | ||
676 | if (s->flags & SLAB_RED_ZONE) { | |
677 | unsigned int red = | |
678 | active ? SLUB_RED_ACTIVE : SLUB_RED_INACTIVE; | |
679 | ||
680 | if (!check_bytes_and_report(s, page, object, "Redzone", | |
681 | endobject, red, s->inuse - s->objsize)) | |
682 | return 0; | |
683 | } else { | |
684 | if ((s->flags & SLAB_POISON) && s->objsize < s->inuse) | |
685 | check_bytes_and_report(s, page, p, "Alignment padding", endobject, | |
686 | POISON_INUSE, s->inuse - s->objsize); | |
687 | } | |
688 | ||
689 | if (s->flags & SLAB_POISON) { | |
690 | if (!active && (s->flags & __OBJECT_POISON) && | |
691 | (!check_bytes_and_report(s, page, p, "Poison", p, | |
692 | POISON_FREE, s->objsize - 1) || | |
693 | !check_bytes_and_report(s, page, p, "Poison", | |
694 | p + s->objsize -1, POISON_END, 1))) | |
695 | return 0; | |
696 | /* | |
697 | * check_pad_bytes cleans up on its own. | |
698 | */ | |
699 | check_pad_bytes(s, page, p); | |
700 | } | |
701 | ||
702 | if (!s->offset && active) | |
703 | /* | |
704 | * Object and freepointer overlap. Cannot check | |
705 | * freepointer while object is allocated. | |
706 | */ | |
707 | return 1; | |
708 | ||
709 | /* Check free pointer validity */ | |
710 | if (!check_valid_pointer(s, page, get_freepointer(s, p))) { | |
711 | object_err(s, page, p, "Freepointer corrupt"); | |
712 | /* | |
713 | * No choice but to zap it and thus loose the remainder | |
714 | * of the free objects in this slab. May cause | |
715 | * another error because the object count is now wrong. | |
716 | */ | |
717 | set_freepointer(s, p, NULL); | |
718 | return 0; | |
719 | } | |
720 | return 1; | |
721 | } | |
722 | ||
723 | static int check_slab(struct kmem_cache *s, struct page *page) | |
724 | { | |
725 | VM_BUG_ON(!irqs_disabled()); | |
726 | ||
727 | if (!PageSlab(page)) { | |
728 | slab_err(s, page, "Not a valid slab page"); | |
729 | return 0; | |
730 | } | |
731 | if (page->offset * sizeof(void *) != s->offset) { | |
732 | slab_err(s, page, "Corrupted offset %lu", | |
733 | (unsigned long)(page->offset * sizeof(void *))); | |
734 | return 0; | |
735 | } | |
736 | if (page->inuse > s->objects) { | |
737 | slab_err(s, page, "inuse %u > max %u", | |
738 | s->name, page->inuse, s->objects); | |
739 | return 0; | |
740 | } | |
741 | /* Slab_pad_check fixes things up after itself */ | |
742 | slab_pad_check(s, page); | |
743 | return 1; | |
744 | } | |
745 | ||
746 | /* | |
747 | * Determine if a certain object on a page is on the freelist. Must hold the | |
748 | * slab lock to guarantee that the chains are in a consistent state. | |
749 | */ | |
750 | static int on_freelist(struct kmem_cache *s, struct page *page, void *search) | |
751 | { | |
752 | int nr = 0; | |
753 | void *fp = page->freelist; | |
754 | void *object = NULL; | |
755 | ||
756 | while (fp && nr <= s->objects) { | |
757 | if (fp == search) | |
758 | return 1; | |
759 | if (!check_valid_pointer(s, page, fp)) { | |
760 | if (object) { | |
761 | object_err(s, page, object, | |
762 | "Freechain corrupt"); | |
763 | set_freepointer(s, object, NULL); | |
764 | break; | |
765 | } else { | |
766 | slab_err(s, page, "Freepointer corrupt"); | |
767 | page->freelist = NULL; | |
768 | page->inuse = s->objects; | |
769 | slab_fix(s, "Freelist cleared"); | |
770 | return 0; | |
771 | } | |
772 | break; | |
773 | } | |
774 | object = fp; | |
775 | fp = get_freepointer(s, object); | |
776 | nr++; | |
777 | } | |
778 | ||
779 | if (page->inuse != s->objects - nr) { | |
780 | slab_err(s, page, "Wrong object count. Counter is %d but " | |
781 | "counted were %d", page->inuse, s->objects - nr); | |
782 | page->inuse = s->objects - nr; | |
783 | slab_fix(s, "Object count adjusted."); | |
784 | } | |
785 | return search == NULL; | |
786 | } | |
787 | ||
788 | static void trace(struct kmem_cache *s, struct page *page, void *object, int alloc) | |
789 | { | |
790 | if (s->flags & SLAB_TRACE) { | |
791 | printk(KERN_INFO "TRACE %s %s 0x%p inuse=%d fp=0x%p\n", | |
792 | s->name, | |
793 | alloc ? "alloc" : "free", | |
794 | object, page->inuse, | |
795 | page->freelist); | |
796 | ||
797 | if (!alloc) | |
798 | print_section("Object", (void *)object, s->objsize); | |
799 | ||
800 | dump_stack(); | |
801 | } | |
802 | } | |
803 | ||
804 | /* | |
805 | * Tracking of fully allocated slabs for debugging purposes. | |
806 | */ | |
807 | static void add_full(struct kmem_cache_node *n, struct page *page) | |
808 | { | |
809 | spin_lock(&n->list_lock); | |
810 | list_add(&page->lru, &n->full); | |
811 | spin_unlock(&n->list_lock); | |
812 | } | |
813 | ||
814 | static void remove_full(struct kmem_cache *s, struct page *page) | |
815 | { | |
816 | struct kmem_cache_node *n; | |
817 | ||
818 | if (!(s->flags & SLAB_STORE_USER)) | |
819 | return; | |
820 | ||
821 | n = get_node(s, page_to_nid(page)); | |
822 | ||
823 | spin_lock(&n->list_lock); | |
824 | list_del(&page->lru); | |
825 | spin_unlock(&n->list_lock); | |
826 | } | |
827 | ||
828 | static void setup_object_debug(struct kmem_cache *s, struct page *page, | |
829 | void *object) | |
830 | { | |
831 | if (!(s->flags & (SLAB_STORE_USER|SLAB_RED_ZONE|__OBJECT_POISON))) | |
832 | return; | |
833 | ||
834 | init_object(s, object, 0); | |
835 | init_tracking(s, object); | |
836 | } | |
837 | ||
838 | static int alloc_debug_processing(struct kmem_cache *s, struct page *page, | |
839 | void *object, void *addr) | |
840 | { | |
841 | if (!check_slab(s, page)) | |
842 | goto bad; | |
843 | ||
844 | if (object && !on_freelist(s, page, object)) { | |
845 | object_err(s, page, object, "Object already allocated"); | |
846 | goto bad; | |
847 | } | |
848 | ||
849 | if (!check_valid_pointer(s, page, object)) { | |
850 | object_err(s, page, object, "Freelist Pointer check fails"); | |
851 | goto bad; | |
852 | } | |
853 | ||
854 | if (object && !check_object(s, page, object, 0)) | |
855 | goto bad; | |
856 | ||
857 | /* Success perform special debug activities for allocs */ | |
858 | if (s->flags & SLAB_STORE_USER) | |
859 | set_track(s, object, TRACK_ALLOC, addr); | |
860 | trace(s, page, object, 1); | |
861 | init_object(s, object, 1); | |
862 | return 1; | |
863 | ||
864 | bad: | |
865 | if (PageSlab(page)) { | |
866 | /* | |
867 | * If this is a slab page then lets do the best we can | |
868 | * to avoid issues in the future. Marking all objects | |
869 | * as used avoids touching the remaining objects. | |
870 | */ | |
871 | slab_fix(s, "Marking all objects used"); | |
872 | page->inuse = s->objects; | |
873 | page->freelist = NULL; | |
874 | /* Fix up fields that may be corrupted */ | |
875 | page->offset = s->offset / sizeof(void *); | |
876 | } | |
877 | return 0; | |
878 | } | |
879 | ||
880 | static int free_debug_processing(struct kmem_cache *s, struct page *page, | |
881 | void *object, void *addr) | |
882 | { | |
883 | if (!check_slab(s, page)) | |
884 | goto fail; | |
885 | ||
886 | if (!check_valid_pointer(s, page, object)) { | |
887 | slab_err(s, page, "Invalid object pointer 0x%p", object); | |
888 | goto fail; | |
889 | } | |
890 | ||
891 | if (on_freelist(s, page, object)) { | |
892 | object_err(s, page, object, "Object already free"); | |
893 | goto fail; | |
894 | } | |
895 | ||
896 | if (!check_object(s, page, object, 1)) | |
897 | return 0; | |
898 | ||
899 | if (unlikely(s != page->slab)) { | |
900 | if (!PageSlab(page)) | |
901 | slab_err(s, page, "Attempt to free object(0x%p) " | |
902 | "outside of slab", object); | |
903 | else | |
904 | if (!page->slab) { | |
905 | printk(KERN_ERR | |
906 | "SLUB <none>: no slab for object 0x%p.\n", | |
907 | object); | |
908 | dump_stack(); | |
909 | } | |
910 | else | |
911 | object_err(s, page, object, | |
912 | "page slab pointer corrupt."); | |
913 | goto fail; | |
914 | } | |
915 | ||
916 | /* Special debug activities for freeing objects */ | |
917 | if (!SlabFrozen(page) && !page->freelist) | |
918 | remove_full(s, page); | |
919 | if (s->flags & SLAB_STORE_USER) | |
920 | set_track(s, object, TRACK_FREE, addr); | |
921 | trace(s, page, object, 0); | |
922 | init_object(s, object, 0); | |
923 | return 1; | |
924 | ||
925 | fail: | |
926 | slab_fix(s, "Object at 0x%p not freed", object); | |
927 | return 0; | |
928 | } | |
929 | ||
930 | static int __init setup_slub_debug(char *str) | |
931 | { | |
932 | slub_debug = DEBUG_DEFAULT_FLAGS; | |
933 | if (*str++ != '=' || !*str) | |
934 | /* | |
935 | * No options specified. Switch on full debugging. | |
936 | */ | |
937 | goto out; | |
938 | ||
939 | if (*str == ',') | |
940 | /* | |
941 | * No options but restriction on slabs. This means full | |
942 | * debugging for slabs matching a pattern. | |
943 | */ | |
944 | goto check_slabs; | |
945 | ||
946 | slub_debug = 0; | |
947 | if (*str == '-') | |
948 | /* | |
949 | * Switch off all debugging measures. | |
950 | */ | |
951 | goto out; | |
952 | ||
953 | /* | |
954 | * Determine which debug features should be switched on | |
955 | */ | |
956 | for ( ;*str && *str != ','; str++) { | |
957 | switch (tolower(*str)) { | |
958 | case 'f': | |
959 | slub_debug |= SLAB_DEBUG_FREE; | |
960 | break; | |
961 | case 'z': | |
962 | slub_debug |= SLAB_RED_ZONE; | |
963 | break; | |
964 | case 'p': | |
965 | slub_debug |= SLAB_POISON; | |
966 | break; | |
967 | case 'u': | |
968 | slub_debug |= SLAB_STORE_USER; | |
969 | break; | |
970 | case 't': | |
971 | slub_debug |= SLAB_TRACE; | |
972 | break; | |
973 | default: | |
974 | printk(KERN_ERR "slub_debug option '%c' " | |
975 | "unknown. skipped\n",*str); | |
976 | } | |
977 | } | |
978 | ||
979 | check_slabs: | |
980 | if (*str == ',') | |
981 | slub_debug_slabs = str + 1; | |
982 | out: | |
983 | return 1; | |
984 | } | |
985 | ||
986 | __setup("slub_debug", setup_slub_debug); | |
987 | ||
988 | static void kmem_cache_open_debug_check(struct kmem_cache *s) | |
989 | { | |
990 | /* | |
991 | * The page->offset field is only 16 bit wide. This is an offset | |
992 | * in units of words from the beginning of an object. If the slab | |
993 | * size is bigger then we cannot move the free pointer behind the | |
994 | * object anymore. | |
995 | * | |
996 | * On 32 bit platforms the limit is 256k. On 64bit platforms | |
997 | * the limit is 512k. | |
998 | * | |
999 | * Debugging or ctor may create a need to move the free | |
1000 | * pointer. Fail if this happens. | |
1001 | */ | |
1002 | if (s->objsize >= 65535 * sizeof(void *)) { | |
1003 | BUG_ON(s->flags & (SLAB_RED_ZONE | SLAB_POISON | | |
1004 | SLAB_STORE_USER | SLAB_DESTROY_BY_RCU)); | |
1005 | BUG_ON(s->ctor); | |
1006 | } | |
1007 | else | |
1008 | /* | |
1009 | * Enable debugging if selected on the kernel commandline. | |
1010 | */ | |
1011 | if (slub_debug && (!slub_debug_slabs || | |
1012 | strncmp(slub_debug_slabs, s->name, | |
1013 | strlen(slub_debug_slabs)) == 0)) | |
1014 | s->flags |= slub_debug; | |
1015 | } | |
1016 | #else | |
1017 | static inline void setup_object_debug(struct kmem_cache *s, | |
1018 | struct page *page, void *object) {} | |
1019 | ||
1020 | static inline int alloc_debug_processing(struct kmem_cache *s, | |
1021 | struct page *page, void *object, void *addr) { return 0; } | |
1022 | ||
1023 | static inline int free_debug_processing(struct kmem_cache *s, | |
1024 | struct page *page, void *object, void *addr) { return 0; } | |
1025 | ||
1026 | static inline int slab_pad_check(struct kmem_cache *s, struct page *page) | |
1027 | { return 1; } | |
1028 | static inline int check_object(struct kmem_cache *s, struct page *page, | |
1029 | void *object, int active) { return 1; } | |
1030 | static inline void add_full(struct kmem_cache_node *n, struct page *page) {} | |
1031 | static inline void kmem_cache_open_debug_check(struct kmem_cache *s) {} | |
1032 | #define slub_debug 0 | |
1033 | #endif | |
1034 | /* | |
1035 | * Slab allocation and freeing | |
1036 | */ | |
1037 | static struct page *allocate_slab(struct kmem_cache *s, gfp_t flags, int node) | |
1038 | { | |
1039 | struct page * page; | |
1040 | int pages = 1 << s->order; | |
1041 | ||
1042 | if (s->order) | |
1043 | flags |= __GFP_COMP; | |
1044 | ||
1045 | if (s->flags & SLAB_CACHE_DMA) | |
1046 | flags |= SLUB_DMA; | |
1047 | ||
1048 | if (node == -1) | |
1049 | page = alloc_pages(flags, s->order); | |
1050 | else | |
1051 | page = alloc_pages_node(node, flags, s->order); | |
1052 | ||
1053 | if (!page) | |
1054 | return NULL; | |
1055 | ||
1056 | mod_zone_page_state(page_zone(page), | |
1057 | (s->flags & SLAB_RECLAIM_ACCOUNT) ? | |
1058 | NR_SLAB_RECLAIMABLE : NR_SLAB_UNRECLAIMABLE, | |
1059 | pages); | |
1060 | ||
1061 | return page; | |
1062 | } | |
1063 | ||
1064 | static void setup_object(struct kmem_cache *s, struct page *page, | |
1065 | void *object) | |
1066 | { | |
1067 | setup_object_debug(s, page, object); | |
1068 | if (unlikely(s->ctor)) | |
1069 | s->ctor(object, s, 0); | |
1070 | } | |
1071 | ||
1072 | static struct page *new_slab(struct kmem_cache *s, gfp_t flags, int node) | |
1073 | { | |
1074 | struct page *page; | |
1075 | struct kmem_cache_node *n; | |
1076 | void *start; | |
1077 | void *end; | |
1078 | void *last; | |
1079 | void *p; | |
1080 | ||
1081 | BUG_ON(flags & ~(GFP_DMA | __GFP_ZERO | GFP_LEVEL_MASK)); | |
1082 | ||
1083 | if (flags & __GFP_WAIT) | |
1084 | local_irq_enable(); | |
1085 | ||
1086 | page = allocate_slab(s, flags & GFP_LEVEL_MASK, node); | |
1087 | if (!page) | |
1088 | goto out; | |
1089 | ||
1090 | n = get_node(s, page_to_nid(page)); | |
1091 | if (n) | |
1092 | atomic_long_inc(&n->nr_slabs); | |
1093 | page->offset = s->offset / sizeof(void *); | |
1094 | page->slab = s; | |
1095 | page->flags |= 1 << PG_slab; | |
1096 | if (s->flags & (SLAB_DEBUG_FREE | SLAB_RED_ZONE | SLAB_POISON | | |
1097 | SLAB_STORE_USER | SLAB_TRACE)) | |
1098 | SetSlabDebug(page); | |
1099 | ||
1100 | start = page_address(page); | |
1101 | end = start + s->objects * s->size; | |
1102 | ||
1103 | if (unlikely(s->flags & SLAB_POISON)) | |
1104 | memset(start, POISON_INUSE, PAGE_SIZE << s->order); | |
1105 | ||
1106 | last = start; | |
1107 | for_each_object(p, s, start) { | |
1108 | setup_object(s, page, last); | |
1109 | set_freepointer(s, last, p); | |
1110 | last = p; | |
1111 | } | |
1112 | setup_object(s, page, last); | |
1113 | set_freepointer(s, last, NULL); | |
1114 | ||
1115 | page->freelist = start; | |
1116 | page->lockless_freelist = NULL; | |
1117 | page->inuse = 0; | |
1118 | out: | |
1119 | if (flags & __GFP_WAIT) | |
1120 | local_irq_disable(); | |
1121 | return page; | |
1122 | } | |
1123 | ||
1124 | static void __free_slab(struct kmem_cache *s, struct page *page) | |
1125 | { | |
1126 | int pages = 1 << s->order; | |
1127 | ||
1128 | if (unlikely(SlabDebug(page))) { | |
1129 | void *p; | |
1130 | ||
1131 | slab_pad_check(s, page); | |
1132 | for_each_object(p, s, page_address(page)) | |
1133 | check_object(s, page, p, 0); | |
1134 | } | |
1135 | ||
1136 | mod_zone_page_state(page_zone(page), | |
1137 | (s->flags & SLAB_RECLAIM_ACCOUNT) ? | |
1138 | NR_SLAB_RECLAIMABLE : NR_SLAB_UNRECLAIMABLE, | |
1139 | - pages); | |
1140 | ||
1141 | page->mapping = NULL; | |
1142 | __free_pages(page, s->order); | |
1143 | } | |
1144 | ||
1145 | static void rcu_free_slab(struct rcu_head *h) | |
1146 | { | |
1147 | struct page *page; | |
1148 | ||
1149 | page = container_of((struct list_head *)h, struct page, lru); | |
1150 | __free_slab(page->slab, page); | |
1151 | } | |
1152 | ||
1153 | static void free_slab(struct kmem_cache *s, struct page *page) | |
1154 | { | |
1155 | if (unlikely(s->flags & SLAB_DESTROY_BY_RCU)) { | |
1156 | /* | |
1157 | * RCU free overloads the RCU head over the LRU | |
1158 | */ | |
1159 | struct rcu_head *head = (void *)&page->lru; | |
1160 | ||
1161 | call_rcu(head, rcu_free_slab); | |
1162 | } else | |
1163 | __free_slab(s, page); | |
1164 | } | |
1165 | ||
1166 | static void discard_slab(struct kmem_cache *s, struct page *page) | |
1167 | { | |
1168 | struct kmem_cache_node *n = get_node(s, page_to_nid(page)); | |
1169 | ||
1170 | atomic_long_dec(&n->nr_slabs); | |
1171 | reset_page_mapcount(page); | |
1172 | ClearSlabDebug(page); | |
1173 | __ClearPageSlab(page); | |
1174 | free_slab(s, page); | |
1175 | } | |
1176 | ||
1177 | /* | |
1178 | * Per slab locking using the pagelock | |
1179 | */ | |
1180 | static __always_inline void slab_lock(struct page *page) | |
1181 | { | |
1182 | bit_spin_lock(PG_locked, &page->flags); | |
1183 | } | |
1184 | ||
1185 | static __always_inline void slab_unlock(struct page *page) | |
1186 | { | |
1187 | bit_spin_unlock(PG_locked, &page->flags); | |
1188 | } | |
1189 | ||
1190 | static __always_inline int slab_trylock(struct page *page) | |
1191 | { | |
1192 | int rc = 1; | |
1193 | ||
1194 | rc = bit_spin_trylock(PG_locked, &page->flags); | |
1195 | return rc; | |
1196 | } | |
1197 | ||
1198 | /* | |
1199 | * Management of partially allocated slabs | |
1200 | */ | |
1201 | static void add_partial_tail(struct kmem_cache_node *n, struct page *page) | |
1202 | { | |
1203 | spin_lock(&n->list_lock); | |
1204 | n->nr_partial++; | |
1205 | list_add_tail(&page->lru, &n->partial); | |
1206 | spin_unlock(&n->list_lock); | |
1207 | } | |
1208 | ||
1209 | static void add_partial(struct kmem_cache_node *n, struct page *page) | |
1210 | { | |
1211 | spin_lock(&n->list_lock); | |
1212 | n->nr_partial++; | |
1213 | list_add(&page->lru, &n->partial); | |
1214 | spin_unlock(&n->list_lock); | |
1215 | } | |
1216 | ||
1217 | static void remove_partial(struct kmem_cache *s, | |
1218 | struct page *page) | |
1219 | { | |
1220 | struct kmem_cache_node *n = get_node(s, page_to_nid(page)); | |
1221 | ||
1222 | spin_lock(&n->list_lock); | |
1223 | list_del(&page->lru); | |
1224 | n->nr_partial--; | |
1225 | spin_unlock(&n->list_lock); | |
1226 | } | |
1227 | ||
1228 | /* | |
1229 | * Lock slab and remove from the partial list. | |
1230 | * | |
1231 | * Must hold list_lock. | |
1232 | */ | |
1233 | static inline int lock_and_freeze_slab(struct kmem_cache_node *n, struct page *page) | |
1234 | { | |
1235 | if (slab_trylock(page)) { | |
1236 | list_del(&page->lru); | |
1237 | n->nr_partial--; | |
1238 | SetSlabFrozen(page); | |
1239 | return 1; | |
1240 | } | |
1241 | return 0; | |
1242 | } | |
1243 | ||
1244 | /* | |
1245 | * Try to allocate a partial slab from a specific node. | |
1246 | */ | |
1247 | static struct page *get_partial_node(struct kmem_cache_node *n) | |
1248 | { | |
1249 | struct page *page; | |
1250 | ||
1251 | /* | |
1252 | * Racy check. If we mistakenly see no partial slabs then we | |
1253 | * just allocate an empty slab. If we mistakenly try to get a | |
1254 | * partial slab and there is none available then get_partials() | |
1255 | * will return NULL. | |
1256 | */ | |
1257 | if (!n || !n->nr_partial) | |
1258 | return NULL; | |
1259 | ||
1260 | spin_lock(&n->list_lock); | |
1261 | list_for_each_entry(page, &n->partial, lru) | |
1262 | if (lock_and_freeze_slab(n, page)) | |
1263 | goto out; | |
1264 | page = NULL; | |
1265 | out: | |
1266 | spin_unlock(&n->list_lock); | |
1267 | return page; | |
1268 | } | |
1269 | ||
1270 | /* | |
1271 | * Get a page from somewhere. Search in increasing NUMA distances. | |
1272 | */ | |
1273 | static struct page *get_any_partial(struct kmem_cache *s, gfp_t flags) | |
1274 | { | |
1275 | #ifdef CONFIG_NUMA | |
1276 | struct zonelist *zonelist; | |
1277 | struct zone **z; | |
1278 | struct page *page; | |
1279 | ||
1280 | /* | |
1281 | * The defrag ratio allows a configuration of the tradeoffs between | |
1282 | * inter node defragmentation and node local allocations. A lower | |
1283 | * defrag_ratio increases the tendency to do local allocations | |
1284 | * instead of attempting to obtain partial slabs from other nodes. | |
1285 | * | |
1286 | * If the defrag_ratio is set to 0 then kmalloc() always | |
1287 | * returns node local objects. If the ratio is higher then kmalloc() | |
1288 | * may return off node objects because partial slabs are obtained | |
1289 | * from other nodes and filled up. | |
1290 | * | |
1291 | * If /sys/slab/xx/defrag_ratio is set to 100 (which makes | |
1292 | * defrag_ratio = 1000) then every (well almost) allocation will | |
1293 | * first attempt to defrag slab caches on other nodes. This means | |
1294 | * scanning over all nodes to look for partial slabs which may be | |
1295 | * expensive if we do it every time we are trying to find a slab | |
1296 | * with available objects. | |
1297 | */ | |
1298 | if (!s->defrag_ratio || get_cycles() % 1024 > s->defrag_ratio) | |
1299 | return NULL; | |
1300 | ||
1301 | zonelist = &NODE_DATA(slab_node(current->mempolicy)) | |
1302 | ->node_zonelists[gfp_zone(flags)]; | |
1303 | for (z = zonelist->zones; *z; z++) { | |
1304 | struct kmem_cache_node *n; | |
1305 | ||
1306 | n = get_node(s, zone_to_nid(*z)); | |
1307 | ||
1308 | if (n && cpuset_zone_allowed_hardwall(*z, flags) && | |
1309 | n->nr_partial > MIN_PARTIAL) { | |
1310 | page = get_partial_node(n); | |
1311 | if (page) | |
1312 | return page; | |
1313 | } | |
1314 | } | |
1315 | #endif | |
1316 | return NULL; | |
1317 | } | |
1318 | ||
1319 | /* | |
1320 | * Get a partial page, lock it and return it. | |
1321 | */ | |
1322 | static struct page *get_partial(struct kmem_cache *s, gfp_t flags, int node) | |
1323 | { | |
1324 | struct page *page; | |
1325 | int searchnode = (node == -1) ? numa_node_id() : node; | |
1326 | ||
1327 | page = get_partial_node(get_node(s, searchnode)); | |
1328 | if (page || (flags & __GFP_THISNODE)) | |
1329 | return page; | |
1330 | ||
1331 | return get_any_partial(s, flags); | |
1332 | } | |
1333 | ||
1334 | /* | |
1335 | * Move a page back to the lists. | |
1336 | * | |
1337 | * Must be called with the slab lock held. | |
1338 | * | |
1339 | * On exit the slab lock will have been dropped. | |
1340 | */ | |
1341 | static void unfreeze_slab(struct kmem_cache *s, struct page *page) | |
1342 | { | |
1343 | struct kmem_cache_node *n = get_node(s, page_to_nid(page)); | |
1344 | ||
1345 | ClearSlabFrozen(page); | |
1346 | if (page->inuse) { | |
1347 | ||
1348 | if (page->freelist) | |
1349 | add_partial(n, page); | |
1350 | else if (SlabDebug(page) && (s->flags & SLAB_STORE_USER)) | |
1351 | add_full(n, page); | |
1352 | slab_unlock(page); | |
1353 | ||
1354 | } else { | |
1355 | if (n->nr_partial < MIN_PARTIAL) { | |
1356 | /* | |
1357 | * Adding an empty slab to the partial slabs in order | |
1358 | * to avoid page allocator overhead. This slab needs | |
1359 | * to come after the other slabs with objects in | |
1360 | * order to fill them up. That way the size of the | |
1361 | * partial list stays small. kmem_cache_shrink can | |
1362 | * reclaim empty slabs from the partial list. | |
1363 | */ | |
1364 | add_partial_tail(n, page); | |
1365 | slab_unlock(page); | |
1366 | } else { | |
1367 | slab_unlock(page); | |
1368 | discard_slab(s, page); | |
1369 | } | |
1370 | } | |
1371 | } | |
1372 | ||
1373 | /* | |
1374 | * Remove the cpu slab | |
1375 | */ | |
1376 | static void deactivate_slab(struct kmem_cache *s, struct page *page, int cpu) | |
1377 | { | |
1378 | /* | |
1379 | * Merge cpu freelist into freelist. Typically we get here | |
1380 | * because both freelists are empty. So this is unlikely | |
1381 | * to occur. | |
1382 | */ | |
1383 | while (unlikely(page->lockless_freelist)) { | |
1384 | void **object; | |
1385 | ||
1386 | /* Retrieve object from cpu_freelist */ | |
1387 | object = page->lockless_freelist; | |
1388 | page->lockless_freelist = page->lockless_freelist[page->offset]; | |
1389 | ||
1390 | /* And put onto the regular freelist */ | |
1391 | object[page->offset] = page->freelist; | |
1392 | page->freelist = object; | |
1393 | page->inuse--; | |
1394 | } | |
1395 | s->cpu_slab[cpu] = NULL; | |
1396 | unfreeze_slab(s, page); | |
1397 | } | |
1398 | ||
1399 | static inline void flush_slab(struct kmem_cache *s, struct page *page, int cpu) | |
1400 | { | |
1401 | slab_lock(page); | |
1402 | deactivate_slab(s, page, cpu); | |
1403 | } | |
1404 | ||
1405 | /* | |
1406 | * Flush cpu slab. | |
1407 | * Called from IPI handler with interrupts disabled. | |
1408 | */ | |
1409 | static inline void __flush_cpu_slab(struct kmem_cache *s, int cpu) | |
1410 | { | |
1411 | struct page *page = s->cpu_slab[cpu]; | |
1412 | ||
1413 | if (likely(page)) | |
1414 | flush_slab(s, page, cpu); | |
1415 | } | |
1416 | ||
1417 | static void flush_cpu_slab(void *d) | |
1418 | { | |
1419 | struct kmem_cache *s = d; | |
1420 | int cpu = smp_processor_id(); | |
1421 | ||
1422 | __flush_cpu_slab(s, cpu); | |
1423 | } | |
1424 | ||
1425 | static void flush_all(struct kmem_cache *s) | |
1426 | { | |
1427 | #ifdef CONFIG_SMP | |
1428 | on_each_cpu(flush_cpu_slab, s, 1, 1); | |
1429 | #else | |
1430 | unsigned long flags; | |
1431 | ||
1432 | local_irq_save(flags); | |
1433 | flush_cpu_slab(s); | |
1434 | local_irq_restore(flags); | |
1435 | #endif | |
1436 | } | |
1437 | ||
1438 | /* | |
1439 | * Slow path. The lockless freelist is empty or we need to perform | |
1440 | * debugging duties. | |
1441 | * | |
1442 | * Interrupts are disabled. | |
1443 | * | |
1444 | * Processing is still very fast if new objects have been freed to the | |
1445 | * regular freelist. In that case we simply take over the regular freelist | |
1446 | * as the lockless freelist and zap the regular freelist. | |
1447 | * | |
1448 | * If that is not working then we fall back to the partial lists. We take the | |
1449 | * first element of the freelist as the object to allocate now and move the | |
1450 | * rest of the freelist to the lockless freelist. | |
1451 | * | |
1452 | * And if we were unable to get a new slab from the partial slab lists then | |
1453 | * we need to allocate a new slab. This is slowest path since we may sleep. | |
1454 | */ | |
1455 | static void *__slab_alloc(struct kmem_cache *s, | |
1456 | gfp_t gfpflags, int node, void *addr, struct page *page) | |
1457 | { | |
1458 | void **object; | |
1459 | int cpu = smp_processor_id(); | |
1460 | ||
1461 | if (!page) | |
1462 | goto new_slab; | |
1463 | ||
1464 | slab_lock(page); | |
1465 | if (unlikely(node != -1 && page_to_nid(page) != node)) | |
1466 | goto another_slab; | |
1467 | load_freelist: | |
1468 | object = page->freelist; | |
1469 | if (unlikely(!object)) | |
1470 | goto another_slab; | |
1471 | if (unlikely(SlabDebug(page))) | |
1472 | goto debug; | |
1473 | ||
1474 | object = page->freelist; | |
1475 | page->lockless_freelist = object[page->offset]; | |
1476 | page->inuse = s->objects; | |
1477 | page->freelist = NULL; | |
1478 | slab_unlock(page); | |
1479 | return object; | |
1480 | ||
1481 | another_slab: | |
1482 | deactivate_slab(s, page, cpu); | |
1483 | ||
1484 | new_slab: | |
1485 | page = get_partial(s, gfpflags, node); | |
1486 | if (page) { | |
1487 | s->cpu_slab[cpu] = page; | |
1488 | goto load_freelist; | |
1489 | } | |
1490 | ||
1491 | page = new_slab(s, gfpflags, node); | |
1492 | if (page) { | |
1493 | cpu = smp_processor_id(); | |
1494 | if (s->cpu_slab[cpu]) { | |
1495 | /* | |
1496 | * Someone else populated the cpu_slab while we | |
1497 | * enabled interrupts, or we have gotten scheduled | |
1498 | * on another cpu. The page may not be on the | |
1499 | * requested node even if __GFP_THISNODE was | |
1500 | * specified. So we need to recheck. | |
1501 | */ | |
1502 | if (node == -1 || | |
1503 | page_to_nid(s->cpu_slab[cpu]) == node) { | |
1504 | /* | |
1505 | * Current cpuslab is acceptable and we | |
1506 | * want the current one since its cache hot | |
1507 | */ | |
1508 | discard_slab(s, page); | |
1509 | page = s->cpu_slab[cpu]; | |
1510 | slab_lock(page); | |
1511 | goto load_freelist; | |
1512 | } | |
1513 | /* New slab does not fit our expectations */ | |
1514 | flush_slab(s, s->cpu_slab[cpu], cpu); | |
1515 | } | |
1516 | slab_lock(page); | |
1517 | SetSlabFrozen(page); | |
1518 | s->cpu_slab[cpu] = page; | |
1519 | goto load_freelist; | |
1520 | } | |
1521 | return NULL; | |
1522 | debug: | |
1523 | object = page->freelist; | |
1524 | if (!alloc_debug_processing(s, page, object, addr)) | |
1525 | goto another_slab; | |
1526 | ||
1527 | page->inuse++; | |
1528 | page->freelist = object[page->offset]; | |
1529 | slab_unlock(page); | |
1530 | return object; | |
1531 | } | |
1532 | ||
1533 | /* | |
1534 | * Inlined fastpath so that allocation functions (kmalloc, kmem_cache_alloc) | |
1535 | * have the fastpath folded into their functions. So no function call | |
1536 | * overhead for requests that can be satisfied on the fastpath. | |
1537 | * | |
1538 | * The fastpath works by first checking if the lockless freelist can be used. | |
1539 | * If not then __slab_alloc is called for slow processing. | |
1540 | * | |
1541 | * Otherwise we can simply pick the next object from the lockless free list. | |
1542 | */ | |
1543 | static void __always_inline *slab_alloc(struct kmem_cache *s, | |
1544 | gfp_t gfpflags, int node, void *addr, int length) | |
1545 | { | |
1546 | struct page *page; | |
1547 | void **object; | |
1548 | unsigned long flags; | |
1549 | ||
1550 | local_irq_save(flags); | |
1551 | page = s->cpu_slab[smp_processor_id()]; | |
1552 | if (unlikely(!page || !page->lockless_freelist || | |
1553 | (node != -1 && page_to_nid(page) != node))) | |
1554 | ||
1555 | object = __slab_alloc(s, gfpflags, node, addr, page); | |
1556 | ||
1557 | else { | |
1558 | object = page->lockless_freelist; | |
1559 | page->lockless_freelist = object[page->offset]; | |
1560 | } | |
1561 | local_irq_restore(flags); | |
1562 | ||
1563 | if (unlikely((gfpflags & __GFP_ZERO) && object)) | |
1564 | memset(object, 0, length); | |
1565 | ||
1566 | return object; | |
1567 | } | |
1568 | ||
1569 | void *kmem_cache_alloc(struct kmem_cache *s, gfp_t gfpflags) | |
1570 | { | |
1571 | return slab_alloc(s, gfpflags, -1, | |
1572 | __builtin_return_address(0), s->objsize); | |
1573 | } | |
1574 | EXPORT_SYMBOL(kmem_cache_alloc); | |
1575 | ||
1576 | #ifdef CONFIG_NUMA | |
1577 | void *kmem_cache_alloc_node(struct kmem_cache *s, gfp_t gfpflags, int node) | |
1578 | { | |
1579 | return slab_alloc(s, gfpflags, node, | |
1580 | __builtin_return_address(0), s->objsize); | |
1581 | } | |
1582 | EXPORT_SYMBOL(kmem_cache_alloc_node); | |
1583 | #endif | |
1584 | ||
1585 | /* | |
1586 | * Slow patch handling. This may still be called frequently since objects | |
1587 | * have a longer lifetime than the cpu slabs in most processing loads. | |
1588 | * | |
1589 | * So we still attempt to reduce cache line usage. Just take the slab | |
1590 | * lock and free the item. If there is no additional partial page | |
1591 | * handling required then we can return immediately. | |
1592 | */ | |
1593 | static void __slab_free(struct kmem_cache *s, struct page *page, | |
1594 | void *x, void *addr) | |
1595 | { | |
1596 | void *prior; | |
1597 | void **object = (void *)x; | |
1598 | ||
1599 | slab_lock(page); | |
1600 | ||
1601 | if (unlikely(SlabDebug(page))) | |
1602 | goto debug; | |
1603 | checks_ok: | |
1604 | prior = object[page->offset] = page->freelist; | |
1605 | page->freelist = object; | |
1606 | page->inuse--; | |
1607 | ||
1608 | if (unlikely(SlabFrozen(page))) | |
1609 | goto out_unlock; | |
1610 | ||
1611 | if (unlikely(!page->inuse)) | |
1612 | goto slab_empty; | |
1613 | ||
1614 | /* | |
1615 | * Objects left in the slab. If it | |
1616 | * was not on the partial list before | |
1617 | * then add it. | |
1618 | */ | |
1619 | if (unlikely(!prior)) | |
1620 | add_partial(get_node(s, page_to_nid(page)), page); | |
1621 | ||
1622 | out_unlock: | |
1623 | slab_unlock(page); | |
1624 | return; | |
1625 | ||
1626 | slab_empty: | |
1627 | if (prior) | |
1628 | /* | |
1629 | * Slab still on the partial list. | |
1630 | */ | |
1631 | remove_partial(s, page); | |
1632 | ||
1633 | slab_unlock(page); | |
1634 | discard_slab(s, page); | |
1635 | return; | |
1636 | ||
1637 | debug: | |
1638 | if (!free_debug_processing(s, page, x, addr)) | |
1639 | goto out_unlock; | |
1640 | goto checks_ok; | |
1641 | } | |
1642 | ||
1643 | /* | |
1644 | * Fastpath with forced inlining to produce a kfree and kmem_cache_free that | |
1645 | * can perform fastpath freeing without additional function calls. | |
1646 | * | |
1647 | * The fastpath is only possible if we are freeing to the current cpu slab | |
1648 | * of this processor. This typically the case if we have just allocated | |
1649 | * the item before. | |
1650 | * | |
1651 | * If fastpath is not possible then fall back to __slab_free where we deal | |
1652 | * with all sorts of special processing. | |
1653 | */ | |
1654 | static void __always_inline slab_free(struct kmem_cache *s, | |
1655 | struct page *page, void *x, void *addr) | |
1656 | { | |
1657 | void **object = (void *)x; | |
1658 | unsigned long flags; | |
1659 | ||
1660 | local_irq_save(flags); | |
1661 | if (likely(page == s->cpu_slab[smp_processor_id()] && | |
1662 | !SlabDebug(page))) { | |
1663 | object[page->offset] = page->lockless_freelist; | |
1664 | page->lockless_freelist = object; | |
1665 | } else | |
1666 | __slab_free(s, page, x, addr); | |
1667 | ||
1668 | local_irq_restore(flags); | |
1669 | } | |
1670 | ||
1671 | void kmem_cache_free(struct kmem_cache *s, void *x) | |
1672 | { | |
1673 | struct page *page; | |
1674 | ||
1675 | page = virt_to_head_page(x); | |
1676 | ||
1677 | slab_free(s, page, x, __builtin_return_address(0)); | |
1678 | } | |
1679 | EXPORT_SYMBOL(kmem_cache_free); | |
1680 | ||
1681 | /* Figure out on which slab object the object resides */ | |
1682 | static struct page *get_object_page(const void *x) | |
1683 | { | |
1684 | struct page *page = virt_to_head_page(x); | |
1685 | ||
1686 | if (!PageSlab(page)) | |
1687 | return NULL; | |
1688 | ||
1689 | return page; | |
1690 | } | |
1691 | ||
1692 | /* | |
1693 | * Object placement in a slab is made very easy because we always start at | |
1694 | * offset 0. If we tune the size of the object to the alignment then we can | |
1695 | * get the required alignment by putting one properly sized object after | |
1696 | * another. | |
1697 | * | |
1698 | * Notice that the allocation order determines the sizes of the per cpu | |
1699 | * caches. Each processor has always one slab available for allocations. | |
1700 | * Increasing the allocation order reduces the number of times that slabs | |
1701 | * must be moved on and off the partial lists and is therefore a factor in | |
1702 | * locking overhead. | |
1703 | */ | |
1704 | ||
1705 | /* | |
1706 | * Mininum / Maximum order of slab pages. This influences locking overhead | |
1707 | * and slab fragmentation. A higher order reduces the number of partial slabs | |
1708 | * and increases the number of allocations possible without having to | |
1709 | * take the list_lock. | |
1710 | */ | |
1711 | static int slub_min_order; | |
1712 | static int slub_max_order = DEFAULT_MAX_ORDER; | |
1713 | static int slub_min_objects = DEFAULT_MIN_OBJECTS; | |
1714 | ||
1715 | /* | |
1716 | * Merge control. If this is set then no merging of slab caches will occur. | |
1717 | * (Could be removed. This was introduced to pacify the merge skeptics.) | |
1718 | */ | |
1719 | static int slub_nomerge; | |
1720 | ||
1721 | /* | |
1722 | * Calculate the order of allocation given an slab object size. | |
1723 | * | |
1724 | * The order of allocation has significant impact on performance and other | |
1725 | * system components. Generally order 0 allocations should be preferred since | |
1726 | * order 0 does not cause fragmentation in the page allocator. Larger objects | |
1727 | * be problematic to put into order 0 slabs because there may be too much | |
1728 | * unused space left. We go to a higher order if more than 1/8th of the slab | |
1729 | * would be wasted. | |
1730 | * | |
1731 | * In order to reach satisfactory performance we must ensure that a minimum | |
1732 | * number of objects is in one slab. Otherwise we may generate too much | |
1733 | * activity on the partial lists which requires taking the list_lock. This is | |
1734 | * less a concern for large slabs though which are rarely used. | |
1735 | * | |
1736 | * slub_max_order specifies the order where we begin to stop considering the | |
1737 | * number of objects in a slab as critical. If we reach slub_max_order then | |
1738 | * we try to keep the page order as low as possible. So we accept more waste | |
1739 | * of space in favor of a small page order. | |
1740 | * | |
1741 | * Higher order allocations also allow the placement of more objects in a | |
1742 | * slab and thereby reduce object handling overhead. If the user has | |
1743 | * requested a higher mininum order then we start with that one instead of | |
1744 | * the smallest order which will fit the object. | |
1745 | */ | |
1746 | static inline int slab_order(int size, int min_objects, | |
1747 | int max_order, int fract_leftover) | |
1748 | { | |
1749 | int order; | |
1750 | int rem; | |
1751 | int min_order = slub_min_order; | |
1752 | ||
1753 | /* | |
1754 | * If we would create too many object per slab then reduce | |
1755 | * the slab order even if it goes below slub_min_order. | |
1756 | */ | |
1757 | while (min_order > 0 && | |
1758 | (PAGE_SIZE << min_order) >= MAX_OBJECTS_PER_SLAB * size) | |
1759 | min_order--; | |
1760 | ||
1761 | for (order = max(min_order, | |
1762 | fls(min_objects * size - 1) - PAGE_SHIFT); | |
1763 | order <= max_order; order++) { | |
1764 | ||
1765 | unsigned long slab_size = PAGE_SIZE << order; | |
1766 | ||
1767 | if (slab_size < min_objects * size) | |
1768 | continue; | |
1769 | ||
1770 | rem = slab_size % size; | |
1771 | ||
1772 | if (rem <= slab_size / fract_leftover) | |
1773 | break; | |
1774 | ||
1775 | /* If the next size is too high then exit now */ | |
1776 | if (slab_size * 2 >= MAX_OBJECTS_PER_SLAB * size) | |
1777 | break; | |
1778 | } | |
1779 | ||
1780 | return order; | |
1781 | } | |
1782 | ||
1783 | static inline int calculate_order(int size) | |
1784 | { | |
1785 | int order; | |
1786 | int min_objects; | |
1787 | int fraction; | |
1788 | ||
1789 | /* | |
1790 | * Attempt to find best configuration for a slab. This | |
1791 | * works by first attempting to generate a layout with | |
1792 | * the best configuration and backing off gradually. | |
1793 | * | |
1794 | * First we reduce the acceptable waste in a slab. Then | |
1795 | * we reduce the minimum objects required in a slab. | |
1796 | */ | |
1797 | min_objects = slub_min_objects; | |
1798 | while (min_objects > 1) { | |
1799 | fraction = 8; | |
1800 | while (fraction >= 4) { | |
1801 | order = slab_order(size, min_objects, | |
1802 | slub_max_order, fraction); | |
1803 | if (order <= slub_max_order) | |
1804 | return order; | |
1805 | fraction /= 2; | |
1806 | } | |
1807 | min_objects /= 2; | |
1808 | } | |
1809 | ||
1810 | /* | |
1811 | * We were unable to place multiple objects in a slab. Now | |
1812 | * lets see if we can place a single object there. | |
1813 | */ | |
1814 | order = slab_order(size, 1, slub_max_order, 1); | |
1815 | if (order <= slub_max_order) | |
1816 | return order; | |
1817 | ||
1818 | /* | |
1819 | * Doh this slab cannot be placed using slub_max_order. | |
1820 | */ | |
1821 | order = slab_order(size, 1, MAX_ORDER, 1); | |
1822 | if (order <= MAX_ORDER) | |
1823 | return order; | |
1824 | return -ENOSYS; | |
1825 | } | |
1826 | ||
1827 | /* | |
1828 | * Figure out what the alignment of the objects will be. | |
1829 | */ | |
1830 | static unsigned long calculate_alignment(unsigned long flags, | |
1831 | unsigned long align, unsigned long size) | |
1832 | { | |
1833 | /* | |
1834 | * If the user wants hardware cache aligned objects then | |
1835 | * follow that suggestion if the object is sufficiently | |
1836 | * large. | |
1837 | * | |
1838 | * The hardware cache alignment cannot override the | |
1839 | * specified alignment though. If that is greater | |
1840 | * then use it. | |
1841 | */ | |
1842 | if ((flags & SLAB_HWCACHE_ALIGN) && | |
1843 | size > cache_line_size() / 2) | |
1844 | return max_t(unsigned long, align, cache_line_size()); | |
1845 | ||
1846 | if (align < ARCH_SLAB_MINALIGN) | |
1847 | return ARCH_SLAB_MINALIGN; | |
1848 | ||
1849 | return ALIGN(align, sizeof(void *)); | |
1850 | } | |
1851 | ||
1852 | static void init_kmem_cache_node(struct kmem_cache_node *n) | |
1853 | { | |
1854 | n->nr_partial = 0; | |
1855 | atomic_long_set(&n->nr_slabs, 0); | |
1856 | spin_lock_init(&n->list_lock); | |
1857 | INIT_LIST_HEAD(&n->partial); | |
1858 | INIT_LIST_HEAD(&n->full); | |
1859 | } | |
1860 | ||
1861 | #ifdef CONFIG_NUMA | |
1862 | /* | |
1863 | * No kmalloc_node yet so do it by hand. We know that this is the first | |
1864 | * slab on the node for this slabcache. There are no concurrent accesses | |
1865 | * possible. | |
1866 | * | |
1867 | * Note that this function only works on the kmalloc_node_cache | |
1868 | * when allocating for the kmalloc_node_cache. | |
1869 | */ | |
1870 | static struct kmem_cache_node * __init early_kmem_cache_node_alloc(gfp_t gfpflags, | |
1871 | int node) | |
1872 | { | |
1873 | struct page *page; | |
1874 | struct kmem_cache_node *n; | |
1875 | ||
1876 | BUG_ON(kmalloc_caches->size < sizeof(struct kmem_cache_node)); | |
1877 | ||
1878 | page = new_slab(kmalloc_caches, gfpflags | GFP_THISNODE, node); | |
1879 | ||
1880 | BUG_ON(!page); | |
1881 | n = page->freelist; | |
1882 | BUG_ON(!n); | |
1883 | page->freelist = get_freepointer(kmalloc_caches, n); | |
1884 | page->inuse++; | |
1885 | kmalloc_caches->node[node] = n; | |
1886 | init_object(kmalloc_caches, n, 1); | |
1887 | init_tracking(kmalloc_caches, n); | |
1888 | init_kmem_cache_node(n); | |
1889 | atomic_long_inc(&n->nr_slabs); | |
1890 | add_partial(n, page); | |
1891 | ||
1892 | /* | |
1893 | * new_slab() disables interupts. If we do not reenable interrupts here | |
1894 | * then bootup would continue with interrupts disabled. | |
1895 | */ | |
1896 | local_irq_enable(); | |
1897 | return n; | |
1898 | } | |
1899 | ||
1900 | static void free_kmem_cache_nodes(struct kmem_cache *s) | |
1901 | { | |
1902 | int node; | |
1903 | ||
1904 | for_each_online_node(node) { | |
1905 | struct kmem_cache_node *n = s->node[node]; | |
1906 | if (n && n != &s->local_node) | |
1907 | kmem_cache_free(kmalloc_caches, n); | |
1908 | s->node[node] = NULL; | |
1909 | } | |
1910 | } | |
1911 | ||
1912 | static int init_kmem_cache_nodes(struct kmem_cache *s, gfp_t gfpflags) | |
1913 | { | |
1914 | int node; | |
1915 | int local_node; | |
1916 | ||
1917 | if (slab_state >= UP) | |
1918 | local_node = page_to_nid(virt_to_page(s)); | |
1919 | else | |
1920 | local_node = 0; | |
1921 | ||
1922 | for_each_online_node(node) { | |
1923 | struct kmem_cache_node *n; | |
1924 | ||
1925 | if (local_node == node) | |
1926 | n = &s->local_node; | |
1927 | else { | |
1928 | if (slab_state == DOWN) { | |
1929 | n = early_kmem_cache_node_alloc(gfpflags, | |
1930 | node); | |
1931 | continue; | |
1932 | } | |
1933 | n = kmem_cache_alloc_node(kmalloc_caches, | |
1934 | gfpflags, node); | |
1935 | ||
1936 | if (!n) { | |
1937 | free_kmem_cache_nodes(s); | |
1938 | return 0; | |
1939 | } | |
1940 | ||
1941 | } | |
1942 | s->node[node] = n; | |
1943 | init_kmem_cache_node(n); | |
1944 | } | |
1945 | return 1; | |
1946 | } | |
1947 | #else | |
1948 | static void free_kmem_cache_nodes(struct kmem_cache *s) | |
1949 | { | |
1950 | } | |
1951 | ||
1952 | static int init_kmem_cache_nodes(struct kmem_cache *s, gfp_t gfpflags) | |
1953 | { | |
1954 | init_kmem_cache_node(&s->local_node); | |
1955 | return 1; | |
1956 | } | |
1957 | #endif | |
1958 | ||
1959 | /* | |
1960 | * calculate_sizes() determines the order and the distribution of data within | |
1961 | * a slab object. | |
1962 | */ | |
1963 | static int calculate_sizes(struct kmem_cache *s) | |
1964 | { | |
1965 | unsigned long flags = s->flags; | |
1966 | unsigned long size = s->objsize; | |
1967 | unsigned long align = s->align; | |
1968 | ||
1969 | /* | |
1970 | * Determine if we can poison the object itself. If the user of | |
1971 | * the slab may touch the object after free or before allocation | |
1972 | * then we should never poison the object itself. | |
1973 | */ | |
1974 | if ((flags & SLAB_POISON) && !(flags & SLAB_DESTROY_BY_RCU) && | |
1975 | !s->ctor) | |
1976 | s->flags |= __OBJECT_POISON; | |
1977 | else | |
1978 | s->flags &= ~__OBJECT_POISON; | |
1979 | ||
1980 | /* | |
1981 | * Round up object size to the next word boundary. We can only | |
1982 | * place the free pointer at word boundaries and this determines | |
1983 | * the possible location of the free pointer. | |
1984 | */ | |
1985 | size = ALIGN(size, sizeof(void *)); | |
1986 | ||
1987 | #ifdef CONFIG_SLUB_DEBUG | |
1988 | /* | |
1989 | * If we are Redzoning then check if there is some space between the | |
1990 | * end of the object and the free pointer. If not then add an | |
1991 | * additional word to have some bytes to store Redzone information. | |
1992 | */ | |
1993 | if ((flags & SLAB_RED_ZONE) && size == s->objsize) | |
1994 | size += sizeof(void *); | |
1995 | #endif | |
1996 | ||
1997 | /* | |
1998 | * With that we have determined the number of bytes in actual use | |
1999 | * by the object. This is the potential offset to the free pointer. | |
2000 | */ | |
2001 | s->inuse = size; | |
2002 | ||
2003 | if (((flags & (SLAB_DESTROY_BY_RCU | SLAB_POISON)) || | |
2004 | s->ctor)) { | |
2005 | /* | |
2006 | * Relocate free pointer after the object if it is not | |
2007 | * permitted to overwrite the first word of the object on | |
2008 | * kmem_cache_free. | |
2009 | * | |
2010 | * This is the case if we do RCU, have a constructor or | |
2011 | * destructor or are poisoning the objects. | |
2012 | */ | |
2013 | s->offset = size; | |
2014 | size += sizeof(void *); | |
2015 | } | |
2016 | ||
2017 | #ifdef CONFIG_SLUB_DEBUG | |
2018 | if (flags & SLAB_STORE_USER) | |
2019 | /* | |
2020 | * Need to store information about allocs and frees after | |
2021 | * the object. | |
2022 | */ | |
2023 | size += 2 * sizeof(struct track); | |
2024 | ||
2025 | if (flags & SLAB_RED_ZONE) | |
2026 | /* | |
2027 | * Add some empty padding so that we can catch | |
2028 | * overwrites from earlier objects rather than let | |
2029 | * tracking information or the free pointer be | |
2030 | * corrupted if an user writes before the start | |
2031 | * of the object. | |
2032 | */ | |
2033 | size += sizeof(void *); | |
2034 | #endif | |
2035 | ||
2036 | /* | |
2037 | * Determine the alignment based on various parameters that the | |
2038 | * user specified and the dynamic determination of cache line size | |
2039 | * on bootup. | |
2040 | */ | |
2041 | align = calculate_alignment(flags, align, s->objsize); | |
2042 | ||
2043 | /* | |
2044 | * SLUB stores one object immediately after another beginning from | |
2045 | * offset 0. In order to align the objects we have to simply size | |
2046 | * each object to conform to the alignment. | |
2047 | */ | |
2048 | size = ALIGN(size, align); | |
2049 | s->size = size; | |
2050 | ||
2051 | s->order = calculate_order(size); | |
2052 | if (s->order < 0) | |
2053 | return 0; | |
2054 | ||
2055 | /* | |
2056 | * Determine the number of objects per slab | |
2057 | */ | |
2058 | s->objects = (PAGE_SIZE << s->order) / size; | |
2059 | ||
2060 | /* | |
2061 | * Verify that the number of objects is within permitted limits. | |
2062 | * The page->inuse field is only 16 bit wide! So we cannot have | |
2063 | * more than 64k objects per slab. | |
2064 | */ | |
2065 | if (!s->objects || s->objects > MAX_OBJECTS_PER_SLAB) | |
2066 | return 0; | |
2067 | return 1; | |
2068 | ||
2069 | } | |
2070 | ||
2071 | static int kmem_cache_open(struct kmem_cache *s, gfp_t gfpflags, | |
2072 | const char *name, size_t size, | |
2073 | size_t align, unsigned long flags, | |
2074 | void (*ctor)(void *, struct kmem_cache *, unsigned long)) | |
2075 | { | |
2076 | memset(s, 0, kmem_size); | |
2077 | s->name = name; | |
2078 | s->ctor = ctor; | |
2079 | s->objsize = size; | |
2080 | s->flags = flags; | |
2081 | s->align = align; | |
2082 | kmem_cache_open_debug_check(s); | |
2083 | ||
2084 | if (!calculate_sizes(s)) | |
2085 | goto error; | |
2086 | ||
2087 | s->refcount = 1; | |
2088 | #ifdef CONFIG_NUMA | |
2089 | s->defrag_ratio = 100; | |
2090 | #endif | |
2091 | ||
2092 | if (init_kmem_cache_nodes(s, gfpflags & ~SLUB_DMA)) | |
2093 | return 1; | |
2094 | error: | |
2095 | if (flags & SLAB_PANIC) | |
2096 | panic("Cannot create slab %s size=%lu realsize=%u " | |
2097 | "order=%u offset=%u flags=%lx\n", | |
2098 | s->name, (unsigned long)size, s->size, s->order, | |
2099 | s->offset, flags); | |
2100 | return 0; | |
2101 | } | |
2102 | ||
2103 | /* | |
2104 | * Check if a given pointer is valid | |
2105 | */ | |
2106 | int kmem_ptr_validate(struct kmem_cache *s, const void *object) | |
2107 | { | |
2108 | struct page * page; | |
2109 | ||
2110 | page = get_object_page(object); | |
2111 | ||
2112 | if (!page || s != page->slab) | |
2113 | /* No slab or wrong slab */ | |
2114 | return 0; | |
2115 | ||
2116 | if (!check_valid_pointer(s, page, object)) | |
2117 | return 0; | |
2118 | ||
2119 | /* | |
2120 | * We could also check if the object is on the slabs freelist. | |
2121 | * But this would be too expensive and it seems that the main | |
2122 | * purpose of kmem_ptr_valid is to check if the object belongs | |
2123 | * to a certain slab. | |
2124 | */ | |
2125 | return 1; | |
2126 | } | |
2127 | EXPORT_SYMBOL(kmem_ptr_validate); | |
2128 | ||
2129 | /* | |
2130 | * Determine the size of a slab object | |
2131 | */ | |
2132 | unsigned int kmem_cache_size(struct kmem_cache *s) | |
2133 | { | |
2134 | return s->objsize; | |
2135 | } | |
2136 | EXPORT_SYMBOL(kmem_cache_size); | |
2137 | ||
2138 | const char *kmem_cache_name(struct kmem_cache *s) | |
2139 | { | |
2140 | return s->name; | |
2141 | } | |
2142 | EXPORT_SYMBOL(kmem_cache_name); | |
2143 | ||
2144 | /* | |
2145 | * Attempt to free all slabs on a node. Return the number of slabs we | |
2146 | * were unable to free. | |
2147 | */ | |
2148 | static int free_list(struct kmem_cache *s, struct kmem_cache_node *n, | |
2149 | struct list_head *list) | |
2150 | { | |
2151 | int slabs_inuse = 0; | |
2152 | unsigned long flags; | |
2153 | struct page *page, *h; | |
2154 | ||
2155 | spin_lock_irqsave(&n->list_lock, flags); | |
2156 | list_for_each_entry_safe(page, h, list, lru) | |
2157 | if (!page->inuse) { | |
2158 | list_del(&page->lru); | |
2159 | discard_slab(s, page); | |
2160 | } else | |
2161 | slabs_inuse++; | |
2162 | spin_unlock_irqrestore(&n->list_lock, flags); | |
2163 | return slabs_inuse; | |
2164 | } | |
2165 | ||
2166 | /* | |
2167 | * Release all resources used by a slab cache. | |
2168 | */ | |
2169 | static inline int kmem_cache_close(struct kmem_cache *s) | |
2170 | { | |
2171 | int node; | |
2172 | ||
2173 | flush_all(s); | |
2174 | ||
2175 | /* Attempt to free all objects */ | |
2176 | for_each_online_node(node) { | |
2177 | struct kmem_cache_node *n = get_node(s, node); | |
2178 | ||
2179 | n->nr_partial -= free_list(s, n, &n->partial); | |
2180 | if (atomic_long_read(&n->nr_slabs)) | |
2181 | return 1; | |
2182 | } | |
2183 | free_kmem_cache_nodes(s); | |
2184 | return 0; | |
2185 | } | |
2186 | ||
2187 | /* | |
2188 | * Close a cache and release the kmem_cache structure | |
2189 | * (must be used for caches created using kmem_cache_create) | |
2190 | */ | |
2191 | void kmem_cache_destroy(struct kmem_cache *s) | |
2192 | { | |
2193 | down_write(&slub_lock); | |
2194 | s->refcount--; | |
2195 | if (!s->refcount) { | |
2196 | list_del(&s->list); | |
2197 | if (kmem_cache_close(s)) | |
2198 | WARN_ON(1); | |
2199 | sysfs_slab_remove(s); | |
2200 | kfree(s); | |
2201 | } | |
2202 | up_write(&slub_lock); | |
2203 | } | |
2204 | EXPORT_SYMBOL(kmem_cache_destroy); | |
2205 | ||
2206 | /******************************************************************** | |
2207 | * Kmalloc subsystem | |
2208 | *******************************************************************/ | |
2209 | ||
2210 | struct kmem_cache kmalloc_caches[KMALLOC_SHIFT_HIGH + 1] __cacheline_aligned; | |
2211 | EXPORT_SYMBOL(kmalloc_caches); | |
2212 | ||
2213 | #ifdef CONFIG_ZONE_DMA | |
2214 | static struct kmem_cache *kmalloc_caches_dma[KMALLOC_SHIFT_HIGH + 1]; | |
2215 | #endif | |
2216 | ||
2217 | static int __init setup_slub_min_order(char *str) | |
2218 | { | |
2219 | get_option (&str, &slub_min_order); | |
2220 | ||
2221 | return 1; | |
2222 | } | |
2223 | ||
2224 | __setup("slub_min_order=", setup_slub_min_order); | |
2225 | ||
2226 | static int __init setup_slub_max_order(char *str) | |
2227 | { | |
2228 | get_option (&str, &slub_max_order); | |
2229 | ||
2230 | return 1; | |
2231 | } | |
2232 | ||
2233 | __setup("slub_max_order=", setup_slub_max_order); | |
2234 | ||
2235 | static int __init setup_slub_min_objects(char *str) | |
2236 | { | |
2237 | get_option (&str, &slub_min_objects); | |
2238 | ||
2239 | return 1; | |
2240 | } | |
2241 | ||
2242 | __setup("slub_min_objects=", setup_slub_min_objects); | |
2243 | ||
2244 | static int __init setup_slub_nomerge(char *str) | |
2245 | { | |
2246 | slub_nomerge = 1; | |
2247 | return 1; | |
2248 | } | |
2249 | ||
2250 | __setup("slub_nomerge", setup_slub_nomerge); | |
2251 | ||
2252 | static struct kmem_cache *create_kmalloc_cache(struct kmem_cache *s, | |
2253 | const char *name, int size, gfp_t gfp_flags) | |
2254 | { | |
2255 | unsigned int flags = 0; | |
2256 | ||
2257 | if (gfp_flags & SLUB_DMA) | |
2258 | flags = SLAB_CACHE_DMA; | |
2259 | ||
2260 | down_write(&slub_lock); | |
2261 | if (!kmem_cache_open(s, gfp_flags, name, size, ARCH_KMALLOC_MINALIGN, | |
2262 | flags, NULL)) | |
2263 | goto panic; | |
2264 | ||
2265 | list_add(&s->list, &slab_caches); | |
2266 | up_write(&slub_lock); | |
2267 | if (sysfs_slab_add(s)) | |
2268 | goto panic; | |
2269 | return s; | |
2270 | ||
2271 | panic: | |
2272 | panic("Creation of kmalloc slab %s size=%d failed.\n", name, size); | |
2273 | } | |
2274 | ||
2275 | static struct kmem_cache *get_slab(size_t size, gfp_t flags) | |
2276 | { | |
2277 | int index = kmalloc_index(size); | |
2278 | ||
2279 | if (!index) | |
2280 | return ZERO_SIZE_PTR; | |
2281 | ||
2282 | /* Allocation too large? */ | |
2283 | if (index < 0) | |
2284 | return NULL; | |
2285 | ||
2286 | #ifdef CONFIG_ZONE_DMA | |
2287 | if ((flags & SLUB_DMA)) { | |
2288 | struct kmem_cache *s; | |
2289 | struct kmem_cache *x; | |
2290 | char *text; | |
2291 | size_t realsize; | |
2292 | ||
2293 | s = kmalloc_caches_dma[index]; | |
2294 | if (s) | |
2295 | return s; | |
2296 | ||
2297 | /* Dynamically create dma cache */ | |
2298 | x = kmalloc(kmem_size, flags & ~SLUB_DMA); | |
2299 | if (!x) | |
2300 | panic("Unable to allocate memory for dma cache\n"); | |
2301 | ||
2302 | if (index <= KMALLOC_SHIFT_HIGH) | |
2303 | realsize = 1 << index; | |
2304 | else { | |
2305 | if (index == 1) | |
2306 | realsize = 96; | |
2307 | else | |
2308 | realsize = 192; | |
2309 | } | |
2310 | ||
2311 | text = kasprintf(flags & ~SLUB_DMA, "kmalloc_dma-%d", | |
2312 | (unsigned int)realsize); | |
2313 | s = create_kmalloc_cache(x, text, realsize, flags); | |
2314 | kmalloc_caches_dma[index] = s; | |
2315 | return s; | |
2316 | } | |
2317 | #endif | |
2318 | return &kmalloc_caches[index]; | |
2319 | } | |
2320 | ||
2321 | void *__kmalloc(size_t size, gfp_t flags) | |
2322 | { | |
2323 | struct kmem_cache *s = get_slab(size, flags); | |
2324 | ||
2325 | if (ZERO_OR_NULL_PTR(s)) | |
2326 | return s; | |
2327 | ||
2328 | return slab_alloc(s, flags, -1, __builtin_return_address(0), size); | |
2329 | } | |
2330 | EXPORT_SYMBOL(__kmalloc); | |
2331 | ||
2332 | #ifdef CONFIG_NUMA | |
2333 | void *__kmalloc_node(size_t size, gfp_t flags, int node) | |
2334 | { | |
2335 | struct kmem_cache *s = get_slab(size, flags); | |
2336 | ||
2337 | if (ZERO_OR_NULL_PTR(s)) | |
2338 | return s; | |
2339 | ||
2340 | return slab_alloc(s, flags, node, __builtin_return_address(0), size); | |
2341 | } | |
2342 | EXPORT_SYMBOL(__kmalloc_node); | |
2343 | #endif | |
2344 | ||
2345 | size_t ksize(const void *object) | |
2346 | { | |
2347 | struct page *page; | |
2348 | struct kmem_cache *s; | |
2349 | ||
2350 | if (object == ZERO_SIZE_PTR) | |
2351 | return 0; | |
2352 | ||
2353 | page = get_object_page(object); | |
2354 | BUG_ON(!page); | |
2355 | s = page->slab; | |
2356 | BUG_ON(!s); | |
2357 | ||
2358 | /* | |
2359 | * Debugging requires use of the padding between object | |
2360 | * and whatever may come after it. | |
2361 | */ | |
2362 | if (s->flags & (SLAB_RED_ZONE | SLAB_POISON)) | |
2363 | return s->objsize; | |
2364 | ||
2365 | /* | |
2366 | * If we have the need to store the freelist pointer | |
2367 | * back there or track user information then we can | |
2368 | * only use the space before that information. | |
2369 | */ | |
2370 | if (s->flags & (SLAB_DESTROY_BY_RCU | SLAB_STORE_USER)) | |
2371 | return s->inuse; | |
2372 | ||
2373 | /* | |
2374 | * Else we can use all the padding etc for the allocation | |
2375 | */ | |
2376 | return s->size; | |
2377 | } | |
2378 | EXPORT_SYMBOL(ksize); | |
2379 | ||
2380 | void kfree(const void *x) | |
2381 | { | |
2382 | struct kmem_cache *s; | |
2383 | struct page *page; | |
2384 | ||
2385 | /* | |
2386 | * This has to be an unsigned comparison. According to Linus | |
2387 | * some gcc version treat a pointer as a signed entity. Then | |
2388 | * this comparison would be true for all "negative" pointers | |
2389 | * (which would cover the whole upper half of the address space). | |
2390 | */ | |
2391 | if (ZERO_OR_NULL_PTR(x)) | |
2392 | return; | |
2393 | ||
2394 | page = virt_to_head_page(x); | |
2395 | s = page->slab; | |
2396 | ||
2397 | slab_free(s, page, (void *)x, __builtin_return_address(0)); | |
2398 | } | |
2399 | EXPORT_SYMBOL(kfree); | |
2400 | ||
2401 | /* | |
2402 | * kmem_cache_shrink removes empty slabs from the partial lists and sorts | |
2403 | * the remaining slabs by the number of items in use. The slabs with the | |
2404 | * most items in use come first. New allocations will then fill those up | |
2405 | * and thus they can be removed from the partial lists. | |
2406 | * | |
2407 | * The slabs with the least items are placed last. This results in them | |
2408 | * being allocated from last increasing the chance that the last objects | |
2409 | * are freed in them. | |
2410 | */ | |
2411 | int kmem_cache_shrink(struct kmem_cache *s) | |
2412 | { | |
2413 | int node; | |
2414 | int i; | |
2415 | struct kmem_cache_node *n; | |
2416 | struct page *page; | |
2417 | struct page *t; | |
2418 | struct list_head *slabs_by_inuse = | |
2419 | kmalloc(sizeof(struct list_head) * s->objects, GFP_KERNEL); | |
2420 | unsigned long flags; | |
2421 | ||
2422 | if (!slabs_by_inuse) | |
2423 | return -ENOMEM; | |
2424 | ||
2425 | flush_all(s); | |
2426 | for_each_online_node(node) { | |
2427 | n = get_node(s, node); | |
2428 | ||
2429 | if (!n->nr_partial) | |
2430 | continue; | |
2431 | ||
2432 | for (i = 0; i < s->objects; i++) | |
2433 | INIT_LIST_HEAD(slabs_by_inuse + i); | |
2434 | ||
2435 | spin_lock_irqsave(&n->list_lock, flags); | |
2436 | ||
2437 | /* | |
2438 | * Build lists indexed by the items in use in each slab. | |
2439 | * | |
2440 | * Note that concurrent frees may occur while we hold the | |
2441 | * list_lock. page->inuse here is the upper limit. | |
2442 | */ | |
2443 | list_for_each_entry_safe(page, t, &n->partial, lru) { | |
2444 | if (!page->inuse && slab_trylock(page)) { | |
2445 | /* | |
2446 | * Must hold slab lock here because slab_free | |
2447 | * may have freed the last object and be | |
2448 | * waiting to release the slab. | |
2449 | */ | |
2450 | list_del(&page->lru); | |
2451 | n->nr_partial--; | |
2452 | slab_unlock(page); | |
2453 | discard_slab(s, page); | |
2454 | } else { | |
2455 | if (n->nr_partial > MAX_PARTIAL) | |
2456 | list_move(&page->lru, | |
2457 | slabs_by_inuse + page->inuse); | |
2458 | } | |
2459 | } | |
2460 | ||
2461 | if (n->nr_partial <= MAX_PARTIAL) | |
2462 | goto out; | |
2463 | ||
2464 | /* | |
2465 | * Rebuild the partial list with the slabs filled up most | |
2466 | * first and the least used slabs at the end. | |
2467 | */ | |
2468 | for (i = s->objects - 1; i >= 0; i--) | |
2469 | list_splice(slabs_by_inuse + i, n->partial.prev); | |
2470 | ||
2471 | out: | |
2472 | spin_unlock_irqrestore(&n->list_lock, flags); | |
2473 | } | |
2474 | ||
2475 | kfree(slabs_by_inuse); | |
2476 | return 0; | |
2477 | } | |
2478 | EXPORT_SYMBOL(kmem_cache_shrink); | |
2479 | ||
2480 | /******************************************************************** | |
2481 | * Basic setup of slabs | |
2482 | *******************************************************************/ | |
2483 | ||
2484 | void __init kmem_cache_init(void) | |
2485 | { | |
2486 | int i; | |
2487 | int caches = 0; | |
2488 | ||
2489 | #ifdef CONFIG_NUMA | |
2490 | /* | |
2491 | * Must first have the slab cache available for the allocations of the | |
2492 | * struct kmem_cache_node's. There is special bootstrap code in | |
2493 | * kmem_cache_open for slab_state == DOWN. | |
2494 | */ | |
2495 | create_kmalloc_cache(&kmalloc_caches[0], "kmem_cache_node", | |
2496 | sizeof(struct kmem_cache_node), GFP_KERNEL); | |
2497 | kmalloc_caches[0].refcount = -1; | |
2498 | caches++; | |
2499 | #endif | |
2500 | ||
2501 | /* Able to allocate the per node structures */ | |
2502 | slab_state = PARTIAL; | |
2503 | ||
2504 | /* Caches that are not of the two-to-the-power-of size */ | |
2505 | if (KMALLOC_MIN_SIZE <= 64) { | |
2506 | create_kmalloc_cache(&kmalloc_caches[1], | |
2507 | "kmalloc-96", 96, GFP_KERNEL); | |
2508 | caches++; | |
2509 | } | |
2510 | if (KMALLOC_MIN_SIZE <= 128) { | |
2511 | create_kmalloc_cache(&kmalloc_caches[2], | |
2512 | "kmalloc-192", 192, GFP_KERNEL); | |
2513 | caches++; | |
2514 | } | |
2515 | ||
2516 | for (i = KMALLOC_SHIFT_LOW; i <= KMALLOC_SHIFT_HIGH; i++) { | |
2517 | create_kmalloc_cache(&kmalloc_caches[i], | |
2518 | "kmalloc", 1 << i, GFP_KERNEL); | |
2519 | caches++; | |
2520 | } | |
2521 | ||
2522 | slab_state = UP; | |
2523 | ||
2524 | /* Provide the correct kmalloc names now that the caches are up */ | |
2525 | for (i = KMALLOC_SHIFT_LOW; i <= KMALLOC_SHIFT_HIGH; i++) | |
2526 | kmalloc_caches[i]. name = | |
2527 | kasprintf(GFP_KERNEL, "kmalloc-%d", 1 << i); | |
2528 | ||
2529 | #ifdef CONFIG_SMP | |
2530 | register_cpu_notifier(&slab_notifier); | |
2531 | #endif | |
2532 | ||
2533 | kmem_size = offsetof(struct kmem_cache, cpu_slab) + | |
2534 | nr_cpu_ids * sizeof(struct page *); | |
2535 | ||
2536 | printk(KERN_INFO "SLUB: Genslabs=%d, HWalign=%d, Order=%d-%d, MinObjects=%d," | |
2537 | " CPUs=%d, Nodes=%d\n", | |
2538 | caches, cache_line_size(), | |
2539 | slub_min_order, slub_max_order, slub_min_objects, | |
2540 | nr_cpu_ids, nr_node_ids); | |
2541 | } | |
2542 | ||
2543 | /* | |
2544 | * Find a mergeable slab cache | |
2545 | */ | |
2546 | static int slab_unmergeable(struct kmem_cache *s) | |
2547 | { | |
2548 | if (slub_nomerge || (s->flags & SLUB_NEVER_MERGE)) | |
2549 | return 1; | |
2550 | ||
2551 | if (s->ctor) | |
2552 | return 1; | |
2553 | ||
2554 | /* | |
2555 | * We may have set a slab to be unmergeable during bootstrap. | |
2556 | */ | |
2557 | if (s->refcount < 0) | |
2558 | return 1; | |
2559 | ||
2560 | return 0; | |
2561 | } | |
2562 | ||
2563 | static struct kmem_cache *find_mergeable(size_t size, | |
2564 | size_t align, unsigned long flags, | |
2565 | void (*ctor)(void *, struct kmem_cache *, unsigned long)) | |
2566 | { | |
2567 | struct kmem_cache *s; | |
2568 | ||
2569 | if (slub_nomerge || (flags & SLUB_NEVER_MERGE)) | |
2570 | return NULL; | |
2571 | ||
2572 | if (ctor) | |
2573 | return NULL; | |
2574 | ||
2575 | size = ALIGN(size, sizeof(void *)); | |
2576 | align = calculate_alignment(flags, align, size); | |
2577 | size = ALIGN(size, align); | |
2578 | ||
2579 | list_for_each_entry(s, &slab_caches, list) { | |
2580 | if (slab_unmergeable(s)) | |
2581 | continue; | |
2582 | ||
2583 | if (size > s->size) | |
2584 | continue; | |
2585 | ||
2586 | if (((flags | slub_debug) & SLUB_MERGE_SAME) != | |
2587 | (s->flags & SLUB_MERGE_SAME)) | |
2588 | continue; | |
2589 | /* | |
2590 | * Check if alignment is compatible. | |
2591 | * Courtesy of Adrian Drzewiecki | |
2592 | */ | |
2593 | if ((s->size & ~(align -1)) != s->size) | |
2594 | continue; | |
2595 | ||
2596 | if (s->size - size >= sizeof(void *)) | |
2597 | continue; | |
2598 | ||
2599 | return s; | |
2600 | } | |
2601 | return NULL; | |
2602 | } | |
2603 | ||
2604 | struct kmem_cache *kmem_cache_create(const char *name, size_t size, | |
2605 | size_t align, unsigned long flags, | |
2606 | void (*ctor)(void *, struct kmem_cache *, unsigned long), | |
2607 | void (*dtor)(void *, struct kmem_cache *, unsigned long)) | |
2608 | { | |
2609 | struct kmem_cache *s; | |
2610 | ||
2611 | BUG_ON(dtor); | |
2612 | down_write(&slub_lock); | |
2613 | s = find_mergeable(size, align, flags, ctor); | |
2614 | if (s) { | |
2615 | s->refcount++; | |
2616 | /* | |
2617 | * Adjust the object sizes so that we clear | |
2618 | * the complete object on kzalloc. | |
2619 | */ | |
2620 | s->objsize = max(s->objsize, (int)size); | |
2621 | s->inuse = max_t(int, s->inuse, ALIGN(size, sizeof(void *))); | |
2622 | if (sysfs_slab_alias(s, name)) | |
2623 | goto err; | |
2624 | } else { | |
2625 | s = kmalloc(kmem_size, GFP_KERNEL); | |
2626 | if (s && kmem_cache_open(s, GFP_KERNEL, name, | |
2627 | size, align, flags, ctor)) { | |
2628 | if (sysfs_slab_add(s)) { | |
2629 | kfree(s); | |
2630 | goto err; | |
2631 | } | |
2632 | list_add(&s->list, &slab_caches); | |
2633 | } else | |
2634 | kfree(s); | |
2635 | } | |
2636 | up_write(&slub_lock); | |
2637 | return s; | |
2638 | ||
2639 | err: | |
2640 | up_write(&slub_lock); | |
2641 | if (flags & SLAB_PANIC) | |
2642 | panic("Cannot create slabcache %s\n", name); | |
2643 | else | |
2644 | s = NULL; | |
2645 | return s; | |
2646 | } | |
2647 | EXPORT_SYMBOL(kmem_cache_create); | |
2648 | ||
2649 | void *kmem_cache_zalloc(struct kmem_cache *s, gfp_t flags) | |
2650 | { | |
2651 | void *x; | |
2652 | ||
2653 | x = slab_alloc(s, flags, -1, __builtin_return_address(0), 0); | |
2654 | if (x) | |
2655 | memset(x, 0, s->objsize); | |
2656 | return x; | |
2657 | } | |
2658 | EXPORT_SYMBOL(kmem_cache_zalloc); | |
2659 | ||
2660 | #ifdef CONFIG_SMP | |
2661 | /* | |
2662 | * Use the cpu notifier to insure that the cpu slabs are flushed when | |
2663 | * necessary. | |
2664 | */ | |
2665 | static int __cpuinit slab_cpuup_callback(struct notifier_block *nfb, | |
2666 | unsigned long action, void *hcpu) | |
2667 | { | |
2668 | long cpu = (long)hcpu; | |
2669 | struct kmem_cache *s; | |
2670 | unsigned long flags; | |
2671 | ||
2672 | switch (action) { | |
2673 | case CPU_UP_CANCELED: | |
2674 | case CPU_UP_CANCELED_FROZEN: | |
2675 | case CPU_DEAD: | |
2676 | case CPU_DEAD_FROZEN: | |
2677 | down_read(&slub_lock); | |
2678 | list_for_each_entry(s, &slab_caches, list) { | |
2679 | local_irq_save(flags); | |
2680 | __flush_cpu_slab(s, cpu); | |
2681 | local_irq_restore(flags); | |
2682 | } | |
2683 | up_read(&slub_lock); | |
2684 | break; | |
2685 | default: | |
2686 | break; | |
2687 | } | |
2688 | return NOTIFY_OK; | |
2689 | } | |
2690 | ||
2691 | static struct notifier_block __cpuinitdata slab_notifier = | |
2692 | { &slab_cpuup_callback, NULL, 0 }; | |
2693 | ||
2694 | #endif | |
2695 | ||
2696 | void *__kmalloc_track_caller(size_t size, gfp_t gfpflags, void *caller) | |
2697 | { | |
2698 | struct kmem_cache *s = get_slab(size, gfpflags); | |
2699 | ||
2700 | if (ZERO_OR_NULL_PTR(s)) | |
2701 | return s; | |
2702 | ||
2703 | return slab_alloc(s, gfpflags, -1, caller, size); | |
2704 | } | |
2705 | ||
2706 | void *__kmalloc_node_track_caller(size_t size, gfp_t gfpflags, | |
2707 | int node, void *caller) | |
2708 | { | |
2709 | struct kmem_cache *s = get_slab(size, gfpflags); | |
2710 | ||
2711 | if (ZERO_OR_NULL_PTR(s)) | |
2712 | return s; | |
2713 | ||
2714 | return slab_alloc(s, gfpflags, node, caller, size); | |
2715 | } | |
2716 | ||
2717 | #if defined(CONFIG_SYSFS) && defined(CONFIG_SLUB_DEBUG) | |
2718 | static int validate_slab(struct kmem_cache *s, struct page *page) | |
2719 | { | |
2720 | void *p; | |
2721 | void *addr = page_address(page); | |
2722 | DECLARE_BITMAP(map, s->objects); | |
2723 | ||
2724 | if (!check_slab(s, page) || | |
2725 | !on_freelist(s, page, NULL)) | |
2726 | return 0; | |
2727 | ||
2728 | /* Now we know that a valid freelist exists */ | |
2729 | bitmap_zero(map, s->objects); | |
2730 | ||
2731 | for_each_free_object(p, s, page->freelist) { | |
2732 | set_bit(slab_index(p, s, addr), map); | |
2733 | if (!check_object(s, page, p, 0)) | |
2734 | return 0; | |
2735 | } | |
2736 | ||
2737 | for_each_object(p, s, addr) | |
2738 | if (!test_bit(slab_index(p, s, addr), map)) | |
2739 | if (!check_object(s, page, p, 1)) | |
2740 | return 0; | |
2741 | return 1; | |
2742 | } | |
2743 | ||
2744 | static void validate_slab_slab(struct kmem_cache *s, struct page *page) | |
2745 | { | |
2746 | if (slab_trylock(page)) { | |
2747 | validate_slab(s, page); | |
2748 | slab_unlock(page); | |
2749 | } else | |
2750 | printk(KERN_INFO "SLUB %s: Skipped busy slab 0x%p\n", | |
2751 | s->name, page); | |
2752 | ||
2753 | if (s->flags & DEBUG_DEFAULT_FLAGS) { | |
2754 | if (!SlabDebug(page)) | |
2755 | printk(KERN_ERR "SLUB %s: SlabDebug not set " | |
2756 | "on slab 0x%p\n", s->name, page); | |
2757 | } else { | |
2758 | if (SlabDebug(page)) | |
2759 | printk(KERN_ERR "SLUB %s: SlabDebug set on " | |
2760 | "slab 0x%p\n", s->name, page); | |
2761 | } | |
2762 | } | |
2763 | ||
2764 | static int validate_slab_node(struct kmem_cache *s, struct kmem_cache_node *n) | |
2765 | { | |
2766 | unsigned long count = 0; | |
2767 | struct page *page; | |
2768 | unsigned long flags; | |
2769 | ||
2770 | spin_lock_irqsave(&n->list_lock, flags); | |
2771 | ||
2772 | list_for_each_entry(page, &n->partial, lru) { | |
2773 | validate_slab_slab(s, page); | |
2774 | count++; | |
2775 | } | |
2776 | if (count != n->nr_partial) | |
2777 | printk(KERN_ERR "SLUB %s: %ld partial slabs counted but " | |
2778 | "counter=%ld\n", s->name, count, n->nr_partial); | |
2779 | ||
2780 | if (!(s->flags & SLAB_STORE_USER)) | |
2781 | goto out; | |
2782 | ||
2783 | list_for_each_entry(page, &n->full, lru) { | |
2784 | validate_slab_slab(s, page); | |
2785 | count++; | |
2786 | } | |
2787 | if (count != atomic_long_read(&n->nr_slabs)) | |
2788 | printk(KERN_ERR "SLUB: %s %ld slabs counted but " | |
2789 | "counter=%ld\n", s->name, count, | |
2790 | atomic_long_read(&n->nr_slabs)); | |
2791 | ||
2792 | out: | |
2793 | spin_unlock_irqrestore(&n->list_lock, flags); | |
2794 | return count; | |
2795 | } | |
2796 | ||
2797 | static unsigned long validate_slab_cache(struct kmem_cache *s) | |
2798 | { | |
2799 | int node; | |
2800 | unsigned long count = 0; | |
2801 | ||
2802 | flush_all(s); | |
2803 | for_each_online_node(node) { | |
2804 | struct kmem_cache_node *n = get_node(s, node); | |
2805 | ||
2806 | count += validate_slab_node(s, n); | |
2807 | } | |
2808 | return count; | |
2809 | } | |
2810 | ||
2811 | #ifdef SLUB_RESILIENCY_TEST | |
2812 | static void resiliency_test(void) | |
2813 | { | |
2814 | u8 *p; | |
2815 | ||
2816 | printk(KERN_ERR "SLUB resiliency testing\n"); | |
2817 | printk(KERN_ERR "-----------------------\n"); | |
2818 | printk(KERN_ERR "A. Corruption after allocation\n"); | |
2819 | ||
2820 | p = kzalloc(16, GFP_KERNEL); | |
2821 | p[16] = 0x12; | |
2822 | printk(KERN_ERR "\n1. kmalloc-16: Clobber Redzone/next pointer" | |
2823 | " 0x12->0x%p\n\n", p + 16); | |
2824 | ||
2825 | validate_slab_cache(kmalloc_caches + 4); | |
2826 | ||
2827 | /* Hmmm... The next two are dangerous */ | |
2828 | p = kzalloc(32, GFP_KERNEL); | |
2829 | p[32 + sizeof(void *)] = 0x34; | |
2830 | printk(KERN_ERR "\n2. kmalloc-32: Clobber next pointer/next slab" | |
2831 | " 0x34 -> -0x%p\n", p); | |
2832 | printk(KERN_ERR "If allocated object is overwritten then not detectable\n\n"); | |
2833 | ||
2834 | validate_slab_cache(kmalloc_caches + 5); | |
2835 | p = kzalloc(64, GFP_KERNEL); | |
2836 | p += 64 + (get_cycles() & 0xff) * sizeof(void *); | |
2837 | *p = 0x56; | |
2838 | printk(KERN_ERR "\n3. kmalloc-64: corrupting random byte 0x56->0x%p\n", | |
2839 | p); | |
2840 | printk(KERN_ERR "If allocated object is overwritten then not detectable\n\n"); | |
2841 | validate_slab_cache(kmalloc_caches + 6); | |
2842 | ||
2843 | printk(KERN_ERR "\nB. Corruption after free\n"); | |
2844 | p = kzalloc(128, GFP_KERNEL); | |
2845 | kfree(p); | |
2846 | *p = 0x78; | |
2847 | printk(KERN_ERR "1. kmalloc-128: Clobber first word 0x78->0x%p\n\n", p); | |
2848 | validate_slab_cache(kmalloc_caches + 7); | |
2849 | ||
2850 | p = kzalloc(256, GFP_KERNEL); | |
2851 | kfree(p); | |
2852 | p[50] = 0x9a; | |
2853 | printk(KERN_ERR "\n2. kmalloc-256: Clobber 50th byte 0x9a->0x%p\n\n", p); | |
2854 | validate_slab_cache(kmalloc_caches + 8); | |
2855 | ||
2856 | p = kzalloc(512, GFP_KERNEL); | |
2857 | kfree(p); | |
2858 | p[512] = 0xab; | |
2859 | printk(KERN_ERR "\n3. kmalloc-512: Clobber redzone 0xab->0x%p\n\n", p); | |
2860 | validate_slab_cache(kmalloc_caches + 9); | |
2861 | } | |
2862 | #else | |
2863 | static void resiliency_test(void) {}; | |
2864 | #endif | |
2865 | ||
2866 | /* | |
2867 | * Generate lists of code addresses where slabcache objects are allocated | |
2868 | * and freed. | |
2869 | */ | |
2870 | ||
2871 | struct location { | |
2872 | unsigned long count; | |
2873 | void *addr; | |
2874 | long long sum_time; | |
2875 | long min_time; | |
2876 | long max_time; | |
2877 | long min_pid; | |
2878 | long max_pid; | |
2879 | cpumask_t cpus; | |
2880 | nodemask_t nodes; | |
2881 | }; | |
2882 | ||
2883 | struct loc_track { | |
2884 | unsigned long max; | |
2885 | unsigned long count; | |
2886 | struct location *loc; | |
2887 | }; | |
2888 | ||
2889 | static void free_loc_track(struct loc_track *t) | |
2890 | { | |
2891 | if (t->max) | |
2892 | free_pages((unsigned long)t->loc, | |
2893 | get_order(sizeof(struct location) * t->max)); | |
2894 | } | |
2895 | ||
2896 | static int alloc_loc_track(struct loc_track *t, unsigned long max, gfp_t flags) | |
2897 | { | |
2898 | struct location *l; | |
2899 | int order; | |
2900 | ||
2901 | order = get_order(sizeof(struct location) * max); | |
2902 | ||
2903 | l = (void *)__get_free_pages(flags, order); | |
2904 | if (!l) | |
2905 | return 0; | |
2906 | ||
2907 | if (t->count) { | |
2908 | memcpy(l, t->loc, sizeof(struct location) * t->count); | |
2909 | free_loc_track(t); | |
2910 | } | |
2911 | t->max = max; | |
2912 | t->loc = l; | |
2913 | return 1; | |
2914 | } | |
2915 | ||
2916 | static int add_location(struct loc_track *t, struct kmem_cache *s, | |
2917 | const struct track *track) | |
2918 | { | |
2919 | long start, end, pos; | |
2920 | struct location *l; | |
2921 | void *caddr; | |
2922 | unsigned long age = jiffies - track->when; | |
2923 | ||
2924 | start = -1; | |
2925 | end = t->count; | |
2926 | ||
2927 | for ( ; ; ) { | |
2928 | pos = start + (end - start + 1) / 2; | |
2929 | ||
2930 | /* | |
2931 | * There is nothing at "end". If we end up there | |
2932 | * we need to add something to before end. | |
2933 | */ | |
2934 | if (pos == end) | |
2935 | break; | |
2936 | ||
2937 | caddr = t->loc[pos].addr; | |
2938 | if (track->addr == caddr) { | |
2939 | ||
2940 | l = &t->loc[pos]; | |
2941 | l->count++; | |
2942 | if (track->when) { | |
2943 | l->sum_time += age; | |
2944 | if (age < l->min_time) | |
2945 | l->min_time = age; | |
2946 | if (age > l->max_time) | |
2947 | l->max_time = age; | |
2948 | ||
2949 | if (track->pid < l->min_pid) | |
2950 | l->min_pid = track->pid; | |
2951 | if (track->pid > l->max_pid) | |
2952 | l->max_pid = track->pid; | |
2953 | ||
2954 | cpu_set(track->cpu, l->cpus); | |
2955 | } | |
2956 | node_set(page_to_nid(virt_to_page(track)), l->nodes); | |
2957 | return 1; | |
2958 | } | |
2959 | ||
2960 | if (track->addr < caddr) | |
2961 | end = pos; | |
2962 | else | |
2963 | start = pos; | |
2964 | } | |
2965 | ||
2966 | /* | |
2967 | * Not found. Insert new tracking element. | |
2968 | */ | |
2969 | if (t->count >= t->max && !alloc_loc_track(t, 2 * t->max, GFP_ATOMIC)) | |
2970 | return 0; | |
2971 | ||
2972 | l = t->loc + pos; | |
2973 | if (pos < t->count) | |
2974 | memmove(l + 1, l, | |
2975 | (t->count - pos) * sizeof(struct location)); | |
2976 | t->count++; | |
2977 | l->count = 1; | |
2978 | l->addr = track->addr; | |
2979 | l->sum_time = age; | |
2980 | l->min_time = age; | |
2981 | l->max_time = age; | |
2982 | l->min_pid = track->pid; | |
2983 | l->max_pid = track->pid; | |
2984 | cpus_clear(l->cpus); | |
2985 | cpu_set(track->cpu, l->cpus); | |
2986 | nodes_clear(l->nodes); | |
2987 | node_set(page_to_nid(virt_to_page(track)), l->nodes); | |
2988 | return 1; | |
2989 | } | |
2990 | ||
2991 | static void process_slab(struct loc_track *t, struct kmem_cache *s, | |
2992 | struct page *page, enum track_item alloc) | |
2993 | { | |
2994 | void *addr = page_address(page); | |
2995 | DECLARE_BITMAP(map, s->objects); | |
2996 | void *p; | |
2997 | ||
2998 | bitmap_zero(map, s->objects); | |
2999 | for_each_free_object(p, s, page->freelist) | |
3000 | set_bit(slab_index(p, s, addr), map); | |
3001 | ||
3002 | for_each_object(p, s, addr) | |
3003 | if (!test_bit(slab_index(p, s, addr), map)) | |
3004 | add_location(t, s, get_track(s, p, alloc)); | |
3005 | } | |
3006 | ||
3007 | static int list_locations(struct kmem_cache *s, char *buf, | |
3008 | enum track_item alloc) | |
3009 | { | |
3010 | int n = 0; | |
3011 | unsigned long i; | |
3012 | struct loc_track t = { 0, 0, NULL }; | |
3013 | int node; | |
3014 | ||
3015 | if (!alloc_loc_track(&t, PAGE_SIZE / sizeof(struct location), | |
3016 | GFP_KERNEL)) | |
3017 | return sprintf(buf, "Out of memory\n"); | |
3018 | ||
3019 | /* Push back cpu slabs */ | |
3020 | flush_all(s); | |
3021 | ||
3022 | for_each_online_node(node) { | |
3023 | struct kmem_cache_node *n = get_node(s, node); | |
3024 | unsigned long flags; | |
3025 | struct page *page; | |
3026 | ||
3027 | if (!atomic_read(&n->nr_slabs)) | |
3028 | continue; | |
3029 | ||
3030 | spin_lock_irqsave(&n->list_lock, flags); | |
3031 | list_for_each_entry(page, &n->partial, lru) | |
3032 | process_slab(&t, s, page, alloc); | |
3033 | list_for_each_entry(page, &n->full, lru) | |
3034 | process_slab(&t, s, page, alloc); | |
3035 | spin_unlock_irqrestore(&n->list_lock, flags); | |
3036 | } | |
3037 | ||
3038 | for (i = 0; i < t.count; i++) { | |
3039 | struct location *l = &t.loc[i]; | |
3040 | ||
3041 | if (n > PAGE_SIZE - 100) | |
3042 | break; | |
3043 | n += sprintf(buf + n, "%7ld ", l->count); | |
3044 | ||
3045 | if (l->addr) | |
3046 | n += sprint_symbol(buf + n, (unsigned long)l->addr); | |
3047 | else | |
3048 | n += sprintf(buf + n, "<not-available>"); | |
3049 | ||
3050 | if (l->sum_time != l->min_time) { | |
3051 | unsigned long remainder; | |
3052 | ||
3053 | n += sprintf(buf + n, " age=%ld/%ld/%ld", | |
3054 | l->min_time, | |
3055 | div_long_long_rem(l->sum_time, l->count, &remainder), | |
3056 | l->max_time); | |
3057 | } else | |
3058 | n += sprintf(buf + n, " age=%ld", | |
3059 | l->min_time); | |
3060 | ||
3061 | if (l->min_pid != l->max_pid) | |
3062 | n += sprintf(buf + n, " pid=%ld-%ld", | |
3063 | l->min_pid, l->max_pid); | |
3064 | else | |
3065 | n += sprintf(buf + n, " pid=%ld", | |
3066 | l->min_pid); | |
3067 | ||
3068 | if (num_online_cpus() > 1 && !cpus_empty(l->cpus) && | |
3069 | n < PAGE_SIZE - 60) { | |
3070 | n += sprintf(buf + n, " cpus="); | |
3071 | n += cpulist_scnprintf(buf + n, PAGE_SIZE - n - 50, | |
3072 | l->cpus); | |
3073 | } | |
3074 | ||
3075 | if (num_online_nodes() > 1 && !nodes_empty(l->nodes) && | |
3076 | n < PAGE_SIZE - 60) { | |
3077 | n += sprintf(buf + n, " nodes="); | |
3078 | n += nodelist_scnprintf(buf + n, PAGE_SIZE - n - 50, | |
3079 | l->nodes); | |
3080 | } | |
3081 | ||
3082 | n += sprintf(buf + n, "\n"); | |
3083 | } | |
3084 | ||
3085 | free_loc_track(&t); | |
3086 | if (!t.count) | |
3087 | n += sprintf(buf, "No data\n"); | |
3088 | return n; | |
3089 | } | |
3090 | ||
3091 | static unsigned long count_partial(struct kmem_cache_node *n) | |
3092 | { | |
3093 | unsigned long flags; | |
3094 | unsigned long x = 0; | |
3095 | struct page *page; | |
3096 | ||
3097 | spin_lock_irqsave(&n->list_lock, flags); | |
3098 | list_for_each_entry(page, &n->partial, lru) | |
3099 | x += page->inuse; | |
3100 | spin_unlock_irqrestore(&n->list_lock, flags); | |
3101 | return x; | |
3102 | } | |
3103 | ||
3104 | enum slab_stat_type { | |
3105 | SL_FULL, | |
3106 | SL_PARTIAL, | |
3107 | SL_CPU, | |
3108 | SL_OBJECTS | |
3109 | }; | |
3110 | ||
3111 | #define SO_FULL (1 << SL_FULL) | |
3112 | #define SO_PARTIAL (1 << SL_PARTIAL) | |
3113 | #define SO_CPU (1 << SL_CPU) | |
3114 | #define SO_OBJECTS (1 << SL_OBJECTS) | |
3115 | ||
3116 | static unsigned long slab_objects(struct kmem_cache *s, | |
3117 | char *buf, unsigned long flags) | |
3118 | { | |
3119 | unsigned long total = 0; | |
3120 | int cpu; | |
3121 | int node; | |
3122 | int x; | |
3123 | unsigned long *nodes; | |
3124 | unsigned long *per_cpu; | |
3125 | ||
3126 | nodes = kzalloc(2 * sizeof(unsigned long) * nr_node_ids, GFP_KERNEL); | |
3127 | per_cpu = nodes + nr_node_ids; | |
3128 | ||
3129 | for_each_possible_cpu(cpu) { | |
3130 | struct page *page = s->cpu_slab[cpu]; | |
3131 | int node; | |
3132 | ||
3133 | if (page) { | |
3134 | node = page_to_nid(page); | |
3135 | if (flags & SO_CPU) { | |
3136 | int x = 0; | |
3137 | ||
3138 | if (flags & SO_OBJECTS) | |
3139 | x = page->inuse; | |
3140 | else | |
3141 | x = 1; | |
3142 | total += x; | |
3143 | nodes[node] += x; | |
3144 | } | |
3145 | per_cpu[node]++; | |
3146 | } | |
3147 | } | |
3148 | ||
3149 | for_each_online_node(node) { | |
3150 | struct kmem_cache_node *n = get_node(s, node); | |
3151 | ||
3152 | if (flags & SO_PARTIAL) { | |
3153 | if (flags & SO_OBJECTS) | |
3154 | x = count_partial(n); | |
3155 | else | |
3156 | x = n->nr_partial; | |
3157 | total += x; | |
3158 | nodes[node] += x; | |
3159 | } | |
3160 | ||
3161 | if (flags & SO_FULL) { | |
3162 | int full_slabs = atomic_read(&n->nr_slabs) | |
3163 | - per_cpu[node] | |
3164 | - n->nr_partial; | |
3165 | ||
3166 | if (flags & SO_OBJECTS) | |
3167 | x = full_slabs * s->objects; | |
3168 | else | |
3169 | x = full_slabs; | |
3170 | total += x; | |
3171 | nodes[node] += x; | |
3172 | } | |
3173 | } | |
3174 | ||
3175 | x = sprintf(buf, "%lu", total); | |
3176 | #ifdef CONFIG_NUMA | |
3177 | for_each_online_node(node) | |
3178 | if (nodes[node]) | |
3179 | x += sprintf(buf + x, " N%d=%lu", | |
3180 | node, nodes[node]); | |
3181 | #endif | |
3182 | kfree(nodes); | |
3183 | return x + sprintf(buf + x, "\n"); | |
3184 | } | |
3185 | ||
3186 | static int any_slab_objects(struct kmem_cache *s) | |
3187 | { | |
3188 | int node; | |
3189 | int cpu; | |
3190 | ||
3191 | for_each_possible_cpu(cpu) | |
3192 | if (s->cpu_slab[cpu]) | |
3193 | return 1; | |
3194 | ||
3195 | for_each_node(node) { | |
3196 | struct kmem_cache_node *n = get_node(s, node); | |
3197 | ||
3198 | if (n->nr_partial || atomic_read(&n->nr_slabs)) | |
3199 | return 1; | |
3200 | } | |
3201 | return 0; | |
3202 | } | |
3203 | ||
3204 | #define to_slab_attr(n) container_of(n, struct slab_attribute, attr) | |
3205 | #define to_slab(n) container_of(n, struct kmem_cache, kobj); | |
3206 | ||
3207 | struct slab_attribute { | |
3208 | struct attribute attr; | |
3209 | ssize_t (*show)(struct kmem_cache *s, char *buf); | |
3210 | ssize_t (*store)(struct kmem_cache *s, const char *x, size_t count); | |
3211 | }; | |
3212 | ||
3213 | #define SLAB_ATTR_RO(_name) \ | |
3214 | static struct slab_attribute _name##_attr = __ATTR_RO(_name) | |
3215 | ||
3216 | #define SLAB_ATTR(_name) \ | |
3217 | static struct slab_attribute _name##_attr = \ | |
3218 | __ATTR(_name, 0644, _name##_show, _name##_store) | |
3219 | ||
3220 | static ssize_t slab_size_show(struct kmem_cache *s, char *buf) | |
3221 | { | |
3222 | return sprintf(buf, "%d\n", s->size); | |
3223 | } | |
3224 | SLAB_ATTR_RO(slab_size); | |
3225 | ||
3226 | static ssize_t align_show(struct kmem_cache *s, char *buf) | |
3227 | { | |
3228 | return sprintf(buf, "%d\n", s->align); | |
3229 | } | |
3230 | SLAB_ATTR_RO(align); | |
3231 | ||
3232 | static ssize_t object_size_show(struct kmem_cache *s, char *buf) | |
3233 | { | |
3234 | return sprintf(buf, "%d\n", s->objsize); | |
3235 | } | |
3236 | SLAB_ATTR_RO(object_size); | |
3237 | ||
3238 | static ssize_t objs_per_slab_show(struct kmem_cache *s, char *buf) | |
3239 | { | |
3240 | return sprintf(buf, "%d\n", s->objects); | |
3241 | } | |
3242 | SLAB_ATTR_RO(objs_per_slab); | |
3243 | ||
3244 | static ssize_t order_show(struct kmem_cache *s, char *buf) | |
3245 | { | |
3246 | return sprintf(buf, "%d\n", s->order); | |
3247 | } | |
3248 | SLAB_ATTR_RO(order); | |
3249 | ||
3250 | static ssize_t ctor_show(struct kmem_cache *s, char *buf) | |
3251 | { | |
3252 | if (s->ctor) { | |
3253 | int n = sprint_symbol(buf, (unsigned long)s->ctor); | |
3254 | ||
3255 | return n + sprintf(buf + n, "\n"); | |
3256 | } | |
3257 | return 0; | |
3258 | } | |
3259 | SLAB_ATTR_RO(ctor); | |
3260 | ||
3261 | static ssize_t aliases_show(struct kmem_cache *s, char *buf) | |
3262 | { | |
3263 | return sprintf(buf, "%d\n", s->refcount - 1); | |
3264 | } | |
3265 | SLAB_ATTR_RO(aliases); | |
3266 | ||
3267 | static ssize_t slabs_show(struct kmem_cache *s, char *buf) | |
3268 | { | |
3269 | return slab_objects(s, buf, SO_FULL|SO_PARTIAL|SO_CPU); | |
3270 | } | |
3271 | SLAB_ATTR_RO(slabs); | |
3272 | ||
3273 | static ssize_t partial_show(struct kmem_cache *s, char *buf) | |
3274 | { | |
3275 | return slab_objects(s, buf, SO_PARTIAL); | |
3276 | } | |
3277 | SLAB_ATTR_RO(partial); | |
3278 | ||
3279 | static ssize_t cpu_slabs_show(struct kmem_cache *s, char *buf) | |
3280 | { | |
3281 | return slab_objects(s, buf, SO_CPU); | |
3282 | } | |
3283 | SLAB_ATTR_RO(cpu_slabs); | |
3284 | ||
3285 | static ssize_t objects_show(struct kmem_cache *s, char *buf) | |
3286 | { | |
3287 | return slab_objects(s, buf, SO_FULL|SO_PARTIAL|SO_CPU|SO_OBJECTS); | |
3288 | } | |
3289 | SLAB_ATTR_RO(objects); | |
3290 | ||
3291 | static ssize_t sanity_checks_show(struct kmem_cache *s, char *buf) | |
3292 | { | |
3293 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_DEBUG_FREE)); | |
3294 | } | |
3295 | ||
3296 | static ssize_t sanity_checks_store(struct kmem_cache *s, | |
3297 | const char *buf, size_t length) | |
3298 | { | |
3299 | s->flags &= ~SLAB_DEBUG_FREE; | |
3300 | if (buf[0] == '1') | |
3301 | s->flags |= SLAB_DEBUG_FREE; | |
3302 | return length; | |
3303 | } | |
3304 | SLAB_ATTR(sanity_checks); | |
3305 | ||
3306 | static ssize_t trace_show(struct kmem_cache *s, char *buf) | |
3307 | { | |
3308 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_TRACE)); | |
3309 | } | |
3310 | ||
3311 | static ssize_t trace_store(struct kmem_cache *s, const char *buf, | |
3312 | size_t length) | |
3313 | { | |
3314 | s->flags &= ~SLAB_TRACE; | |
3315 | if (buf[0] == '1') | |
3316 | s->flags |= SLAB_TRACE; | |
3317 | return length; | |
3318 | } | |
3319 | SLAB_ATTR(trace); | |
3320 | ||
3321 | static ssize_t reclaim_account_show(struct kmem_cache *s, char *buf) | |
3322 | { | |
3323 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_RECLAIM_ACCOUNT)); | |
3324 | } | |
3325 | ||
3326 | static ssize_t reclaim_account_store(struct kmem_cache *s, | |
3327 | const char *buf, size_t length) | |
3328 | { | |
3329 | s->flags &= ~SLAB_RECLAIM_ACCOUNT; | |
3330 | if (buf[0] == '1') | |
3331 | s->flags |= SLAB_RECLAIM_ACCOUNT; | |
3332 | return length; | |
3333 | } | |
3334 | SLAB_ATTR(reclaim_account); | |
3335 | ||
3336 | static ssize_t hwcache_align_show(struct kmem_cache *s, char *buf) | |
3337 | { | |
3338 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_HWCACHE_ALIGN)); | |
3339 | } | |
3340 | SLAB_ATTR_RO(hwcache_align); | |
3341 | ||
3342 | #ifdef CONFIG_ZONE_DMA | |
3343 | static ssize_t cache_dma_show(struct kmem_cache *s, char *buf) | |
3344 | { | |
3345 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_CACHE_DMA)); | |
3346 | } | |
3347 | SLAB_ATTR_RO(cache_dma); | |
3348 | #endif | |
3349 | ||
3350 | static ssize_t destroy_by_rcu_show(struct kmem_cache *s, char *buf) | |
3351 | { | |
3352 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_DESTROY_BY_RCU)); | |
3353 | } | |
3354 | SLAB_ATTR_RO(destroy_by_rcu); | |
3355 | ||
3356 | static ssize_t red_zone_show(struct kmem_cache *s, char *buf) | |
3357 | { | |
3358 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_RED_ZONE)); | |
3359 | } | |
3360 | ||
3361 | static ssize_t red_zone_store(struct kmem_cache *s, | |
3362 | const char *buf, size_t length) | |
3363 | { | |
3364 | if (any_slab_objects(s)) | |
3365 | return -EBUSY; | |
3366 | ||
3367 | s->flags &= ~SLAB_RED_ZONE; | |
3368 | if (buf[0] == '1') | |
3369 | s->flags |= SLAB_RED_ZONE; | |
3370 | calculate_sizes(s); | |
3371 | return length; | |
3372 | } | |
3373 | SLAB_ATTR(red_zone); | |
3374 | ||
3375 | static ssize_t poison_show(struct kmem_cache *s, char *buf) | |
3376 | { | |
3377 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_POISON)); | |
3378 | } | |
3379 | ||
3380 | static ssize_t poison_store(struct kmem_cache *s, | |
3381 | const char *buf, size_t length) | |
3382 | { | |
3383 | if (any_slab_objects(s)) | |
3384 | return -EBUSY; | |
3385 | ||
3386 | s->flags &= ~SLAB_POISON; | |
3387 | if (buf[0] == '1') | |
3388 | s->flags |= SLAB_POISON; | |
3389 | calculate_sizes(s); | |
3390 | return length; | |
3391 | } | |
3392 | SLAB_ATTR(poison); | |
3393 | ||
3394 | static ssize_t store_user_show(struct kmem_cache *s, char *buf) | |
3395 | { | |
3396 | return sprintf(buf, "%d\n", !!(s->flags & SLAB_STORE_USER)); | |
3397 | } | |
3398 | ||
3399 | static ssize_t store_user_store(struct kmem_cache *s, | |
3400 | const char *buf, size_t length) | |
3401 | { | |
3402 | if (any_slab_objects(s)) | |
3403 | return -EBUSY; | |
3404 | ||
3405 | s->flags &= ~SLAB_STORE_USER; | |
3406 | if (buf[0] == '1') | |
3407 | s->flags |= SLAB_STORE_USER; | |
3408 | calculate_sizes(s); | |
3409 | return length; | |
3410 | } | |
3411 | SLAB_ATTR(store_user); | |
3412 | ||
3413 | static ssize_t validate_show(struct kmem_cache *s, char *buf) | |
3414 | { | |
3415 | return 0; | |
3416 | } | |
3417 | ||
3418 | static ssize_t validate_store(struct kmem_cache *s, | |
3419 | const char *buf, size_t length) | |
3420 | { | |
3421 | if (buf[0] == '1') | |
3422 | validate_slab_cache(s); | |
3423 | else | |
3424 | return -EINVAL; | |
3425 | return length; | |
3426 | } | |
3427 | SLAB_ATTR(validate); | |
3428 | ||
3429 | static ssize_t shrink_show(struct kmem_cache *s, char *buf) | |
3430 | { | |
3431 | return 0; | |
3432 | } | |
3433 | ||
3434 | static ssize_t shrink_store(struct kmem_cache *s, | |
3435 | const char *buf, size_t length) | |
3436 | { | |
3437 | if (buf[0] == '1') { | |
3438 | int rc = kmem_cache_shrink(s); | |
3439 | ||
3440 | if (rc) | |
3441 | return rc; | |
3442 | } else | |
3443 | return -EINVAL; | |
3444 | return length; | |
3445 | } | |
3446 | SLAB_ATTR(shrink); | |
3447 | ||
3448 | static ssize_t alloc_calls_show(struct kmem_cache *s, char *buf) | |
3449 | { | |
3450 | if (!(s->flags & SLAB_STORE_USER)) | |
3451 | return -ENOSYS; | |
3452 | return list_locations(s, buf, TRACK_ALLOC); | |
3453 | } | |
3454 | SLAB_ATTR_RO(alloc_calls); | |
3455 | ||
3456 | static ssize_t free_calls_show(struct kmem_cache *s, char *buf) | |
3457 | { | |
3458 | if (!(s->flags & SLAB_STORE_USER)) | |
3459 | return -ENOSYS; | |
3460 | return list_locations(s, buf, TRACK_FREE); | |
3461 | } | |
3462 | SLAB_ATTR_RO(free_calls); | |
3463 | ||
3464 | #ifdef CONFIG_NUMA | |
3465 | static ssize_t defrag_ratio_show(struct kmem_cache *s, char *buf) | |
3466 | { | |
3467 | return sprintf(buf, "%d\n", s->defrag_ratio / 10); | |
3468 | } | |
3469 | ||
3470 | static ssize_t defrag_ratio_store(struct kmem_cache *s, | |
3471 | const char *buf, size_t length) | |
3472 | { | |
3473 | int n = simple_strtoul(buf, NULL, 10); | |
3474 | ||
3475 | if (n < 100) | |
3476 | s->defrag_ratio = n * 10; | |
3477 | return length; | |
3478 | } | |
3479 | SLAB_ATTR(defrag_ratio); | |
3480 | #endif | |
3481 | ||
3482 | static struct attribute * slab_attrs[] = { | |
3483 | &slab_size_attr.attr, | |
3484 | &object_size_attr.attr, | |
3485 | &objs_per_slab_attr.attr, | |
3486 | &order_attr.attr, | |
3487 | &objects_attr.attr, | |
3488 | &slabs_attr.attr, | |
3489 | &partial_attr.attr, | |
3490 | &cpu_slabs_attr.attr, | |
3491 | &ctor_attr.attr, | |
3492 | &aliases_attr.attr, | |
3493 | &align_attr.attr, | |
3494 | &sanity_checks_attr.attr, | |
3495 | &trace_attr.attr, | |
3496 | &hwcache_align_attr.attr, | |
3497 | &reclaim_account_attr.attr, | |
3498 | &destroy_by_rcu_attr.attr, | |
3499 | &red_zone_attr.attr, | |
3500 | &poison_attr.attr, | |
3501 | &store_user_attr.attr, | |
3502 | &validate_attr.attr, | |
3503 | &shrink_attr.attr, | |
3504 | &alloc_calls_attr.attr, | |
3505 | &free_calls_attr.attr, | |
3506 | #ifdef CONFIG_ZONE_DMA | |
3507 | &cache_dma_attr.attr, | |
3508 | #endif | |
3509 | #ifdef CONFIG_NUMA | |
3510 | &defrag_ratio_attr.attr, | |
3511 | #endif | |
3512 | NULL | |
3513 | }; | |
3514 | ||
3515 | static struct attribute_group slab_attr_group = { | |
3516 | .attrs = slab_attrs, | |
3517 | }; | |
3518 | ||
3519 | static ssize_t slab_attr_show(struct kobject *kobj, | |
3520 | struct attribute *attr, | |
3521 | char *buf) | |
3522 | { | |
3523 | struct slab_attribute *attribute; | |
3524 | struct kmem_cache *s; | |
3525 | int err; | |
3526 | ||
3527 | attribute = to_slab_attr(attr); | |
3528 | s = to_slab(kobj); | |
3529 | ||
3530 | if (!attribute->show) | |
3531 | return -EIO; | |
3532 | ||
3533 | err = attribute->show(s, buf); | |
3534 | ||
3535 | return err; | |
3536 | } | |
3537 | ||
3538 | static ssize_t slab_attr_store(struct kobject *kobj, | |
3539 | struct attribute *attr, | |
3540 | const char *buf, size_t len) | |
3541 | { | |
3542 | struct slab_attribute *attribute; | |
3543 | struct kmem_cache *s; | |
3544 | int err; | |
3545 | ||
3546 | attribute = to_slab_attr(attr); | |
3547 | s = to_slab(kobj); | |
3548 | ||
3549 | if (!attribute->store) | |
3550 | return -EIO; | |
3551 | ||
3552 | err = attribute->store(s, buf, len); | |
3553 | ||
3554 | return err; | |
3555 | } | |
3556 | ||
3557 | static struct sysfs_ops slab_sysfs_ops = { | |
3558 | .show = slab_attr_show, | |
3559 | .store = slab_attr_store, | |
3560 | }; | |
3561 | ||
3562 | static struct kobj_type slab_ktype = { | |
3563 | .sysfs_ops = &slab_sysfs_ops, | |
3564 | }; | |
3565 | ||
3566 | static int uevent_filter(struct kset *kset, struct kobject *kobj) | |
3567 | { | |
3568 | struct kobj_type *ktype = get_ktype(kobj); | |
3569 | ||
3570 | if (ktype == &slab_ktype) | |
3571 | return 1; | |
3572 | return 0; | |
3573 | } | |
3574 | ||
3575 | static struct kset_uevent_ops slab_uevent_ops = { | |
3576 | .filter = uevent_filter, | |
3577 | }; | |
3578 | ||
3579 | decl_subsys(slab, &slab_ktype, &slab_uevent_ops); | |
3580 | ||
3581 | #define ID_STR_LENGTH 64 | |
3582 | ||
3583 | /* Create a unique string id for a slab cache: | |
3584 | * format | |
3585 | * :[flags-]size:[memory address of kmemcache] | |
3586 | */ | |
3587 | static char *create_unique_id(struct kmem_cache *s) | |
3588 | { | |
3589 | char *name = kmalloc(ID_STR_LENGTH, GFP_KERNEL); | |
3590 | char *p = name; | |
3591 | ||
3592 | BUG_ON(!name); | |
3593 | ||
3594 | *p++ = ':'; | |
3595 | /* | |
3596 | * First flags affecting slabcache operations. We will only | |
3597 | * get here for aliasable slabs so we do not need to support | |
3598 | * too many flags. The flags here must cover all flags that | |
3599 | * are matched during merging to guarantee that the id is | |
3600 | * unique. | |
3601 | */ | |
3602 | if (s->flags & SLAB_CACHE_DMA) | |
3603 | *p++ = 'd'; | |
3604 | if (s->flags & SLAB_RECLAIM_ACCOUNT) | |
3605 | *p++ = 'a'; | |
3606 | if (s->flags & SLAB_DEBUG_FREE) | |
3607 | *p++ = 'F'; | |
3608 | if (p != name + 1) | |
3609 | *p++ = '-'; | |
3610 | p += sprintf(p, "%07d", s->size); | |
3611 | BUG_ON(p > name + ID_STR_LENGTH - 1); | |
3612 | return name; | |
3613 | } | |
3614 | ||
3615 | static int sysfs_slab_add(struct kmem_cache *s) | |
3616 | { | |
3617 | int err; | |
3618 | const char *name; | |
3619 | int unmergeable; | |
3620 | ||
3621 | if (slab_state < SYSFS) | |
3622 | /* Defer until later */ | |
3623 | return 0; | |
3624 | ||
3625 | unmergeable = slab_unmergeable(s); | |
3626 | if (unmergeable) { | |
3627 | /* | |
3628 | * Slabcache can never be merged so we can use the name proper. | |
3629 | * This is typically the case for debug situations. In that | |
3630 | * case we can catch duplicate names easily. | |
3631 | */ | |
3632 | sysfs_remove_link(&slab_subsys.kobj, s->name); | |
3633 | name = s->name; | |
3634 | } else { | |
3635 | /* | |
3636 | * Create a unique name for the slab as a target | |
3637 | * for the symlinks. | |
3638 | */ | |
3639 | name = create_unique_id(s); | |
3640 | } | |
3641 | ||
3642 | kobj_set_kset_s(s, slab_subsys); | |
3643 | kobject_set_name(&s->kobj, name); | |
3644 | kobject_init(&s->kobj); | |
3645 | err = kobject_add(&s->kobj); | |
3646 | if (err) | |
3647 | return err; | |
3648 | ||
3649 | err = sysfs_create_group(&s->kobj, &slab_attr_group); | |
3650 | if (err) | |
3651 | return err; | |
3652 | kobject_uevent(&s->kobj, KOBJ_ADD); | |
3653 | if (!unmergeable) { | |
3654 | /* Setup first alias */ | |
3655 | sysfs_slab_alias(s, s->name); | |
3656 | kfree(name); | |
3657 | } | |
3658 | return 0; | |
3659 | } | |
3660 | ||
3661 | static void sysfs_slab_remove(struct kmem_cache *s) | |
3662 | { | |
3663 | kobject_uevent(&s->kobj, KOBJ_REMOVE); | |
3664 | kobject_del(&s->kobj); | |
3665 | } | |
3666 | ||
3667 | /* | |
3668 | * Need to buffer aliases during bootup until sysfs becomes | |
3669 | * available lest we loose that information. | |
3670 | */ | |
3671 | struct saved_alias { | |
3672 | struct kmem_cache *s; | |
3673 | const char *name; | |
3674 | struct saved_alias *next; | |
3675 | }; | |
3676 | ||
3677 | struct saved_alias *alias_list; | |
3678 | ||
3679 | static int sysfs_slab_alias(struct kmem_cache *s, const char *name) | |
3680 | { | |
3681 | struct saved_alias *al; | |
3682 | ||
3683 | if (slab_state == SYSFS) { | |
3684 | /* | |
3685 | * If we have a leftover link then remove it. | |
3686 | */ | |
3687 | sysfs_remove_link(&slab_subsys.kobj, name); | |
3688 | return sysfs_create_link(&slab_subsys.kobj, | |
3689 | &s->kobj, name); | |
3690 | } | |
3691 | ||
3692 | al = kmalloc(sizeof(struct saved_alias), GFP_KERNEL); | |
3693 | if (!al) | |
3694 | return -ENOMEM; | |
3695 | ||
3696 | al->s = s; | |
3697 | al->name = name; | |
3698 | al->next = alias_list; | |
3699 | alias_list = al; | |
3700 | return 0; | |
3701 | } | |
3702 | ||
3703 | static int __init slab_sysfs_init(void) | |
3704 | { | |
3705 | struct kmem_cache *s; | |
3706 | int err; | |
3707 | ||
3708 | err = subsystem_register(&slab_subsys); | |
3709 | if (err) { | |
3710 | printk(KERN_ERR "Cannot register slab subsystem.\n"); | |
3711 | return -ENOSYS; | |
3712 | } | |
3713 | ||
3714 | slab_state = SYSFS; | |
3715 | ||
3716 | list_for_each_entry(s, &slab_caches, list) { | |
3717 | err = sysfs_slab_add(s); | |
3718 | BUG_ON(err); | |
3719 | } | |
3720 | ||
3721 | while (alias_list) { | |
3722 | struct saved_alias *al = alias_list; | |
3723 | ||
3724 | alias_list = alias_list->next; | |
3725 | err = sysfs_slab_alias(al->s, al->name); | |
3726 | BUG_ON(err); | |
3727 | kfree(al); | |
3728 | } | |
3729 | ||
3730 | resiliency_test(); | |
3731 | return 0; | |
3732 | } | |
3733 | ||
3734 | __initcall(slab_sysfs_init); | |
3735 | #endif |