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 <clameter@sgi.com>
12 #include <linux/module.h>
13 #include <linux/bit_spinlock.h>
14 #include <linux/interrupt.h>
15 #include <linux/bitops.h>
16 #include <linux/slab.h>
17 #include <linux/seq_file.h>
18 #include <linux/cpu.h>
19 #include <linux/cpuset.h>
20 #include <linux/mempolicy.h>
21 #include <linux/ctype.h>
22 #include <linux/kallsyms.h>
23 #include <linux/memory.h>
30 * The slab_lock protects operations on the object of a particular
31 * slab and its metadata in the page struct. If the slab lock
32 * has been taken then no allocations nor frees can be performed
33 * on the objects in the slab nor can the slab be added or removed
34 * from the partial or full lists since this would mean modifying
35 * the page_struct of the slab.
37 * The list_lock protects the partial and full list on each node and
38 * the partial slab counter. If taken then no new slabs may be added or
39 * removed from the lists nor make the number of partial slabs be modified.
40 * (Note that the total number of slabs is an atomic value that may be
41 * modified without taking the list lock).
43 * The list_lock is a centralized lock and thus we avoid taking it as
44 * much as possible. As long as SLUB does not have to handle partial
45 * slabs, operations can continue without any centralized lock. F.e.
46 * allocating a long series of objects that fill up slabs does not require
49 * The lock order is sometimes inverted when we are trying to get a slab
50 * off a list. We take the list_lock and then look for a page on the list
51 * to use. While we do that objects in the slabs may be freed. We can
52 * only operate on the slab if we have also taken the slab_lock. So we use
53 * a slab_trylock() on the slab. If trylock was successful then no frees
54 * can occur anymore and we can use the slab for allocations etc. If the
55 * slab_trylock() does not succeed then frees are in progress in the slab and
56 * we must stay away from it for a while since we may cause a bouncing
57 * cacheline if we try to acquire the lock. So go onto the next slab.
58 * If all pages are busy then we may allocate a new slab instead of reusing
59 * a partial slab. A new slab has noone operating on it and thus there is
60 * no danger of cacheline contention.
62 * Interrupts are disabled during allocation and deallocation in order to
63 * make the slab allocator safe to use in the context of an irq. In addition
64 * interrupts are disabled to ensure that the processor does not change
65 * while handling per_cpu slabs, due to kernel preemption.
67 * SLUB assigns one slab for allocation to each processor.
68 * Allocations only occur from these slabs called cpu slabs.
70 * Slabs with free elements are kept on a partial list and during regular
71 * operations no list for full slabs is used. If an object in a full slab is
72 * freed then the slab will show up again on the partial lists.
73 * We track full slabs for debugging purposes though because otherwise we
74 * cannot scan all objects.
76 * Slabs are freed when they become empty. Teardown and setup is
77 * minimal so we rely on the page allocators per cpu caches for
78 * fast frees and allocs.
80 * Overloading of page flags that are otherwise used for LRU management.
82 * PageActive The slab is frozen and exempt from list processing.
83 * This means that the slab is dedicated to a purpose
84 * such as satisfying allocations for a specific
85 * processor. Objects may be freed in the slab while
86 * it is frozen but slab_free will then skip the usual
87 * list operations. It is up to the processor holding
88 * the slab to integrate the slab into the slab lists
89 * when the slab is no longer needed.
91 * One use of this flag is to mark slabs that are
92 * used for allocations. Then such a slab becomes a cpu
93 * slab. The cpu slab may be equipped with an additional
94 * freelist that allows lockless access to
95 * free objects in addition to the regular freelist
96 * that requires the slab lock.
98 * PageError Slab requires special handling due to debug
99 * options set. This moves slab handling out of
100 * the fast path and disables lockless freelists.
103 #define FROZEN (1 << PG_active)
105 #ifdef CONFIG_SLUB_DEBUG
106 #define SLABDEBUG (1 << PG_error)
111 static inline int SlabFrozen(struct page *page)
113 return page->flags & FROZEN;
116 static inline void SetSlabFrozen(struct page *page)
118 page->flags |= FROZEN;
121 static inline void ClearSlabFrozen(struct page *page)
123 page->flags &= ~FROZEN;
126 static inline int SlabDebug(struct page *page)
128 return page->flags & SLABDEBUG;
131 static inline void SetSlabDebug(struct page *page)
133 page->flags |= SLABDEBUG;
136 static inline void ClearSlabDebug(struct page *page)
138 page->flags &= ~SLABDEBUG;
142 * Issues still to be resolved:
144 * - Support PAGE_ALLOC_DEBUG. Should be easy to do.
146 * - Variable sizing of the per node arrays
149 /* Enable to test recovery from slab corruption on boot */
150 #undef SLUB_RESILIENCY_TEST
155 * Small page size. Make sure that we do not fragment memory
157 #define DEFAULT_MAX_ORDER 1
158 #define DEFAULT_MIN_OBJECTS 4
163 * Large page machines are customarily able to handle larger
166 #define DEFAULT_MAX_ORDER 2
167 #define DEFAULT_MIN_OBJECTS 8
172 * Mininum number of partial slabs. These will be left on the partial
173 * lists even if they are empty. kmem_cache_shrink may reclaim them.
175 #define MIN_PARTIAL 5
178 * Maximum number of desirable partial slabs.
179 * The existence of more partial slabs makes kmem_cache_shrink
180 * sort the partial list by the number of objects in the.
182 #define MAX_PARTIAL 10
184 #define DEBUG_DEFAULT_FLAGS (SLAB_DEBUG_FREE | SLAB_RED_ZONE | \
185 SLAB_POISON | SLAB_STORE_USER)
188 * Set of flags that will prevent slab merging
190 #define SLUB_NEVER_MERGE (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER | \
191 SLAB_TRACE | SLAB_DESTROY_BY_RCU)
193 #define SLUB_MERGE_SAME (SLAB_DEBUG_FREE | SLAB_RECLAIM_ACCOUNT | \
196 #ifndef ARCH_KMALLOC_MINALIGN
197 #define ARCH_KMALLOC_MINALIGN __alignof__(unsigned long long)
200 #ifndef ARCH_SLAB_MINALIGN
201 #define ARCH_SLAB_MINALIGN __alignof__(unsigned long long)
204 /* Internal SLUB flags */
205 #define __OBJECT_POISON 0x80000000 /* Poison object */
206 #define __SYSFS_ADD_DEFERRED 0x40000000 /* Not yet visible via sysfs */
208 /* Not all arches define cache_line_size */
209 #ifndef cache_line_size
210 #define cache_line_size() L1_CACHE_BYTES
213 static int kmem_size = sizeof(struct kmem_cache);
216 static struct notifier_block slab_notifier;
220 DOWN, /* No slab functionality available */
221 PARTIAL, /* kmem_cache_open() works but kmalloc does not */
222 UP, /* Everything works but does not show up in sysfs */
226 /* A list of all slab caches on the system */
227 static DECLARE_RWSEM(slub_lock);
228 static LIST_HEAD(slab_caches);
231 * Tracking user of a slab.
234 void *addr; /* Called from address */
235 int cpu; /* Was running on cpu */
236 int pid; /* Pid context */
237 unsigned long when; /* When did the operation occur */
240 enum track_item { TRACK_ALLOC, TRACK_FREE };
242 #if defined(CONFIG_SYSFS) && defined(CONFIG_SLUB_DEBUG)
243 static int sysfs_slab_add(struct kmem_cache *);
244 static int sysfs_slab_alias(struct kmem_cache *, const char *);
245 static void sysfs_slab_remove(struct kmem_cache *);
248 static inline int sysfs_slab_add(struct kmem_cache *s) { return 0; }
249 static inline int sysfs_slab_alias(struct kmem_cache *s, const char *p)
251 static inline void sysfs_slab_remove(struct kmem_cache *s)
258 static inline void stat(struct kmem_cache_cpu *c, enum stat_item si)
260 #ifdef CONFIG_SLUB_STATS
265 /********************************************************************
266 * Core slab cache functions
267 *******************************************************************/
269 int slab_is_available(void)
271 return slab_state >= UP;
274 static inline struct kmem_cache_node *get_node(struct kmem_cache *s, int node)
277 return s->node[node];
279 return &s->local_node;
283 static inline struct kmem_cache_cpu *get_cpu_slab(struct kmem_cache *s, int cpu)
286 return s->cpu_slab[cpu];
292 /* Verify that a pointer has an address that is valid within a slab page */
293 static inline int check_valid_pointer(struct kmem_cache *s,
294 struct page *page, const void *object)
301 base = page_address(page);
302 if (object < base || object >= base + page->objects * s->size ||
303 (object - base) % s->size) {
311 * Slow version of get and set free pointer.
313 * This version requires touching the cache lines of kmem_cache which
314 * we avoid to do in the fast alloc free paths. There we obtain the offset
315 * from the page struct.
317 static inline void *get_freepointer(struct kmem_cache *s, void *object)
319 return *(void **)(object + s->offset);
322 static inline void set_freepointer(struct kmem_cache *s, void *object, void *fp)
324 *(void **)(object + s->offset) = fp;
327 /* Loop over all objects in a slab */
328 #define for_each_object(__p, __s, __addr, __objects) \
329 for (__p = (__addr); __p < (__addr) + (__objects) * (__s)->size;\
333 #define for_each_free_object(__p, __s, __free) \
334 for (__p = (__free); __p; __p = get_freepointer((__s), __p))
336 /* Determine object index from a given position */
337 static inline int slab_index(void *p, struct kmem_cache *s, void *addr)
339 return (p - addr) / s->size;
342 static inline struct kmem_cache_order_objects oo_make(int order,
345 struct kmem_cache_order_objects x = {
346 (order << 16) + (PAGE_SIZE << order) / size
352 static inline int oo_order(struct kmem_cache_order_objects x)
357 static inline int oo_objects(struct kmem_cache_order_objects x)
359 return x.x & ((1 << 16) - 1);
362 #ifdef CONFIG_SLUB_DEBUG
366 #ifdef CONFIG_SLUB_DEBUG_ON
367 static int slub_debug = DEBUG_DEFAULT_FLAGS;
369 static int slub_debug;
372 static char *slub_debug_slabs;
377 static void print_section(char *text, u8 *addr, unsigned int length)
385 for (i = 0; i < length; i++) {
387 printk(KERN_ERR "%8s 0x%p: ", text, addr + i);
390 printk(KERN_CONT " %02x", addr[i]);
392 ascii[offset] = isgraph(addr[i]) ? addr[i] : '.';
394 printk(KERN_CONT " %s\n", ascii);
401 printk(KERN_CONT " ");
405 printk(KERN_CONT " %s\n", ascii);
409 static struct track *get_track(struct kmem_cache *s, void *object,
410 enum track_item alloc)
415 p = object + s->offset + sizeof(void *);
417 p = object + s->inuse;
422 static void set_track(struct kmem_cache *s, void *object,
423 enum track_item alloc, void *addr)
428 p = object + s->offset + sizeof(void *);
430 p = object + s->inuse;
435 p->cpu = smp_processor_id();
436 p->pid = current ? current->pid : -1;
439 memset(p, 0, sizeof(struct track));
442 static void init_tracking(struct kmem_cache *s, void *object)
444 if (!(s->flags & SLAB_STORE_USER))
447 set_track(s, object, TRACK_FREE, NULL);
448 set_track(s, object, TRACK_ALLOC, NULL);
451 static void print_track(const char *s, struct track *t)
456 printk(KERN_ERR "INFO: %s in ", s);
457 __print_symbol("%s", (unsigned long)t->addr);
458 printk(" age=%lu cpu=%u pid=%d\n", jiffies - t->when, t->cpu, t->pid);
461 static void print_tracking(struct kmem_cache *s, void *object)
463 if (!(s->flags & SLAB_STORE_USER))
466 print_track("Allocated", get_track(s, object, TRACK_ALLOC));
467 print_track("Freed", get_track(s, object, TRACK_FREE));
470 static void print_page_info(struct page *page)
472 printk(KERN_ERR "INFO: Slab 0x%p objects=%u used=%u fp=0x%p flags=0x%04lx\n",
473 page, page->objects, page->inuse, page->freelist, page->flags);
477 static void slab_bug(struct kmem_cache *s, char *fmt, ...)
483 vsnprintf(buf, sizeof(buf), fmt, args);
485 printk(KERN_ERR "========================================"
486 "=====================================\n");
487 printk(KERN_ERR "BUG %s: %s\n", s->name, buf);
488 printk(KERN_ERR "----------------------------------------"
489 "-------------------------------------\n\n");
492 static void slab_fix(struct kmem_cache *s, char *fmt, ...)
498 vsnprintf(buf, sizeof(buf), fmt, args);
500 printk(KERN_ERR "FIX %s: %s\n", s->name, buf);
503 static void print_trailer(struct kmem_cache *s, struct page *page, u8 *p)
505 unsigned int off; /* Offset of last byte */
506 u8 *addr = page_address(page);
508 print_tracking(s, p);
510 print_page_info(page);
512 printk(KERN_ERR "INFO: Object 0x%p @offset=%tu fp=0x%p\n\n",
513 p, p - addr, get_freepointer(s, p));
516 print_section("Bytes b4", p - 16, 16);
518 print_section("Object", p, min(s->objsize, 128));
520 if (s->flags & SLAB_RED_ZONE)
521 print_section("Redzone", p + s->objsize,
522 s->inuse - s->objsize);
525 off = s->offset + sizeof(void *);
529 if (s->flags & SLAB_STORE_USER)
530 off += 2 * sizeof(struct track);
533 /* Beginning of the filler is the free pointer */
534 print_section("Padding", p + off, s->size - off);
539 static void object_err(struct kmem_cache *s, struct page *page,
540 u8 *object, char *reason)
542 slab_bug(s, "%s", reason);
543 print_trailer(s, page, object);
546 static void slab_err(struct kmem_cache *s, struct page *page, char *fmt, ...)
552 vsnprintf(buf, sizeof(buf), fmt, args);
554 slab_bug(s, "%s", buf);
555 print_page_info(page);
559 static void init_object(struct kmem_cache *s, void *object, int active)
563 if (s->flags & __OBJECT_POISON) {
564 memset(p, POISON_FREE, s->objsize - 1);
565 p[s->objsize - 1] = POISON_END;
568 if (s->flags & SLAB_RED_ZONE)
569 memset(p + s->objsize,
570 active ? SLUB_RED_ACTIVE : SLUB_RED_INACTIVE,
571 s->inuse - s->objsize);
574 static u8 *check_bytes(u8 *start, unsigned int value, unsigned int bytes)
577 if (*start != (u8)value)
585 static void restore_bytes(struct kmem_cache *s, char *message, u8 data,
586 void *from, void *to)
588 slab_fix(s, "Restoring 0x%p-0x%p=0x%x\n", from, to - 1, data);
589 memset(from, data, to - from);
592 static int check_bytes_and_report(struct kmem_cache *s, struct page *page,
593 u8 *object, char *what,
594 u8 *start, unsigned int value, unsigned int bytes)
599 fault = check_bytes(start, value, bytes);
604 while (end > fault && end[-1] == value)
607 slab_bug(s, "%s overwritten", what);
608 printk(KERN_ERR "INFO: 0x%p-0x%p. First byte 0x%x instead of 0x%x\n",
609 fault, end - 1, fault[0], value);
610 print_trailer(s, page, object);
612 restore_bytes(s, what, value, fault, end);
620 * Bytes of the object to be managed.
621 * If the freepointer may overlay the object then the free
622 * pointer is the first word of the object.
624 * Poisoning uses 0x6b (POISON_FREE) and the last byte is
627 * object + s->objsize
628 * Padding to reach word boundary. This is also used for Redzoning.
629 * Padding is extended by another word if Redzoning is enabled and
632 * We fill with 0xbb (RED_INACTIVE) for inactive objects and with
633 * 0xcc (RED_ACTIVE) for objects in use.
636 * Meta data starts here.
638 * A. Free pointer (if we cannot overwrite object on free)
639 * B. Tracking data for SLAB_STORE_USER
640 * C. Padding to reach required alignment boundary or at mininum
641 * one word if debugging is on to be able to detect writes
642 * before the word boundary.
644 * Padding is done using 0x5a (POISON_INUSE)
647 * Nothing is used beyond s->size.
649 * If slabcaches are merged then the objsize and inuse boundaries are mostly
650 * ignored. And therefore no slab options that rely on these boundaries
651 * may be used with merged slabcaches.
654 static int check_pad_bytes(struct kmem_cache *s, struct page *page, u8 *p)
656 unsigned long off = s->inuse; /* The end of info */
659 /* Freepointer is placed after the object. */
660 off += sizeof(void *);
662 if (s->flags & SLAB_STORE_USER)
663 /* We also have user information there */
664 off += 2 * sizeof(struct track);
669 return check_bytes_and_report(s, page, p, "Object padding",
670 p + off, POISON_INUSE, s->size - off);
673 /* Check the pad bytes at the end of a slab page */
674 static int slab_pad_check(struct kmem_cache *s, struct page *page)
682 if (!(s->flags & SLAB_POISON))
685 start = page_address(page);
686 length = (PAGE_SIZE << compound_order(page));
687 end = start + length;
688 remainder = length % s->size;
692 fault = check_bytes(end - remainder, POISON_INUSE, remainder);
695 while (end > fault && end[-1] == POISON_INUSE)
698 slab_err(s, page, "Padding overwritten. 0x%p-0x%p", fault, end - 1);
699 print_section("Padding", end - remainder, remainder);
701 restore_bytes(s, "slab padding", POISON_INUSE, start, end);
705 static int check_object(struct kmem_cache *s, struct page *page,
706 void *object, int active)
709 u8 *endobject = object + s->objsize;
711 if (s->flags & SLAB_RED_ZONE) {
713 active ? SLUB_RED_ACTIVE : SLUB_RED_INACTIVE;
715 if (!check_bytes_and_report(s, page, object, "Redzone",
716 endobject, red, s->inuse - s->objsize))
719 if ((s->flags & SLAB_POISON) && s->objsize < s->inuse) {
720 check_bytes_and_report(s, page, p, "Alignment padding",
721 endobject, POISON_INUSE, s->inuse - s->objsize);
725 if (s->flags & SLAB_POISON) {
726 if (!active && (s->flags & __OBJECT_POISON) &&
727 (!check_bytes_and_report(s, page, p, "Poison", p,
728 POISON_FREE, s->objsize - 1) ||
729 !check_bytes_and_report(s, page, p, "Poison",
730 p + s->objsize - 1, POISON_END, 1)))
733 * check_pad_bytes cleans up on its own.
735 check_pad_bytes(s, page, p);
738 if (!s->offset && active)
740 * Object and freepointer overlap. Cannot check
741 * freepointer while object is allocated.
745 /* Check free pointer validity */
746 if (!check_valid_pointer(s, page, get_freepointer(s, p))) {
747 object_err(s, page, p, "Freepointer corrupt");
749 * No choice but to zap it and thus loose the remainder
750 * of the free objects in this slab. May cause
751 * another error because the object count is now wrong.
753 set_freepointer(s, p, NULL);
759 static int check_slab(struct kmem_cache *s, struct page *page)
763 VM_BUG_ON(!irqs_disabled());
765 if (!PageSlab(page)) {
766 slab_err(s, page, "Not a valid slab page");
770 maxobj = (PAGE_SIZE << compound_order(page)) / s->size;
771 if (page->objects > maxobj) {
772 slab_err(s, page, "objects %u > max %u",
773 s->name, page->objects, maxobj);
776 if (page->inuse > page->objects) {
777 slab_err(s, page, "inuse %u > max %u",
778 s->name, page->inuse, page->objects);
781 /* Slab_pad_check fixes things up after itself */
782 slab_pad_check(s, page);
787 * Determine if a certain object on a page is on the freelist. Must hold the
788 * slab lock to guarantee that the chains are in a consistent state.
790 static int on_freelist(struct kmem_cache *s, struct page *page, void *search)
793 void *fp = page->freelist;
795 unsigned long max_objects;
797 while (fp && nr <= page->objects) {
800 if (!check_valid_pointer(s, page, fp)) {
802 object_err(s, page, object,
803 "Freechain corrupt");
804 set_freepointer(s, object, NULL);
807 slab_err(s, page, "Freepointer corrupt");
808 page->freelist = NULL;
809 page->inuse = page->objects;
810 slab_fix(s, "Freelist cleared");
816 fp = get_freepointer(s, object);
820 max_objects = (PAGE_SIZE << compound_order(page)) / s->size;
821 if (max_objects > 65535)
824 if (page->objects != max_objects) {
825 slab_err(s, page, "Wrong number of objects. Found %d but "
826 "should be %d", page->objects, max_objects);
827 page->objects = max_objects;
828 slab_fix(s, "Number of objects adjusted.");
830 if (page->inuse != page->objects - nr) {
831 slab_err(s, page, "Wrong object count. Counter is %d but "
832 "counted were %d", page->inuse, page->objects - nr);
833 page->inuse = page->objects - nr;
834 slab_fix(s, "Object count adjusted.");
836 return search == NULL;
839 static void trace(struct kmem_cache *s, struct page *page, void *object, int alloc)
841 if (s->flags & SLAB_TRACE) {
842 printk(KERN_INFO "TRACE %s %s 0x%p inuse=%d fp=0x%p\n",
844 alloc ? "alloc" : "free",
849 print_section("Object", (void *)object, s->objsize);
856 * Tracking of fully allocated slabs for debugging purposes.
858 static void add_full(struct kmem_cache_node *n, struct page *page)
860 spin_lock(&n->list_lock);
861 list_add(&page->lru, &n->full);
862 spin_unlock(&n->list_lock);
865 static void remove_full(struct kmem_cache *s, struct page *page)
867 struct kmem_cache_node *n;
869 if (!(s->flags & SLAB_STORE_USER))
872 n = get_node(s, page_to_nid(page));
874 spin_lock(&n->list_lock);
875 list_del(&page->lru);
876 spin_unlock(&n->list_lock);
879 /* Tracking of the number of slabs for debugging purposes */
880 static inline unsigned long slabs_node(struct kmem_cache *s, int node)
882 struct kmem_cache_node *n = get_node(s, node);
884 return atomic_long_read(&n->nr_slabs);
887 static inline void inc_slabs_node(struct kmem_cache *s, int node, int objects)
889 struct kmem_cache_node *n = get_node(s, node);
892 * May be called early in order to allocate a slab for the
893 * kmem_cache_node structure. Solve the chicken-egg
894 * dilemma by deferring the increment of the count during
895 * bootstrap (see early_kmem_cache_node_alloc).
897 if (!NUMA_BUILD || n) {
898 atomic_long_inc(&n->nr_slabs);
899 atomic_long_add(objects, &n->total_objects);
902 static inline void dec_slabs_node(struct kmem_cache *s, int node, int objects)
904 struct kmem_cache_node *n = get_node(s, node);
906 atomic_long_dec(&n->nr_slabs);
907 atomic_long_sub(objects, &n->total_objects);
910 /* Object debug checks for alloc/free paths */
911 static void setup_object_debug(struct kmem_cache *s, struct page *page,
914 if (!(s->flags & (SLAB_STORE_USER|SLAB_RED_ZONE|__OBJECT_POISON)))
917 init_object(s, object, 0);
918 init_tracking(s, object);
921 static int alloc_debug_processing(struct kmem_cache *s, struct page *page,
922 void *object, void *addr)
924 if (!check_slab(s, page))
927 if (!on_freelist(s, page, object)) {
928 object_err(s, page, object, "Object already allocated");
932 if (!check_valid_pointer(s, page, object)) {
933 object_err(s, page, object, "Freelist Pointer check fails");
937 if (!check_object(s, page, object, 0))
940 /* Success perform special debug activities for allocs */
941 if (s->flags & SLAB_STORE_USER)
942 set_track(s, object, TRACK_ALLOC, addr);
943 trace(s, page, object, 1);
944 init_object(s, object, 1);
948 if (PageSlab(page)) {
950 * If this is a slab page then lets do the best we can
951 * to avoid issues in the future. Marking all objects
952 * as used avoids touching the remaining objects.
954 slab_fix(s, "Marking all objects used");
955 page->inuse = page->objects;
956 page->freelist = NULL;
961 static int free_debug_processing(struct kmem_cache *s, struct page *page,
962 void *object, void *addr)
964 if (!check_slab(s, page))
967 if (!check_valid_pointer(s, page, object)) {
968 slab_err(s, page, "Invalid object pointer 0x%p", object);
972 if (on_freelist(s, page, object)) {
973 object_err(s, page, object, "Object already free");
977 if (!check_object(s, page, object, 1))
980 if (unlikely(s != page->slab)) {
981 if (!PageSlab(page)) {
982 slab_err(s, page, "Attempt to free object(0x%p) "
983 "outside of slab", object);
984 } else if (!page->slab) {
986 "SLUB <none>: no slab for object 0x%p.\n",
990 object_err(s, page, object,
991 "page slab pointer corrupt.");
995 /* Special debug activities for freeing objects */
996 if (!SlabFrozen(page) && !page->freelist)
997 remove_full(s, page);
998 if (s->flags & SLAB_STORE_USER)
999 set_track(s, object, TRACK_FREE, addr);
1000 trace(s, page, object, 0);
1001 init_object(s, object, 0);
1005 slab_fix(s, "Object at 0x%p not freed", object);
1009 static int __init setup_slub_debug(char *str)
1011 slub_debug = DEBUG_DEFAULT_FLAGS;
1012 if (*str++ != '=' || !*str)
1014 * No options specified. Switch on full debugging.
1020 * No options but restriction on slabs. This means full
1021 * debugging for slabs matching a pattern.
1028 * Switch off all debugging measures.
1033 * Determine which debug features should be switched on
1035 for (; *str && *str != ','; str++) {
1036 switch (tolower(*str)) {
1038 slub_debug |= SLAB_DEBUG_FREE;
1041 slub_debug |= SLAB_RED_ZONE;
1044 slub_debug |= SLAB_POISON;
1047 slub_debug |= SLAB_STORE_USER;
1050 slub_debug |= SLAB_TRACE;
1053 printk(KERN_ERR "slub_debug option '%c' "
1054 "unknown. skipped\n", *str);
1060 slub_debug_slabs = str + 1;
1065 __setup("slub_debug", setup_slub_debug);
1067 static unsigned long kmem_cache_flags(unsigned long objsize,
1068 unsigned long flags, const char *name,
1069 void (*ctor)(struct kmem_cache *, void *))
1072 * Enable debugging if selected on the kernel commandline.
1074 if (slub_debug && (!slub_debug_slabs ||
1075 strncmp(slub_debug_slabs, name, strlen(slub_debug_slabs)) == 0))
1076 flags |= slub_debug;
1081 static inline void setup_object_debug(struct kmem_cache *s,
1082 struct page *page, void *object) {}
1084 static inline int alloc_debug_processing(struct kmem_cache *s,
1085 struct page *page, void *object, void *addr) { return 0; }
1087 static inline int free_debug_processing(struct kmem_cache *s,
1088 struct page *page, void *object, void *addr) { return 0; }
1090 static inline int slab_pad_check(struct kmem_cache *s, struct page *page)
1092 static inline int check_object(struct kmem_cache *s, struct page *page,
1093 void *object, int active) { return 1; }
1094 static inline void add_full(struct kmem_cache_node *n, struct page *page) {}
1095 static inline unsigned long kmem_cache_flags(unsigned long objsize,
1096 unsigned long flags, const char *name,
1097 void (*ctor)(struct kmem_cache *, void *))
1101 #define slub_debug 0
1103 static inline unsigned long slabs_node(struct kmem_cache *s, int node)
1105 static inline void inc_slabs_node(struct kmem_cache *s, int node,
1107 static inline void dec_slabs_node(struct kmem_cache *s, int node,
1112 * Slab allocation and freeing
1114 static inline struct page *alloc_slab_page(gfp_t flags, int node,
1115 struct kmem_cache_order_objects oo)
1117 int order = oo_order(oo);
1120 return alloc_pages(flags, order);
1122 return alloc_pages_node(node, flags, order);
1125 static struct page *allocate_slab(struct kmem_cache *s, gfp_t flags, int node)
1128 struct kmem_cache_order_objects oo = s->oo;
1130 flags |= s->allocflags;
1132 page = alloc_slab_page(flags | __GFP_NOWARN | __GFP_NORETRY, node,
1134 if (unlikely(!page)) {
1137 * Allocation may have failed due to fragmentation.
1138 * Try a lower order alloc if possible
1140 page = alloc_slab_page(flags, node, oo);
1144 stat(get_cpu_slab(s, raw_smp_processor_id()), ORDER_FALLBACK);
1146 page->objects = oo_objects(oo);
1147 mod_zone_page_state(page_zone(page),
1148 (s->flags & SLAB_RECLAIM_ACCOUNT) ?
1149 NR_SLAB_RECLAIMABLE : NR_SLAB_UNRECLAIMABLE,
1155 static void setup_object(struct kmem_cache *s, struct page *page,
1158 setup_object_debug(s, page, object);
1159 if (unlikely(s->ctor))
1163 static struct page *new_slab(struct kmem_cache *s, gfp_t flags, int node)
1170 BUG_ON(flags & GFP_SLAB_BUG_MASK);
1172 page = allocate_slab(s,
1173 flags & (GFP_RECLAIM_MASK | GFP_CONSTRAINT_MASK), node);
1177 inc_slabs_node(s, page_to_nid(page), page->objects);
1179 page->flags |= 1 << PG_slab;
1180 if (s->flags & (SLAB_DEBUG_FREE | SLAB_RED_ZONE | SLAB_POISON |
1181 SLAB_STORE_USER | SLAB_TRACE))
1184 start = page_address(page);
1186 if (unlikely(s->flags & SLAB_POISON))
1187 memset(start, POISON_INUSE, PAGE_SIZE << compound_order(page));
1190 for_each_object(p, s, start, page->objects) {
1191 setup_object(s, page, last);
1192 set_freepointer(s, last, p);
1195 setup_object(s, page, last);
1196 set_freepointer(s, last, NULL);
1198 page->freelist = start;
1204 static void __free_slab(struct kmem_cache *s, struct page *page)
1206 int order = compound_order(page);
1207 int pages = 1 << order;
1209 if (unlikely(SlabDebug(page))) {
1212 slab_pad_check(s, page);
1213 for_each_object(p, s, page_address(page),
1215 check_object(s, page, p, 0);
1216 ClearSlabDebug(page);
1219 mod_zone_page_state(page_zone(page),
1220 (s->flags & SLAB_RECLAIM_ACCOUNT) ?
1221 NR_SLAB_RECLAIMABLE : NR_SLAB_UNRECLAIMABLE,
1224 __ClearPageSlab(page);
1225 reset_page_mapcount(page);
1226 __free_pages(page, order);
1229 static void rcu_free_slab(struct rcu_head *h)
1233 page = container_of((struct list_head *)h, struct page, lru);
1234 __free_slab(page->slab, page);
1237 static void free_slab(struct kmem_cache *s, struct page *page)
1239 if (unlikely(s->flags & SLAB_DESTROY_BY_RCU)) {
1241 * RCU free overloads the RCU head over the LRU
1243 struct rcu_head *head = (void *)&page->lru;
1245 call_rcu(head, rcu_free_slab);
1247 __free_slab(s, page);
1250 static void discard_slab(struct kmem_cache *s, struct page *page)
1252 dec_slabs_node(s, page_to_nid(page), page->objects);
1257 * Per slab locking using the pagelock
1259 static __always_inline void slab_lock(struct page *page)
1261 bit_spin_lock(PG_locked, &page->flags);
1264 static __always_inline void slab_unlock(struct page *page)
1266 __bit_spin_unlock(PG_locked, &page->flags);
1269 static __always_inline int slab_trylock(struct page *page)
1273 rc = bit_spin_trylock(PG_locked, &page->flags);
1278 * Management of partially allocated slabs
1280 static void add_partial(struct kmem_cache_node *n,
1281 struct page *page, int tail)
1283 spin_lock(&n->list_lock);
1286 list_add_tail(&page->lru, &n->partial);
1288 list_add(&page->lru, &n->partial);
1289 spin_unlock(&n->list_lock);
1292 static void remove_partial(struct kmem_cache *s,
1295 struct kmem_cache_node *n = get_node(s, page_to_nid(page));
1297 spin_lock(&n->list_lock);
1298 list_del(&page->lru);
1300 spin_unlock(&n->list_lock);
1304 * Lock slab and remove from the partial list.
1306 * Must hold list_lock.
1308 static inline int lock_and_freeze_slab(struct kmem_cache_node *n, struct page *page)
1310 if (slab_trylock(page)) {
1311 list_del(&page->lru);
1313 SetSlabFrozen(page);
1320 * Try to allocate a partial slab from a specific node.
1322 static struct page *get_partial_node(struct kmem_cache_node *n)
1327 * Racy check. If we mistakenly see no partial slabs then we
1328 * just allocate an empty slab. If we mistakenly try to get a
1329 * partial slab and there is none available then get_partials()
1332 if (!n || !n->nr_partial)
1335 spin_lock(&n->list_lock);
1336 list_for_each_entry(page, &n->partial, lru)
1337 if (lock_and_freeze_slab(n, page))
1341 spin_unlock(&n->list_lock);
1346 * Get a page from somewhere. Search in increasing NUMA distances.
1348 static struct page *get_any_partial(struct kmem_cache *s, gfp_t flags)
1351 struct zonelist *zonelist;
1356 * The defrag ratio allows a configuration of the tradeoffs between
1357 * inter node defragmentation and node local allocations. A lower
1358 * defrag_ratio increases the tendency to do local allocations
1359 * instead of attempting to obtain partial slabs from other nodes.
1361 * If the defrag_ratio is set to 0 then kmalloc() always
1362 * returns node local objects. If the ratio is higher then kmalloc()
1363 * may return off node objects because partial slabs are obtained
1364 * from other nodes and filled up.
1366 * If /sys/kernel/slab/xx/defrag_ratio is set to 100 (which makes
1367 * defrag_ratio = 1000) then every (well almost) allocation will
1368 * first attempt to defrag slab caches on other nodes. This means
1369 * scanning over all nodes to look for partial slabs which may be
1370 * expensive if we do it every time we are trying to find a slab
1371 * with available objects.
1373 if (!s->remote_node_defrag_ratio ||
1374 get_cycles() % 1024 > s->remote_node_defrag_ratio)
1377 zonelist = &NODE_DATA(
1378 slab_node(current->mempolicy))->node_zonelists[gfp_zone(flags)];
1379 for (z = zonelist->zones; *z; z++) {
1380 struct kmem_cache_node *n;
1382 n = get_node(s, zone_to_nid(*z));
1384 if (n && cpuset_zone_allowed_hardwall(*z, flags) &&
1385 n->nr_partial > MIN_PARTIAL) {
1386 page = get_partial_node(n);
1396 * Get a partial page, lock it and return it.
1398 static struct page *get_partial(struct kmem_cache *s, gfp_t flags, int node)
1401 int searchnode = (node == -1) ? numa_node_id() : node;
1403 page = get_partial_node(get_node(s, searchnode));
1404 if (page || (flags & __GFP_THISNODE))
1407 return get_any_partial(s, flags);
1411 * Move a page back to the lists.
1413 * Must be called with the slab lock held.
1415 * On exit the slab lock will have been dropped.
1417 static void unfreeze_slab(struct kmem_cache *s, struct page *page, int tail)
1419 struct kmem_cache_node *n = get_node(s, page_to_nid(page));
1420 struct kmem_cache_cpu *c = get_cpu_slab(s, smp_processor_id());
1422 ClearSlabFrozen(page);
1425 if (page->freelist) {
1426 add_partial(n, page, tail);
1427 stat(c, tail ? DEACTIVATE_TO_TAIL : DEACTIVATE_TO_HEAD);
1429 stat(c, DEACTIVATE_FULL);
1430 if (SlabDebug(page) && (s->flags & SLAB_STORE_USER))
1435 stat(c, DEACTIVATE_EMPTY);
1436 if (n->nr_partial < MIN_PARTIAL) {
1438 * Adding an empty slab to the partial slabs in order
1439 * to avoid page allocator overhead. This slab needs
1440 * to come after the other slabs with objects in
1441 * so that the others get filled first. That way the
1442 * size of the partial list stays small.
1444 * kmem_cache_shrink can reclaim any empty slabs from the
1447 add_partial(n, page, 1);
1451 stat(get_cpu_slab(s, raw_smp_processor_id()), FREE_SLAB);
1452 discard_slab(s, page);
1458 * Remove the cpu slab
1460 static void deactivate_slab(struct kmem_cache *s, struct kmem_cache_cpu *c)
1462 struct page *page = c->page;
1466 stat(c, DEACTIVATE_REMOTE_FREES);
1468 * Merge cpu freelist into slab freelist. Typically we get here
1469 * because both freelists are empty. So this is unlikely
1472 while (unlikely(c->freelist)) {
1475 tail = 0; /* Hot objects. Put the slab first */
1477 /* Retrieve object from cpu_freelist */
1478 object = c->freelist;
1479 c->freelist = c->freelist[c->offset];
1481 /* And put onto the regular freelist */
1482 object[c->offset] = page->freelist;
1483 page->freelist = object;
1487 unfreeze_slab(s, page, tail);
1490 static inline void flush_slab(struct kmem_cache *s, struct kmem_cache_cpu *c)
1492 stat(c, CPUSLAB_FLUSH);
1494 deactivate_slab(s, c);
1500 * Called from IPI handler with interrupts disabled.
1502 static inline void __flush_cpu_slab(struct kmem_cache *s, int cpu)
1504 struct kmem_cache_cpu *c = get_cpu_slab(s, cpu);
1506 if (likely(c && c->page))
1510 static void flush_cpu_slab(void *d)
1512 struct kmem_cache *s = d;
1514 __flush_cpu_slab(s, smp_processor_id());
1517 static void flush_all(struct kmem_cache *s)
1520 on_each_cpu(flush_cpu_slab, s, 1, 1);
1522 unsigned long flags;
1524 local_irq_save(flags);
1526 local_irq_restore(flags);
1531 * Check if the objects in a per cpu structure fit numa
1532 * locality expectations.
1534 static inline int node_match(struct kmem_cache_cpu *c, int node)
1537 if (node != -1 && c->node != node)
1544 * Slow path. The lockless freelist is empty or we need to perform
1547 * Interrupts are disabled.
1549 * Processing is still very fast if new objects have been freed to the
1550 * regular freelist. In that case we simply take over the regular freelist
1551 * as the lockless freelist and zap the regular freelist.
1553 * If that is not working then we fall back to the partial lists. We take the
1554 * first element of the freelist as the object to allocate now and move the
1555 * rest of the freelist to the lockless freelist.
1557 * And if we were unable to get a new slab from the partial slab lists then
1558 * we need to allocate a new slab. This is the slowest path since it involves
1559 * a call to the page allocator and the setup of a new slab.
1561 static void *__slab_alloc(struct kmem_cache *s,
1562 gfp_t gfpflags, int node, void *addr, struct kmem_cache_cpu *c)
1567 /* We handle __GFP_ZERO in the caller */
1568 gfpflags &= ~__GFP_ZERO;
1574 if (unlikely(!node_match(c, node)))
1577 stat(c, ALLOC_REFILL);
1580 object = c->page->freelist;
1581 if (unlikely(!object))
1583 if (unlikely(SlabDebug(c->page)))
1586 c->freelist = object[c->offset];
1587 c->page->inuse = c->page->objects;
1588 c->page->freelist = NULL;
1589 c->node = page_to_nid(c->page);
1591 slab_unlock(c->page);
1592 stat(c, ALLOC_SLOWPATH);
1596 deactivate_slab(s, c);
1599 new = get_partial(s, gfpflags, node);
1602 stat(c, ALLOC_FROM_PARTIAL);
1606 if (gfpflags & __GFP_WAIT)
1609 new = new_slab(s, gfpflags, node);
1611 if (gfpflags & __GFP_WAIT)
1612 local_irq_disable();
1615 c = get_cpu_slab(s, smp_processor_id());
1616 stat(c, ALLOC_SLAB);
1626 if (!alloc_debug_processing(s, c->page, object, addr))
1630 c->page->freelist = object[c->offset];
1636 * Inlined fastpath so that allocation functions (kmalloc, kmem_cache_alloc)
1637 * have the fastpath folded into their functions. So no function call
1638 * overhead for requests that can be satisfied on the fastpath.
1640 * The fastpath works by first checking if the lockless freelist can be used.
1641 * If not then __slab_alloc is called for slow processing.
1643 * Otherwise we can simply pick the next object from the lockless free list.
1645 static __always_inline void *slab_alloc(struct kmem_cache *s,
1646 gfp_t gfpflags, int node, void *addr)
1649 struct kmem_cache_cpu *c;
1650 unsigned long flags;
1652 local_irq_save(flags);
1653 c = get_cpu_slab(s, smp_processor_id());
1654 if (unlikely(!c->freelist || !node_match(c, node)))
1656 object = __slab_alloc(s, gfpflags, node, addr, c);
1659 object = c->freelist;
1660 c->freelist = object[c->offset];
1661 stat(c, ALLOC_FASTPATH);
1663 local_irq_restore(flags);
1665 if (unlikely((gfpflags & __GFP_ZERO) && object))
1666 memset(object, 0, c->objsize);
1671 void *kmem_cache_alloc(struct kmem_cache *s, gfp_t gfpflags)
1673 return slab_alloc(s, gfpflags, -1, __builtin_return_address(0));
1675 EXPORT_SYMBOL(kmem_cache_alloc);
1678 void *kmem_cache_alloc_node(struct kmem_cache *s, gfp_t gfpflags, int node)
1680 return slab_alloc(s, gfpflags, node, __builtin_return_address(0));
1682 EXPORT_SYMBOL(kmem_cache_alloc_node);
1686 * Slow patch handling. This may still be called frequently since objects
1687 * have a longer lifetime than the cpu slabs in most processing loads.
1689 * So we still attempt to reduce cache line usage. Just take the slab
1690 * lock and free the item. If there is no additional partial page
1691 * handling required then we can return immediately.
1693 static void __slab_free(struct kmem_cache *s, struct page *page,
1694 void *x, void *addr, unsigned int offset)
1697 void **object = (void *)x;
1698 struct kmem_cache_cpu *c;
1700 c = get_cpu_slab(s, raw_smp_processor_id());
1701 stat(c, FREE_SLOWPATH);
1704 if (unlikely(SlabDebug(page)))
1708 prior = object[offset] = page->freelist;
1709 page->freelist = object;
1712 if (unlikely(SlabFrozen(page))) {
1713 stat(c, FREE_FROZEN);
1717 if (unlikely(!page->inuse))
1721 * Objects left in the slab. If it was not on the partial list before
1724 if (unlikely(!prior)) {
1725 add_partial(get_node(s, page_to_nid(page)), page, 1);
1726 stat(c, FREE_ADD_PARTIAL);
1736 * Slab still on the partial list.
1738 remove_partial(s, page);
1739 stat(c, FREE_REMOVE_PARTIAL);
1743 discard_slab(s, page);
1747 if (!free_debug_processing(s, page, x, addr))
1753 * Fastpath with forced inlining to produce a kfree and kmem_cache_free that
1754 * can perform fastpath freeing without additional function calls.
1756 * The fastpath is only possible if we are freeing to the current cpu slab
1757 * of this processor. This typically the case if we have just allocated
1760 * If fastpath is not possible then fall back to __slab_free where we deal
1761 * with all sorts of special processing.
1763 static __always_inline void slab_free(struct kmem_cache *s,
1764 struct page *page, void *x, void *addr)
1766 void **object = (void *)x;
1767 struct kmem_cache_cpu *c;
1768 unsigned long flags;
1770 local_irq_save(flags);
1771 c = get_cpu_slab(s, smp_processor_id());
1772 debug_check_no_locks_freed(object, c->objsize);
1773 if (likely(page == c->page && c->node >= 0)) {
1774 object[c->offset] = c->freelist;
1775 c->freelist = object;
1776 stat(c, FREE_FASTPATH);
1778 __slab_free(s, page, x, addr, c->offset);
1780 local_irq_restore(flags);
1783 void kmem_cache_free(struct kmem_cache *s, void *x)
1787 page = virt_to_head_page(x);
1789 slab_free(s, page, x, __builtin_return_address(0));
1791 EXPORT_SYMBOL(kmem_cache_free);
1793 /* Figure out on which slab object the object resides */
1794 static struct page *get_object_page(const void *x)
1796 struct page *page = virt_to_head_page(x);
1798 if (!PageSlab(page))
1805 * Object placement in a slab is made very easy because we always start at
1806 * offset 0. If we tune the size of the object to the alignment then we can
1807 * get the required alignment by putting one properly sized object after
1810 * Notice that the allocation order determines the sizes of the per cpu
1811 * caches. Each processor has always one slab available for allocations.
1812 * Increasing the allocation order reduces the number of times that slabs
1813 * must be moved on and off the partial lists and is therefore a factor in
1818 * Mininum / Maximum order of slab pages. This influences locking overhead
1819 * and slab fragmentation. A higher order reduces the number of partial slabs
1820 * and increases the number of allocations possible without having to
1821 * take the list_lock.
1823 static int slub_min_order;
1824 static int slub_max_order = DEFAULT_MAX_ORDER;
1825 static int slub_min_objects = DEFAULT_MIN_OBJECTS;
1828 * Merge control. If this is set then no merging of slab caches will occur.
1829 * (Could be removed. This was introduced to pacify the merge skeptics.)
1831 static int slub_nomerge;
1834 * Calculate the order of allocation given an slab object size.
1836 * The order of allocation has significant impact on performance and other
1837 * system components. Generally order 0 allocations should be preferred since
1838 * order 0 does not cause fragmentation in the page allocator. Larger objects
1839 * be problematic to put into order 0 slabs because there may be too much
1840 * unused space left. We go to a higher order if more than 1/8th of the slab
1843 * In order to reach satisfactory performance we must ensure that a minimum
1844 * number of objects is in one slab. Otherwise we may generate too much
1845 * activity on the partial lists which requires taking the list_lock. This is
1846 * less a concern for large slabs though which are rarely used.
1848 * slub_max_order specifies the order where we begin to stop considering the
1849 * number of objects in a slab as critical. If we reach slub_max_order then
1850 * we try to keep the page order as low as possible. So we accept more waste
1851 * of space in favor of a small page order.
1853 * Higher order allocations also allow the placement of more objects in a
1854 * slab and thereby reduce object handling overhead. If the user has
1855 * requested a higher mininum order then we start with that one instead of
1856 * the smallest order which will fit the object.
1858 static inline int slab_order(int size, int min_objects,
1859 int max_order, int fract_leftover)
1863 int min_order = slub_min_order;
1865 if ((PAGE_SIZE << min_order) / size > 65535)
1866 return get_order(size * 65535) - 1;
1868 for (order = max(min_order,
1869 fls(min_objects * size - 1) - PAGE_SHIFT);
1870 order <= max_order; order++) {
1872 unsigned long slab_size = PAGE_SIZE << order;
1874 if (slab_size < min_objects * size)
1877 rem = slab_size % size;
1879 if (rem <= slab_size / fract_leftover)
1887 static inline int calculate_order(int size)
1894 * Attempt to find best configuration for a slab. This
1895 * works by first attempting to generate a layout with
1896 * the best configuration and backing off gradually.
1898 * First we reduce the acceptable waste in a slab. Then
1899 * we reduce the minimum objects required in a slab.
1901 min_objects = slub_min_objects;
1902 while (min_objects > 1) {
1904 while (fraction >= 4) {
1905 order = slab_order(size, min_objects,
1906 slub_max_order, fraction);
1907 if (order <= slub_max_order)
1915 * We were unable to place multiple objects in a slab. Now
1916 * lets see if we can place a single object there.
1918 order = slab_order(size, 1, slub_max_order, 1);
1919 if (order <= slub_max_order)
1923 * Doh this slab cannot be placed using slub_max_order.
1925 order = slab_order(size, 1, MAX_ORDER, 1);
1926 if (order <= MAX_ORDER)
1932 * Figure out what the alignment of the objects will be.
1934 static unsigned long calculate_alignment(unsigned long flags,
1935 unsigned long align, unsigned long size)
1938 * If the user wants hardware cache aligned objects then follow that
1939 * suggestion if the object is sufficiently large.
1941 * The hardware cache alignment cannot override the specified
1942 * alignment though. If that is greater then use it.
1944 if (flags & SLAB_HWCACHE_ALIGN) {
1945 unsigned long ralign = cache_line_size();
1946 while (size <= ralign / 2)
1948 align = max(align, ralign);
1951 if (align < ARCH_SLAB_MINALIGN)
1952 align = ARCH_SLAB_MINALIGN;
1954 return ALIGN(align, sizeof(void *));
1957 static void init_kmem_cache_cpu(struct kmem_cache *s,
1958 struct kmem_cache_cpu *c)
1963 c->offset = s->offset / sizeof(void *);
1964 c->objsize = s->objsize;
1965 #ifdef CONFIG_SLUB_STATS
1966 memset(c->stat, 0, NR_SLUB_STAT_ITEMS * sizeof(unsigned));
1970 static void init_kmem_cache_node(struct kmem_cache_node *n)
1973 spin_lock_init(&n->list_lock);
1974 INIT_LIST_HEAD(&n->partial);
1975 #ifdef CONFIG_SLUB_DEBUG
1976 atomic_long_set(&n->nr_slabs, 0);
1977 INIT_LIST_HEAD(&n->full);
1983 * Per cpu array for per cpu structures.
1985 * The per cpu array places all kmem_cache_cpu structures from one processor
1986 * close together meaning that it becomes possible that multiple per cpu
1987 * structures are contained in one cacheline. This may be particularly
1988 * beneficial for the kmalloc caches.
1990 * A desktop system typically has around 60-80 slabs. With 100 here we are
1991 * likely able to get per cpu structures for all caches from the array defined
1992 * here. We must be able to cover all kmalloc caches during bootstrap.
1994 * If the per cpu array is exhausted then fall back to kmalloc
1995 * of individual cachelines. No sharing is possible then.
1997 #define NR_KMEM_CACHE_CPU 100
1999 static DEFINE_PER_CPU(struct kmem_cache_cpu,
2000 kmem_cache_cpu)[NR_KMEM_CACHE_CPU];
2002 static DEFINE_PER_CPU(struct kmem_cache_cpu *, kmem_cache_cpu_free);
2003 static cpumask_t kmem_cach_cpu_free_init_once = CPU_MASK_NONE;
2005 static struct kmem_cache_cpu *alloc_kmem_cache_cpu(struct kmem_cache *s,
2006 int cpu, gfp_t flags)
2008 struct kmem_cache_cpu *c = per_cpu(kmem_cache_cpu_free, cpu);
2011 per_cpu(kmem_cache_cpu_free, cpu) =
2012 (void *)c->freelist;
2014 /* Table overflow: So allocate ourselves */
2016 ALIGN(sizeof(struct kmem_cache_cpu), cache_line_size()),
2017 flags, cpu_to_node(cpu));
2022 init_kmem_cache_cpu(s, c);
2026 static void free_kmem_cache_cpu(struct kmem_cache_cpu *c, int cpu)
2028 if (c < per_cpu(kmem_cache_cpu, cpu) ||
2029 c > per_cpu(kmem_cache_cpu, cpu) + NR_KMEM_CACHE_CPU) {
2033 c->freelist = (void *)per_cpu(kmem_cache_cpu_free, cpu);
2034 per_cpu(kmem_cache_cpu_free, cpu) = c;
2037 static void free_kmem_cache_cpus(struct kmem_cache *s)
2041 for_each_online_cpu(cpu) {
2042 struct kmem_cache_cpu *c = get_cpu_slab(s, cpu);
2045 s->cpu_slab[cpu] = NULL;
2046 free_kmem_cache_cpu(c, cpu);
2051 static int alloc_kmem_cache_cpus(struct kmem_cache *s, gfp_t flags)
2055 for_each_online_cpu(cpu) {
2056 struct kmem_cache_cpu *c = get_cpu_slab(s, cpu);
2061 c = alloc_kmem_cache_cpu(s, cpu, flags);
2063 free_kmem_cache_cpus(s);
2066 s->cpu_slab[cpu] = c;
2072 * Initialize the per cpu array.
2074 static void init_alloc_cpu_cpu(int cpu)
2078 if (cpu_isset(cpu, kmem_cach_cpu_free_init_once))
2081 for (i = NR_KMEM_CACHE_CPU - 1; i >= 0; i--)
2082 free_kmem_cache_cpu(&per_cpu(kmem_cache_cpu, cpu)[i], cpu);
2084 cpu_set(cpu, kmem_cach_cpu_free_init_once);
2087 static void __init init_alloc_cpu(void)
2091 for_each_online_cpu(cpu)
2092 init_alloc_cpu_cpu(cpu);
2096 static inline void free_kmem_cache_cpus(struct kmem_cache *s) {}
2097 static inline void init_alloc_cpu(void) {}
2099 static inline int alloc_kmem_cache_cpus(struct kmem_cache *s, gfp_t flags)
2101 init_kmem_cache_cpu(s, &s->cpu_slab);
2108 * No kmalloc_node yet so do it by hand. We know that this is the first
2109 * slab on the node for this slabcache. There are no concurrent accesses
2112 * Note that this function only works on the kmalloc_node_cache
2113 * when allocating for the kmalloc_node_cache. This is used for bootstrapping
2114 * memory on a fresh node that has no slab structures yet.
2116 static struct kmem_cache_node *early_kmem_cache_node_alloc(gfp_t gfpflags,
2120 struct kmem_cache_node *n;
2121 unsigned long flags;
2123 BUG_ON(kmalloc_caches->size < sizeof(struct kmem_cache_node));
2125 page = new_slab(kmalloc_caches, gfpflags, node);
2128 if (page_to_nid(page) != node) {
2129 printk(KERN_ERR "SLUB: Unable to allocate memory from "
2131 printk(KERN_ERR "SLUB: Allocating a useless per node structure "
2132 "in order to be able to continue\n");
2137 page->freelist = get_freepointer(kmalloc_caches, n);
2139 kmalloc_caches->node[node] = n;
2140 #ifdef CONFIG_SLUB_DEBUG
2141 init_object(kmalloc_caches, n, 1);
2142 init_tracking(kmalloc_caches, n);
2144 init_kmem_cache_node(n);
2145 inc_slabs_node(kmalloc_caches, node, page->objects);
2148 * lockdep requires consistent irq usage for each lock
2149 * so even though there cannot be a race this early in
2150 * the boot sequence, we still disable irqs.
2152 local_irq_save(flags);
2153 add_partial(n, page, 0);
2154 local_irq_restore(flags);
2158 static void free_kmem_cache_nodes(struct kmem_cache *s)
2162 for_each_node_state(node, N_NORMAL_MEMORY) {
2163 struct kmem_cache_node *n = s->node[node];
2164 if (n && n != &s->local_node)
2165 kmem_cache_free(kmalloc_caches, n);
2166 s->node[node] = NULL;
2170 static int init_kmem_cache_nodes(struct kmem_cache *s, gfp_t gfpflags)
2175 if (slab_state >= UP)
2176 local_node = page_to_nid(virt_to_page(s));
2180 for_each_node_state(node, N_NORMAL_MEMORY) {
2181 struct kmem_cache_node *n;
2183 if (local_node == node)
2186 if (slab_state == DOWN) {
2187 n = early_kmem_cache_node_alloc(gfpflags,
2191 n = kmem_cache_alloc_node(kmalloc_caches,
2195 free_kmem_cache_nodes(s);
2201 init_kmem_cache_node(n);
2206 static void free_kmem_cache_nodes(struct kmem_cache *s)
2210 static int init_kmem_cache_nodes(struct kmem_cache *s, gfp_t gfpflags)
2212 init_kmem_cache_node(&s->local_node);
2218 * calculate_sizes() determines the order and the distribution of data within
2221 static int calculate_sizes(struct kmem_cache *s, int forced_order)
2223 unsigned long flags = s->flags;
2224 unsigned long size = s->objsize;
2225 unsigned long align = s->align;
2229 * Round up object size to the next word boundary. We can only
2230 * place the free pointer at word boundaries and this determines
2231 * the possible location of the free pointer.
2233 size = ALIGN(size, sizeof(void *));
2235 #ifdef CONFIG_SLUB_DEBUG
2237 * Determine if we can poison the object itself. If the user of
2238 * the slab may touch the object after free or before allocation
2239 * then we should never poison the object itself.
2241 if ((flags & SLAB_POISON) && !(flags & SLAB_DESTROY_BY_RCU) &&
2243 s->flags |= __OBJECT_POISON;
2245 s->flags &= ~__OBJECT_POISON;
2249 * If we are Redzoning then check if there is some space between the
2250 * end of the object and the free pointer. If not then add an
2251 * additional word to have some bytes to store Redzone information.
2253 if ((flags & SLAB_RED_ZONE) && size == s->objsize)
2254 size += sizeof(void *);
2258 * With that we have determined the number of bytes in actual use
2259 * by the object. This is the potential offset to the free pointer.
2263 if (((flags & (SLAB_DESTROY_BY_RCU | SLAB_POISON)) ||
2266 * Relocate free pointer after the object if it is not
2267 * permitted to overwrite the first word of the object on
2270 * This is the case if we do RCU, have a constructor or
2271 * destructor or are poisoning the objects.
2274 size += sizeof(void *);
2277 #ifdef CONFIG_SLUB_DEBUG
2278 if (flags & SLAB_STORE_USER)
2280 * Need to store information about allocs and frees after
2283 size += 2 * sizeof(struct track);
2285 if (flags & SLAB_RED_ZONE)
2287 * Add some empty padding so that we can catch
2288 * overwrites from earlier objects rather than let
2289 * tracking information or the free pointer be
2290 * corrupted if an user writes before the start
2293 size += sizeof(void *);
2297 * Determine the alignment based on various parameters that the
2298 * user specified and the dynamic determination of cache line size
2301 align = calculate_alignment(flags, align, s->objsize);
2304 * SLUB stores one object immediately after another beginning from
2305 * offset 0. In order to align the objects we have to simply size
2306 * each object to conform to the alignment.
2308 size = ALIGN(size, align);
2310 if (forced_order >= 0)
2311 order = forced_order;
2313 order = calculate_order(size);
2320 s->allocflags |= __GFP_COMP;
2322 if (s->flags & SLAB_CACHE_DMA)
2323 s->allocflags |= SLUB_DMA;
2325 if (s->flags & SLAB_RECLAIM_ACCOUNT)
2326 s->allocflags |= __GFP_RECLAIMABLE;
2329 * Determine the number of objects per slab
2331 s->oo = oo_make(order, size);
2332 s->min = oo_make(get_order(size), size);
2333 if (oo_objects(s->oo) > oo_objects(s->max))
2336 return !!oo_objects(s->oo);
2340 static int kmem_cache_open(struct kmem_cache *s, gfp_t gfpflags,
2341 const char *name, size_t size,
2342 size_t align, unsigned long flags,
2343 void (*ctor)(struct kmem_cache *, void *))
2345 memset(s, 0, kmem_size);
2350 s->flags = kmem_cache_flags(size, flags, name, ctor);
2352 if (!calculate_sizes(s, -1))
2357 s->remote_node_defrag_ratio = 100;
2359 if (!init_kmem_cache_nodes(s, gfpflags & ~SLUB_DMA))
2362 if (alloc_kmem_cache_cpus(s, gfpflags & ~SLUB_DMA))
2364 free_kmem_cache_nodes(s);
2366 if (flags & SLAB_PANIC)
2367 panic("Cannot create slab %s size=%lu realsize=%u "
2368 "order=%u offset=%u flags=%lx\n",
2369 s->name, (unsigned long)size, s->size, oo_order(s->oo),
2375 * Check if a given pointer is valid
2377 int kmem_ptr_validate(struct kmem_cache *s, const void *object)
2381 page = get_object_page(object);
2383 if (!page || s != page->slab)
2384 /* No slab or wrong slab */
2387 if (!check_valid_pointer(s, page, object))
2391 * We could also check if the object is on the slabs freelist.
2392 * But this would be too expensive and it seems that the main
2393 * purpose of kmem_ptr_valid() is to check if the object belongs
2394 * to a certain slab.
2398 EXPORT_SYMBOL(kmem_ptr_validate);
2401 * Determine the size of a slab object
2403 unsigned int kmem_cache_size(struct kmem_cache *s)
2407 EXPORT_SYMBOL(kmem_cache_size);
2409 const char *kmem_cache_name(struct kmem_cache *s)
2413 EXPORT_SYMBOL(kmem_cache_name);
2415 static void list_slab_objects(struct kmem_cache *s, struct page *page,
2418 #ifdef CONFIG_SLUB_DEBUG
2419 void *addr = page_address(page);
2421 DECLARE_BITMAP(map, page->objects);
2423 bitmap_zero(map, page->objects);
2424 slab_err(s, page, "%s", text);
2426 for_each_free_object(p, s, page->freelist)
2427 set_bit(slab_index(p, s, addr), map);
2429 for_each_object(p, s, addr, page->objects) {
2431 if (!test_bit(slab_index(p, s, addr), map)) {
2432 printk(KERN_ERR "INFO: Object 0x%p @offset=%tu\n",
2434 print_tracking(s, p);
2442 * Attempt to free all partial slabs on a node.
2444 static void free_partial(struct kmem_cache *s, struct kmem_cache_node *n)
2446 unsigned long flags;
2447 struct page *page, *h;
2449 spin_lock_irqsave(&n->list_lock, flags);
2450 list_for_each_entry_safe(page, h, &n->partial, lru) {
2452 list_del(&page->lru);
2453 discard_slab(s, page);
2456 list_slab_objects(s, page,
2457 "Objects remaining on kmem_cache_close()");
2460 spin_unlock_irqrestore(&n->list_lock, flags);
2464 * Release all resources used by a slab cache.
2466 static inline int kmem_cache_close(struct kmem_cache *s)
2472 /* Attempt to free all objects */
2473 free_kmem_cache_cpus(s);
2474 for_each_node_state(node, N_NORMAL_MEMORY) {
2475 struct kmem_cache_node *n = get_node(s, node);
2478 if (n->nr_partial || slabs_node(s, node))
2481 free_kmem_cache_nodes(s);
2486 * Close a cache and release the kmem_cache structure
2487 * (must be used for caches created using kmem_cache_create)
2489 void kmem_cache_destroy(struct kmem_cache *s)
2491 down_write(&slub_lock);
2495 up_write(&slub_lock);
2496 if (kmem_cache_close(s)) {
2497 printk(KERN_ERR "SLUB %s: %s called for cache that "
2498 "still has objects.\n", s->name, __func__);
2501 sysfs_slab_remove(s);
2503 up_write(&slub_lock);
2505 EXPORT_SYMBOL(kmem_cache_destroy);
2507 /********************************************************************
2509 *******************************************************************/
2511 struct kmem_cache kmalloc_caches[PAGE_SHIFT + 1] __cacheline_aligned;
2512 EXPORT_SYMBOL(kmalloc_caches);
2514 static int __init setup_slub_min_order(char *str)
2516 get_option(&str, &slub_min_order);
2521 __setup("slub_min_order=", setup_slub_min_order);
2523 static int __init setup_slub_max_order(char *str)
2525 get_option(&str, &slub_max_order);
2530 __setup("slub_max_order=", setup_slub_max_order);
2532 static int __init setup_slub_min_objects(char *str)
2534 get_option(&str, &slub_min_objects);
2539 __setup("slub_min_objects=", setup_slub_min_objects);
2541 static int __init setup_slub_nomerge(char *str)
2547 __setup("slub_nomerge", setup_slub_nomerge);
2549 static struct kmem_cache *create_kmalloc_cache(struct kmem_cache *s,
2550 const char *name, int size, gfp_t gfp_flags)
2552 unsigned int flags = 0;
2554 if (gfp_flags & SLUB_DMA)
2555 flags = SLAB_CACHE_DMA;
2557 down_write(&slub_lock);
2558 if (!kmem_cache_open(s, gfp_flags, name, size, ARCH_KMALLOC_MINALIGN,
2562 list_add(&s->list, &slab_caches);
2563 up_write(&slub_lock);
2564 if (sysfs_slab_add(s))
2569 panic("Creation of kmalloc slab %s size=%d failed.\n", name, size);
2572 #ifdef CONFIG_ZONE_DMA
2573 static struct kmem_cache *kmalloc_caches_dma[PAGE_SHIFT + 1];
2575 static void sysfs_add_func(struct work_struct *w)
2577 struct kmem_cache *s;
2579 down_write(&slub_lock);
2580 list_for_each_entry(s, &slab_caches, list) {
2581 if (s->flags & __SYSFS_ADD_DEFERRED) {
2582 s->flags &= ~__SYSFS_ADD_DEFERRED;
2586 up_write(&slub_lock);
2589 static DECLARE_WORK(sysfs_add_work, sysfs_add_func);
2591 static noinline struct kmem_cache *dma_kmalloc_cache(int index, gfp_t flags)
2593 struct kmem_cache *s;
2597 s = kmalloc_caches_dma[index];
2601 /* Dynamically create dma cache */
2602 if (flags & __GFP_WAIT)
2603 down_write(&slub_lock);
2605 if (!down_write_trylock(&slub_lock))
2609 if (kmalloc_caches_dma[index])
2612 realsize = kmalloc_caches[index].objsize;
2613 text = kasprintf(flags & ~SLUB_DMA, "kmalloc_dma-%d",
2614 (unsigned int)realsize);
2615 s = kmalloc(kmem_size, flags & ~SLUB_DMA);
2617 if (!s || !text || !kmem_cache_open(s, flags, text,
2618 realsize, ARCH_KMALLOC_MINALIGN,
2619 SLAB_CACHE_DMA|__SYSFS_ADD_DEFERRED, NULL)) {
2625 list_add(&s->list, &slab_caches);
2626 kmalloc_caches_dma[index] = s;
2628 schedule_work(&sysfs_add_work);
2631 up_write(&slub_lock);
2633 return kmalloc_caches_dma[index];
2638 * Conversion table for small slabs sizes / 8 to the index in the
2639 * kmalloc array. This is necessary for slabs < 192 since we have non power
2640 * of two cache sizes there. The size of larger slabs can be determined using
2643 static s8 size_index[24] = {
2670 static struct kmem_cache *get_slab(size_t size, gfp_t flags)
2676 return ZERO_SIZE_PTR;
2678 index = size_index[(size - 1) / 8];
2680 index = fls(size - 1);
2682 #ifdef CONFIG_ZONE_DMA
2683 if (unlikely((flags & SLUB_DMA)))
2684 return dma_kmalloc_cache(index, flags);
2687 return &kmalloc_caches[index];
2690 void *__kmalloc(size_t size, gfp_t flags)
2692 struct kmem_cache *s;
2694 if (unlikely(size > PAGE_SIZE))
2695 return kmalloc_large(size, flags);
2697 s = get_slab(size, flags);
2699 if (unlikely(ZERO_OR_NULL_PTR(s)))
2702 return slab_alloc(s, flags, -1, __builtin_return_address(0));
2704 EXPORT_SYMBOL(__kmalloc);
2706 static void *kmalloc_large_node(size_t size, gfp_t flags, int node)
2708 struct page *page = alloc_pages_node(node, flags | __GFP_COMP,
2712 return page_address(page);
2718 void *__kmalloc_node(size_t size, gfp_t flags, int node)
2720 struct kmem_cache *s;
2722 if (unlikely(size > PAGE_SIZE))
2723 return kmalloc_large_node(size, flags, node);
2725 s = get_slab(size, flags);
2727 if (unlikely(ZERO_OR_NULL_PTR(s)))
2730 return slab_alloc(s, flags, node, __builtin_return_address(0));
2732 EXPORT_SYMBOL(__kmalloc_node);
2735 size_t ksize(const void *object)
2738 struct kmem_cache *s;
2740 if (unlikely(object == ZERO_SIZE_PTR))
2743 page = virt_to_head_page(object);
2745 if (unlikely(!PageSlab(page)))
2746 return PAGE_SIZE << compound_order(page);
2750 #ifdef CONFIG_SLUB_DEBUG
2752 * Debugging requires use of the padding between object
2753 * and whatever may come after it.
2755 if (s->flags & (SLAB_RED_ZONE | SLAB_POISON))
2760 * If we have the need to store the freelist pointer
2761 * back there or track user information then we can
2762 * only use the space before that information.
2764 if (s->flags & (SLAB_DESTROY_BY_RCU | SLAB_STORE_USER))
2767 * Else we can use all the padding etc for the allocation
2771 EXPORT_SYMBOL(ksize);
2773 void kfree(const void *x)
2776 void *object = (void *)x;
2778 if (unlikely(ZERO_OR_NULL_PTR(x)))
2781 page = virt_to_head_page(x);
2782 if (unlikely(!PageSlab(page))) {
2786 slab_free(page->slab, page, object, __builtin_return_address(0));
2788 EXPORT_SYMBOL(kfree);
2791 * kmem_cache_shrink removes empty slabs from the partial lists and sorts
2792 * the remaining slabs by the number of items in use. The slabs with the
2793 * most items in use come first. New allocations will then fill those up
2794 * and thus they can be removed from the partial lists.
2796 * The slabs with the least items are placed last. This results in them
2797 * being allocated from last increasing the chance that the last objects
2798 * are freed in them.
2800 int kmem_cache_shrink(struct kmem_cache *s)
2804 struct kmem_cache_node *n;
2807 int objects = oo_objects(s->max);
2808 struct list_head *slabs_by_inuse =
2809 kmalloc(sizeof(struct list_head) * objects, GFP_KERNEL);
2810 unsigned long flags;
2812 if (!slabs_by_inuse)
2816 for_each_node_state(node, N_NORMAL_MEMORY) {
2817 n = get_node(s, node);
2822 for (i = 0; i < objects; i++)
2823 INIT_LIST_HEAD(slabs_by_inuse + i);
2825 spin_lock_irqsave(&n->list_lock, flags);
2828 * Build lists indexed by the items in use in each slab.
2830 * Note that concurrent frees may occur while we hold the
2831 * list_lock. page->inuse here is the upper limit.
2833 list_for_each_entry_safe(page, t, &n->partial, lru) {
2834 if (!page->inuse && slab_trylock(page)) {
2836 * Must hold slab lock here because slab_free
2837 * may have freed the last object and be
2838 * waiting to release the slab.
2840 list_del(&page->lru);
2843 discard_slab(s, page);
2845 list_move(&page->lru,
2846 slabs_by_inuse + page->inuse);
2851 * Rebuild the partial list with the slabs filled up most
2852 * first and the least used slabs at the end.
2854 for (i = objects - 1; i >= 0; i--)
2855 list_splice(slabs_by_inuse + i, n->partial.prev);
2857 spin_unlock_irqrestore(&n->list_lock, flags);
2860 kfree(slabs_by_inuse);
2863 EXPORT_SYMBOL(kmem_cache_shrink);
2865 #if defined(CONFIG_NUMA) && defined(CONFIG_MEMORY_HOTPLUG)
2866 static int slab_mem_going_offline_callback(void *arg)
2868 struct kmem_cache *s;
2870 down_read(&slub_lock);
2871 list_for_each_entry(s, &slab_caches, list)
2872 kmem_cache_shrink(s);
2873 up_read(&slub_lock);
2878 static void slab_mem_offline_callback(void *arg)
2880 struct kmem_cache_node *n;
2881 struct kmem_cache *s;
2882 struct memory_notify *marg = arg;
2885 offline_node = marg->status_change_nid;
2888 * If the node still has available memory. we need kmem_cache_node
2891 if (offline_node < 0)
2894 down_read(&slub_lock);
2895 list_for_each_entry(s, &slab_caches, list) {
2896 n = get_node(s, offline_node);
2899 * if n->nr_slabs > 0, slabs still exist on the node
2900 * that is going down. We were unable to free them,
2901 * and offline_pages() function shoudn't call this
2902 * callback. So, we must fail.
2904 BUG_ON(slabs_node(s, offline_node));
2906 s->node[offline_node] = NULL;
2907 kmem_cache_free(kmalloc_caches, n);
2910 up_read(&slub_lock);
2913 static int slab_mem_going_online_callback(void *arg)
2915 struct kmem_cache_node *n;
2916 struct kmem_cache *s;
2917 struct memory_notify *marg = arg;
2918 int nid = marg->status_change_nid;
2922 * If the node's memory is already available, then kmem_cache_node is
2923 * already created. Nothing to do.
2929 * We are bringing a node online. No memory is availabe yet. We must
2930 * allocate a kmem_cache_node structure in order to bring the node
2933 down_read(&slub_lock);
2934 list_for_each_entry(s, &slab_caches, list) {
2936 * XXX: kmem_cache_alloc_node will fallback to other nodes
2937 * since memory is not yet available from the node that
2940 n = kmem_cache_alloc(kmalloc_caches, GFP_KERNEL);
2945 init_kmem_cache_node(n);
2949 up_read(&slub_lock);
2953 static int slab_memory_callback(struct notifier_block *self,
2954 unsigned long action, void *arg)
2959 case MEM_GOING_ONLINE:
2960 ret = slab_mem_going_online_callback(arg);
2962 case MEM_GOING_OFFLINE:
2963 ret = slab_mem_going_offline_callback(arg);
2966 case MEM_CANCEL_ONLINE:
2967 slab_mem_offline_callback(arg);
2970 case MEM_CANCEL_OFFLINE:
2974 ret = notifier_from_errno(ret);
2978 #endif /* CONFIG_MEMORY_HOTPLUG */
2980 /********************************************************************
2981 * Basic setup of slabs
2982 *******************************************************************/
2984 void __init kmem_cache_init(void)
2993 * Must first have the slab cache available for the allocations of the
2994 * struct kmem_cache_node's. There is special bootstrap code in
2995 * kmem_cache_open for slab_state == DOWN.
2997 create_kmalloc_cache(&kmalloc_caches[0], "kmem_cache_node",
2998 sizeof(struct kmem_cache_node), GFP_KERNEL);
2999 kmalloc_caches[0].refcount = -1;
3002 hotplug_memory_notifier(slab_memory_callback, 1);
3005 /* Able to allocate the per node structures */
3006 slab_state = PARTIAL;
3008 /* Caches that are not of the two-to-the-power-of size */
3009 if (KMALLOC_MIN_SIZE <= 64) {
3010 create_kmalloc_cache(&kmalloc_caches[1],
3011 "kmalloc-96", 96, GFP_KERNEL);
3014 if (KMALLOC_MIN_SIZE <= 128) {
3015 create_kmalloc_cache(&kmalloc_caches[2],
3016 "kmalloc-192", 192, GFP_KERNEL);
3020 for (i = KMALLOC_SHIFT_LOW; i <= PAGE_SHIFT; i++) {
3021 create_kmalloc_cache(&kmalloc_caches[i],
3022 "kmalloc", 1 << i, GFP_KERNEL);
3028 * Patch up the size_index table if we have strange large alignment
3029 * requirements for the kmalloc array. This is only the case for
3030 * MIPS it seems. The standard arches will not generate any code here.
3032 * Largest permitted alignment is 256 bytes due to the way we
3033 * handle the index determination for the smaller caches.
3035 * Make sure that nothing crazy happens if someone starts tinkering
3036 * around with ARCH_KMALLOC_MINALIGN
3038 BUILD_BUG_ON(KMALLOC_MIN_SIZE > 256 ||
3039 (KMALLOC_MIN_SIZE & (KMALLOC_MIN_SIZE - 1)));
3041 for (i = 8; i < KMALLOC_MIN_SIZE; i += 8)
3042 size_index[(i - 1) / 8] = KMALLOC_SHIFT_LOW;
3046 /* Provide the correct kmalloc names now that the caches are up */
3047 for (i = KMALLOC_SHIFT_LOW; i <= PAGE_SHIFT; i++)
3048 kmalloc_caches[i]. name =
3049 kasprintf(GFP_KERNEL, "kmalloc-%d", 1 << i);
3052 register_cpu_notifier(&slab_notifier);
3053 kmem_size = offsetof(struct kmem_cache, cpu_slab) +
3054 nr_cpu_ids * sizeof(struct kmem_cache_cpu *);
3056 kmem_size = sizeof(struct kmem_cache);
3060 "SLUB: Genslabs=%d, HWalign=%d, Order=%d-%d, MinObjects=%d,"
3061 " CPUs=%d, Nodes=%d\n",
3062 caches, cache_line_size(),
3063 slub_min_order, slub_max_order, slub_min_objects,
3064 nr_cpu_ids, nr_node_ids);
3068 * Find a mergeable slab cache
3070 static int slab_unmergeable(struct kmem_cache *s)
3072 if (slub_nomerge || (s->flags & SLUB_NEVER_MERGE))
3079 * We may have set a slab to be unmergeable during bootstrap.
3081 if (s->refcount < 0)
3087 static struct kmem_cache *find_mergeable(size_t size,
3088 size_t align, unsigned long flags, const char *name,
3089 void (*ctor)(struct kmem_cache *, void *))
3091 struct kmem_cache *s;
3093 if (slub_nomerge || (flags & SLUB_NEVER_MERGE))
3099 size = ALIGN(size, sizeof(void *));
3100 align = calculate_alignment(flags, align, size);
3101 size = ALIGN(size, align);
3102 flags = kmem_cache_flags(size, flags, name, NULL);
3104 list_for_each_entry(s, &slab_caches, list) {
3105 if (slab_unmergeable(s))
3111 if ((flags & SLUB_MERGE_SAME) != (s->flags & SLUB_MERGE_SAME))
3114 * Check if alignment is compatible.
3115 * Courtesy of Adrian Drzewiecki
3117 if ((s->size & ~(align - 1)) != s->size)
3120 if (s->size - size >= sizeof(void *))
3128 struct kmem_cache *kmem_cache_create(const char *name, size_t size,
3129 size_t align, unsigned long flags,
3130 void (*ctor)(struct kmem_cache *, void *))
3132 struct kmem_cache *s;
3134 down_write(&slub_lock);
3135 s = find_mergeable(size, align, flags, name, ctor);
3141 * Adjust the object sizes so that we clear
3142 * the complete object on kzalloc.
3144 s->objsize = max(s->objsize, (int)size);
3147 * And then we need to update the object size in the
3148 * per cpu structures
3150 for_each_online_cpu(cpu)
3151 get_cpu_slab(s, cpu)->objsize = s->objsize;
3153 s->inuse = max_t(int, s->inuse, ALIGN(size, sizeof(void *)));
3154 up_write(&slub_lock);
3156 if (sysfs_slab_alias(s, name))
3161 s = kmalloc(kmem_size, GFP_KERNEL);
3163 if (kmem_cache_open(s, GFP_KERNEL, name,
3164 size, align, flags, ctor)) {
3165 list_add(&s->list, &slab_caches);
3166 up_write(&slub_lock);
3167 if (sysfs_slab_add(s))
3173 up_write(&slub_lock);
3176 if (flags & SLAB_PANIC)
3177 panic("Cannot create slabcache %s\n", name);
3182 EXPORT_SYMBOL(kmem_cache_create);
3186 * Use the cpu notifier to insure that the cpu slabs are flushed when
3189 static int __cpuinit slab_cpuup_callback(struct notifier_block *nfb,
3190 unsigned long action, void *hcpu)
3192 long cpu = (long)hcpu;
3193 struct kmem_cache *s;
3194 unsigned long flags;
3197 case CPU_UP_PREPARE:
3198 case CPU_UP_PREPARE_FROZEN:
3199 init_alloc_cpu_cpu(cpu);
3200 down_read(&slub_lock);
3201 list_for_each_entry(s, &slab_caches, list)
3202 s->cpu_slab[cpu] = alloc_kmem_cache_cpu(s, cpu,
3204 up_read(&slub_lock);
3207 case CPU_UP_CANCELED:
3208 case CPU_UP_CANCELED_FROZEN:
3210 case CPU_DEAD_FROZEN:
3211 down_read(&slub_lock);
3212 list_for_each_entry(s, &slab_caches, list) {
3213 struct kmem_cache_cpu *c = get_cpu_slab(s, cpu);
3215 local_irq_save(flags);
3216 __flush_cpu_slab(s, cpu);
3217 local_irq_restore(flags);
3218 free_kmem_cache_cpu(c, cpu);
3219 s->cpu_slab[cpu] = NULL;
3221 up_read(&slub_lock);
3229 static struct notifier_block __cpuinitdata slab_notifier = {
3230 .notifier_call = slab_cpuup_callback
3235 void *__kmalloc_track_caller(size_t size, gfp_t gfpflags, void *caller)
3237 struct kmem_cache *s;
3239 if (unlikely(size > PAGE_SIZE))
3240 return kmalloc_large(size, gfpflags);
3242 s = get_slab(size, gfpflags);
3244 if (unlikely(ZERO_OR_NULL_PTR(s)))
3247 return slab_alloc(s, gfpflags, -1, caller);
3250 void *__kmalloc_node_track_caller(size_t size, gfp_t gfpflags,
3251 int node, void *caller)
3253 struct kmem_cache *s;
3255 if (unlikely(size > PAGE_SIZE))
3256 return kmalloc_large_node(size, gfpflags, node);
3258 s = get_slab(size, gfpflags);
3260 if (unlikely(ZERO_OR_NULL_PTR(s)))
3263 return slab_alloc(s, gfpflags, node, caller);
3266 #if (defined(CONFIG_SYSFS) && defined(CONFIG_SLUB_DEBUG)) || defined(CONFIG_SLABINFO)
3267 static unsigned long count_partial(struct kmem_cache_node *n,
3268 int (*get_count)(struct page *))
3270 unsigned long flags;
3271 unsigned long x = 0;
3274 spin_lock_irqsave(&n->list_lock, flags);
3275 list_for_each_entry(page, &n->partial, lru)
3276 x += get_count(page);
3277 spin_unlock_irqrestore(&n->list_lock, flags);
3281 static int count_inuse(struct page *page)
3286 static int count_total(struct page *page)
3288 return page->objects;
3291 static int count_free(struct page *page)
3293 return page->objects - page->inuse;
3297 #if defined(CONFIG_SYSFS) && defined(CONFIG_SLUB_DEBUG)
3298 static int validate_slab(struct kmem_cache *s, struct page *page,
3302 void *addr = page_address(page);
3304 if (!check_slab(s, page) ||
3305 !on_freelist(s, page, NULL))
3308 /* Now we know that a valid freelist exists */
3309 bitmap_zero(map, page->objects);
3311 for_each_free_object(p, s, page->freelist) {
3312 set_bit(slab_index(p, s, addr), map);
3313 if (!check_object(s, page, p, 0))
3317 for_each_object(p, s, addr, page->objects)
3318 if (!test_bit(slab_index(p, s, addr), map))
3319 if (!check_object(s, page, p, 1))
3324 static void validate_slab_slab(struct kmem_cache *s, struct page *page,
3327 if (slab_trylock(page)) {
3328 validate_slab(s, page, map);
3331 printk(KERN_INFO "SLUB %s: Skipped busy slab 0x%p\n",
3334 if (s->flags & DEBUG_DEFAULT_FLAGS) {
3335 if (!SlabDebug(page))
3336 printk(KERN_ERR "SLUB %s: SlabDebug not set "
3337 "on slab 0x%p\n", s->name, page);
3339 if (SlabDebug(page))
3340 printk(KERN_ERR "SLUB %s: SlabDebug set on "
3341 "slab 0x%p\n", s->name, page);
3345 static int validate_slab_node(struct kmem_cache *s,
3346 struct kmem_cache_node *n, unsigned long *map)
3348 unsigned long count = 0;
3350 unsigned long flags;
3352 spin_lock_irqsave(&n->list_lock, flags);
3354 list_for_each_entry(page, &n->partial, lru) {
3355 validate_slab_slab(s, page, map);
3358 if (count != n->nr_partial)
3359 printk(KERN_ERR "SLUB %s: %ld partial slabs counted but "
3360 "counter=%ld\n", s->name, count, n->nr_partial);
3362 if (!(s->flags & SLAB_STORE_USER))
3365 list_for_each_entry(page, &n->full, lru) {
3366 validate_slab_slab(s, page, map);
3369 if (count != atomic_long_read(&n->nr_slabs))
3370 printk(KERN_ERR "SLUB: %s %ld slabs counted but "
3371 "counter=%ld\n", s->name, count,
3372 atomic_long_read(&n->nr_slabs));
3375 spin_unlock_irqrestore(&n->list_lock, flags);
3379 static long validate_slab_cache(struct kmem_cache *s)
3382 unsigned long count = 0;
3383 unsigned long *map = kmalloc(BITS_TO_LONGS(oo_objects(s->max)) *
3384 sizeof(unsigned long), GFP_KERNEL);
3390 for_each_node_state(node, N_NORMAL_MEMORY) {
3391 struct kmem_cache_node *n = get_node(s, node);
3393 count += validate_slab_node(s, n, map);
3399 #ifdef SLUB_RESILIENCY_TEST
3400 static void resiliency_test(void)
3404 printk(KERN_ERR "SLUB resiliency testing\n");
3405 printk(KERN_ERR "-----------------------\n");
3406 printk(KERN_ERR "A. Corruption after allocation\n");
3408 p = kzalloc(16, GFP_KERNEL);
3410 printk(KERN_ERR "\n1. kmalloc-16: Clobber Redzone/next pointer"
3411 " 0x12->0x%p\n\n", p + 16);
3413 validate_slab_cache(kmalloc_caches + 4);
3415 /* Hmmm... The next two are dangerous */
3416 p = kzalloc(32, GFP_KERNEL);
3417 p[32 + sizeof(void *)] = 0x34;
3418 printk(KERN_ERR "\n2. kmalloc-32: Clobber next pointer/next slab"
3419 " 0x34 -> -0x%p\n", p);
3421 "If allocated object is overwritten then not detectable\n\n");
3423 validate_slab_cache(kmalloc_caches + 5);
3424 p = kzalloc(64, GFP_KERNEL);
3425 p += 64 + (get_cycles() & 0xff) * sizeof(void *);
3427 printk(KERN_ERR "\n3. kmalloc-64: corrupting random byte 0x56->0x%p\n",
3430 "If allocated object is overwritten then not detectable\n\n");
3431 validate_slab_cache(kmalloc_caches + 6);
3433 printk(KERN_ERR "\nB. Corruption after free\n");
3434 p = kzalloc(128, GFP_KERNEL);
3437 printk(KERN_ERR "1. kmalloc-128: Clobber first word 0x78->0x%p\n\n", p);
3438 validate_slab_cache(kmalloc_caches + 7);
3440 p = kzalloc(256, GFP_KERNEL);
3443 printk(KERN_ERR "\n2. kmalloc-256: Clobber 50th byte 0x9a->0x%p\n\n",
3445 validate_slab_cache(kmalloc_caches + 8);
3447 p = kzalloc(512, GFP_KERNEL);
3450 printk(KERN_ERR "\n3. kmalloc-512: Clobber redzone 0xab->0x%p\n\n", p);
3451 validate_slab_cache(kmalloc_caches + 9);
3454 static void resiliency_test(void) {};
3458 * Generate lists of code addresses where slabcache objects are allocated
3463 unsigned long count;
3476 unsigned long count;
3477 struct location *loc;
3480 static void free_loc_track(struct loc_track *t)
3483 free_pages((unsigned long)t->loc,
3484 get_order(sizeof(struct location) * t->max));
3487 static int alloc_loc_track(struct loc_track *t, unsigned long max, gfp_t flags)
3492 order = get_order(sizeof(struct location) * max);
3494 l = (void *)__get_free_pages(flags, order);
3499 memcpy(l, t->loc, sizeof(struct location) * t->count);
3507 static int add_location(struct loc_track *t, struct kmem_cache *s,
3508 const struct track *track)
3510 long start, end, pos;
3513 unsigned long age = jiffies - track->when;
3519 pos = start + (end - start + 1) / 2;
3522 * There is nothing at "end". If we end up there
3523 * we need to add something to before end.
3528 caddr = t->loc[pos].addr;
3529 if (track->addr == caddr) {
3535 if (age < l->min_time)
3537 if (age > l->max_time)
3540 if (track->pid < l->min_pid)
3541 l->min_pid = track->pid;
3542 if (track->pid > l->max_pid)
3543 l->max_pid = track->pid;
3545 cpu_set(track->cpu, l->cpus);
3547 node_set(page_to_nid(virt_to_page(track)), l->nodes);
3551 if (track->addr < caddr)
3558 * Not found. Insert new tracking element.
3560 if (t->count >= t->max && !alloc_loc_track(t, 2 * t->max, GFP_ATOMIC))
3566 (t->count - pos) * sizeof(struct location));
3569 l->addr = track->addr;
3573 l->min_pid = track->pid;
3574 l->max_pid = track->pid;
3575 cpus_clear(l->cpus);
3576 cpu_set(track->cpu, l->cpus);
3577 nodes_clear(l->nodes);
3578 node_set(page_to_nid(virt_to_page(track)), l->nodes);
3582 static void process_slab(struct loc_track *t, struct kmem_cache *s,
3583 struct page *page, enum track_item alloc)
3585 void *addr = page_address(page);
3586 DECLARE_BITMAP(map, page->objects);
3589 bitmap_zero(map, page->objects);
3590 for_each_free_object(p, s, page->freelist)
3591 set_bit(slab_index(p, s, addr), map);
3593 for_each_object(p, s, addr, page->objects)
3594 if (!test_bit(slab_index(p, s, addr), map))
3595 add_location(t, s, get_track(s, p, alloc));
3598 static int list_locations(struct kmem_cache *s, char *buf,
3599 enum track_item alloc)
3603 struct loc_track t = { 0, 0, NULL };
3606 if (!alloc_loc_track(&t, PAGE_SIZE / sizeof(struct location),
3608 return sprintf(buf, "Out of memory\n");
3610 /* Push back cpu slabs */
3613 for_each_node_state(node, N_NORMAL_MEMORY) {
3614 struct kmem_cache_node *n = get_node(s, node);
3615 unsigned long flags;
3618 if (!atomic_long_read(&n->nr_slabs))
3621 spin_lock_irqsave(&n->list_lock, flags);
3622 list_for_each_entry(page, &n->partial, lru)
3623 process_slab(&t, s, page, alloc);
3624 list_for_each_entry(page, &n->full, lru)
3625 process_slab(&t, s, page, alloc);
3626 spin_unlock_irqrestore(&n->list_lock, flags);
3629 for (i = 0; i < t.count; i++) {
3630 struct location *l = &t.loc[i];
3632 if (len > PAGE_SIZE - 100)
3634 len += sprintf(buf + len, "%7ld ", l->count);
3637 len += sprint_symbol(buf + len, (unsigned long)l->addr);
3639 len += sprintf(buf + len, "<not-available>");
3641 if (l->sum_time != l->min_time) {
3642 unsigned long remainder;
3644 len += sprintf(buf + len, " age=%ld/%ld/%ld",
3646 div_long_long_rem(l->sum_time, l->count, &remainder),
3649 len += sprintf(buf + len, " age=%ld",
3652 if (l->min_pid != l->max_pid)
3653 len += sprintf(buf + len, " pid=%ld-%ld",
3654 l->min_pid, l->max_pid);
3656 len += sprintf(buf + len, " pid=%ld",
3659 if (num_online_cpus() > 1 && !cpus_empty(l->cpus) &&
3660 len < PAGE_SIZE - 60) {
3661 len += sprintf(buf + len, " cpus=");
3662 len += cpulist_scnprintf(buf + len, PAGE_SIZE - len - 50,
3666 if (num_online_nodes() > 1 && !nodes_empty(l->nodes) &&
3667 len < PAGE_SIZE - 60) {
3668 len += sprintf(buf + len, " nodes=");
3669 len += nodelist_scnprintf(buf + len, PAGE_SIZE - len - 50,
3673 len += sprintf(buf + len, "\n");
3678 len += sprintf(buf, "No data\n");
3682 enum slab_stat_type {
3683 SL_ALL, /* All slabs */
3684 SL_PARTIAL, /* Only partially allocated slabs */
3685 SL_CPU, /* Only slabs used for cpu caches */
3686 SL_OBJECTS, /* Determine allocated objects not slabs */
3687 SL_TOTAL /* Determine object capacity not slabs */
3690 #define SO_ALL (1 << SL_ALL)
3691 #define SO_PARTIAL (1 << SL_PARTIAL)
3692 #define SO_CPU (1 << SL_CPU)
3693 #define SO_OBJECTS (1 << SL_OBJECTS)
3694 #define SO_TOTAL (1 << SL_TOTAL)
3696 static ssize_t show_slab_objects(struct kmem_cache *s,
3697 char *buf, unsigned long flags)
3699 unsigned long total = 0;
3702 unsigned long *nodes;
3703 unsigned long *per_cpu;
3705 nodes = kzalloc(2 * sizeof(unsigned long) * nr_node_ids, GFP_KERNEL);
3708 per_cpu = nodes + nr_node_ids;
3710 if (flags & SO_CPU) {
3713 for_each_possible_cpu(cpu) {
3714 struct kmem_cache_cpu *c = get_cpu_slab(s, cpu);
3716 if (!c || c->node < 0)
3720 if (flags & SO_TOTAL)
3721 x = c->page->objects;
3722 else if (flags & SO_OBJECTS)
3728 nodes[c->node] += x;
3734 if (flags & SO_ALL) {
3735 for_each_node_state(node, N_NORMAL_MEMORY) {
3736 struct kmem_cache_node *n = get_node(s, node);
3738 if (flags & SO_TOTAL)
3739 x = atomic_long_read(&n->total_objects);
3740 else if (flags & SO_OBJECTS)
3741 x = atomic_long_read(&n->total_objects) -
3742 count_partial(n, count_free);
3745 x = atomic_long_read(&n->nr_slabs);
3750 } else if (flags & SO_PARTIAL) {
3751 for_each_node_state(node, N_NORMAL_MEMORY) {
3752 struct kmem_cache_node *n = get_node(s, node);
3754 if (flags & SO_TOTAL)
3755 x = count_partial(n, count_total);
3756 else if (flags & SO_OBJECTS)
3757 x = count_partial(n, count_inuse);
3764 x = sprintf(buf, "%lu", total);
3766 for_each_node_state(node, N_NORMAL_MEMORY)
3768 x += sprintf(buf + x, " N%d=%lu",
3772 return x + sprintf(buf + x, "\n");
3775 static int any_slab_objects(struct kmem_cache *s)
3780 for_each_possible_cpu(cpu) {
3781 struct kmem_cache_cpu *c = get_cpu_slab(s, cpu);
3787 for_each_online_node(node) {
3788 struct kmem_cache_node *n = get_node(s, node);
3793 if (n->nr_partial || atomic_long_read(&n->nr_slabs))
3799 #define to_slab_attr(n) container_of(n, struct slab_attribute, attr)
3800 #define to_slab(n) container_of(n, struct kmem_cache, kobj);
3802 struct slab_attribute {
3803 struct attribute attr;
3804 ssize_t (*show)(struct kmem_cache *s, char *buf);
3805 ssize_t (*store)(struct kmem_cache *s, const char *x, size_t count);
3808 #define SLAB_ATTR_RO(_name) \
3809 static struct slab_attribute _name##_attr = __ATTR_RO(_name)
3811 #define SLAB_ATTR(_name) \
3812 static struct slab_attribute _name##_attr = \
3813 __ATTR(_name, 0644, _name##_show, _name##_store)
3815 static ssize_t slab_size_show(struct kmem_cache *s, char *buf)
3817 return sprintf(buf, "%d\n", s->size);
3819 SLAB_ATTR_RO(slab_size);
3821 static ssize_t align_show(struct kmem_cache *s, char *buf)
3823 return sprintf(buf, "%d\n", s->align);
3825 SLAB_ATTR_RO(align);
3827 static ssize_t object_size_show(struct kmem_cache *s, char *buf)
3829 return sprintf(buf, "%d\n", s->objsize);
3831 SLAB_ATTR_RO(object_size);
3833 static ssize_t objs_per_slab_show(struct kmem_cache *s, char *buf)
3835 return sprintf(buf, "%d\n", oo_objects(s->oo));
3837 SLAB_ATTR_RO(objs_per_slab);
3839 static ssize_t order_store(struct kmem_cache *s,
3840 const char *buf, size_t length)
3842 int order = simple_strtoul(buf, NULL, 10);
3844 if (order > slub_max_order || order < slub_min_order)
3847 calculate_sizes(s, order);
3851 static ssize_t order_show(struct kmem_cache *s, char *buf)
3853 return sprintf(buf, "%d\n", oo_order(s->oo));
3857 static ssize_t ctor_show(struct kmem_cache *s, char *buf)
3860 int n = sprint_symbol(buf, (unsigned long)s->ctor);
3862 return n + sprintf(buf + n, "\n");
3868 static ssize_t aliases_show(struct kmem_cache *s, char *buf)
3870 return sprintf(buf, "%d\n", s->refcount - 1);
3872 SLAB_ATTR_RO(aliases);
3874 static ssize_t slabs_show(struct kmem_cache *s, char *buf)
3876 return show_slab_objects(s, buf, SO_ALL);
3878 SLAB_ATTR_RO(slabs);
3880 static ssize_t partial_show(struct kmem_cache *s, char *buf)
3882 return show_slab_objects(s, buf, SO_PARTIAL);
3884 SLAB_ATTR_RO(partial);
3886 static ssize_t cpu_slabs_show(struct kmem_cache *s, char *buf)
3888 return show_slab_objects(s, buf, SO_CPU);
3890 SLAB_ATTR_RO(cpu_slabs);
3892 static ssize_t objects_show(struct kmem_cache *s, char *buf)
3894 return show_slab_objects(s, buf, SO_ALL|SO_OBJECTS);
3896 SLAB_ATTR_RO(objects);
3898 static ssize_t objects_partial_show(struct kmem_cache *s, char *buf)
3900 return show_slab_objects(s, buf, SO_PARTIAL|SO_OBJECTS);
3902 SLAB_ATTR_RO(objects_partial);
3904 static ssize_t total_objects_show(struct kmem_cache *s, char *buf)
3906 return show_slab_objects(s, buf, SO_ALL|SO_TOTAL);
3908 SLAB_ATTR_RO(total_objects);
3910 static ssize_t sanity_checks_show(struct kmem_cache *s, char *buf)
3912 return sprintf(buf, "%d\n", !!(s->flags & SLAB_DEBUG_FREE));
3915 static ssize_t sanity_checks_store(struct kmem_cache *s,
3916 const char *buf, size_t length)
3918 s->flags &= ~SLAB_DEBUG_FREE;
3920 s->flags |= SLAB_DEBUG_FREE;
3923 SLAB_ATTR(sanity_checks);
3925 static ssize_t trace_show(struct kmem_cache *s, char *buf)
3927 return sprintf(buf, "%d\n", !!(s->flags & SLAB_TRACE));
3930 static ssize_t trace_store(struct kmem_cache *s, const char *buf,
3933 s->flags &= ~SLAB_TRACE;
3935 s->flags |= SLAB_TRACE;
3940 static ssize_t reclaim_account_show(struct kmem_cache *s, char *buf)
3942 return sprintf(buf, "%d\n", !!(s->flags & SLAB_RECLAIM_ACCOUNT));
3945 static ssize_t reclaim_account_store(struct kmem_cache *s,
3946 const char *buf, size_t length)
3948 s->flags &= ~SLAB_RECLAIM_ACCOUNT;
3950 s->flags |= SLAB_RECLAIM_ACCOUNT;
3953 SLAB_ATTR(reclaim_account);
3955 static ssize_t hwcache_align_show(struct kmem_cache *s, char *buf)
3957 return sprintf(buf, "%d\n", !!(s->flags & SLAB_HWCACHE_ALIGN));
3959 SLAB_ATTR_RO(hwcache_align);
3961 #ifdef CONFIG_ZONE_DMA
3962 static ssize_t cache_dma_show(struct kmem_cache *s, char *buf)
3964 return sprintf(buf, "%d\n", !!(s->flags & SLAB_CACHE_DMA));
3966 SLAB_ATTR_RO(cache_dma);
3969 static ssize_t destroy_by_rcu_show(struct kmem_cache *s, char *buf)
3971 return sprintf(buf, "%d\n", !!(s->flags & SLAB_DESTROY_BY_RCU));
3973 SLAB_ATTR_RO(destroy_by_rcu);
3975 static ssize_t red_zone_show(struct kmem_cache *s, char *buf)
3977 return sprintf(buf, "%d\n", !!(s->flags & SLAB_RED_ZONE));
3980 static ssize_t red_zone_store(struct kmem_cache *s,
3981 const char *buf, size_t length)
3983 if (any_slab_objects(s))
3986 s->flags &= ~SLAB_RED_ZONE;
3988 s->flags |= SLAB_RED_ZONE;
3989 calculate_sizes(s, -1);
3992 SLAB_ATTR(red_zone);
3994 static ssize_t poison_show(struct kmem_cache *s, char *buf)
3996 return sprintf(buf, "%d\n", !!(s->flags & SLAB_POISON));
3999 static ssize_t poison_store(struct kmem_cache *s,
4000 const char *buf, size_t length)
4002 if (any_slab_objects(s))
4005 s->flags &= ~SLAB_POISON;
4007 s->flags |= SLAB_POISON;
4008 calculate_sizes(s, -1);
4013 static ssize_t store_user_show(struct kmem_cache *s, char *buf)
4015 return sprintf(buf, "%d\n", !!(s->flags & SLAB_STORE_USER));
4018 static ssize_t store_user_store(struct kmem_cache *s,
4019 const char *buf, size_t length)
4021 if (any_slab_objects(s))
4024 s->flags &= ~SLAB_STORE_USER;
4026 s->flags |= SLAB_STORE_USER;
4027 calculate_sizes(s, -1);
4030 SLAB_ATTR(store_user);
4032 static ssize_t validate_show(struct kmem_cache *s, char *buf)
4037 static ssize_t validate_store(struct kmem_cache *s,
4038 const char *buf, size_t length)
4042 if (buf[0] == '1') {
4043 ret = validate_slab_cache(s);
4049 SLAB_ATTR(validate);
4051 static ssize_t shrink_show(struct kmem_cache *s, char *buf)
4056 static ssize_t shrink_store(struct kmem_cache *s,
4057 const char *buf, size_t length)
4059 if (buf[0] == '1') {
4060 int rc = kmem_cache_shrink(s);
4070 static ssize_t alloc_calls_show(struct kmem_cache *s, char *buf)
4072 if (!(s->flags & SLAB_STORE_USER))
4074 return list_locations(s, buf, TRACK_ALLOC);
4076 SLAB_ATTR_RO(alloc_calls);
4078 static ssize_t free_calls_show(struct kmem_cache *s, char *buf)
4080 if (!(s->flags & SLAB_STORE_USER))
4082 return list_locations(s, buf, TRACK_FREE);
4084 SLAB_ATTR_RO(free_calls);
4087 static ssize_t remote_node_defrag_ratio_show(struct kmem_cache *s, char *buf)
4089 return sprintf(buf, "%d\n", s->remote_node_defrag_ratio / 10);
4092 static ssize_t remote_node_defrag_ratio_store(struct kmem_cache *s,
4093 const char *buf, size_t length)
4095 int n = simple_strtoul(buf, NULL, 10);
4098 s->remote_node_defrag_ratio = n * 10;
4101 SLAB_ATTR(remote_node_defrag_ratio);
4104 #ifdef CONFIG_SLUB_STATS
4105 static int show_stat(struct kmem_cache *s, char *buf, enum stat_item si)
4107 unsigned long sum = 0;
4110 int *data = kmalloc(nr_cpu_ids * sizeof(int), GFP_KERNEL);
4115 for_each_online_cpu(cpu) {
4116 unsigned x = get_cpu_slab(s, cpu)->stat[si];
4122 len = sprintf(buf, "%lu", sum);
4125 for_each_online_cpu(cpu) {
4126 if (data[cpu] && len < PAGE_SIZE - 20)
4127 len += sprintf(buf + len, " C%d=%u", cpu, data[cpu]);
4131 return len + sprintf(buf + len, "\n");
4134 #define STAT_ATTR(si, text) \
4135 static ssize_t text##_show(struct kmem_cache *s, char *buf) \
4137 return show_stat(s, buf, si); \
4139 SLAB_ATTR_RO(text); \
4141 STAT_ATTR(ALLOC_FASTPATH, alloc_fastpath);
4142 STAT_ATTR(ALLOC_SLOWPATH, alloc_slowpath);
4143 STAT_ATTR(FREE_FASTPATH, free_fastpath);
4144 STAT_ATTR(FREE_SLOWPATH, free_slowpath);
4145 STAT_ATTR(FREE_FROZEN, free_frozen);
4146 STAT_ATTR(FREE_ADD_PARTIAL, free_add_partial);
4147 STAT_ATTR(FREE_REMOVE_PARTIAL, free_remove_partial);
4148 STAT_ATTR(ALLOC_FROM_PARTIAL, alloc_from_partial);
4149 STAT_ATTR(ALLOC_SLAB, alloc_slab);
4150 STAT_ATTR(ALLOC_REFILL, alloc_refill);
4151 STAT_ATTR(FREE_SLAB, free_slab);
4152 STAT_ATTR(CPUSLAB_FLUSH, cpuslab_flush);
4153 STAT_ATTR(DEACTIVATE_FULL, deactivate_full);
4154 STAT_ATTR(DEACTIVATE_EMPTY, deactivate_empty);
4155 STAT_ATTR(DEACTIVATE_TO_HEAD, deactivate_to_head);
4156 STAT_ATTR(DEACTIVATE_TO_TAIL, deactivate_to_tail);
4157 STAT_ATTR(DEACTIVATE_REMOTE_FREES, deactivate_remote_frees);
4158 STAT_ATTR(ORDER_FALLBACK, order_fallback);
4161 static struct attribute *slab_attrs[] = {
4162 &slab_size_attr.attr,
4163 &object_size_attr.attr,
4164 &objs_per_slab_attr.attr,
4167 &objects_partial_attr.attr,
4168 &total_objects_attr.attr,
4171 &cpu_slabs_attr.attr,
4175 &sanity_checks_attr.attr,
4177 &hwcache_align_attr.attr,
4178 &reclaim_account_attr.attr,
4179 &destroy_by_rcu_attr.attr,
4180 &red_zone_attr.attr,
4182 &store_user_attr.attr,
4183 &validate_attr.attr,
4185 &alloc_calls_attr.attr,
4186 &free_calls_attr.attr,
4187 #ifdef CONFIG_ZONE_DMA
4188 &cache_dma_attr.attr,
4191 &remote_node_defrag_ratio_attr.attr,
4193 #ifdef CONFIG_SLUB_STATS
4194 &alloc_fastpath_attr.attr,
4195 &alloc_slowpath_attr.attr,
4196 &free_fastpath_attr.attr,
4197 &free_slowpath_attr.attr,
4198 &free_frozen_attr.attr,
4199 &free_add_partial_attr.attr,
4200 &free_remove_partial_attr.attr,
4201 &alloc_from_partial_attr.attr,
4202 &alloc_slab_attr.attr,
4203 &alloc_refill_attr.attr,
4204 &free_slab_attr.attr,
4205 &cpuslab_flush_attr.attr,
4206 &deactivate_full_attr.attr,
4207 &deactivate_empty_attr.attr,
4208 &deactivate_to_head_attr.attr,
4209 &deactivate_to_tail_attr.attr,
4210 &deactivate_remote_frees_attr.attr,
4211 &order_fallback_attr.attr,
4216 static struct attribute_group slab_attr_group = {
4217 .attrs = slab_attrs,
4220 static ssize_t slab_attr_show(struct kobject *kobj,
4221 struct attribute *attr,
4224 struct slab_attribute *attribute;
4225 struct kmem_cache *s;
4228 attribute = to_slab_attr(attr);
4231 if (!attribute->show)
4234 err = attribute->show(s, buf);
4239 static ssize_t slab_attr_store(struct kobject *kobj,
4240 struct attribute *attr,
4241 const char *buf, size_t len)
4243 struct slab_attribute *attribute;
4244 struct kmem_cache *s;
4247 attribute = to_slab_attr(attr);
4250 if (!attribute->store)
4253 err = attribute->store(s, buf, len);
4258 static void kmem_cache_release(struct kobject *kobj)
4260 struct kmem_cache *s = to_slab(kobj);
4265 static struct sysfs_ops slab_sysfs_ops = {
4266 .show = slab_attr_show,
4267 .store = slab_attr_store,
4270 static struct kobj_type slab_ktype = {
4271 .sysfs_ops = &slab_sysfs_ops,
4272 .release = kmem_cache_release
4275 static int uevent_filter(struct kset *kset, struct kobject *kobj)
4277 struct kobj_type *ktype = get_ktype(kobj);
4279 if (ktype == &slab_ktype)
4284 static struct kset_uevent_ops slab_uevent_ops = {
4285 .filter = uevent_filter,
4288 static struct kset *slab_kset;
4290 #define ID_STR_LENGTH 64
4292 /* Create a unique string id for a slab cache:
4294 * Format :[flags-]size
4296 static char *create_unique_id(struct kmem_cache *s)
4298 char *name = kmalloc(ID_STR_LENGTH, GFP_KERNEL);
4305 * First flags affecting slabcache operations. We will only
4306 * get here for aliasable slabs so we do not need to support
4307 * too many flags. The flags here must cover all flags that
4308 * are matched during merging to guarantee that the id is
4311 if (s->flags & SLAB_CACHE_DMA)
4313 if (s->flags & SLAB_RECLAIM_ACCOUNT)
4315 if (s->flags & SLAB_DEBUG_FREE)
4319 p += sprintf(p, "%07d", s->size);
4320 BUG_ON(p > name + ID_STR_LENGTH - 1);
4324 static int sysfs_slab_add(struct kmem_cache *s)
4330 if (slab_state < SYSFS)
4331 /* Defer until later */
4334 unmergeable = slab_unmergeable(s);
4337 * Slabcache can never be merged so we can use the name proper.
4338 * This is typically the case for debug situations. In that
4339 * case we can catch duplicate names easily.
4341 sysfs_remove_link(&slab_kset->kobj, s->name);
4345 * Create a unique name for the slab as a target
4348 name = create_unique_id(s);
4351 s->kobj.kset = slab_kset;
4352 err = kobject_init_and_add(&s->kobj, &slab_ktype, NULL, name);
4354 kobject_put(&s->kobj);
4358 err = sysfs_create_group(&s->kobj, &slab_attr_group);
4361 kobject_uevent(&s->kobj, KOBJ_ADD);
4363 /* Setup first alias */
4364 sysfs_slab_alias(s, s->name);
4370 static void sysfs_slab_remove(struct kmem_cache *s)
4372 kobject_uevent(&s->kobj, KOBJ_REMOVE);
4373 kobject_del(&s->kobj);
4374 kobject_put(&s->kobj);
4378 * Need to buffer aliases during bootup until sysfs becomes
4379 * available lest we loose that information.
4381 struct saved_alias {
4382 struct kmem_cache *s;
4384 struct saved_alias *next;
4387 static struct saved_alias *alias_list;
4389 static int sysfs_slab_alias(struct kmem_cache *s, const char *name)
4391 struct saved_alias *al;
4393 if (slab_state == SYSFS) {
4395 * If we have a leftover link then remove it.
4397 sysfs_remove_link(&slab_kset->kobj, name);
4398 return sysfs_create_link(&slab_kset->kobj, &s->kobj, name);
4401 al = kmalloc(sizeof(struct saved_alias), GFP_KERNEL);
4407 al->next = alias_list;
4412 static int __init slab_sysfs_init(void)
4414 struct kmem_cache *s;
4417 slab_kset = kset_create_and_add("slab", &slab_uevent_ops, kernel_kobj);
4419 printk(KERN_ERR "Cannot register slab subsystem.\n");
4425 list_for_each_entry(s, &slab_caches, list) {
4426 err = sysfs_slab_add(s);
4428 printk(KERN_ERR "SLUB: Unable to add boot slab %s"
4429 " to sysfs\n", s->name);
4432 while (alias_list) {
4433 struct saved_alias *al = alias_list;
4435 alias_list = alias_list->next;
4436 err = sysfs_slab_alias(al->s, al->name);
4438 printk(KERN_ERR "SLUB: Unable to add boot slab alias"
4439 " %s to sysfs\n", s->name);
4447 __initcall(slab_sysfs_init);
4451 * The /proc/slabinfo ABI
4453 #ifdef CONFIG_SLABINFO
4455 ssize_t slabinfo_write(struct file *file, const char __user * buffer,
4456 size_t count, loff_t *ppos)
4462 static void print_slabinfo_header(struct seq_file *m)
4464 seq_puts(m, "slabinfo - version: 2.1\n");
4465 seq_puts(m, "# name <active_objs> <num_objs> <objsize> "
4466 "<objperslab> <pagesperslab>");
4467 seq_puts(m, " : tunables <limit> <batchcount> <sharedfactor>");
4468 seq_puts(m, " : slabdata <active_slabs> <num_slabs> <sharedavail>");
4472 static void *s_start(struct seq_file *m, loff_t *pos)
4476 down_read(&slub_lock);
4478 print_slabinfo_header(m);
4480 return seq_list_start(&slab_caches, *pos);
4483 static void *s_next(struct seq_file *m, void *p, loff_t *pos)
4485 return seq_list_next(p, &slab_caches, pos);
4488 static void s_stop(struct seq_file *m, void *p)
4490 up_read(&slub_lock);
4493 static int s_show(struct seq_file *m, void *p)
4495 unsigned long nr_partials = 0;
4496 unsigned long nr_slabs = 0;
4497 unsigned long nr_inuse = 0;
4498 unsigned long nr_objs = 0;
4499 unsigned long nr_free = 0;
4500 struct kmem_cache *s;
4503 s = list_entry(p, struct kmem_cache, list);
4505 for_each_online_node(node) {
4506 struct kmem_cache_node *n = get_node(s, node);
4511 nr_partials += n->nr_partial;
4512 nr_slabs += atomic_long_read(&n->nr_slabs);
4513 nr_objs += atomic_long_read(&n->total_objects);
4514 nr_free += count_partial(n, count_free);
4517 nr_inuse = nr_objs - nr_free;
4519 seq_printf(m, "%-17s %6lu %6lu %6u %4u %4d", s->name, nr_inuse,
4520 nr_objs, s->size, oo_objects(s->oo),
4521 (1 << oo_order(s->oo)));
4522 seq_printf(m, " : tunables %4u %4u %4u", 0, 0, 0);
4523 seq_printf(m, " : slabdata %6lu %6lu %6lu", nr_slabs, nr_slabs,
4529 const struct seq_operations slabinfo_op = {
4536 #endif /* CONFIG_SLABINFO */