1 // SPDX-License-Identifier: GPL-2.0
3 * SLUB: A slab allocator that limits cache line use instead of queuing
4 * objects in per cpu and per node lists.
6 * The allocator synchronizes using per slab locks or atomic operations
7 * and only uses a centralized lock to manage a pool of partial slabs.
9 * (C) 2007 SGI, Christoph Lameter
10 * (C) 2011 Linux Foundation, Christoph Lameter
14 #include <linux/swap.h> /* struct reclaim_state */
15 #include <linux/module.h>
16 #include <linux/bit_spinlock.h>
17 #include <linux/interrupt.h>
18 #include <linux/swab.h>
19 #include <linux/bitops.h>
20 #include <linux/slab.h>
22 #include <linux/proc_fs.h>
23 #include <linux/seq_file.h>
24 #include <linux/kasan.h>
25 #include <linux/cpu.h>
26 #include <linux/cpuset.h>
27 #include <linux/mempolicy.h>
28 #include <linux/ctype.h>
29 #include <linux/debugobjects.h>
30 #include <linux/kallsyms.h>
31 #include <linux/kfence.h>
32 #include <linux/memory.h>
33 #include <linux/math64.h>
34 #include <linux/fault-inject.h>
35 #include <linux/stacktrace.h>
36 #include <linux/prefetch.h>
37 #include <linux/memcontrol.h>
38 #include <linux/random.h>
39 #include <kunit/test.h>
41 #include <linux/debugfs.h>
42 #include <trace/events/kmem.h>
48 * 1. slab_mutex (Global Mutex)
50 * 3. slab_lock(page) (Only on some arches and for debugging)
54 * The role of the slab_mutex is to protect the list of all the slabs
55 * and to synchronize major metadata changes to slab cache structures.
57 * The slab_lock is only used for debugging and on arches that do not
58 * have the ability to do a cmpxchg_double. It only protects:
59 * A. page->freelist -> List of object free in a page
60 * B. page->inuse -> Number of objects in use
61 * C. page->objects -> Number of objects in page
62 * D. page->frozen -> frozen state
64 * If a slab is frozen then it is exempt from list management. It is not
65 * on any list except per cpu partial list. The processor that froze the
66 * slab is the one who can perform list operations on the page. Other
67 * processors may put objects onto the freelist but the processor that
68 * froze the slab is the only one that can retrieve the objects from the
71 * The list_lock protects the partial and full list on each node and
72 * the partial slab counter. If taken then no new slabs may be added or
73 * removed from the lists nor make the number of partial slabs be modified.
74 * (Note that the total number of slabs is an atomic value that may be
75 * modified without taking the list lock).
77 * The list_lock is a centralized lock and thus we avoid taking it as
78 * much as possible. As long as SLUB does not have to handle partial
79 * slabs, operations can continue without any centralized lock. F.e.
80 * allocating a long series of objects that fill up slabs does not require
82 * Interrupts are disabled during allocation and deallocation in order to
83 * make the slab allocator safe to use in the context of an irq. In addition
84 * interrupts are disabled to ensure that the processor does not change
85 * while handling per_cpu slabs, due to kernel preemption.
87 * SLUB assigns one slab for allocation to each processor.
88 * Allocations only occur from these slabs called cpu slabs.
90 * Slabs with free elements are kept on a partial list and during regular
91 * operations no list for full slabs is used. If an object in a full slab is
92 * freed then the slab will show up again on the partial lists.
93 * We track full slabs for debugging purposes though because otherwise we
94 * cannot scan all objects.
96 * Slabs are freed when they become empty. Teardown and setup is
97 * minimal so we rely on the page allocators per cpu caches for
98 * fast frees and allocs.
100 * page->frozen The slab is frozen and exempt from list processing.
101 * This means that the slab is dedicated to a purpose
102 * such as satisfying allocations for a specific
103 * processor. Objects may be freed in the slab while
104 * it is frozen but slab_free will then skip the usual
105 * list operations. It is up to the processor holding
106 * the slab to integrate the slab into the slab lists
107 * when the slab is no longer needed.
109 * One use of this flag is to mark slabs that are
110 * used for allocations. Then such a slab becomes a cpu
111 * slab. The cpu slab may be equipped with an additional
112 * freelist that allows lockless access to
113 * free objects in addition to the regular freelist
114 * that requires the slab lock.
116 * SLAB_DEBUG_FLAGS Slab requires special handling due to debug
117 * options set. This moves slab handling out of
118 * the fast path and disables lockless freelists.
121 #ifdef CONFIG_SLUB_DEBUG
122 #ifdef CONFIG_SLUB_DEBUG_ON
123 DEFINE_STATIC_KEY_TRUE(slub_debug_enabled);
125 DEFINE_STATIC_KEY_FALSE(slub_debug_enabled);
127 #endif /* CONFIG_SLUB_DEBUG */
129 static inline bool kmem_cache_debug(struct kmem_cache *s)
131 return kmem_cache_debug_flags(s, SLAB_DEBUG_FLAGS);
134 void *fixup_red_left(struct kmem_cache *s, void *p)
136 if (kmem_cache_debug_flags(s, SLAB_RED_ZONE))
137 p += s->red_left_pad;
142 static inline bool kmem_cache_has_cpu_partial(struct kmem_cache *s)
144 #ifdef CONFIG_SLUB_CPU_PARTIAL
145 return !kmem_cache_debug(s);
152 * Issues still to be resolved:
154 * - Support PAGE_ALLOC_DEBUG. Should be easy to do.
156 * - Variable sizing of the per node arrays
159 /* Enable to log cmpxchg failures */
160 #undef SLUB_DEBUG_CMPXCHG
163 * Minimum number of partial slabs. These will be left on the partial
164 * lists even if they are empty. kmem_cache_shrink may reclaim them.
166 #define MIN_PARTIAL 5
169 * Maximum number of desirable partial slabs.
170 * The existence of more partial slabs makes kmem_cache_shrink
171 * sort the partial list by the number of objects in use.
173 #define MAX_PARTIAL 10
175 #define DEBUG_DEFAULT_FLAGS (SLAB_CONSISTENCY_CHECKS | SLAB_RED_ZONE | \
176 SLAB_POISON | SLAB_STORE_USER)
179 * These debug flags cannot use CMPXCHG because there might be consistency
180 * issues when checking or reading debug information
182 #define SLAB_NO_CMPXCHG (SLAB_CONSISTENCY_CHECKS | SLAB_STORE_USER | \
187 * Debugging flags that require metadata to be stored in the slab. These get
188 * disabled when slub_debug=O is used and a cache's min order increases with
191 #define DEBUG_METADATA_FLAGS (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER)
194 #define OO_MASK ((1 << OO_SHIFT) - 1)
195 #define MAX_OBJS_PER_PAGE 32767 /* since page.objects is u15 */
197 /* Internal SLUB flags */
199 #define __OBJECT_POISON ((slab_flags_t __force)0x80000000U)
200 /* Use cmpxchg_double */
201 #define __CMPXCHG_DOUBLE ((slab_flags_t __force)0x40000000U)
204 * Tracking user of a slab.
206 #define TRACK_ADDRS_COUNT 16
208 unsigned long addr; /* Called from address */
209 #ifdef CONFIG_STACKTRACE
210 unsigned long addrs[TRACK_ADDRS_COUNT]; /* Called from address */
212 int cpu; /* Was running on cpu */
213 int pid; /* Pid context */
214 unsigned long when; /* When did the operation occur */
217 enum track_item { TRACK_ALLOC, TRACK_FREE };
220 static int sysfs_slab_add(struct kmem_cache *);
221 static int sysfs_slab_alias(struct kmem_cache *, const char *);
223 static inline int sysfs_slab_add(struct kmem_cache *s) { return 0; }
224 static inline int sysfs_slab_alias(struct kmem_cache *s, const char *p)
228 #if defined(CONFIG_DEBUG_FS) && defined(CONFIG_SLUB_DEBUG)
229 static void debugfs_slab_add(struct kmem_cache *);
231 static inline void debugfs_slab_add(struct kmem_cache *s) { }
234 static inline void stat(const struct kmem_cache *s, enum stat_item si)
236 #ifdef CONFIG_SLUB_STATS
238 * The rmw is racy on a preemptible kernel but this is acceptable, so
239 * avoid this_cpu_add()'s irq-disable overhead.
241 raw_cpu_inc(s->cpu_slab->stat[si]);
246 * Tracks for which NUMA nodes we have kmem_cache_nodes allocated.
247 * Corresponds to node_state[N_NORMAL_MEMORY], but can temporarily
248 * differ during memory hotplug/hotremove operations.
249 * Protected by slab_mutex.
251 static nodemask_t slab_nodes;
253 /********************************************************************
254 * Core slab cache functions
255 *******************************************************************/
258 * Returns freelist pointer (ptr). With hardening, this is obfuscated
259 * with an XOR of the address where the pointer is held and a per-cache
262 static inline void *freelist_ptr(const struct kmem_cache *s, void *ptr,
263 unsigned long ptr_addr)
265 #ifdef CONFIG_SLAB_FREELIST_HARDENED
267 * When CONFIG_KASAN_SW/HW_TAGS is enabled, ptr_addr might be tagged.
268 * Normally, this doesn't cause any issues, as both set_freepointer()
269 * and get_freepointer() are called with a pointer with the same tag.
270 * However, there are some issues with CONFIG_SLUB_DEBUG code. For
271 * example, when __free_slub() iterates over objects in a cache, it
272 * passes untagged pointers to check_object(). check_object() in turns
273 * calls get_freepointer() with an untagged pointer, which causes the
274 * freepointer to be restored incorrectly.
276 return (void *)((unsigned long)ptr ^ s->random ^
277 swab((unsigned long)kasan_reset_tag((void *)ptr_addr)));
283 /* Returns the freelist pointer recorded at location ptr_addr. */
284 static inline void *freelist_dereference(const struct kmem_cache *s,
287 return freelist_ptr(s, (void *)*(unsigned long *)(ptr_addr),
288 (unsigned long)ptr_addr);
291 static inline void *get_freepointer(struct kmem_cache *s, void *object)
293 object = kasan_reset_tag(object);
294 return freelist_dereference(s, object + s->offset);
297 static void prefetch_freepointer(const struct kmem_cache *s, void *object)
299 prefetch(object + s->offset);
302 static inline void *get_freepointer_safe(struct kmem_cache *s, void *object)
304 unsigned long freepointer_addr;
307 if (!debug_pagealloc_enabled_static())
308 return get_freepointer(s, object);
310 object = kasan_reset_tag(object);
311 freepointer_addr = (unsigned long)object + s->offset;
312 copy_from_kernel_nofault(&p, (void **)freepointer_addr, sizeof(p));
313 return freelist_ptr(s, p, freepointer_addr);
316 static inline void set_freepointer(struct kmem_cache *s, void *object, void *fp)
318 unsigned long freeptr_addr = (unsigned long)object + s->offset;
320 #ifdef CONFIG_SLAB_FREELIST_HARDENED
321 BUG_ON(object == fp); /* naive detection of double free or corruption */
324 freeptr_addr = (unsigned long)kasan_reset_tag((void *)freeptr_addr);
325 *(void **)freeptr_addr = freelist_ptr(s, fp, freeptr_addr);
328 /* Loop over all objects in a slab */
329 #define for_each_object(__p, __s, __addr, __objects) \
330 for (__p = fixup_red_left(__s, __addr); \
331 __p < (__addr) + (__objects) * (__s)->size; \
334 static inline unsigned int order_objects(unsigned int order, unsigned int size)
336 return ((unsigned int)PAGE_SIZE << order) / size;
339 static inline struct kmem_cache_order_objects oo_make(unsigned int order,
342 struct kmem_cache_order_objects x = {
343 (order << OO_SHIFT) + order_objects(order, size)
349 static inline unsigned int oo_order(struct kmem_cache_order_objects x)
351 return x.x >> OO_SHIFT;
354 static inline unsigned int oo_objects(struct kmem_cache_order_objects x)
356 return x.x & OO_MASK;
360 * Per slab locking using the pagelock
362 static __always_inline void slab_lock(struct page *page)
364 VM_BUG_ON_PAGE(PageTail(page), page);
365 bit_spin_lock(PG_locked, &page->flags);
368 static __always_inline void slab_unlock(struct page *page)
370 VM_BUG_ON_PAGE(PageTail(page), page);
371 __bit_spin_unlock(PG_locked, &page->flags);
374 /* Interrupts must be disabled (for the fallback code to work right) */
375 static inline bool __cmpxchg_double_slab(struct kmem_cache *s, struct page *page,
376 void *freelist_old, unsigned long counters_old,
377 void *freelist_new, unsigned long counters_new,
380 VM_BUG_ON(!irqs_disabled());
381 #if defined(CONFIG_HAVE_CMPXCHG_DOUBLE) && \
382 defined(CONFIG_HAVE_ALIGNED_STRUCT_PAGE)
383 if (s->flags & __CMPXCHG_DOUBLE) {
384 if (cmpxchg_double(&page->freelist, &page->counters,
385 freelist_old, counters_old,
386 freelist_new, counters_new))
392 if (page->freelist == freelist_old &&
393 page->counters == counters_old) {
394 page->freelist = freelist_new;
395 page->counters = counters_new;
403 stat(s, CMPXCHG_DOUBLE_FAIL);
405 #ifdef SLUB_DEBUG_CMPXCHG
406 pr_info("%s %s: cmpxchg double redo ", n, s->name);
412 static inline bool cmpxchg_double_slab(struct kmem_cache *s, struct page *page,
413 void *freelist_old, unsigned long counters_old,
414 void *freelist_new, unsigned long counters_new,
417 #if defined(CONFIG_HAVE_CMPXCHG_DOUBLE) && \
418 defined(CONFIG_HAVE_ALIGNED_STRUCT_PAGE)
419 if (s->flags & __CMPXCHG_DOUBLE) {
420 if (cmpxchg_double(&page->freelist, &page->counters,
421 freelist_old, counters_old,
422 freelist_new, counters_new))
429 local_irq_save(flags);
431 if (page->freelist == freelist_old &&
432 page->counters == counters_old) {
433 page->freelist = freelist_new;
434 page->counters = counters_new;
436 local_irq_restore(flags);
440 local_irq_restore(flags);
444 stat(s, CMPXCHG_DOUBLE_FAIL);
446 #ifdef SLUB_DEBUG_CMPXCHG
447 pr_info("%s %s: cmpxchg double redo ", n, s->name);
453 #ifdef CONFIG_SLUB_DEBUG
454 static unsigned long object_map[BITS_TO_LONGS(MAX_OBJS_PER_PAGE)];
455 static DEFINE_SPINLOCK(object_map_lock);
457 static void __fill_map(unsigned long *obj_map, struct kmem_cache *s,
460 void *addr = page_address(page);
463 bitmap_zero(obj_map, page->objects);
465 for (p = page->freelist; p; p = get_freepointer(s, p))
466 set_bit(__obj_to_index(s, addr, p), obj_map);
469 #if IS_ENABLED(CONFIG_KUNIT)
470 static bool slab_add_kunit_errors(void)
472 struct kunit_resource *resource;
474 if (likely(!current->kunit_test))
477 resource = kunit_find_named_resource(current->kunit_test, "slab_errors");
481 (*(int *)resource->data)++;
482 kunit_put_resource(resource);
486 static inline bool slab_add_kunit_errors(void) { return false; }
490 * Determine a map of object in use on a page.
492 * Node listlock must be held to guarantee that the page does
493 * not vanish from under us.
495 static unsigned long *get_map(struct kmem_cache *s, struct page *page)
496 __acquires(&object_map_lock)
498 VM_BUG_ON(!irqs_disabled());
500 spin_lock(&object_map_lock);
502 __fill_map(object_map, s, page);
507 static void put_map(unsigned long *map) __releases(&object_map_lock)
509 VM_BUG_ON(map != object_map);
510 spin_unlock(&object_map_lock);
513 static inline unsigned int size_from_object(struct kmem_cache *s)
515 if (s->flags & SLAB_RED_ZONE)
516 return s->size - s->red_left_pad;
521 static inline void *restore_red_left(struct kmem_cache *s, void *p)
523 if (s->flags & SLAB_RED_ZONE)
524 p -= s->red_left_pad;
532 #if defined(CONFIG_SLUB_DEBUG_ON)
533 static slab_flags_t slub_debug = DEBUG_DEFAULT_FLAGS;
535 static slab_flags_t slub_debug;
538 static char *slub_debug_string;
539 static int disable_higher_order_debug;
542 * slub is about to manipulate internal object metadata. This memory lies
543 * outside the range of the allocated object, so accessing it would normally
544 * be reported by kasan as a bounds error. metadata_access_enable() is used
545 * to tell kasan that these accesses are OK.
547 static inline void metadata_access_enable(void)
549 kasan_disable_current();
552 static inline void metadata_access_disable(void)
554 kasan_enable_current();
561 /* Verify that a pointer has an address that is valid within a slab page */
562 static inline int check_valid_pointer(struct kmem_cache *s,
563 struct page *page, void *object)
570 base = page_address(page);
571 object = kasan_reset_tag(object);
572 object = restore_red_left(s, object);
573 if (object < base || object >= base + page->objects * s->size ||
574 (object - base) % s->size) {
581 static void print_section(char *level, char *text, u8 *addr,
584 metadata_access_enable();
585 print_hex_dump(level, text, DUMP_PREFIX_ADDRESS,
586 16, 1, kasan_reset_tag((void *)addr), length, 1);
587 metadata_access_disable();
591 * See comment in calculate_sizes().
593 static inline bool freeptr_outside_object(struct kmem_cache *s)
595 return s->offset >= s->inuse;
599 * Return offset of the end of info block which is inuse + free pointer if
600 * not overlapping with object.
602 static inline unsigned int get_info_end(struct kmem_cache *s)
604 if (freeptr_outside_object(s))
605 return s->inuse + sizeof(void *);
610 static struct track *get_track(struct kmem_cache *s, void *object,
611 enum track_item alloc)
615 p = object + get_info_end(s);
617 return kasan_reset_tag(p + alloc);
620 static void set_track(struct kmem_cache *s, void *object,
621 enum track_item alloc, unsigned long addr)
623 struct track *p = get_track(s, object, alloc);
626 #ifdef CONFIG_STACKTRACE
627 unsigned int nr_entries;
629 metadata_access_enable();
630 nr_entries = stack_trace_save(kasan_reset_tag(p->addrs),
631 TRACK_ADDRS_COUNT, 3);
632 metadata_access_disable();
634 if (nr_entries < TRACK_ADDRS_COUNT)
635 p->addrs[nr_entries] = 0;
638 p->cpu = smp_processor_id();
639 p->pid = current->pid;
642 memset(p, 0, sizeof(struct track));
646 static void init_tracking(struct kmem_cache *s, void *object)
648 if (!(s->flags & SLAB_STORE_USER))
651 set_track(s, object, TRACK_FREE, 0UL);
652 set_track(s, object, TRACK_ALLOC, 0UL);
655 static void print_track(const char *s, struct track *t, unsigned long pr_time)
660 pr_err("%s in %pS age=%lu cpu=%u pid=%d\n",
661 s, (void *)t->addr, pr_time - t->when, t->cpu, t->pid);
662 #ifdef CONFIG_STACKTRACE
665 for (i = 0; i < TRACK_ADDRS_COUNT; i++)
667 pr_err("\t%pS\n", (void *)t->addrs[i]);
674 void print_tracking(struct kmem_cache *s, void *object)
676 unsigned long pr_time = jiffies;
677 if (!(s->flags & SLAB_STORE_USER))
680 print_track("Allocated", get_track(s, object, TRACK_ALLOC), pr_time);
681 print_track("Freed", get_track(s, object, TRACK_FREE), pr_time);
684 static void print_page_info(struct page *page)
686 pr_err("Slab 0x%p objects=%u used=%u fp=0x%p flags=%#lx(%pGp)\n",
687 page, page->objects, page->inuse, page->freelist,
688 page->flags, &page->flags);
692 static void slab_bug(struct kmem_cache *s, char *fmt, ...)
694 struct va_format vaf;
700 pr_err("=============================================================================\n");
701 pr_err("BUG %s (%s): %pV\n", s->name, print_tainted(), &vaf);
702 pr_err("-----------------------------------------------------------------------------\n\n");
707 static void slab_fix(struct kmem_cache *s, char *fmt, ...)
709 struct va_format vaf;
712 if (slab_add_kunit_errors())
718 pr_err("FIX %s: %pV\n", s->name, &vaf);
722 static bool freelist_corrupted(struct kmem_cache *s, struct page *page,
723 void **freelist, void *nextfree)
725 if ((s->flags & SLAB_CONSISTENCY_CHECKS) &&
726 !check_valid_pointer(s, page, nextfree) && freelist) {
727 object_err(s, page, *freelist, "Freechain corrupt");
729 slab_fix(s, "Isolate corrupted freechain");
736 static void print_trailer(struct kmem_cache *s, struct page *page, u8 *p)
738 unsigned int off; /* Offset of last byte */
739 u8 *addr = page_address(page);
741 print_tracking(s, p);
743 print_page_info(page);
745 pr_err("Object 0x%p @offset=%tu fp=0x%p\n\n",
746 p, p - addr, get_freepointer(s, p));
748 if (s->flags & SLAB_RED_ZONE)
749 print_section(KERN_ERR, "Redzone ", p - s->red_left_pad,
751 else if (p > addr + 16)
752 print_section(KERN_ERR, "Bytes b4 ", p - 16, 16);
754 print_section(KERN_ERR, "Object ", p,
755 min_t(unsigned int, s->object_size, PAGE_SIZE));
756 if (s->flags & SLAB_RED_ZONE)
757 print_section(KERN_ERR, "Redzone ", p + s->object_size,
758 s->inuse - s->object_size);
760 off = get_info_end(s);
762 if (s->flags & SLAB_STORE_USER)
763 off += 2 * sizeof(struct track);
765 off += kasan_metadata_size(s);
767 if (off != size_from_object(s))
768 /* Beginning of the filler is the free pointer */
769 print_section(KERN_ERR, "Padding ", p + off,
770 size_from_object(s) - off);
775 void object_err(struct kmem_cache *s, struct page *page,
776 u8 *object, char *reason)
778 if (slab_add_kunit_errors())
781 slab_bug(s, "%s", reason);
782 print_trailer(s, page, object);
783 add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
786 static __printf(3, 4) void slab_err(struct kmem_cache *s, struct page *page,
787 const char *fmt, ...)
792 if (slab_add_kunit_errors())
796 vsnprintf(buf, sizeof(buf), fmt, args);
798 slab_bug(s, "%s", buf);
799 print_page_info(page);
801 add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
804 static void init_object(struct kmem_cache *s, void *object, u8 val)
806 u8 *p = kasan_reset_tag(object);
808 if (s->flags & SLAB_RED_ZONE)
809 memset(p - s->red_left_pad, val, s->red_left_pad);
811 if (s->flags & __OBJECT_POISON) {
812 memset(p, POISON_FREE, s->object_size - 1);
813 p[s->object_size - 1] = POISON_END;
816 if (s->flags & SLAB_RED_ZONE)
817 memset(p + s->object_size, val, s->inuse - s->object_size);
820 static void restore_bytes(struct kmem_cache *s, char *message, u8 data,
821 void *from, void *to)
823 slab_fix(s, "Restoring %s 0x%p-0x%p=0x%x", message, from, to - 1, data);
824 memset(from, data, to - from);
827 static int check_bytes_and_report(struct kmem_cache *s, struct page *page,
828 u8 *object, char *what,
829 u8 *start, unsigned int value, unsigned int bytes)
833 u8 *addr = page_address(page);
835 metadata_access_enable();
836 fault = memchr_inv(kasan_reset_tag(start), value, bytes);
837 metadata_access_disable();
842 while (end > fault && end[-1] == value)
845 if (slab_add_kunit_errors())
848 slab_bug(s, "%s overwritten", what);
849 pr_err("0x%p-0x%p @offset=%tu. First byte 0x%x instead of 0x%x\n",
850 fault, end - 1, fault - addr,
852 print_trailer(s, page, object);
853 add_taint(TAINT_BAD_PAGE, LOCKDEP_NOW_UNRELIABLE);
856 restore_bytes(s, what, value, fault, end);
864 * Bytes of the object to be managed.
865 * If the freepointer may overlay the object then the free
866 * pointer is at the middle of the object.
868 * Poisoning uses 0x6b (POISON_FREE) and the last byte is
871 * object + s->object_size
872 * Padding to reach word boundary. This is also used for Redzoning.
873 * Padding is extended by another word if Redzoning is enabled and
874 * object_size == inuse.
876 * We fill with 0xbb (RED_INACTIVE) for inactive objects and with
877 * 0xcc (RED_ACTIVE) for objects in use.
880 * Meta data starts here.
882 * A. Free pointer (if we cannot overwrite object on free)
883 * B. Tracking data for SLAB_STORE_USER
884 * C. Padding to reach required alignment boundary or at minimum
885 * one word if debugging is on to be able to detect writes
886 * before the word boundary.
888 * Padding is done using 0x5a (POISON_INUSE)
891 * Nothing is used beyond s->size.
893 * If slabcaches are merged then the object_size and inuse boundaries are mostly
894 * ignored. And therefore no slab options that rely on these boundaries
895 * may be used with merged slabcaches.
898 static int check_pad_bytes(struct kmem_cache *s, struct page *page, u8 *p)
900 unsigned long off = get_info_end(s); /* The end of info */
902 if (s->flags & SLAB_STORE_USER)
903 /* We also have user information there */
904 off += 2 * sizeof(struct track);
906 off += kasan_metadata_size(s);
908 if (size_from_object(s) == off)
911 return check_bytes_and_report(s, page, p, "Object padding",
912 p + off, POISON_INUSE, size_from_object(s) - off);
915 /* Check the pad bytes at the end of a slab page */
916 static int slab_pad_check(struct kmem_cache *s, struct page *page)
925 if (!(s->flags & SLAB_POISON))
928 start = page_address(page);
929 length = page_size(page);
930 end = start + length;
931 remainder = length % s->size;
935 pad = end - remainder;
936 metadata_access_enable();
937 fault = memchr_inv(kasan_reset_tag(pad), POISON_INUSE, remainder);
938 metadata_access_disable();
941 while (end > fault && end[-1] == POISON_INUSE)
944 slab_err(s, page, "Padding overwritten. 0x%p-0x%p @offset=%tu",
945 fault, end - 1, fault - start);
946 print_section(KERN_ERR, "Padding ", pad, remainder);
948 restore_bytes(s, "slab padding", POISON_INUSE, fault, end);
952 static int check_object(struct kmem_cache *s, struct page *page,
953 void *object, u8 val)
956 u8 *endobject = object + s->object_size;
958 if (s->flags & SLAB_RED_ZONE) {
959 if (!check_bytes_and_report(s, page, object, "Left Redzone",
960 object - s->red_left_pad, val, s->red_left_pad))
963 if (!check_bytes_and_report(s, page, object, "Right Redzone",
964 endobject, val, s->inuse - s->object_size))
967 if ((s->flags & SLAB_POISON) && s->object_size < s->inuse) {
968 check_bytes_and_report(s, page, p, "Alignment padding",
969 endobject, POISON_INUSE,
970 s->inuse - s->object_size);
974 if (s->flags & SLAB_POISON) {
975 if (val != SLUB_RED_ACTIVE && (s->flags & __OBJECT_POISON) &&
976 (!check_bytes_and_report(s, page, p, "Poison", p,
977 POISON_FREE, s->object_size - 1) ||
978 !check_bytes_and_report(s, page, p, "End Poison",
979 p + s->object_size - 1, POISON_END, 1)))
982 * check_pad_bytes cleans up on its own.
984 check_pad_bytes(s, page, p);
987 if (!freeptr_outside_object(s) && val == SLUB_RED_ACTIVE)
989 * Object and freepointer overlap. Cannot check
990 * freepointer while object is allocated.
994 /* Check free pointer validity */
995 if (!check_valid_pointer(s, page, get_freepointer(s, p))) {
996 object_err(s, page, p, "Freepointer corrupt");
998 * No choice but to zap it and thus lose the remainder
999 * of the free objects in this slab. May cause
1000 * another error because the object count is now wrong.
1002 set_freepointer(s, p, NULL);
1008 static int check_slab(struct kmem_cache *s, struct page *page)
1012 if (!PageSlab(page)) {
1013 slab_err(s, page, "Not a valid slab page");
1017 maxobj = order_objects(compound_order(page), s->size);
1018 if (page->objects > maxobj) {
1019 slab_err(s, page, "objects %u > max %u",
1020 page->objects, maxobj);
1023 if (page->inuse > page->objects) {
1024 slab_err(s, page, "inuse %u > max %u",
1025 page->inuse, page->objects);
1028 /* Slab_pad_check fixes things up after itself */
1029 slab_pad_check(s, page);
1034 * Determine if a certain object on a page is on the freelist. Must hold the
1035 * slab lock to guarantee that the chains are in a consistent state.
1037 static int on_freelist(struct kmem_cache *s, struct page *page, void *search)
1041 void *object = NULL;
1044 fp = page->freelist;
1045 while (fp && nr <= page->objects) {
1048 if (!check_valid_pointer(s, page, fp)) {
1050 object_err(s, page, object,
1051 "Freechain corrupt");
1052 set_freepointer(s, object, NULL);
1054 slab_err(s, page, "Freepointer corrupt");
1055 page->freelist = NULL;
1056 page->inuse = page->objects;
1057 slab_fix(s, "Freelist cleared");
1063 fp = get_freepointer(s, object);
1067 max_objects = order_objects(compound_order(page), s->size);
1068 if (max_objects > MAX_OBJS_PER_PAGE)
1069 max_objects = MAX_OBJS_PER_PAGE;
1071 if (page->objects != max_objects) {
1072 slab_err(s, page, "Wrong number of objects. Found %d but should be %d",
1073 page->objects, max_objects);
1074 page->objects = max_objects;
1075 slab_fix(s, "Number of objects adjusted");
1077 if (page->inuse != page->objects - nr) {
1078 slab_err(s, page, "Wrong object count. Counter is %d but counted were %d",
1079 page->inuse, page->objects - nr);
1080 page->inuse = page->objects - nr;
1081 slab_fix(s, "Object count adjusted");
1083 return search == NULL;
1086 static void trace(struct kmem_cache *s, struct page *page, void *object,
1089 if (s->flags & SLAB_TRACE) {
1090 pr_info("TRACE %s %s 0x%p inuse=%d fp=0x%p\n",
1092 alloc ? "alloc" : "free",
1093 object, page->inuse,
1097 print_section(KERN_INFO, "Object ", (void *)object,
1105 * Tracking of fully allocated slabs for debugging purposes.
1107 static void add_full(struct kmem_cache *s,
1108 struct kmem_cache_node *n, struct page *page)
1110 if (!(s->flags & SLAB_STORE_USER))
1113 lockdep_assert_held(&n->list_lock);
1114 list_add(&page->slab_list, &n->full);
1117 static void remove_full(struct kmem_cache *s, struct kmem_cache_node *n, struct page *page)
1119 if (!(s->flags & SLAB_STORE_USER))
1122 lockdep_assert_held(&n->list_lock);
1123 list_del(&page->slab_list);
1126 /* Tracking of the number of slabs for debugging purposes */
1127 static inline unsigned long slabs_node(struct kmem_cache *s, int node)
1129 struct kmem_cache_node *n = get_node(s, node);
1131 return atomic_long_read(&n->nr_slabs);
1134 static inline unsigned long node_nr_slabs(struct kmem_cache_node *n)
1136 return atomic_long_read(&n->nr_slabs);
1139 static inline void inc_slabs_node(struct kmem_cache *s, int node, int objects)
1141 struct kmem_cache_node *n = get_node(s, node);
1144 * May be called early in order to allocate a slab for the
1145 * kmem_cache_node structure. Solve the chicken-egg
1146 * dilemma by deferring the increment of the count during
1147 * bootstrap (see early_kmem_cache_node_alloc).
1150 atomic_long_inc(&n->nr_slabs);
1151 atomic_long_add(objects, &n->total_objects);
1154 static inline void dec_slabs_node(struct kmem_cache *s, int node, int objects)
1156 struct kmem_cache_node *n = get_node(s, node);
1158 atomic_long_dec(&n->nr_slabs);
1159 atomic_long_sub(objects, &n->total_objects);
1162 /* Object debug checks for alloc/free paths */
1163 static void setup_object_debug(struct kmem_cache *s, struct page *page,
1166 if (!kmem_cache_debug_flags(s, SLAB_STORE_USER|SLAB_RED_ZONE|__OBJECT_POISON))
1169 init_object(s, object, SLUB_RED_INACTIVE);
1170 init_tracking(s, object);
1174 void setup_page_debug(struct kmem_cache *s, struct page *page, void *addr)
1176 if (!kmem_cache_debug_flags(s, SLAB_POISON))
1179 metadata_access_enable();
1180 memset(kasan_reset_tag(addr), POISON_INUSE, page_size(page));
1181 metadata_access_disable();
1184 static inline int alloc_consistency_checks(struct kmem_cache *s,
1185 struct page *page, void *object)
1187 if (!check_slab(s, page))
1190 if (!check_valid_pointer(s, page, object)) {
1191 object_err(s, page, object, "Freelist Pointer check fails");
1195 if (!check_object(s, page, object, SLUB_RED_INACTIVE))
1201 static noinline int alloc_debug_processing(struct kmem_cache *s,
1203 void *object, unsigned long addr)
1205 if (s->flags & SLAB_CONSISTENCY_CHECKS) {
1206 if (!alloc_consistency_checks(s, page, object))
1210 /* Success perform special debug activities for allocs */
1211 if (s->flags & SLAB_STORE_USER)
1212 set_track(s, object, TRACK_ALLOC, addr);
1213 trace(s, page, object, 1);
1214 init_object(s, object, SLUB_RED_ACTIVE);
1218 if (PageSlab(page)) {
1220 * If this is a slab page then lets do the best we can
1221 * to avoid issues in the future. Marking all objects
1222 * as used avoids touching the remaining objects.
1224 slab_fix(s, "Marking all objects used");
1225 page->inuse = page->objects;
1226 page->freelist = NULL;
1231 static inline int free_consistency_checks(struct kmem_cache *s,
1232 struct page *page, void *object, unsigned long addr)
1234 if (!check_valid_pointer(s, page, object)) {
1235 slab_err(s, page, "Invalid object pointer 0x%p", object);
1239 if (on_freelist(s, page, object)) {
1240 object_err(s, page, object, "Object already free");
1244 if (!check_object(s, page, object, SLUB_RED_ACTIVE))
1247 if (unlikely(s != page->slab_cache)) {
1248 if (!PageSlab(page)) {
1249 slab_err(s, page, "Attempt to free object(0x%p) outside of slab",
1251 } else if (!page->slab_cache) {
1252 pr_err("SLUB <none>: no slab for object 0x%p.\n",
1256 object_err(s, page, object,
1257 "page slab pointer corrupt.");
1263 /* Supports checking bulk free of a constructed freelist */
1264 static noinline int free_debug_processing(
1265 struct kmem_cache *s, struct page *page,
1266 void *head, void *tail, int bulk_cnt,
1269 struct kmem_cache_node *n = get_node(s, page_to_nid(page));
1270 void *object = head;
1272 unsigned long flags;
1275 spin_lock_irqsave(&n->list_lock, flags);
1278 if (s->flags & SLAB_CONSISTENCY_CHECKS) {
1279 if (!check_slab(s, page))
1286 if (s->flags & SLAB_CONSISTENCY_CHECKS) {
1287 if (!free_consistency_checks(s, page, object, addr))
1291 if (s->flags & SLAB_STORE_USER)
1292 set_track(s, object, TRACK_FREE, addr);
1293 trace(s, page, object, 0);
1294 /* Freepointer not overwritten by init_object(), SLAB_POISON moved it */
1295 init_object(s, object, SLUB_RED_INACTIVE);
1297 /* Reached end of constructed freelist yet? */
1298 if (object != tail) {
1299 object = get_freepointer(s, object);
1305 if (cnt != bulk_cnt)
1306 slab_err(s, page, "Bulk freelist count(%d) invalid(%d)\n",
1310 spin_unlock_irqrestore(&n->list_lock, flags);
1312 slab_fix(s, "Object at 0x%p not freed", object);
1317 * Parse a block of slub_debug options. Blocks are delimited by ';'
1319 * @str: start of block
1320 * @flags: returns parsed flags, or DEBUG_DEFAULT_FLAGS if none specified
1321 * @slabs: return start of list of slabs, or NULL when there's no list
1322 * @init: assume this is initial parsing and not per-kmem-create parsing
1324 * returns the start of next block if there's any, or NULL
1327 parse_slub_debug_flags(char *str, slab_flags_t *flags, char **slabs, bool init)
1329 bool higher_order_disable = false;
1331 /* Skip any completely empty blocks */
1332 while (*str && *str == ';')
1337 * No options but restriction on slabs. This means full
1338 * debugging for slabs matching a pattern.
1340 *flags = DEBUG_DEFAULT_FLAGS;
1345 /* Determine which debug features should be switched on */
1346 for (; *str && *str != ',' && *str != ';'; str++) {
1347 switch (tolower(*str)) {
1352 *flags |= SLAB_CONSISTENCY_CHECKS;
1355 *flags |= SLAB_RED_ZONE;
1358 *flags |= SLAB_POISON;
1361 *flags |= SLAB_STORE_USER;
1364 *flags |= SLAB_TRACE;
1367 *flags |= SLAB_FAILSLAB;
1371 * Avoid enabling debugging on caches if its minimum
1372 * order would increase as a result.
1374 higher_order_disable = true;
1378 pr_err("slub_debug option '%c' unknown. skipped\n", *str);
1387 /* Skip over the slab list */
1388 while (*str && *str != ';')
1391 /* Skip any completely empty blocks */
1392 while (*str && *str == ';')
1395 if (init && higher_order_disable)
1396 disable_higher_order_debug = 1;
1404 static int __init setup_slub_debug(char *str)
1407 slab_flags_t global_flags;
1410 bool global_slub_debug_changed = false;
1411 bool slab_list_specified = false;
1413 global_flags = DEBUG_DEFAULT_FLAGS;
1414 if (*str++ != '=' || !*str)
1416 * No options specified. Switch on full debugging.
1422 str = parse_slub_debug_flags(str, &flags, &slab_list, true);
1425 global_flags = flags;
1426 global_slub_debug_changed = true;
1428 slab_list_specified = true;
1433 * For backwards compatibility, a single list of flags with list of
1434 * slabs means debugging is only changed for those slabs, so the global
1435 * slub_debug should be unchanged (0 or DEBUG_DEFAULT_FLAGS, depending
1436 * on CONFIG_SLUB_DEBUG_ON). We can extended that to multiple lists as
1437 * long as there is no option specifying flags without a slab list.
1439 if (slab_list_specified) {
1440 if (!global_slub_debug_changed)
1441 global_flags = slub_debug;
1442 slub_debug_string = saved_str;
1445 slub_debug = global_flags;
1446 if (slub_debug != 0 || slub_debug_string)
1447 static_branch_enable(&slub_debug_enabled);
1449 static_branch_disable(&slub_debug_enabled);
1450 if ((static_branch_unlikely(&init_on_alloc) ||
1451 static_branch_unlikely(&init_on_free)) &&
1452 (slub_debug & SLAB_POISON))
1453 pr_info("mem auto-init: SLAB_POISON will take precedence over init_on_alloc/init_on_free\n");
1457 __setup("slub_debug", setup_slub_debug);
1460 * kmem_cache_flags - apply debugging options to the cache
1461 * @object_size: the size of an object without meta data
1462 * @flags: flags to set
1463 * @name: name of the cache
1465 * Debug option(s) are applied to @flags. In addition to the debug
1466 * option(s), if a slab name (or multiple) is specified i.e.
1467 * slub_debug=<Debug-Options>,<slab name1>,<slab name2> ...
1468 * then only the select slabs will receive the debug option(s).
1470 slab_flags_t kmem_cache_flags(unsigned int object_size,
1471 slab_flags_t flags, const char *name)
1476 slab_flags_t block_flags;
1477 slab_flags_t slub_debug_local = slub_debug;
1480 * If the slab cache is for debugging (e.g. kmemleak) then
1481 * don't store user (stack trace) information by default,
1482 * but let the user enable it via the command line below.
1484 if (flags & SLAB_NOLEAKTRACE)
1485 slub_debug_local &= ~SLAB_STORE_USER;
1488 next_block = slub_debug_string;
1489 /* Go through all blocks of debug options, see if any matches our slab's name */
1490 while (next_block) {
1491 next_block = parse_slub_debug_flags(next_block, &block_flags, &iter, false);
1494 /* Found a block that has a slab list, search it */
1499 end = strchrnul(iter, ',');
1500 if (next_block && next_block < end)
1501 end = next_block - 1;
1503 glob = strnchr(iter, end - iter, '*');
1505 cmplen = glob - iter;
1507 cmplen = max_t(size_t, len, (end - iter));
1509 if (!strncmp(name, iter, cmplen)) {
1510 flags |= block_flags;
1514 if (!*end || *end == ';')
1520 return flags | slub_debug_local;
1522 #else /* !CONFIG_SLUB_DEBUG */
1523 static inline void setup_object_debug(struct kmem_cache *s,
1524 struct page *page, void *object) {}
1526 void setup_page_debug(struct kmem_cache *s, struct page *page, void *addr) {}
1528 static inline int alloc_debug_processing(struct kmem_cache *s,
1529 struct page *page, void *object, unsigned long addr) { return 0; }
1531 static inline int free_debug_processing(
1532 struct kmem_cache *s, struct page *page,
1533 void *head, void *tail, int bulk_cnt,
1534 unsigned long addr) { return 0; }
1536 static inline int slab_pad_check(struct kmem_cache *s, struct page *page)
1538 static inline int check_object(struct kmem_cache *s, struct page *page,
1539 void *object, u8 val) { return 1; }
1540 static inline void add_full(struct kmem_cache *s, struct kmem_cache_node *n,
1541 struct page *page) {}
1542 static inline void remove_full(struct kmem_cache *s, struct kmem_cache_node *n,
1543 struct page *page) {}
1544 slab_flags_t kmem_cache_flags(unsigned int object_size,
1545 slab_flags_t flags, const char *name)
1549 #define slub_debug 0
1551 #define disable_higher_order_debug 0
1553 static inline unsigned long slabs_node(struct kmem_cache *s, int node)
1555 static inline unsigned long node_nr_slabs(struct kmem_cache_node *n)
1557 static inline void inc_slabs_node(struct kmem_cache *s, int node,
1559 static inline void dec_slabs_node(struct kmem_cache *s, int node,
1562 static bool freelist_corrupted(struct kmem_cache *s, struct page *page,
1563 void **freelist, void *nextfree)
1567 #endif /* CONFIG_SLUB_DEBUG */
1570 * Hooks for other subsystems that check memory allocations. In a typical
1571 * production configuration these hooks all should produce no code at all.
1573 static inline void *kmalloc_large_node_hook(void *ptr, size_t size, gfp_t flags)
1575 ptr = kasan_kmalloc_large(ptr, size, flags);
1576 /* As ptr might get tagged, call kmemleak hook after KASAN. */
1577 kmemleak_alloc(ptr, size, 1, flags);
1581 static __always_inline void kfree_hook(void *x)
1584 kasan_kfree_large(x);
1587 static __always_inline bool slab_free_hook(struct kmem_cache *s,
1590 kmemleak_free_recursive(x, s->flags);
1592 debug_check_no_locks_freed(x, s->object_size);
1594 if (!(s->flags & SLAB_DEBUG_OBJECTS))
1595 debug_check_no_obj_freed(x, s->object_size);
1597 /* Use KCSAN to help debug racy use-after-free. */
1598 if (!(s->flags & SLAB_TYPESAFE_BY_RCU))
1599 __kcsan_check_access(x, s->object_size,
1600 KCSAN_ACCESS_WRITE | KCSAN_ACCESS_ASSERT);
1603 * As memory initialization might be integrated into KASAN,
1604 * kasan_slab_free and initialization memset's must be
1605 * kept together to avoid discrepancies in behavior.
1607 * The initialization memset's clear the object and the metadata,
1608 * but don't touch the SLAB redzone.
1613 if (!kasan_has_integrated_init())
1614 memset(kasan_reset_tag(x), 0, s->object_size);
1615 rsize = (s->flags & SLAB_RED_ZONE) ? s->red_left_pad : 0;
1616 memset((char *)kasan_reset_tag(x) + s->inuse, 0,
1617 s->size - s->inuse - rsize);
1619 /* KASAN might put x into memory quarantine, delaying its reuse. */
1620 return kasan_slab_free(s, x, init);
1623 static inline bool slab_free_freelist_hook(struct kmem_cache *s,
1624 void **head, void **tail)
1629 void *old_tail = *tail ? *tail : *head;
1631 if (is_kfence_address(next)) {
1632 slab_free_hook(s, next, false);
1636 /* Head and tail of the reconstructed freelist */
1642 next = get_freepointer(s, object);
1644 /* If object's reuse doesn't have to be delayed */
1645 if (!slab_free_hook(s, object, slab_want_init_on_free(s))) {
1646 /* Move object to the new freelist */
1647 set_freepointer(s, object, *head);
1652 } while (object != old_tail);
1657 return *head != NULL;
1660 static void *setup_object(struct kmem_cache *s, struct page *page,
1663 setup_object_debug(s, page, object);
1664 object = kasan_init_slab_obj(s, object);
1665 if (unlikely(s->ctor)) {
1666 kasan_unpoison_object_data(s, object);
1668 kasan_poison_object_data(s, object);
1674 * Slab allocation and freeing
1676 static inline struct page *alloc_slab_page(struct kmem_cache *s,
1677 gfp_t flags, int node, struct kmem_cache_order_objects oo)
1680 unsigned int order = oo_order(oo);
1682 if (node == NUMA_NO_NODE)
1683 page = alloc_pages(flags, order);
1685 page = __alloc_pages_node(node, flags, order);
1690 #ifdef CONFIG_SLAB_FREELIST_RANDOM
1691 /* Pre-initialize the random sequence cache */
1692 static int init_cache_random_seq(struct kmem_cache *s)
1694 unsigned int count = oo_objects(s->oo);
1697 /* Bailout if already initialised */
1701 err = cache_random_seq_create(s, count, GFP_KERNEL);
1703 pr_err("SLUB: Unable to initialize free list for %s\n",
1708 /* Transform to an offset on the set of pages */
1709 if (s->random_seq) {
1712 for (i = 0; i < count; i++)
1713 s->random_seq[i] *= s->size;
1718 /* Initialize each random sequence freelist per cache */
1719 static void __init init_freelist_randomization(void)
1721 struct kmem_cache *s;
1723 mutex_lock(&slab_mutex);
1725 list_for_each_entry(s, &slab_caches, list)
1726 init_cache_random_seq(s);
1728 mutex_unlock(&slab_mutex);
1731 /* Get the next entry on the pre-computed freelist randomized */
1732 static void *next_freelist_entry(struct kmem_cache *s, struct page *page,
1733 unsigned long *pos, void *start,
1734 unsigned long page_limit,
1735 unsigned long freelist_count)
1740 * If the target page allocation failed, the number of objects on the
1741 * page might be smaller than the usual size defined by the cache.
1744 idx = s->random_seq[*pos];
1746 if (*pos >= freelist_count)
1748 } while (unlikely(idx >= page_limit));
1750 return (char *)start + idx;
1753 /* Shuffle the single linked freelist based on a random pre-computed sequence */
1754 static bool shuffle_freelist(struct kmem_cache *s, struct page *page)
1759 unsigned long idx, pos, page_limit, freelist_count;
1761 if (page->objects < 2 || !s->random_seq)
1764 freelist_count = oo_objects(s->oo);
1765 pos = get_random_int() % freelist_count;
1767 page_limit = page->objects * s->size;
1768 start = fixup_red_left(s, page_address(page));
1770 /* First entry is used as the base of the freelist */
1771 cur = next_freelist_entry(s, page, &pos, start, page_limit,
1773 cur = setup_object(s, page, cur);
1774 page->freelist = cur;
1776 for (idx = 1; idx < page->objects; idx++) {
1777 next = next_freelist_entry(s, page, &pos, start, page_limit,
1779 next = setup_object(s, page, next);
1780 set_freepointer(s, cur, next);
1783 set_freepointer(s, cur, NULL);
1788 static inline int init_cache_random_seq(struct kmem_cache *s)
1792 static inline void init_freelist_randomization(void) { }
1793 static inline bool shuffle_freelist(struct kmem_cache *s, struct page *page)
1797 #endif /* CONFIG_SLAB_FREELIST_RANDOM */
1799 static struct page *allocate_slab(struct kmem_cache *s, gfp_t flags, int node)
1802 struct kmem_cache_order_objects oo = s->oo;
1804 void *start, *p, *next;
1808 flags &= gfp_allowed_mask;
1810 flags |= s->allocflags;
1813 * Let the initial higher-order allocation fail under memory pressure
1814 * so we fall-back to the minimum order allocation.
1816 alloc_gfp = (flags | __GFP_NOWARN | __GFP_NORETRY) & ~__GFP_NOFAIL;
1817 if ((alloc_gfp & __GFP_DIRECT_RECLAIM) && oo_order(oo) > oo_order(s->min))
1818 alloc_gfp = (alloc_gfp | __GFP_NOMEMALLOC) & ~(__GFP_RECLAIM|__GFP_NOFAIL);
1820 page = alloc_slab_page(s, alloc_gfp, node, oo);
1821 if (unlikely(!page)) {
1825 * Allocation may have failed due to fragmentation.
1826 * Try a lower order alloc if possible
1828 page = alloc_slab_page(s, alloc_gfp, node, oo);
1829 if (unlikely(!page))
1831 stat(s, ORDER_FALLBACK);
1834 page->objects = oo_objects(oo);
1836 account_slab_page(page, oo_order(oo), s, flags);
1838 page->slab_cache = s;
1839 __SetPageSlab(page);
1840 if (page_is_pfmemalloc(page))
1841 SetPageSlabPfmemalloc(page);
1843 kasan_poison_slab(page);
1845 start = page_address(page);
1847 setup_page_debug(s, page, start);
1849 shuffle = shuffle_freelist(s, page);
1852 start = fixup_red_left(s, start);
1853 start = setup_object(s, page, start);
1854 page->freelist = start;
1855 for (idx = 0, p = start; idx < page->objects - 1; idx++) {
1857 next = setup_object(s, page, next);
1858 set_freepointer(s, p, next);
1861 set_freepointer(s, p, NULL);
1864 page->inuse = page->objects;
1871 inc_slabs_node(s, page_to_nid(page), page->objects);
1876 static struct page *new_slab(struct kmem_cache *s, gfp_t flags, int node)
1878 if (unlikely(flags & GFP_SLAB_BUG_MASK))
1879 flags = kmalloc_fix_flags(flags);
1881 WARN_ON_ONCE(s->ctor && (flags & __GFP_ZERO));
1883 return allocate_slab(s,
1884 flags & (GFP_RECLAIM_MASK | GFP_CONSTRAINT_MASK), node);
1887 static void __free_slab(struct kmem_cache *s, struct page *page)
1889 int order = compound_order(page);
1890 int pages = 1 << order;
1892 if (kmem_cache_debug_flags(s, SLAB_CONSISTENCY_CHECKS)) {
1895 slab_pad_check(s, page);
1896 for_each_object(p, s, page_address(page),
1898 check_object(s, page, p, SLUB_RED_INACTIVE);
1901 __ClearPageSlabPfmemalloc(page);
1902 __ClearPageSlab(page);
1903 /* In union with page->mapping where page allocator expects NULL */
1904 page->slab_cache = NULL;
1905 if (current->reclaim_state)
1906 current->reclaim_state->reclaimed_slab += pages;
1907 unaccount_slab_page(page, order, s);
1908 __free_pages(page, order);
1911 static void rcu_free_slab(struct rcu_head *h)
1913 struct page *page = container_of(h, struct page, rcu_head);
1915 __free_slab(page->slab_cache, page);
1918 static void free_slab(struct kmem_cache *s, struct page *page)
1920 if (unlikely(s->flags & SLAB_TYPESAFE_BY_RCU)) {
1921 call_rcu(&page->rcu_head, rcu_free_slab);
1923 __free_slab(s, page);
1926 static void discard_slab(struct kmem_cache *s, struct page *page)
1928 dec_slabs_node(s, page_to_nid(page), page->objects);
1933 * Management of partially allocated slabs.
1936 __add_partial(struct kmem_cache_node *n, struct page *page, int tail)
1939 if (tail == DEACTIVATE_TO_TAIL)
1940 list_add_tail(&page->slab_list, &n->partial);
1942 list_add(&page->slab_list, &n->partial);
1945 static inline void add_partial(struct kmem_cache_node *n,
1946 struct page *page, int tail)
1948 lockdep_assert_held(&n->list_lock);
1949 __add_partial(n, page, tail);
1952 static inline void remove_partial(struct kmem_cache_node *n,
1955 lockdep_assert_held(&n->list_lock);
1956 list_del(&page->slab_list);
1961 * Remove slab from the partial list, freeze it and
1962 * return the pointer to the freelist.
1964 * Returns a list of objects or NULL if it fails.
1966 static inline void *acquire_slab(struct kmem_cache *s,
1967 struct kmem_cache_node *n, struct page *page,
1968 int mode, int *objects)
1971 unsigned long counters;
1974 lockdep_assert_held(&n->list_lock);
1977 * Zap the freelist and set the frozen bit.
1978 * The old freelist is the list of objects for the
1979 * per cpu allocation list.
1981 freelist = page->freelist;
1982 counters = page->counters;
1983 new.counters = counters;
1984 *objects = new.objects - new.inuse;
1986 new.inuse = page->objects;
1987 new.freelist = NULL;
1989 new.freelist = freelist;
1992 VM_BUG_ON(new.frozen);
1995 if (!__cmpxchg_double_slab(s, page,
1997 new.freelist, new.counters,
2001 remove_partial(n, page);
2006 static void put_cpu_partial(struct kmem_cache *s, struct page *page, int drain);
2007 static inline bool pfmemalloc_match(struct page *page, gfp_t gfpflags);
2010 * Try to allocate a partial slab from a specific node.
2012 static void *get_partial_node(struct kmem_cache *s, struct kmem_cache_node *n,
2013 struct page **ret_page, gfp_t gfpflags)
2015 struct page *page, *page2;
2016 void *object = NULL;
2017 unsigned int available = 0;
2018 unsigned long flags;
2022 * Racy check. If we mistakenly see no partial slabs then we
2023 * just allocate an empty slab. If we mistakenly try to get a
2024 * partial slab and there is none available then get_partial()
2027 if (!n || !n->nr_partial)
2030 spin_lock_irqsave(&n->list_lock, flags);
2031 list_for_each_entry_safe(page, page2, &n->partial, slab_list) {
2034 if (!pfmemalloc_match(page, gfpflags))
2037 t = acquire_slab(s, n, page, object == NULL, &objects);
2041 available += objects;
2044 stat(s, ALLOC_FROM_PARTIAL);
2047 put_cpu_partial(s, page, 0);
2048 stat(s, CPU_PARTIAL_NODE);
2050 if (!kmem_cache_has_cpu_partial(s)
2051 || available > slub_cpu_partial(s) / 2)
2055 spin_unlock_irqrestore(&n->list_lock, flags);
2060 * Get a page from somewhere. Search in increasing NUMA distances.
2062 static void *get_any_partial(struct kmem_cache *s, gfp_t flags,
2063 struct page **ret_page)
2066 struct zonelist *zonelist;
2069 enum zone_type highest_zoneidx = gfp_zone(flags);
2071 unsigned int cpuset_mems_cookie;
2074 * The defrag ratio allows a configuration of the tradeoffs between
2075 * inter node defragmentation and node local allocations. A lower
2076 * defrag_ratio increases the tendency to do local allocations
2077 * instead of attempting to obtain partial slabs from other nodes.
2079 * If the defrag_ratio is set to 0 then kmalloc() always
2080 * returns node local objects. If the ratio is higher then kmalloc()
2081 * may return off node objects because partial slabs are obtained
2082 * from other nodes and filled up.
2084 * If /sys/kernel/slab/xx/remote_node_defrag_ratio is set to 100
2085 * (which makes defrag_ratio = 1000) then every (well almost)
2086 * allocation will first attempt to defrag slab caches on other nodes.
2087 * This means scanning over all nodes to look for partial slabs which
2088 * may be expensive if we do it every time we are trying to find a slab
2089 * with available objects.
2091 if (!s->remote_node_defrag_ratio ||
2092 get_cycles() % 1024 > s->remote_node_defrag_ratio)
2096 cpuset_mems_cookie = read_mems_allowed_begin();
2097 zonelist = node_zonelist(mempolicy_slab_node(), flags);
2098 for_each_zone_zonelist(zone, z, zonelist, highest_zoneidx) {
2099 struct kmem_cache_node *n;
2101 n = get_node(s, zone_to_nid(zone));
2103 if (n && cpuset_zone_allowed(zone, flags) &&
2104 n->nr_partial > s->min_partial) {
2105 object = get_partial_node(s, n, ret_page, flags);
2108 * Don't check read_mems_allowed_retry()
2109 * here - if mems_allowed was updated in
2110 * parallel, that was a harmless race
2111 * between allocation and the cpuset
2118 } while (read_mems_allowed_retry(cpuset_mems_cookie));
2119 #endif /* CONFIG_NUMA */
2124 * Get a partial page, lock it and return it.
2126 static void *get_partial(struct kmem_cache *s, gfp_t flags, int node,
2127 struct page **ret_page)
2130 int searchnode = node;
2132 if (node == NUMA_NO_NODE)
2133 searchnode = numa_mem_id();
2135 object = get_partial_node(s, get_node(s, searchnode), ret_page, flags);
2136 if (object || node != NUMA_NO_NODE)
2139 return get_any_partial(s, flags, ret_page);
2142 #ifdef CONFIG_PREEMPTION
2144 * Calculate the next globally unique transaction for disambiguation
2145 * during cmpxchg. The transactions start with the cpu number and are then
2146 * incremented by CONFIG_NR_CPUS.
2148 #define TID_STEP roundup_pow_of_two(CONFIG_NR_CPUS)
2151 * No preemption supported therefore also no need to check for
2157 static inline unsigned long next_tid(unsigned long tid)
2159 return tid + TID_STEP;
2162 #ifdef SLUB_DEBUG_CMPXCHG
2163 static inline unsigned int tid_to_cpu(unsigned long tid)
2165 return tid % TID_STEP;
2168 static inline unsigned long tid_to_event(unsigned long tid)
2170 return tid / TID_STEP;
2174 static inline unsigned int init_tid(int cpu)
2179 static inline void note_cmpxchg_failure(const char *n,
2180 const struct kmem_cache *s, unsigned long tid)
2182 #ifdef SLUB_DEBUG_CMPXCHG
2183 unsigned long actual_tid = __this_cpu_read(s->cpu_slab->tid);
2185 pr_info("%s %s: cmpxchg redo ", n, s->name);
2187 #ifdef CONFIG_PREEMPTION
2188 if (tid_to_cpu(tid) != tid_to_cpu(actual_tid))
2189 pr_warn("due to cpu change %d -> %d\n",
2190 tid_to_cpu(tid), tid_to_cpu(actual_tid));
2193 if (tid_to_event(tid) != tid_to_event(actual_tid))
2194 pr_warn("due to cpu running other code. Event %ld->%ld\n",
2195 tid_to_event(tid), tid_to_event(actual_tid));
2197 pr_warn("for unknown reason: actual=%lx was=%lx target=%lx\n",
2198 actual_tid, tid, next_tid(tid));
2200 stat(s, CMPXCHG_DOUBLE_CPU_FAIL);
2203 static void init_kmem_cache_cpus(struct kmem_cache *s)
2207 for_each_possible_cpu(cpu)
2208 per_cpu_ptr(s->cpu_slab, cpu)->tid = init_tid(cpu);
2212 * Finishes removing the cpu slab. Merges cpu's freelist with page's freelist,
2213 * unfreezes the slabs and puts it on the proper list.
2214 * Assumes the slab has been already safely taken away from kmem_cache_cpu
2217 static void deactivate_slab(struct kmem_cache *s, struct page *page,
2220 enum slab_modes { M_NONE, M_PARTIAL, M_FULL, M_FREE };
2221 struct kmem_cache_node *n = get_node(s, page_to_nid(page));
2222 int lock = 0, free_delta = 0;
2223 enum slab_modes l = M_NONE, m = M_NONE;
2224 void *nextfree, *freelist_iter, *freelist_tail;
2225 int tail = DEACTIVATE_TO_HEAD;
2226 unsigned long flags = 0;
2230 if (page->freelist) {
2231 stat(s, DEACTIVATE_REMOTE_FREES);
2232 tail = DEACTIVATE_TO_TAIL;
2236 * Stage one: Count the objects on cpu's freelist as free_delta and
2237 * remember the last object in freelist_tail for later splicing.
2239 freelist_tail = NULL;
2240 freelist_iter = freelist;
2241 while (freelist_iter) {
2242 nextfree = get_freepointer(s, freelist_iter);
2245 * If 'nextfree' is invalid, it is possible that the object at
2246 * 'freelist_iter' is already corrupted. So isolate all objects
2247 * starting at 'freelist_iter' by skipping them.
2249 if (freelist_corrupted(s, page, &freelist_iter, nextfree))
2252 freelist_tail = freelist_iter;
2255 freelist_iter = nextfree;
2259 * Stage two: Unfreeze the page while splicing the per-cpu
2260 * freelist to the head of page's freelist.
2262 * Ensure that the page is unfrozen while the list presence
2263 * reflects the actual number of objects during unfreeze.
2265 * We setup the list membership and then perform a cmpxchg
2266 * with the count. If there is a mismatch then the page
2267 * is not unfrozen but the page is on the wrong list.
2269 * Then we restart the process which may have to remove
2270 * the page from the list that we just put it on again
2271 * because the number of objects in the slab may have
2276 old.freelist = READ_ONCE(page->freelist);
2277 old.counters = READ_ONCE(page->counters);
2278 VM_BUG_ON(!old.frozen);
2280 /* Determine target state of the slab */
2281 new.counters = old.counters;
2282 if (freelist_tail) {
2283 new.inuse -= free_delta;
2284 set_freepointer(s, freelist_tail, old.freelist);
2285 new.freelist = freelist;
2287 new.freelist = old.freelist;
2291 if (!new.inuse && n->nr_partial >= s->min_partial)
2293 else if (new.freelist) {
2298 * Taking the spinlock removes the possibility
2299 * that acquire_slab() will see a slab page that
2302 spin_lock_irqsave(&n->list_lock, flags);
2306 if (kmem_cache_debug_flags(s, SLAB_STORE_USER) && !lock) {
2309 * This also ensures that the scanning of full
2310 * slabs from diagnostic functions will not see
2313 spin_lock_irqsave(&n->list_lock, flags);
2319 remove_partial(n, page);
2320 else if (l == M_FULL)
2321 remove_full(s, n, page);
2324 add_partial(n, page, tail);
2325 else if (m == M_FULL)
2326 add_full(s, n, page);
2330 if (!cmpxchg_double_slab(s, page,
2331 old.freelist, old.counters,
2332 new.freelist, new.counters,
2337 spin_unlock_irqrestore(&n->list_lock, flags);
2341 else if (m == M_FULL)
2342 stat(s, DEACTIVATE_FULL);
2343 else if (m == M_FREE) {
2344 stat(s, DEACTIVATE_EMPTY);
2345 discard_slab(s, page);
2351 * Unfreeze all the cpu partial slabs.
2353 * This function must be called with interrupts disabled
2354 * for the cpu using c (or some other guarantee must be there
2355 * to guarantee no concurrent accesses).
2357 static void unfreeze_partials(struct kmem_cache *s,
2358 struct kmem_cache_cpu *c)
2360 #ifdef CONFIG_SLUB_CPU_PARTIAL
2361 struct kmem_cache_node *n = NULL, *n2 = NULL;
2362 struct page *page, *discard_page = NULL;
2364 while ((page = slub_percpu_partial(c))) {
2368 slub_set_percpu_partial(c, page);
2370 n2 = get_node(s, page_to_nid(page));
2373 spin_unlock(&n->list_lock);
2376 spin_lock(&n->list_lock);
2381 old.freelist = page->freelist;
2382 old.counters = page->counters;
2383 VM_BUG_ON(!old.frozen);
2385 new.counters = old.counters;
2386 new.freelist = old.freelist;
2390 } while (!__cmpxchg_double_slab(s, page,
2391 old.freelist, old.counters,
2392 new.freelist, new.counters,
2393 "unfreezing slab"));
2395 if (unlikely(!new.inuse && n->nr_partial >= s->min_partial)) {
2396 page->next = discard_page;
2397 discard_page = page;
2399 add_partial(n, page, DEACTIVATE_TO_TAIL);
2400 stat(s, FREE_ADD_PARTIAL);
2405 spin_unlock(&n->list_lock);
2407 while (discard_page) {
2408 page = discard_page;
2409 discard_page = discard_page->next;
2411 stat(s, DEACTIVATE_EMPTY);
2412 discard_slab(s, page);
2415 #endif /* CONFIG_SLUB_CPU_PARTIAL */
2419 * Put a page that was just frozen (in __slab_free|get_partial_node) into a
2420 * partial page slot if available.
2422 * If we did not find a slot then simply move all the partials to the
2423 * per node partial list.
2425 static void put_cpu_partial(struct kmem_cache *s, struct page *page, int drain)
2427 #ifdef CONFIG_SLUB_CPU_PARTIAL
2428 struct page *oldpage;
2436 oldpage = this_cpu_read(s->cpu_slab->partial);
2439 pobjects = oldpage->pobjects;
2440 pages = oldpage->pages;
2441 if (drain && pobjects > slub_cpu_partial(s)) {
2442 unsigned long flags;
2444 * partial array is full. Move the existing
2445 * set to the per node partial list.
2447 local_irq_save(flags);
2448 unfreeze_partials(s, this_cpu_ptr(s->cpu_slab));
2449 local_irq_restore(flags);
2453 stat(s, CPU_PARTIAL_DRAIN);
2458 pobjects += page->objects - page->inuse;
2460 page->pages = pages;
2461 page->pobjects = pobjects;
2462 page->next = oldpage;
2464 } while (this_cpu_cmpxchg(s->cpu_slab->partial, oldpage, page)
2467 #endif /* CONFIG_SLUB_CPU_PARTIAL */
2470 static inline void flush_slab(struct kmem_cache *s, struct kmem_cache_cpu *c)
2472 void *freelist = c->freelist;
2473 struct page *page = c->page;
2477 c->tid = next_tid(c->tid);
2479 deactivate_slab(s, page, freelist);
2481 stat(s, CPUSLAB_FLUSH);
2487 * Called from IPI handler with interrupts disabled.
2489 static inline void __flush_cpu_slab(struct kmem_cache *s, int cpu)
2491 struct kmem_cache_cpu *c = per_cpu_ptr(s->cpu_slab, cpu);
2496 unfreeze_partials(s, c);
2499 static void flush_cpu_slab(void *d)
2501 struct kmem_cache *s = d;
2503 __flush_cpu_slab(s, smp_processor_id());
2506 static bool has_cpu_slab(int cpu, void *info)
2508 struct kmem_cache *s = info;
2509 struct kmem_cache_cpu *c = per_cpu_ptr(s->cpu_slab, cpu);
2511 return c->page || slub_percpu_partial(c);
2514 static void flush_all(struct kmem_cache *s)
2516 on_each_cpu_cond(has_cpu_slab, flush_cpu_slab, s, 1);
2520 * Use the cpu notifier to insure that the cpu slabs are flushed when
2523 static int slub_cpu_dead(unsigned int cpu)
2525 struct kmem_cache *s;
2526 unsigned long flags;
2528 mutex_lock(&slab_mutex);
2529 list_for_each_entry(s, &slab_caches, list) {
2530 local_irq_save(flags);
2531 __flush_cpu_slab(s, cpu);
2532 local_irq_restore(flags);
2534 mutex_unlock(&slab_mutex);
2539 * Check if the objects in a per cpu structure fit numa
2540 * locality expectations.
2542 static inline int node_match(struct page *page, int node)
2545 if (node != NUMA_NO_NODE && page_to_nid(page) != node)
2551 #ifdef CONFIG_SLUB_DEBUG
2552 static int count_free(struct page *page)
2554 return page->objects - page->inuse;
2557 static inline unsigned long node_nr_objs(struct kmem_cache_node *n)
2559 return atomic_long_read(&n->total_objects);
2561 #endif /* CONFIG_SLUB_DEBUG */
2563 #if defined(CONFIG_SLUB_DEBUG) || defined(CONFIG_SYSFS)
2564 static unsigned long count_partial(struct kmem_cache_node *n,
2565 int (*get_count)(struct page *))
2567 unsigned long flags;
2568 unsigned long x = 0;
2571 spin_lock_irqsave(&n->list_lock, flags);
2572 list_for_each_entry(page, &n->partial, slab_list)
2573 x += get_count(page);
2574 spin_unlock_irqrestore(&n->list_lock, flags);
2577 #endif /* CONFIG_SLUB_DEBUG || CONFIG_SYSFS */
2579 static noinline void
2580 slab_out_of_memory(struct kmem_cache *s, gfp_t gfpflags, int nid)
2582 #ifdef CONFIG_SLUB_DEBUG
2583 static DEFINE_RATELIMIT_STATE(slub_oom_rs, DEFAULT_RATELIMIT_INTERVAL,
2584 DEFAULT_RATELIMIT_BURST);
2586 struct kmem_cache_node *n;
2588 if ((gfpflags & __GFP_NOWARN) || !__ratelimit(&slub_oom_rs))
2591 pr_warn("SLUB: Unable to allocate memory on node %d, gfp=%#x(%pGg)\n",
2592 nid, gfpflags, &gfpflags);
2593 pr_warn(" cache: %s, object size: %u, buffer size: %u, default order: %u, min order: %u\n",
2594 s->name, s->object_size, s->size, oo_order(s->oo),
2597 if (oo_order(s->min) > get_order(s->object_size))
2598 pr_warn(" %s debugging increased min order, use slub_debug=O to disable.\n",
2601 for_each_kmem_cache_node(s, node, n) {
2602 unsigned long nr_slabs;
2603 unsigned long nr_objs;
2604 unsigned long nr_free;
2606 nr_free = count_partial(n, count_free);
2607 nr_slabs = node_nr_slabs(n);
2608 nr_objs = node_nr_objs(n);
2610 pr_warn(" node %d: slabs: %ld, objs: %ld, free: %ld\n",
2611 node, nr_slabs, nr_objs, nr_free);
2616 static inline bool pfmemalloc_match(struct page *page, gfp_t gfpflags)
2618 if (unlikely(PageSlabPfmemalloc(page)))
2619 return gfp_pfmemalloc_allowed(gfpflags);
2625 * A variant of pfmemalloc_match() that tests page flags without asserting
2626 * PageSlab. Intended for opportunistic checks before taking a lock and
2627 * rechecking that nobody else freed the page under us.
2629 static inline bool pfmemalloc_match_unsafe(struct page *page, gfp_t gfpflags)
2631 if (unlikely(__PageSlabPfmemalloc(page)))
2632 return gfp_pfmemalloc_allowed(gfpflags);
2638 * Check the page->freelist of a page and either transfer the freelist to the
2639 * per cpu freelist or deactivate the page.
2641 * The page is still frozen if the return value is not NULL.
2643 * If this function returns NULL then the page has been unfrozen.
2645 * This function must be called with interrupt disabled.
2647 static inline void *get_freelist(struct kmem_cache *s, struct page *page)
2650 unsigned long counters;
2654 freelist = page->freelist;
2655 counters = page->counters;
2657 new.counters = counters;
2658 VM_BUG_ON(!new.frozen);
2660 new.inuse = page->objects;
2661 new.frozen = freelist != NULL;
2663 } while (!__cmpxchg_double_slab(s, page,
2672 * Slow path. The lockless freelist is empty or we need to perform
2675 * Processing is still very fast if new objects have been freed to the
2676 * regular freelist. In that case we simply take over the regular freelist
2677 * as the lockless freelist and zap the regular freelist.
2679 * If that is not working then we fall back to the partial lists. We take the
2680 * first element of the freelist as the object to allocate now and move the
2681 * rest of the freelist to the lockless freelist.
2683 * And if we were unable to get a new slab from the partial slab lists then
2684 * we need to allocate a new slab. This is the slowest path since it involves
2685 * a call to the page allocator and the setup of a new slab.
2687 * Version of __slab_alloc to use when we know that preemption is
2688 * already disabled (which is the case for bulk allocation).
2690 static void *___slab_alloc(struct kmem_cache *s, gfp_t gfpflags, int node,
2691 unsigned long addr, struct kmem_cache_cpu *c)
2695 unsigned long flags;
2697 stat(s, ALLOC_SLOWPATH);
2701 page = READ_ONCE(c->page);
2704 * if the node is not online or has no normal memory, just
2705 * ignore the node constraint
2707 if (unlikely(node != NUMA_NO_NODE &&
2708 !node_isset(node, slab_nodes)))
2709 node = NUMA_NO_NODE;
2714 if (unlikely(!node_match(page, node))) {
2716 * same as above but node_match() being false already
2717 * implies node != NUMA_NO_NODE
2719 if (!node_isset(node, slab_nodes)) {
2720 node = NUMA_NO_NODE;
2723 stat(s, ALLOC_NODE_MISMATCH);
2724 goto deactivate_slab;
2729 * By rights, we should be searching for a slab page that was
2730 * PFMEMALLOC but right now, we are losing the pfmemalloc
2731 * information when the page leaves the per-cpu allocator
2733 if (unlikely(!pfmemalloc_match_unsafe(page, gfpflags)))
2734 goto deactivate_slab;
2736 /* must check again c->page in case IRQ handler changed it */
2737 local_irq_save(flags);
2738 if (unlikely(page != c->page)) {
2739 local_irq_restore(flags);
2742 freelist = c->freelist;
2746 freelist = get_freelist(s, page);
2750 local_irq_restore(flags);
2751 stat(s, DEACTIVATE_BYPASS);
2755 stat(s, ALLOC_REFILL);
2759 lockdep_assert_irqs_disabled();
2762 * freelist is pointing to the list of objects to be used.
2763 * page is pointing to the page from which the objects are obtained.
2764 * That page must be frozen for per cpu allocations to work.
2766 VM_BUG_ON(!c->page->frozen);
2767 c->freelist = get_freepointer(s, freelist);
2768 c->tid = next_tid(c->tid);
2769 local_irq_restore(flags);
2774 local_irq_save(flags);
2775 if (page != c->page) {
2776 local_irq_restore(flags);
2779 freelist = c->freelist;
2782 local_irq_restore(flags);
2783 deactivate_slab(s, page, freelist);
2787 if (slub_percpu_partial(c)) {
2788 local_irq_save(flags);
2789 if (unlikely(c->page)) {
2790 local_irq_restore(flags);
2793 if (unlikely(!slub_percpu_partial(c))) {
2794 local_irq_restore(flags);
2795 goto new_objects; /* stolen by an IRQ handler */
2798 page = c->page = slub_percpu_partial(c);
2799 slub_set_percpu_partial(c, page);
2800 local_irq_restore(flags);
2801 stat(s, CPU_PARTIAL_ALLOC);
2807 freelist = get_partial(s, gfpflags, node, &page);
2809 goto check_new_page;
2811 put_cpu_ptr(s->cpu_slab);
2812 page = new_slab(s, gfpflags, node);
2813 c = get_cpu_ptr(s->cpu_slab);
2815 if (unlikely(!page)) {
2816 slab_out_of_memory(s, gfpflags, node);
2821 * No other reference to the page yet so we can
2822 * muck around with it freely without cmpxchg
2824 freelist = page->freelist;
2825 page->freelist = NULL;
2827 stat(s, ALLOC_SLAB);
2831 if (kmem_cache_debug(s)) {
2832 if (!alloc_debug_processing(s, page, freelist, addr)) {
2833 /* Slab failed checks. Next slab needed */
2837 * For debug case, we don't load freelist so that all
2838 * allocations go through alloc_debug_processing()
2844 if (unlikely(!pfmemalloc_match(page, gfpflags)))
2846 * For !pfmemalloc_match() case we don't load freelist so that
2847 * we don't make further mismatched allocations easier.
2853 local_irq_save(flags);
2854 if (unlikely(c->page)) {
2855 void *flush_freelist = c->freelist;
2856 struct page *flush_page = c->page;
2860 c->tid = next_tid(c->tid);
2862 local_irq_restore(flags);
2864 deactivate_slab(s, flush_page, flush_freelist);
2866 stat(s, CPUSLAB_FLUSH);
2868 goto retry_load_page;
2876 deactivate_slab(s, page, get_freepointer(s, freelist));
2881 * A wrapper for ___slab_alloc() for contexts where preemption is not yet
2882 * disabled. Compensates for possible cpu changes by refetching the per cpu area
2885 static void *__slab_alloc(struct kmem_cache *s, gfp_t gfpflags, int node,
2886 unsigned long addr, struct kmem_cache_cpu *c)
2890 #ifdef CONFIG_PREEMPT_COUNT
2892 * We may have been preempted and rescheduled on a different
2893 * cpu before disabling preemption. Need to reload cpu area
2896 c = get_cpu_ptr(s->cpu_slab);
2899 p = ___slab_alloc(s, gfpflags, node, addr, c);
2900 #ifdef CONFIG_PREEMPT_COUNT
2901 put_cpu_ptr(s->cpu_slab);
2907 * If the object has been wiped upon free, make sure it's fully initialized by
2908 * zeroing out freelist pointer.
2910 static __always_inline void maybe_wipe_obj_freeptr(struct kmem_cache *s,
2913 if (unlikely(slab_want_init_on_free(s)) && obj)
2914 memset((void *)((char *)kasan_reset_tag(obj) + s->offset),
2919 * Inlined fastpath so that allocation functions (kmalloc, kmem_cache_alloc)
2920 * have the fastpath folded into their functions. So no function call
2921 * overhead for requests that can be satisfied on the fastpath.
2923 * The fastpath works by first checking if the lockless freelist can be used.
2924 * If not then __slab_alloc is called for slow processing.
2926 * Otherwise we can simply pick the next object from the lockless free list.
2928 static __always_inline void *slab_alloc_node(struct kmem_cache *s,
2929 gfp_t gfpflags, int node, unsigned long addr, size_t orig_size)
2932 struct kmem_cache_cpu *c;
2935 struct obj_cgroup *objcg = NULL;
2938 s = slab_pre_alloc_hook(s, &objcg, 1, gfpflags);
2942 object = kfence_alloc(s, orig_size, gfpflags);
2943 if (unlikely(object))
2948 * Must read kmem_cache cpu data via this cpu ptr. Preemption is
2949 * enabled. We may switch back and forth between cpus while
2950 * reading from one cpu area. That does not matter as long
2951 * as we end up on the original cpu again when doing the cmpxchg.
2953 * We must guarantee that tid and kmem_cache_cpu are retrieved on the
2954 * same cpu. We read first the kmem_cache_cpu pointer and use it to read
2955 * the tid. If we are preempted and switched to another cpu between the
2956 * two reads, it's OK as the two are still associated with the same cpu
2957 * and cmpxchg later will validate the cpu.
2959 c = raw_cpu_ptr(s->cpu_slab);
2960 tid = READ_ONCE(c->tid);
2963 * Irqless object alloc/free algorithm used here depends on sequence
2964 * of fetching cpu_slab's data. tid should be fetched before anything
2965 * on c to guarantee that object and page associated with previous tid
2966 * won't be used with current tid. If we fetch tid first, object and
2967 * page could be one associated with next tid and our alloc/free
2968 * request will be failed. In this case, we will retry. So, no problem.
2973 * The transaction ids are globally unique per cpu and per operation on
2974 * a per cpu queue. Thus they can be guarantee that the cmpxchg_double
2975 * occurs on the right processor and that there was no operation on the
2976 * linked list in between.
2979 object = c->freelist;
2981 if (unlikely(!object || !page || !node_match(page, node))) {
2982 object = __slab_alloc(s, gfpflags, node, addr, c);
2984 void *next_object = get_freepointer_safe(s, object);
2987 * The cmpxchg will only match if there was no additional
2988 * operation and if we are on the right processor.
2990 * The cmpxchg does the following atomically (without lock
2992 * 1. Relocate first pointer to the current per cpu area.
2993 * 2. Verify that tid and freelist have not been changed
2994 * 3. If they were not changed replace tid and freelist
2996 * Since this is without lock semantics the protection is only
2997 * against code executing on this cpu *not* from access by
3000 if (unlikely(!this_cpu_cmpxchg_double(
3001 s->cpu_slab->freelist, s->cpu_slab->tid,
3003 next_object, next_tid(tid)))) {
3005 note_cmpxchg_failure("slab_alloc", s, tid);
3008 prefetch_freepointer(s, next_object);
3009 stat(s, ALLOC_FASTPATH);
3012 maybe_wipe_obj_freeptr(s, object);
3013 init = slab_want_init_on_alloc(gfpflags, s);
3016 slab_post_alloc_hook(s, objcg, gfpflags, 1, &object, init);
3021 static __always_inline void *slab_alloc(struct kmem_cache *s,
3022 gfp_t gfpflags, unsigned long addr, size_t orig_size)
3024 return slab_alloc_node(s, gfpflags, NUMA_NO_NODE, addr, orig_size);
3027 void *kmem_cache_alloc(struct kmem_cache *s, gfp_t gfpflags)
3029 void *ret = slab_alloc(s, gfpflags, _RET_IP_, s->object_size);
3031 trace_kmem_cache_alloc(_RET_IP_, ret, s->object_size,
3036 EXPORT_SYMBOL(kmem_cache_alloc);
3038 #ifdef CONFIG_TRACING
3039 void *kmem_cache_alloc_trace(struct kmem_cache *s, gfp_t gfpflags, size_t size)
3041 void *ret = slab_alloc(s, gfpflags, _RET_IP_, size);
3042 trace_kmalloc(_RET_IP_, ret, size, s->size, gfpflags);
3043 ret = kasan_kmalloc(s, ret, size, gfpflags);
3046 EXPORT_SYMBOL(kmem_cache_alloc_trace);
3050 void *kmem_cache_alloc_node(struct kmem_cache *s, gfp_t gfpflags, int node)
3052 void *ret = slab_alloc_node(s, gfpflags, node, _RET_IP_, s->object_size);
3054 trace_kmem_cache_alloc_node(_RET_IP_, ret,
3055 s->object_size, s->size, gfpflags, node);
3059 EXPORT_SYMBOL(kmem_cache_alloc_node);
3061 #ifdef CONFIG_TRACING
3062 void *kmem_cache_alloc_node_trace(struct kmem_cache *s,
3064 int node, size_t size)
3066 void *ret = slab_alloc_node(s, gfpflags, node, _RET_IP_, size);
3068 trace_kmalloc_node(_RET_IP_, ret,
3069 size, s->size, gfpflags, node);
3071 ret = kasan_kmalloc(s, ret, size, gfpflags);
3074 EXPORT_SYMBOL(kmem_cache_alloc_node_trace);
3076 #endif /* CONFIG_NUMA */
3079 * Slow path handling. This may still be called frequently since objects
3080 * have a longer lifetime than the cpu slabs in most processing loads.
3082 * So we still attempt to reduce cache line usage. Just take the slab
3083 * lock and free the item. If there is no additional partial page
3084 * handling required then we can return immediately.
3086 static void __slab_free(struct kmem_cache *s, struct page *page,
3087 void *head, void *tail, int cnt,
3094 unsigned long counters;
3095 struct kmem_cache_node *n = NULL;
3096 unsigned long flags;
3098 stat(s, FREE_SLOWPATH);
3100 if (kfence_free(head))
3103 if (kmem_cache_debug(s) &&
3104 !free_debug_processing(s, page, head, tail, cnt, addr))
3109 spin_unlock_irqrestore(&n->list_lock, flags);
3112 prior = page->freelist;
3113 counters = page->counters;
3114 set_freepointer(s, tail, prior);
3115 new.counters = counters;
3116 was_frozen = new.frozen;
3118 if ((!new.inuse || !prior) && !was_frozen) {
3120 if (kmem_cache_has_cpu_partial(s) && !prior) {
3123 * Slab was on no list before and will be
3125 * We can defer the list move and instead
3130 } else { /* Needs to be taken off a list */
3132 n = get_node(s, page_to_nid(page));
3134 * Speculatively acquire the list_lock.
3135 * If the cmpxchg does not succeed then we may
3136 * drop the list_lock without any processing.
3138 * Otherwise the list_lock will synchronize with
3139 * other processors updating the list of slabs.
3141 spin_lock_irqsave(&n->list_lock, flags);
3146 } while (!cmpxchg_double_slab(s, page,
3153 if (likely(was_frozen)) {
3155 * The list lock was not taken therefore no list
3156 * activity can be necessary.
3158 stat(s, FREE_FROZEN);
3159 } else if (new.frozen) {
3161 * If we just froze the page then put it onto the
3162 * per cpu partial list.
3164 put_cpu_partial(s, page, 1);
3165 stat(s, CPU_PARTIAL_FREE);
3171 if (unlikely(!new.inuse && n->nr_partial >= s->min_partial))
3175 * Objects left in the slab. If it was not on the partial list before
3178 if (!kmem_cache_has_cpu_partial(s) && unlikely(!prior)) {
3179 remove_full(s, n, page);
3180 add_partial(n, page, DEACTIVATE_TO_TAIL);
3181 stat(s, FREE_ADD_PARTIAL);
3183 spin_unlock_irqrestore(&n->list_lock, flags);
3189 * Slab on the partial list.
3191 remove_partial(n, page);
3192 stat(s, FREE_REMOVE_PARTIAL);
3194 /* Slab must be on the full list */
3195 remove_full(s, n, page);
3198 spin_unlock_irqrestore(&n->list_lock, flags);
3200 discard_slab(s, page);
3204 * Fastpath with forced inlining to produce a kfree and kmem_cache_free that
3205 * can perform fastpath freeing without additional function calls.
3207 * The fastpath is only possible if we are freeing to the current cpu slab
3208 * of this processor. This typically the case if we have just allocated
3211 * If fastpath is not possible then fall back to __slab_free where we deal
3212 * with all sorts of special processing.
3214 * Bulk free of a freelist with several objects (all pointing to the
3215 * same page) possible by specifying head and tail ptr, plus objects
3216 * count (cnt). Bulk free indicated by tail pointer being set.
3218 static __always_inline void do_slab_free(struct kmem_cache *s,
3219 struct page *page, void *head, void *tail,
3220 int cnt, unsigned long addr)
3222 void *tail_obj = tail ? : head;
3223 struct kmem_cache_cpu *c;
3226 memcg_slab_free_hook(s, &head, 1);
3229 * Determine the currently cpus per cpu slab.
3230 * The cpu may change afterward. However that does not matter since
3231 * data is retrieved via this pointer. If we are on the same cpu
3232 * during the cmpxchg then the free will succeed.
3234 c = raw_cpu_ptr(s->cpu_slab);
3235 tid = READ_ONCE(c->tid);
3237 /* Same with comment on barrier() in slab_alloc_node() */
3240 if (likely(page == c->page)) {
3241 void **freelist = READ_ONCE(c->freelist);
3243 set_freepointer(s, tail_obj, freelist);
3245 if (unlikely(!this_cpu_cmpxchg_double(
3246 s->cpu_slab->freelist, s->cpu_slab->tid,
3248 head, next_tid(tid)))) {
3250 note_cmpxchg_failure("slab_free", s, tid);
3253 stat(s, FREE_FASTPATH);
3255 __slab_free(s, page, head, tail_obj, cnt, addr);
3259 static __always_inline void slab_free(struct kmem_cache *s, struct page *page,
3260 void *head, void *tail, int cnt,
3264 * With KASAN enabled slab_free_freelist_hook modifies the freelist
3265 * to remove objects, whose reuse must be delayed.
3267 if (slab_free_freelist_hook(s, &head, &tail))
3268 do_slab_free(s, page, head, tail, cnt, addr);
3271 #ifdef CONFIG_KASAN_GENERIC
3272 void ___cache_free(struct kmem_cache *cache, void *x, unsigned long addr)
3274 do_slab_free(cache, virt_to_head_page(x), x, NULL, 1, addr);
3278 void kmem_cache_free(struct kmem_cache *s, void *x)
3280 s = cache_from_obj(s, x);
3283 slab_free(s, virt_to_head_page(x), x, NULL, 1, _RET_IP_);
3284 trace_kmem_cache_free(_RET_IP_, x, s->name);
3286 EXPORT_SYMBOL(kmem_cache_free);
3288 struct detached_freelist {
3293 struct kmem_cache *s;
3296 static inline void free_nonslab_page(struct page *page, void *object)
3298 unsigned int order = compound_order(page);
3300 VM_BUG_ON_PAGE(!PageCompound(page), page);
3302 mod_lruvec_page_state(page, NR_SLAB_UNRECLAIMABLE_B, -(PAGE_SIZE << order));
3303 __free_pages(page, order);
3307 * This function progressively scans the array with free objects (with
3308 * a limited look ahead) and extract objects belonging to the same
3309 * page. It builds a detached freelist directly within the given
3310 * page/objects. This can happen without any need for
3311 * synchronization, because the objects are owned by running process.
3312 * The freelist is build up as a single linked list in the objects.
3313 * The idea is, that this detached freelist can then be bulk
3314 * transferred to the real freelist(s), but only requiring a single
3315 * synchronization primitive. Look ahead in the array is limited due
3316 * to performance reasons.
3319 int build_detached_freelist(struct kmem_cache *s, size_t size,
3320 void **p, struct detached_freelist *df)
3322 size_t first_skipped_index = 0;
3327 /* Always re-init detached_freelist */
3332 /* Do we need !ZERO_OR_NULL_PTR(object) here? (for kfree) */
3333 } while (!object && size);
3338 page = virt_to_head_page(object);
3340 /* Handle kalloc'ed objects */
3341 if (unlikely(!PageSlab(page))) {
3342 free_nonslab_page(page, object);
3343 p[size] = NULL; /* mark object processed */
3346 /* Derive kmem_cache from object */
3347 df->s = page->slab_cache;
3349 df->s = cache_from_obj(s, object); /* Support for memcg */
3352 if (is_kfence_address(object)) {
3353 slab_free_hook(df->s, object, false);
3354 __kfence_free(object);
3355 p[size] = NULL; /* mark object processed */
3359 /* Start new detached freelist */
3361 set_freepointer(df->s, object, NULL);
3363 df->freelist = object;
3364 p[size] = NULL; /* mark object processed */
3370 continue; /* Skip processed objects */
3372 /* df->page is always set at this point */
3373 if (df->page == virt_to_head_page(object)) {
3374 /* Opportunity build freelist */
3375 set_freepointer(df->s, object, df->freelist);
3376 df->freelist = object;
3378 p[size] = NULL; /* mark object processed */
3383 /* Limit look ahead search */
3387 if (!first_skipped_index)
3388 first_skipped_index = size + 1;
3391 return first_skipped_index;
3394 /* Note that interrupts must be enabled when calling this function. */
3395 void kmem_cache_free_bulk(struct kmem_cache *s, size_t size, void **p)
3400 memcg_slab_free_hook(s, p, size);
3402 struct detached_freelist df;
3404 size = build_detached_freelist(s, size, p, &df);
3408 slab_free(df.s, df.page, df.freelist, df.tail, df.cnt, _RET_IP_);
3409 } while (likely(size));
3411 EXPORT_SYMBOL(kmem_cache_free_bulk);
3413 /* Note that interrupts must be enabled when calling this function. */
3414 int kmem_cache_alloc_bulk(struct kmem_cache *s, gfp_t flags, size_t size,
3417 struct kmem_cache_cpu *c;
3419 struct obj_cgroup *objcg = NULL;
3421 /* memcg and kmem_cache debug support */
3422 s = slab_pre_alloc_hook(s, &objcg, size, flags);
3426 * Drain objects in the per cpu slab, while disabling local
3427 * IRQs, which protects against PREEMPT and interrupts
3428 * handlers invoking normal fastpath.
3430 c = get_cpu_ptr(s->cpu_slab);
3431 local_irq_disable();
3433 for (i = 0; i < size; i++) {
3434 void *object = kfence_alloc(s, s->object_size, flags);
3436 if (unlikely(object)) {
3441 object = c->freelist;
3442 if (unlikely(!object)) {
3444 * We may have removed an object from c->freelist using
3445 * the fastpath in the previous iteration; in that case,
3446 * c->tid has not been bumped yet.
3447 * Since ___slab_alloc() may reenable interrupts while
3448 * allocating memory, we should bump c->tid now.
3450 c->tid = next_tid(c->tid);
3455 * Invoking slow path likely have side-effect
3456 * of re-populating per CPU c->freelist
3458 p[i] = ___slab_alloc(s, flags, NUMA_NO_NODE,
3460 if (unlikely(!p[i]))
3463 c = this_cpu_ptr(s->cpu_slab);
3464 maybe_wipe_obj_freeptr(s, p[i]);
3466 local_irq_disable();
3468 continue; /* goto for-loop */
3470 c->freelist = get_freepointer(s, object);
3472 maybe_wipe_obj_freeptr(s, p[i]);
3474 c->tid = next_tid(c->tid);
3476 put_cpu_ptr(s->cpu_slab);
3479 * memcg and kmem_cache debug support and memory initialization.
3480 * Done outside of the IRQ disabled fastpath loop.
3482 slab_post_alloc_hook(s, objcg, flags, size, p,
3483 slab_want_init_on_alloc(flags, s));
3486 put_cpu_ptr(s->cpu_slab);
3487 slab_post_alloc_hook(s, objcg, flags, i, p, false);
3488 __kmem_cache_free_bulk(s, i, p);
3491 EXPORT_SYMBOL(kmem_cache_alloc_bulk);
3495 * Object placement in a slab is made very easy because we always start at
3496 * offset 0. If we tune the size of the object to the alignment then we can
3497 * get the required alignment by putting one properly sized object after
3500 * Notice that the allocation order determines the sizes of the per cpu
3501 * caches. Each processor has always one slab available for allocations.
3502 * Increasing the allocation order reduces the number of times that slabs
3503 * must be moved on and off the partial lists and is therefore a factor in
3508 * Minimum / Maximum order of slab pages. This influences locking overhead
3509 * and slab fragmentation. A higher order reduces the number of partial slabs
3510 * and increases the number of allocations possible without having to
3511 * take the list_lock.
3513 static unsigned int slub_min_order;
3514 static unsigned int slub_max_order = PAGE_ALLOC_COSTLY_ORDER;
3515 static unsigned int slub_min_objects;
3518 * Calculate the order of allocation given an slab object size.
3520 * The order of allocation has significant impact on performance and other
3521 * system components. Generally order 0 allocations should be preferred since
3522 * order 0 does not cause fragmentation in the page allocator. Larger objects
3523 * be problematic to put into order 0 slabs because there may be too much
3524 * unused space left. We go to a higher order if more than 1/16th of the slab
3527 * In order to reach satisfactory performance we must ensure that a minimum
3528 * number of objects is in one slab. Otherwise we may generate too much
3529 * activity on the partial lists which requires taking the list_lock. This is
3530 * less a concern for large slabs though which are rarely used.
3532 * slub_max_order specifies the order where we begin to stop considering the
3533 * number of objects in a slab as critical. If we reach slub_max_order then
3534 * we try to keep the page order as low as possible. So we accept more waste
3535 * of space in favor of a small page order.
3537 * Higher order allocations also allow the placement of more objects in a
3538 * slab and thereby reduce object handling overhead. If the user has
3539 * requested a higher minimum order then we start with that one instead of
3540 * the smallest order which will fit the object.
3542 static inline unsigned int slab_order(unsigned int size,
3543 unsigned int min_objects, unsigned int max_order,
3544 unsigned int fract_leftover)
3546 unsigned int min_order = slub_min_order;
3549 if (order_objects(min_order, size) > MAX_OBJS_PER_PAGE)
3550 return get_order(size * MAX_OBJS_PER_PAGE) - 1;
3552 for (order = max(min_order, (unsigned int)get_order(min_objects * size));
3553 order <= max_order; order++) {
3555 unsigned int slab_size = (unsigned int)PAGE_SIZE << order;
3558 rem = slab_size % size;
3560 if (rem <= slab_size / fract_leftover)
3567 static inline int calculate_order(unsigned int size)
3570 unsigned int min_objects;
3571 unsigned int max_objects;
3572 unsigned int nr_cpus;
3575 * Attempt to find best configuration for a slab. This
3576 * works by first attempting to generate a layout with
3577 * the best configuration and backing off gradually.
3579 * First we increase the acceptable waste in a slab. Then
3580 * we reduce the minimum objects required in a slab.
3582 min_objects = slub_min_objects;
3585 * Some architectures will only update present cpus when
3586 * onlining them, so don't trust the number if it's just 1. But
3587 * we also don't want to use nr_cpu_ids always, as on some other
3588 * architectures, there can be many possible cpus, but never
3589 * onlined. Here we compromise between trying to avoid too high
3590 * order on systems that appear larger than they are, and too
3591 * low order on systems that appear smaller than they are.
3593 nr_cpus = num_present_cpus();
3595 nr_cpus = nr_cpu_ids;
3596 min_objects = 4 * (fls(nr_cpus) + 1);
3598 max_objects = order_objects(slub_max_order, size);
3599 min_objects = min(min_objects, max_objects);
3601 while (min_objects > 1) {
3602 unsigned int fraction;
3605 while (fraction >= 4) {
3606 order = slab_order(size, min_objects,
3607 slub_max_order, fraction);
3608 if (order <= slub_max_order)
3616 * We were unable to place multiple objects in a slab. Now
3617 * lets see if we can place a single object there.
3619 order = slab_order(size, 1, slub_max_order, 1);
3620 if (order <= slub_max_order)
3624 * Doh this slab cannot be placed using slub_max_order.
3626 order = slab_order(size, 1, MAX_ORDER, 1);
3627 if (order < MAX_ORDER)
3633 init_kmem_cache_node(struct kmem_cache_node *n)
3636 spin_lock_init(&n->list_lock);
3637 INIT_LIST_HEAD(&n->partial);
3638 #ifdef CONFIG_SLUB_DEBUG
3639 atomic_long_set(&n->nr_slabs, 0);
3640 atomic_long_set(&n->total_objects, 0);
3641 INIT_LIST_HEAD(&n->full);
3645 static inline int alloc_kmem_cache_cpus(struct kmem_cache *s)
3647 BUILD_BUG_ON(PERCPU_DYNAMIC_EARLY_SIZE <
3648 KMALLOC_SHIFT_HIGH * sizeof(struct kmem_cache_cpu));
3651 * Must align to double word boundary for the double cmpxchg
3652 * instructions to work; see __pcpu_double_call_return_bool().
3654 s->cpu_slab = __alloc_percpu(sizeof(struct kmem_cache_cpu),
3655 2 * sizeof(void *));
3660 init_kmem_cache_cpus(s);
3665 static struct kmem_cache *kmem_cache_node;
3668 * No kmalloc_node yet so do it by hand. We know that this is the first
3669 * slab on the node for this slabcache. There are no concurrent accesses
3672 * Note that this function only works on the kmem_cache_node
3673 * when allocating for the kmem_cache_node. This is used for bootstrapping
3674 * memory on a fresh node that has no slab structures yet.
3676 static void early_kmem_cache_node_alloc(int node)
3679 struct kmem_cache_node *n;
3681 BUG_ON(kmem_cache_node->size < sizeof(struct kmem_cache_node));
3683 page = new_slab(kmem_cache_node, GFP_NOWAIT, node);
3686 if (page_to_nid(page) != node) {
3687 pr_err("SLUB: Unable to allocate memory from node %d\n", node);
3688 pr_err("SLUB: Allocating a useless per node structure in order to be able to continue\n");
3693 #ifdef CONFIG_SLUB_DEBUG
3694 init_object(kmem_cache_node, n, SLUB_RED_ACTIVE);
3695 init_tracking(kmem_cache_node, n);
3697 n = kasan_slab_alloc(kmem_cache_node, n, GFP_KERNEL, false);
3698 page->freelist = get_freepointer(kmem_cache_node, n);
3701 kmem_cache_node->node[node] = n;
3702 init_kmem_cache_node(n);
3703 inc_slabs_node(kmem_cache_node, node, page->objects);
3706 * No locks need to be taken here as it has just been
3707 * initialized and there is no concurrent access.
3709 __add_partial(n, page, DEACTIVATE_TO_HEAD);
3712 static void free_kmem_cache_nodes(struct kmem_cache *s)
3715 struct kmem_cache_node *n;
3717 for_each_kmem_cache_node(s, node, n) {
3718 s->node[node] = NULL;
3719 kmem_cache_free(kmem_cache_node, n);
3723 void __kmem_cache_release(struct kmem_cache *s)
3725 cache_random_seq_destroy(s);
3726 free_percpu(s->cpu_slab);
3727 free_kmem_cache_nodes(s);
3730 static int init_kmem_cache_nodes(struct kmem_cache *s)
3734 for_each_node_mask(node, slab_nodes) {
3735 struct kmem_cache_node *n;
3737 if (slab_state == DOWN) {
3738 early_kmem_cache_node_alloc(node);
3741 n = kmem_cache_alloc_node(kmem_cache_node,
3745 free_kmem_cache_nodes(s);
3749 init_kmem_cache_node(n);
3755 static void set_min_partial(struct kmem_cache *s, unsigned long min)
3757 if (min < MIN_PARTIAL)
3759 else if (min > MAX_PARTIAL)
3761 s->min_partial = min;
3764 static void set_cpu_partial(struct kmem_cache *s)
3766 #ifdef CONFIG_SLUB_CPU_PARTIAL
3768 * cpu_partial determined the maximum number of objects kept in the
3769 * per cpu partial lists of a processor.
3771 * Per cpu partial lists mainly contain slabs that just have one
3772 * object freed. If they are used for allocation then they can be
3773 * filled up again with minimal effort. The slab will never hit the
3774 * per node partial lists and therefore no locking will be required.
3776 * This setting also determines
3778 * A) The number of objects from per cpu partial slabs dumped to the
3779 * per node list when we reach the limit.
3780 * B) The number of objects in cpu partial slabs to extract from the
3781 * per node list when we run out of per cpu objects. We only fetch
3782 * 50% to keep some capacity around for frees.
3784 if (!kmem_cache_has_cpu_partial(s))
3785 slub_set_cpu_partial(s, 0);
3786 else if (s->size >= PAGE_SIZE)
3787 slub_set_cpu_partial(s, 2);
3788 else if (s->size >= 1024)
3789 slub_set_cpu_partial(s, 6);
3790 else if (s->size >= 256)
3791 slub_set_cpu_partial(s, 13);
3793 slub_set_cpu_partial(s, 30);
3798 * calculate_sizes() determines the order and the distribution of data within
3801 static int calculate_sizes(struct kmem_cache *s, int forced_order)
3803 slab_flags_t flags = s->flags;
3804 unsigned int size = s->object_size;
3808 * Round up object size to the next word boundary. We can only
3809 * place the free pointer at word boundaries and this determines
3810 * the possible location of the free pointer.
3812 size = ALIGN(size, sizeof(void *));
3814 #ifdef CONFIG_SLUB_DEBUG
3816 * Determine if we can poison the object itself. If the user of
3817 * the slab may touch the object after free or before allocation
3818 * then we should never poison the object itself.
3820 if ((flags & SLAB_POISON) && !(flags & SLAB_TYPESAFE_BY_RCU) &&
3822 s->flags |= __OBJECT_POISON;
3824 s->flags &= ~__OBJECT_POISON;
3828 * If we are Redzoning then check if there is some space between the
3829 * end of the object and the free pointer. If not then add an
3830 * additional word to have some bytes to store Redzone information.
3832 if ((flags & SLAB_RED_ZONE) && size == s->object_size)
3833 size += sizeof(void *);
3837 * With that we have determined the number of bytes in actual use
3838 * by the object and redzoning.
3842 if ((flags & (SLAB_TYPESAFE_BY_RCU | SLAB_POISON)) ||
3843 ((flags & SLAB_RED_ZONE) && s->object_size < sizeof(void *)) ||
3846 * Relocate free pointer after the object if it is not
3847 * permitted to overwrite the first word of the object on
3850 * This is the case if we do RCU, have a constructor or
3851 * destructor, are poisoning the objects, or are
3852 * redzoning an object smaller than sizeof(void *).
3854 * The assumption that s->offset >= s->inuse means free
3855 * pointer is outside of the object is used in the
3856 * freeptr_outside_object() function. If that is no
3857 * longer true, the function needs to be modified.
3860 size += sizeof(void *);
3863 * Store freelist pointer near middle of object to keep
3864 * it away from the edges of the object to avoid small
3865 * sized over/underflows from neighboring allocations.
3867 s->offset = ALIGN_DOWN(s->object_size / 2, sizeof(void *));
3870 #ifdef CONFIG_SLUB_DEBUG
3871 if (flags & SLAB_STORE_USER)
3873 * Need to store information about allocs and frees after
3876 size += 2 * sizeof(struct track);
3879 kasan_cache_create(s, &size, &s->flags);
3880 #ifdef CONFIG_SLUB_DEBUG
3881 if (flags & SLAB_RED_ZONE) {
3883 * Add some empty padding so that we can catch
3884 * overwrites from earlier objects rather than let
3885 * tracking information or the free pointer be
3886 * corrupted if a user writes before the start
3889 size += sizeof(void *);
3891 s->red_left_pad = sizeof(void *);
3892 s->red_left_pad = ALIGN(s->red_left_pad, s->align);
3893 size += s->red_left_pad;
3898 * SLUB stores one object immediately after another beginning from
3899 * offset 0. In order to align the objects we have to simply size
3900 * each object to conform to the alignment.
3902 size = ALIGN(size, s->align);
3904 s->reciprocal_size = reciprocal_value(size);
3905 if (forced_order >= 0)
3906 order = forced_order;
3908 order = calculate_order(size);
3915 s->allocflags |= __GFP_COMP;
3917 if (s->flags & SLAB_CACHE_DMA)
3918 s->allocflags |= GFP_DMA;
3920 if (s->flags & SLAB_CACHE_DMA32)
3921 s->allocflags |= GFP_DMA32;
3923 if (s->flags & SLAB_RECLAIM_ACCOUNT)
3924 s->allocflags |= __GFP_RECLAIMABLE;
3927 * Determine the number of objects per slab
3929 s->oo = oo_make(order, size);
3930 s->min = oo_make(get_order(size), size);
3931 if (oo_objects(s->oo) > oo_objects(s->max))
3934 return !!oo_objects(s->oo);
3937 static int kmem_cache_open(struct kmem_cache *s, slab_flags_t flags)
3939 s->flags = kmem_cache_flags(s->size, flags, s->name);
3940 #ifdef CONFIG_SLAB_FREELIST_HARDENED
3941 s->random = get_random_long();
3944 if (!calculate_sizes(s, -1))
3946 if (disable_higher_order_debug) {
3948 * Disable debugging flags that store metadata if the min slab
3951 if (get_order(s->size) > get_order(s->object_size)) {
3952 s->flags &= ~DEBUG_METADATA_FLAGS;
3954 if (!calculate_sizes(s, -1))
3959 #if defined(CONFIG_HAVE_CMPXCHG_DOUBLE) && \
3960 defined(CONFIG_HAVE_ALIGNED_STRUCT_PAGE)
3961 if (system_has_cmpxchg_double() && (s->flags & SLAB_NO_CMPXCHG) == 0)
3962 /* Enable fast mode */
3963 s->flags |= __CMPXCHG_DOUBLE;
3967 * The larger the object size is, the more pages we want on the partial
3968 * list to avoid pounding the page allocator excessively.
3970 set_min_partial(s, ilog2(s->size) / 2);
3975 s->remote_node_defrag_ratio = 1000;
3978 /* Initialize the pre-computed randomized freelist if slab is up */
3979 if (slab_state >= UP) {
3980 if (init_cache_random_seq(s))
3984 if (!init_kmem_cache_nodes(s))
3987 if (alloc_kmem_cache_cpus(s))
3990 free_kmem_cache_nodes(s);
3995 static void list_slab_objects(struct kmem_cache *s, struct page *page,
3998 #ifdef CONFIG_SLUB_DEBUG
3999 void *addr = page_address(page);
4003 slab_err(s, page, text, s->name);
4006 map = get_map(s, page);
4007 for_each_object(p, s, addr, page->objects) {
4009 if (!test_bit(__obj_to_index(s, addr, p), map)) {
4010 pr_err("Object 0x%p @offset=%tu\n", p, p - addr);
4011 print_tracking(s, p);
4020 * Attempt to free all partial slabs on a node.
4021 * This is called from __kmem_cache_shutdown(). We must take list_lock
4022 * because sysfs file might still access partial list after the shutdowning.
4024 static void free_partial(struct kmem_cache *s, struct kmem_cache_node *n)
4027 struct page *page, *h;
4029 BUG_ON(irqs_disabled());
4030 spin_lock_irq(&n->list_lock);
4031 list_for_each_entry_safe(page, h, &n->partial, slab_list) {
4033 remove_partial(n, page);
4034 list_add(&page->slab_list, &discard);
4036 list_slab_objects(s, page,
4037 "Objects remaining in %s on __kmem_cache_shutdown()");
4040 spin_unlock_irq(&n->list_lock);
4042 list_for_each_entry_safe(page, h, &discard, slab_list)
4043 discard_slab(s, page);
4046 bool __kmem_cache_empty(struct kmem_cache *s)
4049 struct kmem_cache_node *n;
4051 for_each_kmem_cache_node(s, node, n)
4052 if (n->nr_partial || slabs_node(s, node))
4058 * Release all resources used by a slab cache.
4060 int __kmem_cache_shutdown(struct kmem_cache *s)
4063 struct kmem_cache_node *n;
4066 /* Attempt to free all objects */
4067 for_each_kmem_cache_node(s, node, n) {
4069 if (n->nr_partial || slabs_node(s, node))
4075 #ifdef CONFIG_PRINTK
4076 void kmem_obj_info(struct kmem_obj_info *kpp, void *object, struct page *page)
4079 int __maybe_unused i;
4083 struct kmem_cache *s = page->slab_cache;
4084 struct track __maybe_unused *trackp;
4086 kpp->kp_ptr = object;
4087 kpp->kp_page = page;
4088 kpp->kp_slab_cache = s;
4089 base = page_address(page);
4090 objp0 = kasan_reset_tag(object);
4091 #ifdef CONFIG_SLUB_DEBUG
4092 objp = restore_red_left(s, objp0);
4096 objnr = obj_to_index(s, page, objp);
4097 kpp->kp_data_offset = (unsigned long)((char *)objp0 - (char *)objp);
4098 objp = base + s->size * objnr;
4099 kpp->kp_objp = objp;
4100 if (WARN_ON_ONCE(objp < base || objp >= base + page->objects * s->size || (objp - base) % s->size) ||
4101 !(s->flags & SLAB_STORE_USER))
4103 #ifdef CONFIG_SLUB_DEBUG
4104 objp = fixup_red_left(s, objp);
4105 trackp = get_track(s, objp, TRACK_ALLOC);
4106 kpp->kp_ret = (void *)trackp->addr;
4107 #ifdef CONFIG_STACKTRACE
4108 for (i = 0; i < KS_ADDRS_COUNT && i < TRACK_ADDRS_COUNT; i++) {
4109 kpp->kp_stack[i] = (void *)trackp->addrs[i];
4110 if (!kpp->kp_stack[i])
4114 trackp = get_track(s, objp, TRACK_FREE);
4115 for (i = 0; i < KS_ADDRS_COUNT && i < TRACK_ADDRS_COUNT; i++) {
4116 kpp->kp_free_stack[i] = (void *)trackp->addrs[i];
4117 if (!kpp->kp_free_stack[i])
4125 /********************************************************************
4127 *******************************************************************/
4129 static int __init setup_slub_min_order(char *str)
4131 get_option(&str, (int *)&slub_min_order);
4136 __setup("slub_min_order=", setup_slub_min_order);
4138 static int __init setup_slub_max_order(char *str)
4140 get_option(&str, (int *)&slub_max_order);
4141 slub_max_order = min(slub_max_order, (unsigned int)MAX_ORDER - 1);
4146 __setup("slub_max_order=", setup_slub_max_order);
4148 static int __init setup_slub_min_objects(char *str)
4150 get_option(&str, (int *)&slub_min_objects);
4155 __setup("slub_min_objects=", setup_slub_min_objects);
4157 void *__kmalloc(size_t size, gfp_t flags)
4159 struct kmem_cache *s;
4162 if (unlikely(size > KMALLOC_MAX_CACHE_SIZE))
4163 return kmalloc_large(size, flags);
4165 s = kmalloc_slab(size, flags);
4167 if (unlikely(ZERO_OR_NULL_PTR(s)))
4170 ret = slab_alloc(s, flags, _RET_IP_, size);
4172 trace_kmalloc(_RET_IP_, ret, size, s->size, flags);
4174 ret = kasan_kmalloc(s, ret, size, flags);
4178 EXPORT_SYMBOL(__kmalloc);
4181 static void *kmalloc_large_node(size_t size, gfp_t flags, int node)
4185 unsigned int order = get_order(size);
4187 flags |= __GFP_COMP;
4188 page = alloc_pages_node(node, flags, order);
4190 ptr = page_address(page);
4191 mod_lruvec_page_state(page, NR_SLAB_UNRECLAIMABLE_B,
4192 PAGE_SIZE << order);
4195 return kmalloc_large_node_hook(ptr, size, flags);
4198 void *__kmalloc_node(size_t size, gfp_t flags, int node)
4200 struct kmem_cache *s;
4203 if (unlikely(size > KMALLOC_MAX_CACHE_SIZE)) {
4204 ret = kmalloc_large_node(size, flags, node);
4206 trace_kmalloc_node(_RET_IP_, ret,
4207 size, PAGE_SIZE << get_order(size),
4213 s = kmalloc_slab(size, flags);
4215 if (unlikely(ZERO_OR_NULL_PTR(s)))
4218 ret = slab_alloc_node(s, flags, node, _RET_IP_, size);
4220 trace_kmalloc_node(_RET_IP_, ret, size, s->size, flags, node);
4222 ret = kasan_kmalloc(s, ret, size, flags);
4226 EXPORT_SYMBOL(__kmalloc_node);
4227 #endif /* CONFIG_NUMA */
4229 #ifdef CONFIG_HARDENED_USERCOPY
4231 * Rejects incorrectly sized objects and objects that are to be copied
4232 * to/from userspace but do not fall entirely within the containing slab
4233 * cache's usercopy region.
4235 * Returns NULL if check passes, otherwise const char * to name of cache
4236 * to indicate an error.
4238 void __check_heap_object(const void *ptr, unsigned long n, struct page *page,
4241 struct kmem_cache *s;
4242 unsigned int offset;
4244 bool is_kfence = is_kfence_address(ptr);
4246 ptr = kasan_reset_tag(ptr);
4248 /* Find object and usable object size. */
4249 s = page->slab_cache;
4251 /* Reject impossible pointers. */
4252 if (ptr < page_address(page))
4253 usercopy_abort("SLUB object not in SLUB page?!", NULL,
4256 /* Find offset within object. */
4258 offset = ptr - kfence_object_start(ptr);
4260 offset = (ptr - page_address(page)) % s->size;
4262 /* Adjust for redzone and reject if within the redzone. */
4263 if (!is_kfence && kmem_cache_debug_flags(s, SLAB_RED_ZONE)) {
4264 if (offset < s->red_left_pad)
4265 usercopy_abort("SLUB object in left red zone",
4266 s->name, to_user, offset, n);
4267 offset -= s->red_left_pad;
4270 /* Allow address range falling entirely within usercopy region. */
4271 if (offset >= s->useroffset &&
4272 offset - s->useroffset <= s->usersize &&
4273 n <= s->useroffset - offset + s->usersize)
4277 * If the copy is still within the allocated object, produce
4278 * a warning instead of rejecting the copy. This is intended
4279 * to be a temporary method to find any missing usercopy
4282 object_size = slab_ksize(s);
4283 if (usercopy_fallback &&
4284 offset <= object_size && n <= object_size - offset) {
4285 usercopy_warn("SLUB object", s->name, to_user, offset, n);
4289 usercopy_abort("SLUB object", s->name, to_user, offset, n);
4291 #endif /* CONFIG_HARDENED_USERCOPY */
4293 size_t __ksize(const void *object)
4297 if (unlikely(object == ZERO_SIZE_PTR))
4300 page = virt_to_head_page(object);
4302 if (unlikely(!PageSlab(page))) {
4303 WARN_ON(!PageCompound(page));
4304 return page_size(page);
4307 return slab_ksize(page->slab_cache);
4309 EXPORT_SYMBOL(__ksize);
4311 void kfree(const void *x)
4314 void *object = (void *)x;
4316 trace_kfree(_RET_IP_, x);
4318 if (unlikely(ZERO_OR_NULL_PTR(x)))
4321 page = virt_to_head_page(x);
4322 if (unlikely(!PageSlab(page))) {
4323 free_nonslab_page(page, object);
4326 slab_free(page->slab_cache, page, object, NULL, 1, _RET_IP_);
4328 EXPORT_SYMBOL(kfree);
4330 #define SHRINK_PROMOTE_MAX 32
4333 * kmem_cache_shrink discards empty slabs and promotes the slabs filled
4334 * up most to the head of the partial lists. New allocations will then
4335 * fill those up and thus they can be removed from the partial lists.
4337 * The slabs with the least items are placed last. This results in them
4338 * being allocated from last increasing the chance that the last objects
4339 * are freed in them.
4341 int __kmem_cache_shrink(struct kmem_cache *s)
4345 struct kmem_cache_node *n;
4348 struct list_head discard;
4349 struct list_head promote[SHRINK_PROMOTE_MAX];
4350 unsigned long flags;
4354 for_each_kmem_cache_node(s, node, n) {
4355 INIT_LIST_HEAD(&discard);
4356 for (i = 0; i < SHRINK_PROMOTE_MAX; i++)
4357 INIT_LIST_HEAD(promote + i);
4359 spin_lock_irqsave(&n->list_lock, flags);
4362 * Build lists of slabs to discard or promote.
4364 * Note that concurrent frees may occur while we hold the
4365 * list_lock. page->inuse here is the upper limit.
4367 list_for_each_entry_safe(page, t, &n->partial, slab_list) {
4368 int free = page->objects - page->inuse;
4370 /* Do not reread page->inuse */
4373 /* We do not keep full slabs on the list */
4376 if (free == page->objects) {
4377 list_move(&page->slab_list, &discard);
4379 } else if (free <= SHRINK_PROMOTE_MAX)
4380 list_move(&page->slab_list, promote + free - 1);
4384 * Promote the slabs filled up most to the head of the
4387 for (i = SHRINK_PROMOTE_MAX - 1; i >= 0; i--)
4388 list_splice(promote + i, &n->partial);
4390 spin_unlock_irqrestore(&n->list_lock, flags);
4392 /* Release empty slabs */
4393 list_for_each_entry_safe(page, t, &discard, slab_list)
4394 discard_slab(s, page);
4396 if (slabs_node(s, node))
4403 static int slab_mem_going_offline_callback(void *arg)
4405 struct kmem_cache *s;
4407 mutex_lock(&slab_mutex);
4408 list_for_each_entry(s, &slab_caches, list)
4409 __kmem_cache_shrink(s);
4410 mutex_unlock(&slab_mutex);
4415 static void slab_mem_offline_callback(void *arg)
4417 struct memory_notify *marg = arg;
4420 offline_node = marg->status_change_nid_normal;
4423 * If the node still has available memory. we need kmem_cache_node
4426 if (offline_node < 0)
4429 mutex_lock(&slab_mutex);
4430 node_clear(offline_node, slab_nodes);
4432 * We no longer free kmem_cache_node structures here, as it would be
4433 * racy with all get_node() users, and infeasible to protect them with
4436 mutex_unlock(&slab_mutex);
4439 static int slab_mem_going_online_callback(void *arg)
4441 struct kmem_cache_node *n;
4442 struct kmem_cache *s;
4443 struct memory_notify *marg = arg;
4444 int nid = marg->status_change_nid_normal;
4448 * If the node's memory is already available, then kmem_cache_node is
4449 * already created. Nothing to do.
4455 * We are bringing a node online. No memory is available yet. We must
4456 * allocate a kmem_cache_node structure in order to bring the node
4459 mutex_lock(&slab_mutex);
4460 list_for_each_entry(s, &slab_caches, list) {
4462 * The structure may already exist if the node was previously
4463 * onlined and offlined.
4465 if (get_node(s, nid))
4468 * XXX: kmem_cache_alloc_node will fallback to other nodes
4469 * since memory is not yet available from the node that
4472 n = kmem_cache_alloc(kmem_cache_node, GFP_KERNEL);
4477 init_kmem_cache_node(n);
4481 * Any cache created after this point will also have kmem_cache_node
4482 * initialized for the new node.
4484 node_set(nid, slab_nodes);
4486 mutex_unlock(&slab_mutex);
4490 static int slab_memory_callback(struct notifier_block *self,
4491 unsigned long action, void *arg)
4496 case MEM_GOING_ONLINE:
4497 ret = slab_mem_going_online_callback(arg);
4499 case MEM_GOING_OFFLINE:
4500 ret = slab_mem_going_offline_callback(arg);
4503 case MEM_CANCEL_ONLINE:
4504 slab_mem_offline_callback(arg);
4507 case MEM_CANCEL_OFFLINE:
4511 ret = notifier_from_errno(ret);
4517 static struct notifier_block slab_memory_callback_nb = {
4518 .notifier_call = slab_memory_callback,
4519 .priority = SLAB_CALLBACK_PRI,
4522 /********************************************************************
4523 * Basic setup of slabs
4524 *******************************************************************/
4527 * Used for early kmem_cache structures that were allocated using
4528 * the page allocator. Allocate them properly then fix up the pointers
4529 * that may be pointing to the wrong kmem_cache structure.
4532 static struct kmem_cache * __init bootstrap(struct kmem_cache *static_cache)
4535 struct kmem_cache *s = kmem_cache_zalloc(kmem_cache, GFP_NOWAIT);
4536 struct kmem_cache_node *n;
4538 memcpy(s, static_cache, kmem_cache->object_size);
4541 * This runs very early, and only the boot processor is supposed to be
4542 * up. Even if it weren't true, IRQs are not up so we couldn't fire
4545 __flush_cpu_slab(s, smp_processor_id());
4546 for_each_kmem_cache_node(s, node, n) {
4549 list_for_each_entry(p, &n->partial, slab_list)
4552 #ifdef CONFIG_SLUB_DEBUG
4553 list_for_each_entry(p, &n->full, slab_list)
4557 list_add(&s->list, &slab_caches);
4561 void __init kmem_cache_init(void)
4563 static __initdata struct kmem_cache boot_kmem_cache,
4564 boot_kmem_cache_node;
4567 if (debug_guardpage_minorder())
4570 /* Print slub debugging pointers without hashing */
4571 if (__slub_debug_enabled())
4572 no_hash_pointers_enable(NULL);
4574 kmem_cache_node = &boot_kmem_cache_node;
4575 kmem_cache = &boot_kmem_cache;
4578 * Initialize the nodemask for which we will allocate per node
4579 * structures. Here we don't need taking slab_mutex yet.
4581 for_each_node_state(node, N_NORMAL_MEMORY)
4582 node_set(node, slab_nodes);
4584 create_boot_cache(kmem_cache_node, "kmem_cache_node",
4585 sizeof(struct kmem_cache_node), SLAB_HWCACHE_ALIGN, 0, 0);
4587 register_hotmemory_notifier(&slab_memory_callback_nb);
4589 /* Able to allocate the per node structures */
4590 slab_state = PARTIAL;
4592 create_boot_cache(kmem_cache, "kmem_cache",
4593 offsetof(struct kmem_cache, node) +
4594 nr_node_ids * sizeof(struct kmem_cache_node *),
4595 SLAB_HWCACHE_ALIGN, 0, 0);
4597 kmem_cache = bootstrap(&boot_kmem_cache);
4598 kmem_cache_node = bootstrap(&boot_kmem_cache_node);
4600 /* Now we can use the kmem_cache to allocate kmalloc slabs */
4601 setup_kmalloc_cache_index_table();
4602 create_kmalloc_caches(0);
4604 /* Setup random freelists for each cache */
4605 init_freelist_randomization();
4607 cpuhp_setup_state_nocalls(CPUHP_SLUB_DEAD, "slub:dead", NULL,
4610 pr_info("SLUB: HWalign=%d, Order=%u-%u, MinObjects=%u, CPUs=%u, Nodes=%u\n",
4612 slub_min_order, slub_max_order, slub_min_objects,
4613 nr_cpu_ids, nr_node_ids);
4616 void __init kmem_cache_init_late(void)
4621 __kmem_cache_alias(const char *name, unsigned int size, unsigned int align,
4622 slab_flags_t flags, void (*ctor)(void *))
4624 struct kmem_cache *s;
4626 s = find_mergeable(size, align, flags, name, ctor);
4631 * Adjust the object sizes so that we clear
4632 * the complete object on kzalloc.
4634 s->object_size = max(s->object_size, size);
4635 s->inuse = max(s->inuse, ALIGN(size, sizeof(void *)));
4637 if (sysfs_slab_alias(s, name)) {
4646 int __kmem_cache_create(struct kmem_cache *s, slab_flags_t flags)
4650 err = kmem_cache_open(s, flags);
4654 /* Mutex is not taken during early boot */
4655 if (slab_state <= UP)
4658 err = sysfs_slab_add(s);
4660 __kmem_cache_release(s);
4662 if (s->flags & SLAB_STORE_USER)
4663 debugfs_slab_add(s);
4668 void *__kmalloc_track_caller(size_t size, gfp_t gfpflags, unsigned long caller)
4670 struct kmem_cache *s;
4673 if (unlikely(size > KMALLOC_MAX_CACHE_SIZE))
4674 return kmalloc_large(size, gfpflags);
4676 s = kmalloc_slab(size, gfpflags);
4678 if (unlikely(ZERO_OR_NULL_PTR(s)))
4681 ret = slab_alloc(s, gfpflags, caller, size);
4683 /* Honor the call site pointer we received. */
4684 trace_kmalloc(caller, ret, size, s->size, gfpflags);
4688 EXPORT_SYMBOL(__kmalloc_track_caller);
4691 void *__kmalloc_node_track_caller(size_t size, gfp_t gfpflags,
4692 int node, unsigned long caller)
4694 struct kmem_cache *s;
4697 if (unlikely(size > KMALLOC_MAX_CACHE_SIZE)) {
4698 ret = kmalloc_large_node(size, gfpflags, node);
4700 trace_kmalloc_node(caller, ret,
4701 size, PAGE_SIZE << get_order(size),
4707 s = kmalloc_slab(size, gfpflags);
4709 if (unlikely(ZERO_OR_NULL_PTR(s)))
4712 ret = slab_alloc_node(s, gfpflags, node, caller, size);
4714 /* Honor the call site pointer we received. */
4715 trace_kmalloc_node(caller, ret, size, s->size, gfpflags, node);
4719 EXPORT_SYMBOL(__kmalloc_node_track_caller);
4723 static int count_inuse(struct page *page)
4728 static int count_total(struct page *page)
4730 return page->objects;
4734 #ifdef CONFIG_SLUB_DEBUG
4735 static void validate_slab(struct kmem_cache *s, struct page *page,
4736 unsigned long *obj_map)
4739 void *addr = page_address(page);
4743 if (!check_slab(s, page) || !on_freelist(s, page, NULL))
4746 /* Now we know that a valid freelist exists */
4747 __fill_map(obj_map, s, page);
4748 for_each_object(p, s, addr, page->objects) {
4749 u8 val = test_bit(__obj_to_index(s, addr, p), obj_map) ?
4750 SLUB_RED_INACTIVE : SLUB_RED_ACTIVE;
4752 if (!check_object(s, page, p, val))
4759 static int validate_slab_node(struct kmem_cache *s,
4760 struct kmem_cache_node *n, unsigned long *obj_map)
4762 unsigned long count = 0;
4764 unsigned long flags;
4766 spin_lock_irqsave(&n->list_lock, flags);
4768 list_for_each_entry(page, &n->partial, slab_list) {
4769 validate_slab(s, page, obj_map);
4772 if (count != n->nr_partial) {
4773 pr_err("SLUB %s: %ld partial slabs counted but counter=%ld\n",
4774 s->name, count, n->nr_partial);
4775 slab_add_kunit_errors();
4778 if (!(s->flags & SLAB_STORE_USER))
4781 list_for_each_entry(page, &n->full, slab_list) {
4782 validate_slab(s, page, obj_map);
4785 if (count != atomic_long_read(&n->nr_slabs)) {
4786 pr_err("SLUB: %s %ld slabs counted but counter=%ld\n",
4787 s->name, count, atomic_long_read(&n->nr_slabs));
4788 slab_add_kunit_errors();
4792 spin_unlock_irqrestore(&n->list_lock, flags);
4796 long validate_slab_cache(struct kmem_cache *s)
4799 unsigned long count = 0;
4800 struct kmem_cache_node *n;
4801 unsigned long *obj_map;
4803 obj_map = bitmap_alloc(oo_objects(s->oo), GFP_KERNEL);
4808 for_each_kmem_cache_node(s, node, n)
4809 count += validate_slab_node(s, n, obj_map);
4811 bitmap_free(obj_map);
4815 EXPORT_SYMBOL(validate_slab_cache);
4817 #ifdef CONFIG_DEBUG_FS
4819 * Generate lists of code addresses where slabcache objects are allocated
4824 unsigned long count;
4831 DECLARE_BITMAP(cpus, NR_CPUS);
4837 unsigned long count;
4838 struct location *loc;
4841 static struct dentry *slab_debugfs_root;
4843 static void free_loc_track(struct loc_track *t)
4846 free_pages((unsigned long)t->loc,
4847 get_order(sizeof(struct location) * t->max));
4850 static int alloc_loc_track(struct loc_track *t, unsigned long max, gfp_t flags)
4855 order = get_order(sizeof(struct location) * max);
4857 l = (void *)__get_free_pages(flags, order);
4862 memcpy(l, t->loc, sizeof(struct location) * t->count);
4870 static int add_location(struct loc_track *t, struct kmem_cache *s,
4871 const struct track *track)
4873 long start, end, pos;
4875 unsigned long caddr;
4876 unsigned long age = jiffies - track->when;
4882 pos = start + (end - start + 1) / 2;
4885 * There is nothing at "end". If we end up there
4886 * we need to add something to before end.
4891 caddr = t->loc[pos].addr;
4892 if (track->addr == caddr) {
4898 if (age < l->min_time)
4900 if (age > l->max_time)
4903 if (track->pid < l->min_pid)
4904 l->min_pid = track->pid;
4905 if (track->pid > l->max_pid)
4906 l->max_pid = track->pid;
4908 cpumask_set_cpu(track->cpu,
4909 to_cpumask(l->cpus));
4911 node_set(page_to_nid(virt_to_page(track)), l->nodes);
4915 if (track->addr < caddr)
4922 * Not found. Insert new tracking element.
4924 if (t->count >= t->max && !alloc_loc_track(t, 2 * t->max, GFP_ATOMIC))
4930 (t->count - pos) * sizeof(struct location));
4933 l->addr = track->addr;
4937 l->min_pid = track->pid;
4938 l->max_pid = track->pid;
4939 cpumask_clear(to_cpumask(l->cpus));
4940 cpumask_set_cpu(track->cpu, to_cpumask(l->cpus));
4941 nodes_clear(l->nodes);
4942 node_set(page_to_nid(virt_to_page(track)), l->nodes);
4946 static void process_slab(struct loc_track *t, struct kmem_cache *s,
4947 struct page *page, enum track_item alloc,
4948 unsigned long *obj_map)
4950 void *addr = page_address(page);
4953 __fill_map(obj_map, s, page);
4955 for_each_object(p, s, addr, page->objects)
4956 if (!test_bit(__obj_to_index(s, addr, p), obj_map))
4957 add_location(t, s, get_track(s, p, alloc));
4959 #endif /* CONFIG_DEBUG_FS */
4960 #endif /* CONFIG_SLUB_DEBUG */
4963 enum slab_stat_type {
4964 SL_ALL, /* All slabs */
4965 SL_PARTIAL, /* Only partially allocated slabs */
4966 SL_CPU, /* Only slabs used for cpu caches */
4967 SL_OBJECTS, /* Determine allocated objects not slabs */
4968 SL_TOTAL /* Determine object capacity not slabs */
4971 #define SO_ALL (1 << SL_ALL)
4972 #define SO_PARTIAL (1 << SL_PARTIAL)
4973 #define SO_CPU (1 << SL_CPU)
4974 #define SO_OBJECTS (1 << SL_OBJECTS)
4975 #define SO_TOTAL (1 << SL_TOTAL)
4977 static ssize_t show_slab_objects(struct kmem_cache *s,
4978 char *buf, unsigned long flags)
4980 unsigned long total = 0;
4983 unsigned long *nodes;
4986 nodes = kcalloc(nr_node_ids, sizeof(unsigned long), GFP_KERNEL);
4990 if (flags & SO_CPU) {
4993 for_each_possible_cpu(cpu) {
4994 struct kmem_cache_cpu *c = per_cpu_ptr(s->cpu_slab,
4999 page = READ_ONCE(c->page);
5003 node = page_to_nid(page);
5004 if (flags & SO_TOTAL)
5006 else if (flags & SO_OBJECTS)
5014 page = slub_percpu_partial_read_once(c);
5016 node = page_to_nid(page);
5017 if (flags & SO_TOTAL)
5019 else if (flags & SO_OBJECTS)
5030 * It is impossible to take "mem_hotplug_lock" here with "kernfs_mutex"
5031 * already held which will conflict with an existing lock order:
5033 * mem_hotplug_lock->slab_mutex->kernfs_mutex
5035 * We don't really need mem_hotplug_lock (to hold off
5036 * slab_mem_going_offline_callback) here because slab's memory hot
5037 * unplug code doesn't destroy the kmem_cache->node[] data.
5040 #ifdef CONFIG_SLUB_DEBUG
5041 if (flags & SO_ALL) {
5042 struct kmem_cache_node *n;
5044 for_each_kmem_cache_node(s, node, n) {
5046 if (flags & SO_TOTAL)
5047 x = atomic_long_read(&n->total_objects);
5048 else if (flags & SO_OBJECTS)
5049 x = atomic_long_read(&n->total_objects) -
5050 count_partial(n, count_free);
5052 x = atomic_long_read(&n->nr_slabs);
5059 if (flags & SO_PARTIAL) {
5060 struct kmem_cache_node *n;
5062 for_each_kmem_cache_node(s, node, n) {
5063 if (flags & SO_TOTAL)
5064 x = count_partial(n, count_total);
5065 else if (flags & SO_OBJECTS)
5066 x = count_partial(n, count_inuse);
5074 len += sysfs_emit_at(buf, len, "%lu", total);
5076 for (node = 0; node < nr_node_ids; node++) {
5078 len += sysfs_emit_at(buf, len, " N%d=%lu",
5082 len += sysfs_emit_at(buf, len, "\n");
5088 #define to_slab_attr(n) container_of(n, struct slab_attribute, attr)
5089 #define to_slab(n) container_of(n, struct kmem_cache, kobj)
5091 struct slab_attribute {
5092 struct attribute attr;
5093 ssize_t (*show)(struct kmem_cache *s, char *buf);
5094 ssize_t (*store)(struct kmem_cache *s, const char *x, size_t count);
5097 #define SLAB_ATTR_RO(_name) \
5098 static struct slab_attribute _name##_attr = \
5099 __ATTR(_name, 0400, _name##_show, NULL)
5101 #define SLAB_ATTR(_name) \
5102 static struct slab_attribute _name##_attr = \
5103 __ATTR(_name, 0600, _name##_show, _name##_store)
5105 static ssize_t slab_size_show(struct kmem_cache *s, char *buf)
5107 return sysfs_emit(buf, "%u\n", s->size);
5109 SLAB_ATTR_RO(slab_size);
5111 static ssize_t align_show(struct kmem_cache *s, char *buf)
5113 return sysfs_emit(buf, "%u\n", s->align);
5115 SLAB_ATTR_RO(align);
5117 static ssize_t object_size_show(struct kmem_cache *s, char *buf)
5119 return sysfs_emit(buf, "%u\n", s->object_size);
5121 SLAB_ATTR_RO(object_size);
5123 static ssize_t objs_per_slab_show(struct kmem_cache *s, char *buf)
5125 return sysfs_emit(buf, "%u\n", oo_objects(s->oo));
5127 SLAB_ATTR_RO(objs_per_slab);
5129 static ssize_t order_show(struct kmem_cache *s, char *buf)
5131 return sysfs_emit(buf, "%u\n", oo_order(s->oo));
5133 SLAB_ATTR_RO(order);
5135 static ssize_t min_partial_show(struct kmem_cache *s, char *buf)
5137 return sysfs_emit(buf, "%lu\n", s->min_partial);
5140 static ssize_t min_partial_store(struct kmem_cache *s, const char *buf,
5146 err = kstrtoul(buf, 10, &min);
5150 set_min_partial(s, min);
5153 SLAB_ATTR(min_partial);
5155 static ssize_t cpu_partial_show(struct kmem_cache *s, char *buf)
5157 return sysfs_emit(buf, "%u\n", slub_cpu_partial(s));
5160 static ssize_t cpu_partial_store(struct kmem_cache *s, const char *buf,
5163 unsigned int objects;
5166 err = kstrtouint(buf, 10, &objects);
5169 if (objects && !kmem_cache_has_cpu_partial(s))
5172 slub_set_cpu_partial(s, objects);
5176 SLAB_ATTR(cpu_partial);
5178 static ssize_t ctor_show(struct kmem_cache *s, char *buf)
5182 return sysfs_emit(buf, "%pS\n", s->ctor);
5186 static ssize_t aliases_show(struct kmem_cache *s, char *buf)
5188 return sysfs_emit(buf, "%d\n", s->refcount < 0 ? 0 : s->refcount - 1);
5190 SLAB_ATTR_RO(aliases);
5192 static ssize_t partial_show(struct kmem_cache *s, char *buf)
5194 return show_slab_objects(s, buf, SO_PARTIAL);
5196 SLAB_ATTR_RO(partial);
5198 static ssize_t cpu_slabs_show(struct kmem_cache *s, char *buf)
5200 return show_slab_objects(s, buf, SO_CPU);
5202 SLAB_ATTR_RO(cpu_slabs);
5204 static ssize_t objects_show(struct kmem_cache *s, char *buf)
5206 return show_slab_objects(s, buf, SO_ALL|SO_OBJECTS);
5208 SLAB_ATTR_RO(objects);
5210 static ssize_t objects_partial_show(struct kmem_cache *s, char *buf)
5212 return show_slab_objects(s, buf, SO_PARTIAL|SO_OBJECTS);
5214 SLAB_ATTR_RO(objects_partial);
5216 static ssize_t slabs_cpu_partial_show(struct kmem_cache *s, char *buf)
5223 for_each_online_cpu(cpu) {
5226 page = slub_percpu_partial(per_cpu_ptr(s->cpu_slab, cpu));
5229 pages += page->pages;
5230 objects += page->pobjects;
5234 len += sysfs_emit_at(buf, len, "%d(%d)", objects, pages);
5237 for_each_online_cpu(cpu) {
5240 page = slub_percpu_partial(per_cpu_ptr(s->cpu_slab, cpu));
5242 len += sysfs_emit_at(buf, len, " C%d=%d(%d)",
5243 cpu, page->pobjects, page->pages);
5246 len += sysfs_emit_at(buf, len, "\n");
5250 SLAB_ATTR_RO(slabs_cpu_partial);
5252 static ssize_t reclaim_account_show(struct kmem_cache *s, char *buf)
5254 return sysfs_emit(buf, "%d\n", !!(s->flags & SLAB_RECLAIM_ACCOUNT));
5256 SLAB_ATTR_RO(reclaim_account);
5258 static ssize_t hwcache_align_show(struct kmem_cache *s, char *buf)
5260 return sysfs_emit(buf, "%d\n", !!(s->flags & SLAB_HWCACHE_ALIGN));
5262 SLAB_ATTR_RO(hwcache_align);
5264 #ifdef CONFIG_ZONE_DMA
5265 static ssize_t cache_dma_show(struct kmem_cache *s, char *buf)
5267 return sysfs_emit(buf, "%d\n", !!(s->flags & SLAB_CACHE_DMA));
5269 SLAB_ATTR_RO(cache_dma);
5272 static ssize_t usersize_show(struct kmem_cache *s, char *buf)
5274 return sysfs_emit(buf, "%u\n", s->usersize);
5276 SLAB_ATTR_RO(usersize);
5278 static ssize_t destroy_by_rcu_show(struct kmem_cache *s, char *buf)
5280 return sysfs_emit(buf, "%d\n", !!(s->flags & SLAB_TYPESAFE_BY_RCU));
5282 SLAB_ATTR_RO(destroy_by_rcu);
5284 #ifdef CONFIG_SLUB_DEBUG
5285 static ssize_t slabs_show(struct kmem_cache *s, char *buf)
5287 return show_slab_objects(s, buf, SO_ALL);
5289 SLAB_ATTR_RO(slabs);
5291 static ssize_t total_objects_show(struct kmem_cache *s, char *buf)
5293 return show_slab_objects(s, buf, SO_ALL|SO_TOTAL);
5295 SLAB_ATTR_RO(total_objects);
5297 static ssize_t sanity_checks_show(struct kmem_cache *s, char *buf)
5299 return sysfs_emit(buf, "%d\n", !!(s->flags & SLAB_CONSISTENCY_CHECKS));
5301 SLAB_ATTR_RO(sanity_checks);
5303 static ssize_t trace_show(struct kmem_cache *s, char *buf)
5305 return sysfs_emit(buf, "%d\n", !!(s->flags & SLAB_TRACE));
5307 SLAB_ATTR_RO(trace);
5309 static ssize_t red_zone_show(struct kmem_cache *s, char *buf)
5311 return sysfs_emit(buf, "%d\n", !!(s->flags & SLAB_RED_ZONE));
5314 SLAB_ATTR_RO(red_zone);
5316 static ssize_t poison_show(struct kmem_cache *s, char *buf)
5318 return sysfs_emit(buf, "%d\n", !!(s->flags & SLAB_POISON));
5321 SLAB_ATTR_RO(poison);
5323 static ssize_t store_user_show(struct kmem_cache *s, char *buf)
5325 return sysfs_emit(buf, "%d\n", !!(s->flags & SLAB_STORE_USER));
5328 SLAB_ATTR_RO(store_user);
5330 static ssize_t validate_show(struct kmem_cache *s, char *buf)
5335 static ssize_t validate_store(struct kmem_cache *s,
5336 const char *buf, size_t length)
5340 if (buf[0] == '1') {
5341 ret = validate_slab_cache(s);
5347 SLAB_ATTR(validate);
5349 #endif /* CONFIG_SLUB_DEBUG */
5351 #ifdef CONFIG_FAILSLAB
5352 static ssize_t failslab_show(struct kmem_cache *s, char *buf)
5354 return sysfs_emit(buf, "%d\n", !!(s->flags & SLAB_FAILSLAB));
5356 SLAB_ATTR_RO(failslab);
5359 static ssize_t shrink_show(struct kmem_cache *s, char *buf)
5364 static ssize_t shrink_store(struct kmem_cache *s,
5365 const char *buf, size_t length)
5368 kmem_cache_shrink(s);
5376 static ssize_t remote_node_defrag_ratio_show(struct kmem_cache *s, char *buf)
5378 return sysfs_emit(buf, "%u\n", s->remote_node_defrag_ratio / 10);
5381 static ssize_t remote_node_defrag_ratio_store(struct kmem_cache *s,
5382 const char *buf, size_t length)
5387 err = kstrtouint(buf, 10, &ratio);
5393 s->remote_node_defrag_ratio = ratio * 10;
5397 SLAB_ATTR(remote_node_defrag_ratio);
5400 #ifdef CONFIG_SLUB_STATS
5401 static int show_stat(struct kmem_cache *s, char *buf, enum stat_item si)
5403 unsigned long sum = 0;
5406 int *data = kmalloc_array(nr_cpu_ids, sizeof(int), GFP_KERNEL);
5411 for_each_online_cpu(cpu) {
5412 unsigned x = per_cpu_ptr(s->cpu_slab, cpu)->stat[si];
5418 len += sysfs_emit_at(buf, len, "%lu", sum);
5421 for_each_online_cpu(cpu) {
5423 len += sysfs_emit_at(buf, len, " C%d=%u",
5428 len += sysfs_emit_at(buf, len, "\n");
5433 static void clear_stat(struct kmem_cache *s, enum stat_item si)
5437 for_each_online_cpu(cpu)
5438 per_cpu_ptr(s->cpu_slab, cpu)->stat[si] = 0;
5441 #define STAT_ATTR(si, text) \
5442 static ssize_t text##_show(struct kmem_cache *s, char *buf) \
5444 return show_stat(s, buf, si); \
5446 static ssize_t text##_store(struct kmem_cache *s, \
5447 const char *buf, size_t length) \
5449 if (buf[0] != '0') \
5451 clear_stat(s, si); \
5456 STAT_ATTR(ALLOC_FASTPATH, alloc_fastpath);
5457 STAT_ATTR(ALLOC_SLOWPATH, alloc_slowpath);
5458 STAT_ATTR(FREE_FASTPATH, free_fastpath);
5459 STAT_ATTR(FREE_SLOWPATH, free_slowpath);
5460 STAT_ATTR(FREE_FROZEN, free_frozen);
5461 STAT_ATTR(FREE_ADD_PARTIAL, free_add_partial);
5462 STAT_ATTR(FREE_REMOVE_PARTIAL, free_remove_partial);
5463 STAT_ATTR(ALLOC_FROM_PARTIAL, alloc_from_partial);
5464 STAT_ATTR(ALLOC_SLAB, alloc_slab);
5465 STAT_ATTR(ALLOC_REFILL, alloc_refill);
5466 STAT_ATTR(ALLOC_NODE_MISMATCH, alloc_node_mismatch);
5467 STAT_ATTR(FREE_SLAB, free_slab);
5468 STAT_ATTR(CPUSLAB_FLUSH, cpuslab_flush);
5469 STAT_ATTR(DEACTIVATE_FULL, deactivate_full);
5470 STAT_ATTR(DEACTIVATE_EMPTY, deactivate_empty);
5471 STAT_ATTR(DEACTIVATE_TO_HEAD, deactivate_to_head);
5472 STAT_ATTR(DEACTIVATE_TO_TAIL, deactivate_to_tail);
5473 STAT_ATTR(DEACTIVATE_REMOTE_FREES, deactivate_remote_frees);
5474 STAT_ATTR(DEACTIVATE_BYPASS, deactivate_bypass);
5475 STAT_ATTR(ORDER_FALLBACK, order_fallback);
5476 STAT_ATTR(CMPXCHG_DOUBLE_CPU_FAIL, cmpxchg_double_cpu_fail);
5477 STAT_ATTR(CMPXCHG_DOUBLE_FAIL, cmpxchg_double_fail);
5478 STAT_ATTR(CPU_PARTIAL_ALLOC, cpu_partial_alloc);
5479 STAT_ATTR(CPU_PARTIAL_FREE, cpu_partial_free);
5480 STAT_ATTR(CPU_PARTIAL_NODE, cpu_partial_node);
5481 STAT_ATTR(CPU_PARTIAL_DRAIN, cpu_partial_drain);
5482 #endif /* CONFIG_SLUB_STATS */
5484 static struct attribute *slab_attrs[] = {
5485 &slab_size_attr.attr,
5486 &object_size_attr.attr,
5487 &objs_per_slab_attr.attr,
5489 &min_partial_attr.attr,
5490 &cpu_partial_attr.attr,
5492 &objects_partial_attr.attr,
5494 &cpu_slabs_attr.attr,
5498 &hwcache_align_attr.attr,
5499 &reclaim_account_attr.attr,
5500 &destroy_by_rcu_attr.attr,
5502 &slabs_cpu_partial_attr.attr,
5503 #ifdef CONFIG_SLUB_DEBUG
5504 &total_objects_attr.attr,
5506 &sanity_checks_attr.attr,
5508 &red_zone_attr.attr,
5510 &store_user_attr.attr,
5511 &validate_attr.attr,
5513 #ifdef CONFIG_ZONE_DMA
5514 &cache_dma_attr.attr,
5517 &remote_node_defrag_ratio_attr.attr,
5519 #ifdef CONFIG_SLUB_STATS
5520 &alloc_fastpath_attr.attr,
5521 &alloc_slowpath_attr.attr,
5522 &free_fastpath_attr.attr,
5523 &free_slowpath_attr.attr,
5524 &free_frozen_attr.attr,
5525 &free_add_partial_attr.attr,
5526 &free_remove_partial_attr.attr,
5527 &alloc_from_partial_attr.attr,
5528 &alloc_slab_attr.attr,
5529 &alloc_refill_attr.attr,
5530 &alloc_node_mismatch_attr.attr,
5531 &free_slab_attr.attr,
5532 &cpuslab_flush_attr.attr,
5533 &deactivate_full_attr.attr,
5534 &deactivate_empty_attr.attr,
5535 &deactivate_to_head_attr.attr,
5536 &deactivate_to_tail_attr.attr,
5537 &deactivate_remote_frees_attr.attr,
5538 &deactivate_bypass_attr.attr,
5539 &order_fallback_attr.attr,
5540 &cmpxchg_double_fail_attr.attr,
5541 &cmpxchg_double_cpu_fail_attr.attr,
5542 &cpu_partial_alloc_attr.attr,
5543 &cpu_partial_free_attr.attr,
5544 &cpu_partial_node_attr.attr,
5545 &cpu_partial_drain_attr.attr,
5547 #ifdef CONFIG_FAILSLAB
5548 &failslab_attr.attr,
5550 &usersize_attr.attr,
5555 static const struct attribute_group slab_attr_group = {
5556 .attrs = slab_attrs,
5559 static ssize_t slab_attr_show(struct kobject *kobj,
5560 struct attribute *attr,
5563 struct slab_attribute *attribute;
5564 struct kmem_cache *s;
5567 attribute = to_slab_attr(attr);
5570 if (!attribute->show)
5573 err = attribute->show(s, buf);
5578 static ssize_t slab_attr_store(struct kobject *kobj,
5579 struct attribute *attr,
5580 const char *buf, size_t len)
5582 struct slab_attribute *attribute;
5583 struct kmem_cache *s;
5586 attribute = to_slab_attr(attr);
5589 if (!attribute->store)
5592 err = attribute->store(s, buf, len);
5596 static void kmem_cache_release(struct kobject *k)
5598 slab_kmem_cache_release(to_slab(k));
5601 static const struct sysfs_ops slab_sysfs_ops = {
5602 .show = slab_attr_show,
5603 .store = slab_attr_store,
5606 static struct kobj_type slab_ktype = {
5607 .sysfs_ops = &slab_sysfs_ops,
5608 .release = kmem_cache_release,
5611 static struct kset *slab_kset;
5613 static inline struct kset *cache_kset(struct kmem_cache *s)
5618 #define ID_STR_LENGTH 64
5620 /* Create a unique string id for a slab cache:
5622 * Format :[flags-]size
5624 static char *create_unique_id(struct kmem_cache *s)
5626 char *name = kmalloc(ID_STR_LENGTH, GFP_KERNEL);
5633 * First flags affecting slabcache operations. We will only
5634 * get here for aliasable slabs so we do not need to support
5635 * too many flags. The flags here must cover all flags that
5636 * are matched during merging to guarantee that the id is
5639 if (s->flags & SLAB_CACHE_DMA)
5641 if (s->flags & SLAB_CACHE_DMA32)
5643 if (s->flags & SLAB_RECLAIM_ACCOUNT)
5645 if (s->flags & SLAB_CONSISTENCY_CHECKS)
5647 if (s->flags & SLAB_ACCOUNT)
5651 p += sprintf(p, "%07u", s->size);
5653 BUG_ON(p > name + ID_STR_LENGTH - 1);
5657 static int sysfs_slab_add(struct kmem_cache *s)
5661 struct kset *kset = cache_kset(s);
5662 int unmergeable = slab_unmergeable(s);
5665 kobject_init(&s->kobj, &slab_ktype);
5669 if (!unmergeable && disable_higher_order_debug &&
5670 (slub_debug & DEBUG_METADATA_FLAGS))
5675 * Slabcache can never be merged so we can use the name proper.
5676 * This is typically the case for debug situations. In that
5677 * case we can catch duplicate names easily.
5679 sysfs_remove_link(&slab_kset->kobj, s->name);
5683 * Create a unique name for the slab as a target
5686 name = create_unique_id(s);
5689 s->kobj.kset = kset;
5690 err = kobject_init_and_add(&s->kobj, &slab_ktype, NULL, "%s", name);
5694 err = sysfs_create_group(&s->kobj, &slab_attr_group);
5699 /* Setup first alias */
5700 sysfs_slab_alias(s, s->name);
5707 kobject_del(&s->kobj);
5711 void sysfs_slab_unlink(struct kmem_cache *s)
5713 if (slab_state >= FULL)
5714 kobject_del(&s->kobj);
5717 void sysfs_slab_release(struct kmem_cache *s)
5719 if (slab_state >= FULL)
5720 kobject_put(&s->kobj);
5724 * Need to buffer aliases during bootup until sysfs becomes
5725 * available lest we lose that information.
5727 struct saved_alias {
5728 struct kmem_cache *s;
5730 struct saved_alias *next;
5733 static struct saved_alias *alias_list;
5735 static int sysfs_slab_alias(struct kmem_cache *s, const char *name)
5737 struct saved_alias *al;
5739 if (slab_state == FULL) {
5741 * If we have a leftover link then remove it.
5743 sysfs_remove_link(&slab_kset->kobj, name);
5744 return sysfs_create_link(&slab_kset->kobj, &s->kobj, name);
5747 al = kmalloc(sizeof(struct saved_alias), GFP_KERNEL);
5753 al->next = alias_list;
5758 static int __init slab_sysfs_init(void)
5760 struct kmem_cache *s;
5763 mutex_lock(&slab_mutex);
5765 slab_kset = kset_create_and_add("slab", NULL, kernel_kobj);
5767 mutex_unlock(&slab_mutex);
5768 pr_err("Cannot register slab subsystem.\n");
5774 list_for_each_entry(s, &slab_caches, list) {
5775 err = sysfs_slab_add(s);
5777 pr_err("SLUB: Unable to add boot slab %s to sysfs\n",
5781 while (alias_list) {
5782 struct saved_alias *al = alias_list;
5784 alias_list = alias_list->next;
5785 err = sysfs_slab_alias(al->s, al->name);
5787 pr_err("SLUB: Unable to add boot slab alias %s to sysfs\n",
5792 mutex_unlock(&slab_mutex);
5796 __initcall(slab_sysfs_init);
5797 #endif /* CONFIG_SYSFS */
5799 #if defined(CONFIG_SLUB_DEBUG) && defined(CONFIG_DEBUG_FS)
5800 static int slab_debugfs_show(struct seq_file *seq, void *v)
5804 unsigned int idx = *(unsigned int *)v;
5805 struct loc_track *t = seq->private;
5807 if (idx < t->count) {
5810 seq_printf(seq, "%7ld ", l->count);
5813 seq_printf(seq, "%pS", (void *)l->addr);
5815 seq_puts(seq, "<not-available>");
5817 if (l->sum_time != l->min_time) {
5818 seq_printf(seq, " age=%ld/%llu/%ld",
5819 l->min_time, div_u64(l->sum_time, l->count),
5822 seq_printf(seq, " age=%ld", l->min_time);
5824 if (l->min_pid != l->max_pid)
5825 seq_printf(seq, " pid=%ld-%ld", l->min_pid, l->max_pid);
5827 seq_printf(seq, " pid=%ld",
5830 if (num_online_cpus() > 1 && !cpumask_empty(to_cpumask(l->cpus)))
5831 seq_printf(seq, " cpus=%*pbl",
5832 cpumask_pr_args(to_cpumask(l->cpus)));
5834 if (nr_online_nodes > 1 && !nodes_empty(l->nodes))
5835 seq_printf(seq, " nodes=%*pbl",
5836 nodemask_pr_args(&l->nodes));
5838 seq_puts(seq, "\n");
5841 if (!idx && !t->count)
5842 seq_puts(seq, "No data\n");
5847 static void slab_debugfs_stop(struct seq_file *seq, void *v)
5851 static void *slab_debugfs_next(struct seq_file *seq, void *v, loff_t *ppos)
5853 struct loc_track *t = seq->private;
5857 if (*ppos <= t->count)
5863 static void *slab_debugfs_start(struct seq_file *seq, loff_t *ppos)
5868 static const struct seq_operations slab_debugfs_sops = {
5869 .start = slab_debugfs_start,
5870 .next = slab_debugfs_next,
5871 .stop = slab_debugfs_stop,
5872 .show = slab_debugfs_show,
5875 static int slab_debug_trace_open(struct inode *inode, struct file *filep)
5878 struct kmem_cache_node *n;
5879 enum track_item alloc;
5881 struct loc_track *t = __seq_open_private(filep, &slab_debugfs_sops,
5882 sizeof(struct loc_track));
5883 struct kmem_cache *s = file_inode(filep)->i_private;
5884 unsigned long *obj_map;
5886 obj_map = bitmap_alloc(oo_objects(s->oo), GFP_KERNEL);
5890 if (strcmp(filep->f_path.dentry->d_name.name, "alloc_traces") == 0)
5891 alloc = TRACK_ALLOC;
5895 if (!alloc_loc_track(t, PAGE_SIZE / sizeof(struct location), GFP_KERNEL)) {
5896 bitmap_free(obj_map);
5900 for_each_kmem_cache_node(s, node, n) {
5901 unsigned long flags;
5904 if (!atomic_long_read(&n->nr_slabs))
5907 spin_lock_irqsave(&n->list_lock, flags);
5908 list_for_each_entry(page, &n->partial, slab_list)
5909 process_slab(t, s, page, alloc, obj_map);
5910 list_for_each_entry(page, &n->full, slab_list)
5911 process_slab(t, s, page, alloc, obj_map);
5912 spin_unlock_irqrestore(&n->list_lock, flags);
5915 bitmap_free(obj_map);
5919 static int slab_debug_trace_release(struct inode *inode, struct file *file)
5921 struct seq_file *seq = file->private_data;
5922 struct loc_track *t = seq->private;
5925 return seq_release_private(inode, file);
5928 static const struct file_operations slab_debugfs_fops = {
5929 .open = slab_debug_trace_open,
5931 .llseek = seq_lseek,
5932 .release = slab_debug_trace_release,
5935 static void debugfs_slab_add(struct kmem_cache *s)
5937 struct dentry *slab_cache_dir;
5939 if (unlikely(!slab_debugfs_root))
5942 slab_cache_dir = debugfs_create_dir(s->name, slab_debugfs_root);
5944 debugfs_create_file("alloc_traces", 0400,
5945 slab_cache_dir, s, &slab_debugfs_fops);
5947 debugfs_create_file("free_traces", 0400,
5948 slab_cache_dir, s, &slab_debugfs_fops);
5951 void debugfs_slab_release(struct kmem_cache *s)
5953 debugfs_remove_recursive(debugfs_lookup(s->name, slab_debugfs_root));
5956 static int __init slab_debugfs_init(void)
5958 struct kmem_cache *s;
5960 slab_debugfs_root = debugfs_create_dir("slab", NULL);
5962 list_for_each_entry(s, &slab_caches, list)
5963 if (s->flags & SLAB_STORE_USER)
5964 debugfs_slab_add(s);
5969 __initcall(slab_debugfs_init);
5972 * The /proc/slabinfo ABI
5974 #ifdef CONFIG_SLUB_DEBUG
5975 void get_slabinfo(struct kmem_cache *s, struct slabinfo *sinfo)
5977 unsigned long nr_slabs = 0;
5978 unsigned long nr_objs = 0;
5979 unsigned long nr_free = 0;
5981 struct kmem_cache_node *n;
5983 for_each_kmem_cache_node(s, node, n) {
5984 nr_slabs += node_nr_slabs(n);
5985 nr_objs += node_nr_objs(n);
5986 nr_free += count_partial(n, count_free);
5989 sinfo->active_objs = nr_objs - nr_free;
5990 sinfo->num_objs = nr_objs;
5991 sinfo->active_slabs = nr_slabs;
5992 sinfo->num_slabs = nr_slabs;
5993 sinfo->objects_per_slab = oo_objects(s->oo);
5994 sinfo->cache_order = oo_order(s->oo);
5997 void slabinfo_show_stats(struct seq_file *m, struct kmem_cache *s)
6001 ssize_t slabinfo_write(struct file *file, const char __user *buffer,
6002 size_t count, loff_t *ppos)
6006 #endif /* CONFIG_SLUB_DEBUG */