2 * SLUB: A slab allocator that limits cache line use instead of queuing
3 * objects in per cpu and per node lists.
5 * The allocator synchronizes using per slab locks and only
6 * uses a centralized lock to manage a pool of partial slabs.
8 * (C) 2007 SGI, Christoph Lameter
12 #include <linux/swap.h> /* struct reclaim_state */
13 #include <linux/module.h>
14 #include <linux/bit_spinlock.h>
15 #include <linux/interrupt.h>
16 #include <linux/bitops.h>
17 #include <linux/slab.h>
18 #include <linux/proc_fs.h>
19 #include <linux/seq_file.h>
20 #include <trace/kmemtrace.h>
21 #include <linux/cpu.h>
22 #include <linux/cpuset.h>
23 #include <linux/mempolicy.h>
24 #include <linux/ctype.h>
25 #include <linux/debugobjects.h>
26 #include <linux/kallsyms.h>
27 #include <linux/memory.h>
28 #include <linux/math64.h>
29 #include <linux/fault-inject.h>
36 * The slab_lock protects operations on the object of a particular
37 * slab and its metadata in the page struct. If the slab lock
38 * has been taken then no allocations nor frees can be performed
39 * on the objects in the slab nor can the slab be added or removed
40 * from the partial or full lists since this would mean modifying
41 * the page_struct of the slab.
43 * The list_lock protects the partial and full list on each node and
44 * the partial slab counter. If taken then no new slabs may be added or
45 * removed from the lists nor make the number of partial slabs be modified.
46 * (Note that the total number of slabs is an atomic value that may be
47 * modified without taking the list lock).
49 * The list_lock is a centralized lock and thus we avoid taking it as
50 * much as possible. As long as SLUB does not have to handle partial
51 * slabs, operations can continue without any centralized lock. F.e.
52 * allocating a long series of objects that fill up slabs does not require
55 * The lock order is sometimes inverted when we are trying to get a slab
56 * off a list. We take the list_lock and then look for a page on the list
57 * to use. While we do that objects in the slabs may be freed. We can
58 * only operate on the slab if we have also taken the slab_lock. So we use
59 * a slab_trylock() on the slab. If trylock was successful then no frees
60 * can occur anymore and we can use the slab for allocations etc. If the
61 * slab_trylock() does not succeed then frees are in progress in the slab and
62 * we must stay away from it for a while since we may cause a bouncing
63 * cacheline if we try to acquire the lock. So go onto the next slab.
64 * If all pages are busy then we may allocate a new slab instead of reusing
65 * a partial slab. A new slab has noone operating on it and thus there is
66 * no danger of cacheline contention.
68 * Interrupts are disabled during allocation and deallocation in order to
69 * make the slab allocator safe to use in the context of an irq. In addition
70 * interrupts are disabled to ensure that the processor does not change
71 * while handling per_cpu slabs, due to kernel preemption.
73 * SLUB assigns one slab for allocation to each processor.
74 * Allocations only occur from these slabs called cpu slabs.
76 * Slabs with free elements are kept on a partial list and during regular
77 * operations no list for full slabs is used. If an object in a full slab is
78 * freed then the slab will show up again on the partial lists.
79 * We track full slabs for debugging purposes though because otherwise we
80 * cannot scan all objects.
82 * Slabs are freed when they become empty. Teardown and setup is
83 * minimal so we rely on the page allocators per cpu caches for
84 * fast frees and allocs.
86 * Overloading of page flags that are otherwise used for LRU management.
88 * PageActive The slab is frozen and exempt from list processing.
89 * This means that the slab is dedicated to a purpose
90 * such as satisfying allocations for a specific
91 * processor. Objects may be freed in the slab while
92 * it is frozen but slab_free will then skip the usual
93 * list operations. It is up to the processor holding
94 * the slab to integrate the slab into the slab lists
95 * when the slab is no longer needed.
97 * One use of this flag is to mark slabs that are
98 * used for allocations. Then such a slab becomes a cpu
99 * slab. The cpu slab may be equipped with an additional
100 * freelist that allows lockless access to
101 * free objects in addition to the regular freelist
102 * that requires the slab lock.
104 * PageError Slab requires special handling due to debug
105 * options set. This moves slab handling out of
106 * the fast path and disables lockless freelists.
109 #ifdef CONFIG_SLUB_DEBUG
116 * Issues still to be resolved:
118 * - Support PAGE_ALLOC_DEBUG. Should be easy to do.
120 * - Variable sizing of the per node arrays
123 /* Enable to test recovery from slab corruption on boot */
124 #undef SLUB_RESILIENCY_TEST
127 * Mininum number of partial slabs. These will be left on the partial
128 * lists even if they are empty. kmem_cache_shrink may reclaim them.
130 #define MIN_PARTIAL 5
133 * Maximum number of desirable partial slabs.
134 * The existence of more partial slabs makes kmem_cache_shrink
135 * sort the partial list by the number of objects in the.
137 #define MAX_PARTIAL 10
139 #define DEBUG_DEFAULT_FLAGS (SLAB_DEBUG_FREE | SLAB_RED_ZONE | \
140 SLAB_POISON | SLAB_STORE_USER)
143 * Set of flags that will prevent slab merging
145 #define SLUB_NEVER_MERGE (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER | \
146 SLAB_TRACE | SLAB_DESTROY_BY_RCU)
148 #define SLUB_MERGE_SAME (SLAB_DEBUG_FREE | SLAB_RECLAIM_ACCOUNT | \
151 #ifndef ARCH_KMALLOC_MINALIGN
152 #define ARCH_KMALLOC_MINALIGN __alignof__(unsigned long long)
155 #ifndef ARCH_SLAB_MINALIGN
156 #define ARCH_SLAB_MINALIGN __alignof__(unsigned long long)
160 #define OO_MASK ((1 << OO_SHIFT) - 1)
161 #define MAX_OBJS_PER_PAGE 65535 /* since page.objects is u16 */
163 /* Internal SLUB flags */
164 #define __OBJECT_POISON 0x80000000 /* Poison object */
165 #define __SYSFS_ADD_DEFERRED 0x40000000 /* Not yet visible via sysfs */
167 static int kmem_size = sizeof(struct kmem_cache);
170 static struct notifier_block slab_notifier;
174 DOWN, /* No slab functionality available */
175 PARTIAL, /* kmem_cache_open() works but kmalloc does not */
176 UP, /* Everything works but does not show up in sysfs */
180 /* A list of all slab caches on the system */
181 static DECLARE_RWSEM(slub_lock);
182 static LIST_HEAD(slab_caches);
185 * Tracking user of a slab.
188 unsigned long addr; /* Called from address */
189 int cpu; /* Was running on cpu */
190 int pid; /* Pid context */
191 unsigned long when; /* When did the operation occur */
194 enum track_item { TRACK_ALLOC, TRACK_FREE };
196 #ifdef CONFIG_SLUB_DEBUG
197 static int sysfs_slab_add(struct kmem_cache *);
198 static int sysfs_slab_alias(struct kmem_cache *, const char *);
199 static void sysfs_slab_remove(struct kmem_cache *);
202 static inline int sysfs_slab_add(struct kmem_cache *s) { return 0; }
203 static inline int sysfs_slab_alias(struct kmem_cache *s, const char *p)
205 static inline void sysfs_slab_remove(struct kmem_cache *s)
212 static inline void stat(struct kmem_cache_cpu *c, enum stat_item si)
214 #ifdef CONFIG_SLUB_STATS
219 /********************************************************************
220 * Core slab cache functions
221 *******************************************************************/
223 int slab_is_available(void)
225 return slab_state >= UP;
228 static inline struct kmem_cache_node *get_node(struct kmem_cache *s, int node)
231 return s->node[node];
233 return &s->local_node;
237 static inline struct kmem_cache_cpu *get_cpu_slab(struct kmem_cache *s, int cpu)
240 return s->cpu_slab[cpu];
246 /* Verify that a pointer has an address that is valid within a slab page */
247 static inline int check_valid_pointer(struct kmem_cache *s,
248 struct page *page, const void *object)
255 base = page_address(page);
256 if (object < base || object >= base + page->objects * s->size ||
257 (object - base) % s->size) {
265 * Slow version of get and set free pointer.
267 * This version requires touching the cache lines of kmem_cache which
268 * we avoid to do in the fast alloc free paths. There we obtain the offset
269 * from the page struct.
271 static inline void *get_freepointer(struct kmem_cache *s, void *object)
273 return *(void **)(object + s->offset);
276 static inline void set_freepointer(struct kmem_cache *s, void *object, void *fp)
278 *(void **)(object + s->offset) = fp;
281 /* Loop over all objects in a slab */
282 #define for_each_object(__p, __s, __addr, __objects) \
283 for (__p = (__addr); __p < (__addr) + (__objects) * (__s)->size;\
287 #define for_each_free_object(__p, __s, __free) \
288 for (__p = (__free); __p; __p = get_freepointer((__s), __p))
290 /* Determine object index from a given position */
291 static inline int slab_index(void *p, struct kmem_cache *s, void *addr)
293 return (p - addr) / s->size;
296 static inline struct kmem_cache_order_objects oo_make(int order,
299 struct kmem_cache_order_objects x = {
300 (order << OO_SHIFT) + (PAGE_SIZE << order) / size
306 static inline int oo_order(struct kmem_cache_order_objects x)
308 return x.x >> OO_SHIFT;
311 static inline int oo_objects(struct kmem_cache_order_objects x)
313 return x.x & OO_MASK;
316 #ifdef CONFIG_SLUB_DEBUG
320 #ifdef CONFIG_SLUB_DEBUG_ON
321 static int slub_debug = DEBUG_DEFAULT_FLAGS;
323 static int slub_debug;
326 static char *slub_debug_slabs;
331 static void print_section(char *text, u8 *addr, unsigned int length)
339 for (i = 0; i < length; i++) {
341 printk(KERN_ERR "%8s 0x%p: ", text, addr + i);
344 printk(KERN_CONT " %02x", addr[i]);
346 ascii[offset] = isgraph(addr[i]) ? addr[i] : '.';
348 printk(KERN_CONT " %s\n", ascii);
355 printk(KERN_CONT " ");
359 printk(KERN_CONT " %s\n", ascii);
363 static struct track *get_track(struct kmem_cache *s, void *object,
364 enum track_item alloc)
369 p = object + s->offset + sizeof(void *);
371 p = object + s->inuse;
376 static void set_track(struct kmem_cache *s, void *object,
377 enum track_item alloc, unsigned long addr)
379 struct track *p = get_track(s, object, alloc);
383 p->cpu = smp_processor_id();
384 p->pid = current->pid;
387 memset(p, 0, sizeof(struct track));
390 static void init_tracking(struct kmem_cache *s, void *object)
392 if (!(s->flags & SLAB_STORE_USER))
395 set_track(s, object, TRACK_FREE, 0UL);
396 set_track(s, object, TRACK_ALLOC, 0UL);
399 static void print_track(const char *s, struct track *t)
404 printk(KERN_ERR "INFO: %s in %pS age=%lu cpu=%u pid=%d\n",
405 s, (void *)t->addr, jiffies - t->when, t->cpu, t->pid);
408 static void print_tracking(struct kmem_cache *s, void *object)
410 if (!(s->flags & SLAB_STORE_USER))
413 print_track("Allocated", get_track(s, object, TRACK_ALLOC));
414 print_track("Freed", get_track(s, object, TRACK_FREE));
417 static void print_page_info(struct page *page)
419 printk(KERN_ERR "INFO: Slab 0x%p objects=%u used=%u fp=0x%p flags=0x%04lx\n",
420 page, page->objects, page->inuse, page->freelist, page->flags);
424 static void slab_bug(struct kmem_cache *s, char *fmt, ...)
430 vsnprintf(buf, sizeof(buf), fmt, args);
432 printk(KERN_ERR "========================================"
433 "=====================================\n");
434 printk(KERN_ERR "BUG %s: %s\n", s->name, buf);
435 printk(KERN_ERR "----------------------------------------"
436 "-------------------------------------\n\n");
439 static void slab_fix(struct kmem_cache *s, char *fmt, ...)
445 vsnprintf(buf, sizeof(buf), fmt, args);
447 printk(KERN_ERR "FIX %s: %s\n", s->name, buf);
450 static void print_trailer(struct kmem_cache *s, struct page *page, u8 *p)
452 unsigned int off; /* Offset of last byte */
453 u8 *addr = page_address(page);
455 print_tracking(s, p);
457 print_page_info(page);
459 printk(KERN_ERR "INFO: Object 0x%p @offset=%tu fp=0x%p\n\n",
460 p, p - addr, get_freepointer(s, p));
463 print_section("Bytes b4", p - 16, 16);
465 print_section("Object", p, min_t(unsigned long, s->objsize, PAGE_SIZE));
467 if (s->flags & SLAB_RED_ZONE)
468 print_section("Redzone", p + s->objsize,
469 s->inuse - s->objsize);
472 off = s->offset + sizeof(void *);
476 if (s->flags & SLAB_STORE_USER)
477 off += 2 * sizeof(struct track);
480 /* Beginning of the filler is the free pointer */
481 print_section("Padding", p + off, s->size - off);
486 static void object_err(struct kmem_cache *s, struct page *page,
487 u8 *object, char *reason)
489 slab_bug(s, "%s", reason);
490 print_trailer(s, page, object);
493 static void slab_err(struct kmem_cache *s, struct page *page, char *fmt, ...)
499 vsnprintf(buf, sizeof(buf), fmt, args);
501 slab_bug(s, "%s", buf);
502 print_page_info(page);
506 static void init_object(struct kmem_cache *s, void *object, int active)
510 if (s->flags & __OBJECT_POISON) {
511 memset(p, POISON_FREE, s->objsize - 1);
512 p[s->objsize - 1] = POISON_END;
515 if (s->flags & SLAB_RED_ZONE)
516 memset(p + s->objsize,
517 active ? SLUB_RED_ACTIVE : SLUB_RED_INACTIVE,
518 s->inuse - s->objsize);
521 static u8 *check_bytes(u8 *start, unsigned int value, unsigned int bytes)
524 if (*start != (u8)value)
532 static void restore_bytes(struct kmem_cache *s, char *message, u8 data,
533 void *from, void *to)
535 slab_fix(s, "Restoring 0x%p-0x%p=0x%x\n", from, to - 1, data);
536 memset(from, data, to - from);
539 static int check_bytes_and_report(struct kmem_cache *s, struct page *page,
540 u8 *object, char *what,
541 u8 *start, unsigned int value, unsigned int bytes)
546 fault = check_bytes(start, value, bytes);
551 while (end > fault && end[-1] == value)
554 slab_bug(s, "%s overwritten", what);
555 printk(KERN_ERR "INFO: 0x%p-0x%p. First byte 0x%x instead of 0x%x\n",
556 fault, end - 1, fault[0], value);
557 print_trailer(s, page, object);
559 restore_bytes(s, what, value, fault, end);
567 * Bytes of the object to be managed.
568 * If the freepointer may overlay the object then the free
569 * pointer is the first word of the object.
571 * Poisoning uses 0x6b (POISON_FREE) and the last byte is
574 * object + s->objsize
575 * Padding to reach word boundary. This is also used for Redzoning.
576 * Padding is extended by another word if Redzoning is enabled and
579 * We fill with 0xbb (RED_INACTIVE) for inactive objects and with
580 * 0xcc (RED_ACTIVE) for objects in use.
583 * Meta data starts here.
585 * A. Free pointer (if we cannot overwrite object on free)
586 * B. Tracking data for SLAB_STORE_USER
587 * C. Padding to reach required alignment boundary or at mininum
588 * one word if debugging is on to be able to detect writes
589 * before the word boundary.
591 * Padding is done using 0x5a (POISON_INUSE)
594 * Nothing is used beyond s->size.
596 * If slabcaches are merged then the objsize and inuse boundaries are mostly
597 * ignored. And therefore no slab options that rely on these boundaries
598 * may be used with merged slabcaches.
601 static int check_pad_bytes(struct kmem_cache *s, struct page *page, u8 *p)
603 unsigned long off = s->inuse; /* The end of info */
606 /* Freepointer is placed after the object. */
607 off += sizeof(void *);
609 if (s->flags & SLAB_STORE_USER)
610 /* We also have user information there */
611 off += 2 * sizeof(struct track);
616 return check_bytes_and_report(s, page, p, "Object padding",
617 p + off, POISON_INUSE, s->size - off);
620 /* Check the pad bytes at the end of a slab page */
621 static int slab_pad_check(struct kmem_cache *s, struct page *page)
629 if (!(s->flags & SLAB_POISON))
632 start = page_address(page);
633 length = (PAGE_SIZE << compound_order(page));
634 end = start + length;
635 remainder = length % s->size;
639 fault = check_bytes(end - remainder, POISON_INUSE, remainder);
642 while (end > fault && end[-1] == POISON_INUSE)
645 slab_err(s, page, "Padding overwritten. 0x%p-0x%p", fault, end - 1);
646 print_section("Padding", end - remainder, remainder);
648 restore_bytes(s, "slab padding", POISON_INUSE, start, end);
652 static int check_object(struct kmem_cache *s, struct page *page,
653 void *object, int active)
656 u8 *endobject = object + s->objsize;
658 if (s->flags & SLAB_RED_ZONE) {
660 active ? SLUB_RED_ACTIVE : SLUB_RED_INACTIVE;
662 if (!check_bytes_and_report(s, page, object, "Redzone",
663 endobject, red, s->inuse - s->objsize))
666 if ((s->flags & SLAB_POISON) && s->objsize < s->inuse) {
667 check_bytes_and_report(s, page, p, "Alignment padding",
668 endobject, POISON_INUSE, s->inuse - s->objsize);
672 if (s->flags & SLAB_POISON) {
673 if (!active && (s->flags & __OBJECT_POISON) &&
674 (!check_bytes_and_report(s, page, p, "Poison", p,
675 POISON_FREE, s->objsize - 1) ||
676 !check_bytes_and_report(s, page, p, "Poison",
677 p + s->objsize - 1, POISON_END, 1)))
680 * check_pad_bytes cleans up on its own.
682 check_pad_bytes(s, page, p);
685 if (!s->offset && active)
687 * Object and freepointer overlap. Cannot check
688 * freepointer while object is allocated.
692 /* Check free pointer validity */
693 if (!check_valid_pointer(s, page, get_freepointer(s, p))) {
694 object_err(s, page, p, "Freepointer corrupt");
696 * No choice but to zap it and thus lose the remainder
697 * of the free objects in this slab. May cause
698 * another error because the object count is now wrong.
700 set_freepointer(s, p, NULL);
706 static int check_slab(struct kmem_cache *s, struct page *page)
710 VM_BUG_ON(!irqs_disabled());
712 if (!PageSlab(page)) {
713 slab_err(s, page, "Not a valid slab page");
717 maxobj = (PAGE_SIZE << compound_order(page)) / s->size;
718 if (page->objects > maxobj) {
719 slab_err(s, page, "objects %u > max %u",
720 s->name, page->objects, maxobj);
723 if (page->inuse > page->objects) {
724 slab_err(s, page, "inuse %u > max %u",
725 s->name, page->inuse, page->objects);
728 /* Slab_pad_check fixes things up after itself */
729 slab_pad_check(s, page);
734 * Determine if a certain object on a page is on the freelist. Must hold the
735 * slab lock to guarantee that the chains are in a consistent state.
737 static int on_freelist(struct kmem_cache *s, struct page *page, void *search)
740 void *fp = page->freelist;
742 unsigned long max_objects;
744 while (fp && nr <= page->objects) {
747 if (!check_valid_pointer(s, page, fp)) {
749 object_err(s, page, object,
750 "Freechain corrupt");
751 set_freepointer(s, object, NULL);
754 slab_err(s, page, "Freepointer corrupt");
755 page->freelist = NULL;
756 page->inuse = page->objects;
757 slab_fix(s, "Freelist cleared");
763 fp = get_freepointer(s, object);
767 max_objects = (PAGE_SIZE << compound_order(page)) / s->size;
768 if (max_objects > MAX_OBJS_PER_PAGE)
769 max_objects = MAX_OBJS_PER_PAGE;
771 if (page->objects != max_objects) {
772 slab_err(s, page, "Wrong number of objects. Found %d but "
773 "should be %d", page->objects, max_objects);
774 page->objects = max_objects;
775 slab_fix(s, "Number of objects adjusted.");
777 if (page->inuse != page->objects - nr) {
778 slab_err(s, page, "Wrong object count. Counter is %d but "
779 "counted were %d", page->inuse, page->objects - nr);
780 page->inuse = page->objects - nr;
781 slab_fix(s, "Object count adjusted.");
783 return search == NULL;
786 static void trace(struct kmem_cache *s, struct page *page, void *object,
789 if (s->flags & SLAB_TRACE) {
790 printk(KERN_INFO "TRACE %s %s 0x%p inuse=%d fp=0x%p\n",
792 alloc ? "alloc" : "free",
797 print_section("Object", (void *)object, s->objsize);
804 * Tracking of fully allocated slabs for debugging purposes.
806 static void add_full(struct kmem_cache_node *n, struct page *page)
808 spin_lock(&n->list_lock);
809 list_add(&page->lru, &n->full);
810 spin_unlock(&n->list_lock);
813 static void remove_full(struct kmem_cache *s, struct page *page)
815 struct kmem_cache_node *n;
817 if (!(s->flags & SLAB_STORE_USER))
820 n = get_node(s, page_to_nid(page));
822 spin_lock(&n->list_lock);
823 list_del(&page->lru);
824 spin_unlock(&n->list_lock);
827 /* Tracking of the number of slabs for debugging purposes */
828 static inline unsigned long slabs_node(struct kmem_cache *s, int node)
830 struct kmem_cache_node *n = get_node(s, node);
832 return atomic_long_read(&n->nr_slabs);
835 static inline void inc_slabs_node(struct kmem_cache *s, int node, int objects)
837 struct kmem_cache_node *n = get_node(s, node);
840 * May be called early in order to allocate a slab for the
841 * kmem_cache_node structure. Solve the chicken-egg
842 * dilemma by deferring the increment of the count during
843 * bootstrap (see early_kmem_cache_node_alloc).
845 if (!NUMA_BUILD || n) {
846 atomic_long_inc(&n->nr_slabs);
847 atomic_long_add(objects, &n->total_objects);
850 static inline void dec_slabs_node(struct kmem_cache *s, int node, int objects)
852 struct kmem_cache_node *n = get_node(s, node);
854 atomic_long_dec(&n->nr_slabs);
855 atomic_long_sub(objects, &n->total_objects);
858 /* Object debug checks for alloc/free paths */
859 static void setup_object_debug(struct kmem_cache *s, struct page *page,
862 if (!(s->flags & (SLAB_STORE_USER|SLAB_RED_ZONE|__OBJECT_POISON)))
865 init_object(s, object, 0);
866 init_tracking(s, object);
869 static int alloc_debug_processing(struct kmem_cache *s, struct page *page,
870 void *object, unsigned long addr)
872 if (!check_slab(s, page))
875 if (!on_freelist(s, page, object)) {
876 object_err(s, page, object, "Object already allocated");
880 if (!check_valid_pointer(s, page, object)) {
881 object_err(s, page, object, "Freelist Pointer check fails");
885 if (!check_object(s, page, object, 0))
888 /* Success perform special debug activities for allocs */
889 if (s->flags & SLAB_STORE_USER)
890 set_track(s, object, TRACK_ALLOC, addr);
891 trace(s, page, object, 1);
892 init_object(s, object, 1);
896 if (PageSlab(page)) {
898 * If this is a slab page then lets do the best we can
899 * to avoid issues in the future. Marking all objects
900 * as used avoids touching the remaining objects.
902 slab_fix(s, "Marking all objects used");
903 page->inuse = page->objects;
904 page->freelist = NULL;
909 static int free_debug_processing(struct kmem_cache *s, struct page *page,
910 void *object, unsigned long addr)
912 if (!check_slab(s, page))
915 if (!check_valid_pointer(s, page, object)) {
916 slab_err(s, page, "Invalid object pointer 0x%p", object);
920 if (on_freelist(s, page, object)) {
921 object_err(s, page, object, "Object already free");
925 if (!check_object(s, page, object, 1))
928 if (unlikely(s != page->slab)) {
929 if (!PageSlab(page)) {
930 slab_err(s, page, "Attempt to free object(0x%p) "
931 "outside of slab", object);
932 } else if (!page->slab) {
934 "SLUB <none>: no slab for object 0x%p.\n",
938 object_err(s, page, object,
939 "page slab pointer corrupt.");
943 /* Special debug activities for freeing objects */
944 if (!PageSlubFrozen(page) && !page->freelist)
945 remove_full(s, page);
946 if (s->flags & SLAB_STORE_USER)
947 set_track(s, object, TRACK_FREE, addr);
948 trace(s, page, object, 0);
949 init_object(s, object, 0);
953 slab_fix(s, "Object at 0x%p not freed", object);
957 static int __init setup_slub_debug(char *str)
959 slub_debug = DEBUG_DEFAULT_FLAGS;
960 if (*str++ != '=' || !*str)
962 * No options specified. Switch on full debugging.
968 * No options but restriction on slabs. This means full
969 * debugging for slabs matching a pattern.
976 * Switch off all debugging measures.
981 * Determine which debug features should be switched on
983 for (; *str && *str != ','; str++) {
984 switch (tolower(*str)) {
986 slub_debug |= SLAB_DEBUG_FREE;
989 slub_debug |= SLAB_RED_ZONE;
992 slub_debug |= SLAB_POISON;
995 slub_debug |= SLAB_STORE_USER;
998 slub_debug |= SLAB_TRACE;
1001 printk(KERN_ERR "slub_debug option '%c' "
1002 "unknown. skipped\n", *str);
1008 slub_debug_slabs = str + 1;
1013 __setup("slub_debug", setup_slub_debug);
1015 static unsigned long kmem_cache_flags(unsigned long objsize,
1016 unsigned long flags, const char *name,
1017 void (*ctor)(void *))
1020 * Enable debugging if selected on the kernel commandline.
1022 if (slub_debug && (!slub_debug_slabs ||
1023 strncmp(slub_debug_slabs, name, strlen(slub_debug_slabs)) == 0))
1024 flags |= slub_debug;
1029 static inline void setup_object_debug(struct kmem_cache *s,
1030 struct page *page, void *object) {}
1032 static inline int alloc_debug_processing(struct kmem_cache *s,
1033 struct page *page, void *object, unsigned long addr) { return 0; }
1035 static inline int free_debug_processing(struct kmem_cache *s,
1036 struct page *page, void *object, unsigned long addr) { return 0; }
1038 static inline int slab_pad_check(struct kmem_cache *s, struct page *page)
1040 static inline int check_object(struct kmem_cache *s, struct page *page,
1041 void *object, int active) { return 1; }
1042 static inline void add_full(struct kmem_cache_node *n, struct page *page) {}
1043 static inline unsigned long kmem_cache_flags(unsigned long objsize,
1044 unsigned long flags, const char *name,
1045 void (*ctor)(void *))
1049 #define slub_debug 0
1051 static inline unsigned long slabs_node(struct kmem_cache *s, int node)
1053 static inline void inc_slabs_node(struct kmem_cache *s, int node,
1055 static inline void dec_slabs_node(struct kmem_cache *s, int node,
1060 * Slab allocation and freeing
1062 static inline struct page *alloc_slab_page(gfp_t flags, int node,
1063 struct kmem_cache_order_objects oo)
1065 int order = oo_order(oo);
1068 return alloc_pages(flags, order);
1070 return alloc_pages_node(node, flags, order);
1073 static struct page *allocate_slab(struct kmem_cache *s, gfp_t flags, int node)
1076 struct kmem_cache_order_objects oo = s->oo;
1078 flags |= s->allocflags;
1080 page = alloc_slab_page(flags | __GFP_NOWARN | __GFP_NORETRY, node,
1082 if (unlikely(!page)) {
1085 * Allocation may have failed due to fragmentation.
1086 * Try a lower order alloc if possible
1088 page = alloc_slab_page(flags, node, oo);
1092 stat(get_cpu_slab(s, raw_smp_processor_id()), ORDER_FALLBACK);
1094 page->objects = oo_objects(oo);
1095 mod_zone_page_state(page_zone(page),
1096 (s->flags & SLAB_RECLAIM_ACCOUNT) ?
1097 NR_SLAB_RECLAIMABLE : NR_SLAB_UNRECLAIMABLE,
1103 static void setup_object(struct kmem_cache *s, struct page *page,
1106 setup_object_debug(s, page, object);
1107 if (unlikely(s->ctor))
1111 static struct page *new_slab(struct kmem_cache *s, gfp_t flags, int node)
1118 BUG_ON(flags & GFP_SLAB_BUG_MASK);
1120 page = allocate_slab(s,
1121 flags & (GFP_RECLAIM_MASK | GFP_CONSTRAINT_MASK), node);
1125 inc_slabs_node(s, page_to_nid(page), page->objects);
1127 page->flags |= 1 << PG_slab;
1128 if (s->flags & (SLAB_DEBUG_FREE | SLAB_RED_ZONE | SLAB_POISON |
1129 SLAB_STORE_USER | SLAB_TRACE))
1130 __SetPageSlubDebug(page);
1132 start = page_address(page);
1134 if (unlikely(s->flags & SLAB_POISON))
1135 memset(start, POISON_INUSE, PAGE_SIZE << compound_order(page));
1138 for_each_object(p, s, start, page->objects) {
1139 setup_object(s, page, last);
1140 set_freepointer(s, last, p);
1143 setup_object(s, page, last);
1144 set_freepointer(s, last, NULL);
1146 page->freelist = start;
1152 static void __free_slab(struct kmem_cache *s, struct page *page)
1154 int order = compound_order(page);
1155 int pages = 1 << order;
1157 if (unlikely(SLABDEBUG && PageSlubDebug(page))) {
1160 slab_pad_check(s, page);
1161 for_each_object(p, s, page_address(page),
1163 check_object(s, page, p, 0);
1164 __ClearPageSlubDebug(page);
1167 mod_zone_page_state(page_zone(page),
1168 (s->flags & SLAB_RECLAIM_ACCOUNT) ?
1169 NR_SLAB_RECLAIMABLE : NR_SLAB_UNRECLAIMABLE,
1172 __ClearPageSlab(page);
1173 reset_page_mapcount(page);
1174 if (current->reclaim_state)
1175 current->reclaim_state->reclaimed_slab += pages;
1176 __free_pages(page, order);
1179 static void rcu_free_slab(struct rcu_head *h)
1183 page = container_of((struct list_head *)h, struct page, lru);
1184 __free_slab(page->slab, page);
1187 static void free_slab(struct kmem_cache *s, struct page *page)
1189 if (unlikely(s->flags & SLAB_DESTROY_BY_RCU)) {
1191 * RCU free overloads the RCU head over the LRU
1193 struct rcu_head *head = (void *)&page->lru;
1195 call_rcu(head, rcu_free_slab);
1197 __free_slab(s, page);
1200 static void discard_slab(struct kmem_cache *s, struct page *page)
1202 dec_slabs_node(s, page_to_nid(page), page->objects);
1207 * Per slab locking using the pagelock
1209 static __always_inline void slab_lock(struct page *page)
1211 bit_spin_lock(PG_locked, &page->flags);
1214 static __always_inline void slab_unlock(struct page *page)
1216 __bit_spin_unlock(PG_locked, &page->flags);
1219 static __always_inline int slab_trylock(struct page *page)
1223 rc = bit_spin_trylock(PG_locked, &page->flags);
1228 * Management of partially allocated slabs
1230 static void add_partial(struct kmem_cache_node *n,
1231 struct page *page, int tail)
1233 spin_lock(&n->list_lock);
1236 list_add_tail(&page->lru, &n->partial);
1238 list_add(&page->lru, &n->partial);
1239 spin_unlock(&n->list_lock);
1242 static void remove_partial(struct kmem_cache *s, struct page *page)
1244 struct kmem_cache_node *n = get_node(s, page_to_nid(page));
1246 spin_lock(&n->list_lock);
1247 list_del(&page->lru);
1249 spin_unlock(&n->list_lock);
1253 * Lock slab and remove from the partial list.
1255 * Must hold list_lock.
1257 static inline int lock_and_freeze_slab(struct kmem_cache_node *n,
1260 if (slab_trylock(page)) {
1261 list_del(&page->lru);
1263 __SetPageSlubFrozen(page);
1270 * Try to allocate a partial slab from a specific node.
1272 static struct page *get_partial_node(struct kmem_cache_node *n)
1277 * Racy check. If we mistakenly see no partial slabs then we
1278 * just allocate an empty slab. If we mistakenly try to get a
1279 * partial slab and there is none available then get_partials()
1282 if (!n || !n->nr_partial)
1285 spin_lock(&n->list_lock);
1286 list_for_each_entry(page, &n->partial, lru)
1287 if (lock_and_freeze_slab(n, page))
1291 spin_unlock(&n->list_lock);
1296 * Get a page from somewhere. Search in increasing NUMA distances.
1298 static struct page *get_any_partial(struct kmem_cache *s, gfp_t flags)
1301 struct zonelist *zonelist;
1304 enum zone_type high_zoneidx = gfp_zone(flags);
1308 * The defrag ratio allows a configuration of the tradeoffs between
1309 * inter node defragmentation and node local allocations. A lower
1310 * defrag_ratio increases the tendency to do local allocations
1311 * instead of attempting to obtain partial slabs from other nodes.
1313 * If the defrag_ratio is set to 0 then kmalloc() always
1314 * returns node local objects. If the ratio is higher then kmalloc()
1315 * may return off node objects because partial slabs are obtained
1316 * from other nodes and filled up.
1318 * If /sys/kernel/slab/xx/defrag_ratio is set to 100 (which makes
1319 * defrag_ratio = 1000) then every (well almost) allocation will
1320 * first attempt to defrag slab caches on other nodes. This means
1321 * scanning over all nodes to look for partial slabs which may be
1322 * expensive if we do it every time we are trying to find a slab
1323 * with available objects.
1325 if (!s->remote_node_defrag_ratio ||
1326 get_cycles() % 1024 > s->remote_node_defrag_ratio)
1329 zonelist = node_zonelist(slab_node(current->mempolicy), flags);
1330 for_each_zone_zonelist(zone, z, zonelist, high_zoneidx) {
1331 struct kmem_cache_node *n;
1333 n = get_node(s, zone_to_nid(zone));
1335 if (n && cpuset_zone_allowed_hardwall(zone, flags) &&
1336 n->nr_partial > s->min_partial) {
1337 page = get_partial_node(n);
1347 * Get a partial page, lock it and return it.
1349 static struct page *get_partial(struct kmem_cache *s, gfp_t flags, int node)
1352 int searchnode = (node == -1) ? numa_node_id() : node;
1354 page = get_partial_node(get_node(s, searchnode));
1355 if (page || (flags & __GFP_THISNODE))
1358 return get_any_partial(s, flags);
1362 * Move a page back to the lists.
1364 * Must be called with the slab lock held.
1366 * On exit the slab lock will have been dropped.
1368 static void unfreeze_slab(struct kmem_cache *s, struct page *page, int tail)
1370 struct kmem_cache_node *n = get_node(s, page_to_nid(page));
1371 struct kmem_cache_cpu *c = get_cpu_slab(s, smp_processor_id());
1373 __ClearPageSlubFrozen(page);
1376 if (page->freelist) {
1377 add_partial(n, page, tail);
1378 stat(c, tail ? DEACTIVATE_TO_TAIL : DEACTIVATE_TO_HEAD);
1380 stat(c, DEACTIVATE_FULL);
1381 if (SLABDEBUG && PageSlubDebug(page) &&
1382 (s->flags & SLAB_STORE_USER))
1387 stat(c, DEACTIVATE_EMPTY);
1388 if (n->nr_partial < s->min_partial) {
1390 * Adding an empty slab to the partial slabs in order
1391 * to avoid page allocator overhead. This slab needs
1392 * to come after the other slabs with objects in
1393 * so that the others get filled first. That way the
1394 * size of the partial list stays small.
1396 * kmem_cache_shrink can reclaim any empty slabs from
1399 add_partial(n, page, 1);
1403 stat(get_cpu_slab(s, raw_smp_processor_id()), FREE_SLAB);
1404 discard_slab(s, page);
1410 * Remove the cpu slab
1412 static void deactivate_slab(struct kmem_cache *s, struct kmem_cache_cpu *c)
1414 struct page *page = c->page;
1418 stat(c, DEACTIVATE_REMOTE_FREES);
1420 * Merge cpu freelist into slab freelist. Typically we get here
1421 * because both freelists are empty. So this is unlikely
1424 while (unlikely(c->freelist)) {
1427 tail = 0; /* Hot objects. Put the slab first */
1429 /* Retrieve object from cpu_freelist */
1430 object = c->freelist;
1431 c->freelist = c->freelist[c->offset];
1433 /* And put onto the regular freelist */
1434 object[c->offset] = page->freelist;
1435 page->freelist = object;
1439 unfreeze_slab(s, page, tail);
1442 static inline void flush_slab(struct kmem_cache *s, struct kmem_cache_cpu *c)
1444 stat(c, CPUSLAB_FLUSH);
1446 deactivate_slab(s, c);
1452 * Called from IPI handler with interrupts disabled.
1454 static inline void __flush_cpu_slab(struct kmem_cache *s, int cpu)
1456 struct kmem_cache_cpu *c = get_cpu_slab(s, cpu);
1458 if (likely(c && c->page))
1462 static void flush_cpu_slab(void *d)
1464 struct kmem_cache *s = d;
1466 __flush_cpu_slab(s, smp_processor_id());
1469 static void flush_all(struct kmem_cache *s)
1471 on_each_cpu(flush_cpu_slab, s, 1);
1475 * Check if the objects in a per cpu structure fit numa
1476 * locality expectations.
1478 static inline int node_match(struct kmem_cache_cpu *c, int node)
1481 if (node != -1 && c->node != node)
1487 static int count_free(struct page *page)
1489 return page->objects - page->inuse;
1492 static unsigned long count_partial(struct kmem_cache_node *n,
1493 int (*get_count)(struct page *))
1495 unsigned long flags;
1496 unsigned long x = 0;
1499 spin_lock_irqsave(&n->list_lock, flags);
1500 list_for_each_entry(page, &n->partial, lru)
1501 x += get_count(page);
1502 spin_unlock_irqrestore(&n->list_lock, flags);
1506 static noinline void
1507 slab_out_of_memory(struct kmem_cache *s, gfp_t gfpflags, int nid)
1512 "SLUB: Unable to allocate memory on node %d (gfp=0x%x)\n",
1514 printk(KERN_WARNING " cache: %s, object size: %d, buffer size: %d, "
1515 "default order: %d, min order: %d\n", s->name, s->objsize,
1516 s->size, oo_order(s->oo), oo_order(s->min));
1518 for_each_online_node(node) {
1519 struct kmem_cache_node *n = get_node(s, node);
1520 unsigned long nr_slabs;
1521 unsigned long nr_objs;
1522 unsigned long nr_free;
1527 nr_slabs = atomic_long_read(&n->nr_slabs);
1528 nr_objs = atomic_long_read(&n->total_objects);
1529 nr_free = count_partial(n, count_free);
1532 " node %d: slabs: %ld, objs: %ld, free: %ld\n",
1533 node, nr_slabs, nr_objs, nr_free);
1538 * Slow path. The lockless freelist is empty or we need to perform
1541 * Interrupts are disabled.
1543 * Processing is still very fast if new objects have been freed to the
1544 * regular freelist. In that case we simply take over the regular freelist
1545 * as the lockless freelist and zap the regular freelist.
1547 * If that is not working then we fall back to the partial lists. We take the
1548 * first element of the freelist as the object to allocate now and move the
1549 * rest of the freelist to the lockless freelist.
1551 * And if we were unable to get a new slab from the partial slab lists then
1552 * we need to allocate a new slab. This is the slowest path since it involves
1553 * a call to the page allocator and the setup of a new slab.
1555 static void *__slab_alloc(struct kmem_cache *s, gfp_t gfpflags, int node,
1556 unsigned long addr, struct kmem_cache_cpu *c)
1561 /* We handle __GFP_ZERO in the caller */
1562 gfpflags &= ~__GFP_ZERO;
1568 if (unlikely(!node_match(c, node)))
1571 stat(c, ALLOC_REFILL);
1574 object = c->page->freelist;
1575 if (unlikely(!object))
1577 if (unlikely(SLABDEBUG && PageSlubDebug(c->page)))
1580 c->freelist = object[c->offset];
1581 c->page->inuse = c->page->objects;
1582 c->page->freelist = NULL;
1583 c->node = page_to_nid(c->page);
1585 slab_unlock(c->page);
1586 stat(c, ALLOC_SLOWPATH);
1590 deactivate_slab(s, c);
1593 new = get_partial(s, gfpflags, node);
1596 stat(c, ALLOC_FROM_PARTIAL);
1600 if (gfpflags & __GFP_WAIT)
1603 new = new_slab(s, gfpflags, node);
1605 if (gfpflags & __GFP_WAIT)
1606 local_irq_disable();
1609 c = get_cpu_slab(s, smp_processor_id());
1610 stat(c, ALLOC_SLAB);
1614 __SetPageSlubFrozen(new);
1618 slab_out_of_memory(s, gfpflags, node);
1621 if (!alloc_debug_processing(s, c->page, object, addr))
1625 c->page->freelist = object[c->offset];
1631 * Inlined fastpath so that allocation functions (kmalloc, kmem_cache_alloc)
1632 * have the fastpath folded into their functions. So no function call
1633 * overhead for requests that can be satisfied on the fastpath.
1635 * The fastpath works by first checking if the lockless freelist can be used.
1636 * If not then __slab_alloc is called for slow processing.
1638 * Otherwise we can simply pick the next object from the lockless free list.
1640 static __always_inline void *slab_alloc(struct kmem_cache *s,
1641 gfp_t gfpflags, int node, unsigned long addr)
1644 struct kmem_cache_cpu *c;
1645 unsigned long flags;
1646 unsigned int objsize;
1648 lockdep_trace_alloc(gfpflags);
1649 might_sleep_if(gfpflags & __GFP_WAIT);
1651 if (should_failslab(s->objsize, gfpflags))
1654 local_irq_save(flags);
1655 c = get_cpu_slab(s, smp_processor_id());
1656 objsize = c->objsize;
1657 if (unlikely(!c->freelist || !node_match(c, node)))
1659 object = __slab_alloc(s, gfpflags, node, addr, c);
1662 object = c->freelist;
1663 c->freelist = object[c->offset];
1664 stat(c, ALLOC_FASTPATH);
1666 local_irq_restore(flags);
1668 if (unlikely((gfpflags & __GFP_ZERO) && object))
1669 memset(object, 0, objsize);
1674 void *kmem_cache_alloc(struct kmem_cache *s, gfp_t gfpflags)
1676 void *ret = slab_alloc(s, gfpflags, -1, _RET_IP_);
1678 trace_kmem_cache_alloc(_RET_IP_, ret, s->objsize, s->size, gfpflags);
1682 EXPORT_SYMBOL(kmem_cache_alloc);
1684 #ifdef CONFIG_KMEMTRACE
1685 void *kmem_cache_alloc_notrace(struct kmem_cache *s, gfp_t gfpflags)
1687 return slab_alloc(s, gfpflags, -1, _RET_IP_);
1689 EXPORT_SYMBOL(kmem_cache_alloc_notrace);
1693 void *kmem_cache_alloc_node(struct kmem_cache *s, gfp_t gfpflags, int node)
1695 void *ret = slab_alloc(s, gfpflags, node, _RET_IP_);
1697 trace_kmem_cache_alloc_node(_RET_IP_, ret,
1698 s->objsize, s->size, gfpflags, node);
1702 EXPORT_SYMBOL(kmem_cache_alloc_node);
1705 #ifdef CONFIG_KMEMTRACE
1706 void *kmem_cache_alloc_node_notrace(struct kmem_cache *s,
1710 return slab_alloc(s, gfpflags, node, _RET_IP_);
1712 EXPORT_SYMBOL(kmem_cache_alloc_node_notrace);
1716 * Slow patch handling. This may still be called frequently since objects
1717 * have a longer lifetime than the cpu slabs in most processing loads.
1719 * So we still attempt to reduce cache line usage. Just take the slab
1720 * lock and free the item. If there is no additional partial page
1721 * handling required then we can return immediately.
1723 static void __slab_free(struct kmem_cache *s, struct page *page,
1724 void *x, unsigned long addr, unsigned int offset)
1727 void **object = (void *)x;
1728 struct kmem_cache_cpu *c;
1730 c = get_cpu_slab(s, raw_smp_processor_id());
1731 stat(c, FREE_SLOWPATH);
1734 if (unlikely(SLABDEBUG && PageSlubDebug(page)))
1738 prior = object[offset] = page->freelist;
1739 page->freelist = object;
1742 if (unlikely(PageSlubFrozen(page))) {
1743 stat(c, FREE_FROZEN);
1747 if (unlikely(!page->inuse))
1751 * Objects left in the slab. If it was not on the partial list before
1754 if (unlikely(!prior)) {
1755 add_partial(get_node(s, page_to_nid(page)), page, 1);
1756 stat(c, FREE_ADD_PARTIAL);
1766 * Slab still on the partial list.
1768 remove_partial(s, page);
1769 stat(c, FREE_REMOVE_PARTIAL);
1773 discard_slab(s, page);
1777 if (!free_debug_processing(s, page, x, addr))
1783 * Fastpath with forced inlining to produce a kfree and kmem_cache_free that
1784 * can perform fastpath freeing without additional function calls.
1786 * The fastpath is only possible if we are freeing to the current cpu slab
1787 * of this processor. This typically the case if we have just allocated
1790 * If fastpath is not possible then fall back to __slab_free where we deal
1791 * with all sorts of special processing.
1793 static __always_inline void slab_free(struct kmem_cache *s,
1794 struct page *page, void *x, unsigned long addr)
1796 void **object = (void *)x;
1797 struct kmem_cache_cpu *c;
1798 unsigned long flags;
1800 local_irq_save(flags);
1801 c = get_cpu_slab(s, smp_processor_id());
1802 debug_check_no_locks_freed(object, c->objsize);
1803 if (!(s->flags & SLAB_DEBUG_OBJECTS))
1804 debug_check_no_obj_freed(object, c->objsize);
1805 if (likely(page == c->page && c->node >= 0)) {
1806 object[c->offset] = c->freelist;
1807 c->freelist = object;
1808 stat(c, FREE_FASTPATH);
1810 __slab_free(s, page, x, addr, c->offset);
1812 local_irq_restore(flags);
1815 void kmem_cache_free(struct kmem_cache *s, void *x)
1819 page = virt_to_head_page(x);
1821 slab_free(s, page, x, _RET_IP_);
1823 trace_kmem_cache_free(_RET_IP_, x);
1825 EXPORT_SYMBOL(kmem_cache_free);
1827 /* Figure out on which slab page the object resides */
1828 static struct page *get_object_page(const void *x)
1830 struct page *page = virt_to_head_page(x);
1832 if (!PageSlab(page))
1839 * Object placement in a slab is made very easy because we always start at
1840 * offset 0. If we tune the size of the object to the alignment then we can
1841 * get the required alignment by putting one properly sized object after
1844 * Notice that the allocation order determines the sizes of the per cpu
1845 * caches. Each processor has always one slab available for allocations.
1846 * Increasing the allocation order reduces the number of times that slabs
1847 * must be moved on and off the partial lists and is therefore a factor in
1852 * Mininum / Maximum order of slab pages. This influences locking overhead
1853 * and slab fragmentation. A higher order reduces the number of partial slabs
1854 * and increases the number of allocations possible without having to
1855 * take the list_lock.
1857 static int slub_min_order;
1858 static int slub_max_order = PAGE_ALLOC_COSTLY_ORDER;
1859 static int slub_min_objects;
1862 * Merge control. If this is set then no merging of slab caches will occur.
1863 * (Could be removed. This was introduced to pacify the merge skeptics.)
1865 static int slub_nomerge;
1868 * Calculate the order of allocation given an slab object size.
1870 * The order of allocation has significant impact on performance and other
1871 * system components. Generally order 0 allocations should be preferred since
1872 * order 0 does not cause fragmentation in the page allocator. Larger objects
1873 * be problematic to put into order 0 slabs because there may be too much
1874 * unused space left. We go to a higher order if more than 1/16th of the slab
1877 * In order to reach satisfactory performance we must ensure that a minimum
1878 * number of objects is in one slab. Otherwise we may generate too much
1879 * activity on the partial lists which requires taking the list_lock. This is
1880 * less a concern for large slabs though which are rarely used.
1882 * slub_max_order specifies the order where we begin to stop considering the
1883 * number of objects in a slab as critical. If we reach slub_max_order then
1884 * we try to keep the page order as low as possible. So we accept more waste
1885 * of space in favor of a small page order.
1887 * Higher order allocations also allow the placement of more objects in a
1888 * slab and thereby reduce object handling overhead. If the user has
1889 * requested a higher mininum order then we start with that one instead of
1890 * the smallest order which will fit the object.
1892 static inline int slab_order(int size, int min_objects,
1893 int max_order, int fract_leftover)
1897 int min_order = slub_min_order;
1899 if ((PAGE_SIZE << min_order) / size > MAX_OBJS_PER_PAGE)
1900 return get_order(size * MAX_OBJS_PER_PAGE) - 1;
1902 for (order = max(min_order,
1903 fls(min_objects * size - 1) - PAGE_SHIFT);
1904 order <= max_order; order++) {
1906 unsigned long slab_size = PAGE_SIZE << order;
1908 if (slab_size < min_objects * size)
1911 rem = slab_size % size;
1913 if (rem <= slab_size / fract_leftover)
1921 static inline int calculate_order(int size)
1929 * Attempt to find best configuration for a slab. This
1930 * works by first attempting to generate a layout with
1931 * the best configuration and backing off gradually.
1933 * First we reduce the acceptable waste in a slab. Then
1934 * we reduce the minimum objects required in a slab.
1936 min_objects = slub_min_objects;
1938 min_objects = 4 * (fls(nr_cpu_ids) + 1);
1939 max_objects = (PAGE_SIZE << slub_max_order)/size;
1940 min_objects = min(min_objects, max_objects);
1942 while (min_objects > 1) {
1944 while (fraction >= 4) {
1945 order = slab_order(size, min_objects,
1946 slub_max_order, fraction);
1947 if (order <= slub_max_order)
1955 * We were unable to place multiple objects in a slab. Now
1956 * lets see if we can place a single object there.
1958 order = slab_order(size, 1, slub_max_order, 1);
1959 if (order <= slub_max_order)
1963 * Doh this slab cannot be placed using slub_max_order.
1965 order = slab_order(size, 1, MAX_ORDER, 1);
1966 if (order < MAX_ORDER)
1972 * Figure out what the alignment of the objects will be.
1974 static unsigned long calculate_alignment(unsigned long flags,
1975 unsigned long align, unsigned long size)
1978 * If the user wants hardware cache aligned objects then follow that
1979 * suggestion if the object is sufficiently large.
1981 * The hardware cache alignment cannot override the specified
1982 * alignment though. If that is greater then use it.
1984 if (flags & SLAB_HWCACHE_ALIGN) {
1985 unsigned long ralign = cache_line_size();
1986 while (size <= ralign / 2)
1988 align = max(align, ralign);
1991 if (align < ARCH_SLAB_MINALIGN)
1992 align = ARCH_SLAB_MINALIGN;
1994 return ALIGN(align, sizeof(void *));
1997 static void init_kmem_cache_cpu(struct kmem_cache *s,
1998 struct kmem_cache_cpu *c)
2003 c->offset = s->offset / sizeof(void *);
2004 c->objsize = s->objsize;
2005 #ifdef CONFIG_SLUB_STATS
2006 memset(c->stat, 0, NR_SLUB_STAT_ITEMS * sizeof(unsigned));
2011 init_kmem_cache_node(struct kmem_cache_node *n, struct kmem_cache *s)
2014 spin_lock_init(&n->list_lock);
2015 INIT_LIST_HEAD(&n->partial);
2016 #ifdef CONFIG_SLUB_DEBUG
2017 atomic_long_set(&n->nr_slabs, 0);
2018 atomic_long_set(&n->total_objects, 0);
2019 INIT_LIST_HEAD(&n->full);
2025 * Per cpu array for per cpu structures.
2027 * The per cpu array places all kmem_cache_cpu structures from one processor
2028 * close together meaning that it becomes possible that multiple per cpu
2029 * structures are contained in one cacheline. This may be particularly
2030 * beneficial for the kmalloc caches.
2032 * A desktop system typically has around 60-80 slabs. With 100 here we are
2033 * likely able to get per cpu structures for all caches from the array defined
2034 * here. We must be able to cover all kmalloc caches during bootstrap.
2036 * If the per cpu array is exhausted then fall back to kmalloc
2037 * of individual cachelines. No sharing is possible then.
2039 #define NR_KMEM_CACHE_CPU 100
2041 static DEFINE_PER_CPU(struct kmem_cache_cpu,
2042 kmem_cache_cpu)[NR_KMEM_CACHE_CPU];
2044 static DEFINE_PER_CPU(struct kmem_cache_cpu *, kmem_cache_cpu_free);
2045 static DECLARE_BITMAP(kmem_cach_cpu_free_init_once, CONFIG_NR_CPUS);
2047 static struct kmem_cache_cpu *alloc_kmem_cache_cpu(struct kmem_cache *s,
2048 int cpu, gfp_t flags)
2050 struct kmem_cache_cpu *c = per_cpu(kmem_cache_cpu_free, cpu);
2053 per_cpu(kmem_cache_cpu_free, cpu) =
2054 (void *)c->freelist;
2056 /* Table overflow: So allocate ourselves */
2058 ALIGN(sizeof(struct kmem_cache_cpu), cache_line_size()),
2059 flags, cpu_to_node(cpu));
2064 init_kmem_cache_cpu(s, c);
2068 static void free_kmem_cache_cpu(struct kmem_cache_cpu *c, int cpu)
2070 if (c < per_cpu(kmem_cache_cpu, cpu) ||
2071 c >= per_cpu(kmem_cache_cpu, cpu) + NR_KMEM_CACHE_CPU) {
2075 c->freelist = (void *)per_cpu(kmem_cache_cpu_free, cpu);
2076 per_cpu(kmem_cache_cpu_free, cpu) = c;
2079 static void free_kmem_cache_cpus(struct kmem_cache *s)
2083 for_each_online_cpu(cpu) {
2084 struct kmem_cache_cpu *c = get_cpu_slab(s, cpu);
2087 s->cpu_slab[cpu] = NULL;
2088 free_kmem_cache_cpu(c, cpu);
2093 static int alloc_kmem_cache_cpus(struct kmem_cache *s, gfp_t flags)
2097 for_each_online_cpu(cpu) {
2098 struct kmem_cache_cpu *c = get_cpu_slab(s, cpu);
2103 c = alloc_kmem_cache_cpu(s, cpu, flags);
2105 free_kmem_cache_cpus(s);
2108 s->cpu_slab[cpu] = c;
2114 * Initialize the per cpu array.
2116 static void init_alloc_cpu_cpu(int cpu)
2120 if (cpumask_test_cpu(cpu, to_cpumask(kmem_cach_cpu_free_init_once)))
2123 for (i = NR_KMEM_CACHE_CPU - 1; i >= 0; i--)
2124 free_kmem_cache_cpu(&per_cpu(kmem_cache_cpu, cpu)[i], cpu);
2126 cpumask_set_cpu(cpu, to_cpumask(kmem_cach_cpu_free_init_once));
2129 static void __init init_alloc_cpu(void)
2133 for_each_online_cpu(cpu)
2134 init_alloc_cpu_cpu(cpu);
2138 static inline void free_kmem_cache_cpus(struct kmem_cache *s) {}
2139 static inline void init_alloc_cpu(void) {}
2141 static inline int alloc_kmem_cache_cpus(struct kmem_cache *s, gfp_t flags)
2143 init_kmem_cache_cpu(s, &s->cpu_slab);
2150 * No kmalloc_node yet so do it by hand. We know that this is the first
2151 * slab on the node for this slabcache. There are no concurrent accesses
2154 * Note that this function only works on the kmalloc_node_cache
2155 * when allocating for the kmalloc_node_cache. This is used for bootstrapping
2156 * memory on a fresh node that has no slab structures yet.
2158 static void early_kmem_cache_node_alloc(gfp_t gfpflags, int node)
2161 struct kmem_cache_node *n;
2162 unsigned long flags;
2164 BUG_ON(kmalloc_caches->size < sizeof(struct kmem_cache_node));
2166 page = new_slab(kmalloc_caches, gfpflags, node);
2169 if (page_to_nid(page) != node) {
2170 printk(KERN_ERR "SLUB: Unable to allocate memory from "
2172 printk(KERN_ERR "SLUB: Allocating a useless per node structure "
2173 "in order to be able to continue\n");
2178 page->freelist = get_freepointer(kmalloc_caches, n);
2180 kmalloc_caches->node[node] = n;
2181 #ifdef CONFIG_SLUB_DEBUG
2182 init_object(kmalloc_caches, n, 1);
2183 init_tracking(kmalloc_caches, n);
2185 init_kmem_cache_node(n, kmalloc_caches);
2186 inc_slabs_node(kmalloc_caches, node, page->objects);
2189 * lockdep requires consistent irq usage for each lock
2190 * so even though there cannot be a race this early in
2191 * the boot sequence, we still disable irqs.
2193 local_irq_save(flags);
2194 add_partial(n, page, 0);
2195 local_irq_restore(flags);
2198 static void free_kmem_cache_nodes(struct kmem_cache *s)
2202 for_each_node_state(node, N_NORMAL_MEMORY) {
2203 struct kmem_cache_node *n = s->node[node];
2204 if (n && n != &s->local_node)
2205 kmem_cache_free(kmalloc_caches, n);
2206 s->node[node] = NULL;
2210 static int init_kmem_cache_nodes(struct kmem_cache *s, gfp_t gfpflags)
2215 if (slab_state >= UP)
2216 local_node = page_to_nid(virt_to_page(s));
2220 for_each_node_state(node, N_NORMAL_MEMORY) {
2221 struct kmem_cache_node *n;
2223 if (local_node == node)
2226 if (slab_state == DOWN) {
2227 early_kmem_cache_node_alloc(gfpflags, node);
2230 n = kmem_cache_alloc_node(kmalloc_caches,
2234 free_kmem_cache_nodes(s);
2240 init_kmem_cache_node(n, s);
2245 static void free_kmem_cache_nodes(struct kmem_cache *s)
2249 static int init_kmem_cache_nodes(struct kmem_cache *s, gfp_t gfpflags)
2251 init_kmem_cache_node(&s->local_node, s);
2256 static void set_min_partial(struct kmem_cache *s, unsigned long min)
2258 if (min < MIN_PARTIAL)
2260 else if (min > MAX_PARTIAL)
2262 s->min_partial = min;
2266 * calculate_sizes() determines the order and the distribution of data within
2269 static int calculate_sizes(struct kmem_cache *s, int forced_order)
2271 unsigned long flags = s->flags;
2272 unsigned long size = s->objsize;
2273 unsigned long align = s->align;
2277 * Round up object size to the next word boundary. We can only
2278 * place the free pointer at word boundaries and this determines
2279 * the possible location of the free pointer.
2281 size = ALIGN(size, sizeof(void *));
2283 #ifdef CONFIG_SLUB_DEBUG
2285 * Determine if we can poison the object itself. If the user of
2286 * the slab may touch the object after free or before allocation
2287 * then we should never poison the object itself.
2289 if ((flags & SLAB_POISON) && !(flags & SLAB_DESTROY_BY_RCU) &&
2291 s->flags |= __OBJECT_POISON;
2293 s->flags &= ~__OBJECT_POISON;
2297 * If we are Redzoning then check if there is some space between the
2298 * end of the object and the free pointer. If not then add an
2299 * additional word to have some bytes to store Redzone information.
2301 if ((flags & SLAB_RED_ZONE) && size == s->objsize)
2302 size += sizeof(void *);
2306 * With that we have determined the number of bytes in actual use
2307 * by the object. This is the potential offset to the free pointer.
2311 if (((flags & (SLAB_DESTROY_BY_RCU | SLAB_POISON)) ||
2314 * Relocate free pointer after the object if it is not
2315 * permitted to overwrite the first word of the object on
2318 * This is the case if we do RCU, have a constructor or
2319 * destructor or are poisoning the objects.
2322 size += sizeof(void *);
2325 #ifdef CONFIG_SLUB_DEBUG
2326 if (flags & SLAB_STORE_USER)
2328 * Need to store information about allocs and frees after
2331 size += 2 * sizeof(struct track);
2333 if (flags & SLAB_RED_ZONE)
2335 * Add some empty padding so that we can catch
2336 * overwrites from earlier objects rather than let
2337 * tracking information or the free pointer be
2338 * corrupted if a user writes before the start
2341 size += sizeof(void *);
2345 * Determine the alignment based on various parameters that the
2346 * user specified and the dynamic determination of cache line size
2349 align = calculate_alignment(flags, align, s->objsize);
2352 * SLUB stores one object immediately after another beginning from
2353 * offset 0. In order to align the objects we have to simply size
2354 * each object to conform to the alignment.
2356 size = ALIGN(size, align);
2358 if (forced_order >= 0)
2359 order = forced_order;
2361 order = calculate_order(size);
2368 s->allocflags |= __GFP_COMP;
2370 if (s->flags & SLAB_CACHE_DMA)
2371 s->allocflags |= SLUB_DMA;
2373 if (s->flags & SLAB_RECLAIM_ACCOUNT)
2374 s->allocflags |= __GFP_RECLAIMABLE;
2377 * Determine the number of objects per slab
2379 s->oo = oo_make(order, size);
2380 s->min = oo_make(get_order(size), size);
2381 if (oo_objects(s->oo) > oo_objects(s->max))
2384 return !!oo_objects(s->oo);
2388 static int kmem_cache_open(struct kmem_cache *s, gfp_t gfpflags,
2389 const char *name, size_t size,
2390 size_t align, unsigned long flags,
2391 void (*ctor)(void *))
2393 memset(s, 0, kmem_size);
2398 s->flags = kmem_cache_flags(size, flags, name, ctor);
2400 if (!calculate_sizes(s, -1))
2404 * The larger the object size is, the more pages we want on the partial
2405 * list to avoid pounding the page allocator excessively.
2407 set_min_partial(s, ilog2(s->size));
2410 s->remote_node_defrag_ratio = 1000;
2412 if (!init_kmem_cache_nodes(s, gfpflags & ~SLUB_DMA))
2415 if (alloc_kmem_cache_cpus(s, gfpflags & ~SLUB_DMA))
2417 free_kmem_cache_nodes(s);
2419 if (flags & SLAB_PANIC)
2420 panic("Cannot create slab %s size=%lu realsize=%u "
2421 "order=%u offset=%u flags=%lx\n",
2422 s->name, (unsigned long)size, s->size, oo_order(s->oo),
2428 * Check if a given pointer is valid
2430 int kmem_ptr_validate(struct kmem_cache *s, const void *object)
2434 page = get_object_page(object);
2436 if (!page || s != page->slab)
2437 /* No slab or wrong slab */
2440 if (!check_valid_pointer(s, page, object))
2444 * We could also check if the object is on the slabs freelist.
2445 * But this would be too expensive and it seems that the main
2446 * purpose of kmem_ptr_valid() is to check if the object belongs
2447 * to a certain slab.
2451 EXPORT_SYMBOL(kmem_ptr_validate);
2454 * Determine the size of a slab object
2456 unsigned int kmem_cache_size(struct kmem_cache *s)
2460 EXPORT_SYMBOL(kmem_cache_size);
2462 const char *kmem_cache_name(struct kmem_cache *s)
2466 EXPORT_SYMBOL(kmem_cache_name);
2468 static void list_slab_objects(struct kmem_cache *s, struct page *page,
2471 #ifdef CONFIG_SLUB_DEBUG
2472 void *addr = page_address(page);
2474 DECLARE_BITMAP(map, page->objects);
2476 bitmap_zero(map, page->objects);
2477 slab_err(s, page, "%s", text);
2479 for_each_free_object(p, s, page->freelist)
2480 set_bit(slab_index(p, s, addr), map);
2482 for_each_object(p, s, addr, page->objects) {
2484 if (!test_bit(slab_index(p, s, addr), map)) {
2485 printk(KERN_ERR "INFO: Object 0x%p @offset=%tu\n",
2487 print_tracking(s, p);
2495 * Attempt to free all partial slabs on a node.
2497 static void free_partial(struct kmem_cache *s, struct kmem_cache_node *n)
2499 unsigned long flags;
2500 struct page *page, *h;
2502 spin_lock_irqsave(&n->list_lock, flags);
2503 list_for_each_entry_safe(page, h, &n->partial, lru) {
2505 list_del(&page->lru);
2506 discard_slab(s, page);
2509 list_slab_objects(s, page,
2510 "Objects remaining on kmem_cache_close()");
2513 spin_unlock_irqrestore(&n->list_lock, flags);
2517 * Release all resources used by a slab cache.
2519 static inline int kmem_cache_close(struct kmem_cache *s)
2525 /* Attempt to free all objects */
2526 free_kmem_cache_cpus(s);
2527 for_each_node_state(node, N_NORMAL_MEMORY) {
2528 struct kmem_cache_node *n = get_node(s, node);
2531 if (n->nr_partial || slabs_node(s, node))
2534 free_kmem_cache_nodes(s);
2539 * Close a cache and release the kmem_cache structure
2540 * (must be used for caches created using kmem_cache_create)
2542 void kmem_cache_destroy(struct kmem_cache *s)
2544 down_write(&slub_lock);
2548 up_write(&slub_lock);
2549 if (kmem_cache_close(s)) {
2550 printk(KERN_ERR "SLUB %s: %s called for cache that "
2551 "still has objects.\n", s->name, __func__);
2554 sysfs_slab_remove(s);
2556 up_write(&slub_lock);
2558 EXPORT_SYMBOL(kmem_cache_destroy);
2560 /********************************************************************
2562 *******************************************************************/
2564 struct kmem_cache kmalloc_caches[SLUB_PAGE_SHIFT] __cacheline_aligned;
2565 EXPORT_SYMBOL(kmalloc_caches);
2567 static int __init setup_slub_min_order(char *str)
2569 get_option(&str, &slub_min_order);
2574 __setup("slub_min_order=", setup_slub_min_order);
2576 static int __init setup_slub_max_order(char *str)
2578 get_option(&str, &slub_max_order);
2579 slub_max_order = min(slub_max_order, MAX_ORDER - 1);
2584 __setup("slub_max_order=", setup_slub_max_order);
2586 static int __init setup_slub_min_objects(char *str)
2588 get_option(&str, &slub_min_objects);
2593 __setup("slub_min_objects=", setup_slub_min_objects);
2595 static int __init setup_slub_nomerge(char *str)
2601 __setup("slub_nomerge", setup_slub_nomerge);
2603 static struct kmem_cache *create_kmalloc_cache(struct kmem_cache *s,
2604 const char *name, int size, gfp_t gfp_flags)
2606 unsigned int flags = 0;
2608 if (gfp_flags & SLUB_DMA)
2609 flags = SLAB_CACHE_DMA;
2611 down_write(&slub_lock);
2612 if (!kmem_cache_open(s, gfp_flags, name, size, ARCH_KMALLOC_MINALIGN,
2616 list_add(&s->list, &slab_caches);
2617 up_write(&slub_lock);
2618 if (sysfs_slab_add(s))
2623 panic("Creation of kmalloc slab %s size=%d failed.\n", name, size);
2626 #ifdef CONFIG_ZONE_DMA
2627 static struct kmem_cache *kmalloc_caches_dma[SLUB_PAGE_SHIFT];
2629 static void sysfs_add_func(struct work_struct *w)
2631 struct kmem_cache *s;
2633 down_write(&slub_lock);
2634 list_for_each_entry(s, &slab_caches, list) {
2635 if (s->flags & __SYSFS_ADD_DEFERRED) {
2636 s->flags &= ~__SYSFS_ADD_DEFERRED;
2640 up_write(&slub_lock);
2643 static DECLARE_WORK(sysfs_add_work, sysfs_add_func);
2645 static noinline struct kmem_cache *dma_kmalloc_cache(int index, gfp_t flags)
2647 struct kmem_cache *s;
2651 s = kmalloc_caches_dma[index];
2655 /* Dynamically create dma cache */
2656 if (flags & __GFP_WAIT)
2657 down_write(&slub_lock);
2659 if (!down_write_trylock(&slub_lock))
2663 if (kmalloc_caches_dma[index])
2666 realsize = kmalloc_caches[index].objsize;
2667 text = kasprintf(flags & ~SLUB_DMA, "kmalloc_dma-%d",
2668 (unsigned int)realsize);
2669 s = kmalloc(kmem_size, flags & ~SLUB_DMA);
2671 if (!s || !text || !kmem_cache_open(s, flags, text,
2672 realsize, ARCH_KMALLOC_MINALIGN,
2673 SLAB_CACHE_DMA|__SYSFS_ADD_DEFERRED, NULL)) {
2679 list_add(&s->list, &slab_caches);
2680 kmalloc_caches_dma[index] = s;
2682 schedule_work(&sysfs_add_work);
2685 up_write(&slub_lock);
2687 return kmalloc_caches_dma[index];
2692 * Conversion table for small slabs sizes / 8 to the index in the
2693 * kmalloc array. This is necessary for slabs < 192 since we have non power
2694 * of two cache sizes there. The size of larger slabs can be determined using
2697 static s8 size_index[24] = {
2724 static struct kmem_cache *get_slab(size_t size, gfp_t flags)
2730 return ZERO_SIZE_PTR;
2732 index = size_index[(size - 1) / 8];
2734 index = fls(size - 1);
2736 #ifdef CONFIG_ZONE_DMA
2737 if (unlikely((flags & SLUB_DMA)))
2738 return dma_kmalloc_cache(index, flags);
2741 return &kmalloc_caches[index];
2744 void *__kmalloc(size_t size, gfp_t flags)
2746 struct kmem_cache *s;
2749 if (unlikely(size > SLUB_MAX_SIZE))
2750 return kmalloc_large(size, flags);
2752 s = get_slab(size, flags);
2754 if (unlikely(ZERO_OR_NULL_PTR(s)))
2757 ret = slab_alloc(s, flags, -1, _RET_IP_);
2759 trace_kmalloc(_RET_IP_, ret, size, s->size, flags);
2763 EXPORT_SYMBOL(__kmalloc);
2765 static void *kmalloc_large_node(size_t size, gfp_t flags, int node)
2767 struct page *page = alloc_pages_node(node, flags | __GFP_COMP,
2771 return page_address(page);
2777 void *__kmalloc_node(size_t size, gfp_t flags, int node)
2779 struct kmem_cache *s;
2782 if (unlikely(size > SLUB_MAX_SIZE)) {
2783 ret = kmalloc_large_node(size, flags, node);
2785 trace_kmalloc_node(_RET_IP_, ret,
2786 size, PAGE_SIZE << get_order(size),
2792 s = get_slab(size, flags);
2794 if (unlikely(ZERO_OR_NULL_PTR(s)))
2797 ret = slab_alloc(s, flags, node, _RET_IP_);
2799 trace_kmalloc_node(_RET_IP_, ret, size, s->size, flags, node);
2803 EXPORT_SYMBOL(__kmalloc_node);
2806 size_t ksize(const void *object)
2809 struct kmem_cache *s;
2811 if (unlikely(object == ZERO_SIZE_PTR))
2814 page = virt_to_head_page(object);
2816 if (unlikely(!PageSlab(page))) {
2817 WARN_ON(!PageCompound(page));
2818 return PAGE_SIZE << compound_order(page);
2822 #ifdef CONFIG_SLUB_DEBUG
2824 * Debugging requires use of the padding between object
2825 * and whatever may come after it.
2827 if (s->flags & (SLAB_RED_ZONE | SLAB_POISON))
2832 * If we have the need to store the freelist pointer
2833 * back there or track user information then we can
2834 * only use the space before that information.
2836 if (s->flags & (SLAB_DESTROY_BY_RCU | SLAB_STORE_USER))
2839 * Else we can use all the padding etc for the allocation
2843 EXPORT_SYMBOL(ksize);
2845 void kfree(const void *x)
2848 void *object = (void *)x;
2850 trace_kfree(_RET_IP_, x);
2852 if (unlikely(ZERO_OR_NULL_PTR(x)))
2855 page = virt_to_head_page(x);
2856 if (unlikely(!PageSlab(page))) {
2857 BUG_ON(!PageCompound(page));
2861 slab_free(page->slab, page, object, _RET_IP_);
2863 EXPORT_SYMBOL(kfree);
2866 * kmem_cache_shrink removes empty slabs from the partial lists and sorts
2867 * the remaining slabs by the number of items in use. The slabs with the
2868 * most items in use come first. New allocations will then fill those up
2869 * and thus they can be removed from the partial lists.
2871 * The slabs with the least items are placed last. This results in them
2872 * being allocated from last increasing the chance that the last objects
2873 * are freed in them.
2875 int kmem_cache_shrink(struct kmem_cache *s)
2879 struct kmem_cache_node *n;
2882 int objects = oo_objects(s->max);
2883 struct list_head *slabs_by_inuse =
2884 kmalloc(sizeof(struct list_head) * objects, GFP_KERNEL);
2885 unsigned long flags;
2887 if (!slabs_by_inuse)
2891 for_each_node_state(node, N_NORMAL_MEMORY) {
2892 n = get_node(s, node);
2897 for (i = 0; i < objects; i++)
2898 INIT_LIST_HEAD(slabs_by_inuse + i);
2900 spin_lock_irqsave(&n->list_lock, flags);
2903 * Build lists indexed by the items in use in each slab.
2905 * Note that concurrent frees may occur while we hold the
2906 * list_lock. page->inuse here is the upper limit.
2908 list_for_each_entry_safe(page, t, &n->partial, lru) {
2909 if (!page->inuse && slab_trylock(page)) {
2911 * Must hold slab lock here because slab_free
2912 * may have freed the last object and be
2913 * waiting to release the slab.
2915 list_del(&page->lru);
2918 discard_slab(s, page);
2920 list_move(&page->lru,
2921 slabs_by_inuse + page->inuse);
2926 * Rebuild the partial list with the slabs filled up most
2927 * first and the least used slabs at the end.
2929 for (i = objects - 1; i >= 0; i--)
2930 list_splice(slabs_by_inuse + i, n->partial.prev);
2932 spin_unlock_irqrestore(&n->list_lock, flags);
2935 kfree(slabs_by_inuse);
2938 EXPORT_SYMBOL(kmem_cache_shrink);
2940 #if defined(CONFIG_NUMA) && defined(CONFIG_MEMORY_HOTPLUG)
2941 static int slab_mem_going_offline_callback(void *arg)
2943 struct kmem_cache *s;
2945 down_read(&slub_lock);
2946 list_for_each_entry(s, &slab_caches, list)
2947 kmem_cache_shrink(s);
2948 up_read(&slub_lock);
2953 static void slab_mem_offline_callback(void *arg)
2955 struct kmem_cache_node *n;
2956 struct kmem_cache *s;
2957 struct memory_notify *marg = arg;
2960 offline_node = marg->status_change_nid;
2963 * If the node still has available memory. we need kmem_cache_node
2966 if (offline_node < 0)
2969 down_read(&slub_lock);
2970 list_for_each_entry(s, &slab_caches, list) {
2971 n = get_node(s, offline_node);
2974 * if n->nr_slabs > 0, slabs still exist on the node
2975 * that is going down. We were unable to free them,
2976 * and offline_pages() function shoudn't call this
2977 * callback. So, we must fail.
2979 BUG_ON(slabs_node(s, offline_node));
2981 s->node[offline_node] = NULL;
2982 kmem_cache_free(kmalloc_caches, n);
2985 up_read(&slub_lock);
2988 static int slab_mem_going_online_callback(void *arg)
2990 struct kmem_cache_node *n;
2991 struct kmem_cache *s;
2992 struct memory_notify *marg = arg;
2993 int nid = marg->status_change_nid;
2997 * If the node's memory is already available, then kmem_cache_node is
2998 * already created. Nothing to do.
3004 * We are bringing a node online. No memory is available yet. We must
3005 * allocate a kmem_cache_node structure in order to bring the node
3008 down_read(&slub_lock);
3009 list_for_each_entry(s, &slab_caches, list) {
3011 * XXX: kmem_cache_alloc_node will fallback to other nodes
3012 * since memory is not yet available from the node that
3015 n = kmem_cache_alloc(kmalloc_caches, GFP_KERNEL);
3020 init_kmem_cache_node(n, s);
3024 up_read(&slub_lock);
3028 static int slab_memory_callback(struct notifier_block *self,
3029 unsigned long action, void *arg)
3034 case MEM_GOING_ONLINE:
3035 ret = slab_mem_going_online_callback(arg);
3037 case MEM_GOING_OFFLINE:
3038 ret = slab_mem_going_offline_callback(arg);
3041 case MEM_CANCEL_ONLINE:
3042 slab_mem_offline_callback(arg);
3045 case MEM_CANCEL_OFFLINE:
3049 ret = notifier_from_errno(ret);
3055 #endif /* CONFIG_MEMORY_HOTPLUG */
3057 /********************************************************************
3058 * Basic setup of slabs
3059 *******************************************************************/
3061 void __init kmem_cache_init(void)
3070 * Must first have the slab cache available for the allocations of the
3071 * struct kmem_cache_node's. There is special bootstrap code in
3072 * kmem_cache_open for slab_state == DOWN.
3074 create_kmalloc_cache(&kmalloc_caches[0], "kmem_cache_node",
3075 sizeof(struct kmem_cache_node), GFP_KERNEL);
3076 kmalloc_caches[0].refcount = -1;
3079 hotplug_memory_notifier(slab_memory_callback, SLAB_CALLBACK_PRI);
3082 /* Able to allocate the per node structures */
3083 slab_state = PARTIAL;
3085 /* Caches that are not of the two-to-the-power-of size */
3086 if (KMALLOC_MIN_SIZE <= 64) {
3087 create_kmalloc_cache(&kmalloc_caches[1],
3088 "kmalloc-96", 96, GFP_KERNEL);
3090 create_kmalloc_cache(&kmalloc_caches[2],
3091 "kmalloc-192", 192, GFP_KERNEL);
3095 for (i = KMALLOC_SHIFT_LOW; i < SLUB_PAGE_SHIFT; i++) {
3096 create_kmalloc_cache(&kmalloc_caches[i],
3097 "kmalloc", 1 << i, GFP_KERNEL);
3103 * Patch up the size_index table if we have strange large alignment
3104 * requirements for the kmalloc array. This is only the case for
3105 * MIPS it seems. The standard arches will not generate any code here.
3107 * Largest permitted alignment is 256 bytes due to the way we
3108 * handle the index determination for the smaller caches.
3110 * Make sure that nothing crazy happens if someone starts tinkering
3111 * around with ARCH_KMALLOC_MINALIGN
3113 BUILD_BUG_ON(KMALLOC_MIN_SIZE > 256 ||
3114 (KMALLOC_MIN_SIZE & (KMALLOC_MIN_SIZE - 1)));
3116 for (i = 8; i < KMALLOC_MIN_SIZE; i += 8)
3117 size_index[(i - 1) / 8] = KMALLOC_SHIFT_LOW;
3119 if (KMALLOC_MIN_SIZE == 128) {
3121 * The 192 byte sized cache is not used if the alignment
3122 * is 128 byte. Redirect kmalloc to use the 256 byte cache
3125 for (i = 128 + 8; i <= 192; i += 8)
3126 size_index[(i - 1) / 8] = 8;
3131 /* Provide the correct kmalloc names now that the caches are up */
3132 for (i = KMALLOC_SHIFT_LOW; i < SLUB_PAGE_SHIFT; i++)
3133 kmalloc_caches[i]. name =
3134 kasprintf(GFP_KERNEL, "kmalloc-%d", 1 << i);
3137 register_cpu_notifier(&slab_notifier);
3138 kmem_size = offsetof(struct kmem_cache, cpu_slab) +
3139 nr_cpu_ids * sizeof(struct kmem_cache_cpu *);
3141 kmem_size = sizeof(struct kmem_cache);
3145 "SLUB: Genslabs=%d, HWalign=%d, Order=%d-%d, MinObjects=%d,"
3146 " CPUs=%d, Nodes=%d\n",
3147 caches, cache_line_size(),
3148 slub_min_order, slub_max_order, slub_min_objects,
3149 nr_cpu_ids, nr_node_ids);
3153 * Find a mergeable slab cache
3155 static int slab_unmergeable(struct kmem_cache *s)
3157 if (slub_nomerge || (s->flags & SLUB_NEVER_MERGE))
3164 * We may have set a slab to be unmergeable during bootstrap.
3166 if (s->refcount < 0)
3172 static struct kmem_cache *find_mergeable(size_t size,
3173 size_t align, unsigned long flags, const char *name,
3174 void (*ctor)(void *))
3176 struct kmem_cache *s;
3178 if (slub_nomerge || (flags & SLUB_NEVER_MERGE))
3184 size = ALIGN(size, sizeof(void *));
3185 align = calculate_alignment(flags, align, size);
3186 size = ALIGN(size, align);
3187 flags = kmem_cache_flags(size, flags, name, NULL);
3189 list_for_each_entry(s, &slab_caches, list) {
3190 if (slab_unmergeable(s))
3196 if ((flags & SLUB_MERGE_SAME) != (s->flags & SLUB_MERGE_SAME))
3199 * Check if alignment is compatible.
3200 * Courtesy of Adrian Drzewiecki
3202 if ((s->size & ~(align - 1)) != s->size)
3205 if (s->size - size >= sizeof(void *))
3213 struct kmem_cache *kmem_cache_create(const char *name, size_t size,
3214 size_t align, unsigned long flags, void (*ctor)(void *))
3216 struct kmem_cache *s;
3218 down_write(&slub_lock);
3219 s = find_mergeable(size, align, flags, name, ctor);
3225 * Adjust the object sizes so that we clear
3226 * the complete object on kzalloc.
3228 s->objsize = max(s->objsize, (int)size);
3231 * And then we need to update the object size in the
3232 * per cpu structures
3234 for_each_online_cpu(cpu)
3235 get_cpu_slab(s, cpu)->objsize = s->objsize;
3237 s->inuse = max_t(int, s->inuse, ALIGN(size, sizeof(void *)));
3238 up_write(&slub_lock);
3240 if (sysfs_slab_alias(s, name)) {
3241 down_write(&slub_lock);
3243 up_write(&slub_lock);
3249 s = kmalloc(kmem_size, GFP_KERNEL);
3251 if (kmem_cache_open(s, GFP_KERNEL, name,
3252 size, align, flags, ctor)) {
3253 list_add(&s->list, &slab_caches);
3254 up_write(&slub_lock);
3255 if (sysfs_slab_add(s)) {
3256 down_write(&slub_lock);
3258 up_write(&slub_lock);
3266 up_write(&slub_lock);
3269 if (flags & SLAB_PANIC)
3270 panic("Cannot create slabcache %s\n", name);
3275 EXPORT_SYMBOL(kmem_cache_create);
3279 * Use the cpu notifier to insure that the cpu slabs are flushed when
3282 static int __cpuinit slab_cpuup_callback(struct notifier_block *nfb,
3283 unsigned long action, void *hcpu)
3285 long cpu = (long)hcpu;
3286 struct kmem_cache *s;
3287 unsigned long flags;
3290 case CPU_UP_PREPARE:
3291 case CPU_UP_PREPARE_FROZEN:
3292 init_alloc_cpu_cpu(cpu);
3293 down_read(&slub_lock);
3294 list_for_each_entry(s, &slab_caches, list)
3295 s->cpu_slab[cpu] = alloc_kmem_cache_cpu(s, cpu,
3297 up_read(&slub_lock);
3300 case CPU_UP_CANCELED:
3301 case CPU_UP_CANCELED_FROZEN:
3303 case CPU_DEAD_FROZEN:
3304 down_read(&slub_lock);
3305 list_for_each_entry(s, &slab_caches, list) {
3306 struct kmem_cache_cpu *c = get_cpu_slab(s, cpu);
3308 local_irq_save(flags);
3309 __flush_cpu_slab(s, cpu);
3310 local_irq_restore(flags);
3311 free_kmem_cache_cpu(c, cpu);
3312 s->cpu_slab[cpu] = NULL;
3314 up_read(&slub_lock);
3322 static struct notifier_block __cpuinitdata slab_notifier = {
3323 .notifier_call = slab_cpuup_callback
3328 void *__kmalloc_track_caller(size_t size, gfp_t gfpflags, unsigned long caller)
3330 struct kmem_cache *s;
3333 if (unlikely(size > SLUB_MAX_SIZE))
3334 return kmalloc_large(size, gfpflags);
3336 s = get_slab(size, gfpflags);
3338 if (unlikely(ZERO_OR_NULL_PTR(s)))
3341 ret = slab_alloc(s, gfpflags, -1, caller);
3343 /* Honor the call site pointer we recieved. */
3344 trace_kmalloc(caller, ret, size, s->size, gfpflags);
3349 void *__kmalloc_node_track_caller(size_t size, gfp_t gfpflags,
3350 int node, unsigned long caller)
3352 struct kmem_cache *s;
3355 if (unlikely(size > SLUB_MAX_SIZE))
3356 return kmalloc_large_node(size, gfpflags, node);
3358 s = get_slab(size, gfpflags);
3360 if (unlikely(ZERO_OR_NULL_PTR(s)))
3363 ret = slab_alloc(s, gfpflags, node, caller);
3365 /* Honor the call site pointer we recieved. */
3366 trace_kmalloc_node(caller, ret, size, s->size, gfpflags, node);
3371 #ifdef CONFIG_SLUB_DEBUG
3372 static int count_inuse(struct page *page)
3377 static int count_total(struct page *page)
3379 return page->objects;
3382 static int validate_slab(struct kmem_cache *s, struct page *page,
3386 void *addr = page_address(page);
3388 if (!check_slab(s, page) ||
3389 !on_freelist(s, page, NULL))
3392 /* Now we know that a valid freelist exists */
3393 bitmap_zero(map, page->objects);
3395 for_each_free_object(p, s, page->freelist) {
3396 set_bit(slab_index(p, s, addr), map);
3397 if (!check_object(s, page, p, 0))
3401 for_each_object(p, s, addr, page->objects)
3402 if (!test_bit(slab_index(p, s, addr), map))
3403 if (!check_object(s, page, p, 1))
3408 static void validate_slab_slab(struct kmem_cache *s, struct page *page,
3411 if (slab_trylock(page)) {
3412 validate_slab(s, page, map);
3415 printk(KERN_INFO "SLUB %s: Skipped busy slab 0x%p\n",
3418 if (s->flags & DEBUG_DEFAULT_FLAGS) {
3419 if (!PageSlubDebug(page))
3420 printk(KERN_ERR "SLUB %s: SlubDebug not set "
3421 "on slab 0x%p\n", s->name, page);
3423 if (PageSlubDebug(page))
3424 printk(KERN_ERR "SLUB %s: SlubDebug set on "
3425 "slab 0x%p\n", s->name, page);
3429 static int validate_slab_node(struct kmem_cache *s,
3430 struct kmem_cache_node *n, unsigned long *map)
3432 unsigned long count = 0;
3434 unsigned long flags;
3436 spin_lock_irqsave(&n->list_lock, flags);
3438 list_for_each_entry(page, &n->partial, lru) {
3439 validate_slab_slab(s, page, map);
3442 if (count != n->nr_partial)
3443 printk(KERN_ERR "SLUB %s: %ld partial slabs counted but "
3444 "counter=%ld\n", s->name, count, n->nr_partial);
3446 if (!(s->flags & SLAB_STORE_USER))
3449 list_for_each_entry(page, &n->full, lru) {
3450 validate_slab_slab(s, page, map);
3453 if (count != atomic_long_read(&n->nr_slabs))
3454 printk(KERN_ERR "SLUB: %s %ld slabs counted but "
3455 "counter=%ld\n", s->name, count,
3456 atomic_long_read(&n->nr_slabs));
3459 spin_unlock_irqrestore(&n->list_lock, flags);
3463 static long validate_slab_cache(struct kmem_cache *s)
3466 unsigned long count = 0;
3467 unsigned long *map = kmalloc(BITS_TO_LONGS(oo_objects(s->max)) *
3468 sizeof(unsigned long), GFP_KERNEL);
3474 for_each_node_state(node, N_NORMAL_MEMORY) {
3475 struct kmem_cache_node *n = get_node(s, node);
3477 count += validate_slab_node(s, n, map);
3483 #ifdef SLUB_RESILIENCY_TEST
3484 static void resiliency_test(void)
3488 printk(KERN_ERR "SLUB resiliency testing\n");
3489 printk(KERN_ERR "-----------------------\n");
3490 printk(KERN_ERR "A. Corruption after allocation\n");
3492 p = kzalloc(16, GFP_KERNEL);
3494 printk(KERN_ERR "\n1. kmalloc-16: Clobber Redzone/next pointer"
3495 " 0x12->0x%p\n\n", p + 16);
3497 validate_slab_cache(kmalloc_caches + 4);
3499 /* Hmmm... The next two are dangerous */
3500 p = kzalloc(32, GFP_KERNEL);
3501 p[32 + sizeof(void *)] = 0x34;
3502 printk(KERN_ERR "\n2. kmalloc-32: Clobber next pointer/next slab"
3503 " 0x34 -> -0x%p\n", p);
3505 "If allocated object is overwritten then not detectable\n\n");
3507 validate_slab_cache(kmalloc_caches + 5);
3508 p = kzalloc(64, GFP_KERNEL);
3509 p += 64 + (get_cycles() & 0xff) * sizeof(void *);
3511 printk(KERN_ERR "\n3. kmalloc-64: corrupting random byte 0x56->0x%p\n",
3514 "If allocated object is overwritten then not detectable\n\n");
3515 validate_slab_cache(kmalloc_caches + 6);
3517 printk(KERN_ERR "\nB. Corruption after free\n");
3518 p = kzalloc(128, GFP_KERNEL);
3521 printk(KERN_ERR "1. kmalloc-128: Clobber first word 0x78->0x%p\n\n", p);
3522 validate_slab_cache(kmalloc_caches + 7);
3524 p = kzalloc(256, GFP_KERNEL);
3527 printk(KERN_ERR "\n2. kmalloc-256: Clobber 50th byte 0x9a->0x%p\n\n",
3529 validate_slab_cache(kmalloc_caches + 8);
3531 p = kzalloc(512, GFP_KERNEL);
3534 printk(KERN_ERR "\n3. kmalloc-512: Clobber redzone 0xab->0x%p\n\n", p);
3535 validate_slab_cache(kmalloc_caches + 9);
3538 static void resiliency_test(void) {};
3542 * Generate lists of code addresses where slabcache objects are allocated
3547 unsigned long count;
3554 DECLARE_BITMAP(cpus, NR_CPUS);
3560 unsigned long count;
3561 struct location *loc;
3564 static void free_loc_track(struct loc_track *t)
3567 free_pages((unsigned long)t->loc,
3568 get_order(sizeof(struct location) * t->max));
3571 static int alloc_loc_track(struct loc_track *t, unsigned long max, gfp_t flags)
3576 order = get_order(sizeof(struct location) * max);
3578 l = (void *)__get_free_pages(flags, order);
3583 memcpy(l, t->loc, sizeof(struct location) * t->count);
3591 static int add_location(struct loc_track *t, struct kmem_cache *s,
3592 const struct track *track)
3594 long start, end, pos;
3596 unsigned long caddr;
3597 unsigned long age = jiffies - track->when;
3603 pos = start + (end - start + 1) / 2;
3606 * There is nothing at "end". If we end up there
3607 * we need to add something to before end.
3612 caddr = t->loc[pos].addr;
3613 if (track->addr == caddr) {
3619 if (age < l->min_time)
3621 if (age > l->max_time)
3624 if (track->pid < l->min_pid)
3625 l->min_pid = track->pid;
3626 if (track->pid > l->max_pid)
3627 l->max_pid = track->pid;
3629 cpumask_set_cpu(track->cpu,
3630 to_cpumask(l->cpus));
3632 node_set(page_to_nid(virt_to_page(track)), l->nodes);
3636 if (track->addr < caddr)
3643 * Not found. Insert new tracking element.
3645 if (t->count >= t->max && !alloc_loc_track(t, 2 * t->max, GFP_ATOMIC))
3651 (t->count - pos) * sizeof(struct location));
3654 l->addr = track->addr;
3658 l->min_pid = track->pid;
3659 l->max_pid = track->pid;
3660 cpumask_clear(to_cpumask(l->cpus));
3661 cpumask_set_cpu(track->cpu, to_cpumask(l->cpus));
3662 nodes_clear(l->nodes);
3663 node_set(page_to_nid(virt_to_page(track)), l->nodes);
3667 static void process_slab(struct loc_track *t, struct kmem_cache *s,
3668 struct page *page, enum track_item alloc)
3670 void *addr = page_address(page);
3671 DECLARE_BITMAP(map, page->objects);
3674 bitmap_zero(map, page->objects);
3675 for_each_free_object(p, s, page->freelist)
3676 set_bit(slab_index(p, s, addr), map);
3678 for_each_object(p, s, addr, page->objects)
3679 if (!test_bit(slab_index(p, s, addr), map))
3680 add_location(t, s, get_track(s, p, alloc));
3683 static int list_locations(struct kmem_cache *s, char *buf,
3684 enum track_item alloc)
3688 struct loc_track t = { 0, 0, NULL };
3691 if (!alloc_loc_track(&t, PAGE_SIZE / sizeof(struct location),
3693 return sprintf(buf, "Out of memory\n");
3695 /* Push back cpu slabs */
3698 for_each_node_state(node, N_NORMAL_MEMORY) {
3699 struct kmem_cache_node *n = get_node(s, node);
3700 unsigned long flags;
3703 if (!atomic_long_read(&n->nr_slabs))
3706 spin_lock_irqsave(&n->list_lock, flags);
3707 list_for_each_entry(page, &n->partial, lru)
3708 process_slab(&t, s, page, alloc);
3709 list_for_each_entry(page, &n->full, lru)
3710 process_slab(&t, s, page, alloc);
3711 spin_unlock_irqrestore(&n->list_lock, flags);
3714 for (i = 0; i < t.count; i++) {
3715 struct location *l = &t.loc[i];
3717 if (len > PAGE_SIZE - KSYM_SYMBOL_LEN - 100)
3719 len += sprintf(buf + len, "%7ld ", l->count);
3722 len += sprint_symbol(buf + len, (unsigned long)l->addr);
3724 len += sprintf(buf + len, "<not-available>");
3726 if (l->sum_time != l->min_time) {
3727 len += sprintf(buf + len, " age=%ld/%ld/%ld",
3729 (long)div_u64(l->sum_time, l->count),
3732 len += sprintf(buf + len, " age=%ld",
3735 if (l->min_pid != l->max_pid)
3736 len += sprintf(buf + len, " pid=%ld-%ld",
3737 l->min_pid, l->max_pid);
3739 len += sprintf(buf + len, " pid=%ld",
3742 if (num_online_cpus() > 1 &&
3743 !cpumask_empty(to_cpumask(l->cpus)) &&
3744 len < PAGE_SIZE - 60) {
3745 len += sprintf(buf + len, " cpus=");
3746 len += cpulist_scnprintf(buf + len, PAGE_SIZE - len - 50,
3747 to_cpumask(l->cpus));
3750 if (num_online_nodes() > 1 && !nodes_empty(l->nodes) &&
3751 len < PAGE_SIZE - 60) {
3752 len += sprintf(buf + len, " nodes=");
3753 len += nodelist_scnprintf(buf + len, PAGE_SIZE - len - 50,
3757 len += sprintf(buf + len, "\n");
3762 len += sprintf(buf, "No data\n");
3766 enum slab_stat_type {
3767 SL_ALL, /* All slabs */
3768 SL_PARTIAL, /* Only partially allocated slabs */
3769 SL_CPU, /* Only slabs used for cpu caches */
3770 SL_OBJECTS, /* Determine allocated objects not slabs */
3771 SL_TOTAL /* Determine object capacity not slabs */
3774 #define SO_ALL (1 << SL_ALL)
3775 #define SO_PARTIAL (1 << SL_PARTIAL)
3776 #define SO_CPU (1 << SL_CPU)
3777 #define SO_OBJECTS (1 << SL_OBJECTS)
3778 #define SO_TOTAL (1 << SL_TOTAL)
3780 static ssize_t show_slab_objects(struct kmem_cache *s,
3781 char *buf, unsigned long flags)
3783 unsigned long total = 0;
3786 unsigned long *nodes;
3787 unsigned long *per_cpu;
3789 nodes = kzalloc(2 * sizeof(unsigned long) * nr_node_ids, GFP_KERNEL);
3792 per_cpu = nodes + nr_node_ids;
3794 if (flags & SO_CPU) {
3797 for_each_possible_cpu(cpu) {
3798 struct kmem_cache_cpu *c = get_cpu_slab(s, cpu);
3800 if (!c || c->node < 0)
3804 if (flags & SO_TOTAL)
3805 x = c->page->objects;
3806 else if (flags & SO_OBJECTS)
3812 nodes[c->node] += x;
3818 if (flags & SO_ALL) {
3819 for_each_node_state(node, N_NORMAL_MEMORY) {
3820 struct kmem_cache_node *n = get_node(s, node);
3822 if (flags & SO_TOTAL)
3823 x = atomic_long_read(&n->total_objects);
3824 else if (flags & SO_OBJECTS)
3825 x = atomic_long_read(&n->total_objects) -
3826 count_partial(n, count_free);
3829 x = atomic_long_read(&n->nr_slabs);
3834 } else if (flags & SO_PARTIAL) {
3835 for_each_node_state(node, N_NORMAL_MEMORY) {
3836 struct kmem_cache_node *n = get_node(s, node);
3838 if (flags & SO_TOTAL)
3839 x = count_partial(n, count_total);
3840 else if (flags & SO_OBJECTS)
3841 x = count_partial(n, count_inuse);
3848 x = sprintf(buf, "%lu", total);
3850 for_each_node_state(node, N_NORMAL_MEMORY)
3852 x += sprintf(buf + x, " N%d=%lu",
3856 return x + sprintf(buf + x, "\n");
3859 static int any_slab_objects(struct kmem_cache *s)
3863 for_each_online_node(node) {
3864 struct kmem_cache_node *n = get_node(s, node);
3869 if (atomic_long_read(&n->total_objects))
3875 #define to_slab_attr(n) container_of(n, struct slab_attribute, attr)
3876 #define to_slab(n) container_of(n, struct kmem_cache, kobj);
3878 struct slab_attribute {
3879 struct attribute attr;
3880 ssize_t (*show)(struct kmem_cache *s, char *buf);
3881 ssize_t (*store)(struct kmem_cache *s, const char *x, size_t count);
3884 #define SLAB_ATTR_RO(_name) \
3885 static struct slab_attribute _name##_attr = __ATTR_RO(_name)
3887 #define SLAB_ATTR(_name) \
3888 static struct slab_attribute _name##_attr = \
3889 __ATTR(_name, 0644, _name##_show, _name##_store)
3891 static ssize_t slab_size_show(struct kmem_cache *s, char *buf)
3893 return sprintf(buf, "%d\n", s->size);
3895 SLAB_ATTR_RO(slab_size);
3897 static ssize_t align_show(struct kmem_cache *s, char *buf)
3899 return sprintf(buf, "%d\n", s->align);
3901 SLAB_ATTR_RO(align);
3903 static ssize_t object_size_show(struct kmem_cache *s, char *buf)
3905 return sprintf(buf, "%d\n", s->objsize);
3907 SLAB_ATTR_RO(object_size);
3909 static ssize_t objs_per_slab_show(struct kmem_cache *s, char *buf)
3911 return sprintf(buf, "%d\n", oo_objects(s->oo));
3913 SLAB_ATTR_RO(objs_per_slab);
3915 static ssize_t order_store(struct kmem_cache *s,
3916 const char *buf, size_t length)
3918 unsigned long order;
3921 err = strict_strtoul(buf, 10, &order);
3925 if (order > slub_max_order || order < slub_min_order)
3928 calculate_sizes(s, order);
3932 static ssize_t order_show(struct kmem_cache *s, char *buf)
3934 return sprintf(buf, "%d\n", oo_order(s->oo));
3938 static ssize_t min_partial_show(struct kmem_cache *s, char *buf)
3940 return sprintf(buf, "%lu\n", s->min_partial);
3943 static ssize_t min_partial_store(struct kmem_cache *s, const char *buf,
3949 err = strict_strtoul(buf, 10, &min);
3953 set_min_partial(s, min);
3956 SLAB_ATTR(min_partial);
3958 static ssize_t ctor_show(struct kmem_cache *s, char *buf)
3961 int n = sprint_symbol(buf, (unsigned long)s->ctor);
3963 return n + sprintf(buf + n, "\n");
3969 static ssize_t aliases_show(struct kmem_cache *s, char *buf)
3971 return sprintf(buf, "%d\n", s->refcount - 1);
3973 SLAB_ATTR_RO(aliases);
3975 static ssize_t slabs_show(struct kmem_cache *s, char *buf)
3977 return show_slab_objects(s, buf, SO_ALL);
3979 SLAB_ATTR_RO(slabs);
3981 static ssize_t partial_show(struct kmem_cache *s, char *buf)
3983 return show_slab_objects(s, buf, SO_PARTIAL);
3985 SLAB_ATTR_RO(partial);
3987 static ssize_t cpu_slabs_show(struct kmem_cache *s, char *buf)
3989 return show_slab_objects(s, buf, SO_CPU);
3991 SLAB_ATTR_RO(cpu_slabs);
3993 static ssize_t objects_show(struct kmem_cache *s, char *buf)
3995 return show_slab_objects(s, buf, SO_ALL|SO_OBJECTS);
3997 SLAB_ATTR_RO(objects);
3999 static ssize_t objects_partial_show(struct kmem_cache *s, char *buf)
4001 return show_slab_objects(s, buf, SO_PARTIAL|SO_OBJECTS);
4003 SLAB_ATTR_RO(objects_partial);
4005 static ssize_t total_objects_show(struct kmem_cache *s, char *buf)
4007 return show_slab_objects(s, buf, SO_ALL|SO_TOTAL);
4009 SLAB_ATTR_RO(total_objects);
4011 static ssize_t sanity_checks_show(struct kmem_cache *s, char *buf)
4013 return sprintf(buf, "%d\n", !!(s->flags & SLAB_DEBUG_FREE));
4016 static ssize_t sanity_checks_store(struct kmem_cache *s,
4017 const char *buf, size_t length)
4019 s->flags &= ~SLAB_DEBUG_FREE;
4021 s->flags |= SLAB_DEBUG_FREE;
4024 SLAB_ATTR(sanity_checks);
4026 static ssize_t trace_show(struct kmem_cache *s, char *buf)
4028 return sprintf(buf, "%d\n", !!(s->flags & SLAB_TRACE));
4031 static ssize_t trace_store(struct kmem_cache *s, const char *buf,
4034 s->flags &= ~SLAB_TRACE;
4036 s->flags |= SLAB_TRACE;
4041 static ssize_t reclaim_account_show(struct kmem_cache *s, char *buf)
4043 return sprintf(buf, "%d\n", !!(s->flags & SLAB_RECLAIM_ACCOUNT));
4046 static ssize_t reclaim_account_store(struct kmem_cache *s,
4047 const char *buf, size_t length)
4049 s->flags &= ~SLAB_RECLAIM_ACCOUNT;
4051 s->flags |= SLAB_RECLAIM_ACCOUNT;
4054 SLAB_ATTR(reclaim_account);
4056 static ssize_t hwcache_align_show(struct kmem_cache *s, char *buf)
4058 return sprintf(buf, "%d\n", !!(s->flags & SLAB_HWCACHE_ALIGN));
4060 SLAB_ATTR_RO(hwcache_align);
4062 #ifdef CONFIG_ZONE_DMA
4063 static ssize_t cache_dma_show(struct kmem_cache *s, char *buf)
4065 return sprintf(buf, "%d\n", !!(s->flags & SLAB_CACHE_DMA));
4067 SLAB_ATTR_RO(cache_dma);
4070 static ssize_t destroy_by_rcu_show(struct kmem_cache *s, char *buf)
4072 return sprintf(buf, "%d\n", !!(s->flags & SLAB_DESTROY_BY_RCU));
4074 SLAB_ATTR_RO(destroy_by_rcu);
4076 static ssize_t red_zone_show(struct kmem_cache *s, char *buf)
4078 return sprintf(buf, "%d\n", !!(s->flags & SLAB_RED_ZONE));
4081 static ssize_t red_zone_store(struct kmem_cache *s,
4082 const char *buf, size_t length)
4084 if (any_slab_objects(s))
4087 s->flags &= ~SLAB_RED_ZONE;
4089 s->flags |= SLAB_RED_ZONE;
4090 calculate_sizes(s, -1);
4093 SLAB_ATTR(red_zone);
4095 static ssize_t poison_show(struct kmem_cache *s, char *buf)
4097 return sprintf(buf, "%d\n", !!(s->flags & SLAB_POISON));
4100 static ssize_t poison_store(struct kmem_cache *s,
4101 const char *buf, size_t length)
4103 if (any_slab_objects(s))
4106 s->flags &= ~SLAB_POISON;
4108 s->flags |= SLAB_POISON;
4109 calculate_sizes(s, -1);
4114 static ssize_t store_user_show(struct kmem_cache *s, char *buf)
4116 return sprintf(buf, "%d\n", !!(s->flags & SLAB_STORE_USER));
4119 static ssize_t store_user_store(struct kmem_cache *s,
4120 const char *buf, size_t length)
4122 if (any_slab_objects(s))
4125 s->flags &= ~SLAB_STORE_USER;
4127 s->flags |= SLAB_STORE_USER;
4128 calculate_sizes(s, -1);
4131 SLAB_ATTR(store_user);
4133 static ssize_t validate_show(struct kmem_cache *s, char *buf)
4138 static ssize_t validate_store(struct kmem_cache *s,
4139 const char *buf, size_t length)
4143 if (buf[0] == '1') {
4144 ret = validate_slab_cache(s);
4150 SLAB_ATTR(validate);
4152 static ssize_t shrink_show(struct kmem_cache *s, char *buf)
4157 static ssize_t shrink_store(struct kmem_cache *s,
4158 const char *buf, size_t length)
4160 if (buf[0] == '1') {
4161 int rc = kmem_cache_shrink(s);
4171 static ssize_t alloc_calls_show(struct kmem_cache *s, char *buf)
4173 if (!(s->flags & SLAB_STORE_USER))
4175 return list_locations(s, buf, TRACK_ALLOC);
4177 SLAB_ATTR_RO(alloc_calls);
4179 static ssize_t free_calls_show(struct kmem_cache *s, char *buf)
4181 if (!(s->flags & SLAB_STORE_USER))
4183 return list_locations(s, buf, TRACK_FREE);
4185 SLAB_ATTR_RO(free_calls);
4188 static ssize_t remote_node_defrag_ratio_show(struct kmem_cache *s, char *buf)
4190 return sprintf(buf, "%d\n", s->remote_node_defrag_ratio / 10);
4193 static ssize_t remote_node_defrag_ratio_store(struct kmem_cache *s,
4194 const char *buf, size_t length)
4196 unsigned long ratio;
4199 err = strict_strtoul(buf, 10, &ratio);
4204 s->remote_node_defrag_ratio = ratio * 10;
4208 SLAB_ATTR(remote_node_defrag_ratio);
4211 #ifdef CONFIG_SLUB_STATS
4212 static int show_stat(struct kmem_cache *s, char *buf, enum stat_item si)
4214 unsigned long sum = 0;
4217 int *data = kmalloc(nr_cpu_ids * sizeof(int), GFP_KERNEL);
4222 for_each_online_cpu(cpu) {
4223 unsigned x = get_cpu_slab(s, cpu)->stat[si];
4229 len = sprintf(buf, "%lu", sum);
4232 for_each_online_cpu(cpu) {
4233 if (data[cpu] && len < PAGE_SIZE - 20)
4234 len += sprintf(buf + len, " C%d=%u", cpu, data[cpu]);
4238 return len + sprintf(buf + len, "\n");
4241 #define STAT_ATTR(si, text) \
4242 static ssize_t text##_show(struct kmem_cache *s, char *buf) \
4244 return show_stat(s, buf, si); \
4246 SLAB_ATTR_RO(text); \
4248 STAT_ATTR(ALLOC_FASTPATH, alloc_fastpath);
4249 STAT_ATTR(ALLOC_SLOWPATH, alloc_slowpath);
4250 STAT_ATTR(FREE_FASTPATH, free_fastpath);
4251 STAT_ATTR(FREE_SLOWPATH, free_slowpath);
4252 STAT_ATTR(FREE_FROZEN, free_frozen);
4253 STAT_ATTR(FREE_ADD_PARTIAL, free_add_partial);
4254 STAT_ATTR(FREE_REMOVE_PARTIAL, free_remove_partial);
4255 STAT_ATTR(ALLOC_FROM_PARTIAL, alloc_from_partial);
4256 STAT_ATTR(ALLOC_SLAB, alloc_slab);
4257 STAT_ATTR(ALLOC_REFILL, alloc_refill);
4258 STAT_ATTR(FREE_SLAB, free_slab);
4259 STAT_ATTR(CPUSLAB_FLUSH, cpuslab_flush);
4260 STAT_ATTR(DEACTIVATE_FULL, deactivate_full);
4261 STAT_ATTR(DEACTIVATE_EMPTY, deactivate_empty);
4262 STAT_ATTR(DEACTIVATE_TO_HEAD, deactivate_to_head);
4263 STAT_ATTR(DEACTIVATE_TO_TAIL, deactivate_to_tail);
4264 STAT_ATTR(DEACTIVATE_REMOTE_FREES, deactivate_remote_frees);
4265 STAT_ATTR(ORDER_FALLBACK, order_fallback);
4268 static struct attribute *slab_attrs[] = {
4269 &slab_size_attr.attr,
4270 &object_size_attr.attr,
4271 &objs_per_slab_attr.attr,
4273 &min_partial_attr.attr,
4275 &objects_partial_attr.attr,
4276 &total_objects_attr.attr,
4279 &cpu_slabs_attr.attr,
4283 &sanity_checks_attr.attr,
4285 &hwcache_align_attr.attr,
4286 &reclaim_account_attr.attr,
4287 &destroy_by_rcu_attr.attr,
4288 &red_zone_attr.attr,
4290 &store_user_attr.attr,
4291 &validate_attr.attr,
4293 &alloc_calls_attr.attr,
4294 &free_calls_attr.attr,
4295 #ifdef CONFIG_ZONE_DMA
4296 &cache_dma_attr.attr,
4299 &remote_node_defrag_ratio_attr.attr,
4301 #ifdef CONFIG_SLUB_STATS
4302 &alloc_fastpath_attr.attr,
4303 &alloc_slowpath_attr.attr,
4304 &free_fastpath_attr.attr,
4305 &free_slowpath_attr.attr,
4306 &free_frozen_attr.attr,
4307 &free_add_partial_attr.attr,
4308 &free_remove_partial_attr.attr,
4309 &alloc_from_partial_attr.attr,
4310 &alloc_slab_attr.attr,
4311 &alloc_refill_attr.attr,
4312 &free_slab_attr.attr,
4313 &cpuslab_flush_attr.attr,
4314 &deactivate_full_attr.attr,
4315 &deactivate_empty_attr.attr,
4316 &deactivate_to_head_attr.attr,
4317 &deactivate_to_tail_attr.attr,
4318 &deactivate_remote_frees_attr.attr,
4319 &order_fallback_attr.attr,
4324 static struct attribute_group slab_attr_group = {
4325 .attrs = slab_attrs,
4328 static ssize_t slab_attr_show(struct kobject *kobj,
4329 struct attribute *attr,
4332 struct slab_attribute *attribute;
4333 struct kmem_cache *s;
4336 attribute = to_slab_attr(attr);
4339 if (!attribute->show)
4342 err = attribute->show(s, buf);
4347 static ssize_t slab_attr_store(struct kobject *kobj,
4348 struct attribute *attr,
4349 const char *buf, size_t len)
4351 struct slab_attribute *attribute;
4352 struct kmem_cache *s;
4355 attribute = to_slab_attr(attr);
4358 if (!attribute->store)
4361 err = attribute->store(s, buf, len);
4366 static void kmem_cache_release(struct kobject *kobj)
4368 struct kmem_cache *s = to_slab(kobj);
4373 static struct sysfs_ops slab_sysfs_ops = {
4374 .show = slab_attr_show,
4375 .store = slab_attr_store,
4378 static struct kobj_type slab_ktype = {
4379 .sysfs_ops = &slab_sysfs_ops,
4380 .release = kmem_cache_release
4383 static int uevent_filter(struct kset *kset, struct kobject *kobj)
4385 struct kobj_type *ktype = get_ktype(kobj);
4387 if (ktype == &slab_ktype)
4392 static struct kset_uevent_ops slab_uevent_ops = {
4393 .filter = uevent_filter,
4396 static struct kset *slab_kset;
4398 #define ID_STR_LENGTH 64
4400 /* Create a unique string id for a slab cache:
4402 * Format :[flags-]size
4404 static char *create_unique_id(struct kmem_cache *s)
4406 char *name = kmalloc(ID_STR_LENGTH, GFP_KERNEL);
4413 * First flags affecting slabcache operations. We will only
4414 * get here for aliasable slabs so we do not need to support
4415 * too many flags. The flags here must cover all flags that
4416 * are matched during merging to guarantee that the id is
4419 if (s->flags & SLAB_CACHE_DMA)
4421 if (s->flags & SLAB_RECLAIM_ACCOUNT)
4423 if (s->flags & SLAB_DEBUG_FREE)
4427 p += sprintf(p, "%07d", s->size);
4428 BUG_ON(p > name + ID_STR_LENGTH - 1);
4432 static int sysfs_slab_add(struct kmem_cache *s)
4438 if (slab_state < SYSFS)
4439 /* Defer until later */
4442 unmergeable = slab_unmergeable(s);
4445 * Slabcache can never be merged so we can use the name proper.
4446 * This is typically the case for debug situations. In that
4447 * case we can catch duplicate names easily.
4449 sysfs_remove_link(&slab_kset->kobj, s->name);
4453 * Create a unique name for the slab as a target
4456 name = create_unique_id(s);
4459 s->kobj.kset = slab_kset;
4460 err = kobject_init_and_add(&s->kobj, &slab_ktype, NULL, name);
4462 kobject_put(&s->kobj);
4466 err = sysfs_create_group(&s->kobj, &slab_attr_group);
4469 kobject_uevent(&s->kobj, KOBJ_ADD);
4471 /* Setup first alias */
4472 sysfs_slab_alias(s, s->name);
4478 static void sysfs_slab_remove(struct kmem_cache *s)
4480 kobject_uevent(&s->kobj, KOBJ_REMOVE);
4481 kobject_del(&s->kobj);
4482 kobject_put(&s->kobj);
4486 * Need to buffer aliases during bootup until sysfs becomes
4487 * available lest we lose that information.
4489 struct saved_alias {
4490 struct kmem_cache *s;
4492 struct saved_alias *next;
4495 static struct saved_alias *alias_list;
4497 static int sysfs_slab_alias(struct kmem_cache *s, const char *name)
4499 struct saved_alias *al;
4501 if (slab_state == SYSFS) {
4503 * If we have a leftover link then remove it.
4505 sysfs_remove_link(&slab_kset->kobj, name);
4506 return sysfs_create_link(&slab_kset->kobj, &s->kobj, name);
4509 al = kmalloc(sizeof(struct saved_alias), GFP_KERNEL);
4515 al->next = alias_list;
4520 static int __init slab_sysfs_init(void)
4522 struct kmem_cache *s;
4525 slab_kset = kset_create_and_add("slab", &slab_uevent_ops, kernel_kobj);
4527 printk(KERN_ERR "Cannot register slab subsystem.\n");
4533 list_for_each_entry(s, &slab_caches, list) {
4534 err = sysfs_slab_add(s);
4536 printk(KERN_ERR "SLUB: Unable to add boot slab %s"
4537 " to sysfs\n", s->name);
4540 while (alias_list) {
4541 struct saved_alias *al = alias_list;
4543 alias_list = alias_list->next;
4544 err = sysfs_slab_alias(al->s, al->name);
4546 printk(KERN_ERR "SLUB: Unable to add boot slab alias"
4547 " %s to sysfs\n", s->name);
4555 __initcall(slab_sysfs_init);
4559 * The /proc/slabinfo ABI
4561 #ifdef CONFIG_SLABINFO
4562 static void print_slabinfo_header(struct seq_file *m)
4564 seq_puts(m, "slabinfo - version: 2.1\n");
4565 seq_puts(m, "# name <active_objs> <num_objs> <objsize> "
4566 "<objperslab> <pagesperslab>");
4567 seq_puts(m, " : tunables <limit> <batchcount> <sharedfactor>");
4568 seq_puts(m, " : slabdata <active_slabs> <num_slabs> <sharedavail>");
4572 static void *s_start(struct seq_file *m, loff_t *pos)
4576 down_read(&slub_lock);
4578 print_slabinfo_header(m);
4580 return seq_list_start(&slab_caches, *pos);
4583 static void *s_next(struct seq_file *m, void *p, loff_t *pos)
4585 return seq_list_next(p, &slab_caches, pos);
4588 static void s_stop(struct seq_file *m, void *p)
4590 up_read(&slub_lock);
4593 static int s_show(struct seq_file *m, void *p)
4595 unsigned long nr_partials = 0;
4596 unsigned long nr_slabs = 0;
4597 unsigned long nr_inuse = 0;
4598 unsigned long nr_objs = 0;
4599 unsigned long nr_free = 0;
4600 struct kmem_cache *s;
4603 s = list_entry(p, struct kmem_cache, list);
4605 for_each_online_node(node) {
4606 struct kmem_cache_node *n = get_node(s, node);
4611 nr_partials += n->nr_partial;
4612 nr_slabs += atomic_long_read(&n->nr_slabs);
4613 nr_objs += atomic_long_read(&n->total_objects);
4614 nr_free += count_partial(n, count_free);
4617 nr_inuse = nr_objs - nr_free;
4619 seq_printf(m, "%-17s %6lu %6lu %6u %4u %4d", s->name, nr_inuse,
4620 nr_objs, s->size, oo_objects(s->oo),
4621 (1 << oo_order(s->oo)));
4622 seq_printf(m, " : tunables %4u %4u %4u", 0, 0, 0);
4623 seq_printf(m, " : slabdata %6lu %6lu %6lu", nr_slabs, nr_slabs,
4629 static const struct seq_operations slabinfo_op = {
4636 static int slabinfo_open(struct inode *inode, struct file *file)
4638 return seq_open(file, &slabinfo_op);
4641 static const struct file_operations proc_slabinfo_operations = {
4642 .open = slabinfo_open,
4644 .llseek = seq_lseek,
4645 .release = seq_release,
4648 static int __init slab_proc_init(void)
4650 proc_create("slabinfo",S_IWUSR|S_IRUGO,NULL,&proc_slabinfo_operations);
4653 module_init(slab_proc_init);
4654 #endif /* CONFIG_SLABINFO */