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 static int memcg_alloc_cache_params(struct mem_cgroup *memcg,
110 struct kmem_cache *s, struct kmem_cache *root_cache)
114 if (!memcg_kmem_enabled())
118 size = offsetof(struct memcg_cache_params, memcg_caches);
119 size += memcg_limited_groups_array_size * sizeof(void *);
121 size = sizeof(struct memcg_cache_params);
123 s->memcg_params = kzalloc(size, GFP_KERNEL);
124 if (!s->memcg_params)
128 s->memcg_params->memcg = memcg;
129 s->memcg_params->root_cache = root_cache;
131 s->memcg_params->is_root_cache = true;
136 static void memcg_free_cache_params(struct kmem_cache *s)
138 kfree(s->memcg_params);
141 static int memcg_update_cache_params(struct kmem_cache *s, int num_memcgs)
144 struct memcg_cache_params *new_params, *cur_params;
146 BUG_ON(!is_root_cache(s));
148 size = offsetof(struct memcg_cache_params, memcg_caches);
149 size += num_memcgs * sizeof(void *);
151 new_params = kzalloc(size, GFP_KERNEL);
155 cur_params = s->memcg_params;
156 memcpy(new_params->memcg_caches, cur_params->memcg_caches,
157 memcg_limited_groups_array_size * sizeof(void *));
159 new_params->is_root_cache = true;
161 rcu_assign_pointer(s->memcg_params, new_params);
163 kfree_rcu(cur_params, rcu_head);
168 int memcg_update_all_caches(int num_memcgs)
170 struct kmem_cache *s;
172 mutex_lock(&slab_mutex);
174 list_for_each_entry(s, &slab_caches, list) {
175 if (!is_root_cache(s))
178 ret = memcg_update_cache_params(s, num_memcgs);
180 * Instead of freeing the memory, we'll just leave the caches
181 * up to this point in an updated state.
187 memcg_update_array_size(num_memcgs);
189 mutex_unlock(&slab_mutex);
193 static inline int memcg_alloc_cache_params(struct mem_cgroup *memcg,
194 struct kmem_cache *s, struct kmem_cache *root_cache)
199 static inline void memcg_free_cache_params(struct kmem_cache *s)
202 #endif /* CONFIG_MEMCG_KMEM */
205 * Find a mergeable slab cache
207 int slab_unmergeable(struct kmem_cache *s)
209 if (slab_nomerge || (s->flags & SLAB_NEVER_MERGE))
212 if (!is_root_cache(s))
219 * We may have set a slab to be unmergeable during bootstrap.
227 struct kmem_cache *find_mergeable(size_t size, size_t align,
228 unsigned long flags, const char *name, void (*ctor)(void *))
230 struct kmem_cache *s;
232 if (slab_nomerge || (flags & SLAB_NEVER_MERGE))
238 size = ALIGN(size, sizeof(void *));
239 align = calculate_alignment(flags, align, size);
240 size = ALIGN(size, align);
241 flags = kmem_cache_flags(size, flags, name, NULL);
243 list_for_each_entry_reverse(s, &slab_caches, list) {
244 if (slab_unmergeable(s))
250 if ((flags & SLAB_MERGE_SAME) != (s->flags & SLAB_MERGE_SAME))
253 * Check if alignment is compatible.
254 * Courtesy of Adrian Drzewiecki
256 if ((s->size & ~(align - 1)) != s->size)
259 if (s->size - size >= sizeof(void *))
262 if (IS_ENABLED(CONFIG_SLAB) && align &&
263 (align > s->align || s->align % align))
272 * Figure out what the alignment of the objects will be given a set of
273 * flags, a user specified alignment and the size of the objects.
275 unsigned long calculate_alignment(unsigned long flags,
276 unsigned long align, unsigned long size)
279 * If the user wants hardware cache aligned objects then follow that
280 * suggestion if the object is sufficiently large.
282 * The hardware cache alignment cannot override the specified
283 * alignment though. If that is greater then use it.
285 if (flags & SLAB_HWCACHE_ALIGN) {
286 unsigned long ralign = cache_line_size();
287 while (size <= ralign / 2)
289 align = max(align, ralign);
292 if (align < ARCH_SLAB_MINALIGN)
293 align = ARCH_SLAB_MINALIGN;
295 return ALIGN(align, sizeof(void *));
298 static struct kmem_cache *
299 do_kmem_cache_create(char *name, size_t object_size, size_t size, size_t align,
300 unsigned long flags, void (*ctor)(void *),
301 struct mem_cgroup *memcg, struct kmem_cache *root_cache)
303 struct kmem_cache *s;
307 s = kmem_cache_zalloc(kmem_cache, GFP_KERNEL);
312 s->object_size = object_size;
317 err = memcg_alloc_cache_params(memcg, s, root_cache);
321 err = __kmem_cache_create(s, flags);
326 list_add(&s->list, &slab_caches);
333 memcg_free_cache_params(s);
334 kmem_cache_free(kmem_cache, s);
339 * kmem_cache_create - Create a cache.
340 * @name: A string which is used in /proc/slabinfo to identify this cache.
341 * @size: The size of objects to be created in this cache.
342 * @align: The required alignment for the objects.
344 * @ctor: A constructor for the objects.
346 * Returns a ptr to the cache on success, NULL on failure.
347 * Cannot be called within a interrupt, but can be interrupted.
348 * The @ctor is run when new pages are allocated by the cache.
352 * %SLAB_POISON - Poison the slab with a known test pattern (a5a5a5a5)
353 * to catch references to uninitialised memory.
355 * %SLAB_RED_ZONE - Insert `Red' zones around the allocated memory to check
356 * for buffer overruns.
358 * %SLAB_HWCACHE_ALIGN - Align the objects in this cache to a hardware
359 * cacheline. This can be beneficial if you're counting cycles as closely
363 kmem_cache_create(const char *name, size_t size, size_t align,
364 unsigned long flags, void (*ctor)(void *))
366 struct kmem_cache *s;
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);
414 if (flags & SLAB_PANIC)
415 panic("kmem_cache_create: Failed to create slab '%s'. Error %d\n",
418 printk(KERN_WARNING "kmem_cache_create(%s) failed with error %d",
426 EXPORT_SYMBOL(kmem_cache_create);
428 #ifdef CONFIG_MEMCG_KMEM
430 * memcg_create_kmem_cache - Create a cache for a memory cgroup.
431 * @memcg: The memory cgroup the new cache is for.
432 * @root_cache: The parent of the new cache.
434 * This function attempts to create a kmem cache that will serve allocation
435 * requests going from @memcg to @root_cache. The new cache inherits properties
438 struct kmem_cache *memcg_create_kmem_cache(struct mem_cgroup *memcg,
439 struct kmem_cache *root_cache)
441 static char memcg_name_buf[NAME_MAX + 1]; /* protected by slab_mutex */
442 struct kmem_cache *s = NULL;
448 mutex_lock(&slab_mutex);
450 cgroup_name(mem_cgroup_css(memcg)->cgroup,
451 memcg_name_buf, sizeof(memcg_name_buf));
452 cache_name = kasprintf(GFP_KERNEL, "%s(%d:%s)", root_cache->name,
453 memcg_cache_id(memcg), memcg_name_buf);
457 s = do_kmem_cache_create(cache_name, root_cache->object_size,
458 root_cache->size, root_cache->align,
459 root_cache->flags, root_cache->ctor,
467 mutex_unlock(&slab_mutex);
475 static int memcg_cleanup_cache_params(struct kmem_cache *s)
479 if (!s->memcg_params ||
480 !s->memcg_params->is_root_cache)
483 mutex_unlock(&slab_mutex);
484 rc = __memcg_cleanup_cache_params(s);
485 mutex_lock(&slab_mutex);
490 static int memcg_cleanup_cache_params(struct kmem_cache *s)
494 #endif /* CONFIG_MEMCG_KMEM */
496 void slab_kmem_cache_release(struct kmem_cache *s)
499 kmem_cache_free(kmem_cache, s);
502 void kmem_cache_destroy(struct kmem_cache *s)
507 mutex_lock(&slab_mutex);
513 if (memcg_cleanup_cache_params(s) != 0)
516 if (__kmem_cache_shutdown(s) != 0) {
517 printk(KERN_ERR "kmem_cache_destroy %s: "
518 "Slab cache still has objects\n", s->name);
525 mutex_unlock(&slab_mutex);
526 if (s->flags & SLAB_DESTROY_BY_RCU)
529 memcg_free_cache_params(s);
530 #ifdef SLAB_SUPPORTS_SYSFS
531 sysfs_slab_remove(s);
533 slab_kmem_cache_release(s);
538 mutex_unlock(&slab_mutex);
543 EXPORT_SYMBOL(kmem_cache_destroy);
546 * kmem_cache_shrink - Shrink a cache.
547 * @cachep: The cache to shrink.
549 * Releases as many slabs as possible for a cache.
550 * To help debugging, a zero exit status indicates all slabs were released.
552 int kmem_cache_shrink(struct kmem_cache *cachep)
558 ret = __kmem_cache_shrink(cachep);
563 EXPORT_SYMBOL(kmem_cache_shrink);
565 int slab_is_available(void)
567 return slab_state >= UP;
571 /* Create a cache during boot when no slab services are available yet */
572 void __init create_boot_cache(struct kmem_cache *s, const char *name, size_t size,
578 s->size = s->object_size = size;
579 s->align = calculate_alignment(flags, ARCH_KMALLOC_MINALIGN, size);
580 err = __kmem_cache_create(s, flags);
583 panic("Creation of kmalloc slab %s size=%zu failed. Reason %d\n",
586 s->refcount = -1; /* Exempt from merging for now */
589 struct kmem_cache *__init create_kmalloc_cache(const char *name, size_t size,
592 struct kmem_cache *s = kmem_cache_zalloc(kmem_cache, GFP_NOWAIT);
595 panic("Out of memory when creating slab %s\n", name);
597 create_boot_cache(s, name, size, flags);
598 list_add(&s->list, &slab_caches);
603 struct kmem_cache *kmalloc_caches[KMALLOC_SHIFT_HIGH + 1];
604 EXPORT_SYMBOL(kmalloc_caches);
606 #ifdef CONFIG_ZONE_DMA
607 struct kmem_cache *kmalloc_dma_caches[KMALLOC_SHIFT_HIGH + 1];
608 EXPORT_SYMBOL(kmalloc_dma_caches);
612 * Conversion table for small slabs sizes / 8 to the index in the
613 * kmalloc array. This is necessary for slabs < 192 since we have non power
614 * of two cache sizes there. The size of larger slabs can be determined using
617 static s8 size_index[24] = {
644 static inline int size_index_elem(size_t bytes)
646 return (bytes - 1) / 8;
650 * Find the kmem_cache structure that serves a given size of
653 struct kmem_cache *kmalloc_slab(size_t size, gfp_t flags)
657 if (unlikely(size > KMALLOC_MAX_SIZE)) {
658 WARN_ON_ONCE(!(flags & __GFP_NOWARN));
664 return ZERO_SIZE_PTR;
666 index = size_index[size_index_elem(size)];
668 index = fls(size - 1);
670 #ifdef CONFIG_ZONE_DMA
671 if (unlikely((flags & GFP_DMA)))
672 return kmalloc_dma_caches[index];
675 return kmalloc_caches[index];
679 * Create the kmalloc array. Some of the regular kmalloc arrays
680 * may already have been created because they were needed to
681 * enable allocations for slab creation.
683 void __init create_kmalloc_caches(unsigned long flags)
688 * Patch up the size_index table if we have strange large alignment
689 * requirements for the kmalloc array. This is only the case for
690 * MIPS it seems. The standard arches will not generate any code here.
692 * Largest permitted alignment is 256 bytes due to the way we
693 * handle the index determination for the smaller caches.
695 * Make sure that nothing crazy happens if someone starts tinkering
696 * around with ARCH_KMALLOC_MINALIGN
698 BUILD_BUG_ON(KMALLOC_MIN_SIZE > 256 ||
699 (KMALLOC_MIN_SIZE & (KMALLOC_MIN_SIZE - 1)));
701 for (i = 8; i < KMALLOC_MIN_SIZE; i += 8) {
702 int elem = size_index_elem(i);
704 if (elem >= ARRAY_SIZE(size_index))
706 size_index[elem] = KMALLOC_SHIFT_LOW;
709 if (KMALLOC_MIN_SIZE >= 64) {
711 * The 96 byte size cache is not used if the alignment
714 for (i = 64 + 8; i <= 96; i += 8)
715 size_index[size_index_elem(i)] = 7;
719 if (KMALLOC_MIN_SIZE >= 128) {
721 * The 192 byte sized cache is not used if the alignment
722 * is 128 byte. Redirect kmalloc to use the 256 byte cache
725 for (i = 128 + 8; i <= 192; i += 8)
726 size_index[size_index_elem(i)] = 8;
728 for (i = KMALLOC_SHIFT_LOW; i <= KMALLOC_SHIFT_HIGH; i++) {
729 if (!kmalloc_caches[i]) {
730 kmalloc_caches[i] = create_kmalloc_cache(NULL,
735 * Caches that are not of the two-to-the-power-of size.
736 * These have to be created immediately after the
737 * earlier power of two caches
739 if (KMALLOC_MIN_SIZE <= 32 && !kmalloc_caches[1] && i == 6)
740 kmalloc_caches[1] = create_kmalloc_cache(NULL, 96, flags);
742 if (KMALLOC_MIN_SIZE <= 64 && !kmalloc_caches[2] && i == 7)
743 kmalloc_caches[2] = create_kmalloc_cache(NULL, 192, flags);
746 /* Kmalloc array is now usable */
749 for (i = 0; i <= KMALLOC_SHIFT_HIGH; i++) {
750 struct kmem_cache *s = kmalloc_caches[i];
754 n = kasprintf(GFP_NOWAIT, "kmalloc-%d", kmalloc_size(i));
761 #ifdef CONFIG_ZONE_DMA
762 for (i = 0; i <= KMALLOC_SHIFT_HIGH; i++) {
763 struct kmem_cache *s = kmalloc_caches[i];
766 int size = kmalloc_size(i);
767 char *n = kasprintf(GFP_NOWAIT,
768 "dma-kmalloc-%d", size);
771 kmalloc_dma_caches[i] = create_kmalloc_cache(n,
772 size, SLAB_CACHE_DMA | flags);
777 #endif /* !CONFIG_SLOB */
780 * To avoid unnecessary overhead, we pass through large allocation requests
781 * directly to the page allocator. We use __GFP_COMP, because we will need to
782 * know the allocation order to free the pages properly in kfree.
784 void *kmalloc_order(size_t size, gfp_t flags, unsigned int order)
790 page = alloc_kmem_pages(flags, order);
791 ret = page ? page_address(page) : NULL;
792 kmemleak_alloc(ret, size, 1, flags);
795 EXPORT_SYMBOL(kmalloc_order);
797 #ifdef CONFIG_TRACING
798 void *kmalloc_order_trace(size_t size, gfp_t flags, unsigned int order)
800 void *ret = kmalloc_order(size, flags, order);
801 trace_kmalloc(_RET_IP_, ret, size, PAGE_SIZE << order, flags);
804 EXPORT_SYMBOL(kmalloc_order_trace);
807 #ifdef CONFIG_SLABINFO
810 #define SLABINFO_RIGHTS (S_IWUSR | S_IRUSR)
812 #define SLABINFO_RIGHTS S_IRUSR
815 static void print_slabinfo_header(struct seq_file *m)
818 * Output format version, so at least we can change it
819 * without _too_ many complaints.
821 #ifdef CONFIG_DEBUG_SLAB
822 seq_puts(m, "slabinfo - version: 2.1 (statistics)\n");
824 seq_puts(m, "slabinfo - version: 2.1\n");
826 seq_puts(m, "# name <active_objs> <num_objs> <objsize> "
827 "<objperslab> <pagesperslab>");
828 seq_puts(m, " : tunables <limit> <batchcount> <sharedfactor>");
829 seq_puts(m, " : slabdata <active_slabs> <num_slabs> <sharedavail>");
830 #ifdef CONFIG_DEBUG_SLAB
831 seq_puts(m, " : globalstat <listallocs> <maxobjs> <grown> <reaped> "
832 "<error> <maxfreeable> <nodeallocs> <remotefrees> <alienoverflow>");
833 seq_puts(m, " : cpustat <allochit> <allocmiss> <freehit> <freemiss>");
838 void *slab_start(struct seq_file *m, loff_t *pos)
840 mutex_lock(&slab_mutex);
841 return seq_list_start(&slab_caches, *pos);
844 void *slab_next(struct seq_file *m, void *p, loff_t *pos)
846 return seq_list_next(p, &slab_caches, pos);
849 void slab_stop(struct seq_file *m, void *p)
851 mutex_unlock(&slab_mutex);
855 memcg_accumulate_slabinfo(struct kmem_cache *s, struct slabinfo *info)
857 struct kmem_cache *c;
858 struct slabinfo sinfo;
861 if (!is_root_cache(s))
864 for_each_memcg_cache_index(i) {
865 c = cache_from_memcg_idx(s, i);
869 memset(&sinfo, 0, sizeof(sinfo));
870 get_slabinfo(c, &sinfo);
872 info->active_slabs += sinfo.active_slabs;
873 info->num_slabs += sinfo.num_slabs;
874 info->shared_avail += sinfo.shared_avail;
875 info->active_objs += sinfo.active_objs;
876 info->num_objs += sinfo.num_objs;
880 static void cache_show(struct kmem_cache *s, struct seq_file *m)
882 struct slabinfo sinfo;
884 memset(&sinfo, 0, sizeof(sinfo));
885 get_slabinfo(s, &sinfo);
887 memcg_accumulate_slabinfo(s, &sinfo);
889 seq_printf(m, "%-17s %6lu %6lu %6u %4u %4d",
890 cache_name(s), sinfo.active_objs, sinfo.num_objs, s->size,
891 sinfo.objects_per_slab, (1 << sinfo.cache_order));
893 seq_printf(m, " : tunables %4u %4u %4u",
894 sinfo.limit, sinfo.batchcount, sinfo.shared);
895 seq_printf(m, " : slabdata %6lu %6lu %6lu",
896 sinfo.active_slabs, sinfo.num_slabs, sinfo.shared_avail);
897 slabinfo_show_stats(m, s);
901 static int slab_show(struct seq_file *m, void *p)
903 struct kmem_cache *s = list_entry(p, struct kmem_cache, list);
905 if (p == slab_caches.next)
906 print_slabinfo_header(m);
907 if (is_root_cache(s))
912 #ifdef CONFIG_MEMCG_KMEM
913 int memcg_slab_show(struct seq_file *m, void *p)
915 struct kmem_cache *s = list_entry(p, struct kmem_cache, list);
916 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
918 if (p == slab_caches.next)
919 print_slabinfo_header(m);
920 if (!is_root_cache(s) && s->memcg_params->memcg == memcg)
927 * slabinfo_op - iterator that generates /proc/slabinfo
937 * + further values on SMP and with statistics enabled
939 static const struct seq_operations slabinfo_op = {
946 static int slabinfo_open(struct inode *inode, struct file *file)
948 return seq_open(file, &slabinfo_op);
951 static const struct file_operations proc_slabinfo_operations = {
952 .open = slabinfo_open,
954 .write = slabinfo_write,
956 .release = seq_release,
959 static int __init slab_proc_init(void)
961 proc_create("slabinfo", SLABINFO_RIGHTS, NULL,
962 &proc_slabinfo_operations);
965 module_init(slab_proc_init);
966 #endif /* CONFIG_SLABINFO */
968 static __always_inline void *__do_krealloc(const void *p, size_t new_size,
980 ret = kmalloc_track_caller(new_size, flags);
988 * __krealloc - like krealloc() but don't free @p.
989 * @p: object to reallocate memory for.
990 * @new_size: how many bytes of memory are required.
991 * @flags: the type of memory to allocate.
993 * This function is like krealloc() except it never frees the originally
994 * allocated buffer. Use this if you don't want to free the buffer immediately
995 * like, for example, with RCU.
997 void *__krealloc(const void *p, size_t new_size, gfp_t flags)
999 if (unlikely(!new_size))
1000 return ZERO_SIZE_PTR;
1002 return __do_krealloc(p, new_size, flags);
1005 EXPORT_SYMBOL(__krealloc);
1008 * krealloc - reallocate memory. The contents will remain unchanged.
1009 * @p: object to reallocate memory for.
1010 * @new_size: how many bytes of memory are required.
1011 * @flags: the type of memory to allocate.
1013 * The contents of the object pointed to are preserved up to the
1014 * lesser of the new and old sizes. If @p is %NULL, krealloc()
1015 * behaves exactly like kmalloc(). If @new_size is 0 and @p is not a
1016 * %NULL pointer, the object pointed to is freed.
1018 void *krealloc(const void *p, size_t new_size, gfp_t flags)
1022 if (unlikely(!new_size)) {
1024 return ZERO_SIZE_PTR;
1027 ret = __do_krealloc(p, new_size, flags);
1028 if (ret && p != ret)
1033 EXPORT_SYMBOL(krealloc);
1036 * kzfree - like kfree but zero memory
1037 * @p: object to free memory of
1039 * The memory of the object @p points to is zeroed before freed.
1040 * If @p is %NULL, kzfree() does nothing.
1042 * Note: this function zeroes the whole allocated buffer which can be a good
1043 * deal bigger than the requested buffer size passed to kmalloc(). So be
1044 * careful when using this function in performance sensitive code.
1046 void kzfree(const void *p)
1049 void *mem = (void *)p;
1051 if (unlikely(ZERO_OR_NULL_PTR(mem)))
1057 EXPORT_SYMBOL(kzfree);
1059 /* Tracepoints definitions. */
1060 EXPORT_TRACEPOINT_SYMBOL(kmalloc);
1061 EXPORT_TRACEPOINT_SYMBOL(kmem_cache_alloc);
1062 EXPORT_TRACEPOINT_SYMBOL(kmalloc_node);
1063 EXPORT_TRACEPOINT_SYMBOL(kmem_cache_alloc_node);
1064 EXPORT_TRACEPOINT_SYMBOL(kfree);
1065 EXPORT_TRACEPOINT_SYMBOL(kmem_cache_free);