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;
34 * Set of flags that will prevent slab merging
36 #define SLAB_NEVER_MERGE (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER | \
37 SLAB_TRACE | SLAB_DESTROY_BY_RCU | SLAB_NOLEAKTRACE | \
40 #define SLAB_MERGE_SAME (SLAB_DEBUG_FREE | SLAB_RECLAIM_ACCOUNT | \
41 SLAB_CACHE_DMA | SLAB_NOTRACK)
44 * Merge control. If this is set then no merging of slab caches will occur.
45 * (Could be removed. This was introduced to pacify the merge skeptics.)
47 static int slab_nomerge;
49 static int __init setup_slab_nomerge(char *str)
56 __setup_param("slub_nomerge", slub_nomerge, setup_slab_nomerge, 0);
59 __setup("slab_nomerge", setup_slab_nomerge);
62 * Determine the size of a slab object
64 unsigned int kmem_cache_size(struct kmem_cache *s)
66 return s->object_size;
68 EXPORT_SYMBOL(kmem_cache_size);
70 #ifdef CONFIG_DEBUG_VM
71 static int kmem_cache_sanity_check(const char *name, size_t size)
73 struct kmem_cache *s = NULL;
75 if (!name || in_interrupt() || size < sizeof(void *) ||
76 size > KMALLOC_MAX_SIZE) {
77 pr_err("kmem_cache_create(%s) integrity check failed\n", name);
81 list_for_each_entry(s, &slab_caches, list) {
86 * This happens when the module gets unloaded and doesn't
87 * destroy its slab cache and no-one else reuses the vmalloc
88 * area of the module. Print a warning.
90 res = probe_kernel_address(s->name, tmp);
92 pr_err("Slab cache with size %d has lost its name\n",
98 WARN_ON(strchr(name, ' ')); /* It confuses parsers */
102 static inline int kmem_cache_sanity_check(const char *name, size_t size)
108 #ifdef CONFIG_MEMCG_KMEM
109 void slab_init_memcg_params(struct kmem_cache *s)
111 s->memcg_params.is_root_cache = true;
112 INIT_LIST_HEAD(&s->memcg_params.list);
113 RCU_INIT_POINTER(s->memcg_params.memcg_caches, NULL);
116 static int init_memcg_params(struct kmem_cache *s,
117 struct mem_cgroup *memcg, struct kmem_cache *root_cache)
119 struct memcg_cache_array *arr;
122 s->memcg_params.is_root_cache = false;
123 s->memcg_params.memcg = memcg;
124 s->memcg_params.root_cache = root_cache;
128 slab_init_memcg_params(s);
130 if (!memcg_nr_cache_ids)
133 arr = kzalloc(sizeof(struct memcg_cache_array) +
134 memcg_nr_cache_ids * sizeof(void *),
139 RCU_INIT_POINTER(s->memcg_params.memcg_caches, arr);
143 static void destroy_memcg_params(struct kmem_cache *s)
145 if (is_root_cache(s))
146 kfree(rcu_access_pointer(s->memcg_params.memcg_caches));
149 static int update_memcg_params(struct kmem_cache *s, int new_array_size)
151 struct memcg_cache_array *old, *new;
153 if (!is_root_cache(s))
156 new = kzalloc(sizeof(struct memcg_cache_array) +
157 new_array_size * sizeof(void *), GFP_KERNEL);
161 old = rcu_dereference_protected(s->memcg_params.memcg_caches,
162 lockdep_is_held(&slab_mutex));
164 memcpy(new->entries, old->entries,
165 memcg_nr_cache_ids * sizeof(void *));
167 rcu_assign_pointer(s->memcg_params.memcg_caches, new);
173 int memcg_update_all_caches(int num_memcgs)
175 struct kmem_cache *s;
178 mutex_lock(&slab_mutex);
179 list_for_each_entry(s, &slab_caches, list) {
180 ret = update_memcg_params(s, num_memcgs);
182 * Instead of freeing the memory, we'll just leave the caches
183 * up to this point in an updated state.
188 mutex_unlock(&slab_mutex);
192 static inline int init_memcg_params(struct kmem_cache *s,
193 struct mem_cgroup *memcg, struct kmem_cache *root_cache)
198 static inline void destroy_memcg_params(struct kmem_cache *s)
201 #endif /* CONFIG_MEMCG_KMEM */
204 * Find a mergeable slab cache
206 int slab_unmergeable(struct kmem_cache *s)
208 if (slab_nomerge || (s->flags & SLAB_NEVER_MERGE))
211 if (!is_root_cache(s))
218 * We may have set a slab to be unmergeable during bootstrap.
226 struct kmem_cache *find_mergeable(size_t size, size_t align,
227 unsigned long flags, const char *name, void (*ctor)(void *))
229 struct kmem_cache *s;
231 if (slab_nomerge || (flags & SLAB_NEVER_MERGE))
237 size = ALIGN(size, sizeof(void *));
238 align = calculate_alignment(flags, align, size);
239 size = ALIGN(size, align);
240 flags = kmem_cache_flags(size, flags, name, NULL);
242 list_for_each_entry_reverse(s, &slab_caches, list) {
243 if (slab_unmergeable(s))
249 if ((flags & SLAB_MERGE_SAME) != (s->flags & SLAB_MERGE_SAME))
252 * Check if alignment is compatible.
253 * Courtesy of Adrian Drzewiecki
255 if ((s->size & ~(align - 1)) != s->size)
258 if (s->size - size >= sizeof(void *))
261 if (IS_ENABLED(CONFIG_SLAB) && align &&
262 (align > s->align || s->align % align))
271 * Figure out what the alignment of the objects will be given a set of
272 * flags, a user specified alignment and the size of the objects.
274 unsigned long calculate_alignment(unsigned long flags,
275 unsigned long align, unsigned long size)
278 * If the user wants hardware cache aligned objects then follow that
279 * suggestion if the object is sufficiently large.
281 * The hardware cache alignment cannot override the specified
282 * alignment though. If that is greater then use it.
284 if (flags & SLAB_HWCACHE_ALIGN) {
285 unsigned long ralign = cache_line_size();
286 while (size <= ralign / 2)
288 align = max(align, ralign);
291 if (align < ARCH_SLAB_MINALIGN)
292 align = ARCH_SLAB_MINALIGN;
294 return ALIGN(align, sizeof(void *));
297 static struct kmem_cache *
298 do_kmem_cache_create(char *name, size_t object_size, size_t size, size_t align,
299 unsigned long flags, void (*ctor)(void *),
300 struct mem_cgroup *memcg, struct kmem_cache *root_cache)
302 struct kmem_cache *s;
306 s = kmem_cache_zalloc(kmem_cache, GFP_KERNEL);
311 s->object_size = object_size;
316 err = init_memcg_params(s, memcg, root_cache);
320 err = __kmem_cache_create(s, flags);
325 list_add(&s->list, &slab_caches);
332 destroy_memcg_params(s);
333 kmem_cache_free(kmem_cache, s);
338 * kmem_cache_create - Create a cache.
339 * @name: A string which is used in /proc/slabinfo to identify this cache.
340 * @size: The size of objects to be created in this cache.
341 * @align: The required alignment for the objects.
343 * @ctor: A constructor for the objects.
345 * Returns a ptr to the cache on success, NULL on failure.
346 * Cannot be called within a interrupt, but can be interrupted.
347 * The @ctor is run when new pages are allocated by the cache.
351 * %SLAB_POISON - Poison the slab with a known test pattern (a5a5a5a5)
352 * to catch references to uninitialised memory.
354 * %SLAB_RED_ZONE - Insert `Red' zones around the allocated memory to check
355 * for buffer overruns.
357 * %SLAB_HWCACHE_ALIGN - Align the objects in this cache to a hardware
358 * cacheline. This can be beneficial if you're counting cycles as closely
362 kmem_cache_create(const char *name, size_t size, size_t align,
363 unsigned long flags, void (*ctor)(void *))
365 struct kmem_cache *s;
371 memcg_get_cache_ids();
373 mutex_lock(&slab_mutex);
375 err = kmem_cache_sanity_check(name, size);
377 s = NULL; /* suppress uninit var warning */
382 * Some allocators will constraint the set of valid flags to a subset
383 * of all flags. We expect them to define CACHE_CREATE_MASK in this
384 * case, and we'll just provide them with a sanitized version of the
387 flags &= CACHE_CREATE_MASK;
389 s = __kmem_cache_alias(name, size, align, flags, ctor);
393 cache_name = kstrdup(name, GFP_KERNEL);
399 s = do_kmem_cache_create(cache_name, size, size,
400 calculate_alignment(flags, align, size),
401 flags, ctor, NULL, NULL);
408 mutex_unlock(&slab_mutex);
410 memcg_put_cache_ids();
415 if (flags & SLAB_PANIC)
416 panic("kmem_cache_create: Failed to create slab '%s'. Error %d\n",
419 printk(KERN_WARNING "kmem_cache_create(%s) failed with error %d",
427 EXPORT_SYMBOL(kmem_cache_create);
429 static int do_kmem_cache_shutdown(struct kmem_cache *s,
430 struct list_head *release, bool *need_rcu_barrier)
432 if (__kmem_cache_shutdown(s) != 0) {
433 printk(KERN_ERR "kmem_cache_destroy %s: "
434 "Slab cache still has objects\n", s->name);
439 if (s->flags & SLAB_DESTROY_BY_RCU)
440 *need_rcu_barrier = true;
442 #ifdef CONFIG_MEMCG_KMEM
443 if (!is_root_cache(s))
444 list_del(&s->memcg_params.list);
446 list_move(&s->list, release);
450 static void do_kmem_cache_release(struct list_head *release,
451 bool need_rcu_barrier)
453 struct kmem_cache *s, *s2;
455 if (need_rcu_barrier)
458 list_for_each_entry_safe(s, s2, release, list) {
459 #ifdef SLAB_SUPPORTS_SYSFS
460 sysfs_slab_remove(s);
462 slab_kmem_cache_release(s);
467 #ifdef CONFIG_MEMCG_KMEM
469 * memcg_create_kmem_cache - Create a cache for a memory cgroup.
470 * @memcg: The memory cgroup the new cache is for.
471 * @root_cache: The parent of the new cache.
473 * This function attempts to create a kmem cache that will serve allocation
474 * requests going from @memcg to @root_cache. The new cache inherits properties
477 void memcg_create_kmem_cache(struct mem_cgroup *memcg,
478 struct kmem_cache *root_cache)
480 static char memcg_name_buf[NAME_MAX + 1]; /* protected by slab_mutex */
481 struct cgroup_subsys_state *css = mem_cgroup_css(memcg);
482 struct memcg_cache_array *arr;
483 struct kmem_cache *s = NULL;
490 mutex_lock(&slab_mutex);
493 * The memory cgroup could have been deactivated while the cache
494 * creation work was pending.
496 if (!memcg_kmem_is_active(memcg))
499 idx = memcg_cache_id(memcg);
500 arr = rcu_dereference_protected(root_cache->memcg_params.memcg_caches,
501 lockdep_is_held(&slab_mutex));
504 * Since per-memcg caches are created asynchronously on first
505 * allocation (see memcg_kmem_get_cache()), several threads can try to
506 * create the same cache, but only one of them may succeed.
508 if (arr->entries[idx])
511 cgroup_name(css->cgroup, memcg_name_buf, sizeof(memcg_name_buf));
512 cache_name = kasprintf(GFP_KERNEL, "%s(%d:%s)", root_cache->name,
513 css->id, memcg_name_buf);
517 s = do_kmem_cache_create(cache_name, root_cache->object_size,
518 root_cache->size, root_cache->align,
519 root_cache->flags, root_cache->ctor,
522 * If we could not create a memcg cache, do not complain, because
523 * that's not critical at all as we can always proceed with the root
531 list_add(&s->memcg_params.list, &root_cache->memcg_params.list);
534 * Since readers won't lock (see cache_from_memcg_idx()), we need a
535 * barrier here to ensure nobody will see the kmem_cache partially
539 arr->entries[idx] = s;
542 mutex_unlock(&slab_mutex);
548 void memcg_deactivate_kmem_caches(struct mem_cgroup *memcg)
551 struct memcg_cache_array *arr;
552 struct kmem_cache *s;
554 idx = memcg_cache_id(memcg);
556 mutex_lock(&slab_mutex);
557 list_for_each_entry(s, &slab_caches, list) {
558 if (!is_root_cache(s))
561 arr = rcu_dereference_protected(s->memcg_params.memcg_caches,
562 lockdep_is_held(&slab_mutex));
563 arr->entries[idx] = NULL;
565 mutex_unlock(&slab_mutex);
568 void memcg_destroy_kmem_caches(struct mem_cgroup *memcg)
571 bool need_rcu_barrier = false;
572 struct kmem_cache *s, *s2;
577 mutex_lock(&slab_mutex);
578 list_for_each_entry_safe(s, s2, &slab_caches, list) {
579 if (is_root_cache(s) || s->memcg_params.memcg != memcg)
582 * The cgroup is about to be freed and therefore has no charges
583 * left. Hence, all its caches must be empty by now.
585 BUG_ON(do_kmem_cache_shutdown(s, &release, &need_rcu_barrier));
587 mutex_unlock(&slab_mutex);
592 do_kmem_cache_release(&release, need_rcu_barrier);
594 #endif /* CONFIG_MEMCG_KMEM */
596 void slab_kmem_cache_release(struct kmem_cache *s)
598 destroy_memcg_params(s);
600 kmem_cache_free(kmem_cache, s);
603 void kmem_cache_destroy(struct kmem_cache *s)
605 struct kmem_cache *c, *c2;
607 bool need_rcu_barrier = false;
610 BUG_ON(!is_root_cache(s));
615 mutex_lock(&slab_mutex);
621 for_each_memcg_cache_safe(c, c2, s) {
622 if (do_kmem_cache_shutdown(c, &release, &need_rcu_barrier))
627 do_kmem_cache_shutdown(s, &release, &need_rcu_barrier);
630 mutex_unlock(&slab_mutex);
635 do_kmem_cache_release(&release, need_rcu_barrier);
637 EXPORT_SYMBOL(kmem_cache_destroy);
640 * kmem_cache_shrink - Shrink a cache.
641 * @cachep: The cache to shrink.
643 * Releases as many slabs as possible for a cache.
644 * To help debugging, a zero exit status indicates all slabs were released.
646 int kmem_cache_shrink(struct kmem_cache *cachep)
652 ret = __kmem_cache_shrink(cachep);
657 EXPORT_SYMBOL(kmem_cache_shrink);
659 int slab_is_available(void)
661 return slab_state >= UP;
665 /* Create a cache during boot when no slab services are available yet */
666 void __init create_boot_cache(struct kmem_cache *s, const char *name, size_t size,
672 s->size = s->object_size = size;
673 s->align = calculate_alignment(flags, ARCH_KMALLOC_MINALIGN, size);
675 slab_init_memcg_params(s);
677 err = __kmem_cache_create(s, flags);
680 panic("Creation of kmalloc slab %s size=%zu failed. Reason %d\n",
683 s->refcount = -1; /* Exempt from merging for now */
686 struct kmem_cache *__init create_kmalloc_cache(const char *name, size_t size,
689 struct kmem_cache *s = kmem_cache_zalloc(kmem_cache, GFP_NOWAIT);
692 panic("Out of memory when creating slab %s\n", name);
694 create_boot_cache(s, name, size, flags);
695 list_add(&s->list, &slab_caches);
700 struct kmem_cache *kmalloc_caches[KMALLOC_SHIFT_HIGH + 1];
701 EXPORT_SYMBOL(kmalloc_caches);
703 #ifdef CONFIG_ZONE_DMA
704 struct kmem_cache *kmalloc_dma_caches[KMALLOC_SHIFT_HIGH + 1];
705 EXPORT_SYMBOL(kmalloc_dma_caches);
709 * Conversion table for small slabs sizes / 8 to the index in the
710 * kmalloc array. This is necessary for slabs < 192 since we have non power
711 * of two cache sizes there. The size of larger slabs can be determined using
714 static s8 size_index[24] = {
741 static inline int size_index_elem(size_t bytes)
743 return (bytes - 1) / 8;
747 * Find the kmem_cache structure that serves a given size of
750 struct kmem_cache *kmalloc_slab(size_t size, gfp_t flags)
754 if (unlikely(size > KMALLOC_MAX_SIZE)) {
755 WARN_ON_ONCE(!(flags & __GFP_NOWARN));
761 return ZERO_SIZE_PTR;
763 index = size_index[size_index_elem(size)];
765 index = fls(size - 1);
767 #ifdef CONFIG_ZONE_DMA
768 if (unlikely((flags & GFP_DMA)))
769 return kmalloc_dma_caches[index];
772 return kmalloc_caches[index];
776 * Create the kmalloc array. Some of the regular kmalloc arrays
777 * may already have been created because they were needed to
778 * enable allocations for slab creation.
780 void __init create_kmalloc_caches(unsigned long flags)
785 * Patch up the size_index table if we have strange large alignment
786 * requirements for the kmalloc array. This is only the case for
787 * MIPS it seems. The standard arches will not generate any code here.
789 * Largest permitted alignment is 256 bytes due to the way we
790 * handle the index determination for the smaller caches.
792 * Make sure that nothing crazy happens if someone starts tinkering
793 * around with ARCH_KMALLOC_MINALIGN
795 BUILD_BUG_ON(KMALLOC_MIN_SIZE > 256 ||
796 (KMALLOC_MIN_SIZE & (KMALLOC_MIN_SIZE - 1)));
798 for (i = 8; i < KMALLOC_MIN_SIZE; i += 8) {
799 int elem = size_index_elem(i);
801 if (elem >= ARRAY_SIZE(size_index))
803 size_index[elem] = KMALLOC_SHIFT_LOW;
806 if (KMALLOC_MIN_SIZE >= 64) {
808 * The 96 byte size cache is not used if the alignment
811 for (i = 64 + 8; i <= 96; i += 8)
812 size_index[size_index_elem(i)] = 7;
816 if (KMALLOC_MIN_SIZE >= 128) {
818 * The 192 byte sized cache is not used if the alignment
819 * is 128 byte. Redirect kmalloc to use the 256 byte cache
822 for (i = 128 + 8; i <= 192; i += 8)
823 size_index[size_index_elem(i)] = 8;
825 for (i = KMALLOC_SHIFT_LOW; i <= KMALLOC_SHIFT_HIGH; i++) {
826 if (!kmalloc_caches[i]) {
827 kmalloc_caches[i] = create_kmalloc_cache(NULL,
832 * Caches that are not of the two-to-the-power-of size.
833 * These have to be created immediately after the
834 * earlier power of two caches
836 if (KMALLOC_MIN_SIZE <= 32 && !kmalloc_caches[1] && i == 6)
837 kmalloc_caches[1] = create_kmalloc_cache(NULL, 96, flags);
839 if (KMALLOC_MIN_SIZE <= 64 && !kmalloc_caches[2] && i == 7)
840 kmalloc_caches[2] = create_kmalloc_cache(NULL, 192, flags);
843 /* Kmalloc array is now usable */
846 for (i = 0; i <= KMALLOC_SHIFT_HIGH; i++) {
847 struct kmem_cache *s = kmalloc_caches[i];
851 n = kasprintf(GFP_NOWAIT, "kmalloc-%d", kmalloc_size(i));
858 #ifdef CONFIG_ZONE_DMA
859 for (i = 0; i <= KMALLOC_SHIFT_HIGH; i++) {
860 struct kmem_cache *s = kmalloc_caches[i];
863 int size = kmalloc_size(i);
864 char *n = kasprintf(GFP_NOWAIT,
865 "dma-kmalloc-%d", size);
868 kmalloc_dma_caches[i] = create_kmalloc_cache(n,
869 size, SLAB_CACHE_DMA | flags);
874 #endif /* !CONFIG_SLOB */
877 * To avoid unnecessary overhead, we pass through large allocation requests
878 * directly to the page allocator. We use __GFP_COMP, because we will need to
879 * know the allocation order to free the pages properly in kfree.
881 void *kmalloc_order(size_t size, gfp_t flags, unsigned int order)
887 page = alloc_kmem_pages(flags, order);
888 ret = page ? page_address(page) : NULL;
889 kmemleak_alloc(ret, size, 1, flags);
892 EXPORT_SYMBOL(kmalloc_order);
894 #ifdef CONFIG_TRACING
895 void *kmalloc_order_trace(size_t size, gfp_t flags, unsigned int order)
897 void *ret = kmalloc_order(size, flags, order);
898 trace_kmalloc(_RET_IP_, ret, size, PAGE_SIZE << order, flags);
901 EXPORT_SYMBOL(kmalloc_order_trace);
904 #ifdef CONFIG_SLABINFO
907 #define SLABINFO_RIGHTS (S_IWUSR | S_IRUSR)
909 #define SLABINFO_RIGHTS S_IRUSR
912 static void print_slabinfo_header(struct seq_file *m)
915 * Output format version, so at least we can change it
916 * without _too_ many complaints.
918 #ifdef CONFIG_DEBUG_SLAB
919 seq_puts(m, "slabinfo - version: 2.1 (statistics)\n");
921 seq_puts(m, "slabinfo - version: 2.1\n");
923 seq_puts(m, "# name <active_objs> <num_objs> <objsize> "
924 "<objperslab> <pagesperslab>");
925 seq_puts(m, " : tunables <limit> <batchcount> <sharedfactor>");
926 seq_puts(m, " : slabdata <active_slabs> <num_slabs> <sharedavail>");
927 #ifdef CONFIG_DEBUG_SLAB
928 seq_puts(m, " : globalstat <listallocs> <maxobjs> <grown> <reaped> "
929 "<error> <maxfreeable> <nodeallocs> <remotefrees> <alienoverflow>");
930 seq_puts(m, " : cpustat <allochit> <allocmiss> <freehit> <freemiss>");
935 void *slab_start(struct seq_file *m, loff_t *pos)
937 mutex_lock(&slab_mutex);
938 return seq_list_start(&slab_caches, *pos);
941 void *slab_next(struct seq_file *m, void *p, loff_t *pos)
943 return seq_list_next(p, &slab_caches, pos);
946 void slab_stop(struct seq_file *m, void *p)
948 mutex_unlock(&slab_mutex);
952 memcg_accumulate_slabinfo(struct kmem_cache *s, struct slabinfo *info)
954 struct kmem_cache *c;
955 struct slabinfo sinfo;
957 if (!is_root_cache(s))
960 for_each_memcg_cache(c, s) {
961 memset(&sinfo, 0, sizeof(sinfo));
962 get_slabinfo(c, &sinfo);
964 info->active_slabs += sinfo.active_slabs;
965 info->num_slabs += sinfo.num_slabs;
966 info->shared_avail += sinfo.shared_avail;
967 info->active_objs += sinfo.active_objs;
968 info->num_objs += sinfo.num_objs;
972 static void cache_show(struct kmem_cache *s, struct seq_file *m)
974 struct slabinfo sinfo;
976 memset(&sinfo, 0, sizeof(sinfo));
977 get_slabinfo(s, &sinfo);
979 memcg_accumulate_slabinfo(s, &sinfo);
981 seq_printf(m, "%-17s %6lu %6lu %6u %4u %4d",
982 cache_name(s), sinfo.active_objs, sinfo.num_objs, s->size,
983 sinfo.objects_per_slab, (1 << sinfo.cache_order));
985 seq_printf(m, " : tunables %4u %4u %4u",
986 sinfo.limit, sinfo.batchcount, sinfo.shared);
987 seq_printf(m, " : slabdata %6lu %6lu %6lu",
988 sinfo.active_slabs, sinfo.num_slabs, sinfo.shared_avail);
989 slabinfo_show_stats(m, s);
993 static int slab_show(struct seq_file *m, void *p)
995 struct kmem_cache *s = list_entry(p, struct kmem_cache, list);
997 if (p == slab_caches.next)
998 print_slabinfo_header(m);
999 if (is_root_cache(s))
1004 #ifdef CONFIG_MEMCG_KMEM
1005 int memcg_slab_show(struct seq_file *m, void *p)
1007 struct kmem_cache *s = list_entry(p, struct kmem_cache, list);
1008 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
1010 if (p == slab_caches.next)
1011 print_slabinfo_header(m);
1012 if (!is_root_cache(s) && s->memcg_params.memcg == memcg)
1019 * slabinfo_op - iterator that generates /proc/slabinfo
1028 * num-pages-per-slab
1029 * + further values on SMP and with statistics enabled
1031 static const struct seq_operations slabinfo_op = {
1032 .start = slab_start,
1038 static int slabinfo_open(struct inode *inode, struct file *file)
1040 return seq_open(file, &slabinfo_op);
1043 static const struct file_operations proc_slabinfo_operations = {
1044 .open = slabinfo_open,
1046 .write = slabinfo_write,
1047 .llseek = seq_lseek,
1048 .release = seq_release,
1051 static int __init slab_proc_init(void)
1053 proc_create("slabinfo", SLABINFO_RIGHTS, NULL,
1054 &proc_slabinfo_operations);
1057 module_init(slab_proc_init);
1058 #endif /* CONFIG_SLABINFO */
1060 static __always_inline void *__do_krealloc(const void *p, size_t new_size,
1072 ret = kmalloc_track_caller(new_size, flags);
1080 * __krealloc - like krealloc() but don't free @p.
1081 * @p: object to reallocate memory for.
1082 * @new_size: how many bytes of memory are required.
1083 * @flags: the type of memory to allocate.
1085 * This function is like krealloc() except it never frees the originally
1086 * allocated buffer. Use this if you don't want to free the buffer immediately
1087 * like, for example, with RCU.
1089 void *__krealloc(const void *p, size_t new_size, gfp_t flags)
1091 if (unlikely(!new_size))
1092 return ZERO_SIZE_PTR;
1094 return __do_krealloc(p, new_size, flags);
1097 EXPORT_SYMBOL(__krealloc);
1100 * krealloc - reallocate memory. The contents will remain unchanged.
1101 * @p: object to reallocate memory for.
1102 * @new_size: how many bytes of memory are required.
1103 * @flags: the type of memory to allocate.
1105 * The contents of the object pointed to are preserved up to the
1106 * lesser of the new and old sizes. If @p is %NULL, krealloc()
1107 * behaves exactly like kmalloc(). If @new_size is 0 and @p is not a
1108 * %NULL pointer, the object pointed to is freed.
1110 void *krealloc(const void *p, size_t new_size, gfp_t flags)
1114 if (unlikely(!new_size)) {
1116 return ZERO_SIZE_PTR;
1119 ret = __do_krealloc(p, new_size, flags);
1120 if (ret && p != ret)
1125 EXPORT_SYMBOL(krealloc);
1128 * kzfree - like kfree but zero memory
1129 * @p: object to free memory of
1131 * The memory of the object @p points to is zeroed before freed.
1132 * If @p is %NULL, kzfree() does nothing.
1134 * Note: this function zeroes the whole allocated buffer which can be a good
1135 * deal bigger than the requested buffer size passed to kmalloc(). So be
1136 * careful when using this function in performance sensitive code.
1138 void kzfree(const void *p)
1141 void *mem = (void *)p;
1143 if (unlikely(ZERO_OR_NULL_PTR(mem)))
1149 EXPORT_SYMBOL(kzfree);
1151 /* Tracepoints definitions. */
1152 EXPORT_TRACEPOINT_SYMBOL(kmalloc);
1153 EXPORT_TRACEPOINT_SYMBOL(kmem_cache_alloc);
1154 EXPORT_TRACEPOINT_SYMBOL(kmalloc_node);
1155 EXPORT_TRACEPOINT_SYMBOL(kmem_cache_alloc_node);
1156 EXPORT_TRACEPOINT_SYMBOL(kfree);
1157 EXPORT_TRACEPOINT_SYMBOL(kmem_cache_free);