2 * Slab allocator functions that are independent of the allocator strategy
4 * (C) 2012 Christoph Lameter <cl@linux.com>
6 #include <linux/slab.h>
9 #include <linux/poison.h>
10 #include <linux/interrupt.h>
11 #include <linux/memory.h>
12 #include <linux/compiler.h>
13 #include <linux/module.h>
14 #include <linux/cpu.h>
15 #include <linux/uaccess.h>
16 #include <linux/seq_file.h>
17 #include <linux/proc_fs.h>
18 #include <asm/cacheflush.h>
19 #include <asm/tlbflush.h>
21 #include <linux/memcontrol.h>
23 #define CREATE_TRACE_POINTS
24 #include <trace/events/kmem.h>
28 enum slab_state slab_state;
29 LIST_HEAD(slab_caches);
30 DEFINE_MUTEX(slab_mutex);
31 struct kmem_cache *kmem_cache;
33 static LIST_HEAD(slab_caches_to_rcu_destroy);
34 static void slab_caches_to_rcu_destroy_workfn(struct work_struct *work);
35 static DECLARE_WORK(slab_caches_to_rcu_destroy_work,
36 slab_caches_to_rcu_destroy_workfn);
39 * Set of flags that will prevent slab merging
41 #define SLAB_NEVER_MERGE (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER | \
42 SLAB_TRACE | SLAB_DESTROY_BY_RCU | SLAB_NOLEAKTRACE | \
43 SLAB_FAILSLAB | SLAB_KASAN)
45 #define SLAB_MERGE_SAME (SLAB_RECLAIM_ACCOUNT | SLAB_CACHE_DMA | \
46 SLAB_NOTRACK | SLAB_ACCOUNT)
49 * Merge control. If this is set then no merging of slab caches will occur.
50 * (Could be removed. This was introduced to pacify the merge skeptics.)
52 static int slab_nomerge;
54 static int __init setup_slab_nomerge(char *str)
61 __setup_param("slub_nomerge", slub_nomerge, setup_slab_nomerge, 0);
64 __setup("slab_nomerge", setup_slab_nomerge);
67 * Determine the size of a slab object
69 unsigned int kmem_cache_size(struct kmem_cache *s)
71 return s->object_size;
73 EXPORT_SYMBOL(kmem_cache_size);
75 #ifdef CONFIG_DEBUG_VM
76 static int kmem_cache_sanity_check(const char *name, size_t size)
78 struct kmem_cache *s = NULL;
80 if (!name || in_interrupt() || size < sizeof(void *) ||
81 size > KMALLOC_MAX_SIZE) {
82 pr_err("kmem_cache_create(%s) integrity check failed\n", name);
86 list_for_each_entry(s, &slab_caches, list) {
91 * This happens when the module gets unloaded and doesn't
92 * destroy its slab cache and no-one else reuses the vmalloc
93 * area of the module. Print a warning.
95 res = probe_kernel_address(s->name, tmp);
97 pr_err("Slab cache with size %d has lost its name\n",
103 WARN_ON(strchr(name, ' ')); /* It confuses parsers */
107 static inline int kmem_cache_sanity_check(const char *name, size_t size)
113 void __kmem_cache_free_bulk(struct kmem_cache *s, size_t nr, void **p)
117 for (i = 0; i < nr; i++) {
119 kmem_cache_free(s, p[i]);
125 int __kmem_cache_alloc_bulk(struct kmem_cache *s, gfp_t flags, size_t nr,
130 for (i = 0; i < nr; i++) {
131 void *x = p[i] = kmem_cache_alloc(s, flags);
133 __kmem_cache_free_bulk(s, i, p);
140 #if defined(CONFIG_MEMCG) && !defined(CONFIG_SLOB)
141 void slab_init_memcg_params(struct kmem_cache *s)
143 s->memcg_params.root_cache = NULL;
144 RCU_INIT_POINTER(s->memcg_params.memcg_caches, NULL);
145 INIT_LIST_HEAD(&s->memcg_params.children);
148 static int init_memcg_params(struct kmem_cache *s,
149 struct mem_cgroup *memcg, struct kmem_cache *root_cache)
151 struct memcg_cache_array *arr;
154 s->memcg_params.root_cache = root_cache;
155 s->memcg_params.memcg = memcg;
156 INIT_LIST_HEAD(&s->memcg_params.children_node);
160 slab_init_memcg_params(s);
162 if (!memcg_nr_cache_ids)
165 arr = kzalloc(sizeof(struct memcg_cache_array) +
166 memcg_nr_cache_ids * sizeof(void *),
171 RCU_INIT_POINTER(s->memcg_params.memcg_caches, arr);
175 static void destroy_memcg_params(struct kmem_cache *s)
177 if (is_root_cache(s))
178 kfree(rcu_access_pointer(s->memcg_params.memcg_caches));
181 static int update_memcg_params(struct kmem_cache *s, int new_array_size)
183 struct memcg_cache_array *old, *new;
185 if (!is_root_cache(s))
188 new = kzalloc(sizeof(struct memcg_cache_array) +
189 new_array_size * sizeof(void *), GFP_KERNEL);
193 old = rcu_dereference_protected(s->memcg_params.memcg_caches,
194 lockdep_is_held(&slab_mutex));
196 memcpy(new->entries, old->entries,
197 memcg_nr_cache_ids * sizeof(void *));
199 rcu_assign_pointer(s->memcg_params.memcg_caches, new);
205 int memcg_update_all_caches(int num_memcgs)
207 struct kmem_cache *s;
210 mutex_lock(&slab_mutex);
211 list_for_each_entry(s, &slab_caches, list) {
212 ret = update_memcg_params(s, num_memcgs);
214 * Instead of freeing the memory, we'll just leave the caches
215 * up to this point in an updated state.
220 mutex_unlock(&slab_mutex);
224 static void unlink_memcg_cache(struct kmem_cache *s)
226 list_del(&s->memcg_params.children_node);
229 static inline int init_memcg_params(struct kmem_cache *s,
230 struct mem_cgroup *memcg, struct kmem_cache *root_cache)
235 static inline void destroy_memcg_params(struct kmem_cache *s)
239 static inline void unlink_memcg_cache(struct kmem_cache *s)
242 #endif /* CONFIG_MEMCG && !CONFIG_SLOB */
245 * Find a mergeable slab cache
247 int slab_unmergeable(struct kmem_cache *s)
249 if (slab_nomerge || (s->flags & SLAB_NEVER_MERGE))
252 if (!is_root_cache(s))
259 * We may have set a slab to be unmergeable during bootstrap.
267 struct kmem_cache *find_mergeable(size_t size, size_t align,
268 unsigned long flags, const char *name, void (*ctor)(void *))
270 struct kmem_cache *s;
278 size = ALIGN(size, sizeof(void *));
279 align = calculate_alignment(flags, align, size);
280 size = ALIGN(size, align);
281 flags = kmem_cache_flags(size, flags, name, NULL);
283 if (flags & SLAB_NEVER_MERGE)
286 list_for_each_entry_reverse(s, &slab_caches, list) {
287 if (slab_unmergeable(s))
293 if ((flags & SLAB_MERGE_SAME) != (s->flags & SLAB_MERGE_SAME))
296 * Check if alignment is compatible.
297 * Courtesy of Adrian Drzewiecki
299 if ((s->size & ~(align - 1)) != s->size)
302 if (s->size - size >= sizeof(void *))
305 if (IS_ENABLED(CONFIG_SLAB) && align &&
306 (align > s->align || s->align % align))
315 * Figure out what the alignment of the objects will be given a set of
316 * flags, a user specified alignment and the size of the objects.
318 unsigned long calculate_alignment(unsigned long flags,
319 unsigned long align, unsigned long size)
322 * If the user wants hardware cache aligned objects then follow that
323 * suggestion if the object is sufficiently large.
325 * The hardware cache alignment cannot override the specified
326 * alignment though. If that is greater then use it.
328 if (flags & SLAB_HWCACHE_ALIGN) {
329 unsigned long ralign = cache_line_size();
330 while (size <= ralign / 2)
332 align = max(align, ralign);
335 if (align < ARCH_SLAB_MINALIGN)
336 align = ARCH_SLAB_MINALIGN;
338 return ALIGN(align, sizeof(void *));
341 static struct kmem_cache *create_cache(const char *name,
342 size_t object_size, size_t size, size_t align,
343 unsigned long flags, void (*ctor)(void *),
344 struct mem_cgroup *memcg, struct kmem_cache *root_cache)
346 struct kmem_cache *s;
350 s = kmem_cache_zalloc(kmem_cache, GFP_KERNEL);
355 s->object_size = object_size;
360 err = init_memcg_params(s, memcg, root_cache);
364 err = __kmem_cache_create(s, flags);
369 list_add(&s->list, &slab_caches);
376 destroy_memcg_params(s);
377 kmem_cache_free(kmem_cache, s);
382 * kmem_cache_create - Create a cache.
383 * @name: A string which is used in /proc/slabinfo to identify this cache.
384 * @size: The size of objects to be created in this cache.
385 * @align: The required alignment for the objects.
387 * @ctor: A constructor for the objects.
389 * Returns a ptr to the cache on success, NULL on failure.
390 * Cannot be called within a interrupt, but can be interrupted.
391 * The @ctor is run when new pages are allocated by the cache.
395 * %SLAB_POISON - Poison the slab with a known test pattern (a5a5a5a5)
396 * to catch references to uninitialised memory.
398 * %SLAB_RED_ZONE - Insert `Red' zones around the allocated memory to check
399 * for buffer overruns.
401 * %SLAB_HWCACHE_ALIGN - Align the objects in this cache to a hardware
402 * cacheline. This can be beneficial if you're counting cycles as closely
406 kmem_cache_create(const char *name, size_t size, size_t align,
407 unsigned long flags, void (*ctor)(void *))
409 struct kmem_cache *s = NULL;
410 const char *cache_name;
415 memcg_get_cache_ids();
417 mutex_lock(&slab_mutex);
419 err = kmem_cache_sanity_check(name, size);
424 /* Refuse requests with allocator specific flags */
425 if (flags & ~SLAB_FLAGS_PERMITTED) {
431 * Some allocators will constraint the set of valid flags to a subset
432 * of all flags. We expect them to define CACHE_CREATE_MASK in this
433 * case, and we'll just provide them with a sanitized version of the
436 flags &= CACHE_CREATE_MASK;
438 s = __kmem_cache_alias(name, size, align, flags, ctor);
442 cache_name = kstrdup_const(name, GFP_KERNEL);
448 s = create_cache(cache_name, size, size,
449 calculate_alignment(flags, align, size),
450 flags, ctor, NULL, NULL);
453 kfree_const(cache_name);
457 mutex_unlock(&slab_mutex);
459 memcg_put_cache_ids();
464 if (flags & SLAB_PANIC)
465 panic("kmem_cache_create: Failed to create slab '%s'. Error %d\n",
468 pr_warn("kmem_cache_create(%s) failed with error %d\n",
476 EXPORT_SYMBOL(kmem_cache_create);
478 static void slab_caches_to_rcu_destroy_workfn(struct work_struct *work)
480 LIST_HEAD(to_destroy);
481 struct kmem_cache *s, *s2;
484 * On destruction, SLAB_DESTROY_BY_RCU kmem_caches are put on the
485 * @slab_caches_to_rcu_destroy list. The slab pages are freed
486 * through RCU and and the associated kmem_cache are dereferenced
487 * while freeing the pages, so the kmem_caches should be freed only
488 * after the pending RCU operations are finished. As rcu_barrier()
489 * is a pretty slow operation, we batch all pending destructions
492 mutex_lock(&slab_mutex);
493 list_splice_init(&slab_caches_to_rcu_destroy, &to_destroy);
494 mutex_unlock(&slab_mutex);
496 if (list_empty(&to_destroy))
501 list_for_each_entry_safe(s, s2, &to_destroy, list) {
502 #ifdef SLAB_SUPPORTS_SYSFS
503 sysfs_slab_release(s);
505 slab_kmem_cache_release(s);
510 static int shutdown_cache(struct kmem_cache *s)
512 if (__kmem_cache_shutdown(s) != 0)
516 if (!is_root_cache(s))
517 unlink_memcg_cache(s);
519 if (s->flags & SLAB_DESTROY_BY_RCU) {
520 list_add_tail(&s->list, &slab_caches_to_rcu_destroy);
521 schedule_work(&slab_caches_to_rcu_destroy_work);
523 #ifdef SLAB_SUPPORTS_SYSFS
524 sysfs_slab_release(s);
526 slab_kmem_cache_release(s);
533 #if defined(CONFIG_MEMCG) && !defined(CONFIG_SLOB)
535 * memcg_create_kmem_cache - Create a cache for a memory cgroup.
536 * @memcg: The memory cgroup the new cache is for.
537 * @root_cache: The parent of the new cache.
539 * This function attempts to create a kmem cache that will serve allocation
540 * requests going from @memcg to @root_cache. The new cache inherits properties
543 void memcg_create_kmem_cache(struct mem_cgroup *memcg,
544 struct kmem_cache *root_cache)
546 static char memcg_name_buf[NAME_MAX + 1]; /* protected by slab_mutex */
547 struct cgroup_subsys_state *css = &memcg->css;
548 struct memcg_cache_array *arr;
549 struct kmem_cache *s = NULL;
556 mutex_lock(&slab_mutex);
559 * The memory cgroup could have been offlined while the cache
560 * creation work was pending.
562 if (memcg->kmem_state != KMEM_ONLINE)
565 idx = memcg_cache_id(memcg);
566 arr = rcu_dereference_protected(root_cache->memcg_params.memcg_caches,
567 lockdep_is_held(&slab_mutex));
570 * Since per-memcg caches are created asynchronously on first
571 * allocation (see memcg_kmem_get_cache()), several threads can try to
572 * create the same cache, but only one of them may succeed.
574 if (arr->entries[idx])
577 cgroup_name(css->cgroup, memcg_name_buf, sizeof(memcg_name_buf));
578 cache_name = kasprintf(GFP_KERNEL, "%s(%llu:%s)", root_cache->name,
579 css->serial_nr, memcg_name_buf);
583 s = create_cache(cache_name, root_cache->object_size,
584 root_cache->size, root_cache->align,
585 root_cache->flags & CACHE_CREATE_MASK,
586 root_cache->ctor, memcg, root_cache);
588 * If we could not create a memcg cache, do not complain, because
589 * that's not critical at all as we can always proceed with the root
597 list_add(&s->memcg_params.children_node,
598 &root_cache->memcg_params.children);
601 * Since readers won't lock (see cache_from_memcg_idx()), we need a
602 * barrier here to ensure nobody will see the kmem_cache partially
606 arr->entries[idx] = s;
609 mutex_unlock(&slab_mutex);
615 void memcg_deactivate_kmem_caches(struct mem_cgroup *memcg)
618 struct memcg_cache_array *arr;
619 struct kmem_cache *s, *c;
621 idx = memcg_cache_id(memcg);
626 mutex_lock(&slab_mutex);
627 list_for_each_entry(s, &slab_caches, list) {
628 if (!is_root_cache(s))
631 arr = rcu_dereference_protected(s->memcg_params.memcg_caches,
632 lockdep_is_held(&slab_mutex));
633 c = arr->entries[idx];
637 __kmem_cache_shrink(c, true);
638 arr->entries[idx] = NULL;
640 mutex_unlock(&slab_mutex);
646 void memcg_destroy_kmem_caches(struct mem_cgroup *memcg)
648 struct kmem_cache *s, *s2;
653 mutex_lock(&slab_mutex);
654 list_for_each_entry_safe(s, s2, &slab_caches, list) {
655 if (is_root_cache(s) || s->memcg_params.memcg != memcg)
658 * The cgroup is about to be freed and therefore has no charges
659 * left. Hence, all its caches must be empty by now.
661 BUG_ON(shutdown_cache(s));
663 mutex_unlock(&slab_mutex);
669 static int shutdown_memcg_caches(struct kmem_cache *s)
671 struct memcg_cache_array *arr;
672 struct kmem_cache *c, *c2;
676 BUG_ON(!is_root_cache(s));
679 * First, shutdown active caches, i.e. caches that belong to online
682 arr = rcu_dereference_protected(s->memcg_params.memcg_caches,
683 lockdep_is_held(&slab_mutex));
684 for_each_memcg_cache_index(i) {
688 if (shutdown_cache(c))
690 * The cache still has objects. Move it to a temporary
691 * list so as not to try to destroy it for a second
692 * time while iterating over inactive caches below.
694 list_move(&c->memcg_params.children_node, &busy);
697 * The cache is empty and will be destroyed soon. Clear
698 * the pointer to it in the memcg_caches array so that
699 * it will never be accessed even if the root cache
702 arr->entries[i] = NULL;
706 * Second, shutdown all caches left from memory cgroups that are now
709 list_for_each_entry_safe(c, c2, &s->memcg_params.children,
710 memcg_params.children_node)
713 list_splice(&busy, &s->memcg_params.children);
716 * A cache being destroyed must be empty. In particular, this means
717 * that all per memcg caches attached to it must be empty too.
719 if (!list_empty(&s->memcg_params.children))
724 static inline int shutdown_memcg_caches(struct kmem_cache *s)
728 #endif /* CONFIG_MEMCG && !CONFIG_SLOB */
730 void slab_kmem_cache_release(struct kmem_cache *s)
732 __kmem_cache_release(s);
733 destroy_memcg_params(s);
734 kfree_const(s->name);
735 kmem_cache_free(kmem_cache, s);
738 void kmem_cache_destroy(struct kmem_cache *s)
748 kasan_cache_destroy(s);
749 mutex_lock(&slab_mutex);
755 err = shutdown_memcg_caches(s);
757 err = shutdown_cache(s);
760 pr_err("kmem_cache_destroy %s: Slab cache still has objects\n",
765 mutex_unlock(&slab_mutex);
770 EXPORT_SYMBOL(kmem_cache_destroy);
773 * kmem_cache_shrink - Shrink a cache.
774 * @cachep: The cache to shrink.
776 * Releases as many slabs as possible for a cache.
777 * To help debugging, a zero exit status indicates all slabs were released.
779 int kmem_cache_shrink(struct kmem_cache *cachep)
785 kasan_cache_shrink(cachep);
786 ret = __kmem_cache_shrink(cachep, false);
791 EXPORT_SYMBOL(kmem_cache_shrink);
793 bool slab_is_available(void)
795 return slab_state >= UP;
799 /* Create a cache during boot when no slab services are available yet */
800 void __init create_boot_cache(struct kmem_cache *s, const char *name, size_t size,
806 s->size = s->object_size = size;
807 s->align = calculate_alignment(flags, ARCH_KMALLOC_MINALIGN, size);
809 slab_init_memcg_params(s);
811 err = __kmem_cache_create(s, flags);
814 panic("Creation of kmalloc slab %s size=%zu failed. Reason %d\n",
817 s->refcount = -1; /* Exempt from merging for now */
820 struct kmem_cache *__init create_kmalloc_cache(const char *name, size_t size,
823 struct kmem_cache *s = kmem_cache_zalloc(kmem_cache, GFP_NOWAIT);
826 panic("Out of memory when creating slab %s\n", name);
828 create_boot_cache(s, name, size, flags);
829 list_add(&s->list, &slab_caches);
834 struct kmem_cache *kmalloc_caches[KMALLOC_SHIFT_HIGH + 1];
835 EXPORT_SYMBOL(kmalloc_caches);
837 #ifdef CONFIG_ZONE_DMA
838 struct kmem_cache *kmalloc_dma_caches[KMALLOC_SHIFT_HIGH + 1];
839 EXPORT_SYMBOL(kmalloc_dma_caches);
843 * Conversion table for small slabs sizes / 8 to the index in the
844 * kmalloc array. This is necessary for slabs < 192 since we have non power
845 * of two cache sizes there. The size of larger slabs can be determined using
848 static s8 size_index[24] = {
875 static inline int size_index_elem(size_t bytes)
877 return (bytes - 1) / 8;
881 * Find the kmem_cache structure that serves a given size of
884 struct kmem_cache *kmalloc_slab(size_t size, gfp_t flags)
888 if (unlikely(size > KMALLOC_MAX_SIZE)) {
889 WARN_ON_ONCE(!(flags & __GFP_NOWARN));
895 return ZERO_SIZE_PTR;
897 index = size_index[size_index_elem(size)];
899 index = fls(size - 1);
901 #ifdef CONFIG_ZONE_DMA
902 if (unlikely((flags & GFP_DMA)))
903 return kmalloc_dma_caches[index];
906 return kmalloc_caches[index];
910 * kmalloc_info[] is to make slub_debug=,kmalloc-xx option work at boot time.
911 * kmalloc_index() supports up to 2^26=64MB, so the final entry of the table is
914 const struct kmalloc_info_struct kmalloc_info[] __initconst = {
915 {NULL, 0}, {"kmalloc-96", 96},
916 {"kmalloc-192", 192}, {"kmalloc-8", 8},
917 {"kmalloc-16", 16}, {"kmalloc-32", 32},
918 {"kmalloc-64", 64}, {"kmalloc-128", 128},
919 {"kmalloc-256", 256}, {"kmalloc-512", 512},
920 {"kmalloc-1024", 1024}, {"kmalloc-2048", 2048},
921 {"kmalloc-4096", 4096}, {"kmalloc-8192", 8192},
922 {"kmalloc-16384", 16384}, {"kmalloc-32768", 32768},
923 {"kmalloc-65536", 65536}, {"kmalloc-131072", 131072},
924 {"kmalloc-262144", 262144}, {"kmalloc-524288", 524288},
925 {"kmalloc-1048576", 1048576}, {"kmalloc-2097152", 2097152},
926 {"kmalloc-4194304", 4194304}, {"kmalloc-8388608", 8388608},
927 {"kmalloc-16777216", 16777216}, {"kmalloc-33554432", 33554432},
928 {"kmalloc-67108864", 67108864}
932 * Patch up the size_index table if we have strange large alignment
933 * requirements for the kmalloc array. This is only the case for
934 * MIPS it seems. The standard arches will not generate any code here.
936 * Largest permitted alignment is 256 bytes due to the way we
937 * handle the index determination for the smaller caches.
939 * Make sure that nothing crazy happens if someone starts tinkering
940 * around with ARCH_KMALLOC_MINALIGN
942 void __init setup_kmalloc_cache_index_table(void)
946 BUILD_BUG_ON(KMALLOC_MIN_SIZE > 256 ||
947 (KMALLOC_MIN_SIZE & (KMALLOC_MIN_SIZE - 1)));
949 for (i = 8; i < KMALLOC_MIN_SIZE; i += 8) {
950 int elem = size_index_elem(i);
952 if (elem >= ARRAY_SIZE(size_index))
954 size_index[elem] = KMALLOC_SHIFT_LOW;
957 if (KMALLOC_MIN_SIZE >= 64) {
959 * The 96 byte size cache is not used if the alignment
962 for (i = 64 + 8; i <= 96; i += 8)
963 size_index[size_index_elem(i)] = 7;
967 if (KMALLOC_MIN_SIZE >= 128) {
969 * The 192 byte sized cache is not used if the alignment
970 * is 128 byte. Redirect kmalloc to use the 256 byte cache
973 for (i = 128 + 8; i <= 192; i += 8)
974 size_index[size_index_elem(i)] = 8;
978 static void __init new_kmalloc_cache(int idx, unsigned long flags)
980 kmalloc_caches[idx] = create_kmalloc_cache(kmalloc_info[idx].name,
981 kmalloc_info[idx].size, flags);
985 * Create the kmalloc array. Some of the regular kmalloc arrays
986 * may already have been created because they were needed to
987 * enable allocations for slab creation.
989 void __init create_kmalloc_caches(unsigned long flags)
993 for (i = KMALLOC_SHIFT_LOW; i <= KMALLOC_SHIFT_HIGH; i++) {
994 if (!kmalloc_caches[i])
995 new_kmalloc_cache(i, flags);
998 * Caches that are not of the two-to-the-power-of size.
999 * These have to be created immediately after the
1000 * earlier power of two caches
1002 if (KMALLOC_MIN_SIZE <= 32 && !kmalloc_caches[1] && i == 6)
1003 new_kmalloc_cache(1, flags);
1004 if (KMALLOC_MIN_SIZE <= 64 && !kmalloc_caches[2] && i == 7)
1005 new_kmalloc_cache(2, flags);
1008 /* Kmalloc array is now usable */
1011 #ifdef CONFIG_ZONE_DMA
1012 for (i = 0; i <= KMALLOC_SHIFT_HIGH; i++) {
1013 struct kmem_cache *s = kmalloc_caches[i];
1016 int size = kmalloc_size(i);
1017 char *n = kasprintf(GFP_NOWAIT,
1018 "dma-kmalloc-%d", size);
1021 kmalloc_dma_caches[i] = create_kmalloc_cache(n,
1022 size, SLAB_CACHE_DMA | flags);
1027 #endif /* !CONFIG_SLOB */
1030 * To avoid unnecessary overhead, we pass through large allocation requests
1031 * directly to the page allocator. We use __GFP_COMP, because we will need to
1032 * know the allocation order to free the pages properly in kfree.
1034 void *kmalloc_order(size_t size, gfp_t flags, unsigned int order)
1039 flags |= __GFP_COMP;
1040 page = alloc_pages(flags, order);
1041 ret = page ? page_address(page) : NULL;
1042 kmemleak_alloc(ret, size, 1, flags);
1043 kasan_kmalloc_large(ret, size, flags);
1046 EXPORT_SYMBOL(kmalloc_order);
1048 #ifdef CONFIG_TRACING
1049 void *kmalloc_order_trace(size_t size, gfp_t flags, unsigned int order)
1051 void *ret = kmalloc_order(size, flags, order);
1052 trace_kmalloc(_RET_IP_, ret, size, PAGE_SIZE << order, flags);
1055 EXPORT_SYMBOL(kmalloc_order_trace);
1058 #ifdef CONFIG_SLAB_FREELIST_RANDOM
1059 /* Randomize a generic freelist */
1060 static void freelist_randomize(struct rnd_state *state, unsigned int *list,
1066 for (i = 0; i < count; i++)
1069 /* Fisher-Yates shuffle */
1070 for (i = count - 1; i > 0; i--) {
1071 rand = prandom_u32_state(state);
1073 swap(list[i], list[rand]);
1077 /* Create a random sequence per cache */
1078 int cache_random_seq_create(struct kmem_cache *cachep, unsigned int count,
1081 struct rnd_state state;
1083 if (count < 2 || cachep->random_seq)
1086 cachep->random_seq = kcalloc(count, sizeof(unsigned int), gfp);
1087 if (!cachep->random_seq)
1090 /* Get best entropy at this stage of boot */
1091 prandom_seed_state(&state, get_random_long());
1093 freelist_randomize(&state, cachep->random_seq, count);
1097 /* Destroy the per-cache random freelist sequence */
1098 void cache_random_seq_destroy(struct kmem_cache *cachep)
1100 kfree(cachep->random_seq);
1101 cachep->random_seq = NULL;
1103 #endif /* CONFIG_SLAB_FREELIST_RANDOM */
1105 #ifdef CONFIG_SLABINFO
1108 #define SLABINFO_RIGHTS (S_IWUSR | S_IRUSR)
1110 #define SLABINFO_RIGHTS S_IRUSR
1113 static void print_slabinfo_header(struct seq_file *m)
1116 * Output format version, so at least we can change it
1117 * without _too_ many complaints.
1119 #ifdef CONFIG_DEBUG_SLAB
1120 seq_puts(m, "slabinfo - version: 2.1 (statistics)\n");
1122 seq_puts(m, "slabinfo - version: 2.1\n");
1124 seq_puts(m, "# name <active_objs> <num_objs> <objsize> <objperslab> <pagesperslab>");
1125 seq_puts(m, " : tunables <limit> <batchcount> <sharedfactor>");
1126 seq_puts(m, " : slabdata <active_slabs> <num_slabs> <sharedavail>");
1127 #ifdef CONFIG_DEBUG_SLAB
1128 seq_puts(m, " : globalstat <listallocs> <maxobjs> <grown> <reaped> <error> <maxfreeable> <nodeallocs> <remotefrees> <alienoverflow>");
1129 seq_puts(m, " : cpustat <allochit> <allocmiss> <freehit> <freemiss>");
1134 void *slab_start(struct seq_file *m, loff_t *pos)
1136 mutex_lock(&slab_mutex);
1137 return seq_list_start(&slab_caches, *pos);
1140 void *slab_next(struct seq_file *m, void *p, loff_t *pos)
1142 return seq_list_next(p, &slab_caches, pos);
1145 void slab_stop(struct seq_file *m, void *p)
1147 mutex_unlock(&slab_mutex);
1151 memcg_accumulate_slabinfo(struct kmem_cache *s, struct slabinfo *info)
1153 struct kmem_cache *c;
1154 struct slabinfo sinfo;
1156 if (!is_root_cache(s))
1159 for_each_memcg_cache(c, s) {
1160 memset(&sinfo, 0, sizeof(sinfo));
1161 get_slabinfo(c, &sinfo);
1163 info->active_slabs += sinfo.active_slabs;
1164 info->num_slabs += sinfo.num_slabs;
1165 info->shared_avail += sinfo.shared_avail;
1166 info->active_objs += sinfo.active_objs;
1167 info->num_objs += sinfo.num_objs;
1171 static void cache_show(struct kmem_cache *s, struct seq_file *m)
1173 struct slabinfo sinfo;
1175 memset(&sinfo, 0, sizeof(sinfo));
1176 get_slabinfo(s, &sinfo);
1178 memcg_accumulate_slabinfo(s, &sinfo);
1180 seq_printf(m, "%-17s %6lu %6lu %6u %4u %4d",
1181 cache_name(s), sinfo.active_objs, sinfo.num_objs, s->size,
1182 sinfo.objects_per_slab, (1 << sinfo.cache_order));
1184 seq_printf(m, " : tunables %4u %4u %4u",
1185 sinfo.limit, sinfo.batchcount, sinfo.shared);
1186 seq_printf(m, " : slabdata %6lu %6lu %6lu",
1187 sinfo.active_slabs, sinfo.num_slabs, sinfo.shared_avail);
1188 slabinfo_show_stats(m, s);
1192 static int slab_show(struct seq_file *m, void *p)
1194 struct kmem_cache *s = list_entry(p, struct kmem_cache, list);
1196 if (p == slab_caches.next)
1197 print_slabinfo_header(m);
1198 if (is_root_cache(s))
1203 #if defined(CONFIG_MEMCG) && !defined(CONFIG_SLOB)
1204 int memcg_slab_show(struct seq_file *m, void *p)
1206 struct kmem_cache *s = list_entry(p, struct kmem_cache, list);
1207 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
1209 if (p == slab_caches.next)
1210 print_slabinfo_header(m);
1211 if (!is_root_cache(s) && s->memcg_params.memcg == memcg)
1218 * slabinfo_op - iterator that generates /proc/slabinfo
1227 * num-pages-per-slab
1228 * + further values on SMP and with statistics enabled
1230 static const struct seq_operations slabinfo_op = {
1231 .start = slab_start,
1237 static int slabinfo_open(struct inode *inode, struct file *file)
1239 return seq_open(file, &slabinfo_op);
1242 static const struct file_operations proc_slabinfo_operations = {
1243 .open = slabinfo_open,
1245 .write = slabinfo_write,
1246 .llseek = seq_lseek,
1247 .release = seq_release,
1250 static int __init slab_proc_init(void)
1252 proc_create("slabinfo", SLABINFO_RIGHTS, NULL,
1253 &proc_slabinfo_operations);
1256 module_init(slab_proc_init);
1257 #endif /* CONFIG_SLABINFO */
1259 static __always_inline void *__do_krealloc(const void *p, size_t new_size,
1268 if (ks >= new_size) {
1269 kasan_krealloc((void *)p, new_size, flags);
1273 ret = kmalloc_track_caller(new_size, flags);
1281 * __krealloc - like krealloc() but don't free @p.
1282 * @p: object to reallocate memory for.
1283 * @new_size: how many bytes of memory are required.
1284 * @flags: the type of memory to allocate.
1286 * This function is like krealloc() except it never frees the originally
1287 * allocated buffer. Use this if you don't want to free the buffer immediately
1288 * like, for example, with RCU.
1290 void *__krealloc(const void *p, size_t new_size, gfp_t flags)
1292 if (unlikely(!new_size))
1293 return ZERO_SIZE_PTR;
1295 return __do_krealloc(p, new_size, flags);
1298 EXPORT_SYMBOL(__krealloc);
1301 * krealloc - reallocate memory. The contents will remain unchanged.
1302 * @p: object to reallocate memory for.
1303 * @new_size: how many bytes of memory are required.
1304 * @flags: the type of memory to allocate.
1306 * The contents of the object pointed to are preserved up to the
1307 * lesser of the new and old sizes. If @p is %NULL, krealloc()
1308 * behaves exactly like kmalloc(). If @new_size is 0 and @p is not a
1309 * %NULL pointer, the object pointed to is freed.
1311 void *krealloc(const void *p, size_t new_size, gfp_t flags)
1315 if (unlikely(!new_size)) {
1317 return ZERO_SIZE_PTR;
1320 ret = __do_krealloc(p, new_size, flags);
1321 if (ret && p != ret)
1326 EXPORT_SYMBOL(krealloc);
1329 * kzfree - like kfree but zero memory
1330 * @p: object to free memory of
1332 * The memory of the object @p points to is zeroed before freed.
1333 * If @p is %NULL, kzfree() does nothing.
1335 * Note: this function zeroes the whole allocated buffer which can be a good
1336 * deal bigger than the requested buffer size passed to kmalloc(). So be
1337 * careful when using this function in performance sensitive code.
1339 void kzfree(const void *p)
1342 void *mem = (void *)p;
1344 if (unlikely(ZERO_OR_NULL_PTR(mem)))
1350 EXPORT_SYMBOL(kzfree);
1352 /* Tracepoints definitions. */
1353 EXPORT_TRACEPOINT_SYMBOL(kmalloc);
1354 EXPORT_TRACEPOINT_SYMBOL(kmem_cache_alloc);
1355 EXPORT_TRACEPOINT_SYMBOL(kmalloc_node);
1356 EXPORT_TRACEPOINT_SYMBOL(kmem_cache_alloc_node);
1357 EXPORT_TRACEPOINT_SYMBOL(kfree);
1358 EXPORT_TRACEPOINT_SYMBOL(kmem_cache_free);