blob: 315c392253c73a49212d9bf3511c08624de76099 [file] [log] [blame]
Christoph Lameter81819f02007-05-06 14:49:36 -07001/*
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 *
Christoph Lametercde53532008-07-04 09:59:22 -07008 * (C) 2007 SGI, Christoph Lameter
Christoph Lameter81819f02007-05-06 14:49:36 -07009 */
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>
Thomas Gleixner3ac7fe52008-04-30 00:55:01 -070022#include <linux/debugobjects.h>
Christoph Lameter81819f02007-05-06 14:49:36 -070023#include <linux/kallsyms.h>
Yasunori Gotob9049e22007-10-21 16:41:37 -070024#include <linux/memory.h>
Roman Zippelf8bd2252008-05-01 04:34:31 -070025#include <linux/math64.h>
Christoph Lameter81819f02007-05-06 14:49:36 -070026
27/*
28 * Lock order:
29 * 1. slab_lock(page)
30 * 2. slab->list_lock
31 *
32 * The slab_lock protects operations on the object of a particular
33 * slab and its metadata in the page struct. If the slab lock
34 * has been taken then no allocations nor frees can be performed
35 * on the objects in the slab nor can the slab be added or removed
36 * from the partial or full lists since this would mean modifying
37 * the page_struct of the slab.
38 *
39 * The list_lock protects the partial and full list on each node and
40 * the partial slab counter. If taken then no new slabs may be added or
41 * removed from the lists nor make the number of partial slabs be modified.
42 * (Note that the total number of slabs is an atomic value that may be
43 * modified without taking the list lock).
44 *
45 * The list_lock is a centralized lock and thus we avoid taking it as
46 * much as possible. As long as SLUB does not have to handle partial
47 * slabs, operations can continue without any centralized lock. F.e.
48 * allocating a long series of objects that fill up slabs does not require
49 * the list lock.
50 *
51 * The lock order is sometimes inverted when we are trying to get a slab
52 * off a list. We take the list_lock and then look for a page on the list
53 * to use. While we do that objects in the slabs may be freed. We can
54 * only operate on the slab if we have also taken the slab_lock. So we use
55 * a slab_trylock() on the slab. If trylock was successful then no frees
56 * can occur anymore and we can use the slab for allocations etc. If the
57 * slab_trylock() does not succeed then frees are in progress in the slab and
58 * we must stay away from it for a while since we may cause a bouncing
59 * cacheline if we try to acquire the lock. So go onto the next slab.
60 * If all pages are busy then we may allocate a new slab instead of reusing
61 * a partial slab. A new slab has noone operating on it and thus there is
62 * no danger of cacheline contention.
63 *
64 * Interrupts are disabled during allocation and deallocation in order to
65 * make the slab allocator safe to use in the context of an irq. In addition
66 * interrupts are disabled to ensure that the processor does not change
67 * while handling per_cpu slabs, due to kernel preemption.
68 *
69 * SLUB assigns one slab for allocation to each processor.
70 * Allocations only occur from these slabs called cpu slabs.
71 *
Christoph Lameter672bba32007-05-09 02:32:39 -070072 * Slabs with free elements are kept on a partial list and during regular
73 * operations no list for full slabs is used. If an object in a full slab is
Christoph Lameter81819f02007-05-06 14:49:36 -070074 * freed then the slab will show up again on the partial lists.
Christoph Lameter672bba32007-05-09 02:32:39 -070075 * We track full slabs for debugging purposes though because otherwise we
76 * cannot scan all objects.
Christoph Lameter81819f02007-05-06 14:49:36 -070077 *
78 * Slabs are freed when they become empty. Teardown and setup is
79 * minimal so we rely on the page allocators per cpu caches for
80 * fast frees and allocs.
81 *
82 * Overloading of page flags that are otherwise used for LRU management.
83 *
Christoph Lameter4b6f0752007-05-16 22:10:53 -070084 * PageActive The slab is frozen and exempt from list processing.
85 * This means that the slab is dedicated to a purpose
86 * such as satisfying allocations for a specific
87 * processor. Objects may be freed in the slab while
88 * it is frozen but slab_free will then skip the usual
89 * list operations. It is up to the processor holding
90 * the slab to integrate the slab into the slab lists
91 * when the slab is no longer needed.
92 *
93 * One use of this flag is to mark slabs that are
94 * used for allocations. Then such a slab becomes a cpu
95 * slab. The cpu slab may be equipped with an additional
Christoph Lameterdfb4f092007-10-16 01:26:05 -070096 * freelist that allows lockless access to
Christoph Lameter894b8782007-05-10 03:15:16 -070097 * free objects in addition to the regular freelist
98 * that requires the slab lock.
Christoph Lameter81819f02007-05-06 14:49:36 -070099 *
100 * PageError Slab requires special handling due to debug
101 * options set. This moves slab handling out of
Christoph Lameter894b8782007-05-10 03:15:16 -0700102 * the fast path and disables lockless freelists.
Christoph Lameter81819f02007-05-06 14:49:36 -0700103 */
104
Christoph Lameter5577bd82007-05-16 22:10:56 -0700105#define FROZEN (1 << PG_active)
106
107#ifdef CONFIG_SLUB_DEBUG
108#define SLABDEBUG (1 << PG_error)
109#else
110#define SLABDEBUG 0
111#endif
112
Christoph Lameter4b6f0752007-05-16 22:10:53 -0700113static inline int SlabFrozen(struct page *page)
114{
Christoph Lameter5577bd82007-05-16 22:10:56 -0700115 return page->flags & FROZEN;
Christoph Lameter4b6f0752007-05-16 22:10:53 -0700116}
117
118static inline void SetSlabFrozen(struct page *page)
119{
Christoph Lameter5577bd82007-05-16 22:10:56 -0700120 page->flags |= FROZEN;
Christoph Lameter4b6f0752007-05-16 22:10:53 -0700121}
122
123static inline void ClearSlabFrozen(struct page *page)
124{
Christoph Lameter5577bd82007-05-16 22:10:56 -0700125 page->flags &= ~FROZEN;
Christoph Lameter4b6f0752007-05-16 22:10:53 -0700126}
127
Christoph Lameter35e5d7e2007-05-09 02:32:42 -0700128static inline int SlabDebug(struct page *page)
129{
Christoph Lameter5577bd82007-05-16 22:10:56 -0700130 return page->flags & SLABDEBUG;
Christoph Lameter35e5d7e2007-05-09 02:32:42 -0700131}
132
133static inline void SetSlabDebug(struct page *page)
134{
Christoph Lameter5577bd82007-05-16 22:10:56 -0700135 page->flags |= SLABDEBUG;
Christoph Lameter35e5d7e2007-05-09 02:32:42 -0700136}
137
138static inline void ClearSlabDebug(struct page *page)
139{
Christoph Lameter5577bd82007-05-16 22:10:56 -0700140 page->flags &= ~SLABDEBUG;
Christoph Lameter35e5d7e2007-05-09 02:32:42 -0700141}
142
Christoph Lameter81819f02007-05-06 14:49:36 -0700143/*
144 * Issues still to be resolved:
145 *
Christoph Lameter81819f02007-05-06 14:49:36 -0700146 * - Support PAGE_ALLOC_DEBUG. Should be easy to do.
147 *
Christoph Lameter81819f02007-05-06 14:49:36 -0700148 * - Variable sizing of the per node arrays
149 */
150
151/* Enable to test recovery from slab corruption on boot */
152#undef SLUB_RESILIENCY_TEST
153
Christoph Lameter81819f02007-05-06 14:49:36 -0700154/*
Christoph Lameter2086d262007-05-06 14:49:46 -0700155 * Mininum number of partial slabs. These will be left on the partial
156 * lists even if they are empty. kmem_cache_shrink may reclaim them.
157 */
Christoph Lameter76be8952007-12-21 14:37:37 -0800158#define MIN_PARTIAL 5
Christoph Lametere95eed52007-05-06 14:49:44 -0700159
Christoph Lameter2086d262007-05-06 14:49:46 -0700160/*
161 * Maximum number of desirable partial slabs.
162 * The existence of more partial slabs makes kmem_cache_shrink
163 * sort the partial list by the number of objects in the.
164 */
165#define MAX_PARTIAL 10
166
Christoph Lameter81819f02007-05-06 14:49:36 -0700167#define DEBUG_DEFAULT_FLAGS (SLAB_DEBUG_FREE | SLAB_RED_ZONE | \
168 SLAB_POISON | SLAB_STORE_USER)
Christoph Lameter672bba32007-05-09 02:32:39 -0700169
Christoph Lameter81819f02007-05-06 14:49:36 -0700170/*
171 * Set of flags that will prevent slab merging
172 */
173#define SLUB_NEVER_MERGE (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER | \
174 SLAB_TRACE | SLAB_DESTROY_BY_RCU)
175
176#define SLUB_MERGE_SAME (SLAB_DEBUG_FREE | SLAB_RECLAIM_ACCOUNT | \
177 SLAB_CACHE_DMA)
178
179#ifndef ARCH_KMALLOC_MINALIGN
Christoph Lameter47bfdc02007-05-06 14:49:37 -0700180#define ARCH_KMALLOC_MINALIGN __alignof__(unsigned long long)
Christoph Lameter81819f02007-05-06 14:49:36 -0700181#endif
182
183#ifndef ARCH_SLAB_MINALIGN
Christoph Lameter47bfdc02007-05-06 14:49:37 -0700184#define ARCH_SLAB_MINALIGN __alignof__(unsigned long long)
Christoph Lameter81819f02007-05-06 14:49:36 -0700185#endif
186
187/* Internal SLUB flags */
Christoph Lameter1ceef402007-08-07 15:11:48 -0700188#define __OBJECT_POISON 0x80000000 /* Poison object */
189#define __SYSFS_ADD_DEFERRED 0x40000000 /* Not yet visible via sysfs */
Christoph Lameter81819f02007-05-06 14:49:36 -0700190
191static int kmem_size = sizeof(struct kmem_cache);
192
193#ifdef CONFIG_SMP
194static struct notifier_block slab_notifier;
195#endif
196
197static enum {
198 DOWN, /* No slab functionality available */
199 PARTIAL, /* kmem_cache_open() works but kmalloc does not */
Christoph Lameter672bba32007-05-09 02:32:39 -0700200 UP, /* Everything works but does not show up in sysfs */
Christoph Lameter81819f02007-05-06 14:49:36 -0700201 SYSFS /* Sysfs up */
202} slab_state = DOWN;
203
204/* A list of all slab caches on the system */
205static DECLARE_RWSEM(slub_lock);
Adrian Bunk5af328a2007-07-17 04:03:27 -0700206static LIST_HEAD(slab_caches);
Christoph Lameter81819f02007-05-06 14:49:36 -0700207
Christoph Lameter02cbc872007-05-09 02:32:43 -0700208/*
209 * Tracking user of a slab.
210 */
211struct track {
212 void *addr; /* Called from address */
213 int cpu; /* Was running on cpu */
214 int pid; /* Pid context */
215 unsigned long when; /* When did the operation occur */
216};
217
218enum track_item { TRACK_ALLOC, TRACK_FREE };
219
Christoph Lameterf6acb632008-04-29 16:16:06 -0700220#ifdef CONFIG_SLUB_DEBUG
Christoph Lameter81819f02007-05-06 14:49:36 -0700221static int sysfs_slab_add(struct kmem_cache *);
222static int sysfs_slab_alias(struct kmem_cache *, const char *);
223static void sysfs_slab_remove(struct kmem_cache *);
Christoph Lameter8ff12cf2008-02-07 17:47:41 -0800224
Christoph Lameter81819f02007-05-06 14:49:36 -0700225#else
Christoph Lameter0c710012007-07-17 04:03:24 -0700226static inline int sysfs_slab_add(struct kmem_cache *s) { return 0; }
227static inline int sysfs_slab_alias(struct kmem_cache *s, const char *p)
228 { return 0; }
Christoph Lameter151c6022008-01-07 22:29:05 -0800229static inline void sysfs_slab_remove(struct kmem_cache *s)
230{
231 kfree(s);
232}
Christoph Lameter8ff12cf2008-02-07 17:47:41 -0800233
Christoph Lameter81819f02007-05-06 14:49:36 -0700234#endif
235
Christoph Lameter8ff12cf2008-02-07 17:47:41 -0800236static inline void stat(struct kmem_cache_cpu *c, enum stat_item si)
237{
238#ifdef CONFIG_SLUB_STATS
239 c->stat[si]++;
240#endif
241}
242
Christoph Lameter81819f02007-05-06 14:49:36 -0700243/********************************************************************
244 * Core slab cache functions
245 *******************************************************************/
246
247int slab_is_available(void)
248{
249 return slab_state >= UP;
250}
251
252static inline struct kmem_cache_node *get_node(struct kmem_cache *s, int node)
253{
254#ifdef CONFIG_NUMA
255 return s->node[node];
256#else
257 return &s->local_node;
258#endif
259}
260
Christoph Lameterdfb4f092007-10-16 01:26:05 -0700261static inline struct kmem_cache_cpu *get_cpu_slab(struct kmem_cache *s, int cpu)
262{
Christoph Lameter4c93c3552007-10-16 01:26:08 -0700263#ifdef CONFIG_SMP
264 return s->cpu_slab[cpu];
265#else
266 return &s->cpu_slab;
267#endif
Christoph Lameterdfb4f092007-10-16 01:26:05 -0700268}
269
Christoph Lameter6446faa2008-02-15 23:45:26 -0800270/* Verify that a pointer has an address that is valid within a slab page */
Christoph Lameter02cbc872007-05-09 02:32:43 -0700271static inline int check_valid_pointer(struct kmem_cache *s,
272 struct page *page, const void *object)
273{
274 void *base;
275
Christoph Lametera973e9d2008-03-01 13:40:44 -0800276 if (!object)
Christoph Lameter02cbc872007-05-09 02:32:43 -0700277 return 1;
278
Christoph Lametera973e9d2008-03-01 13:40:44 -0800279 base = page_address(page);
Christoph Lameter39b26462008-04-14 19:11:30 +0300280 if (object < base || object >= base + page->objects * s->size ||
Christoph Lameter02cbc872007-05-09 02:32:43 -0700281 (object - base) % s->size) {
282 return 0;
283 }
284
285 return 1;
286}
287
Christoph Lameter81819f02007-05-06 14:49:36 -0700288/*
Christoph Lameter7656c722007-05-09 02:32:40 -0700289 * Slow version of get and set free pointer.
290 *
291 * This version requires touching the cache lines of kmem_cache which
292 * we avoid to do in the fast alloc free paths. There we obtain the offset
293 * from the page struct.
294 */
295static inline void *get_freepointer(struct kmem_cache *s, void *object)
296{
297 return *(void **)(object + s->offset);
298}
299
300static inline void set_freepointer(struct kmem_cache *s, void *object, void *fp)
301{
302 *(void **)(object + s->offset) = fp;
303}
304
305/* Loop over all objects in a slab */
Christoph Lameter224a88b2008-04-14 19:11:31 +0300306#define for_each_object(__p, __s, __addr, __objects) \
307 for (__p = (__addr); __p < (__addr) + (__objects) * (__s)->size;\
Christoph Lameter7656c722007-05-09 02:32:40 -0700308 __p += (__s)->size)
309
310/* Scan freelist */
311#define for_each_free_object(__p, __s, __free) \
Christoph Lametera973e9d2008-03-01 13:40:44 -0800312 for (__p = (__free); __p; __p = get_freepointer((__s), __p))
Christoph Lameter7656c722007-05-09 02:32:40 -0700313
314/* Determine object index from a given position */
315static inline int slab_index(void *p, struct kmem_cache *s, void *addr)
316{
317 return (p - addr) / s->size;
318}
319
Christoph Lameter834f3d12008-04-14 19:11:31 +0300320static inline struct kmem_cache_order_objects oo_make(int order,
321 unsigned long size)
322{
323 struct kmem_cache_order_objects x = {
324 (order << 16) + (PAGE_SIZE << order) / size
325 };
326
327 return x;
328}
329
330static inline int oo_order(struct kmem_cache_order_objects x)
331{
332 return x.x >> 16;
333}
334
335static inline int oo_objects(struct kmem_cache_order_objects x)
336{
337 return x.x & ((1 << 16) - 1);
338}
339
Christoph Lameter41ecc552007-05-09 02:32:44 -0700340#ifdef CONFIG_SLUB_DEBUG
341/*
342 * Debug settings:
343 */
Christoph Lameterf0630ff2007-07-15 23:38:14 -0700344#ifdef CONFIG_SLUB_DEBUG_ON
345static int slub_debug = DEBUG_DEFAULT_FLAGS;
346#else
Christoph Lameter41ecc552007-05-09 02:32:44 -0700347static int slub_debug;
Christoph Lameterf0630ff2007-07-15 23:38:14 -0700348#endif
Christoph Lameter41ecc552007-05-09 02:32:44 -0700349
350static char *slub_debug_slabs;
351
Christoph Lameter7656c722007-05-09 02:32:40 -0700352/*
Christoph Lameter81819f02007-05-06 14:49:36 -0700353 * Object debugging
354 */
355static void print_section(char *text, u8 *addr, unsigned int length)
356{
357 int i, offset;
358 int newline = 1;
359 char ascii[17];
360
361 ascii[16] = 0;
362
363 for (i = 0; i < length; i++) {
364 if (newline) {
Christoph Lameter24922682007-07-17 04:03:18 -0700365 printk(KERN_ERR "%8s 0x%p: ", text, addr + i);
Christoph Lameter81819f02007-05-06 14:49:36 -0700366 newline = 0;
367 }
Pekka Enberg06428782008-01-07 23:20:27 -0800368 printk(KERN_CONT " %02x", addr[i]);
Christoph Lameter81819f02007-05-06 14:49:36 -0700369 offset = i % 16;
370 ascii[offset] = isgraph(addr[i]) ? addr[i] : '.';
371 if (offset == 15) {
Pekka Enberg06428782008-01-07 23:20:27 -0800372 printk(KERN_CONT " %s\n", ascii);
Christoph Lameter81819f02007-05-06 14:49:36 -0700373 newline = 1;
374 }
375 }
376 if (!newline) {
377 i %= 16;
378 while (i < 16) {
Pekka Enberg06428782008-01-07 23:20:27 -0800379 printk(KERN_CONT " ");
Christoph Lameter81819f02007-05-06 14:49:36 -0700380 ascii[i] = ' ';
381 i++;
382 }
Pekka Enberg06428782008-01-07 23:20:27 -0800383 printk(KERN_CONT " %s\n", ascii);
Christoph Lameter81819f02007-05-06 14:49:36 -0700384 }
385}
386
Christoph Lameter81819f02007-05-06 14:49:36 -0700387static struct track *get_track(struct kmem_cache *s, void *object,
388 enum track_item alloc)
389{
390 struct track *p;
391
392 if (s->offset)
393 p = object + s->offset + sizeof(void *);
394 else
395 p = object + s->inuse;
396
397 return p + alloc;
398}
399
400static void set_track(struct kmem_cache *s, void *object,
401 enum track_item alloc, void *addr)
402{
403 struct track *p;
404
405 if (s->offset)
406 p = object + s->offset + sizeof(void *);
407 else
408 p = object + s->inuse;
409
410 p += alloc;
411 if (addr) {
412 p->addr = addr;
413 p->cpu = smp_processor_id();
414 p->pid = current ? current->pid : -1;
415 p->when = jiffies;
416 } else
417 memset(p, 0, sizeof(struct track));
418}
419
Christoph Lameter81819f02007-05-06 14:49:36 -0700420static void init_tracking(struct kmem_cache *s, void *object)
421{
Christoph Lameter24922682007-07-17 04:03:18 -0700422 if (!(s->flags & SLAB_STORE_USER))
423 return;
424
425 set_track(s, object, TRACK_FREE, NULL);
426 set_track(s, object, TRACK_ALLOC, NULL);
Christoph Lameter81819f02007-05-06 14:49:36 -0700427}
428
429static void print_track(const char *s, struct track *t)
430{
431 if (!t->addr)
432 return;
433
Christoph Lameter24922682007-07-17 04:03:18 -0700434 printk(KERN_ERR "INFO: %s in ", s);
Christoph Lameter81819f02007-05-06 14:49:36 -0700435 __print_symbol("%s", (unsigned long)t->addr);
Christoph Lameter24922682007-07-17 04:03:18 -0700436 printk(" age=%lu cpu=%u pid=%d\n", jiffies - t->when, t->cpu, t->pid);
Christoph Lameter81819f02007-05-06 14:49:36 -0700437}
438
Christoph Lameter24922682007-07-17 04:03:18 -0700439static void print_tracking(struct kmem_cache *s, void *object)
440{
441 if (!(s->flags & SLAB_STORE_USER))
442 return;
443
444 print_track("Allocated", get_track(s, object, TRACK_ALLOC));
445 print_track("Freed", get_track(s, object, TRACK_FREE));
446}
447
448static void print_page_info(struct page *page)
449{
Christoph Lameter39b26462008-04-14 19:11:30 +0300450 printk(KERN_ERR "INFO: Slab 0x%p objects=%u used=%u fp=0x%p flags=0x%04lx\n",
451 page, page->objects, page->inuse, page->freelist, page->flags);
Christoph Lameter24922682007-07-17 04:03:18 -0700452
453}
454
455static void slab_bug(struct kmem_cache *s, char *fmt, ...)
456{
457 va_list args;
458 char buf[100];
459
460 va_start(args, fmt);
461 vsnprintf(buf, sizeof(buf), fmt, args);
462 va_end(args);
463 printk(KERN_ERR "========================================"
464 "=====================================\n");
465 printk(KERN_ERR "BUG %s: %s\n", s->name, buf);
466 printk(KERN_ERR "----------------------------------------"
467 "-------------------------------------\n\n");
468}
469
470static void slab_fix(struct kmem_cache *s, char *fmt, ...)
471{
472 va_list args;
473 char buf[100];
474
475 va_start(args, fmt);
476 vsnprintf(buf, sizeof(buf), fmt, args);
477 va_end(args);
478 printk(KERN_ERR "FIX %s: %s\n", s->name, buf);
479}
480
481static void print_trailer(struct kmem_cache *s, struct page *page, u8 *p)
Christoph Lameter81819f02007-05-06 14:49:36 -0700482{
483 unsigned int off; /* Offset of last byte */
Christoph Lametera973e9d2008-03-01 13:40:44 -0800484 u8 *addr = page_address(page);
Christoph Lameter24922682007-07-17 04:03:18 -0700485
486 print_tracking(s, p);
487
488 print_page_info(page);
489
490 printk(KERN_ERR "INFO: Object 0x%p @offset=%tu fp=0x%p\n\n",
491 p, p - addr, get_freepointer(s, p));
492
493 if (p > addr + 16)
494 print_section("Bytes b4", p - 16, 16);
495
496 print_section("Object", p, min(s->objsize, 128));
Christoph Lameter81819f02007-05-06 14:49:36 -0700497
498 if (s->flags & SLAB_RED_ZONE)
499 print_section("Redzone", p + s->objsize,
500 s->inuse - s->objsize);
501
Christoph Lameter81819f02007-05-06 14:49:36 -0700502 if (s->offset)
503 off = s->offset + sizeof(void *);
504 else
505 off = s->inuse;
506
Christoph Lameter24922682007-07-17 04:03:18 -0700507 if (s->flags & SLAB_STORE_USER)
Christoph Lameter81819f02007-05-06 14:49:36 -0700508 off += 2 * sizeof(struct track);
Christoph Lameter81819f02007-05-06 14:49:36 -0700509
510 if (off != s->size)
511 /* Beginning of the filler is the free pointer */
Christoph Lameter24922682007-07-17 04:03:18 -0700512 print_section("Padding", p + off, s->size - off);
513
514 dump_stack();
Christoph Lameter81819f02007-05-06 14:49:36 -0700515}
516
517static void object_err(struct kmem_cache *s, struct page *page,
518 u8 *object, char *reason)
519{
Christoph Lameter3dc50632008-04-23 12:28:01 -0700520 slab_bug(s, "%s", reason);
Christoph Lameter24922682007-07-17 04:03:18 -0700521 print_trailer(s, page, object);
Christoph Lameter81819f02007-05-06 14:49:36 -0700522}
523
Christoph Lameter24922682007-07-17 04:03:18 -0700524static void slab_err(struct kmem_cache *s, struct page *page, char *fmt, ...)
Christoph Lameter81819f02007-05-06 14:49:36 -0700525{
526 va_list args;
527 char buf[100];
528
Christoph Lameter24922682007-07-17 04:03:18 -0700529 va_start(args, fmt);
530 vsnprintf(buf, sizeof(buf), fmt, args);
Christoph Lameter81819f02007-05-06 14:49:36 -0700531 va_end(args);
Christoph Lameter3dc50632008-04-23 12:28:01 -0700532 slab_bug(s, "%s", buf);
Christoph Lameter24922682007-07-17 04:03:18 -0700533 print_page_info(page);
Christoph Lameter81819f02007-05-06 14:49:36 -0700534 dump_stack();
535}
536
537static void init_object(struct kmem_cache *s, void *object, int active)
538{
539 u8 *p = object;
540
541 if (s->flags & __OBJECT_POISON) {
542 memset(p, POISON_FREE, s->objsize - 1);
Pekka Enberg06428782008-01-07 23:20:27 -0800543 p[s->objsize - 1] = POISON_END;
Christoph Lameter81819f02007-05-06 14:49:36 -0700544 }
545
546 if (s->flags & SLAB_RED_ZONE)
547 memset(p + s->objsize,
548 active ? SLUB_RED_ACTIVE : SLUB_RED_INACTIVE,
549 s->inuse - s->objsize);
550}
551
Christoph Lameter24922682007-07-17 04:03:18 -0700552static u8 *check_bytes(u8 *start, unsigned int value, unsigned int bytes)
Christoph Lameter81819f02007-05-06 14:49:36 -0700553{
554 while (bytes) {
555 if (*start != (u8)value)
Christoph Lameter24922682007-07-17 04:03:18 -0700556 return start;
Christoph Lameter81819f02007-05-06 14:49:36 -0700557 start++;
558 bytes--;
559 }
Christoph Lameter24922682007-07-17 04:03:18 -0700560 return NULL;
561}
562
563static void restore_bytes(struct kmem_cache *s, char *message, u8 data,
564 void *from, void *to)
565{
566 slab_fix(s, "Restoring 0x%p-0x%p=0x%x\n", from, to - 1, data);
567 memset(from, data, to - from);
568}
569
570static int check_bytes_and_report(struct kmem_cache *s, struct page *page,
571 u8 *object, char *what,
Pekka Enberg06428782008-01-07 23:20:27 -0800572 u8 *start, unsigned int value, unsigned int bytes)
Christoph Lameter24922682007-07-17 04:03:18 -0700573{
574 u8 *fault;
575 u8 *end;
576
577 fault = check_bytes(start, value, bytes);
578 if (!fault)
579 return 1;
580
581 end = start + bytes;
582 while (end > fault && end[-1] == value)
583 end--;
584
585 slab_bug(s, "%s overwritten", what);
586 printk(KERN_ERR "INFO: 0x%p-0x%p. First byte 0x%x instead of 0x%x\n",
587 fault, end - 1, fault[0], value);
588 print_trailer(s, page, object);
589
590 restore_bytes(s, what, value, fault, end);
591 return 0;
Christoph Lameter81819f02007-05-06 14:49:36 -0700592}
593
Christoph Lameter81819f02007-05-06 14:49:36 -0700594/*
595 * Object layout:
596 *
597 * object address
598 * Bytes of the object to be managed.
599 * If the freepointer may overlay the object then the free
600 * pointer is the first word of the object.
Christoph Lameter672bba32007-05-09 02:32:39 -0700601 *
Christoph Lameter81819f02007-05-06 14:49:36 -0700602 * Poisoning uses 0x6b (POISON_FREE) and the last byte is
603 * 0xa5 (POISON_END)
604 *
605 * object + s->objsize
606 * Padding to reach word boundary. This is also used for Redzoning.
Christoph Lameter672bba32007-05-09 02:32:39 -0700607 * Padding is extended by another word if Redzoning is enabled and
608 * objsize == inuse.
609 *
Christoph Lameter81819f02007-05-06 14:49:36 -0700610 * We fill with 0xbb (RED_INACTIVE) for inactive objects and with
611 * 0xcc (RED_ACTIVE) for objects in use.
612 *
613 * object + s->inuse
Christoph Lameter672bba32007-05-09 02:32:39 -0700614 * Meta data starts here.
615 *
Christoph Lameter81819f02007-05-06 14:49:36 -0700616 * A. Free pointer (if we cannot overwrite object on free)
617 * B. Tracking data for SLAB_STORE_USER
Christoph Lameter672bba32007-05-09 02:32:39 -0700618 * C. Padding to reach required alignment boundary or at mininum
Christoph Lameter6446faa2008-02-15 23:45:26 -0800619 * one word if debugging is on to be able to detect writes
Christoph Lameter672bba32007-05-09 02:32:39 -0700620 * before the word boundary.
621 *
622 * Padding is done using 0x5a (POISON_INUSE)
Christoph Lameter81819f02007-05-06 14:49:36 -0700623 *
624 * object + s->size
Christoph Lameter672bba32007-05-09 02:32:39 -0700625 * Nothing is used beyond s->size.
Christoph Lameter81819f02007-05-06 14:49:36 -0700626 *
Christoph Lameter672bba32007-05-09 02:32:39 -0700627 * If slabcaches are merged then the objsize and inuse boundaries are mostly
628 * ignored. And therefore no slab options that rely on these boundaries
Christoph Lameter81819f02007-05-06 14:49:36 -0700629 * may be used with merged slabcaches.
630 */
631
Christoph Lameter81819f02007-05-06 14:49:36 -0700632static int check_pad_bytes(struct kmem_cache *s, struct page *page, u8 *p)
633{
634 unsigned long off = s->inuse; /* The end of info */
635
636 if (s->offset)
637 /* Freepointer is placed after the object. */
638 off += sizeof(void *);
639
640 if (s->flags & SLAB_STORE_USER)
641 /* We also have user information there */
642 off += 2 * sizeof(struct track);
643
644 if (s->size == off)
645 return 1;
646
Christoph Lameter24922682007-07-17 04:03:18 -0700647 return check_bytes_and_report(s, page, p, "Object padding",
648 p + off, POISON_INUSE, s->size - off);
Christoph Lameter81819f02007-05-06 14:49:36 -0700649}
650
Christoph Lameter39b26462008-04-14 19:11:30 +0300651/* Check the pad bytes at the end of a slab page */
Christoph Lameter81819f02007-05-06 14:49:36 -0700652static int slab_pad_check(struct kmem_cache *s, struct page *page)
653{
Christoph Lameter24922682007-07-17 04:03:18 -0700654 u8 *start;
655 u8 *fault;
656 u8 *end;
657 int length;
658 int remainder;
Christoph Lameter81819f02007-05-06 14:49:36 -0700659
660 if (!(s->flags & SLAB_POISON))
661 return 1;
662
Christoph Lametera973e9d2008-03-01 13:40:44 -0800663 start = page_address(page);
Christoph Lameter834f3d12008-04-14 19:11:31 +0300664 length = (PAGE_SIZE << compound_order(page));
Christoph Lameter39b26462008-04-14 19:11:30 +0300665 end = start + length;
666 remainder = length % s->size;
Christoph Lameter81819f02007-05-06 14:49:36 -0700667 if (!remainder)
668 return 1;
669
Christoph Lameter39b26462008-04-14 19:11:30 +0300670 fault = check_bytes(end - remainder, POISON_INUSE, remainder);
Christoph Lameter24922682007-07-17 04:03:18 -0700671 if (!fault)
672 return 1;
673 while (end > fault && end[-1] == POISON_INUSE)
674 end--;
675
676 slab_err(s, page, "Padding overwritten. 0x%p-0x%p", fault, end - 1);
Christoph Lameter39b26462008-04-14 19:11:30 +0300677 print_section("Padding", end - remainder, remainder);
Christoph Lameter24922682007-07-17 04:03:18 -0700678
679 restore_bytes(s, "slab padding", POISON_INUSE, start, end);
680 return 0;
Christoph Lameter81819f02007-05-06 14:49:36 -0700681}
682
683static int check_object(struct kmem_cache *s, struct page *page,
684 void *object, int active)
685{
686 u8 *p = object;
687 u8 *endobject = object + s->objsize;
688
689 if (s->flags & SLAB_RED_ZONE) {
690 unsigned int red =
691 active ? SLUB_RED_ACTIVE : SLUB_RED_INACTIVE;
692
Christoph Lameter24922682007-07-17 04:03:18 -0700693 if (!check_bytes_and_report(s, page, object, "Redzone",
694 endobject, red, s->inuse - s->objsize))
Christoph Lameter81819f02007-05-06 14:49:36 -0700695 return 0;
Christoph Lameter81819f02007-05-06 14:49:36 -0700696 } else {
Ingo Molnar3adbefe2008-02-05 17:57:39 -0800697 if ((s->flags & SLAB_POISON) && s->objsize < s->inuse) {
698 check_bytes_and_report(s, page, p, "Alignment padding",
699 endobject, POISON_INUSE, s->inuse - s->objsize);
700 }
Christoph Lameter81819f02007-05-06 14:49:36 -0700701 }
702
703 if (s->flags & SLAB_POISON) {
704 if (!active && (s->flags & __OBJECT_POISON) &&
Christoph Lameter24922682007-07-17 04:03:18 -0700705 (!check_bytes_and_report(s, page, p, "Poison", p,
706 POISON_FREE, s->objsize - 1) ||
707 !check_bytes_and_report(s, page, p, "Poison",
Pekka Enberg06428782008-01-07 23:20:27 -0800708 p + s->objsize - 1, POISON_END, 1)))
Christoph Lameter81819f02007-05-06 14:49:36 -0700709 return 0;
Christoph Lameter81819f02007-05-06 14:49:36 -0700710 /*
711 * check_pad_bytes cleans up on its own.
712 */
713 check_pad_bytes(s, page, p);
714 }
715
716 if (!s->offset && active)
717 /*
718 * Object and freepointer overlap. Cannot check
719 * freepointer while object is allocated.
720 */
721 return 1;
722
723 /* Check free pointer validity */
724 if (!check_valid_pointer(s, page, get_freepointer(s, p))) {
725 object_err(s, page, p, "Freepointer corrupt");
726 /*
727 * No choice but to zap it and thus loose the remainder
728 * of the free objects in this slab. May cause
Christoph Lameter672bba32007-05-09 02:32:39 -0700729 * another error because the object count is now wrong.
Christoph Lameter81819f02007-05-06 14:49:36 -0700730 */
Christoph Lametera973e9d2008-03-01 13:40:44 -0800731 set_freepointer(s, p, NULL);
Christoph Lameter81819f02007-05-06 14:49:36 -0700732 return 0;
733 }
734 return 1;
735}
736
737static int check_slab(struct kmem_cache *s, struct page *page)
738{
Christoph Lameter39b26462008-04-14 19:11:30 +0300739 int maxobj;
740
Christoph Lameter81819f02007-05-06 14:49:36 -0700741 VM_BUG_ON(!irqs_disabled());
742
743 if (!PageSlab(page)) {
Christoph Lameter24922682007-07-17 04:03:18 -0700744 slab_err(s, page, "Not a valid slab page");
Christoph Lameter81819f02007-05-06 14:49:36 -0700745 return 0;
746 }
Christoph Lameter39b26462008-04-14 19:11:30 +0300747
748 maxobj = (PAGE_SIZE << compound_order(page)) / s->size;
749 if (page->objects > maxobj) {
750 slab_err(s, page, "objects %u > max %u",
751 s->name, page->objects, maxobj);
752 return 0;
753 }
754 if (page->inuse > page->objects) {
Christoph Lameter24922682007-07-17 04:03:18 -0700755 slab_err(s, page, "inuse %u > max %u",
Christoph Lameter39b26462008-04-14 19:11:30 +0300756 s->name, page->inuse, page->objects);
Christoph Lameter81819f02007-05-06 14:49:36 -0700757 return 0;
758 }
759 /* Slab_pad_check fixes things up after itself */
760 slab_pad_check(s, page);
761 return 1;
762}
763
764/*
Christoph Lameter672bba32007-05-09 02:32:39 -0700765 * Determine if a certain object on a page is on the freelist. Must hold the
766 * slab lock to guarantee that the chains are in a consistent state.
Christoph Lameter81819f02007-05-06 14:49:36 -0700767 */
768static int on_freelist(struct kmem_cache *s, struct page *page, void *search)
769{
770 int nr = 0;
771 void *fp = page->freelist;
772 void *object = NULL;
Christoph Lameter224a88b2008-04-14 19:11:31 +0300773 unsigned long max_objects;
Christoph Lameter81819f02007-05-06 14:49:36 -0700774
Christoph Lameter39b26462008-04-14 19:11:30 +0300775 while (fp && nr <= page->objects) {
Christoph Lameter81819f02007-05-06 14:49:36 -0700776 if (fp == search)
777 return 1;
778 if (!check_valid_pointer(s, page, fp)) {
779 if (object) {
780 object_err(s, page, object,
781 "Freechain corrupt");
Christoph Lametera973e9d2008-03-01 13:40:44 -0800782 set_freepointer(s, object, NULL);
Christoph Lameter81819f02007-05-06 14:49:36 -0700783 break;
784 } else {
Christoph Lameter24922682007-07-17 04:03:18 -0700785 slab_err(s, page, "Freepointer corrupt");
Christoph Lametera973e9d2008-03-01 13:40:44 -0800786 page->freelist = NULL;
Christoph Lameter39b26462008-04-14 19:11:30 +0300787 page->inuse = page->objects;
Christoph Lameter24922682007-07-17 04:03:18 -0700788 slab_fix(s, "Freelist cleared");
Christoph Lameter81819f02007-05-06 14:49:36 -0700789 return 0;
790 }
791 break;
792 }
793 object = fp;
794 fp = get_freepointer(s, object);
795 nr++;
796 }
797
Christoph Lameter224a88b2008-04-14 19:11:31 +0300798 max_objects = (PAGE_SIZE << compound_order(page)) / s->size;
799 if (max_objects > 65535)
800 max_objects = 65535;
801
802 if (page->objects != max_objects) {
803 slab_err(s, page, "Wrong number of objects. Found %d but "
804 "should be %d", page->objects, max_objects);
805 page->objects = max_objects;
806 slab_fix(s, "Number of objects adjusted.");
807 }
Christoph Lameter39b26462008-04-14 19:11:30 +0300808 if (page->inuse != page->objects - nr) {
Christoph Lameter70d71222007-05-06 14:49:47 -0700809 slab_err(s, page, "Wrong object count. Counter is %d but "
Christoph Lameter39b26462008-04-14 19:11:30 +0300810 "counted were %d", page->inuse, page->objects - nr);
811 page->inuse = page->objects - nr;
Christoph Lameter24922682007-07-17 04:03:18 -0700812 slab_fix(s, "Object count adjusted.");
Christoph Lameter81819f02007-05-06 14:49:36 -0700813 }
814 return search == NULL;
815}
816
Christoph Lameter0121c6192008-04-29 16:11:12 -0700817static void trace(struct kmem_cache *s, struct page *page, void *object,
818 int alloc)
Christoph Lameter3ec09742007-05-16 22:11:00 -0700819{
820 if (s->flags & SLAB_TRACE) {
821 printk(KERN_INFO "TRACE %s %s 0x%p inuse=%d fp=0x%p\n",
822 s->name,
823 alloc ? "alloc" : "free",
824 object, page->inuse,
825 page->freelist);
826
827 if (!alloc)
828 print_section("Object", (void *)object, s->objsize);
829
830 dump_stack();
831 }
832}
833
Christoph Lameter643b1132007-05-06 14:49:42 -0700834/*
Christoph Lameter672bba32007-05-09 02:32:39 -0700835 * Tracking of fully allocated slabs for debugging purposes.
Christoph Lameter643b1132007-05-06 14:49:42 -0700836 */
Christoph Lametere95eed52007-05-06 14:49:44 -0700837static void add_full(struct kmem_cache_node *n, struct page *page)
Christoph Lameter643b1132007-05-06 14:49:42 -0700838{
Christoph Lameter643b1132007-05-06 14:49:42 -0700839 spin_lock(&n->list_lock);
840 list_add(&page->lru, &n->full);
841 spin_unlock(&n->list_lock);
842}
843
844static void remove_full(struct kmem_cache *s, struct page *page)
845{
846 struct kmem_cache_node *n;
847
848 if (!(s->flags & SLAB_STORE_USER))
849 return;
850
851 n = get_node(s, page_to_nid(page));
852
853 spin_lock(&n->list_lock);
854 list_del(&page->lru);
855 spin_unlock(&n->list_lock);
856}
857
Christoph Lameter0f389ec2008-04-14 18:53:02 +0300858/* Tracking of the number of slabs for debugging purposes */
859static inline unsigned long slabs_node(struct kmem_cache *s, int node)
860{
861 struct kmem_cache_node *n = get_node(s, node);
862
863 return atomic_long_read(&n->nr_slabs);
864}
865
Christoph Lameter205ab992008-04-14 19:11:40 +0300866static inline void inc_slabs_node(struct kmem_cache *s, int node, int objects)
Christoph Lameter0f389ec2008-04-14 18:53:02 +0300867{
868 struct kmem_cache_node *n = get_node(s, node);
869
870 /*
871 * May be called early in order to allocate a slab for the
872 * kmem_cache_node structure. Solve the chicken-egg
873 * dilemma by deferring the increment of the count during
874 * bootstrap (see early_kmem_cache_node_alloc).
875 */
Christoph Lameter205ab992008-04-14 19:11:40 +0300876 if (!NUMA_BUILD || n) {
Christoph Lameter0f389ec2008-04-14 18:53:02 +0300877 atomic_long_inc(&n->nr_slabs);
Christoph Lameter205ab992008-04-14 19:11:40 +0300878 atomic_long_add(objects, &n->total_objects);
879 }
Christoph Lameter0f389ec2008-04-14 18:53:02 +0300880}
Christoph Lameter205ab992008-04-14 19:11:40 +0300881static inline void dec_slabs_node(struct kmem_cache *s, int node, int objects)
Christoph Lameter0f389ec2008-04-14 18:53:02 +0300882{
883 struct kmem_cache_node *n = get_node(s, node);
884
885 atomic_long_dec(&n->nr_slabs);
Christoph Lameter205ab992008-04-14 19:11:40 +0300886 atomic_long_sub(objects, &n->total_objects);
Christoph Lameter0f389ec2008-04-14 18:53:02 +0300887}
888
889/* Object debug checks for alloc/free paths */
Christoph Lameter3ec09742007-05-16 22:11:00 -0700890static void setup_object_debug(struct kmem_cache *s, struct page *page,
891 void *object)
892{
893 if (!(s->flags & (SLAB_STORE_USER|SLAB_RED_ZONE|__OBJECT_POISON)))
894 return;
895
896 init_object(s, object, 0);
897 init_tracking(s, object);
898}
899
900static int alloc_debug_processing(struct kmem_cache *s, struct page *page,
901 void *object, void *addr)
Christoph Lameter81819f02007-05-06 14:49:36 -0700902{
903 if (!check_slab(s, page))
904 goto bad;
905
Christoph Lameterd692ef62008-02-15 23:45:24 -0800906 if (!on_freelist(s, page, object)) {
Christoph Lameter24922682007-07-17 04:03:18 -0700907 object_err(s, page, object, "Object already allocated");
Christoph Lameter70d71222007-05-06 14:49:47 -0700908 goto bad;
Christoph Lameter81819f02007-05-06 14:49:36 -0700909 }
910
911 if (!check_valid_pointer(s, page, object)) {
912 object_err(s, page, object, "Freelist Pointer check fails");
Christoph Lameter70d71222007-05-06 14:49:47 -0700913 goto bad;
Christoph Lameter81819f02007-05-06 14:49:36 -0700914 }
915
Christoph Lameterd692ef62008-02-15 23:45:24 -0800916 if (!check_object(s, page, object, 0))
Christoph Lameter81819f02007-05-06 14:49:36 -0700917 goto bad;
Christoph Lameter81819f02007-05-06 14:49:36 -0700918
Christoph Lameter3ec09742007-05-16 22:11:00 -0700919 /* Success perform special debug activities for allocs */
920 if (s->flags & SLAB_STORE_USER)
921 set_track(s, object, TRACK_ALLOC, addr);
922 trace(s, page, object, 1);
923 init_object(s, object, 1);
Christoph Lameter81819f02007-05-06 14:49:36 -0700924 return 1;
Christoph Lameter3ec09742007-05-16 22:11:00 -0700925
Christoph Lameter81819f02007-05-06 14:49:36 -0700926bad:
927 if (PageSlab(page)) {
928 /*
929 * If this is a slab page then lets do the best we can
930 * to avoid issues in the future. Marking all objects
Christoph Lameter672bba32007-05-09 02:32:39 -0700931 * as used avoids touching the remaining objects.
Christoph Lameter81819f02007-05-06 14:49:36 -0700932 */
Christoph Lameter24922682007-07-17 04:03:18 -0700933 slab_fix(s, "Marking all objects used");
Christoph Lameter39b26462008-04-14 19:11:30 +0300934 page->inuse = page->objects;
Christoph Lametera973e9d2008-03-01 13:40:44 -0800935 page->freelist = NULL;
Christoph Lameter81819f02007-05-06 14:49:36 -0700936 }
937 return 0;
938}
939
Christoph Lameter3ec09742007-05-16 22:11:00 -0700940static int free_debug_processing(struct kmem_cache *s, struct page *page,
941 void *object, void *addr)
Christoph Lameter81819f02007-05-06 14:49:36 -0700942{
943 if (!check_slab(s, page))
944 goto fail;
945
946 if (!check_valid_pointer(s, page, object)) {
Christoph Lameter70d71222007-05-06 14:49:47 -0700947 slab_err(s, page, "Invalid object pointer 0x%p", object);
Christoph Lameter81819f02007-05-06 14:49:36 -0700948 goto fail;
949 }
950
951 if (on_freelist(s, page, object)) {
Christoph Lameter24922682007-07-17 04:03:18 -0700952 object_err(s, page, object, "Object already free");
Christoph Lameter81819f02007-05-06 14:49:36 -0700953 goto fail;
954 }
955
956 if (!check_object(s, page, object, 1))
957 return 0;
958
959 if (unlikely(s != page->slab)) {
Ingo Molnar3adbefe2008-02-05 17:57:39 -0800960 if (!PageSlab(page)) {
Christoph Lameter70d71222007-05-06 14:49:47 -0700961 slab_err(s, page, "Attempt to free object(0x%p) "
962 "outside of slab", object);
Ingo Molnar3adbefe2008-02-05 17:57:39 -0800963 } else if (!page->slab) {
Christoph Lameter81819f02007-05-06 14:49:36 -0700964 printk(KERN_ERR
Christoph Lameter70d71222007-05-06 14:49:47 -0700965 "SLUB <none>: no slab for object 0x%p.\n",
Christoph Lameter81819f02007-05-06 14:49:36 -0700966 object);
Christoph Lameter70d71222007-05-06 14:49:47 -0700967 dump_stack();
Pekka Enberg06428782008-01-07 23:20:27 -0800968 } else
Christoph Lameter24922682007-07-17 04:03:18 -0700969 object_err(s, page, object,
970 "page slab pointer corrupt.");
Christoph Lameter81819f02007-05-06 14:49:36 -0700971 goto fail;
972 }
Christoph Lameter3ec09742007-05-16 22:11:00 -0700973
974 /* Special debug activities for freeing objects */
Christoph Lametera973e9d2008-03-01 13:40:44 -0800975 if (!SlabFrozen(page) && !page->freelist)
Christoph Lameter3ec09742007-05-16 22:11:00 -0700976 remove_full(s, page);
977 if (s->flags & SLAB_STORE_USER)
978 set_track(s, object, TRACK_FREE, addr);
979 trace(s, page, object, 0);
980 init_object(s, object, 0);
Christoph Lameter81819f02007-05-06 14:49:36 -0700981 return 1;
Christoph Lameter3ec09742007-05-16 22:11:00 -0700982
Christoph Lameter81819f02007-05-06 14:49:36 -0700983fail:
Christoph Lameter24922682007-07-17 04:03:18 -0700984 slab_fix(s, "Object at 0x%p not freed", object);
Christoph Lameter81819f02007-05-06 14:49:36 -0700985 return 0;
986}
987
Christoph Lameter41ecc552007-05-09 02:32:44 -0700988static int __init setup_slub_debug(char *str)
989{
Christoph Lameterf0630ff2007-07-15 23:38:14 -0700990 slub_debug = DEBUG_DEFAULT_FLAGS;
991 if (*str++ != '=' || !*str)
992 /*
993 * No options specified. Switch on full debugging.
994 */
995 goto out;
Christoph Lameter41ecc552007-05-09 02:32:44 -0700996
997 if (*str == ',')
Christoph Lameterf0630ff2007-07-15 23:38:14 -0700998 /*
999 * No options but restriction on slabs. This means full
1000 * debugging for slabs matching a pattern.
1001 */
1002 goto check_slabs;
1003
1004 slub_debug = 0;
1005 if (*str == '-')
1006 /*
1007 * Switch off all debugging measures.
1008 */
1009 goto out;
1010
1011 /*
1012 * Determine which debug features should be switched on
1013 */
Pekka Enberg06428782008-01-07 23:20:27 -08001014 for (; *str && *str != ','; str++) {
Christoph Lameterf0630ff2007-07-15 23:38:14 -07001015 switch (tolower(*str)) {
1016 case 'f':
1017 slub_debug |= SLAB_DEBUG_FREE;
1018 break;
1019 case 'z':
1020 slub_debug |= SLAB_RED_ZONE;
1021 break;
1022 case 'p':
1023 slub_debug |= SLAB_POISON;
1024 break;
1025 case 'u':
1026 slub_debug |= SLAB_STORE_USER;
1027 break;
1028 case 't':
1029 slub_debug |= SLAB_TRACE;
1030 break;
1031 default:
1032 printk(KERN_ERR "slub_debug option '%c' "
Pekka Enberg06428782008-01-07 23:20:27 -08001033 "unknown. skipped\n", *str);
Christoph Lameterf0630ff2007-07-15 23:38:14 -07001034 }
1035 }
1036
1037check_slabs:
1038 if (*str == ',')
Christoph Lameter41ecc552007-05-09 02:32:44 -07001039 slub_debug_slabs = str + 1;
Christoph Lameterf0630ff2007-07-15 23:38:14 -07001040out:
Christoph Lameter41ecc552007-05-09 02:32:44 -07001041 return 1;
1042}
1043
1044__setup("slub_debug", setup_slub_debug);
1045
Christoph Lameterba0268a2007-09-11 15:24:11 -07001046static unsigned long kmem_cache_flags(unsigned long objsize,
1047 unsigned long flags, const char *name,
Christoph Lameter4ba9b9d2007-10-16 23:25:51 -07001048 void (*ctor)(struct kmem_cache *, void *))
Christoph Lameter41ecc552007-05-09 02:32:44 -07001049{
1050 /*
Christoph Lametere1533622008-02-15 23:45:24 -08001051 * Enable debugging if selected on the kernel commandline.
Christoph Lameter41ecc552007-05-09 02:32:44 -07001052 */
Christoph Lametere1533622008-02-15 23:45:24 -08001053 if (slub_debug && (!slub_debug_slabs ||
1054 strncmp(slub_debug_slabs, name, strlen(slub_debug_slabs)) == 0))
1055 flags |= slub_debug;
Christoph Lameterba0268a2007-09-11 15:24:11 -07001056
1057 return flags;
Christoph Lameter41ecc552007-05-09 02:32:44 -07001058}
1059#else
Christoph Lameter3ec09742007-05-16 22:11:00 -07001060static inline void setup_object_debug(struct kmem_cache *s,
1061 struct page *page, void *object) {}
Christoph Lameter41ecc552007-05-09 02:32:44 -07001062
Christoph Lameter3ec09742007-05-16 22:11:00 -07001063static inline int alloc_debug_processing(struct kmem_cache *s,
1064 struct page *page, void *object, void *addr) { return 0; }
Christoph Lameter41ecc552007-05-09 02:32:44 -07001065
Christoph Lameter3ec09742007-05-16 22:11:00 -07001066static inline int free_debug_processing(struct kmem_cache *s,
1067 struct page *page, void *object, void *addr) { return 0; }
Christoph Lameter41ecc552007-05-09 02:32:44 -07001068
Christoph Lameter41ecc552007-05-09 02:32:44 -07001069static inline int slab_pad_check(struct kmem_cache *s, struct page *page)
1070 { return 1; }
1071static inline int check_object(struct kmem_cache *s, struct page *page,
1072 void *object, int active) { return 1; }
Christoph Lameter3ec09742007-05-16 22:11:00 -07001073static inline void add_full(struct kmem_cache_node *n, struct page *page) {}
Christoph Lameterba0268a2007-09-11 15:24:11 -07001074static inline unsigned long kmem_cache_flags(unsigned long objsize,
1075 unsigned long flags, const char *name,
Christoph Lameter4ba9b9d2007-10-16 23:25:51 -07001076 void (*ctor)(struct kmem_cache *, void *))
Christoph Lameterba0268a2007-09-11 15:24:11 -07001077{
1078 return flags;
1079}
Christoph Lameter41ecc552007-05-09 02:32:44 -07001080#define slub_debug 0
Christoph Lameter0f389ec2008-04-14 18:53:02 +03001081
1082static inline unsigned long slabs_node(struct kmem_cache *s, int node)
1083 { return 0; }
Christoph Lameter205ab992008-04-14 19:11:40 +03001084static inline void inc_slabs_node(struct kmem_cache *s, int node,
1085 int objects) {}
1086static inline void dec_slabs_node(struct kmem_cache *s, int node,
1087 int objects) {}
Christoph Lameter41ecc552007-05-09 02:32:44 -07001088#endif
Christoph Lameter205ab992008-04-14 19:11:40 +03001089
Christoph Lameter81819f02007-05-06 14:49:36 -07001090/*
1091 * Slab allocation and freeing
1092 */
Christoph Lameter65c33762008-04-14 19:11:40 +03001093static inline struct page *alloc_slab_page(gfp_t flags, int node,
1094 struct kmem_cache_order_objects oo)
1095{
1096 int order = oo_order(oo);
1097
1098 if (node == -1)
1099 return alloc_pages(flags, order);
1100 else
1101 return alloc_pages_node(node, flags, order);
1102}
1103
Christoph Lameter81819f02007-05-06 14:49:36 -07001104static struct page *allocate_slab(struct kmem_cache *s, gfp_t flags, int node)
1105{
Pekka Enberg06428782008-01-07 23:20:27 -08001106 struct page *page;
Christoph Lameter834f3d12008-04-14 19:11:31 +03001107 struct kmem_cache_order_objects oo = s->oo;
Christoph Lameter81819f02007-05-06 14:49:36 -07001108
Christoph Lameterb7a49f02008-02-14 14:21:32 -08001109 flags |= s->allocflags;
Mel Gormane12ba742007-10-16 01:25:52 -07001110
Christoph Lameter65c33762008-04-14 19:11:40 +03001111 page = alloc_slab_page(flags | __GFP_NOWARN | __GFP_NORETRY, node,
1112 oo);
1113 if (unlikely(!page)) {
1114 oo = s->min;
1115 /*
1116 * Allocation may have failed due to fragmentation.
1117 * Try a lower order alloc if possible
1118 */
1119 page = alloc_slab_page(flags, node, oo);
1120 if (!page)
1121 return NULL;
Christoph Lameter81819f02007-05-06 14:49:36 -07001122
Christoph Lameter65c33762008-04-14 19:11:40 +03001123 stat(get_cpu_slab(s, raw_smp_processor_id()), ORDER_FALLBACK);
1124 }
Christoph Lameter834f3d12008-04-14 19:11:31 +03001125 page->objects = oo_objects(oo);
Christoph Lameter81819f02007-05-06 14:49:36 -07001126 mod_zone_page_state(page_zone(page),
1127 (s->flags & SLAB_RECLAIM_ACCOUNT) ?
1128 NR_SLAB_RECLAIMABLE : NR_SLAB_UNRECLAIMABLE,
Christoph Lameter65c33762008-04-14 19:11:40 +03001129 1 << oo_order(oo));
Christoph Lameter81819f02007-05-06 14:49:36 -07001130
1131 return page;
1132}
1133
1134static void setup_object(struct kmem_cache *s, struct page *page,
1135 void *object)
1136{
Christoph Lameter3ec09742007-05-16 22:11:00 -07001137 setup_object_debug(s, page, object);
Christoph Lameter4f104932007-05-06 14:50:17 -07001138 if (unlikely(s->ctor))
Christoph Lameter4ba9b9d2007-10-16 23:25:51 -07001139 s->ctor(s, object);
Christoph Lameter81819f02007-05-06 14:49:36 -07001140}
1141
1142static struct page *new_slab(struct kmem_cache *s, gfp_t flags, int node)
1143{
1144 struct page *page;
Christoph Lameter81819f02007-05-06 14:49:36 -07001145 void *start;
Christoph Lameter81819f02007-05-06 14:49:36 -07001146 void *last;
1147 void *p;
1148
Christoph Lameter6cb06222007-10-16 01:25:41 -07001149 BUG_ON(flags & GFP_SLAB_BUG_MASK);
Christoph Lameter81819f02007-05-06 14:49:36 -07001150
Christoph Lameter6cb06222007-10-16 01:25:41 -07001151 page = allocate_slab(s,
1152 flags & (GFP_RECLAIM_MASK | GFP_CONSTRAINT_MASK), node);
Christoph Lameter81819f02007-05-06 14:49:36 -07001153 if (!page)
1154 goto out;
1155
Christoph Lameter205ab992008-04-14 19:11:40 +03001156 inc_slabs_node(s, page_to_nid(page), page->objects);
Christoph Lameter81819f02007-05-06 14:49:36 -07001157 page->slab = s;
1158 page->flags |= 1 << PG_slab;
1159 if (s->flags & (SLAB_DEBUG_FREE | SLAB_RED_ZONE | SLAB_POISON |
1160 SLAB_STORE_USER | SLAB_TRACE))
Christoph Lameter35e5d7e2007-05-09 02:32:42 -07001161 SetSlabDebug(page);
Christoph Lameter81819f02007-05-06 14:49:36 -07001162
1163 start = page_address(page);
Christoph Lameter81819f02007-05-06 14:49:36 -07001164
1165 if (unlikely(s->flags & SLAB_POISON))
Christoph Lameter834f3d12008-04-14 19:11:31 +03001166 memset(start, POISON_INUSE, PAGE_SIZE << compound_order(page));
Christoph Lameter81819f02007-05-06 14:49:36 -07001167
1168 last = start;
Christoph Lameter224a88b2008-04-14 19:11:31 +03001169 for_each_object(p, s, start, page->objects) {
Christoph Lameter81819f02007-05-06 14:49:36 -07001170 setup_object(s, page, last);
1171 set_freepointer(s, last, p);
1172 last = p;
1173 }
1174 setup_object(s, page, last);
Christoph Lametera973e9d2008-03-01 13:40:44 -08001175 set_freepointer(s, last, NULL);
Christoph Lameter81819f02007-05-06 14:49:36 -07001176
1177 page->freelist = start;
1178 page->inuse = 0;
1179out:
Christoph Lameter81819f02007-05-06 14:49:36 -07001180 return page;
1181}
1182
1183static void __free_slab(struct kmem_cache *s, struct page *page)
1184{
Christoph Lameter834f3d12008-04-14 19:11:31 +03001185 int order = compound_order(page);
1186 int pages = 1 << order;
Christoph Lameter81819f02007-05-06 14:49:36 -07001187
Christoph Lameterc59def92007-05-16 22:10:50 -07001188 if (unlikely(SlabDebug(page))) {
Christoph Lameter81819f02007-05-06 14:49:36 -07001189 void *p;
1190
1191 slab_pad_check(s, page);
Christoph Lameter224a88b2008-04-14 19:11:31 +03001192 for_each_object(p, s, page_address(page),
1193 page->objects)
Christoph Lameter81819f02007-05-06 14:49:36 -07001194 check_object(s, page, p, 0);
Peter Zijlstra2208b762007-07-26 20:54:34 +02001195 ClearSlabDebug(page);
Christoph Lameter81819f02007-05-06 14:49:36 -07001196 }
1197
1198 mod_zone_page_state(page_zone(page),
1199 (s->flags & SLAB_RECLAIM_ACCOUNT) ?
1200 NR_SLAB_RECLAIMABLE : NR_SLAB_UNRECLAIMABLE,
Pekka Enberg06428782008-01-07 23:20:27 -08001201 -pages);
Christoph Lameter81819f02007-05-06 14:49:36 -07001202
Christoph Lameter49bd5222008-04-14 18:52:18 +03001203 __ClearPageSlab(page);
1204 reset_page_mapcount(page);
Christoph Lameter834f3d12008-04-14 19:11:31 +03001205 __free_pages(page, order);
Christoph Lameter81819f02007-05-06 14:49:36 -07001206}
1207
1208static void rcu_free_slab(struct rcu_head *h)
1209{
1210 struct page *page;
1211
1212 page = container_of((struct list_head *)h, struct page, lru);
1213 __free_slab(page->slab, page);
1214}
1215
1216static void free_slab(struct kmem_cache *s, struct page *page)
1217{
1218 if (unlikely(s->flags & SLAB_DESTROY_BY_RCU)) {
1219 /*
1220 * RCU free overloads the RCU head over the LRU
1221 */
1222 struct rcu_head *head = (void *)&page->lru;
1223
1224 call_rcu(head, rcu_free_slab);
1225 } else
1226 __free_slab(s, page);
1227}
1228
1229static void discard_slab(struct kmem_cache *s, struct page *page)
1230{
Christoph Lameter205ab992008-04-14 19:11:40 +03001231 dec_slabs_node(s, page_to_nid(page), page->objects);
Christoph Lameter81819f02007-05-06 14:49:36 -07001232 free_slab(s, page);
1233}
1234
1235/*
1236 * Per slab locking using the pagelock
1237 */
1238static __always_inline void slab_lock(struct page *page)
1239{
1240 bit_spin_lock(PG_locked, &page->flags);
1241}
1242
1243static __always_inline void slab_unlock(struct page *page)
1244{
Nick Piggina76d3542008-01-07 23:20:27 -08001245 __bit_spin_unlock(PG_locked, &page->flags);
Christoph Lameter81819f02007-05-06 14:49:36 -07001246}
1247
1248static __always_inline int slab_trylock(struct page *page)
1249{
1250 int rc = 1;
1251
1252 rc = bit_spin_trylock(PG_locked, &page->flags);
1253 return rc;
1254}
1255
1256/*
1257 * Management of partially allocated slabs
1258 */
Christoph Lameter7c2e1322008-01-07 23:20:27 -08001259static void add_partial(struct kmem_cache_node *n,
1260 struct page *page, int tail)
Christoph Lameter81819f02007-05-06 14:49:36 -07001261{
Christoph Lametere95eed52007-05-06 14:49:44 -07001262 spin_lock(&n->list_lock);
1263 n->nr_partial++;
Christoph Lameter7c2e1322008-01-07 23:20:27 -08001264 if (tail)
1265 list_add_tail(&page->lru, &n->partial);
1266 else
1267 list_add(&page->lru, &n->partial);
Christoph Lameter81819f02007-05-06 14:49:36 -07001268 spin_unlock(&n->list_lock);
1269}
1270
Christoph Lameter0121c6192008-04-29 16:11:12 -07001271static void remove_partial(struct kmem_cache *s, struct page *page)
Christoph Lameter81819f02007-05-06 14:49:36 -07001272{
1273 struct kmem_cache_node *n = get_node(s, page_to_nid(page));
1274
1275 spin_lock(&n->list_lock);
1276 list_del(&page->lru);
1277 n->nr_partial--;
1278 spin_unlock(&n->list_lock);
1279}
1280
1281/*
Christoph Lameter672bba32007-05-09 02:32:39 -07001282 * Lock slab and remove from the partial list.
Christoph Lameter81819f02007-05-06 14:49:36 -07001283 *
Christoph Lameter672bba32007-05-09 02:32:39 -07001284 * Must hold list_lock.
Christoph Lameter81819f02007-05-06 14:49:36 -07001285 */
Christoph Lameter0121c6192008-04-29 16:11:12 -07001286static inline int lock_and_freeze_slab(struct kmem_cache_node *n,
1287 struct page *page)
Christoph Lameter81819f02007-05-06 14:49:36 -07001288{
1289 if (slab_trylock(page)) {
1290 list_del(&page->lru);
1291 n->nr_partial--;
Christoph Lameter4b6f0752007-05-16 22:10:53 -07001292 SetSlabFrozen(page);
Christoph Lameter81819f02007-05-06 14:49:36 -07001293 return 1;
1294 }
1295 return 0;
1296}
1297
1298/*
Christoph Lameter672bba32007-05-09 02:32:39 -07001299 * Try to allocate a partial slab from a specific node.
Christoph Lameter81819f02007-05-06 14:49:36 -07001300 */
1301static struct page *get_partial_node(struct kmem_cache_node *n)
1302{
1303 struct page *page;
1304
1305 /*
1306 * Racy check. If we mistakenly see no partial slabs then we
1307 * just allocate an empty slab. If we mistakenly try to get a
Christoph Lameter672bba32007-05-09 02:32:39 -07001308 * partial slab and there is none available then get_partials()
1309 * will return NULL.
Christoph Lameter81819f02007-05-06 14:49:36 -07001310 */
1311 if (!n || !n->nr_partial)
1312 return NULL;
1313
1314 spin_lock(&n->list_lock);
1315 list_for_each_entry(page, &n->partial, lru)
Christoph Lameter4b6f0752007-05-16 22:10:53 -07001316 if (lock_and_freeze_slab(n, page))
Christoph Lameter81819f02007-05-06 14:49:36 -07001317 goto out;
1318 page = NULL;
1319out:
1320 spin_unlock(&n->list_lock);
1321 return page;
1322}
1323
1324/*
Christoph Lameter672bba32007-05-09 02:32:39 -07001325 * Get a page from somewhere. Search in increasing NUMA distances.
Christoph Lameter81819f02007-05-06 14:49:36 -07001326 */
1327static struct page *get_any_partial(struct kmem_cache *s, gfp_t flags)
1328{
1329#ifdef CONFIG_NUMA
1330 struct zonelist *zonelist;
Mel Gormandd1a2392008-04-28 02:12:17 -07001331 struct zoneref *z;
Mel Gorman54a6eb52008-04-28 02:12:16 -07001332 struct zone *zone;
1333 enum zone_type high_zoneidx = gfp_zone(flags);
Christoph Lameter81819f02007-05-06 14:49:36 -07001334 struct page *page;
1335
1336 /*
Christoph Lameter672bba32007-05-09 02:32:39 -07001337 * The defrag ratio allows a configuration of the tradeoffs between
1338 * inter node defragmentation and node local allocations. A lower
1339 * defrag_ratio increases the tendency to do local allocations
1340 * instead of attempting to obtain partial slabs from other nodes.
Christoph Lameter81819f02007-05-06 14:49:36 -07001341 *
Christoph Lameter672bba32007-05-09 02:32:39 -07001342 * If the defrag_ratio is set to 0 then kmalloc() always
1343 * returns node local objects. If the ratio is higher then kmalloc()
1344 * may return off node objects because partial slabs are obtained
1345 * from other nodes and filled up.
Christoph Lameter81819f02007-05-06 14:49:36 -07001346 *
Christoph Lameter6446faa2008-02-15 23:45:26 -08001347 * If /sys/kernel/slab/xx/defrag_ratio is set to 100 (which makes
Christoph Lameter672bba32007-05-09 02:32:39 -07001348 * defrag_ratio = 1000) then every (well almost) allocation will
1349 * first attempt to defrag slab caches on other nodes. This means
1350 * scanning over all nodes to look for partial slabs which may be
1351 * expensive if we do it every time we are trying to find a slab
1352 * with available objects.
Christoph Lameter81819f02007-05-06 14:49:36 -07001353 */
Christoph Lameter98246012008-01-07 23:20:26 -08001354 if (!s->remote_node_defrag_ratio ||
1355 get_cycles() % 1024 > s->remote_node_defrag_ratio)
Christoph Lameter81819f02007-05-06 14:49:36 -07001356 return NULL;
1357
Mel Gorman0e884602008-04-28 02:12:14 -07001358 zonelist = node_zonelist(slab_node(current->mempolicy), flags);
Mel Gorman54a6eb52008-04-28 02:12:16 -07001359 for_each_zone_zonelist(zone, z, zonelist, high_zoneidx) {
Christoph Lameter81819f02007-05-06 14:49:36 -07001360 struct kmem_cache_node *n;
1361
Mel Gorman54a6eb52008-04-28 02:12:16 -07001362 n = get_node(s, zone_to_nid(zone));
Christoph Lameter81819f02007-05-06 14:49:36 -07001363
Mel Gorman54a6eb52008-04-28 02:12:16 -07001364 if (n && cpuset_zone_allowed_hardwall(zone, flags) &&
Christoph Lametere95eed52007-05-06 14:49:44 -07001365 n->nr_partial > MIN_PARTIAL) {
Christoph Lameter81819f02007-05-06 14:49:36 -07001366 page = get_partial_node(n);
1367 if (page)
1368 return page;
1369 }
1370 }
1371#endif
1372 return NULL;
1373}
1374
1375/*
1376 * Get a partial page, lock it and return it.
1377 */
1378static struct page *get_partial(struct kmem_cache *s, gfp_t flags, int node)
1379{
1380 struct page *page;
1381 int searchnode = (node == -1) ? numa_node_id() : node;
1382
1383 page = get_partial_node(get_node(s, searchnode));
1384 if (page || (flags & __GFP_THISNODE))
1385 return page;
1386
1387 return get_any_partial(s, flags);
1388}
1389
1390/*
1391 * Move a page back to the lists.
1392 *
1393 * Must be called with the slab lock held.
1394 *
1395 * On exit the slab lock will have been dropped.
1396 */
Christoph Lameter7c2e1322008-01-07 23:20:27 -08001397static void unfreeze_slab(struct kmem_cache *s, struct page *page, int tail)
Christoph Lameter81819f02007-05-06 14:49:36 -07001398{
Christoph Lametere95eed52007-05-06 14:49:44 -07001399 struct kmem_cache_node *n = get_node(s, page_to_nid(page));
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001400 struct kmem_cache_cpu *c = get_cpu_slab(s, smp_processor_id());
Christoph Lametere95eed52007-05-06 14:49:44 -07001401
Christoph Lameter4b6f0752007-05-16 22:10:53 -07001402 ClearSlabFrozen(page);
Christoph Lameter81819f02007-05-06 14:49:36 -07001403 if (page->inuse) {
Christoph Lametere95eed52007-05-06 14:49:44 -07001404
Christoph Lametera973e9d2008-03-01 13:40:44 -08001405 if (page->freelist) {
Christoph Lameter7c2e1322008-01-07 23:20:27 -08001406 add_partial(n, page, tail);
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001407 stat(c, tail ? DEACTIVATE_TO_TAIL : DEACTIVATE_TO_HEAD);
1408 } else {
1409 stat(c, DEACTIVATE_FULL);
1410 if (SlabDebug(page) && (s->flags & SLAB_STORE_USER))
1411 add_full(n, page);
1412 }
Christoph Lameter81819f02007-05-06 14:49:36 -07001413 slab_unlock(page);
1414 } else {
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001415 stat(c, DEACTIVATE_EMPTY);
Christoph Lametere95eed52007-05-06 14:49:44 -07001416 if (n->nr_partial < MIN_PARTIAL) {
1417 /*
Christoph Lameter672bba32007-05-09 02:32:39 -07001418 * Adding an empty slab to the partial slabs in order
1419 * to avoid page allocator overhead. This slab needs
1420 * to come after the other slabs with objects in
Christoph Lameter6446faa2008-02-15 23:45:26 -08001421 * so that the others get filled first. That way the
1422 * size of the partial list stays small.
1423 *
Christoph Lameter0121c6192008-04-29 16:11:12 -07001424 * kmem_cache_shrink can reclaim any empty slabs from
1425 * the partial list.
Christoph Lametere95eed52007-05-06 14:49:44 -07001426 */
Christoph Lameter7c2e1322008-01-07 23:20:27 -08001427 add_partial(n, page, 1);
Christoph Lametere95eed52007-05-06 14:49:44 -07001428 slab_unlock(page);
1429 } else {
1430 slab_unlock(page);
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001431 stat(get_cpu_slab(s, raw_smp_processor_id()), FREE_SLAB);
Christoph Lametere95eed52007-05-06 14:49:44 -07001432 discard_slab(s, page);
1433 }
Christoph Lameter81819f02007-05-06 14:49:36 -07001434 }
1435}
1436
1437/*
1438 * Remove the cpu slab
1439 */
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001440static void deactivate_slab(struct kmem_cache *s, struct kmem_cache_cpu *c)
Christoph Lameter81819f02007-05-06 14:49:36 -07001441{
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001442 struct page *page = c->page;
Christoph Lameter7c2e1322008-01-07 23:20:27 -08001443 int tail = 1;
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001444
Christoph Lameterb773ad72008-03-04 11:10:17 -08001445 if (page->freelist)
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001446 stat(c, DEACTIVATE_REMOTE_FREES);
Christoph Lameter894b8782007-05-10 03:15:16 -07001447 /*
Christoph Lameter6446faa2008-02-15 23:45:26 -08001448 * Merge cpu freelist into slab freelist. Typically we get here
Christoph Lameter894b8782007-05-10 03:15:16 -07001449 * because both freelists are empty. So this is unlikely
1450 * to occur.
1451 */
Christoph Lametera973e9d2008-03-01 13:40:44 -08001452 while (unlikely(c->freelist)) {
Christoph Lameter894b8782007-05-10 03:15:16 -07001453 void **object;
1454
Christoph Lameter7c2e1322008-01-07 23:20:27 -08001455 tail = 0; /* Hot objects. Put the slab first */
1456
Christoph Lameter894b8782007-05-10 03:15:16 -07001457 /* Retrieve object from cpu_freelist */
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001458 object = c->freelist;
Christoph Lameterb3fba8d2007-10-16 01:26:06 -07001459 c->freelist = c->freelist[c->offset];
Christoph Lameter894b8782007-05-10 03:15:16 -07001460
1461 /* And put onto the regular freelist */
Christoph Lameterb3fba8d2007-10-16 01:26:06 -07001462 object[c->offset] = page->freelist;
Christoph Lameter894b8782007-05-10 03:15:16 -07001463 page->freelist = object;
1464 page->inuse--;
1465 }
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001466 c->page = NULL;
Christoph Lameter7c2e1322008-01-07 23:20:27 -08001467 unfreeze_slab(s, page, tail);
Christoph Lameter81819f02007-05-06 14:49:36 -07001468}
1469
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001470static inline void flush_slab(struct kmem_cache *s, struct kmem_cache_cpu *c)
Christoph Lameter81819f02007-05-06 14:49:36 -07001471{
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001472 stat(c, CPUSLAB_FLUSH);
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001473 slab_lock(c->page);
1474 deactivate_slab(s, c);
Christoph Lameter81819f02007-05-06 14:49:36 -07001475}
1476
1477/*
1478 * Flush cpu slab.
Christoph Lameter6446faa2008-02-15 23:45:26 -08001479 *
Christoph Lameter81819f02007-05-06 14:49:36 -07001480 * Called from IPI handler with interrupts disabled.
1481 */
Christoph Lameter0c710012007-07-17 04:03:24 -07001482static inline void __flush_cpu_slab(struct kmem_cache *s, int cpu)
Christoph Lameter81819f02007-05-06 14:49:36 -07001483{
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001484 struct kmem_cache_cpu *c = get_cpu_slab(s, cpu);
Christoph Lameter81819f02007-05-06 14:49:36 -07001485
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001486 if (likely(c && c->page))
1487 flush_slab(s, c);
Christoph Lameter81819f02007-05-06 14:49:36 -07001488}
1489
1490static void flush_cpu_slab(void *d)
1491{
1492 struct kmem_cache *s = d;
Christoph Lameter81819f02007-05-06 14:49:36 -07001493
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001494 __flush_cpu_slab(s, smp_processor_id());
Christoph Lameter81819f02007-05-06 14:49:36 -07001495}
1496
1497static void flush_all(struct kmem_cache *s)
1498{
1499#ifdef CONFIG_SMP
1500 on_each_cpu(flush_cpu_slab, s, 1, 1);
1501#else
1502 unsigned long flags;
1503
1504 local_irq_save(flags);
1505 flush_cpu_slab(s);
1506 local_irq_restore(flags);
1507#endif
1508}
1509
1510/*
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001511 * Check if the objects in a per cpu structure fit numa
1512 * locality expectations.
1513 */
1514static inline int node_match(struct kmem_cache_cpu *c, int node)
1515{
1516#ifdef CONFIG_NUMA
1517 if (node != -1 && c->node != node)
1518 return 0;
1519#endif
1520 return 1;
1521}
1522
1523/*
Christoph Lameter894b8782007-05-10 03:15:16 -07001524 * Slow path. The lockless freelist is empty or we need to perform
1525 * debugging duties.
Christoph Lameter81819f02007-05-06 14:49:36 -07001526 *
Christoph Lameter894b8782007-05-10 03:15:16 -07001527 * Interrupts are disabled.
Christoph Lameter81819f02007-05-06 14:49:36 -07001528 *
Christoph Lameter894b8782007-05-10 03:15:16 -07001529 * Processing is still very fast if new objects have been freed to the
1530 * regular freelist. In that case we simply take over the regular freelist
1531 * as the lockless freelist and zap the regular freelist.
Christoph Lameter81819f02007-05-06 14:49:36 -07001532 *
Christoph Lameter894b8782007-05-10 03:15:16 -07001533 * If that is not working then we fall back to the partial lists. We take the
1534 * first element of the freelist as the object to allocate now and move the
1535 * rest of the freelist to the lockless freelist.
1536 *
1537 * And if we were unable to get a new slab from the partial slab lists then
Christoph Lameter6446faa2008-02-15 23:45:26 -08001538 * we need to allocate a new slab. This is the slowest path since it involves
1539 * a call to the page allocator and the setup of a new slab.
Christoph Lameter81819f02007-05-06 14:49:36 -07001540 */
Christoph Lameter894b8782007-05-10 03:15:16 -07001541static void *__slab_alloc(struct kmem_cache *s,
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001542 gfp_t gfpflags, int node, void *addr, struct kmem_cache_cpu *c)
Christoph Lameter81819f02007-05-06 14:49:36 -07001543{
Christoph Lameter81819f02007-05-06 14:49:36 -07001544 void **object;
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001545 struct page *new;
Christoph Lameter81819f02007-05-06 14:49:36 -07001546
Linus Torvaldse72e9c22008-03-27 20:56:33 -07001547 /* We handle __GFP_ZERO in the caller */
1548 gfpflags &= ~__GFP_ZERO;
1549
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001550 if (!c->page)
Christoph Lameter81819f02007-05-06 14:49:36 -07001551 goto new_slab;
1552
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001553 slab_lock(c->page);
1554 if (unlikely(!node_match(c, node)))
Christoph Lameter81819f02007-05-06 14:49:36 -07001555 goto another_slab;
Christoph Lameter6446faa2008-02-15 23:45:26 -08001556
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001557 stat(c, ALLOC_REFILL);
Christoph Lameter6446faa2008-02-15 23:45:26 -08001558
Christoph Lameter894b8782007-05-10 03:15:16 -07001559load_freelist:
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001560 object = c->page->freelist;
Christoph Lametera973e9d2008-03-01 13:40:44 -08001561 if (unlikely(!object))
Christoph Lameter81819f02007-05-06 14:49:36 -07001562 goto another_slab;
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001563 if (unlikely(SlabDebug(c->page)))
Christoph Lameter81819f02007-05-06 14:49:36 -07001564 goto debug;
1565
Christoph Lameterb3fba8d2007-10-16 01:26:06 -07001566 c->freelist = object[c->offset];
Christoph Lameter39b26462008-04-14 19:11:30 +03001567 c->page->inuse = c->page->objects;
Christoph Lametera973e9d2008-03-01 13:40:44 -08001568 c->page->freelist = NULL;
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001569 c->node = page_to_nid(c->page);
Christoph Lameter1f842602008-01-07 23:20:30 -08001570unlock_out:
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001571 slab_unlock(c->page);
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001572 stat(c, ALLOC_SLOWPATH);
Christoph Lameter81819f02007-05-06 14:49:36 -07001573 return object;
1574
1575another_slab:
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001576 deactivate_slab(s, c);
Christoph Lameter81819f02007-05-06 14:49:36 -07001577
1578new_slab:
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001579 new = get_partial(s, gfpflags, node);
1580 if (new) {
1581 c->page = new;
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001582 stat(c, ALLOC_FROM_PARTIAL);
Christoph Lameter894b8782007-05-10 03:15:16 -07001583 goto load_freelist;
Christoph Lameter81819f02007-05-06 14:49:36 -07001584 }
1585
Christoph Lameterb811c202007-10-16 23:25:51 -07001586 if (gfpflags & __GFP_WAIT)
1587 local_irq_enable();
1588
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001589 new = new_slab(s, gfpflags, node);
Christoph Lameterb811c202007-10-16 23:25:51 -07001590
1591 if (gfpflags & __GFP_WAIT)
1592 local_irq_disable();
1593
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001594 if (new) {
1595 c = get_cpu_slab(s, smp_processor_id());
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001596 stat(c, ALLOC_SLAB);
Christoph Lameter05aa3452007-11-05 11:31:58 -08001597 if (c->page)
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001598 flush_slab(s, c);
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001599 slab_lock(new);
1600 SetSlabFrozen(new);
1601 c->page = new;
Christoph Lameter4b6f0752007-05-16 22:10:53 -07001602 goto load_freelist;
Christoph Lameter81819f02007-05-06 14:49:36 -07001603 }
Christoph Lameter71c7a062008-02-14 14:28:01 -08001604 return NULL;
Christoph Lameter81819f02007-05-06 14:49:36 -07001605debug:
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001606 if (!alloc_debug_processing(s, c->page, object, addr))
Christoph Lameter81819f02007-05-06 14:49:36 -07001607 goto another_slab;
Christoph Lameter894b8782007-05-10 03:15:16 -07001608
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001609 c->page->inuse++;
Christoph Lameterb3fba8d2007-10-16 01:26:06 -07001610 c->page->freelist = object[c->offset];
Christoph Lameteree3c72a2007-10-16 01:26:07 -07001611 c->node = -1;
Christoph Lameter1f842602008-01-07 23:20:30 -08001612 goto unlock_out;
Christoph Lameter894b8782007-05-10 03:15:16 -07001613}
1614
1615/*
1616 * Inlined fastpath so that allocation functions (kmalloc, kmem_cache_alloc)
1617 * have the fastpath folded into their functions. So no function call
1618 * overhead for requests that can be satisfied on the fastpath.
1619 *
1620 * The fastpath works by first checking if the lockless freelist can be used.
1621 * If not then __slab_alloc is called for slow processing.
1622 *
1623 * Otherwise we can simply pick the next object from the lockless free list.
1624 */
Pekka Enberg06428782008-01-07 23:20:27 -08001625static __always_inline void *slab_alloc(struct kmem_cache *s,
Christoph Lameterce15fea2007-07-17 04:03:28 -07001626 gfp_t gfpflags, int node, void *addr)
Christoph Lameter894b8782007-05-10 03:15:16 -07001627{
Christoph Lameter894b8782007-05-10 03:15:16 -07001628 void **object;
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001629 struct kmem_cache_cpu *c;
Christoph Lameter1f842602008-01-07 23:20:30 -08001630 unsigned long flags;
Dmitry Adamushkobdb21922008-07-10 22:21:58 +02001631 unsigned int objsize;
Christoph Lameter1f842602008-01-07 23:20:30 -08001632
Christoph Lameter894b8782007-05-10 03:15:16 -07001633 local_irq_save(flags);
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001634 c = get_cpu_slab(s, smp_processor_id());
Dmitry Adamushkobdb21922008-07-10 22:21:58 +02001635 objsize = c->objsize;
Christoph Lametera973e9d2008-03-01 13:40:44 -08001636 if (unlikely(!c->freelist || !node_match(c, node)))
Christoph Lameter894b8782007-05-10 03:15:16 -07001637
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001638 object = __slab_alloc(s, gfpflags, node, addr, c);
Christoph Lameter894b8782007-05-10 03:15:16 -07001639
1640 else {
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001641 object = c->freelist;
Christoph Lameterb3fba8d2007-10-16 01:26:06 -07001642 c->freelist = object[c->offset];
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001643 stat(c, ALLOC_FASTPATH);
Christoph Lameter894b8782007-05-10 03:15:16 -07001644 }
1645 local_irq_restore(flags);
Christoph Lameterd07dbea2007-07-17 04:03:23 -07001646
1647 if (unlikely((gfpflags & __GFP_ZERO) && object))
Dmitry Adamushkobdb21922008-07-10 22:21:58 +02001648 memset(object, 0, objsize);
Christoph Lameterd07dbea2007-07-17 04:03:23 -07001649
Christoph Lameter894b8782007-05-10 03:15:16 -07001650 return object;
Christoph Lameter81819f02007-05-06 14:49:36 -07001651}
1652
1653void *kmem_cache_alloc(struct kmem_cache *s, gfp_t gfpflags)
1654{
Christoph Lameterce15fea2007-07-17 04:03:28 -07001655 return slab_alloc(s, gfpflags, -1, __builtin_return_address(0));
Christoph Lameter81819f02007-05-06 14:49:36 -07001656}
1657EXPORT_SYMBOL(kmem_cache_alloc);
1658
1659#ifdef CONFIG_NUMA
1660void *kmem_cache_alloc_node(struct kmem_cache *s, gfp_t gfpflags, int node)
1661{
Christoph Lameterce15fea2007-07-17 04:03:28 -07001662 return slab_alloc(s, gfpflags, node, __builtin_return_address(0));
Christoph Lameter81819f02007-05-06 14:49:36 -07001663}
1664EXPORT_SYMBOL(kmem_cache_alloc_node);
1665#endif
1666
1667/*
Christoph Lameter894b8782007-05-10 03:15:16 -07001668 * Slow patch handling. This may still be called frequently since objects
1669 * have a longer lifetime than the cpu slabs in most processing loads.
Christoph Lameter81819f02007-05-06 14:49:36 -07001670 *
Christoph Lameter894b8782007-05-10 03:15:16 -07001671 * So we still attempt to reduce cache line usage. Just take the slab
1672 * lock and free the item. If there is no additional partial page
1673 * handling required then we can return immediately.
Christoph Lameter81819f02007-05-06 14:49:36 -07001674 */
Christoph Lameter894b8782007-05-10 03:15:16 -07001675static void __slab_free(struct kmem_cache *s, struct page *page,
Christoph Lameterb3fba8d2007-10-16 01:26:06 -07001676 void *x, void *addr, unsigned int offset)
Christoph Lameter81819f02007-05-06 14:49:36 -07001677{
1678 void *prior;
1679 void **object = (void *)x;
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001680 struct kmem_cache_cpu *c;
Christoph Lameter81819f02007-05-06 14:49:36 -07001681
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001682 c = get_cpu_slab(s, raw_smp_processor_id());
1683 stat(c, FREE_SLOWPATH);
Christoph Lameter81819f02007-05-06 14:49:36 -07001684 slab_lock(page);
1685
Christoph Lameter35e5d7e2007-05-09 02:32:42 -07001686 if (unlikely(SlabDebug(page)))
Christoph Lameter81819f02007-05-06 14:49:36 -07001687 goto debug;
Christoph Lameter6446faa2008-02-15 23:45:26 -08001688
Christoph Lameter81819f02007-05-06 14:49:36 -07001689checks_ok:
Christoph Lameterb3fba8d2007-10-16 01:26:06 -07001690 prior = object[offset] = page->freelist;
Christoph Lameter81819f02007-05-06 14:49:36 -07001691 page->freelist = object;
1692 page->inuse--;
1693
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001694 if (unlikely(SlabFrozen(page))) {
1695 stat(c, FREE_FROZEN);
Christoph Lameter81819f02007-05-06 14:49:36 -07001696 goto out_unlock;
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001697 }
Christoph Lameter81819f02007-05-06 14:49:36 -07001698
1699 if (unlikely(!page->inuse))
1700 goto slab_empty;
1701
1702 /*
Christoph Lameter6446faa2008-02-15 23:45:26 -08001703 * Objects left in the slab. If it was not on the partial list before
Christoph Lameter81819f02007-05-06 14:49:36 -07001704 * then add it.
1705 */
Christoph Lametera973e9d2008-03-01 13:40:44 -08001706 if (unlikely(!prior)) {
Christoph Lameter7c2e1322008-01-07 23:20:27 -08001707 add_partial(get_node(s, page_to_nid(page)), page, 1);
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001708 stat(c, FREE_ADD_PARTIAL);
1709 }
Christoph Lameter81819f02007-05-06 14:49:36 -07001710
1711out_unlock:
1712 slab_unlock(page);
Christoph Lameter81819f02007-05-06 14:49:36 -07001713 return;
1714
1715slab_empty:
Christoph Lametera973e9d2008-03-01 13:40:44 -08001716 if (prior) {
Christoph Lameter81819f02007-05-06 14:49:36 -07001717 /*
Christoph Lameter672bba32007-05-09 02:32:39 -07001718 * Slab still on the partial list.
Christoph Lameter81819f02007-05-06 14:49:36 -07001719 */
1720 remove_partial(s, page);
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001721 stat(c, FREE_REMOVE_PARTIAL);
1722 }
Christoph Lameter81819f02007-05-06 14:49:36 -07001723 slab_unlock(page);
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001724 stat(c, FREE_SLAB);
Christoph Lameter81819f02007-05-06 14:49:36 -07001725 discard_slab(s, page);
Christoph Lameter81819f02007-05-06 14:49:36 -07001726 return;
1727
1728debug:
Christoph Lameter3ec09742007-05-16 22:11:00 -07001729 if (!free_debug_processing(s, page, x, addr))
Christoph Lameter77c5e2d2007-05-06 14:49:42 -07001730 goto out_unlock;
Christoph Lameter77c5e2d2007-05-06 14:49:42 -07001731 goto checks_ok;
Christoph Lameter81819f02007-05-06 14:49:36 -07001732}
1733
Christoph Lameter894b8782007-05-10 03:15:16 -07001734/*
1735 * Fastpath with forced inlining to produce a kfree and kmem_cache_free that
1736 * can perform fastpath freeing without additional function calls.
1737 *
1738 * The fastpath is only possible if we are freeing to the current cpu slab
1739 * of this processor. This typically the case if we have just allocated
1740 * the item before.
1741 *
1742 * If fastpath is not possible then fall back to __slab_free where we deal
1743 * with all sorts of special processing.
1744 */
Pekka Enberg06428782008-01-07 23:20:27 -08001745static __always_inline void slab_free(struct kmem_cache *s,
Christoph Lameter894b8782007-05-10 03:15:16 -07001746 struct page *page, void *x, void *addr)
1747{
1748 void **object = (void *)x;
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001749 struct kmem_cache_cpu *c;
Christoph Lameter1f842602008-01-07 23:20:30 -08001750 unsigned long flags;
1751
Christoph Lameter894b8782007-05-10 03:15:16 -07001752 local_irq_save(flags);
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001753 c = get_cpu_slab(s, smp_processor_id());
Christoph Lameter27d9e4e2008-02-15 23:45:25 -08001754 debug_check_no_locks_freed(object, c->objsize);
Thomas Gleixner3ac7fe52008-04-30 00:55:01 -07001755 if (!(s->flags & SLAB_DEBUG_OBJECTS))
1756 debug_check_no_obj_freed(object, s->objsize);
Christoph Lameteree3c72a2007-10-16 01:26:07 -07001757 if (likely(page == c->page && c->node >= 0)) {
Christoph Lameterb3fba8d2007-10-16 01:26:06 -07001758 object[c->offset] = c->freelist;
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001759 c->freelist = object;
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08001760 stat(c, FREE_FASTPATH);
Christoph Lameter894b8782007-05-10 03:15:16 -07001761 } else
Christoph Lameterb3fba8d2007-10-16 01:26:06 -07001762 __slab_free(s, page, x, addr, c->offset);
Christoph Lameter894b8782007-05-10 03:15:16 -07001763
1764 local_irq_restore(flags);
1765}
1766
Christoph Lameter81819f02007-05-06 14:49:36 -07001767void kmem_cache_free(struct kmem_cache *s, void *x)
1768{
Christoph Lameter77c5e2d2007-05-06 14:49:42 -07001769 struct page *page;
Christoph Lameter81819f02007-05-06 14:49:36 -07001770
Christoph Lameterb49af682007-05-06 14:49:41 -07001771 page = virt_to_head_page(x);
Christoph Lameter81819f02007-05-06 14:49:36 -07001772
Christoph Lameter77c5e2d2007-05-06 14:49:42 -07001773 slab_free(s, page, x, __builtin_return_address(0));
Christoph Lameter81819f02007-05-06 14:49:36 -07001774}
1775EXPORT_SYMBOL(kmem_cache_free);
1776
1777/* Figure out on which slab object the object resides */
1778static struct page *get_object_page(const void *x)
1779{
Christoph Lameterb49af682007-05-06 14:49:41 -07001780 struct page *page = virt_to_head_page(x);
Christoph Lameter81819f02007-05-06 14:49:36 -07001781
1782 if (!PageSlab(page))
1783 return NULL;
1784
1785 return page;
1786}
1787
1788/*
Christoph Lameter672bba32007-05-09 02:32:39 -07001789 * Object placement in a slab is made very easy because we always start at
1790 * offset 0. If we tune the size of the object to the alignment then we can
1791 * get the required alignment by putting one properly sized object after
1792 * another.
Christoph Lameter81819f02007-05-06 14:49:36 -07001793 *
1794 * Notice that the allocation order determines the sizes of the per cpu
1795 * caches. Each processor has always one slab available for allocations.
1796 * Increasing the allocation order reduces the number of times that slabs
Christoph Lameter672bba32007-05-09 02:32:39 -07001797 * must be moved on and off the partial lists and is therefore a factor in
Christoph Lameter81819f02007-05-06 14:49:36 -07001798 * locking overhead.
Christoph Lameter81819f02007-05-06 14:49:36 -07001799 */
1800
1801/*
1802 * Mininum / Maximum order of slab pages. This influences locking overhead
1803 * and slab fragmentation. A higher order reduces the number of partial slabs
1804 * and increases the number of allocations possible without having to
1805 * take the list_lock.
1806 */
1807static int slub_min_order;
Christoph Lameter114e9e82008-04-14 19:11:41 +03001808static int slub_max_order = PAGE_ALLOC_COSTLY_ORDER;
Christoph Lameter9b2cd502008-04-14 19:11:41 +03001809static int slub_min_objects;
Christoph Lameter81819f02007-05-06 14:49:36 -07001810
1811/*
1812 * Merge control. If this is set then no merging of slab caches will occur.
Christoph Lameter672bba32007-05-09 02:32:39 -07001813 * (Could be removed. This was introduced to pacify the merge skeptics.)
Christoph Lameter81819f02007-05-06 14:49:36 -07001814 */
1815static int slub_nomerge;
1816
1817/*
Christoph Lameter81819f02007-05-06 14:49:36 -07001818 * Calculate the order of allocation given an slab object size.
1819 *
Christoph Lameter672bba32007-05-09 02:32:39 -07001820 * The order of allocation has significant impact on performance and other
1821 * system components. Generally order 0 allocations should be preferred since
1822 * order 0 does not cause fragmentation in the page allocator. Larger objects
1823 * be problematic to put into order 0 slabs because there may be too much
Christoph Lameterc124f5b2008-04-14 19:13:29 +03001824 * unused space left. We go to a higher order if more than 1/16th of the slab
Christoph Lameter672bba32007-05-09 02:32:39 -07001825 * would be wasted.
Christoph Lameter81819f02007-05-06 14:49:36 -07001826 *
Christoph Lameter672bba32007-05-09 02:32:39 -07001827 * In order to reach satisfactory performance we must ensure that a minimum
1828 * number of objects is in one slab. Otherwise we may generate too much
1829 * activity on the partial lists which requires taking the list_lock. This is
1830 * less a concern for large slabs though which are rarely used.
Christoph Lameter81819f02007-05-06 14:49:36 -07001831 *
Christoph Lameter672bba32007-05-09 02:32:39 -07001832 * slub_max_order specifies the order where we begin to stop considering the
1833 * number of objects in a slab as critical. If we reach slub_max_order then
1834 * we try to keep the page order as low as possible. So we accept more waste
1835 * of space in favor of a small page order.
1836 *
1837 * Higher order allocations also allow the placement of more objects in a
1838 * slab and thereby reduce object handling overhead. If the user has
1839 * requested a higher mininum order then we start with that one instead of
1840 * the smallest order which will fit the object.
Christoph Lameter81819f02007-05-06 14:49:36 -07001841 */
Christoph Lameter5e6d4442007-05-09 02:32:46 -07001842static inline int slab_order(int size, int min_objects,
1843 int max_order, int fract_leftover)
Christoph Lameter81819f02007-05-06 14:49:36 -07001844{
1845 int order;
1846 int rem;
Christoph Lameter6300ea72007-07-17 04:03:20 -07001847 int min_order = slub_min_order;
Christoph Lameter81819f02007-05-06 14:49:36 -07001848
Christoph Lameter39b26462008-04-14 19:11:30 +03001849 if ((PAGE_SIZE << min_order) / size > 65535)
1850 return get_order(size * 65535) - 1;
1851
Christoph Lameter6300ea72007-07-17 04:03:20 -07001852 for (order = max(min_order,
Christoph Lameter5e6d4442007-05-09 02:32:46 -07001853 fls(min_objects * size - 1) - PAGE_SHIFT);
1854 order <= max_order; order++) {
1855
Christoph Lameter81819f02007-05-06 14:49:36 -07001856 unsigned long slab_size = PAGE_SIZE << order;
1857
Christoph Lameter5e6d4442007-05-09 02:32:46 -07001858 if (slab_size < min_objects * size)
Christoph Lameter81819f02007-05-06 14:49:36 -07001859 continue;
1860
Christoph Lameter81819f02007-05-06 14:49:36 -07001861 rem = slab_size % size;
1862
Christoph Lameter5e6d4442007-05-09 02:32:46 -07001863 if (rem <= slab_size / fract_leftover)
Christoph Lameter81819f02007-05-06 14:49:36 -07001864 break;
1865
1866 }
Christoph Lameter672bba32007-05-09 02:32:39 -07001867
Christoph Lameter81819f02007-05-06 14:49:36 -07001868 return order;
1869}
1870
Christoph Lameter5e6d4442007-05-09 02:32:46 -07001871static inline int calculate_order(int size)
1872{
1873 int order;
1874 int min_objects;
1875 int fraction;
1876
1877 /*
1878 * Attempt to find best configuration for a slab. This
1879 * works by first attempting to generate a layout with
1880 * the best configuration and backing off gradually.
1881 *
1882 * First we reduce the acceptable waste in a slab. Then
1883 * we reduce the minimum objects required in a slab.
1884 */
1885 min_objects = slub_min_objects;
Christoph Lameter9b2cd502008-04-14 19:11:41 +03001886 if (!min_objects)
1887 min_objects = 4 * (fls(nr_cpu_ids) + 1);
Christoph Lameter5e6d4442007-05-09 02:32:46 -07001888 while (min_objects > 1) {
Christoph Lameterc124f5b2008-04-14 19:13:29 +03001889 fraction = 16;
Christoph Lameter5e6d4442007-05-09 02:32:46 -07001890 while (fraction >= 4) {
1891 order = slab_order(size, min_objects,
1892 slub_max_order, fraction);
1893 if (order <= slub_max_order)
1894 return order;
1895 fraction /= 2;
1896 }
1897 min_objects /= 2;
1898 }
1899
1900 /*
1901 * We were unable to place multiple objects in a slab. Now
1902 * lets see if we can place a single object there.
1903 */
1904 order = slab_order(size, 1, slub_max_order, 1);
1905 if (order <= slub_max_order)
1906 return order;
1907
1908 /*
1909 * Doh this slab cannot be placed using slub_max_order.
1910 */
1911 order = slab_order(size, 1, MAX_ORDER, 1);
1912 if (order <= MAX_ORDER)
1913 return order;
1914 return -ENOSYS;
1915}
1916
Christoph Lameter81819f02007-05-06 14:49:36 -07001917/*
Christoph Lameter672bba32007-05-09 02:32:39 -07001918 * Figure out what the alignment of the objects will be.
Christoph Lameter81819f02007-05-06 14:49:36 -07001919 */
1920static unsigned long calculate_alignment(unsigned long flags,
1921 unsigned long align, unsigned long size)
1922{
1923 /*
Christoph Lameter6446faa2008-02-15 23:45:26 -08001924 * If the user wants hardware cache aligned objects then follow that
1925 * suggestion if the object is sufficiently large.
Christoph Lameter81819f02007-05-06 14:49:36 -07001926 *
Christoph Lameter6446faa2008-02-15 23:45:26 -08001927 * The hardware cache alignment cannot override the specified
1928 * alignment though. If that is greater then use it.
Christoph Lameter81819f02007-05-06 14:49:36 -07001929 */
Nick Pigginb6210382008-03-05 14:05:56 -08001930 if (flags & SLAB_HWCACHE_ALIGN) {
1931 unsigned long ralign = cache_line_size();
1932 while (size <= ralign / 2)
1933 ralign /= 2;
1934 align = max(align, ralign);
1935 }
Christoph Lameter81819f02007-05-06 14:49:36 -07001936
1937 if (align < ARCH_SLAB_MINALIGN)
Nick Pigginb6210382008-03-05 14:05:56 -08001938 align = ARCH_SLAB_MINALIGN;
Christoph Lameter81819f02007-05-06 14:49:36 -07001939
1940 return ALIGN(align, sizeof(void *));
1941}
1942
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001943static void init_kmem_cache_cpu(struct kmem_cache *s,
1944 struct kmem_cache_cpu *c)
1945{
1946 c->page = NULL;
Christoph Lametera973e9d2008-03-01 13:40:44 -08001947 c->freelist = NULL;
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001948 c->node = 0;
Christoph Lameter42a9fdb2007-10-16 01:26:09 -07001949 c->offset = s->offset / sizeof(void *);
1950 c->objsize = s->objsize;
Pekka Enberg62f75532008-04-14 18:50:44 +03001951#ifdef CONFIG_SLUB_STATS
1952 memset(c->stat, 0, NR_SLUB_STAT_ITEMS * sizeof(unsigned));
1953#endif
Christoph Lameterdfb4f092007-10-16 01:26:05 -07001954}
1955
Christoph Lameter81819f02007-05-06 14:49:36 -07001956static void init_kmem_cache_node(struct kmem_cache_node *n)
1957{
1958 n->nr_partial = 0;
Christoph Lameter81819f02007-05-06 14:49:36 -07001959 spin_lock_init(&n->list_lock);
1960 INIT_LIST_HEAD(&n->partial);
Christoph Lameter8ab13722007-07-17 04:03:32 -07001961#ifdef CONFIG_SLUB_DEBUG
Christoph Lameter0f389ec2008-04-14 18:53:02 +03001962 atomic_long_set(&n->nr_slabs, 0);
Christoph Lameter643b1132007-05-06 14:49:42 -07001963 INIT_LIST_HEAD(&n->full);
Christoph Lameter8ab13722007-07-17 04:03:32 -07001964#endif
Christoph Lameter81819f02007-05-06 14:49:36 -07001965}
1966
Christoph Lameter4c93c3552007-10-16 01:26:08 -07001967#ifdef CONFIG_SMP
1968/*
1969 * Per cpu array for per cpu structures.
1970 *
1971 * The per cpu array places all kmem_cache_cpu structures from one processor
1972 * close together meaning that it becomes possible that multiple per cpu
1973 * structures are contained in one cacheline. This may be particularly
1974 * beneficial for the kmalloc caches.
1975 *
1976 * A desktop system typically has around 60-80 slabs. With 100 here we are
1977 * likely able to get per cpu structures for all caches from the array defined
1978 * here. We must be able to cover all kmalloc caches during bootstrap.
1979 *
1980 * If the per cpu array is exhausted then fall back to kmalloc
1981 * of individual cachelines. No sharing is possible then.
1982 */
1983#define NR_KMEM_CACHE_CPU 100
1984
1985static DEFINE_PER_CPU(struct kmem_cache_cpu,
1986 kmem_cache_cpu)[NR_KMEM_CACHE_CPU];
1987
1988static DEFINE_PER_CPU(struct kmem_cache_cpu *, kmem_cache_cpu_free);
1989static cpumask_t kmem_cach_cpu_free_init_once = CPU_MASK_NONE;
1990
1991static struct kmem_cache_cpu *alloc_kmem_cache_cpu(struct kmem_cache *s,
1992 int cpu, gfp_t flags)
1993{
1994 struct kmem_cache_cpu *c = per_cpu(kmem_cache_cpu_free, cpu);
1995
1996 if (c)
1997 per_cpu(kmem_cache_cpu_free, cpu) =
1998 (void *)c->freelist;
1999 else {
2000 /* Table overflow: So allocate ourselves */
2001 c = kmalloc_node(
2002 ALIGN(sizeof(struct kmem_cache_cpu), cache_line_size()),
2003 flags, cpu_to_node(cpu));
2004 if (!c)
2005 return NULL;
2006 }
2007
2008 init_kmem_cache_cpu(s, c);
2009 return c;
2010}
2011
2012static void free_kmem_cache_cpu(struct kmem_cache_cpu *c, int cpu)
2013{
2014 if (c < per_cpu(kmem_cache_cpu, cpu) ||
2015 c > per_cpu(kmem_cache_cpu, cpu) + NR_KMEM_CACHE_CPU) {
2016 kfree(c);
2017 return;
2018 }
2019 c->freelist = (void *)per_cpu(kmem_cache_cpu_free, cpu);
2020 per_cpu(kmem_cache_cpu_free, cpu) = c;
2021}
2022
2023static void free_kmem_cache_cpus(struct kmem_cache *s)
2024{
2025 int cpu;
2026
2027 for_each_online_cpu(cpu) {
2028 struct kmem_cache_cpu *c = get_cpu_slab(s, cpu);
2029
2030 if (c) {
2031 s->cpu_slab[cpu] = NULL;
2032 free_kmem_cache_cpu(c, cpu);
2033 }
2034 }
2035}
2036
2037static int alloc_kmem_cache_cpus(struct kmem_cache *s, gfp_t flags)
2038{
2039 int cpu;
2040
2041 for_each_online_cpu(cpu) {
2042 struct kmem_cache_cpu *c = get_cpu_slab(s, cpu);
2043
2044 if (c)
2045 continue;
2046
2047 c = alloc_kmem_cache_cpu(s, cpu, flags);
2048 if (!c) {
2049 free_kmem_cache_cpus(s);
2050 return 0;
2051 }
2052 s->cpu_slab[cpu] = c;
2053 }
2054 return 1;
2055}
2056
2057/*
2058 * Initialize the per cpu array.
2059 */
2060static void init_alloc_cpu_cpu(int cpu)
2061{
2062 int i;
2063
2064 if (cpu_isset(cpu, kmem_cach_cpu_free_init_once))
2065 return;
2066
2067 for (i = NR_KMEM_CACHE_CPU - 1; i >= 0; i--)
2068 free_kmem_cache_cpu(&per_cpu(kmem_cache_cpu, cpu)[i], cpu);
2069
2070 cpu_set(cpu, kmem_cach_cpu_free_init_once);
2071}
2072
2073static void __init init_alloc_cpu(void)
2074{
2075 int cpu;
2076
2077 for_each_online_cpu(cpu)
2078 init_alloc_cpu_cpu(cpu);
2079 }
2080
2081#else
2082static inline void free_kmem_cache_cpus(struct kmem_cache *s) {}
2083static inline void init_alloc_cpu(void) {}
2084
2085static inline int alloc_kmem_cache_cpus(struct kmem_cache *s, gfp_t flags)
2086{
2087 init_kmem_cache_cpu(s, &s->cpu_slab);
2088 return 1;
2089}
2090#endif
2091
Christoph Lameter81819f02007-05-06 14:49:36 -07002092#ifdef CONFIG_NUMA
2093/*
2094 * No kmalloc_node yet so do it by hand. We know that this is the first
2095 * slab on the node for this slabcache. There are no concurrent accesses
2096 * possible.
2097 *
2098 * Note that this function only works on the kmalloc_node_cache
Christoph Lameter4c93c3552007-10-16 01:26:08 -07002099 * when allocating for the kmalloc_node_cache. This is used for bootstrapping
2100 * memory on a fresh node that has no slab structures yet.
Christoph Lameter81819f02007-05-06 14:49:36 -07002101 */
Adrian Bunk1cd7daa2007-10-16 01:24:18 -07002102static struct kmem_cache_node *early_kmem_cache_node_alloc(gfp_t gfpflags,
2103 int node)
Christoph Lameter81819f02007-05-06 14:49:36 -07002104{
2105 struct page *page;
2106 struct kmem_cache_node *n;
rootba84c732008-01-07 23:20:28 -08002107 unsigned long flags;
Christoph Lameter81819f02007-05-06 14:49:36 -07002108
2109 BUG_ON(kmalloc_caches->size < sizeof(struct kmem_cache_node));
2110
Christoph Lametera2f92ee2007-08-22 14:01:57 -07002111 page = new_slab(kmalloc_caches, gfpflags, node);
Christoph Lameter81819f02007-05-06 14:49:36 -07002112
2113 BUG_ON(!page);
Christoph Lametera2f92ee2007-08-22 14:01:57 -07002114 if (page_to_nid(page) != node) {
2115 printk(KERN_ERR "SLUB: Unable to allocate memory from "
2116 "node %d\n", node);
2117 printk(KERN_ERR "SLUB: Allocating a useless per node structure "
2118 "in order to be able to continue\n");
2119 }
2120
Christoph Lameter81819f02007-05-06 14:49:36 -07002121 n = page->freelist;
2122 BUG_ON(!n);
2123 page->freelist = get_freepointer(kmalloc_caches, n);
2124 page->inuse++;
2125 kmalloc_caches->node[node] = n;
Christoph Lameter8ab13722007-07-17 04:03:32 -07002126#ifdef CONFIG_SLUB_DEBUG
Christoph Lameterd45f39c2007-07-17 04:03:21 -07002127 init_object(kmalloc_caches, n, 1);
2128 init_tracking(kmalloc_caches, n);
Christoph Lameter8ab13722007-07-17 04:03:32 -07002129#endif
Christoph Lameter81819f02007-05-06 14:49:36 -07002130 init_kmem_cache_node(n);
Christoph Lameter205ab992008-04-14 19:11:40 +03002131 inc_slabs_node(kmalloc_caches, node, page->objects);
Christoph Lameter6446faa2008-02-15 23:45:26 -08002132
rootba84c732008-01-07 23:20:28 -08002133 /*
2134 * lockdep requires consistent irq usage for each lock
2135 * so even though there cannot be a race this early in
2136 * the boot sequence, we still disable irqs.
2137 */
2138 local_irq_save(flags);
Christoph Lameter7c2e1322008-01-07 23:20:27 -08002139 add_partial(n, page, 0);
rootba84c732008-01-07 23:20:28 -08002140 local_irq_restore(flags);
Christoph Lameter81819f02007-05-06 14:49:36 -07002141 return n;
2142}
2143
2144static void free_kmem_cache_nodes(struct kmem_cache *s)
2145{
2146 int node;
2147
Christoph Lameterf64dc582007-10-16 01:25:33 -07002148 for_each_node_state(node, N_NORMAL_MEMORY) {
Christoph Lameter81819f02007-05-06 14:49:36 -07002149 struct kmem_cache_node *n = s->node[node];
2150 if (n && n != &s->local_node)
2151 kmem_cache_free(kmalloc_caches, n);
2152 s->node[node] = NULL;
2153 }
2154}
2155
2156static int init_kmem_cache_nodes(struct kmem_cache *s, gfp_t gfpflags)
2157{
2158 int node;
2159 int local_node;
2160
2161 if (slab_state >= UP)
2162 local_node = page_to_nid(virt_to_page(s));
2163 else
2164 local_node = 0;
2165
Christoph Lameterf64dc582007-10-16 01:25:33 -07002166 for_each_node_state(node, N_NORMAL_MEMORY) {
Christoph Lameter81819f02007-05-06 14:49:36 -07002167 struct kmem_cache_node *n;
2168
2169 if (local_node == node)
2170 n = &s->local_node;
2171 else {
2172 if (slab_state == DOWN) {
2173 n = early_kmem_cache_node_alloc(gfpflags,
2174 node);
2175 continue;
2176 }
2177 n = kmem_cache_alloc_node(kmalloc_caches,
2178 gfpflags, node);
2179
2180 if (!n) {
2181 free_kmem_cache_nodes(s);
2182 return 0;
2183 }
2184
2185 }
2186 s->node[node] = n;
2187 init_kmem_cache_node(n);
2188 }
2189 return 1;
2190}
2191#else
2192static void free_kmem_cache_nodes(struct kmem_cache *s)
2193{
2194}
2195
2196static int init_kmem_cache_nodes(struct kmem_cache *s, gfp_t gfpflags)
2197{
2198 init_kmem_cache_node(&s->local_node);
2199 return 1;
2200}
2201#endif
2202
2203/*
2204 * calculate_sizes() determines the order and the distribution of data within
2205 * a slab object.
2206 */
Christoph Lameter06b285d2008-04-14 19:11:41 +03002207static int calculate_sizes(struct kmem_cache *s, int forced_order)
Christoph Lameter81819f02007-05-06 14:49:36 -07002208{
2209 unsigned long flags = s->flags;
2210 unsigned long size = s->objsize;
2211 unsigned long align = s->align;
Christoph Lameter834f3d12008-04-14 19:11:31 +03002212 int order;
Christoph Lameter81819f02007-05-06 14:49:36 -07002213
2214 /*
Christoph Lameterd8b42bf2008-02-15 23:45:25 -08002215 * Round up object size to the next word boundary. We can only
2216 * place the free pointer at word boundaries and this determines
2217 * the possible location of the free pointer.
2218 */
2219 size = ALIGN(size, sizeof(void *));
2220
2221#ifdef CONFIG_SLUB_DEBUG
2222 /*
Christoph Lameter81819f02007-05-06 14:49:36 -07002223 * Determine if we can poison the object itself. If the user of
2224 * the slab may touch the object after free or before allocation
2225 * then we should never poison the object itself.
2226 */
2227 if ((flags & SLAB_POISON) && !(flags & SLAB_DESTROY_BY_RCU) &&
Christoph Lameterc59def92007-05-16 22:10:50 -07002228 !s->ctor)
Christoph Lameter81819f02007-05-06 14:49:36 -07002229 s->flags |= __OBJECT_POISON;
2230 else
2231 s->flags &= ~__OBJECT_POISON;
2232
Christoph Lameter81819f02007-05-06 14:49:36 -07002233
2234 /*
Christoph Lameter672bba32007-05-09 02:32:39 -07002235 * If we are Redzoning then check if there is some space between the
Christoph Lameter81819f02007-05-06 14:49:36 -07002236 * end of the object and the free pointer. If not then add an
Christoph Lameter672bba32007-05-09 02:32:39 -07002237 * additional word to have some bytes to store Redzone information.
Christoph Lameter81819f02007-05-06 14:49:36 -07002238 */
2239 if ((flags & SLAB_RED_ZONE) && size == s->objsize)
2240 size += sizeof(void *);
Christoph Lameter41ecc552007-05-09 02:32:44 -07002241#endif
Christoph Lameter81819f02007-05-06 14:49:36 -07002242
2243 /*
Christoph Lameter672bba32007-05-09 02:32:39 -07002244 * With that we have determined the number of bytes in actual use
2245 * by the object. This is the potential offset to the free pointer.
Christoph Lameter81819f02007-05-06 14:49:36 -07002246 */
2247 s->inuse = size;
2248
2249 if (((flags & (SLAB_DESTROY_BY_RCU | SLAB_POISON)) ||
Christoph Lameterc59def92007-05-16 22:10:50 -07002250 s->ctor)) {
Christoph Lameter81819f02007-05-06 14:49:36 -07002251 /*
2252 * Relocate free pointer after the object if it is not
2253 * permitted to overwrite the first word of the object on
2254 * kmem_cache_free.
2255 *
2256 * This is the case if we do RCU, have a constructor or
2257 * destructor or are poisoning the objects.
2258 */
2259 s->offset = size;
2260 size += sizeof(void *);
2261 }
2262
Christoph Lameterc12b3c62007-05-23 13:57:31 -07002263#ifdef CONFIG_SLUB_DEBUG
Christoph Lameter81819f02007-05-06 14:49:36 -07002264 if (flags & SLAB_STORE_USER)
2265 /*
2266 * Need to store information about allocs and frees after
2267 * the object.
2268 */
2269 size += 2 * sizeof(struct track);
2270
Christoph Lameterbe7b3fb2007-05-09 02:32:36 -07002271 if (flags & SLAB_RED_ZONE)
Christoph Lameter81819f02007-05-06 14:49:36 -07002272 /*
2273 * Add some empty padding so that we can catch
2274 * overwrites from earlier objects rather than let
2275 * tracking information or the free pointer be
2276 * corrupted if an user writes before the start
2277 * of the object.
2278 */
2279 size += sizeof(void *);
Christoph Lameter41ecc552007-05-09 02:32:44 -07002280#endif
Christoph Lameter672bba32007-05-09 02:32:39 -07002281
Christoph Lameter81819f02007-05-06 14:49:36 -07002282 /*
2283 * Determine the alignment based on various parameters that the
Christoph Lameter65c02d42007-05-09 02:32:35 -07002284 * user specified and the dynamic determination of cache line size
2285 * on bootup.
Christoph Lameter81819f02007-05-06 14:49:36 -07002286 */
2287 align = calculate_alignment(flags, align, s->objsize);
2288
2289 /*
2290 * SLUB stores one object immediately after another beginning from
2291 * offset 0. In order to align the objects we have to simply size
2292 * each object to conform to the alignment.
2293 */
2294 size = ALIGN(size, align);
2295 s->size = size;
Christoph Lameter06b285d2008-04-14 19:11:41 +03002296 if (forced_order >= 0)
2297 order = forced_order;
2298 else
2299 order = calculate_order(size);
Christoph Lameter81819f02007-05-06 14:49:36 -07002300
Christoph Lameter834f3d12008-04-14 19:11:31 +03002301 if (order < 0)
Christoph Lameter81819f02007-05-06 14:49:36 -07002302 return 0;
2303
Christoph Lameterb7a49f02008-02-14 14:21:32 -08002304 s->allocflags = 0;
Christoph Lameter834f3d12008-04-14 19:11:31 +03002305 if (order)
Christoph Lameterb7a49f02008-02-14 14:21:32 -08002306 s->allocflags |= __GFP_COMP;
2307
2308 if (s->flags & SLAB_CACHE_DMA)
2309 s->allocflags |= SLUB_DMA;
2310
2311 if (s->flags & SLAB_RECLAIM_ACCOUNT)
2312 s->allocflags |= __GFP_RECLAIMABLE;
2313
Christoph Lameter81819f02007-05-06 14:49:36 -07002314 /*
2315 * Determine the number of objects per slab
2316 */
Christoph Lameter834f3d12008-04-14 19:11:31 +03002317 s->oo = oo_make(order, size);
Christoph Lameter65c33762008-04-14 19:11:40 +03002318 s->min = oo_make(get_order(size), size);
Christoph Lameter205ab992008-04-14 19:11:40 +03002319 if (oo_objects(s->oo) > oo_objects(s->max))
2320 s->max = s->oo;
Christoph Lameter81819f02007-05-06 14:49:36 -07002321
Christoph Lameter834f3d12008-04-14 19:11:31 +03002322 return !!oo_objects(s->oo);
Christoph Lameter81819f02007-05-06 14:49:36 -07002323
2324}
2325
Christoph Lameter81819f02007-05-06 14:49:36 -07002326static int kmem_cache_open(struct kmem_cache *s, gfp_t gfpflags,
2327 const char *name, size_t size,
2328 size_t align, unsigned long flags,
Christoph Lameter4ba9b9d2007-10-16 23:25:51 -07002329 void (*ctor)(struct kmem_cache *, void *))
Christoph Lameter81819f02007-05-06 14:49:36 -07002330{
2331 memset(s, 0, kmem_size);
2332 s->name = name;
2333 s->ctor = ctor;
Christoph Lameter81819f02007-05-06 14:49:36 -07002334 s->objsize = size;
Christoph Lameter81819f02007-05-06 14:49:36 -07002335 s->align = align;
Christoph Lameterba0268a2007-09-11 15:24:11 -07002336 s->flags = kmem_cache_flags(size, flags, name, ctor);
Christoph Lameter81819f02007-05-06 14:49:36 -07002337
Christoph Lameter06b285d2008-04-14 19:11:41 +03002338 if (!calculate_sizes(s, -1))
Christoph Lameter81819f02007-05-06 14:49:36 -07002339 goto error;
2340
2341 s->refcount = 1;
2342#ifdef CONFIG_NUMA
Christoph Lameter98246012008-01-07 23:20:26 -08002343 s->remote_node_defrag_ratio = 100;
Christoph Lameter81819f02007-05-06 14:49:36 -07002344#endif
Christoph Lameterdfb4f092007-10-16 01:26:05 -07002345 if (!init_kmem_cache_nodes(s, gfpflags & ~SLUB_DMA))
2346 goto error;
Christoph Lameter81819f02007-05-06 14:49:36 -07002347
Christoph Lameterdfb4f092007-10-16 01:26:05 -07002348 if (alloc_kmem_cache_cpus(s, gfpflags & ~SLUB_DMA))
Christoph Lameter81819f02007-05-06 14:49:36 -07002349 return 1;
Christoph Lameter4c93c3552007-10-16 01:26:08 -07002350 free_kmem_cache_nodes(s);
Christoph Lameter81819f02007-05-06 14:49:36 -07002351error:
2352 if (flags & SLAB_PANIC)
2353 panic("Cannot create slab %s size=%lu realsize=%u "
2354 "order=%u offset=%u flags=%lx\n",
Christoph Lameter834f3d12008-04-14 19:11:31 +03002355 s->name, (unsigned long)size, s->size, oo_order(s->oo),
Christoph Lameter81819f02007-05-06 14:49:36 -07002356 s->offset, flags);
2357 return 0;
2358}
Christoph Lameter81819f02007-05-06 14:49:36 -07002359
2360/*
2361 * Check if a given pointer is valid
2362 */
2363int kmem_ptr_validate(struct kmem_cache *s, const void *object)
2364{
Pekka Enberg06428782008-01-07 23:20:27 -08002365 struct page *page;
Christoph Lameter81819f02007-05-06 14:49:36 -07002366
2367 page = get_object_page(object);
2368
2369 if (!page || s != page->slab)
2370 /* No slab or wrong slab */
2371 return 0;
2372
Christoph Lameterabcd08a2007-05-09 02:32:37 -07002373 if (!check_valid_pointer(s, page, object))
Christoph Lameter81819f02007-05-06 14:49:36 -07002374 return 0;
2375
2376 /*
2377 * We could also check if the object is on the slabs freelist.
2378 * But this would be too expensive and it seems that the main
Christoph Lameter6446faa2008-02-15 23:45:26 -08002379 * purpose of kmem_ptr_valid() is to check if the object belongs
Christoph Lameter81819f02007-05-06 14:49:36 -07002380 * to a certain slab.
2381 */
2382 return 1;
2383}
2384EXPORT_SYMBOL(kmem_ptr_validate);
2385
2386/*
2387 * Determine the size of a slab object
2388 */
2389unsigned int kmem_cache_size(struct kmem_cache *s)
2390{
2391 return s->objsize;
2392}
2393EXPORT_SYMBOL(kmem_cache_size);
2394
2395const char *kmem_cache_name(struct kmem_cache *s)
2396{
2397 return s->name;
2398}
2399EXPORT_SYMBOL(kmem_cache_name);
2400
Christoph Lameter33b12c32008-04-25 12:22:43 -07002401static void list_slab_objects(struct kmem_cache *s, struct page *page,
2402 const char *text)
Christoph Lameter81819f02007-05-06 14:49:36 -07002403{
Christoph Lameter33b12c32008-04-25 12:22:43 -07002404#ifdef CONFIG_SLUB_DEBUG
2405 void *addr = page_address(page);
2406 void *p;
2407 DECLARE_BITMAP(map, page->objects);
2408
2409 bitmap_zero(map, page->objects);
2410 slab_err(s, page, "%s", text);
2411 slab_lock(page);
2412 for_each_free_object(p, s, page->freelist)
2413 set_bit(slab_index(p, s, addr), map);
2414
2415 for_each_object(p, s, addr, page->objects) {
2416
2417 if (!test_bit(slab_index(p, s, addr), map)) {
2418 printk(KERN_ERR "INFO: Object 0x%p @offset=%tu\n",
2419 p, p - addr);
2420 print_tracking(s, p);
2421 }
2422 }
2423 slab_unlock(page);
2424#endif
2425}
2426
Christoph Lameter81819f02007-05-06 14:49:36 -07002427/*
Christoph Lameter599870b2008-04-23 12:36:52 -07002428 * Attempt to free all partial slabs on a node.
Christoph Lameter81819f02007-05-06 14:49:36 -07002429 */
Christoph Lameter599870b2008-04-23 12:36:52 -07002430static void free_partial(struct kmem_cache *s, struct kmem_cache_node *n)
Christoph Lameter81819f02007-05-06 14:49:36 -07002431{
Christoph Lameter81819f02007-05-06 14:49:36 -07002432 unsigned long flags;
2433 struct page *page, *h;
2434
2435 spin_lock_irqsave(&n->list_lock, flags);
Christoph Lameter33b12c32008-04-25 12:22:43 -07002436 list_for_each_entry_safe(page, h, &n->partial, lru) {
Christoph Lameter81819f02007-05-06 14:49:36 -07002437 if (!page->inuse) {
2438 list_del(&page->lru);
2439 discard_slab(s, page);
Christoph Lameter599870b2008-04-23 12:36:52 -07002440 n->nr_partial--;
Christoph Lameter33b12c32008-04-25 12:22:43 -07002441 } else {
2442 list_slab_objects(s, page,
2443 "Objects remaining on kmem_cache_close()");
Christoph Lameter599870b2008-04-23 12:36:52 -07002444 }
Christoph Lameter33b12c32008-04-25 12:22:43 -07002445 }
Christoph Lameter81819f02007-05-06 14:49:36 -07002446 spin_unlock_irqrestore(&n->list_lock, flags);
Christoph Lameter81819f02007-05-06 14:49:36 -07002447}
2448
2449/*
Christoph Lameter672bba32007-05-09 02:32:39 -07002450 * Release all resources used by a slab cache.
Christoph Lameter81819f02007-05-06 14:49:36 -07002451 */
Christoph Lameter0c710012007-07-17 04:03:24 -07002452static inline int kmem_cache_close(struct kmem_cache *s)
Christoph Lameter81819f02007-05-06 14:49:36 -07002453{
2454 int node;
2455
2456 flush_all(s);
2457
2458 /* Attempt to free all objects */
Christoph Lameter4c93c3552007-10-16 01:26:08 -07002459 free_kmem_cache_cpus(s);
Christoph Lameterf64dc582007-10-16 01:25:33 -07002460 for_each_node_state(node, N_NORMAL_MEMORY) {
Christoph Lameter81819f02007-05-06 14:49:36 -07002461 struct kmem_cache_node *n = get_node(s, node);
2462
Christoph Lameter599870b2008-04-23 12:36:52 -07002463 free_partial(s, n);
2464 if (n->nr_partial || slabs_node(s, node))
Christoph Lameter81819f02007-05-06 14:49:36 -07002465 return 1;
2466 }
2467 free_kmem_cache_nodes(s);
2468 return 0;
2469}
2470
2471/*
2472 * Close a cache and release the kmem_cache structure
2473 * (must be used for caches created using kmem_cache_create)
2474 */
2475void kmem_cache_destroy(struct kmem_cache *s)
2476{
2477 down_write(&slub_lock);
2478 s->refcount--;
2479 if (!s->refcount) {
2480 list_del(&s->list);
Christoph Lametera0e1d1b2007-07-17 04:03:31 -07002481 up_write(&slub_lock);
Pekka Enbergd629d812008-04-23 22:31:08 +03002482 if (kmem_cache_close(s)) {
2483 printk(KERN_ERR "SLUB %s: %s called for cache that "
2484 "still has objects.\n", s->name, __func__);
2485 dump_stack();
2486 }
Christoph Lameter81819f02007-05-06 14:49:36 -07002487 sysfs_slab_remove(s);
Christoph Lametera0e1d1b2007-07-17 04:03:31 -07002488 } else
2489 up_write(&slub_lock);
Christoph Lameter81819f02007-05-06 14:49:36 -07002490}
2491EXPORT_SYMBOL(kmem_cache_destroy);
2492
2493/********************************************************************
2494 * Kmalloc subsystem
2495 *******************************************************************/
2496
Christoph Lameter331dc552008-02-14 14:28:09 -08002497struct kmem_cache kmalloc_caches[PAGE_SHIFT + 1] __cacheline_aligned;
Christoph Lameter81819f02007-05-06 14:49:36 -07002498EXPORT_SYMBOL(kmalloc_caches);
2499
Christoph Lameter81819f02007-05-06 14:49:36 -07002500static int __init setup_slub_min_order(char *str)
2501{
Pekka Enberg06428782008-01-07 23:20:27 -08002502 get_option(&str, &slub_min_order);
Christoph Lameter81819f02007-05-06 14:49:36 -07002503
2504 return 1;
2505}
2506
2507__setup("slub_min_order=", setup_slub_min_order);
2508
2509static int __init setup_slub_max_order(char *str)
2510{
Pekka Enberg06428782008-01-07 23:20:27 -08002511 get_option(&str, &slub_max_order);
Christoph Lameter81819f02007-05-06 14:49:36 -07002512
2513 return 1;
2514}
2515
2516__setup("slub_max_order=", setup_slub_max_order);
2517
2518static int __init setup_slub_min_objects(char *str)
2519{
Pekka Enberg06428782008-01-07 23:20:27 -08002520 get_option(&str, &slub_min_objects);
Christoph Lameter81819f02007-05-06 14:49:36 -07002521
2522 return 1;
2523}
2524
2525__setup("slub_min_objects=", setup_slub_min_objects);
2526
2527static int __init setup_slub_nomerge(char *str)
2528{
2529 slub_nomerge = 1;
2530 return 1;
2531}
2532
2533__setup("slub_nomerge", setup_slub_nomerge);
2534
Christoph Lameter81819f02007-05-06 14:49:36 -07002535static struct kmem_cache *create_kmalloc_cache(struct kmem_cache *s,
2536 const char *name, int size, gfp_t gfp_flags)
2537{
2538 unsigned int flags = 0;
2539
2540 if (gfp_flags & SLUB_DMA)
2541 flags = SLAB_CACHE_DMA;
2542
2543 down_write(&slub_lock);
2544 if (!kmem_cache_open(s, gfp_flags, name, size, ARCH_KMALLOC_MINALIGN,
Christoph Lameter319d1e22008-04-14 19:11:41 +03002545 flags, NULL))
Christoph Lameter81819f02007-05-06 14:49:36 -07002546 goto panic;
2547
2548 list_add(&s->list, &slab_caches);
2549 up_write(&slub_lock);
2550 if (sysfs_slab_add(s))
2551 goto panic;
2552 return s;
2553
2554panic:
2555 panic("Creation of kmalloc slab %s size=%d failed.\n", name, size);
2556}
2557
Christoph Lameter2e443fd2007-07-17 04:03:24 -07002558#ifdef CONFIG_ZONE_DMA
Christoph Lameter4097d602008-04-14 18:51:18 +03002559static struct kmem_cache *kmalloc_caches_dma[PAGE_SHIFT + 1];
Christoph Lameter1ceef402007-08-07 15:11:48 -07002560
2561static void sysfs_add_func(struct work_struct *w)
2562{
2563 struct kmem_cache *s;
2564
2565 down_write(&slub_lock);
2566 list_for_each_entry(s, &slab_caches, list) {
2567 if (s->flags & __SYSFS_ADD_DEFERRED) {
2568 s->flags &= ~__SYSFS_ADD_DEFERRED;
2569 sysfs_slab_add(s);
2570 }
2571 }
2572 up_write(&slub_lock);
2573}
2574
2575static DECLARE_WORK(sysfs_add_work, sysfs_add_func);
2576
Christoph Lameter2e443fd2007-07-17 04:03:24 -07002577static noinline struct kmem_cache *dma_kmalloc_cache(int index, gfp_t flags)
2578{
2579 struct kmem_cache *s;
Christoph Lameter2e443fd2007-07-17 04:03:24 -07002580 char *text;
2581 size_t realsize;
2582
2583 s = kmalloc_caches_dma[index];
2584 if (s)
2585 return s;
2586
2587 /* Dynamically create dma cache */
Christoph Lameter1ceef402007-08-07 15:11:48 -07002588 if (flags & __GFP_WAIT)
2589 down_write(&slub_lock);
2590 else {
2591 if (!down_write_trylock(&slub_lock))
2592 goto out;
2593 }
2594
2595 if (kmalloc_caches_dma[index])
2596 goto unlock_out;
Christoph Lameter2e443fd2007-07-17 04:03:24 -07002597
Christoph Lameter7b55f622007-07-17 04:03:27 -07002598 realsize = kmalloc_caches[index].objsize;
Ingo Molnar3adbefe2008-02-05 17:57:39 -08002599 text = kasprintf(flags & ~SLUB_DMA, "kmalloc_dma-%d",
2600 (unsigned int)realsize);
Christoph Lameter1ceef402007-08-07 15:11:48 -07002601 s = kmalloc(kmem_size, flags & ~SLUB_DMA);
2602
2603 if (!s || !text || !kmem_cache_open(s, flags, text,
2604 realsize, ARCH_KMALLOC_MINALIGN,
2605 SLAB_CACHE_DMA|__SYSFS_ADD_DEFERRED, NULL)) {
2606 kfree(s);
2607 kfree(text);
2608 goto unlock_out;
Christoph Lameterdfce8642007-07-17 04:03:25 -07002609 }
Christoph Lameter1ceef402007-08-07 15:11:48 -07002610
2611 list_add(&s->list, &slab_caches);
2612 kmalloc_caches_dma[index] = s;
2613
2614 schedule_work(&sysfs_add_work);
2615
2616unlock_out:
Christoph Lameterdfce8642007-07-17 04:03:25 -07002617 up_write(&slub_lock);
Christoph Lameter1ceef402007-08-07 15:11:48 -07002618out:
Christoph Lameterdfce8642007-07-17 04:03:25 -07002619 return kmalloc_caches_dma[index];
Christoph Lameter2e443fd2007-07-17 04:03:24 -07002620}
2621#endif
2622
Christoph Lameterf1b26332007-07-17 04:03:26 -07002623/*
2624 * Conversion table for small slabs sizes / 8 to the index in the
2625 * kmalloc array. This is necessary for slabs < 192 since we have non power
2626 * of two cache sizes there. The size of larger slabs can be determined using
2627 * fls.
2628 */
2629static s8 size_index[24] = {
2630 3, /* 8 */
2631 4, /* 16 */
2632 5, /* 24 */
2633 5, /* 32 */
2634 6, /* 40 */
2635 6, /* 48 */
2636 6, /* 56 */
2637 6, /* 64 */
2638 1, /* 72 */
2639 1, /* 80 */
2640 1, /* 88 */
2641 1, /* 96 */
2642 7, /* 104 */
2643 7, /* 112 */
2644 7, /* 120 */
2645 7, /* 128 */
2646 2, /* 136 */
2647 2, /* 144 */
2648 2, /* 152 */
2649 2, /* 160 */
2650 2, /* 168 */
2651 2, /* 176 */
2652 2, /* 184 */
2653 2 /* 192 */
2654};
2655
Christoph Lameter81819f02007-05-06 14:49:36 -07002656static struct kmem_cache *get_slab(size_t size, gfp_t flags)
2657{
Christoph Lameterf1b26332007-07-17 04:03:26 -07002658 int index;
Christoph Lameter81819f02007-05-06 14:49:36 -07002659
Christoph Lameterf1b26332007-07-17 04:03:26 -07002660 if (size <= 192) {
2661 if (!size)
2662 return ZERO_SIZE_PTR;
Christoph Lameter81819f02007-05-06 14:49:36 -07002663
Christoph Lameterf1b26332007-07-17 04:03:26 -07002664 index = size_index[(size - 1) / 8];
Christoph Lameteraadb4bc2007-10-16 01:24:38 -07002665 } else
Christoph Lameterf1b26332007-07-17 04:03:26 -07002666 index = fls(size - 1);
Christoph Lameter81819f02007-05-06 14:49:36 -07002667
2668#ifdef CONFIG_ZONE_DMA
Christoph Lameterf1b26332007-07-17 04:03:26 -07002669 if (unlikely((flags & SLUB_DMA)))
Christoph Lameter2e443fd2007-07-17 04:03:24 -07002670 return dma_kmalloc_cache(index, flags);
Christoph Lameterf1b26332007-07-17 04:03:26 -07002671
Christoph Lameter81819f02007-05-06 14:49:36 -07002672#endif
2673 return &kmalloc_caches[index];
2674}
2675
2676void *__kmalloc(size_t size, gfp_t flags)
2677{
Christoph Lameteraadb4bc2007-10-16 01:24:38 -07002678 struct kmem_cache *s;
Christoph Lameter81819f02007-05-06 14:49:36 -07002679
Christoph Lameter331dc552008-02-14 14:28:09 -08002680 if (unlikely(size > PAGE_SIZE))
Pekka Enbergeada35e2008-02-11 22:47:46 +02002681 return kmalloc_large(size, flags);
Christoph Lameteraadb4bc2007-10-16 01:24:38 -07002682
2683 s = get_slab(size, flags);
2684
2685 if (unlikely(ZERO_OR_NULL_PTR(s)))
Christoph Lameter6cb8f912007-07-17 04:03:22 -07002686 return s;
2687
Christoph Lameterce15fea2007-07-17 04:03:28 -07002688 return slab_alloc(s, flags, -1, __builtin_return_address(0));
Christoph Lameter81819f02007-05-06 14:49:36 -07002689}
2690EXPORT_SYMBOL(__kmalloc);
2691
Christoph Lameterf619cfe2008-03-01 13:56:40 -08002692static void *kmalloc_large_node(size_t size, gfp_t flags, int node)
2693{
2694 struct page *page = alloc_pages_node(node, flags | __GFP_COMP,
2695 get_order(size));
2696
2697 if (page)
2698 return page_address(page);
2699 else
2700 return NULL;
2701}
2702
Christoph Lameter81819f02007-05-06 14:49:36 -07002703#ifdef CONFIG_NUMA
2704void *__kmalloc_node(size_t size, gfp_t flags, int node)
2705{
Christoph Lameteraadb4bc2007-10-16 01:24:38 -07002706 struct kmem_cache *s;
Christoph Lameter81819f02007-05-06 14:49:36 -07002707
Christoph Lameter331dc552008-02-14 14:28:09 -08002708 if (unlikely(size > PAGE_SIZE))
Christoph Lameterf619cfe2008-03-01 13:56:40 -08002709 return kmalloc_large_node(size, flags, node);
Christoph Lameteraadb4bc2007-10-16 01:24:38 -07002710
2711 s = get_slab(size, flags);
2712
2713 if (unlikely(ZERO_OR_NULL_PTR(s)))
Christoph Lameter6cb8f912007-07-17 04:03:22 -07002714 return s;
2715
Christoph Lameterce15fea2007-07-17 04:03:28 -07002716 return slab_alloc(s, flags, node, __builtin_return_address(0));
Christoph Lameter81819f02007-05-06 14:49:36 -07002717}
2718EXPORT_SYMBOL(__kmalloc_node);
2719#endif
2720
2721size_t ksize(const void *object)
2722{
Christoph Lameter272c1d22007-06-08 13:46:49 -07002723 struct page *page;
Christoph Lameter81819f02007-05-06 14:49:36 -07002724 struct kmem_cache *s;
2725
Christoph Lameteref8b4522007-10-16 01:24:46 -07002726 if (unlikely(object == ZERO_SIZE_PTR))
Christoph Lameter272c1d22007-06-08 13:46:49 -07002727 return 0;
2728
Vegard Nossum294a80a2007-12-04 23:45:30 -08002729 page = virt_to_head_page(object);
Vegard Nossum294a80a2007-12-04 23:45:30 -08002730
Pekka Enberg76994412008-05-22 19:22:25 +03002731 if (unlikely(!PageSlab(page))) {
2732 WARN_ON(!PageCompound(page));
Vegard Nossum294a80a2007-12-04 23:45:30 -08002733 return PAGE_SIZE << compound_order(page);
Pekka Enberg76994412008-05-22 19:22:25 +03002734 }
Christoph Lameter81819f02007-05-06 14:49:36 -07002735 s = page->slab;
Christoph Lameter81819f02007-05-06 14:49:36 -07002736
Christoph Lameterae20bfd2008-02-15 23:45:25 -08002737#ifdef CONFIG_SLUB_DEBUG
Christoph Lameter81819f02007-05-06 14:49:36 -07002738 /*
2739 * Debugging requires use of the padding between object
2740 * and whatever may come after it.
2741 */
2742 if (s->flags & (SLAB_RED_ZONE | SLAB_POISON))
2743 return s->objsize;
2744
Christoph Lameterae20bfd2008-02-15 23:45:25 -08002745#endif
Christoph Lameter81819f02007-05-06 14:49:36 -07002746 /*
2747 * If we have the need to store the freelist pointer
2748 * back there or track user information then we can
2749 * only use the space before that information.
2750 */
2751 if (s->flags & (SLAB_DESTROY_BY_RCU | SLAB_STORE_USER))
2752 return s->inuse;
Christoph Lameter81819f02007-05-06 14:49:36 -07002753 /*
2754 * Else we can use all the padding etc for the allocation
2755 */
2756 return s->size;
2757}
2758EXPORT_SYMBOL(ksize);
2759
2760void kfree(const void *x)
2761{
Christoph Lameter81819f02007-05-06 14:49:36 -07002762 struct page *page;
Christoph Lameter5bb983b2008-02-07 17:47:41 -08002763 void *object = (void *)x;
Christoph Lameter81819f02007-05-06 14:49:36 -07002764
Satyam Sharma2408c552007-10-16 01:24:44 -07002765 if (unlikely(ZERO_OR_NULL_PTR(x)))
Christoph Lameter81819f02007-05-06 14:49:36 -07002766 return;
2767
Christoph Lameterb49af682007-05-06 14:49:41 -07002768 page = virt_to_head_page(x);
Christoph Lameteraadb4bc2007-10-16 01:24:38 -07002769 if (unlikely(!PageSlab(page))) {
2770 put_page(page);
2771 return;
2772 }
Christoph Lameter5bb983b2008-02-07 17:47:41 -08002773 slab_free(page->slab, page, object, __builtin_return_address(0));
Christoph Lameter81819f02007-05-06 14:49:36 -07002774}
2775EXPORT_SYMBOL(kfree);
2776
Christoph Lameter2086d262007-05-06 14:49:46 -07002777/*
Christoph Lameter672bba32007-05-09 02:32:39 -07002778 * kmem_cache_shrink removes empty slabs from the partial lists and sorts
2779 * the remaining slabs by the number of items in use. The slabs with the
2780 * most items in use come first. New allocations will then fill those up
2781 * and thus they can be removed from the partial lists.
2782 *
2783 * The slabs with the least items are placed last. This results in them
2784 * being allocated from last increasing the chance that the last objects
2785 * are freed in them.
Christoph Lameter2086d262007-05-06 14:49:46 -07002786 */
2787int kmem_cache_shrink(struct kmem_cache *s)
2788{
2789 int node;
2790 int i;
2791 struct kmem_cache_node *n;
2792 struct page *page;
2793 struct page *t;
Christoph Lameter205ab992008-04-14 19:11:40 +03002794 int objects = oo_objects(s->max);
Christoph Lameter2086d262007-05-06 14:49:46 -07002795 struct list_head *slabs_by_inuse =
Christoph Lameter834f3d12008-04-14 19:11:31 +03002796 kmalloc(sizeof(struct list_head) * objects, GFP_KERNEL);
Christoph Lameter2086d262007-05-06 14:49:46 -07002797 unsigned long flags;
2798
2799 if (!slabs_by_inuse)
2800 return -ENOMEM;
2801
2802 flush_all(s);
Christoph Lameterf64dc582007-10-16 01:25:33 -07002803 for_each_node_state(node, N_NORMAL_MEMORY) {
Christoph Lameter2086d262007-05-06 14:49:46 -07002804 n = get_node(s, node);
2805
2806 if (!n->nr_partial)
2807 continue;
2808
Christoph Lameter834f3d12008-04-14 19:11:31 +03002809 for (i = 0; i < objects; i++)
Christoph Lameter2086d262007-05-06 14:49:46 -07002810 INIT_LIST_HEAD(slabs_by_inuse + i);
2811
2812 spin_lock_irqsave(&n->list_lock, flags);
2813
2814 /*
Christoph Lameter672bba32007-05-09 02:32:39 -07002815 * Build lists indexed by the items in use in each slab.
Christoph Lameter2086d262007-05-06 14:49:46 -07002816 *
Christoph Lameter672bba32007-05-09 02:32:39 -07002817 * Note that concurrent frees may occur while we hold the
2818 * list_lock. page->inuse here is the upper limit.
Christoph Lameter2086d262007-05-06 14:49:46 -07002819 */
2820 list_for_each_entry_safe(page, t, &n->partial, lru) {
2821 if (!page->inuse && slab_trylock(page)) {
2822 /*
2823 * Must hold slab lock here because slab_free
2824 * may have freed the last object and be
2825 * waiting to release the slab.
2826 */
2827 list_del(&page->lru);
2828 n->nr_partial--;
2829 slab_unlock(page);
2830 discard_slab(s, page);
2831 } else {
Christoph Lameterfcda3d82007-07-30 13:06:46 -07002832 list_move(&page->lru,
2833 slabs_by_inuse + page->inuse);
Christoph Lameter2086d262007-05-06 14:49:46 -07002834 }
2835 }
2836
Christoph Lameter2086d262007-05-06 14:49:46 -07002837 /*
Christoph Lameter672bba32007-05-09 02:32:39 -07002838 * Rebuild the partial list with the slabs filled up most
2839 * first and the least used slabs at the end.
Christoph Lameter2086d262007-05-06 14:49:46 -07002840 */
Christoph Lameter834f3d12008-04-14 19:11:31 +03002841 for (i = objects - 1; i >= 0; i--)
Christoph Lameter2086d262007-05-06 14:49:46 -07002842 list_splice(slabs_by_inuse + i, n->partial.prev);
2843
Christoph Lameter2086d262007-05-06 14:49:46 -07002844 spin_unlock_irqrestore(&n->list_lock, flags);
2845 }
2846
2847 kfree(slabs_by_inuse);
2848 return 0;
2849}
2850EXPORT_SYMBOL(kmem_cache_shrink);
2851
Yasunori Gotob9049e22007-10-21 16:41:37 -07002852#if defined(CONFIG_NUMA) && defined(CONFIG_MEMORY_HOTPLUG)
2853static int slab_mem_going_offline_callback(void *arg)
2854{
2855 struct kmem_cache *s;
2856
2857 down_read(&slub_lock);
2858 list_for_each_entry(s, &slab_caches, list)
2859 kmem_cache_shrink(s);
2860 up_read(&slub_lock);
2861
2862 return 0;
2863}
2864
2865static void slab_mem_offline_callback(void *arg)
2866{
2867 struct kmem_cache_node *n;
2868 struct kmem_cache *s;
2869 struct memory_notify *marg = arg;
2870 int offline_node;
2871
2872 offline_node = marg->status_change_nid;
2873
2874 /*
2875 * If the node still has available memory. we need kmem_cache_node
2876 * for it yet.
2877 */
2878 if (offline_node < 0)
2879 return;
2880
2881 down_read(&slub_lock);
2882 list_for_each_entry(s, &slab_caches, list) {
2883 n = get_node(s, offline_node);
2884 if (n) {
2885 /*
2886 * if n->nr_slabs > 0, slabs still exist on the node
2887 * that is going down. We were unable to free them,
2888 * and offline_pages() function shoudn't call this
2889 * callback. So, we must fail.
2890 */
Christoph Lameter0f389ec2008-04-14 18:53:02 +03002891 BUG_ON(slabs_node(s, offline_node));
Yasunori Gotob9049e22007-10-21 16:41:37 -07002892
2893 s->node[offline_node] = NULL;
2894 kmem_cache_free(kmalloc_caches, n);
2895 }
2896 }
2897 up_read(&slub_lock);
2898}
2899
2900static int slab_mem_going_online_callback(void *arg)
2901{
2902 struct kmem_cache_node *n;
2903 struct kmem_cache *s;
2904 struct memory_notify *marg = arg;
2905 int nid = marg->status_change_nid;
2906 int ret = 0;
2907
2908 /*
2909 * If the node's memory is already available, then kmem_cache_node is
2910 * already created. Nothing to do.
2911 */
2912 if (nid < 0)
2913 return 0;
2914
2915 /*
Christoph Lameter0121c6192008-04-29 16:11:12 -07002916 * We are bringing a node online. No memory is available yet. We must
Yasunori Gotob9049e22007-10-21 16:41:37 -07002917 * allocate a kmem_cache_node structure in order to bring the node
2918 * online.
2919 */
2920 down_read(&slub_lock);
2921 list_for_each_entry(s, &slab_caches, list) {
2922 /*
2923 * XXX: kmem_cache_alloc_node will fallback to other nodes
2924 * since memory is not yet available from the node that
2925 * is brought up.
2926 */
2927 n = kmem_cache_alloc(kmalloc_caches, GFP_KERNEL);
2928 if (!n) {
2929 ret = -ENOMEM;
2930 goto out;
2931 }
2932 init_kmem_cache_node(n);
2933 s->node[nid] = n;
2934 }
2935out:
2936 up_read(&slub_lock);
2937 return ret;
2938}
2939
2940static int slab_memory_callback(struct notifier_block *self,
2941 unsigned long action, void *arg)
2942{
2943 int ret = 0;
2944
2945 switch (action) {
2946 case MEM_GOING_ONLINE:
2947 ret = slab_mem_going_online_callback(arg);
2948 break;
2949 case MEM_GOING_OFFLINE:
2950 ret = slab_mem_going_offline_callback(arg);
2951 break;
2952 case MEM_OFFLINE:
2953 case MEM_CANCEL_ONLINE:
2954 slab_mem_offline_callback(arg);
2955 break;
2956 case MEM_ONLINE:
2957 case MEM_CANCEL_OFFLINE:
2958 break;
2959 }
2960
2961 ret = notifier_from_errno(ret);
2962 return ret;
2963}
2964
2965#endif /* CONFIG_MEMORY_HOTPLUG */
2966
Christoph Lameter81819f02007-05-06 14:49:36 -07002967/********************************************************************
2968 * Basic setup of slabs
2969 *******************************************************************/
2970
2971void __init kmem_cache_init(void)
2972{
2973 int i;
Christoph Lameter4b356be2007-06-16 10:16:13 -07002974 int caches = 0;
Christoph Lameter81819f02007-05-06 14:49:36 -07002975
Christoph Lameter4c93c3552007-10-16 01:26:08 -07002976 init_alloc_cpu();
2977
Christoph Lameter81819f02007-05-06 14:49:36 -07002978#ifdef CONFIG_NUMA
2979 /*
2980 * Must first have the slab cache available for the allocations of the
Christoph Lameter672bba32007-05-09 02:32:39 -07002981 * struct kmem_cache_node's. There is special bootstrap code in
Christoph Lameter81819f02007-05-06 14:49:36 -07002982 * kmem_cache_open for slab_state == DOWN.
2983 */
2984 create_kmalloc_cache(&kmalloc_caches[0], "kmem_cache_node",
2985 sizeof(struct kmem_cache_node), GFP_KERNEL);
Christoph Lameter8ffa6872007-05-31 00:40:51 -07002986 kmalloc_caches[0].refcount = -1;
Christoph Lameter4b356be2007-06-16 10:16:13 -07002987 caches++;
Yasunori Gotob9049e22007-10-21 16:41:37 -07002988
Nadia Derbey0c40ba42008-04-29 01:00:41 -07002989 hotplug_memory_notifier(slab_memory_callback, SLAB_CALLBACK_PRI);
Christoph Lameter81819f02007-05-06 14:49:36 -07002990#endif
2991
2992 /* Able to allocate the per node structures */
2993 slab_state = PARTIAL;
2994
2995 /* Caches that are not of the two-to-the-power-of size */
Christoph Lameter4b356be2007-06-16 10:16:13 -07002996 if (KMALLOC_MIN_SIZE <= 64) {
2997 create_kmalloc_cache(&kmalloc_caches[1],
Christoph Lameter81819f02007-05-06 14:49:36 -07002998 "kmalloc-96", 96, GFP_KERNEL);
Christoph Lameter4b356be2007-06-16 10:16:13 -07002999 caches++;
Christoph Lameter4b356be2007-06-16 10:16:13 -07003000 create_kmalloc_cache(&kmalloc_caches[2],
Christoph Lameter81819f02007-05-06 14:49:36 -07003001 "kmalloc-192", 192, GFP_KERNEL);
Christoph Lameter4b356be2007-06-16 10:16:13 -07003002 caches++;
3003 }
Christoph Lameter81819f02007-05-06 14:49:36 -07003004
Christoph Lameter331dc552008-02-14 14:28:09 -08003005 for (i = KMALLOC_SHIFT_LOW; i <= PAGE_SHIFT; i++) {
Christoph Lameter81819f02007-05-06 14:49:36 -07003006 create_kmalloc_cache(&kmalloc_caches[i],
3007 "kmalloc", 1 << i, GFP_KERNEL);
Christoph Lameter4b356be2007-06-16 10:16:13 -07003008 caches++;
3009 }
Christoph Lameter81819f02007-05-06 14:49:36 -07003010
Christoph Lameterf1b26332007-07-17 04:03:26 -07003011
3012 /*
3013 * Patch up the size_index table if we have strange large alignment
3014 * requirements for the kmalloc array. This is only the case for
Christoph Lameter6446faa2008-02-15 23:45:26 -08003015 * MIPS it seems. The standard arches will not generate any code here.
Christoph Lameterf1b26332007-07-17 04:03:26 -07003016 *
3017 * Largest permitted alignment is 256 bytes due to the way we
3018 * handle the index determination for the smaller caches.
3019 *
3020 * Make sure that nothing crazy happens if someone starts tinkering
3021 * around with ARCH_KMALLOC_MINALIGN
3022 */
3023 BUILD_BUG_ON(KMALLOC_MIN_SIZE > 256 ||
3024 (KMALLOC_MIN_SIZE & (KMALLOC_MIN_SIZE - 1)));
3025
Christoph Lameter12ad6842007-07-17 04:03:28 -07003026 for (i = 8; i < KMALLOC_MIN_SIZE; i += 8)
Christoph Lameterf1b26332007-07-17 04:03:26 -07003027 size_index[(i - 1) / 8] = KMALLOC_SHIFT_LOW;
3028
Christoph Lameter41d54d32008-07-03 09:14:26 -05003029 if (KMALLOC_MIN_SIZE == 128) {
3030 /*
3031 * The 192 byte sized cache is not used if the alignment
3032 * is 128 byte. Redirect kmalloc to use the 256 byte cache
3033 * instead.
3034 */
3035 for (i = 128 + 8; i <= 192; i += 8)
3036 size_index[(i - 1) / 8] = 8;
3037 }
3038
Christoph Lameter81819f02007-05-06 14:49:36 -07003039 slab_state = UP;
3040
3041 /* Provide the correct kmalloc names now that the caches are up */
Christoph Lameter331dc552008-02-14 14:28:09 -08003042 for (i = KMALLOC_SHIFT_LOW; i <= PAGE_SHIFT; i++)
Christoph Lameter81819f02007-05-06 14:49:36 -07003043 kmalloc_caches[i]. name =
3044 kasprintf(GFP_KERNEL, "kmalloc-%d", 1 << i);
3045
3046#ifdef CONFIG_SMP
3047 register_cpu_notifier(&slab_notifier);
Christoph Lameter4c93c3552007-10-16 01:26:08 -07003048 kmem_size = offsetof(struct kmem_cache, cpu_slab) +
3049 nr_cpu_ids * sizeof(struct kmem_cache_cpu *);
3050#else
3051 kmem_size = sizeof(struct kmem_cache);
Christoph Lameter81819f02007-05-06 14:49:36 -07003052#endif
3053
Ingo Molnar3adbefe2008-02-05 17:57:39 -08003054 printk(KERN_INFO
3055 "SLUB: Genslabs=%d, HWalign=%d, Order=%d-%d, MinObjects=%d,"
Christoph Lameter4b356be2007-06-16 10:16:13 -07003056 " CPUs=%d, Nodes=%d\n",
3057 caches, cache_line_size(),
Christoph Lameter81819f02007-05-06 14:49:36 -07003058 slub_min_order, slub_max_order, slub_min_objects,
3059 nr_cpu_ids, nr_node_ids);
3060}
3061
3062/*
3063 * Find a mergeable slab cache
3064 */
3065static int slab_unmergeable(struct kmem_cache *s)
3066{
3067 if (slub_nomerge || (s->flags & SLUB_NEVER_MERGE))
3068 return 1;
3069
Christoph Lameterc59def92007-05-16 22:10:50 -07003070 if (s->ctor)
Christoph Lameter81819f02007-05-06 14:49:36 -07003071 return 1;
3072
Christoph Lameter8ffa6872007-05-31 00:40:51 -07003073 /*
3074 * We may have set a slab to be unmergeable during bootstrap.
3075 */
3076 if (s->refcount < 0)
3077 return 1;
3078
Christoph Lameter81819f02007-05-06 14:49:36 -07003079 return 0;
3080}
3081
3082static struct kmem_cache *find_mergeable(size_t size,
Christoph Lameterba0268a2007-09-11 15:24:11 -07003083 size_t align, unsigned long flags, const char *name,
Christoph Lameter4ba9b9d2007-10-16 23:25:51 -07003084 void (*ctor)(struct kmem_cache *, void *))
Christoph Lameter81819f02007-05-06 14:49:36 -07003085{
Christoph Lameter5b95a4ac2007-07-17 04:03:19 -07003086 struct kmem_cache *s;
Christoph Lameter81819f02007-05-06 14:49:36 -07003087
3088 if (slub_nomerge || (flags & SLUB_NEVER_MERGE))
3089 return NULL;
3090
Christoph Lameterc59def92007-05-16 22:10:50 -07003091 if (ctor)
Christoph Lameter81819f02007-05-06 14:49:36 -07003092 return NULL;
3093
3094 size = ALIGN(size, sizeof(void *));
3095 align = calculate_alignment(flags, align, size);
3096 size = ALIGN(size, align);
Christoph Lameterba0268a2007-09-11 15:24:11 -07003097 flags = kmem_cache_flags(size, flags, name, NULL);
Christoph Lameter81819f02007-05-06 14:49:36 -07003098
Christoph Lameter5b95a4ac2007-07-17 04:03:19 -07003099 list_for_each_entry(s, &slab_caches, list) {
Christoph Lameter81819f02007-05-06 14:49:36 -07003100 if (slab_unmergeable(s))
3101 continue;
3102
3103 if (size > s->size)
3104 continue;
3105
Christoph Lameterba0268a2007-09-11 15:24:11 -07003106 if ((flags & SLUB_MERGE_SAME) != (s->flags & SLUB_MERGE_SAME))
Christoph Lameter81819f02007-05-06 14:49:36 -07003107 continue;
3108 /*
3109 * Check if alignment is compatible.
3110 * Courtesy of Adrian Drzewiecki
3111 */
Pekka Enberg06428782008-01-07 23:20:27 -08003112 if ((s->size & ~(align - 1)) != s->size)
Christoph Lameter81819f02007-05-06 14:49:36 -07003113 continue;
3114
3115 if (s->size - size >= sizeof(void *))
3116 continue;
3117
3118 return s;
3119 }
3120 return NULL;
3121}
3122
3123struct kmem_cache *kmem_cache_create(const char *name, size_t size,
3124 size_t align, unsigned long flags,
Christoph Lameter4ba9b9d2007-10-16 23:25:51 -07003125 void (*ctor)(struct kmem_cache *, void *))
Christoph Lameter81819f02007-05-06 14:49:36 -07003126{
3127 struct kmem_cache *s;
3128
3129 down_write(&slub_lock);
Christoph Lameterba0268a2007-09-11 15:24:11 -07003130 s = find_mergeable(size, align, flags, name, ctor);
Christoph Lameter81819f02007-05-06 14:49:36 -07003131 if (s) {
Christoph Lameter42a9fdb2007-10-16 01:26:09 -07003132 int cpu;
3133
Christoph Lameter81819f02007-05-06 14:49:36 -07003134 s->refcount++;
3135 /*
3136 * Adjust the object sizes so that we clear
3137 * the complete object on kzalloc.
3138 */
3139 s->objsize = max(s->objsize, (int)size);
Christoph Lameter42a9fdb2007-10-16 01:26:09 -07003140
3141 /*
3142 * And then we need to update the object size in the
3143 * per cpu structures
3144 */
3145 for_each_online_cpu(cpu)
3146 get_cpu_slab(s, cpu)->objsize = s->objsize;
Christoph Lameter6446faa2008-02-15 23:45:26 -08003147
Christoph Lameter81819f02007-05-06 14:49:36 -07003148 s->inuse = max_t(int, s->inuse, ALIGN(size, sizeof(void *)));
Christoph Lametera0e1d1b2007-07-17 04:03:31 -07003149 up_write(&slub_lock);
Christoph Lameter6446faa2008-02-15 23:45:26 -08003150
Christoph Lameter81819f02007-05-06 14:49:36 -07003151 if (sysfs_slab_alias(s, name))
3152 goto err;
Christoph Lametera0e1d1b2007-07-17 04:03:31 -07003153 return s;
3154 }
Christoph Lameter6446faa2008-02-15 23:45:26 -08003155
Christoph Lametera0e1d1b2007-07-17 04:03:31 -07003156 s = kmalloc(kmem_size, GFP_KERNEL);
3157 if (s) {
3158 if (kmem_cache_open(s, GFP_KERNEL, name,
Christoph Lameterc59def92007-05-16 22:10:50 -07003159 size, align, flags, ctor)) {
Christoph Lameter81819f02007-05-06 14:49:36 -07003160 list_add(&s->list, &slab_caches);
Christoph Lametera0e1d1b2007-07-17 04:03:31 -07003161 up_write(&slub_lock);
3162 if (sysfs_slab_add(s))
3163 goto err;
3164 return s;
3165 }
3166 kfree(s);
Christoph Lameter81819f02007-05-06 14:49:36 -07003167 }
3168 up_write(&slub_lock);
Christoph Lameter81819f02007-05-06 14:49:36 -07003169
3170err:
Christoph Lameter81819f02007-05-06 14:49:36 -07003171 if (flags & SLAB_PANIC)
3172 panic("Cannot create slabcache %s\n", name);
3173 else
3174 s = NULL;
3175 return s;
3176}
3177EXPORT_SYMBOL(kmem_cache_create);
3178
Christoph Lameter81819f02007-05-06 14:49:36 -07003179#ifdef CONFIG_SMP
Christoph Lameter27390bc2007-06-01 00:47:09 -07003180/*
Christoph Lameter672bba32007-05-09 02:32:39 -07003181 * Use the cpu notifier to insure that the cpu slabs are flushed when
3182 * necessary.
Christoph Lameter81819f02007-05-06 14:49:36 -07003183 */
3184static int __cpuinit slab_cpuup_callback(struct notifier_block *nfb,
3185 unsigned long action, void *hcpu)
3186{
3187 long cpu = (long)hcpu;
Christoph Lameter5b95a4ac2007-07-17 04:03:19 -07003188 struct kmem_cache *s;
3189 unsigned long flags;
Christoph Lameter81819f02007-05-06 14:49:36 -07003190
3191 switch (action) {
Christoph Lameter4c93c3552007-10-16 01:26:08 -07003192 case CPU_UP_PREPARE:
3193 case CPU_UP_PREPARE_FROZEN:
3194 init_alloc_cpu_cpu(cpu);
3195 down_read(&slub_lock);
3196 list_for_each_entry(s, &slab_caches, list)
3197 s->cpu_slab[cpu] = alloc_kmem_cache_cpu(s, cpu,
3198 GFP_KERNEL);
3199 up_read(&slub_lock);
3200 break;
3201
Christoph Lameter81819f02007-05-06 14:49:36 -07003202 case CPU_UP_CANCELED:
Rafael J. Wysocki8bb78442007-05-09 02:35:10 -07003203 case CPU_UP_CANCELED_FROZEN:
Christoph Lameter81819f02007-05-06 14:49:36 -07003204 case CPU_DEAD:
Rafael J. Wysocki8bb78442007-05-09 02:35:10 -07003205 case CPU_DEAD_FROZEN:
Christoph Lameter5b95a4ac2007-07-17 04:03:19 -07003206 down_read(&slub_lock);
3207 list_for_each_entry(s, &slab_caches, list) {
Christoph Lameter4c93c3552007-10-16 01:26:08 -07003208 struct kmem_cache_cpu *c = get_cpu_slab(s, cpu);
3209
Christoph Lameter5b95a4ac2007-07-17 04:03:19 -07003210 local_irq_save(flags);
3211 __flush_cpu_slab(s, cpu);
3212 local_irq_restore(flags);
Christoph Lameter4c93c3552007-10-16 01:26:08 -07003213 free_kmem_cache_cpu(c, cpu);
3214 s->cpu_slab[cpu] = NULL;
Christoph Lameter5b95a4ac2007-07-17 04:03:19 -07003215 }
3216 up_read(&slub_lock);
Christoph Lameter81819f02007-05-06 14:49:36 -07003217 break;
3218 default:
3219 break;
3220 }
3221 return NOTIFY_OK;
3222}
3223
Pekka Enberg06428782008-01-07 23:20:27 -08003224static struct notifier_block __cpuinitdata slab_notifier = {
Ingo Molnar3adbefe2008-02-05 17:57:39 -08003225 .notifier_call = slab_cpuup_callback
Pekka Enberg06428782008-01-07 23:20:27 -08003226};
Christoph Lameter81819f02007-05-06 14:49:36 -07003227
3228#endif
3229
Christoph Lameter81819f02007-05-06 14:49:36 -07003230void *__kmalloc_track_caller(size_t size, gfp_t gfpflags, void *caller)
3231{
Christoph Lameteraadb4bc2007-10-16 01:24:38 -07003232 struct kmem_cache *s;
3233
Christoph Lameter331dc552008-02-14 14:28:09 -08003234 if (unlikely(size > PAGE_SIZE))
Pekka Enbergeada35e2008-02-11 22:47:46 +02003235 return kmalloc_large(size, gfpflags);
3236
Christoph Lameteraadb4bc2007-10-16 01:24:38 -07003237 s = get_slab(size, gfpflags);
Christoph Lameter81819f02007-05-06 14:49:36 -07003238
Satyam Sharma2408c552007-10-16 01:24:44 -07003239 if (unlikely(ZERO_OR_NULL_PTR(s)))
Christoph Lameter6cb8f912007-07-17 04:03:22 -07003240 return s;
Christoph Lameter81819f02007-05-06 14:49:36 -07003241
Christoph Lameterce15fea2007-07-17 04:03:28 -07003242 return slab_alloc(s, gfpflags, -1, caller);
Christoph Lameter81819f02007-05-06 14:49:36 -07003243}
3244
3245void *__kmalloc_node_track_caller(size_t size, gfp_t gfpflags,
3246 int node, void *caller)
3247{
Christoph Lameteraadb4bc2007-10-16 01:24:38 -07003248 struct kmem_cache *s;
3249
Christoph Lameter331dc552008-02-14 14:28:09 -08003250 if (unlikely(size > PAGE_SIZE))
Christoph Lameterf619cfe2008-03-01 13:56:40 -08003251 return kmalloc_large_node(size, gfpflags, node);
Pekka Enbergeada35e2008-02-11 22:47:46 +02003252
Christoph Lameteraadb4bc2007-10-16 01:24:38 -07003253 s = get_slab(size, gfpflags);
Christoph Lameter81819f02007-05-06 14:49:36 -07003254
Satyam Sharma2408c552007-10-16 01:24:44 -07003255 if (unlikely(ZERO_OR_NULL_PTR(s)))
Christoph Lameter6cb8f912007-07-17 04:03:22 -07003256 return s;
Christoph Lameter81819f02007-05-06 14:49:36 -07003257
Christoph Lameterce15fea2007-07-17 04:03:28 -07003258 return slab_alloc(s, gfpflags, node, caller);
Christoph Lameter81819f02007-05-06 14:49:36 -07003259}
3260
Christoph Lameterf6acb632008-04-29 16:16:06 -07003261#ifdef CONFIG_SLUB_DEBUG
Christoph Lameter205ab992008-04-14 19:11:40 +03003262static unsigned long count_partial(struct kmem_cache_node *n,
3263 int (*get_count)(struct page *))
Christoph Lameter5b06c8532008-04-14 18:51:34 +03003264{
3265 unsigned long flags;
3266 unsigned long x = 0;
3267 struct page *page;
3268
3269 spin_lock_irqsave(&n->list_lock, flags);
3270 list_for_each_entry(page, &n->partial, lru)
Christoph Lameter205ab992008-04-14 19:11:40 +03003271 x += get_count(page);
Christoph Lameter5b06c8532008-04-14 18:51:34 +03003272 spin_unlock_irqrestore(&n->list_lock, flags);
3273 return x;
3274}
Christoph Lameter205ab992008-04-14 19:11:40 +03003275
3276static int count_inuse(struct page *page)
3277{
3278 return page->inuse;
3279}
3280
3281static int count_total(struct page *page)
3282{
3283 return page->objects;
3284}
3285
3286static int count_free(struct page *page)
3287{
3288 return page->objects - page->inuse;
3289}
Christoph Lameter5b06c8532008-04-14 18:51:34 +03003290
Christoph Lameter434e2452007-07-17 04:03:30 -07003291static int validate_slab(struct kmem_cache *s, struct page *page,
3292 unsigned long *map)
Christoph Lameter53e15af2007-05-06 14:49:43 -07003293{
3294 void *p;
Christoph Lametera973e9d2008-03-01 13:40:44 -08003295 void *addr = page_address(page);
Christoph Lameter53e15af2007-05-06 14:49:43 -07003296
3297 if (!check_slab(s, page) ||
3298 !on_freelist(s, page, NULL))
3299 return 0;
3300
3301 /* Now we know that a valid freelist exists */
Christoph Lameter39b26462008-04-14 19:11:30 +03003302 bitmap_zero(map, page->objects);
Christoph Lameter53e15af2007-05-06 14:49:43 -07003303
Christoph Lameter7656c722007-05-09 02:32:40 -07003304 for_each_free_object(p, s, page->freelist) {
3305 set_bit(slab_index(p, s, addr), map);
Christoph Lameter53e15af2007-05-06 14:49:43 -07003306 if (!check_object(s, page, p, 0))
3307 return 0;
3308 }
3309
Christoph Lameter224a88b2008-04-14 19:11:31 +03003310 for_each_object(p, s, addr, page->objects)
Christoph Lameter7656c722007-05-09 02:32:40 -07003311 if (!test_bit(slab_index(p, s, addr), map))
Christoph Lameter53e15af2007-05-06 14:49:43 -07003312 if (!check_object(s, page, p, 1))
3313 return 0;
3314 return 1;
3315}
3316
Christoph Lameter434e2452007-07-17 04:03:30 -07003317static void validate_slab_slab(struct kmem_cache *s, struct page *page,
3318 unsigned long *map)
Christoph Lameter53e15af2007-05-06 14:49:43 -07003319{
3320 if (slab_trylock(page)) {
Christoph Lameter434e2452007-07-17 04:03:30 -07003321 validate_slab(s, page, map);
Christoph Lameter53e15af2007-05-06 14:49:43 -07003322 slab_unlock(page);
3323 } else
3324 printk(KERN_INFO "SLUB %s: Skipped busy slab 0x%p\n",
3325 s->name, page);
3326
3327 if (s->flags & DEBUG_DEFAULT_FLAGS) {
Christoph Lameter35e5d7e2007-05-09 02:32:42 -07003328 if (!SlabDebug(page))
3329 printk(KERN_ERR "SLUB %s: SlabDebug not set "
Christoph Lameter53e15af2007-05-06 14:49:43 -07003330 "on slab 0x%p\n", s->name, page);
3331 } else {
Christoph Lameter35e5d7e2007-05-09 02:32:42 -07003332 if (SlabDebug(page))
3333 printk(KERN_ERR "SLUB %s: SlabDebug set on "
Christoph Lameter53e15af2007-05-06 14:49:43 -07003334 "slab 0x%p\n", s->name, page);
3335 }
3336}
3337
Christoph Lameter434e2452007-07-17 04:03:30 -07003338static int validate_slab_node(struct kmem_cache *s,
3339 struct kmem_cache_node *n, unsigned long *map)
Christoph Lameter53e15af2007-05-06 14:49:43 -07003340{
3341 unsigned long count = 0;
3342 struct page *page;
3343 unsigned long flags;
3344
3345 spin_lock_irqsave(&n->list_lock, flags);
3346
3347 list_for_each_entry(page, &n->partial, lru) {
Christoph Lameter434e2452007-07-17 04:03:30 -07003348 validate_slab_slab(s, page, map);
Christoph Lameter53e15af2007-05-06 14:49:43 -07003349 count++;
3350 }
3351 if (count != n->nr_partial)
3352 printk(KERN_ERR "SLUB %s: %ld partial slabs counted but "
3353 "counter=%ld\n", s->name, count, n->nr_partial);
3354
3355 if (!(s->flags & SLAB_STORE_USER))
3356 goto out;
3357
3358 list_for_each_entry(page, &n->full, lru) {
Christoph Lameter434e2452007-07-17 04:03:30 -07003359 validate_slab_slab(s, page, map);
Christoph Lameter53e15af2007-05-06 14:49:43 -07003360 count++;
3361 }
3362 if (count != atomic_long_read(&n->nr_slabs))
3363 printk(KERN_ERR "SLUB: %s %ld slabs counted but "
3364 "counter=%ld\n", s->name, count,
3365 atomic_long_read(&n->nr_slabs));
3366
3367out:
3368 spin_unlock_irqrestore(&n->list_lock, flags);
3369 return count;
3370}
3371
Christoph Lameter434e2452007-07-17 04:03:30 -07003372static long validate_slab_cache(struct kmem_cache *s)
Christoph Lameter53e15af2007-05-06 14:49:43 -07003373{
3374 int node;
3375 unsigned long count = 0;
Christoph Lameter205ab992008-04-14 19:11:40 +03003376 unsigned long *map = kmalloc(BITS_TO_LONGS(oo_objects(s->max)) *
Christoph Lameter434e2452007-07-17 04:03:30 -07003377 sizeof(unsigned long), GFP_KERNEL);
3378
3379 if (!map)
3380 return -ENOMEM;
Christoph Lameter53e15af2007-05-06 14:49:43 -07003381
3382 flush_all(s);
Christoph Lameterf64dc582007-10-16 01:25:33 -07003383 for_each_node_state(node, N_NORMAL_MEMORY) {
Christoph Lameter53e15af2007-05-06 14:49:43 -07003384 struct kmem_cache_node *n = get_node(s, node);
3385
Christoph Lameter434e2452007-07-17 04:03:30 -07003386 count += validate_slab_node(s, n, map);
Christoph Lameter53e15af2007-05-06 14:49:43 -07003387 }
Christoph Lameter434e2452007-07-17 04:03:30 -07003388 kfree(map);
Christoph Lameter53e15af2007-05-06 14:49:43 -07003389 return count;
3390}
3391
Christoph Lameterb3459702007-05-09 02:32:41 -07003392#ifdef SLUB_RESILIENCY_TEST
3393static void resiliency_test(void)
3394{
3395 u8 *p;
3396
3397 printk(KERN_ERR "SLUB resiliency testing\n");
3398 printk(KERN_ERR "-----------------------\n");
3399 printk(KERN_ERR "A. Corruption after allocation\n");
3400
3401 p = kzalloc(16, GFP_KERNEL);
3402 p[16] = 0x12;
3403 printk(KERN_ERR "\n1. kmalloc-16: Clobber Redzone/next pointer"
3404 " 0x12->0x%p\n\n", p + 16);
3405
3406 validate_slab_cache(kmalloc_caches + 4);
3407
3408 /* Hmmm... The next two are dangerous */
3409 p = kzalloc(32, GFP_KERNEL);
3410 p[32 + sizeof(void *)] = 0x34;
3411 printk(KERN_ERR "\n2. kmalloc-32: Clobber next pointer/next slab"
Ingo Molnar3adbefe2008-02-05 17:57:39 -08003412 " 0x34 -> -0x%p\n", p);
3413 printk(KERN_ERR
3414 "If allocated object is overwritten then not detectable\n\n");
Christoph Lameterb3459702007-05-09 02:32:41 -07003415
3416 validate_slab_cache(kmalloc_caches + 5);
3417 p = kzalloc(64, GFP_KERNEL);
3418 p += 64 + (get_cycles() & 0xff) * sizeof(void *);
3419 *p = 0x56;
3420 printk(KERN_ERR "\n3. kmalloc-64: corrupting random byte 0x56->0x%p\n",
3421 p);
Ingo Molnar3adbefe2008-02-05 17:57:39 -08003422 printk(KERN_ERR
3423 "If allocated object is overwritten then not detectable\n\n");
Christoph Lameterb3459702007-05-09 02:32:41 -07003424 validate_slab_cache(kmalloc_caches + 6);
3425
3426 printk(KERN_ERR "\nB. Corruption after free\n");
3427 p = kzalloc(128, GFP_KERNEL);
3428 kfree(p);
3429 *p = 0x78;
3430 printk(KERN_ERR "1. kmalloc-128: Clobber first word 0x78->0x%p\n\n", p);
3431 validate_slab_cache(kmalloc_caches + 7);
3432
3433 p = kzalloc(256, GFP_KERNEL);
3434 kfree(p);
3435 p[50] = 0x9a;
Ingo Molnar3adbefe2008-02-05 17:57:39 -08003436 printk(KERN_ERR "\n2. kmalloc-256: Clobber 50th byte 0x9a->0x%p\n\n",
3437 p);
Christoph Lameterb3459702007-05-09 02:32:41 -07003438 validate_slab_cache(kmalloc_caches + 8);
3439
3440 p = kzalloc(512, GFP_KERNEL);
3441 kfree(p);
3442 p[512] = 0xab;
3443 printk(KERN_ERR "\n3. kmalloc-512: Clobber redzone 0xab->0x%p\n\n", p);
3444 validate_slab_cache(kmalloc_caches + 9);
3445}
3446#else
3447static void resiliency_test(void) {};
3448#endif
3449
Christoph Lameter88a420e2007-05-06 14:49:45 -07003450/*
Christoph Lameter672bba32007-05-09 02:32:39 -07003451 * Generate lists of code addresses where slabcache objects are allocated
Christoph Lameter88a420e2007-05-06 14:49:45 -07003452 * and freed.
3453 */
3454
3455struct location {
3456 unsigned long count;
3457 void *addr;
Christoph Lameter45edfa52007-05-09 02:32:45 -07003458 long long sum_time;
3459 long min_time;
3460 long max_time;
3461 long min_pid;
3462 long max_pid;
3463 cpumask_t cpus;
3464 nodemask_t nodes;
Christoph Lameter88a420e2007-05-06 14:49:45 -07003465};
3466
3467struct loc_track {
3468 unsigned long max;
3469 unsigned long count;
3470 struct location *loc;
3471};
3472
3473static void free_loc_track(struct loc_track *t)
3474{
3475 if (t->max)
3476 free_pages((unsigned long)t->loc,
3477 get_order(sizeof(struct location) * t->max));
3478}
3479
Christoph Lameter68dff6a2007-07-17 04:03:20 -07003480static int alloc_loc_track(struct loc_track *t, unsigned long max, gfp_t flags)
Christoph Lameter88a420e2007-05-06 14:49:45 -07003481{
3482 struct location *l;
3483 int order;
3484
Christoph Lameter88a420e2007-05-06 14:49:45 -07003485 order = get_order(sizeof(struct location) * max);
3486
Christoph Lameter68dff6a2007-07-17 04:03:20 -07003487 l = (void *)__get_free_pages(flags, order);
Christoph Lameter88a420e2007-05-06 14:49:45 -07003488 if (!l)
3489 return 0;
3490
3491 if (t->count) {
3492 memcpy(l, t->loc, sizeof(struct location) * t->count);
3493 free_loc_track(t);
3494 }
3495 t->max = max;
3496 t->loc = l;
3497 return 1;
3498}
3499
3500static int add_location(struct loc_track *t, struct kmem_cache *s,
Christoph Lameter45edfa52007-05-09 02:32:45 -07003501 const struct track *track)
Christoph Lameter88a420e2007-05-06 14:49:45 -07003502{
3503 long start, end, pos;
3504 struct location *l;
3505 void *caddr;
Christoph Lameter45edfa52007-05-09 02:32:45 -07003506 unsigned long age = jiffies - track->when;
Christoph Lameter88a420e2007-05-06 14:49:45 -07003507
3508 start = -1;
3509 end = t->count;
3510
3511 for ( ; ; ) {
3512 pos = start + (end - start + 1) / 2;
3513
3514 /*
3515 * There is nothing at "end". If we end up there
3516 * we need to add something to before end.
3517 */
3518 if (pos == end)
3519 break;
3520
3521 caddr = t->loc[pos].addr;
Christoph Lameter45edfa52007-05-09 02:32:45 -07003522 if (track->addr == caddr) {
3523
3524 l = &t->loc[pos];
3525 l->count++;
3526 if (track->when) {
3527 l->sum_time += age;
3528 if (age < l->min_time)
3529 l->min_time = age;
3530 if (age > l->max_time)
3531 l->max_time = age;
3532
3533 if (track->pid < l->min_pid)
3534 l->min_pid = track->pid;
3535 if (track->pid > l->max_pid)
3536 l->max_pid = track->pid;
3537
3538 cpu_set(track->cpu, l->cpus);
3539 }
3540 node_set(page_to_nid(virt_to_page(track)), l->nodes);
Christoph Lameter88a420e2007-05-06 14:49:45 -07003541 return 1;
3542 }
3543
Christoph Lameter45edfa52007-05-09 02:32:45 -07003544 if (track->addr < caddr)
Christoph Lameter88a420e2007-05-06 14:49:45 -07003545 end = pos;
3546 else
3547 start = pos;
3548 }
3549
3550 /*
Christoph Lameter672bba32007-05-09 02:32:39 -07003551 * Not found. Insert new tracking element.
Christoph Lameter88a420e2007-05-06 14:49:45 -07003552 */
Christoph Lameter68dff6a2007-07-17 04:03:20 -07003553 if (t->count >= t->max && !alloc_loc_track(t, 2 * t->max, GFP_ATOMIC))
Christoph Lameter88a420e2007-05-06 14:49:45 -07003554 return 0;
3555
3556 l = t->loc + pos;
3557 if (pos < t->count)
3558 memmove(l + 1, l,
3559 (t->count - pos) * sizeof(struct location));
3560 t->count++;
3561 l->count = 1;
Christoph Lameter45edfa52007-05-09 02:32:45 -07003562 l->addr = track->addr;
3563 l->sum_time = age;
3564 l->min_time = age;
3565 l->max_time = age;
3566 l->min_pid = track->pid;
3567 l->max_pid = track->pid;
3568 cpus_clear(l->cpus);
3569 cpu_set(track->cpu, l->cpus);
3570 nodes_clear(l->nodes);
3571 node_set(page_to_nid(virt_to_page(track)), l->nodes);
Christoph Lameter88a420e2007-05-06 14:49:45 -07003572 return 1;
3573}
3574
3575static void process_slab(struct loc_track *t, struct kmem_cache *s,
3576 struct page *page, enum track_item alloc)
3577{
Christoph Lametera973e9d2008-03-01 13:40:44 -08003578 void *addr = page_address(page);
Christoph Lameter39b26462008-04-14 19:11:30 +03003579 DECLARE_BITMAP(map, page->objects);
Christoph Lameter88a420e2007-05-06 14:49:45 -07003580 void *p;
3581
Christoph Lameter39b26462008-04-14 19:11:30 +03003582 bitmap_zero(map, page->objects);
Christoph Lameter7656c722007-05-09 02:32:40 -07003583 for_each_free_object(p, s, page->freelist)
3584 set_bit(slab_index(p, s, addr), map);
Christoph Lameter88a420e2007-05-06 14:49:45 -07003585
Christoph Lameter224a88b2008-04-14 19:11:31 +03003586 for_each_object(p, s, addr, page->objects)
Christoph Lameter45edfa52007-05-09 02:32:45 -07003587 if (!test_bit(slab_index(p, s, addr), map))
3588 add_location(t, s, get_track(s, p, alloc));
Christoph Lameter88a420e2007-05-06 14:49:45 -07003589}
3590
3591static int list_locations(struct kmem_cache *s, char *buf,
3592 enum track_item alloc)
3593{
Harvey Harrisone374d482008-01-31 15:20:50 -08003594 int len = 0;
Christoph Lameter88a420e2007-05-06 14:49:45 -07003595 unsigned long i;
Christoph Lameter68dff6a2007-07-17 04:03:20 -07003596 struct loc_track t = { 0, 0, NULL };
Christoph Lameter88a420e2007-05-06 14:49:45 -07003597 int node;
3598
Christoph Lameter68dff6a2007-07-17 04:03:20 -07003599 if (!alloc_loc_track(&t, PAGE_SIZE / sizeof(struct location),
Andrew Mortonea3061d2007-10-16 01:26:09 -07003600 GFP_TEMPORARY))
Christoph Lameter68dff6a2007-07-17 04:03:20 -07003601 return sprintf(buf, "Out of memory\n");
Christoph Lameter88a420e2007-05-06 14:49:45 -07003602
3603 /* Push back cpu slabs */
3604 flush_all(s);
3605
Christoph Lameterf64dc582007-10-16 01:25:33 -07003606 for_each_node_state(node, N_NORMAL_MEMORY) {
Christoph Lameter88a420e2007-05-06 14:49:45 -07003607 struct kmem_cache_node *n = get_node(s, node);
3608 unsigned long flags;
3609 struct page *page;
3610
Christoph Lameter9e869432007-08-22 14:01:56 -07003611 if (!atomic_long_read(&n->nr_slabs))
Christoph Lameter88a420e2007-05-06 14:49:45 -07003612 continue;
3613
3614 spin_lock_irqsave(&n->list_lock, flags);
3615 list_for_each_entry(page, &n->partial, lru)
3616 process_slab(&t, s, page, alloc);
3617 list_for_each_entry(page, &n->full, lru)
3618 process_slab(&t, s, page, alloc);
3619 spin_unlock_irqrestore(&n->list_lock, flags);
3620 }
3621
3622 for (i = 0; i < t.count; i++) {
Christoph Lameter45edfa52007-05-09 02:32:45 -07003623 struct location *l = &t.loc[i];
Christoph Lameter88a420e2007-05-06 14:49:45 -07003624
Harvey Harrisone374d482008-01-31 15:20:50 -08003625 if (len > PAGE_SIZE - 100)
Christoph Lameter88a420e2007-05-06 14:49:45 -07003626 break;
Harvey Harrisone374d482008-01-31 15:20:50 -08003627 len += sprintf(buf + len, "%7ld ", l->count);
Christoph Lameter45edfa52007-05-09 02:32:45 -07003628
3629 if (l->addr)
Harvey Harrisone374d482008-01-31 15:20:50 -08003630 len += sprint_symbol(buf + len, (unsigned long)l->addr);
Christoph Lameter88a420e2007-05-06 14:49:45 -07003631 else
Harvey Harrisone374d482008-01-31 15:20:50 -08003632 len += sprintf(buf + len, "<not-available>");
Christoph Lameter45edfa52007-05-09 02:32:45 -07003633
3634 if (l->sum_time != l->min_time) {
Harvey Harrisone374d482008-01-31 15:20:50 -08003635 len += sprintf(buf + len, " age=%ld/%ld/%ld",
Roman Zippelf8bd2252008-05-01 04:34:31 -07003636 l->min_time,
3637 (long)div_u64(l->sum_time, l->count),
3638 l->max_time);
Christoph Lameter45edfa52007-05-09 02:32:45 -07003639 } else
Harvey Harrisone374d482008-01-31 15:20:50 -08003640 len += sprintf(buf + len, " age=%ld",
Christoph Lameter45edfa52007-05-09 02:32:45 -07003641 l->min_time);
3642
3643 if (l->min_pid != l->max_pid)
Harvey Harrisone374d482008-01-31 15:20:50 -08003644 len += sprintf(buf + len, " pid=%ld-%ld",
Christoph Lameter45edfa52007-05-09 02:32:45 -07003645 l->min_pid, l->max_pid);
3646 else
Harvey Harrisone374d482008-01-31 15:20:50 -08003647 len += sprintf(buf + len, " pid=%ld",
Christoph Lameter45edfa52007-05-09 02:32:45 -07003648 l->min_pid);
3649
Christoph Lameter84966342007-06-23 17:16:32 -07003650 if (num_online_cpus() > 1 && !cpus_empty(l->cpus) &&
Harvey Harrisone374d482008-01-31 15:20:50 -08003651 len < PAGE_SIZE - 60) {
3652 len += sprintf(buf + len, " cpus=");
3653 len += cpulist_scnprintf(buf + len, PAGE_SIZE - len - 50,
Christoph Lameter45edfa52007-05-09 02:32:45 -07003654 l->cpus);
3655 }
3656
Christoph Lameter84966342007-06-23 17:16:32 -07003657 if (num_online_nodes() > 1 && !nodes_empty(l->nodes) &&
Harvey Harrisone374d482008-01-31 15:20:50 -08003658 len < PAGE_SIZE - 60) {
3659 len += sprintf(buf + len, " nodes=");
3660 len += nodelist_scnprintf(buf + len, PAGE_SIZE - len - 50,
Christoph Lameter45edfa52007-05-09 02:32:45 -07003661 l->nodes);
3662 }
3663
Harvey Harrisone374d482008-01-31 15:20:50 -08003664 len += sprintf(buf + len, "\n");
Christoph Lameter88a420e2007-05-06 14:49:45 -07003665 }
3666
3667 free_loc_track(&t);
3668 if (!t.count)
Harvey Harrisone374d482008-01-31 15:20:50 -08003669 len += sprintf(buf, "No data\n");
3670 return len;
Christoph Lameter88a420e2007-05-06 14:49:45 -07003671}
3672
Christoph Lameter81819f02007-05-06 14:49:36 -07003673enum slab_stat_type {
Christoph Lameter205ab992008-04-14 19:11:40 +03003674 SL_ALL, /* All slabs */
3675 SL_PARTIAL, /* Only partially allocated slabs */
3676 SL_CPU, /* Only slabs used for cpu caches */
3677 SL_OBJECTS, /* Determine allocated objects not slabs */
3678 SL_TOTAL /* Determine object capacity not slabs */
Christoph Lameter81819f02007-05-06 14:49:36 -07003679};
3680
Christoph Lameter205ab992008-04-14 19:11:40 +03003681#define SO_ALL (1 << SL_ALL)
Christoph Lameter81819f02007-05-06 14:49:36 -07003682#define SO_PARTIAL (1 << SL_PARTIAL)
3683#define SO_CPU (1 << SL_CPU)
3684#define SO_OBJECTS (1 << SL_OBJECTS)
Christoph Lameter205ab992008-04-14 19:11:40 +03003685#define SO_TOTAL (1 << SL_TOTAL)
Christoph Lameter81819f02007-05-06 14:49:36 -07003686
Cyrill Gorcunov62e5c4b2008-03-02 23:28:24 +03003687static ssize_t show_slab_objects(struct kmem_cache *s,
3688 char *buf, unsigned long flags)
Christoph Lameter81819f02007-05-06 14:49:36 -07003689{
3690 unsigned long total = 0;
Christoph Lameter81819f02007-05-06 14:49:36 -07003691 int node;
3692 int x;
3693 unsigned long *nodes;
3694 unsigned long *per_cpu;
3695
3696 nodes = kzalloc(2 * sizeof(unsigned long) * nr_node_ids, GFP_KERNEL);
Cyrill Gorcunov62e5c4b2008-03-02 23:28:24 +03003697 if (!nodes)
3698 return -ENOMEM;
Christoph Lameter81819f02007-05-06 14:49:36 -07003699 per_cpu = nodes + nr_node_ids;
3700
Christoph Lameter205ab992008-04-14 19:11:40 +03003701 if (flags & SO_CPU) {
3702 int cpu;
Christoph Lameter81819f02007-05-06 14:49:36 -07003703
Christoph Lameter205ab992008-04-14 19:11:40 +03003704 for_each_possible_cpu(cpu) {
3705 struct kmem_cache_cpu *c = get_cpu_slab(s, cpu);
Christoph Lameterdfb4f092007-10-16 01:26:05 -07003706
Christoph Lameter205ab992008-04-14 19:11:40 +03003707 if (!c || c->node < 0)
3708 continue;
3709
3710 if (c->page) {
3711 if (flags & SO_TOTAL)
3712 x = c->page->objects;
3713 else if (flags & SO_OBJECTS)
3714 x = c->page->inuse;
Christoph Lameter81819f02007-05-06 14:49:36 -07003715 else
3716 x = 1;
Christoph Lameter205ab992008-04-14 19:11:40 +03003717
Christoph Lameter81819f02007-05-06 14:49:36 -07003718 total += x;
Christoph Lameter205ab992008-04-14 19:11:40 +03003719 nodes[c->node] += x;
Christoph Lameter81819f02007-05-06 14:49:36 -07003720 }
Christoph Lameter205ab992008-04-14 19:11:40 +03003721 per_cpu[c->node]++;
Christoph Lameter81819f02007-05-06 14:49:36 -07003722 }
3723 }
3724
Christoph Lameter205ab992008-04-14 19:11:40 +03003725 if (flags & SO_ALL) {
3726 for_each_node_state(node, N_NORMAL_MEMORY) {
3727 struct kmem_cache_node *n = get_node(s, node);
Christoph Lameter81819f02007-05-06 14:49:36 -07003728
Christoph Lameter205ab992008-04-14 19:11:40 +03003729 if (flags & SO_TOTAL)
3730 x = atomic_long_read(&n->total_objects);
3731 else if (flags & SO_OBJECTS)
3732 x = atomic_long_read(&n->total_objects) -
3733 count_partial(n, count_free);
3734
3735 else
3736 x = atomic_long_read(&n->nr_slabs);
3737 total += x;
3738 nodes[node] += x;
3739 }
3740
3741 } else if (flags & SO_PARTIAL) {
3742 for_each_node_state(node, N_NORMAL_MEMORY) {
3743 struct kmem_cache_node *n = get_node(s, node);
3744
3745 if (flags & SO_TOTAL)
3746 x = count_partial(n, count_total);
3747 else if (flags & SO_OBJECTS)
3748 x = count_partial(n, count_inuse);
Christoph Lameter81819f02007-05-06 14:49:36 -07003749 else
3750 x = n->nr_partial;
3751 total += x;
3752 nodes[node] += x;
3753 }
Christoph Lameter81819f02007-05-06 14:49:36 -07003754 }
Christoph Lameter81819f02007-05-06 14:49:36 -07003755 x = sprintf(buf, "%lu", total);
3756#ifdef CONFIG_NUMA
Christoph Lameterf64dc582007-10-16 01:25:33 -07003757 for_each_node_state(node, N_NORMAL_MEMORY)
Christoph Lameter81819f02007-05-06 14:49:36 -07003758 if (nodes[node])
3759 x += sprintf(buf + x, " N%d=%lu",
3760 node, nodes[node]);
3761#endif
3762 kfree(nodes);
3763 return x + sprintf(buf + x, "\n");
3764}
3765
3766static int any_slab_objects(struct kmem_cache *s)
3767{
3768 int node;
Christoph Lameterdfb4f092007-10-16 01:26:05 -07003769
3770 for_each_online_node(node) {
Christoph Lameter81819f02007-05-06 14:49:36 -07003771 struct kmem_cache_node *n = get_node(s, node);
3772
Christoph Lameterdfb4f092007-10-16 01:26:05 -07003773 if (!n)
3774 continue;
3775
Benjamin Herrenschmidt4ea33e22008-05-06 20:42:39 -07003776 if (atomic_long_read(&n->total_objects))
Christoph Lameter81819f02007-05-06 14:49:36 -07003777 return 1;
3778 }
3779 return 0;
3780}
3781
3782#define to_slab_attr(n) container_of(n, struct slab_attribute, attr)
3783#define to_slab(n) container_of(n, struct kmem_cache, kobj);
3784
3785struct slab_attribute {
3786 struct attribute attr;
3787 ssize_t (*show)(struct kmem_cache *s, char *buf);
3788 ssize_t (*store)(struct kmem_cache *s, const char *x, size_t count);
3789};
3790
3791#define SLAB_ATTR_RO(_name) \
3792 static struct slab_attribute _name##_attr = __ATTR_RO(_name)
3793
3794#define SLAB_ATTR(_name) \
3795 static struct slab_attribute _name##_attr = \
3796 __ATTR(_name, 0644, _name##_show, _name##_store)
3797
Christoph Lameter81819f02007-05-06 14:49:36 -07003798static ssize_t slab_size_show(struct kmem_cache *s, char *buf)
3799{
3800 return sprintf(buf, "%d\n", s->size);
3801}
3802SLAB_ATTR_RO(slab_size);
3803
3804static ssize_t align_show(struct kmem_cache *s, char *buf)
3805{
3806 return sprintf(buf, "%d\n", s->align);
3807}
3808SLAB_ATTR_RO(align);
3809
3810static ssize_t object_size_show(struct kmem_cache *s, char *buf)
3811{
3812 return sprintf(buf, "%d\n", s->objsize);
3813}
3814SLAB_ATTR_RO(object_size);
3815
3816static ssize_t objs_per_slab_show(struct kmem_cache *s, char *buf)
3817{
Christoph Lameter834f3d12008-04-14 19:11:31 +03003818 return sprintf(buf, "%d\n", oo_objects(s->oo));
Christoph Lameter81819f02007-05-06 14:49:36 -07003819}
3820SLAB_ATTR_RO(objs_per_slab);
3821
Christoph Lameter06b285d2008-04-14 19:11:41 +03003822static ssize_t order_store(struct kmem_cache *s,
3823 const char *buf, size_t length)
3824{
Christoph Lameter0121c6192008-04-29 16:11:12 -07003825 unsigned long order;
3826 int err;
3827
3828 err = strict_strtoul(buf, 10, &order);
3829 if (err)
3830 return err;
Christoph Lameter06b285d2008-04-14 19:11:41 +03003831
3832 if (order > slub_max_order || order < slub_min_order)
3833 return -EINVAL;
3834
3835 calculate_sizes(s, order);
3836 return length;
3837}
3838
Christoph Lameter81819f02007-05-06 14:49:36 -07003839static ssize_t order_show(struct kmem_cache *s, char *buf)
3840{
Christoph Lameter834f3d12008-04-14 19:11:31 +03003841 return sprintf(buf, "%d\n", oo_order(s->oo));
Christoph Lameter81819f02007-05-06 14:49:36 -07003842}
Christoph Lameter06b285d2008-04-14 19:11:41 +03003843SLAB_ATTR(order);
Christoph Lameter81819f02007-05-06 14:49:36 -07003844
3845static ssize_t ctor_show(struct kmem_cache *s, char *buf)
3846{
3847 if (s->ctor) {
3848 int n = sprint_symbol(buf, (unsigned long)s->ctor);
3849
3850 return n + sprintf(buf + n, "\n");
3851 }
3852 return 0;
3853}
3854SLAB_ATTR_RO(ctor);
3855
Christoph Lameter81819f02007-05-06 14:49:36 -07003856static ssize_t aliases_show(struct kmem_cache *s, char *buf)
3857{
3858 return sprintf(buf, "%d\n", s->refcount - 1);
3859}
3860SLAB_ATTR_RO(aliases);
3861
3862static ssize_t slabs_show(struct kmem_cache *s, char *buf)
3863{
Christoph Lameter205ab992008-04-14 19:11:40 +03003864 return show_slab_objects(s, buf, SO_ALL);
Christoph Lameter81819f02007-05-06 14:49:36 -07003865}
3866SLAB_ATTR_RO(slabs);
3867
3868static ssize_t partial_show(struct kmem_cache *s, char *buf)
3869{
Christoph Lameterd9acf4b2008-02-15 15:22:21 -08003870 return show_slab_objects(s, buf, SO_PARTIAL);
Christoph Lameter81819f02007-05-06 14:49:36 -07003871}
3872SLAB_ATTR_RO(partial);
3873
3874static ssize_t cpu_slabs_show(struct kmem_cache *s, char *buf)
3875{
Christoph Lameterd9acf4b2008-02-15 15:22:21 -08003876 return show_slab_objects(s, buf, SO_CPU);
Christoph Lameter81819f02007-05-06 14:49:36 -07003877}
3878SLAB_ATTR_RO(cpu_slabs);
3879
3880static ssize_t objects_show(struct kmem_cache *s, char *buf)
3881{
Christoph Lameter205ab992008-04-14 19:11:40 +03003882 return show_slab_objects(s, buf, SO_ALL|SO_OBJECTS);
Christoph Lameter81819f02007-05-06 14:49:36 -07003883}
3884SLAB_ATTR_RO(objects);
3885
Christoph Lameter205ab992008-04-14 19:11:40 +03003886static ssize_t objects_partial_show(struct kmem_cache *s, char *buf)
3887{
3888 return show_slab_objects(s, buf, SO_PARTIAL|SO_OBJECTS);
3889}
3890SLAB_ATTR_RO(objects_partial);
3891
3892static ssize_t total_objects_show(struct kmem_cache *s, char *buf)
3893{
3894 return show_slab_objects(s, buf, SO_ALL|SO_TOTAL);
3895}
3896SLAB_ATTR_RO(total_objects);
3897
Christoph Lameter81819f02007-05-06 14:49:36 -07003898static ssize_t sanity_checks_show(struct kmem_cache *s, char *buf)
3899{
3900 return sprintf(buf, "%d\n", !!(s->flags & SLAB_DEBUG_FREE));
3901}
3902
3903static ssize_t sanity_checks_store(struct kmem_cache *s,
3904 const char *buf, size_t length)
3905{
3906 s->flags &= ~SLAB_DEBUG_FREE;
3907 if (buf[0] == '1')
3908 s->flags |= SLAB_DEBUG_FREE;
3909 return length;
3910}
3911SLAB_ATTR(sanity_checks);
3912
3913static ssize_t trace_show(struct kmem_cache *s, char *buf)
3914{
3915 return sprintf(buf, "%d\n", !!(s->flags & SLAB_TRACE));
3916}
3917
3918static ssize_t trace_store(struct kmem_cache *s, const char *buf,
3919 size_t length)
3920{
3921 s->flags &= ~SLAB_TRACE;
3922 if (buf[0] == '1')
3923 s->flags |= SLAB_TRACE;
3924 return length;
3925}
3926SLAB_ATTR(trace);
3927
3928static ssize_t reclaim_account_show(struct kmem_cache *s, char *buf)
3929{
3930 return sprintf(buf, "%d\n", !!(s->flags & SLAB_RECLAIM_ACCOUNT));
3931}
3932
3933static ssize_t reclaim_account_store(struct kmem_cache *s,
3934 const char *buf, size_t length)
3935{
3936 s->flags &= ~SLAB_RECLAIM_ACCOUNT;
3937 if (buf[0] == '1')
3938 s->flags |= SLAB_RECLAIM_ACCOUNT;
3939 return length;
3940}
3941SLAB_ATTR(reclaim_account);
3942
3943static ssize_t hwcache_align_show(struct kmem_cache *s, char *buf)
3944{
Christoph Lameter5af60832007-05-06 14:49:56 -07003945 return sprintf(buf, "%d\n", !!(s->flags & SLAB_HWCACHE_ALIGN));
Christoph Lameter81819f02007-05-06 14:49:36 -07003946}
3947SLAB_ATTR_RO(hwcache_align);
3948
3949#ifdef CONFIG_ZONE_DMA
3950static ssize_t cache_dma_show(struct kmem_cache *s, char *buf)
3951{
3952 return sprintf(buf, "%d\n", !!(s->flags & SLAB_CACHE_DMA));
3953}
3954SLAB_ATTR_RO(cache_dma);
3955#endif
3956
3957static ssize_t destroy_by_rcu_show(struct kmem_cache *s, char *buf)
3958{
3959 return sprintf(buf, "%d\n", !!(s->flags & SLAB_DESTROY_BY_RCU));
3960}
3961SLAB_ATTR_RO(destroy_by_rcu);
3962
3963static ssize_t red_zone_show(struct kmem_cache *s, char *buf)
3964{
3965 return sprintf(buf, "%d\n", !!(s->flags & SLAB_RED_ZONE));
3966}
3967
3968static ssize_t red_zone_store(struct kmem_cache *s,
3969 const char *buf, size_t length)
3970{
3971 if (any_slab_objects(s))
3972 return -EBUSY;
3973
3974 s->flags &= ~SLAB_RED_ZONE;
3975 if (buf[0] == '1')
3976 s->flags |= SLAB_RED_ZONE;
Christoph Lameter06b285d2008-04-14 19:11:41 +03003977 calculate_sizes(s, -1);
Christoph Lameter81819f02007-05-06 14:49:36 -07003978 return length;
3979}
3980SLAB_ATTR(red_zone);
3981
3982static ssize_t poison_show(struct kmem_cache *s, char *buf)
3983{
3984 return sprintf(buf, "%d\n", !!(s->flags & SLAB_POISON));
3985}
3986
3987static ssize_t poison_store(struct kmem_cache *s,
3988 const char *buf, size_t length)
3989{
3990 if (any_slab_objects(s))
3991 return -EBUSY;
3992
3993 s->flags &= ~SLAB_POISON;
3994 if (buf[0] == '1')
3995 s->flags |= SLAB_POISON;
Christoph Lameter06b285d2008-04-14 19:11:41 +03003996 calculate_sizes(s, -1);
Christoph Lameter81819f02007-05-06 14:49:36 -07003997 return length;
3998}
3999SLAB_ATTR(poison);
4000
4001static ssize_t store_user_show(struct kmem_cache *s, char *buf)
4002{
4003 return sprintf(buf, "%d\n", !!(s->flags & SLAB_STORE_USER));
4004}
4005
4006static ssize_t store_user_store(struct kmem_cache *s,
4007 const char *buf, size_t length)
4008{
4009 if (any_slab_objects(s))
4010 return -EBUSY;
4011
4012 s->flags &= ~SLAB_STORE_USER;
4013 if (buf[0] == '1')
4014 s->flags |= SLAB_STORE_USER;
Christoph Lameter06b285d2008-04-14 19:11:41 +03004015 calculate_sizes(s, -1);
Christoph Lameter81819f02007-05-06 14:49:36 -07004016 return length;
4017}
4018SLAB_ATTR(store_user);
4019
Christoph Lameter53e15af2007-05-06 14:49:43 -07004020static ssize_t validate_show(struct kmem_cache *s, char *buf)
4021{
4022 return 0;
4023}
4024
4025static ssize_t validate_store(struct kmem_cache *s,
4026 const char *buf, size_t length)
4027{
Christoph Lameter434e2452007-07-17 04:03:30 -07004028 int ret = -EINVAL;
4029
4030 if (buf[0] == '1') {
4031 ret = validate_slab_cache(s);
4032 if (ret >= 0)
4033 ret = length;
4034 }
4035 return ret;
Christoph Lameter53e15af2007-05-06 14:49:43 -07004036}
4037SLAB_ATTR(validate);
4038
Christoph Lameter2086d262007-05-06 14:49:46 -07004039static ssize_t shrink_show(struct kmem_cache *s, char *buf)
4040{
4041 return 0;
4042}
4043
4044static ssize_t shrink_store(struct kmem_cache *s,
4045 const char *buf, size_t length)
4046{
4047 if (buf[0] == '1') {
4048 int rc = kmem_cache_shrink(s);
4049
4050 if (rc)
4051 return rc;
4052 } else
4053 return -EINVAL;
4054 return length;
4055}
4056SLAB_ATTR(shrink);
4057
Christoph Lameter88a420e2007-05-06 14:49:45 -07004058static ssize_t alloc_calls_show(struct kmem_cache *s, char *buf)
4059{
4060 if (!(s->flags & SLAB_STORE_USER))
4061 return -ENOSYS;
4062 return list_locations(s, buf, TRACK_ALLOC);
4063}
4064SLAB_ATTR_RO(alloc_calls);
4065
4066static ssize_t free_calls_show(struct kmem_cache *s, char *buf)
4067{
4068 if (!(s->flags & SLAB_STORE_USER))
4069 return -ENOSYS;
4070 return list_locations(s, buf, TRACK_FREE);
4071}
4072SLAB_ATTR_RO(free_calls);
4073
Christoph Lameter81819f02007-05-06 14:49:36 -07004074#ifdef CONFIG_NUMA
Christoph Lameter98246012008-01-07 23:20:26 -08004075static ssize_t remote_node_defrag_ratio_show(struct kmem_cache *s, char *buf)
Christoph Lameter81819f02007-05-06 14:49:36 -07004076{
Christoph Lameter98246012008-01-07 23:20:26 -08004077 return sprintf(buf, "%d\n", s->remote_node_defrag_ratio / 10);
Christoph Lameter81819f02007-05-06 14:49:36 -07004078}
4079
Christoph Lameter98246012008-01-07 23:20:26 -08004080static ssize_t remote_node_defrag_ratio_store(struct kmem_cache *s,
Christoph Lameter81819f02007-05-06 14:49:36 -07004081 const char *buf, size_t length)
4082{
Christoph Lameter0121c6192008-04-29 16:11:12 -07004083 unsigned long ratio;
4084 int err;
Christoph Lameter81819f02007-05-06 14:49:36 -07004085
Christoph Lameter0121c6192008-04-29 16:11:12 -07004086 err = strict_strtoul(buf, 10, &ratio);
4087 if (err)
4088 return err;
4089
4090 if (ratio < 100)
4091 s->remote_node_defrag_ratio = ratio * 10;
4092
Christoph Lameter81819f02007-05-06 14:49:36 -07004093 return length;
4094}
Christoph Lameter98246012008-01-07 23:20:26 -08004095SLAB_ATTR(remote_node_defrag_ratio);
Christoph Lameter81819f02007-05-06 14:49:36 -07004096#endif
4097
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08004098#ifdef CONFIG_SLUB_STATS
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08004099static int show_stat(struct kmem_cache *s, char *buf, enum stat_item si)
4100{
4101 unsigned long sum = 0;
4102 int cpu;
4103 int len;
4104 int *data = kmalloc(nr_cpu_ids * sizeof(int), GFP_KERNEL);
4105
4106 if (!data)
4107 return -ENOMEM;
4108
4109 for_each_online_cpu(cpu) {
4110 unsigned x = get_cpu_slab(s, cpu)->stat[si];
4111
4112 data[cpu] = x;
4113 sum += x;
4114 }
4115
4116 len = sprintf(buf, "%lu", sum);
4117
Christoph Lameter50ef37b2008-04-14 18:52:05 +03004118#ifdef CONFIG_SMP
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08004119 for_each_online_cpu(cpu) {
4120 if (data[cpu] && len < PAGE_SIZE - 20)
Christoph Lameter50ef37b2008-04-14 18:52:05 +03004121 len += sprintf(buf + len, " C%d=%u", cpu, data[cpu]);
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08004122 }
Christoph Lameter50ef37b2008-04-14 18:52:05 +03004123#endif
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08004124 kfree(data);
4125 return len + sprintf(buf + len, "\n");
4126}
4127
4128#define STAT_ATTR(si, text) \
4129static ssize_t text##_show(struct kmem_cache *s, char *buf) \
4130{ \
4131 return show_stat(s, buf, si); \
4132} \
4133SLAB_ATTR_RO(text); \
4134
4135STAT_ATTR(ALLOC_FASTPATH, alloc_fastpath);
4136STAT_ATTR(ALLOC_SLOWPATH, alloc_slowpath);
4137STAT_ATTR(FREE_FASTPATH, free_fastpath);
4138STAT_ATTR(FREE_SLOWPATH, free_slowpath);
4139STAT_ATTR(FREE_FROZEN, free_frozen);
4140STAT_ATTR(FREE_ADD_PARTIAL, free_add_partial);
4141STAT_ATTR(FREE_REMOVE_PARTIAL, free_remove_partial);
4142STAT_ATTR(ALLOC_FROM_PARTIAL, alloc_from_partial);
4143STAT_ATTR(ALLOC_SLAB, alloc_slab);
4144STAT_ATTR(ALLOC_REFILL, alloc_refill);
4145STAT_ATTR(FREE_SLAB, free_slab);
4146STAT_ATTR(CPUSLAB_FLUSH, cpuslab_flush);
4147STAT_ATTR(DEACTIVATE_FULL, deactivate_full);
4148STAT_ATTR(DEACTIVATE_EMPTY, deactivate_empty);
4149STAT_ATTR(DEACTIVATE_TO_HEAD, deactivate_to_head);
4150STAT_ATTR(DEACTIVATE_TO_TAIL, deactivate_to_tail);
4151STAT_ATTR(DEACTIVATE_REMOTE_FREES, deactivate_remote_frees);
Christoph Lameter65c33762008-04-14 19:11:40 +03004152STAT_ATTR(ORDER_FALLBACK, order_fallback);
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08004153#endif
4154
Pekka Enberg06428782008-01-07 23:20:27 -08004155static struct attribute *slab_attrs[] = {
Christoph Lameter81819f02007-05-06 14:49:36 -07004156 &slab_size_attr.attr,
4157 &object_size_attr.attr,
4158 &objs_per_slab_attr.attr,
4159 &order_attr.attr,
4160 &objects_attr.attr,
Christoph Lameter205ab992008-04-14 19:11:40 +03004161 &objects_partial_attr.attr,
4162 &total_objects_attr.attr,
Christoph Lameter81819f02007-05-06 14:49:36 -07004163 &slabs_attr.attr,
4164 &partial_attr.attr,
4165 &cpu_slabs_attr.attr,
4166 &ctor_attr.attr,
Christoph Lameter81819f02007-05-06 14:49:36 -07004167 &aliases_attr.attr,
4168 &align_attr.attr,
4169 &sanity_checks_attr.attr,
4170 &trace_attr.attr,
4171 &hwcache_align_attr.attr,
4172 &reclaim_account_attr.attr,
4173 &destroy_by_rcu_attr.attr,
4174 &red_zone_attr.attr,
4175 &poison_attr.attr,
4176 &store_user_attr.attr,
Christoph Lameter53e15af2007-05-06 14:49:43 -07004177 &validate_attr.attr,
Christoph Lameter2086d262007-05-06 14:49:46 -07004178 &shrink_attr.attr,
Christoph Lameter88a420e2007-05-06 14:49:45 -07004179 &alloc_calls_attr.attr,
4180 &free_calls_attr.attr,
Christoph Lameter81819f02007-05-06 14:49:36 -07004181#ifdef CONFIG_ZONE_DMA
4182 &cache_dma_attr.attr,
4183#endif
4184#ifdef CONFIG_NUMA
Christoph Lameter98246012008-01-07 23:20:26 -08004185 &remote_node_defrag_ratio_attr.attr,
Christoph Lameter81819f02007-05-06 14:49:36 -07004186#endif
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08004187#ifdef CONFIG_SLUB_STATS
4188 &alloc_fastpath_attr.attr,
4189 &alloc_slowpath_attr.attr,
4190 &free_fastpath_attr.attr,
4191 &free_slowpath_attr.attr,
4192 &free_frozen_attr.attr,
4193 &free_add_partial_attr.attr,
4194 &free_remove_partial_attr.attr,
4195 &alloc_from_partial_attr.attr,
4196 &alloc_slab_attr.attr,
4197 &alloc_refill_attr.attr,
4198 &free_slab_attr.attr,
4199 &cpuslab_flush_attr.attr,
4200 &deactivate_full_attr.attr,
4201 &deactivate_empty_attr.attr,
4202 &deactivate_to_head_attr.attr,
4203 &deactivate_to_tail_attr.attr,
4204 &deactivate_remote_frees_attr.attr,
Christoph Lameter65c33762008-04-14 19:11:40 +03004205 &order_fallback_attr.attr,
Christoph Lameter8ff12cf2008-02-07 17:47:41 -08004206#endif
Christoph Lameter81819f02007-05-06 14:49:36 -07004207 NULL
4208};
4209
4210static struct attribute_group slab_attr_group = {
4211 .attrs = slab_attrs,
4212};
4213
4214static ssize_t slab_attr_show(struct kobject *kobj,
4215 struct attribute *attr,
4216 char *buf)
4217{
4218 struct slab_attribute *attribute;
4219 struct kmem_cache *s;
4220 int err;
4221
4222 attribute = to_slab_attr(attr);
4223 s = to_slab(kobj);
4224
4225 if (!attribute->show)
4226 return -EIO;
4227
4228 err = attribute->show(s, buf);
4229
4230 return err;
4231}
4232
4233static ssize_t slab_attr_store(struct kobject *kobj,
4234 struct attribute *attr,
4235 const char *buf, size_t len)
4236{
4237 struct slab_attribute *attribute;
4238 struct kmem_cache *s;
4239 int err;
4240
4241 attribute = to_slab_attr(attr);
4242 s = to_slab(kobj);
4243
4244 if (!attribute->store)
4245 return -EIO;
4246
4247 err = attribute->store(s, buf, len);
4248
4249 return err;
4250}
4251
Christoph Lameter151c6022008-01-07 22:29:05 -08004252static void kmem_cache_release(struct kobject *kobj)
4253{
4254 struct kmem_cache *s = to_slab(kobj);
4255
4256 kfree(s);
4257}
4258
Christoph Lameter81819f02007-05-06 14:49:36 -07004259static struct sysfs_ops slab_sysfs_ops = {
4260 .show = slab_attr_show,
4261 .store = slab_attr_store,
4262};
4263
4264static struct kobj_type slab_ktype = {
4265 .sysfs_ops = &slab_sysfs_ops,
Christoph Lameter151c6022008-01-07 22:29:05 -08004266 .release = kmem_cache_release
Christoph Lameter81819f02007-05-06 14:49:36 -07004267};
4268
4269static int uevent_filter(struct kset *kset, struct kobject *kobj)
4270{
4271 struct kobj_type *ktype = get_ktype(kobj);
4272
4273 if (ktype == &slab_ktype)
4274 return 1;
4275 return 0;
4276}
4277
4278static struct kset_uevent_ops slab_uevent_ops = {
4279 .filter = uevent_filter,
4280};
4281
Greg Kroah-Hartman27c3a312007-11-01 09:29:06 -06004282static struct kset *slab_kset;
Christoph Lameter81819f02007-05-06 14:49:36 -07004283
4284#define ID_STR_LENGTH 64
4285
4286/* Create a unique string id for a slab cache:
Christoph Lameter6446faa2008-02-15 23:45:26 -08004287 *
4288 * Format :[flags-]size
Christoph Lameter81819f02007-05-06 14:49:36 -07004289 */
4290static char *create_unique_id(struct kmem_cache *s)
4291{
4292 char *name = kmalloc(ID_STR_LENGTH, GFP_KERNEL);
4293 char *p = name;
4294
4295 BUG_ON(!name);
4296
4297 *p++ = ':';
4298 /*
4299 * First flags affecting slabcache operations. We will only
4300 * get here for aliasable slabs so we do not need to support
4301 * too many flags. The flags here must cover all flags that
4302 * are matched during merging to guarantee that the id is
4303 * unique.
4304 */
4305 if (s->flags & SLAB_CACHE_DMA)
4306 *p++ = 'd';
4307 if (s->flags & SLAB_RECLAIM_ACCOUNT)
4308 *p++ = 'a';
4309 if (s->flags & SLAB_DEBUG_FREE)
4310 *p++ = 'F';
4311 if (p != name + 1)
4312 *p++ = '-';
4313 p += sprintf(p, "%07d", s->size);
4314 BUG_ON(p > name + ID_STR_LENGTH - 1);
4315 return name;
4316}
4317
4318static int sysfs_slab_add(struct kmem_cache *s)
4319{
4320 int err;
4321 const char *name;
4322 int unmergeable;
4323
4324 if (slab_state < SYSFS)
4325 /* Defer until later */
4326 return 0;
4327
4328 unmergeable = slab_unmergeable(s);
4329 if (unmergeable) {
4330 /*
4331 * Slabcache can never be merged so we can use the name proper.
4332 * This is typically the case for debug situations. In that
4333 * case we can catch duplicate names easily.
4334 */
Greg Kroah-Hartman27c3a312007-11-01 09:29:06 -06004335 sysfs_remove_link(&slab_kset->kobj, s->name);
Christoph Lameter81819f02007-05-06 14:49:36 -07004336 name = s->name;
4337 } else {
4338 /*
4339 * Create a unique name for the slab as a target
4340 * for the symlinks.
4341 */
4342 name = create_unique_id(s);
4343 }
4344
Greg Kroah-Hartman27c3a312007-11-01 09:29:06 -06004345 s->kobj.kset = slab_kset;
Greg Kroah-Hartman1eada112007-12-17 23:05:35 -07004346 err = kobject_init_and_add(&s->kobj, &slab_ktype, NULL, name);
4347 if (err) {
4348 kobject_put(&s->kobj);
Christoph Lameter81819f02007-05-06 14:49:36 -07004349 return err;
Greg Kroah-Hartman1eada112007-12-17 23:05:35 -07004350 }
Christoph Lameter81819f02007-05-06 14:49:36 -07004351
4352 err = sysfs_create_group(&s->kobj, &slab_attr_group);
4353 if (err)
4354 return err;
4355 kobject_uevent(&s->kobj, KOBJ_ADD);
4356 if (!unmergeable) {
4357 /* Setup first alias */
4358 sysfs_slab_alias(s, s->name);
4359 kfree(name);
4360 }
4361 return 0;
4362}
4363
4364static void sysfs_slab_remove(struct kmem_cache *s)
4365{
4366 kobject_uevent(&s->kobj, KOBJ_REMOVE);
4367 kobject_del(&s->kobj);
Christoph Lameter151c6022008-01-07 22:29:05 -08004368 kobject_put(&s->kobj);
Christoph Lameter81819f02007-05-06 14:49:36 -07004369}
4370
4371/*
4372 * Need to buffer aliases during bootup until sysfs becomes
4373 * available lest we loose that information.
4374 */
4375struct saved_alias {
4376 struct kmem_cache *s;
4377 const char *name;
4378 struct saved_alias *next;
4379};
4380
Adrian Bunk5af328a2007-07-17 04:03:27 -07004381static struct saved_alias *alias_list;
Christoph Lameter81819f02007-05-06 14:49:36 -07004382
4383static int sysfs_slab_alias(struct kmem_cache *s, const char *name)
4384{
4385 struct saved_alias *al;
4386
4387 if (slab_state == SYSFS) {
4388 /*
4389 * If we have a leftover link then remove it.
4390 */
Greg Kroah-Hartman27c3a312007-11-01 09:29:06 -06004391 sysfs_remove_link(&slab_kset->kobj, name);
4392 return sysfs_create_link(&slab_kset->kobj, &s->kobj, name);
Christoph Lameter81819f02007-05-06 14:49:36 -07004393 }
4394
4395 al = kmalloc(sizeof(struct saved_alias), GFP_KERNEL);
4396 if (!al)
4397 return -ENOMEM;
4398
4399 al->s = s;
4400 al->name = name;
4401 al->next = alias_list;
4402 alias_list = al;
4403 return 0;
4404}
4405
4406static int __init slab_sysfs_init(void)
4407{
Christoph Lameter5b95a4ac2007-07-17 04:03:19 -07004408 struct kmem_cache *s;
Christoph Lameter81819f02007-05-06 14:49:36 -07004409 int err;
4410
Greg Kroah-Hartman0ff21e42007-11-06 10:36:58 -08004411 slab_kset = kset_create_and_add("slab", &slab_uevent_ops, kernel_kobj);
Greg Kroah-Hartman27c3a312007-11-01 09:29:06 -06004412 if (!slab_kset) {
Christoph Lameter81819f02007-05-06 14:49:36 -07004413 printk(KERN_ERR "Cannot register slab subsystem.\n");
4414 return -ENOSYS;
4415 }
4416
Christoph Lameter26a7bd02007-05-09 02:32:39 -07004417 slab_state = SYSFS;
4418
Christoph Lameter5b95a4ac2007-07-17 04:03:19 -07004419 list_for_each_entry(s, &slab_caches, list) {
Christoph Lameter26a7bd02007-05-09 02:32:39 -07004420 err = sysfs_slab_add(s);
Christoph Lameter5d540fb2007-08-30 23:56:26 -07004421 if (err)
4422 printk(KERN_ERR "SLUB: Unable to add boot slab %s"
4423 " to sysfs\n", s->name);
Christoph Lameter26a7bd02007-05-09 02:32:39 -07004424 }
Christoph Lameter81819f02007-05-06 14:49:36 -07004425
4426 while (alias_list) {
4427 struct saved_alias *al = alias_list;
4428
4429 alias_list = alias_list->next;
4430 err = sysfs_slab_alias(al->s, al->name);
Christoph Lameter5d540fb2007-08-30 23:56:26 -07004431 if (err)
4432 printk(KERN_ERR "SLUB: Unable to add boot slab alias"
4433 " %s to sysfs\n", s->name);
Christoph Lameter81819f02007-05-06 14:49:36 -07004434 kfree(al);
4435 }
4436
4437 resiliency_test();
4438 return 0;
4439}
4440
4441__initcall(slab_sysfs_init);
Christoph Lameter81819f02007-05-06 14:49:36 -07004442#endif
Pekka J Enberg57ed3ed2008-01-01 17:23:28 +01004443
4444/*
4445 * The /proc/slabinfo ABI
4446 */
Linus Torvalds158a9622008-01-02 13:04:48 -08004447#ifdef CONFIG_SLABINFO
4448
Christoph Lameter0121c6192008-04-29 16:11:12 -07004449ssize_t slabinfo_write(struct file *file, const char __user *buffer,
4450 size_t count, loff_t *ppos)
Linus Torvalds158a9622008-01-02 13:04:48 -08004451{
4452 return -EINVAL;
4453}
4454
Pekka J Enberg57ed3ed2008-01-01 17:23:28 +01004455
4456static void print_slabinfo_header(struct seq_file *m)
4457{
4458 seq_puts(m, "slabinfo - version: 2.1\n");
4459 seq_puts(m, "# name <active_objs> <num_objs> <objsize> "
4460 "<objperslab> <pagesperslab>");
4461 seq_puts(m, " : tunables <limit> <batchcount> <sharedfactor>");
4462 seq_puts(m, " : slabdata <active_slabs> <num_slabs> <sharedavail>");
4463 seq_putc(m, '\n');
4464}
4465
4466static void *s_start(struct seq_file *m, loff_t *pos)
4467{
4468 loff_t n = *pos;
4469
4470 down_read(&slub_lock);
4471 if (!n)
4472 print_slabinfo_header(m);
4473
4474 return seq_list_start(&slab_caches, *pos);
4475}
4476
4477static void *s_next(struct seq_file *m, void *p, loff_t *pos)
4478{
4479 return seq_list_next(p, &slab_caches, pos);
4480}
4481
4482static void s_stop(struct seq_file *m, void *p)
4483{
4484 up_read(&slub_lock);
4485}
4486
4487static int s_show(struct seq_file *m, void *p)
4488{
4489 unsigned long nr_partials = 0;
4490 unsigned long nr_slabs = 0;
4491 unsigned long nr_inuse = 0;
Christoph Lameter205ab992008-04-14 19:11:40 +03004492 unsigned long nr_objs = 0;
4493 unsigned long nr_free = 0;
Pekka J Enberg57ed3ed2008-01-01 17:23:28 +01004494 struct kmem_cache *s;
4495 int node;
4496
4497 s = list_entry(p, struct kmem_cache, list);
4498
4499 for_each_online_node(node) {
4500 struct kmem_cache_node *n = get_node(s, node);
4501
4502 if (!n)
4503 continue;
4504
4505 nr_partials += n->nr_partial;
4506 nr_slabs += atomic_long_read(&n->nr_slabs);
Christoph Lameter205ab992008-04-14 19:11:40 +03004507 nr_objs += atomic_long_read(&n->total_objects);
4508 nr_free += count_partial(n, count_free);
Pekka J Enberg57ed3ed2008-01-01 17:23:28 +01004509 }
4510
Christoph Lameter205ab992008-04-14 19:11:40 +03004511 nr_inuse = nr_objs - nr_free;
Pekka J Enberg57ed3ed2008-01-01 17:23:28 +01004512
4513 seq_printf(m, "%-17s %6lu %6lu %6u %4u %4d", s->name, nr_inuse,
Christoph Lameter834f3d12008-04-14 19:11:31 +03004514 nr_objs, s->size, oo_objects(s->oo),
4515 (1 << oo_order(s->oo)));
Pekka J Enberg57ed3ed2008-01-01 17:23:28 +01004516 seq_printf(m, " : tunables %4u %4u %4u", 0, 0, 0);
4517 seq_printf(m, " : slabdata %6lu %6lu %6lu", nr_slabs, nr_slabs,
4518 0UL);
4519 seq_putc(m, '\n');
4520 return 0;
4521}
4522
4523const struct seq_operations slabinfo_op = {
4524 .start = s_start,
4525 .next = s_next,
4526 .stop = s_stop,
4527 .show = s_show,
4528};
4529
Linus Torvalds158a9622008-01-02 13:04:48 -08004530#endif /* CONFIG_SLABINFO */