Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Slab allocator functions that are independent of the allocator strategy
4 *
5 * (C) 2012 Christoph Lameter <cl@linux.com>
6 */
7#include <linux/slab.h>
8
9#include <linux/mm.h>
10#include <linux/poison.h>
11#include <linux/interrupt.h>
12#include <linux/memory.h>
13#include <linux/cache.h>
14#include <linux/compiler.h>
15#include <linux/module.h>
16#include <linux/cpu.h>
17#include <linux/uaccess.h>
18#include <linux/seq_file.h>
19#include <linux/proc_fs.h>
20#include <asm/cacheflush.h>
21#include <asm/tlbflush.h>
22#include <asm/page.h>
23#include <linux/memcontrol.h>
24
25#define CREATE_TRACE_POINTS
26#include <trace/events/kmem.h>
27
28#include "slab.h"
29
30enum slab_state slab_state;
31LIST_HEAD(slab_caches);
32DEFINE_MUTEX(slab_mutex);
33struct kmem_cache *kmem_cache;
34
35#ifdef CONFIG_HARDENED_USERCOPY
36bool usercopy_fallback __ro_after_init =
37 IS_ENABLED(CONFIG_HARDENED_USERCOPY_FALLBACK);
38module_param(usercopy_fallback, bool, 0400);
39MODULE_PARM_DESC(usercopy_fallback,
40 "WARN instead of reject usercopy whitelist violations");
41#endif
42
43static LIST_HEAD(slab_caches_to_rcu_destroy);
44static void slab_caches_to_rcu_destroy_workfn(struct work_struct *work);
45static DECLARE_WORK(slab_caches_to_rcu_destroy_work,
46 slab_caches_to_rcu_destroy_workfn);
47
48/*
49 * Set of flags that will prevent slab merging
50 */
51#define SLAB_NEVER_MERGE (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER | \
52 SLAB_TRACE | SLAB_TYPESAFE_BY_RCU | SLAB_NOLEAKTRACE | \
53 SLAB_FAILSLAB | SLAB_KASAN)
54
55#define SLAB_MERGE_SAME (SLAB_RECLAIM_ACCOUNT | SLAB_CACHE_DMA | \
56 SLAB_ACCOUNT)
57
58/*
59 * Merge control. If this is set then no merging of slab caches will occur.
60 */
61static bool slab_nomerge = !IS_ENABLED(CONFIG_SLAB_MERGE_DEFAULT);
62
63static int __init setup_slab_nomerge(char *str)
64{
65 slab_nomerge = true;
66 return 1;
67}
68
69#ifdef CONFIG_SLUB
70__setup_param("slub_nomerge", slub_nomerge, setup_slab_nomerge, 0);
71#endif
72
73__setup("slab_nomerge", setup_slab_nomerge);
74
75/*
76 * Determine the size of a slab object
77 */
78unsigned int kmem_cache_size(struct kmem_cache *s)
79{
80 return s->object_size;
81}
82EXPORT_SYMBOL(kmem_cache_size);
83
84#ifdef CONFIG_DEBUG_VM
85static int kmem_cache_sanity_check(const char *name, unsigned int size)
86{
87 if (!name || in_interrupt() || size < sizeof(void *) ||
88 size > KMALLOC_MAX_SIZE) {
89 pr_err("kmem_cache_create(%s) integrity check failed\n", name);
90 return -EINVAL;
91 }
92
93 WARN_ON(strchr(name, ' ')); /* It confuses parsers */
94 return 0;
95}
96#else
97static inline int kmem_cache_sanity_check(const char *name, unsigned int size)
98{
99 return 0;
100}
101#endif
102
103void __kmem_cache_free_bulk(struct kmem_cache *s, size_t nr, void **p)
104{
105 size_t i;
106
107 for (i = 0; i < nr; i++) {
108 if (s)
109 kmem_cache_free(s, p[i]);
110 else
111 kfree(p[i]);
112 }
113}
114
115int __kmem_cache_alloc_bulk(struct kmem_cache *s, gfp_t flags, size_t nr,
116 void **p)
117{
118 size_t i;
119
120 for (i = 0; i < nr; i++) {
121 void *x = p[i] = kmem_cache_alloc(s, flags);
122 if (!x) {
123 __kmem_cache_free_bulk(s, i, p);
124 return 0;
125 }
126 }
127 return i;
128}
129
130#if defined(CONFIG_MEMCG) && !defined(CONFIG_SLOB)
131
132LIST_HEAD(slab_root_caches);
133
134void slab_init_memcg_params(struct kmem_cache *s)
135{
136 s->memcg_params.root_cache = NULL;
137 RCU_INIT_POINTER(s->memcg_params.memcg_caches, NULL);
138 INIT_LIST_HEAD(&s->memcg_params.children);
139}
140
141static int init_memcg_params(struct kmem_cache *s,
142 struct mem_cgroup *memcg, struct kmem_cache *root_cache)
143{
144 struct memcg_cache_array *arr;
145
146 if (root_cache) {
147 s->memcg_params.root_cache = root_cache;
148 s->memcg_params.memcg = memcg;
149 INIT_LIST_HEAD(&s->memcg_params.children_node);
150 INIT_LIST_HEAD(&s->memcg_params.kmem_caches_node);
151 return 0;
152 }
153
154 slab_init_memcg_params(s);
155
156 if (!memcg_nr_cache_ids)
157 return 0;
158
159 arr = kvzalloc(sizeof(struct memcg_cache_array) +
160 memcg_nr_cache_ids * sizeof(void *),
161 GFP_KERNEL);
162 if (!arr)
163 return -ENOMEM;
164
165 RCU_INIT_POINTER(s->memcg_params.memcg_caches, arr);
166 return 0;
167}
168
169static void destroy_memcg_params(struct kmem_cache *s)
170{
171 if (is_root_cache(s))
172 kvfree(rcu_access_pointer(s->memcg_params.memcg_caches));
173}
174
175static void free_memcg_params(struct rcu_head *rcu)
176{
177 struct memcg_cache_array *old;
178
179 old = container_of(rcu, struct memcg_cache_array, rcu);
180 kvfree(old);
181}
182
183static int update_memcg_params(struct kmem_cache *s, int new_array_size)
184{
185 struct memcg_cache_array *old, *new;
186
187 new = kvzalloc(sizeof(struct memcg_cache_array) +
188 new_array_size * sizeof(void *), GFP_KERNEL);
189 if (!new)
190 return -ENOMEM;
191
192 old = rcu_dereference_protected(s->memcg_params.memcg_caches,
193 lockdep_is_held(&slab_mutex));
194 if (old)
195 memcpy(new->entries, old->entries,
196 memcg_nr_cache_ids * sizeof(void *));
197
198 rcu_assign_pointer(s->memcg_params.memcg_caches, new);
199 if (old)
200 call_rcu(&old->rcu, free_memcg_params);
201 return 0;
202}
203
204int memcg_update_all_caches(int num_memcgs)
205{
206 struct kmem_cache *s;
207 int ret = 0;
208
209 mutex_lock(&slab_mutex);
210 list_for_each_entry(s, &slab_root_caches, root_caches_node) {
211 ret = update_memcg_params(s, num_memcgs);
212 /*
213 * Instead of freeing the memory, we'll just leave the caches
214 * up to this point in an updated state.
215 */
216 if (ret)
217 break;
218 }
219 mutex_unlock(&slab_mutex);
220 return ret;
221}
222
223void memcg_link_cache(struct kmem_cache *s)
224{
225 if (is_root_cache(s)) {
226 list_add(&s->root_caches_node, &slab_root_caches);
227 } else {
228 list_add(&s->memcg_params.children_node,
229 &s->memcg_params.root_cache->memcg_params.children);
230 list_add(&s->memcg_params.kmem_caches_node,
231 &s->memcg_params.memcg->kmem_caches);
232 }
233}
234
235static void memcg_unlink_cache(struct kmem_cache *s)
236{
237 if (is_root_cache(s)) {
238 list_del(&s->root_caches_node);
239 } else {
240 list_del(&s->memcg_params.children_node);
241 list_del(&s->memcg_params.kmem_caches_node);
242 }
243}
244#else
245static inline int init_memcg_params(struct kmem_cache *s,
246 struct mem_cgroup *memcg, struct kmem_cache *root_cache)
247{
248 return 0;
249}
250
251static inline void destroy_memcg_params(struct kmem_cache *s)
252{
253}
254
255static inline void memcg_unlink_cache(struct kmem_cache *s)
256{
257}
258#endif /* CONFIG_MEMCG && !CONFIG_SLOB */
259
260/*
261 * Figure out what the alignment of the objects will be given a set of
262 * flags, a user specified alignment and the size of the objects.
263 */
264static unsigned int calculate_alignment(slab_flags_t flags,
265 unsigned int align, unsigned int size)
266{
267 /*
268 * If the user wants hardware cache aligned objects then follow that
269 * suggestion if the object is sufficiently large.
270 *
271 * The hardware cache alignment cannot override the specified
272 * alignment though. If that is greater then use it.
273 */
274 if (flags & SLAB_HWCACHE_ALIGN) {
275 unsigned int ralign;
276
277 ralign = cache_line_size();
278 while (size <= ralign / 2)
279 ralign /= 2;
280 align = max(align, ralign);
281 }
282
283 if (align < ARCH_SLAB_MINALIGN)
284 align = ARCH_SLAB_MINALIGN;
285
286 return ALIGN(align, sizeof(void *));
287}
288
289/*
290 * Find a mergeable slab cache
291 */
292int slab_unmergeable(struct kmem_cache *s)
293{
294 if (slab_nomerge || (s->flags & SLAB_NEVER_MERGE))
295 return 1;
296
297 if (!is_root_cache(s))
298 return 1;
299
300 if (s->ctor)
301 return 1;
302
303 if (s->usersize)
304 return 1;
305
306 /*
307 * We may have set a slab to be unmergeable during bootstrap.
308 */
309 if (s->refcount < 0)
310 return 1;
311
312 return 0;
313}
314
315struct kmem_cache *find_mergeable(unsigned int size, unsigned int align,
316 slab_flags_t flags, const char *name, void (*ctor)(void *))
317{
318 struct kmem_cache *s;
319
320 if (slab_nomerge)
321 return NULL;
322
323 if (ctor)
324 return NULL;
325
326 size = ALIGN(size, sizeof(void *));
327 align = calculate_alignment(flags, align, size);
328 size = ALIGN(size, align);
329 flags = kmem_cache_flags(size, flags, name, NULL);
330
331 if (flags & SLAB_NEVER_MERGE)
332 return NULL;
333
334 list_for_each_entry_reverse(s, &slab_root_caches, root_caches_node) {
335 if (slab_unmergeable(s))
336 continue;
337
338 if (size > s->size)
339 continue;
340
341 if ((flags & SLAB_MERGE_SAME) != (s->flags & SLAB_MERGE_SAME))
342 continue;
343 /*
344 * Check if alignment is compatible.
345 * Courtesy of Adrian Drzewiecki
346 */
347 if ((s->size & ~(align - 1)) != s->size)
348 continue;
349
350 if (s->size - size >= sizeof(void *))
351 continue;
352
353 if (IS_ENABLED(CONFIG_SLAB) && align &&
354 (align > s->align || s->align % align))
355 continue;
356
357 return s;
358 }
359 return NULL;
360}
361
362static struct kmem_cache *create_cache(const char *name,
363 unsigned int object_size, unsigned int align,
364 slab_flags_t flags, unsigned int useroffset,
365 unsigned int usersize, void (*ctor)(void *),
366 struct mem_cgroup *memcg, struct kmem_cache *root_cache)
367{
368 struct kmem_cache *s;
369 int err;
370
371 if (WARN_ON(useroffset + usersize > object_size))
372 useroffset = usersize = 0;
373
374 err = -ENOMEM;
375 s = kmem_cache_zalloc(kmem_cache, GFP_KERNEL);
376 if (!s)
377 goto out;
378
379 s->name = name;
380 s->size = s->object_size = object_size;
381 s->align = align;
382 s->ctor = ctor;
383 s->useroffset = useroffset;
384 s->usersize = usersize;
385
386 err = init_memcg_params(s, memcg, root_cache);
387 if (err)
388 goto out_free_cache;
389
390 err = __kmem_cache_create(s, flags);
391 if (err)
392 goto out_free_cache;
393
394 s->refcount = 1;
395 list_add(&s->list, &slab_caches);
396 memcg_link_cache(s);
397out:
398 if (err)
399 return ERR_PTR(err);
400 return s;
401
402out_free_cache:
403 destroy_memcg_params(s);
404 kmem_cache_free(kmem_cache, s);
405 goto out;
406}
407
408/*
409 * kmem_cache_create_usercopy - Create a cache.
410 * @name: A string which is used in /proc/slabinfo to identify this cache.
411 * @size: The size of objects to be created in this cache.
412 * @align: The required alignment for the objects.
413 * @flags: SLAB flags
414 * @useroffset: Usercopy region offset
415 * @usersize: Usercopy region size
416 * @ctor: A constructor for the objects.
417 *
418 * Returns a ptr to the cache on success, NULL on failure.
419 * Cannot be called within a interrupt, but can be interrupted.
420 * The @ctor is run when new pages are allocated by the cache.
421 *
422 * The flags are
423 *
424 * %SLAB_POISON - Poison the slab with a known test pattern (a5a5a5a5)
425 * to catch references to uninitialised memory.
426 *
427 * %SLAB_RED_ZONE - Insert `Red' zones around the allocated memory to check
428 * for buffer overruns.
429 *
430 * %SLAB_HWCACHE_ALIGN - Align the objects in this cache to a hardware
431 * cacheline. This can be beneficial if you're counting cycles as closely
432 * as davem.
433 */
434struct kmem_cache *
435kmem_cache_create_usercopy(const char *name,
436 unsigned int size, unsigned int align,
437 slab_flags_t flags,
438 unsigned int useroffset, unsigned int usersize,
439 void (*ctor)(void *))
440{
441 struct kmem_cache *s = NULL;
442 const char *cache_name;
443 int err;
444
445 get_online_cpus();
446 get_online_mems();
447 memcg_get_cache_ids();
448
449 mutex_lock(&slab_mutex);
450
451 err = kmem_cache_sanity_check(name, size);
452 if (err) {
453 goto out_unlock;
454 }
455
456 /* Refuse requests with allocator specific flags */
457 if (flags & ~SLAB_FLAGS_PERMITTED) {
458 err = -EINVAL;
459 goto out_unlock;
460 }
461
462 /*
463 * Some allocators will constraint the set of valid flags to a subset
464 * of all flags. We expect them to define CACHE_CREATE_MASK in this
465 * case, and we'll just provide them with a sanitized version of the
466 * passed flags.
467 */
468 flags &= CACHE_CREATE_MASK;
469
470 /* Fail closed on bad usersize of useroffset values. */
471 if (WARN_ON(!usersize && useroffset) ||
472 WARN_ON(size < usersize || size - usersize < useroffset))
473 usersize = useroffset = 0;
474
475 if (!usersize)
476 s = __kmem_cache_alias(name, size, align, flags, ctor);
477 if (s)
478 goto out_unlock;
479
480 cache_name = kstrdup_const(name, GFP_KERNEL);
481 if (!cache_name) {
482 err = -ENOMEM;
483 goto out_unlock;
484 }
485
486 s = create_cache(cache_name, size,
487 calculate_alignment(flags, align, size),
488 flags, useroffset, usersize, ctor, NULL, NULL);
489 if (IS_ERR(s)) {
490 err = PTR_ERR(s);
491 kfree_const(cache_name);
492 }
493
494out_unlock:
495 mutex_unlock(&slab_mutex);
496
497 memcg_put_cache_ids();
498 put_online_mems();
499 put_online_cpus();
500
501 if (err) {
502 if (flags & SLAB_PANIC)
503 panic("kmem_cache_create: Failed to create slab '%s'. Error %d\n",
504 name, err);
505 else {
506 pr_warn("kmem_cache_create(%s) failed with error %d\n",
507 name, err);
508 dump_stack();
509 }
510 return NULL;
511 }
512 return s;
513}
514EXPORT_SYMBOL(kmem_cache_create_usercopy);
515
516struct kmem_cache *
517kmem_cache_create(const char *name, unsigned int size, unsigned int align,
518 slab_flags_t flags, void (*ctor)(void *))
519{
520 return kmem_cache_create_usercopy(name, size, align, flags, 0, 0,
521 ctor);
522}
523EXPORT_SYMBOL(kmem_cache_create);
524
525static void slab_caches_to_rcu_destroy_workfn(struct work_struct *work)
526{
527 LIST_HEAD(to_destroy);
528 struct kmem_cache *s, *s2;
529
530 /*
531 * On destruction, SLAB_TYPESAFE_BY_RCU kmem_caches are put on the
532 * @slab_caches_to_rcu_destroy list. The slab pages are freed
533 * through RCU and and the associated kmem_cache are dereferenced
534 * while freeing the pages, so the kmem_caches should be freed only
535 * after the pending RCU operations are finished. As rcu_barrier()
536 * is a pretty slow operation, we batch all pending destructions
537 * asynchronously.
538 */
539 mutex_lock(&slab_mutex);
540 list_splice_init(&slab_caches_to_rcu_destroy, &to_destroy);
541 mutex_unlock(&slab_mutex);
542
543 if (list_empty(&to_destroy))
544 return;
545
546 rcu_barrier();
547
548 list_for_each_entry_safe(s, s2, &to_destroy, list) {
549#ifdef SLAB_SUPPORTS_SYSFS
550 sysfs_slab_release(s);
551#else
552 slab_kmem_cache_release(s);
553#endif
554 }
555}
556
557static int shutdown_cache(struct kmem_cache *s)
558{
559 /* free asan quarantined objects */
560 kasan_cache_shutdown(s);
561
562 if (__kmem_cache_shutdown(s) != 0)
563 return -EBUSY;
564
565 memcg_unlink_cache(s);
566 list_del(&s->list);
567
568 if (s->flags & SLAB_TYPESAFE_BY_RCU) {
569 list_add_tail(&s->list, &slab_caches_to_rcu_destroy);
570 schedule_work(&slab_caches_to_rcu_destroy_work);
571 } else {
572#ifdef SLAB_SUPPORTS_SYSFS
573 sysfs_slab_release(s);
574#else
575 slab_kmem_cache_release(s);
576#endif
577 }
578
579 return 0;
580}
581
582#if defined(CONFIG_MEMCG) && !defined(CONFIG_SLOB)
583/*
584 * memcg_create_kmem_cache - Create a cache for a memory cgroup.
585 * @memcg: The memory cgroup the new cache is for.
586 * @root_cache: The parent of the new cache.
587 *
588 * This function attempts to create a kmem cache that will serve allocation
589 * requests going from @memcg to @root_cache. The new cache inherits properties
590 * from its parent.
591 */
592void memcg_create_kmem_cache(struct mem_cgroup *memcg,
593 struct kmem_cache *root_cache)
594{
595 static char memcg_name_buf[NAME_MAX + 1]; /* protected by slab_mutex */
596 struct cgroup_subsys_state *css = &memcg->css;
597 struct memcg_cache_array *arr;
598 struct kmem_cache *s = NULL;
599 char *cache_name;
600 int idx;
601
602 get_online_cpus();
603 get_online_mems();
604
605 mutex_lock(&slab_mutex);
606
607 /*
608 * The memory cgroup could have been offlined while the cache
609 * creation work was pending.
610 */
611 if (memcg->kmem_state != KMEM_ONLINE)
612 goto out_unlock;
613
614 idx = memcg_cache_id(memcg);
615 arr = rcu_dereference_protected(root_cache->memcg_params.memcg_caches,
616 lockdep_is_held(&slab_mutex));
617
618 /*
619 * Since per-memcg caches are created asynchronously on first
620 * allocation (see memcg_kmem_get_cache()), several threads can try to
621 * create the same cache, but only one of them may succeed.
622 */
623 if (arr->entries[idx])
624 goto out_unlock;
625
626 cgroup_name(css->cgroup, memcg_name_buf, sizeof(memcg_name_buf));
627 cache_name = kasprintf(GFP_KERNEL, "%s(%llu:%s)", root_cache->name,
628 css->serial_nr, memcg_name_buf);
629 if (!cache_name)
630 goto out_unlock;
631
632 s = create_cache(cache_name, root_cache->object_size,
633 root_cache->align,
634 root_cache->flags & CACHE_CREATE_MASK,
635 root_cache->useroffset, root_cache->usersize,
636 root_cache->ctor, memcg, root_cache);
637 /*
638 * If we could not create a memcg cache, do not complain, because
639 * that's not critical at all as we can always proceed with the root
640 * cache.
641 */
642 if (IS_ERR(s)) {
643 kfree(cache_name);
644 goto out_unlock;
645 }
646
647 /*
648 * Since readers won't lock (see cache_from_memcg_idx()), we need a
649 * barrier here to ensure nobody will see the kmem_cache partially
650 * initialized.
651 */
652 smp_wmb();
653 arr->entries[idx] = s;
654
655out_unlock:
656 mutex_unlock(&slab_mutex);
657
658 put_online_mems();
659 put_online_cpus();
660}
661
662static void kmemcg_deactivate_workfn(struct work_struct *work)
663{
664 struct kmem_cache *s = container_of(work, struct kmem_cache,
665 memcg_params.deact_work);
666
667 get_online_cpus();
668 get_online_mems();
669
670 mutex_lock(&slab_mutex);
671
672 s->memcg_params.deact_fn(s);
673
674 mutex_unlock(&slab_mutex);
675
676 put_online_mems();
677 put_online_cpus();
678
679 /* done, put the ref from slab_deactivate_memcg_cache_rcu_sched() */
680 css_put(&s->memcg_params.memcg->css);
681}
682
683static void kmemcg_deactivate_rcufn(struct rcu_head *head)
684{
685 struct kmem_cache *s = container_of(head, struct kmem_cache,
686 memcg_params.deact_rcu_head);
687
688 /*
689 * We need to grab blocking locks. Bounce to ->deact_work. The
690 * work item shares the space with the RCU head and can't be
691 * initialized eariler.
692 */
693 INIT_WORK(&s->memcg_params.deact_work, kmemcg_deactivate_workfn);
694 queue_work(memcg_kmem_cache_wq, &s->memcg_params.deact_work);
695}
696
697/**
698 * slab_deactivate_memcg_cache_rcu_sched - schedule deactivation after a
699 * sched RCU grace period
700 * @s: target kmem_cache
701 * @deact_fn: deactivation function to call
702 *
703 * Schedule @deact_fn to be invoked with online cpus, mems and slab_mutex
704 * held after a sched RCU grace period. The slab is guaranteed to stay
705 * alive until @deact_fn is finished. This is to be used from
706 * __kmemcg_cache_deactivate().
707 */
708void slab_deactivate_memcg_cache_rcu_sched(struct kmem_cache *s,
709 void (*deact_fn)(struct kmem_cache *))
710{
711 if (WARN_ON_ONCE(is_root_cache(s)) ||
712 WARN_ON_ONCE(s->memcg_params.deact_fn))
713 return;
714
715 /* pin memcg so that @s doesn't get destroyed in the middle */
716 css_get(&s->memcg_params.memcg->css);
717
718 s->memcg_params.deact_fn = deact_fn;
719 call_rcu_sched(&s->memcg_params.deact_rcu_head, kmemcg_deactivate_rcufn);
720}
721
722void memcg_deactivate_kmem_caches(struct mem_cgroup *memcg)
723{
724 int idx;
725 struct memcg_cache_array *arr;
726 struct kmem_cache *s, *c;
727
728 idx = memcg_cache_id(memcg);
729
730 get_online_cpus();
731 get_online_mems();
732
733 mutex_lock(&slab_mutex);
734 list_for_each_entry(s, &slab_root_caches, root_caches_node) {
735 arr = rcu_dereference_protected(s->memcg_params.memcg_caches,
736 lockdep_is_held(&slab_mutex));
737 c = arr->entries[idx];
738 if (!c)
739 continue;
740
741 __kmemcg_cache_deactivate(c);
742 arr->entries[idx] = NULL;
743 }
744 mutex_unlock(&slab_mutex);
745
746 put_online_mems();
747 put_online_cpus();
748}
749
750void memcg_destroy_kmem_caches(struct mem_cgroup *memcg)
751{
752 struct kmem_cache *s, *s2;
753
754 get_online_cpus();
755 get_online_mems();
756
757 mutex_lock(&slab_mutex);
758 list_for_each_entry_safe(s, s2, &memcg->kmem_caches,
759 memcg_params.kmem_caches_node) {
760 /*
761 * The cgroup is about to be freed and therefore has no charges
762 * left. Hence, all its caches must be empty by now.
763 */
764 BUG_ON(shutdown_cache(s));
765 }
766 mutex_unlock(&slab_mutex);
767
768 put_online_mems();
769 put_online_cpus();
770}
771
772static int shutdown_memcg_caches(struct kmem_cache *s)
773{
774 struct memcg_cache_array *arr;
775 struct kmem_cache *c, *c2;
776 LIST_HEAD(busy);
777 int i;
778
779 BUG_ON(!is_root_cache(s));
780
781 /*
782 * First, shutdown active caches, i.e. caches that belong to online
783 * memory cgroups.
784 */
785 arr = rcu_dereference_protected(s->memcg_params.memcg_caches,
786 lockdep_is_held(&slab_mutex));
787 for_each_memcg_cache_index(i) {
788 c = arr->entries[i];
789 if (!c)
790 continue;
791 if (shutdown_cache(c))
792 /*
793 * The cache still has objects. Move it to a temporary
794 * list so as not to try to destroy it for a second
795 * time while iterating over inactive caches below.
796 */
797 list_move(&c->memcg_params.children_node, &busy);
798 else
799 /*
800 * The cache is empty and will be destroyed soon. Clear
801 * the pointer to it in the memcg_caches array so that
802 * it will never be accessed even if the root cache
803 * stays alive.
804 */
805 arr->entries[i] = NULL;
806 }
807
808 /*
809 * Second, shutdown all caches left from memory cgroups that are now
810 * offline.
811 */
812 list_for_each_entry_safe(c, c2, &s->memcg_params.children,
813 memcg_params.children_node)
814 shutdown_cache(c);
815
816 list_splice(&busy, &s->memcg_params.children);
817
818 /*
819 * A cache being destroyed must be empty. In particular, this means
820 * that all per memcg caches attached to it must be empty too.
821 */
822 if (!list_empty(&s->memcg_params.children))
823 return -EBUSY;
824 return 0;
825}
826#else
827static inline int shutdown_memcg_caches(struct kmem_cache *s)
828{
829 return 0;
830}
831#endif /* CONFIG_MEMCG && !CONFIG_SLOB */
832
833void slab_kmem_cache_release(struct kmem_cache *s)
834{
835 __kmem_cache_release(s);
836 destroy_memcg_params(s);
837 kfree_const(s->name);
838 kmem_cache_free(kmem_cache, s);
839}
840
841void kmem_cache_destroy(struct kmem_cache *s)
842{
843 int err;
844
845 if (unlikely(!s))
846 return;
847
848 get_online_cpus();
849 get_online_mems();
850
851 mutex_lock(&slab_mutex);
852
853 s->refcount--;
854 if (s->refcount)
855 goto out_unlock;
856
857 err = shutdown_memcg_caches(s);
858 if (!err)
859 err = shutdown_cache(s);
860
861 if (err) {
862 pr_err("kmem_cache_destroy %s: Slab cache still has objects\n",
863 s->name);
864 dump_stack();
865 }
866out_unlock:
867 mutex_unlock(&slab_mutex);
868
869 put_online_mems();
870 put_online_cpus();
871}
872EXPORT_SYMBOL(kmem_cache_destroy);
873
874/**
875 * kmem_cache_shrink - Shrink a cache.
876 * @cachep: The cache to shrink.
877 *
878 * Releases as many slabs as possible for a cache.
879 * To help debugging, a zero exit status indicates all slabs were released.
880 */
881int kmem_cache_shrink(struct kmem_cache *cachep)
882{
883 int ret;
884
885 get_online_cpus();
886 get_online_mems();
887 kasan_cache_shrink(cachep);
888 ret = __kmem_cache_shrink(cachep);
889 put_online_mems();
890 put_online_cpus();
891 return ret;
892}
893EXPORT_SYMBOL(kmem_cache_shrink);
894
895bool slab_is_available(void)
896{
897 return slab_state >= UP;
898}
899
900#ifndef CONFIG_SLOB
901/* Create a cache during boot when no slab services are available yet */
902void __init create_boot_cache(struct kmem_cache *s, const char *name,
903 unsigned int size, slab_flags_t flags,
904 unsigned int useroffset, unsigned int usersize)
905{
906 int err;
907
908 s->name = name;
909 s->size = s->object_size = size;
910 s->align = calculate_alignment(flags, ARCH_KMALLOC_MINALIGN, size);
911 s->useroffset = useroffset;
912 s->usersize = usersize;
913
914 slab_init_memcg_params(s);
915
916 err = __kmem_cache_create(s, flags);
917
918 if (err)
919 panic("Creation of kmalloc slab %s size=%u failed. Reason %d\n",
920 name, size, err);
921
922 s->refcount = -1; /* Exempt from merging for now */
923}
924
925struct kmem_cache *__init create_kmalloc_cache(const char *name,
926 unsigned int size, slab_flags_t flags,
927 unsigned int useroffset, unsigned int usersize)
928{
929 struct kmem_cache *s = kmem_cache_zalloc(kmem_cache, GFP_NOWAIT);
930
931 if (!s)
932 panic("Out of memory when creating slab %s\n", name);
933
934 create_boot_cache(s, name, size, flags, useroffset, usersize);
935 list_add(&s->list, &slab_caches);
936 memcg_link_cache(s);
937 s->refcount = 1;
938 return s;
939}
940
941struct kmem_cache *kmalloc_caches[KMALLOC_SHIFT_HIGH + 1] __ro_after_init;
942EXPORT_SYMBOL(kmalloc_caches);
943
944#ifdef CONFIG_ZONE_DMA
945struct kmem_cache *kmalloc_dma_caches[KMALLOC_SHIFT_HIGH + 1] __ro_after_init;
946EXPORT_SYMBOL(kmalloc_dma_caches);
947#endif
948
949/*
950 * Conversion table for small slabs sizes / 8 to the index in the
951 * kmalloc array. This is necessary for slabs < 192 since we have non power
952 * of two cache sizes there. The size of larger slabs can be determined using
953 * fls.
954 */
955static u8 size_index[24] __ro_after_init = {
956 3, /* 8 */
957 4, /* 16 */
958 5, /* 24 */
959 5, /* 32 */
960 6, /* 40 */
961 6, /* 48 */
962 6, /* 56 */
963 6, /* 64 */
964 1, /* 72 */
965 1, /* 80 */
966 1, /* 88 */
967 1, /* 96 */
968 7, /* 104 */
969 7, /* 112 */
970 7, /* 120 */
971 7, /* 128 */
972 2, /* 136 */
973 2, /* 144 */
974 2, /* 152 */
975 2, /* 160 */
976 2, /* 168 */
977 2, /* 176 */
978 2, /* 184 */
979 2 /* 192 */
980};
981
982static inline unsigned int size_index_elem(unsigned int bytes)
983{
984 return (bytes - 1) / 8;
985}
986
987/*
988 * Find the kmem_cache structure that serves a given size of
989 * allocation
990 */
991struct kmem_cache *kmalloc_slab(size_t size, gfp_t flags)
992{
993 unsigned int index;
994
995 if (unlikely(size > KMALLOC_MAX_SIZE)) {
996 WARN_ON_ONCE(!(flags & __GFP_NOWARN));
997 return NULL;
998 }
999
1000 if (size <= 192) {
1001 if (!size)
1002 return ZERO_SIZE_PTR;
1003
1004 index = size_index[size_index_elem(size)];
1005 } else
1006 index = fls(size - 1);
1007
1008#ifdef CONFIG_ZONE_DMA
1009 if (unlikely((flags & GFP_DMA)))
1010 return kmalloc_dma_caches[index];
1011
1012#endif
1013 return kmalloc_caches[index];
1014}
1015
1016/*
1017 * kmalloc_info[] is to make slub_debug=,kmalloc-xx option work at boot time.
1018 * kmalloc_index() supports up to 2^26=64MB, so the final entry of the table is
1019 * kmalloc-67108864.
1020 */
1021const struct kmalloc_info_struct kmalloc_info[] __initconst = {
1022 {NULL, 0}, {"kmalloc-96", 96},
1023 {"kmalloc-192", 192}, {"kmalloc-8", 8},
1024 {"kmalloc-16", 16}, {"kmalloc-32", 32},
1025 {"kmalloc-64", 64}, {"kmalloc-128", 128},
1026 {"kmalloc-256", 256}, {"kmalloc-512", 512},
1027 {"kmalloc-1024", 1024}, {"kmalloc-2048", 2048},
1028 {"kmalloc-4096", 4096}, {"kmalloc-8192", 8192},
1029 {"kmalloc-16384", 16384}, {"kmalloc-32768", 32768},
1030 {"kmalloc-65536", 65536}, {"kmalloc-131072", 131072},
1031 {"kmalloc-262144", 262144}, {"kmalloc-524288", 524288},
1032 {"kmalloc-1048576", 1048576}, {"kmalloc-2097152", 2097152},
1033 {"kmalloc-4194304", 4194304}, {"kmalloc-8388608", 8388608},
1034 {"kmalloc-16777216", 16777216}, {"kmalloc-33554432", 33554432},
1035 {"kmalloc-67108864", 67108864}
1036};
1037
1038/*
1039 * Patch up the size_index table if we have strange large alignment
1040 * requirements for the kmalloc array. This is only the case for
1041 * MIPS it seems. The standard arches will not generate any code here.
1042 *
1043 * Largest permitted alignment is 256 bytes due to the way we
1044 * handle the index determination for the smaller caches.
1045 *
1046 * Make sure that nothing crazy happens if someone starts tinkering
1047 * around with ARCH_KMALLOC_MINALIGN
1048 */
1049void __init setup_kmalloc_cache_index_table(void)
1050{
1051 unsigned int i;
1052
1053 BUILD_BUG_ON(KMALLOC_MIN_SIZE > 256 ||
1054 (KMALLOC_MIN_SIZE & (KMALLOC_MIN_SIZE - 1)));
1055
1056 for (i = 8; i < KMALLOC_MIN_SIZE; i += 8) {
1057 unsigned int elem = size_index_elem(i);
1058
1059 if (elem >= ARRAY_SIZE(size_index))
1060 break;
1061 size_index[elem] = KMALLOC_SHIFT_LOW;
1062 }
1063
1064 if (KMALLOC_MIN_SIZE >= 64) {
1065 /*
1066 * The 96 byte size cache is not used if the alignment
1067 * is 64 byte.
1068 */
1069 for (i = 64 + 8; i <= 96; i += 8)
1070 size_index[size_index_elem(i)] = 7;
1071
1072 }
1073
1074 if (KMALLOC_MIN_SIZE >= 128) {
1075 /*
1076 * The 192 byte sized cache is not used if the alignment
1077 * is 128 byte. Redirect kmalloc to use the 256 byte cache
1078 * instead.
1079 */
1080 for (i = 128 + 8; i <= 192; i += 8)
1081 size_index[size_index_elem(i)] = 8;
1082 }
1083}
1084
1085static void __init new_kmalloc_cache(int idx, slab_flags_t flags)
1086{
1087 kmalloc_caches[idx] = create_kmalloc_cache(kmalloc_info[idx].name,
1088 kmalloc_info[idx].size, flags, 0,
1089 kmalloc_info[idx].size);
1090}
1091
1092/*
1093 * Create the kmalloc array. Some of the regular kmalloc arrays
1094 * may already have been created because they were needed to
1095 * enable allocations for slab creation.
1096 */
1097void __init create_kmalloc_caches(slab_flags_t flags)
1098{
1099 int i;
1100
1101 for (i = KMALLOC_SHIFT_LOW; i <= KMALLOC_SHIFT_HIGH; i++) {
1102 if (!kmalloc_caches[i])
1103 new_kmalloc_cache(i, flags);
1104
1105 /*
1106 * Caches that are not of the two-to-the-power-of size.
1107 * These have to be created immediately after the
1108 * earlier power of two caches
1109 */
1110 if (KMALLOC_MIN_SIZE <= 32 && !kmalloc_caches[1] && i == 6)
1111 new_kmalloc_cache(1, flags);
1112 if (KMALLOC_MIN_SIZE <= 64 && !kmalloc_caches[2] && i == 7)
1113 new_kmalloc_cache(2, flags);
1114 }
1115
1116 /* Kmalloc array is now usable */
1117 slab_state = UP;
1118
1119#ifdef CONFIG_ZONE_DMA
1120 for (i = 0; i <= KMALLOC_SHIFT_HIGH; i++) {
1121 struct kmem_cache *s = kmalloc_caches[i];
1122
1123 if (s) {
1124 unsigned int size = kmalloc_size(i);
1125 char *n = kasprintf(GFP_NOWAIT,
1126 "dma-kmalloc-%u", size);
1127
1128 BUG_ON(!n);
1129 kmalloc_dma_caches[i] = create_kmalloc_cache(n,
1130 size, SLAB_CACHE_DMA | flags, 0, 0);
1131 }
1132 }
1133#endif
1134}
1135#endif /* !CONFIG_SLOB */
1136
1137/*
1138 * To avoid unnecessary overhead, we pass through large allocation requests
1139 * directly to the page allocator. We use __GFP_COMP, because we will need to
1140 * know the allocation order to free the pages properly in kfree.
1141 */
1142void *kmalloc_order(size_t size, gfp_t flags, unsigned int order)
1143{
1144 void *ret;
1145 struct page *page;
1146
1147 flags |= __GFP_COMP;
1148 page = alloc_pages(flags, order);
1149 ret = page ? page_address(page) : NULL;
1150 kmemleak_alloc(ret, size, 1, flags);
1151 kasan_kmalloc_large(ret, size, flags);
1152 return ret;
1153}
1154EXPORT_SYMBOL(kmalloc_order);
1155
1156#ifdef CONFIG_TRACING
1157void *kmalloc_order_trace(size_t size, gfp_t flags, unsigned int order)
1158{
1159 void *ret = kmalloc_order(size, flags, order);
1160 trace_kmalloc(_RET_IP_, ret, size, PAGE_SIZE << order, flags);
1161 return ret;
1162}
1163EXPORT_SYMBOL(kmalloc_order_trace);
1164#endif
1165
1166#ifdef CONFIG_SLAB_FREELIST_RANDOM
1167/* Randomize a generic freelist */
1168static void freelist_randomize(struct rnd_state *state, unsigned int *list,
1169 unsigned int count)
1170{
1171 unsigned int rand;
1172 unsigned int i;
1173
1174 for (i = 0; i < count; i++)
1175 list[i] = i;
1176
1177 /* Fisher-Yates shuffle */
1178 for (i = count - 1; i > 0; i--) {
1179 rand = prandom_u32_state(state);
1180 rand %= (i + 1);
1181 swap(list[i], list[rand]);
1182 }
1183}
1184
1185/* Create a random sequence per cache */
1186int cache_random_seq_create(struct kmem_cache *cachep, unsigned int count,
1187 gfp_t gfp)
1188{
1189 struct rnd_state state;
1190
1191 if (count < 2 || cachep->random_seq)
1192 return 0;
1193
1194 cachep->random_seq = kcalloc(count, sizeof(unsigned int), gfp);
1195 if (!cachep->random_seq)
1196 return -ENOMEM;
1197
1198 /* Get best entropy at this stage of boot */
1199 prandom_seed_state(&state, get_random_long());
1200
1201 freelist_randomize(&state, cachep->random_seq, count);
1202 return 0;
1203}
1204
1205/* Destroy the per-cache random freelist sequence */
1206void cache_random_seq_destroy(struct kmem_cache *cachep)
1207{
1208 kfree(cachep->random_seq);
1209 cachep->random_seq = NULL;
1210}
1211#endif /* CONFIG_SLAB_FREELIST_RANDOM */
1212
1213#if defined(CONFIG_SLAB) || defined(CONFIG_SLUB_DEBUG)
1214#ifdef CONFIG_SLAB
1215#define SLABINFO_RIGHTS (S_IWUSR | S_IRUSR)
1216#else
1217#define SLABINFO_RIGHTS S_IRUSR
1218#endif
1219
1220static void print_slabinfo_header(struct seq_file *m)
1221{
1222 /*
1223 * Output format version, so at least we can change it
1224 * without _too_ many complaints.
1225 */
1226#ifdef CONFIG_DEBUG_SLAB
1227 seq_puts(m, "slabinfo - version: 2.1 (statistics)\n");
1228#else
1229 seq_puts(m, "slabinfo - version: 2.1\n");
1230#endif
1231 seq_puts(m, "# name <active_objs> <num_objs> <objsize> <objperslab> <pagesperslab>");
1232 seq_puts(m, " : tunables <limit> <batchcount> <sharedfactor>");
1233 seq_puts(m, " : slabdata <active_slabs> <num_slabs> <sharedavail>");
1234#ifdef CONFIG_DEBUG_SLAB
1235 seq_puts(m, " : globalstat <listallocs> <maxobjs> <grown> <reaped> <error> <maxfreeable> <nodeallocs> <remotefrees> <alienoverflow>");
1236 seq_puts(m, " : cpustat <allochit> <allocmiss> <freehit> <freemiss>");
1237#endif
1238 seq_putc(m, '\n');
1239}
1240
1241void *slab_start(struct seq_file *m, loff_t *pos)
1242{
1243 mutex_lock(&slab_mutex);
1244 return seq_list_start(&slab_root_caches, *pos);
1245}
1246
1247void *slab_next(struct seq_file *m, void *p, loff_t *pos)
1248{
1249 return seq_list_next(p, &slab_root_caches, pos);
1250}
1251
1252void slab_stop(struct seq_file *m, void *p)
1253{
1254 mutex_unlock(&slab_mutex);
1255}
1256
1257static void
1258memcg_accumulate_slabinfo(struct kmem_cache *s, struct slabinfo *info)
1259{
1260 struct kmem_cache *c;
1261 struct slabinfo sinfo;
1262
1263 if (!is_root_cache(s))
1264 return;
1265
1266 for_each_memcg_cache(c, s) {
1267 memset(&sinfo, 0, sizeof(sinfo));
1268 get_slabinfo(c, &sinfo);
1269
1270 info->active_slabs += sinfo.active_slabs;
1271 info->num_slabs += sinfo.num_slabs;
1272 info->shared_avail += sinfo.shared_avail;
1273 info->active_objs += sinfo.active_objs;
1274 info->num_objs += sinfo.num_objs;
1275 }
1276}
1277
1278static void cache_show(struct kmem_cache *s, struct seq_file *m)
1279{
1280 struct slabinfo sinfo;
1281
1282 memset(&sinfo, 0, sizeof(sinfo));
1283 get_slabinfo(s, &sinfo);
1284
1285 memcg_accumulate_slabinfo(s, &sinfo);
1286
1287 seq_printf(m, "%-17s %6lu %6lu %6u %4u %4d",
1288 cache_name(s), sinfo.active_objs, sinfo.num_objs, s->size,
1289 sinfo.objects_per_slab, (1 << sinfo.cache_order));
1290
1291 seq_printf(m, " : tunables %4u %4u %4u",
1292 sinfo.limit, sinfo.batchcount, sinfo.shared);
1293 seq_printf(m, " : slabdata %6lu %6lu %6lu",
1294 sinfo.active_slabs, sinfo.num_slabs, sinfo.shared_avail);
1295 slabinfo_show_stats(m, s);
1296 seq_putc(m, '\n');
1297}
1298
1299static int slab_show(struct seq_file *m, void *p)
1300{
1301 struct kmem_cache *s = list_entry(p, struct kmem_cache, root_caches_node);
1302
1303 if (p == slab_root_caches.next)
1304 print_slabinfo_header(m);
1305 cache_show(s, m);
1306 return 0;
1307}
1308
1309void dump_unreclaimable_slab(void)
1310{
1311 struct kmem_cache *s, *s2;
1312 struct slabinfo sinfo;
1313
1314 /*
1315 * Here acquiring slab_mutex is risky since we don't prefer to get
1316 * sleep in oom path. But, without mutex hold, it may introduce a
1317 * risk of crash.
1318 * Use mutex_trylock to protect the list traverse, dump nothing
1319 * without acquiring the mutex.
1320 */
1321 if (!mutex_trylock(&slab_mutex)) {
1322 pr_warn("excessive unreclaimable slab but cannot dump stats\n");
1323 return;
1324 }
1325
1326 pr_info("Unreclaimable slab info:\n");
1327 pr_info("Name Used Total\n");
1328
1329 list_for_each_entry_safe(s, s2, &slab_caches, list) {
1330 if (!is_root_cache(s) || (s->flags & SLAB_RECLAIM_ACCOUNT))
1331 continue;
1332
1333 get_slabinfo(s, &sinfo);
1334
1335 if (sinfo.num_objs > 0)
1336 pr_info("%-17s %10luKB %10luKB\n", cache_name(s),
1337 (sinfo.active_objs * s->size) / 1024,
1338 (sinfo.num_objs * s->size) / 1024);
1339 }
1340 mutex_unlock(&slab_mutex);
1341}
1342
1343#if defined(CONFIG_MEMCG)
1344void *memcg_slab_start(struct seq_file *m, loff_t *pos)
1345{
1346 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
1347
1348 mutex_lock(&slab_mutex);
1349 return seq_list_start(&memcg->kmem_caches, *pos);
1350}
1351
1352void *memcg_slab_next(struct seq_file *m, void *p, loff_t *pos)
1353{
1354 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
1355
1356 return seq_list_next(p, &memcg->kmem_caches, pos);
1357}
1358
1359void memcg_slab_stop(struct seq_file *m, void *p)
1360{
1361 mutex_unlock(&slab_mutex);
1362}
1363
1364int memcg_slab_show(struct seq_file *m, void *p)
1365{
1366 struct kmem_cache *s = list_entry(p, struct kmem_cache,
1367 memcg_params.kmem_caches_node);
1368 struct mem_cgroup *memcg = mem_cgroup_from_css(seq_css(m));
1369
1370 if (p == memcg->kmem_caches.next)
1371 print_slabinfo_header(m);
1372 cache_show(s, m);
1373 return 0;
1374}
1375#endif
1376
1377/*
1378 * slabinfo_op - iterator that generates /proc/slabinfo
1379 *
1380 * Output layout:
1381 * cache-name
1382 * num-active-objs
1383 * total-objs
1384 * object size
1385 * num-active-slabs
1386 * total-slabs
1387 * num-pages-per-slab
1388 * + further values on SMP and with statistics enabled
1389 */
1390static const struct seq_operations slabinfo_op = {
1391 .start = slab_start,
1392 .next = slab_next,
1393 .stop = slab_stop,
1394 .show = slab_show,
1395};
1396
1397static int slabinfo_open(struct inode *inode, struct file *file)
1398{
1399 return seq_open(file, &slabinfo_op);
1400}
1401
1402static const struct file_operations proc_slabinfo_operations = {
1403 .open = slabinfo_open,
1404 .read = seq_read,
1405 .write = slabinfo_write,
1406 .llseek = seq_lseek,
1407 .release = seq_release,
1408};
1409
1410static int __init slab_proc_init(void)
1411{
1412 proc_create("slabinfo", SLABINFO_RIGHTS, NULL,
1413 &proc_slabinfo_operations);
1414 return 0;
1415}
1416module_init(slab_proc_init);
1417#endif /* CONFIG_SLAB || CONFIG_SLUB_DEBUG */
1418
1419static __always_inline void *__do_krealloc(const void *p, size_t new_size,
1420 gfp_t flags)
1421{
1422 void *ret;
1423 size_t ks = 0;
1424
1425 if (p)
1426 ks = ksize(p);
1427
1428 if (ks >= new_size) {
1429 kasan_krealloc((void *)p, new_size, flags);
1430 return (void *)p;
1431 }
1432
1433 ret = kmalloc_track_caller(new_size, flags);
1434 if (ret && p)
1435 memcpy(ret, p, ks);
1436
1437 return ret;
1438}
1439
1440/**
1441 * __krealloc - like krealloc() but don't free @p.
1442 * @p: object to reallocate memory for.
1443 * @new_size: how many bytes of memory are required.
1444 * @flags: the type of memory to allocate.
1445 *
1446 * This function is like krealloc() except it never frees the originally
1447 * allocated buffer. Use this if you don't want to free the buffer immediately
1448 * like, for example, with RCU.
1449 */
1450void *__krealloc(const void *p, size_t new_size, gfp_t flags)
1451{
1452 if (unlikely(!new_size))
1453 return ZERO_SIZE_PTR;
1454
1455 return __do_krealloc(p, new_size, flags);
1456
1457}
1458EXPORT_SYMBOL(__krealloc);
1459
1460/**
1461 * krealloc - reallocate memory. The contents will remain unchanged.
1462 * @p: object to reallocate memory for.
1463 * @new_size: how many bytes of memory are required.
1464 * @flags: the type of memory to allocate.
1465 *
1466 * The contents of the object pointed to are preserved up to the
1467 * lesser of the new and old sizes. If @p is %NULL, krealloc()
1468 * behaves exactly like kmalloc(). If @new_size is 0 and @p is not a
1469 * %NULL pointer, the object pointed to is freed.
1470 */
1471void *krealloc(const void *p, size_t new_size, gfp_t flags)
1472{
1473 void *ret;
1474
1475 if (unlikely(!new_size)) {
1476 kfree(p);
1477 return ZERO_SIZE_PTR;
1478 }
1479
1480 ret = __do_krealloc(p, new_size, flags);
1481 if (ret && p != ret)
1482 kfree(p);
1483
1484 return ret;
1485}
1486EXPORT_SYMBOL(krealloc);
1487
1488/**
1489 * kzfree - like kfree but zero memory
1490 * @p: object to free memory of
1491 *
1492 * The memory of the object @p points to is zeroed before freed.
1493 * If @p is %NULL, kzfree() does nothing.
1494 *
1495 * Note: this function zeroes the whole allocated buffer which can be a good
1496 * deal bigger than the requested buffer size passed to kmalloc(). So be
1497 * careful when using this function in performance sensitive code.
1498 */
1499void kzfree(const void *p)
1500{
1501 size_t ks;
1502 void *mem = (void *)p;
1503
1504 if (unlikely(ZERO_OR_NULL_PTR(mem)))
1505 return;
1506 ks = ksize(mem);
1507 memset(mem, 0, ks);
1508 kfree(mem);
1509}
1510EXPORT_SYMBOL(kzfree);
1511
1512/* Tracepoints definitions. */
1513EXPORT_TRACEPOINT_SYMBOL(kmalloc);
1514EXPORT_TRACEPOINT_SYMBOL(kmem_cache_alloc);
1515EXPORT_TRACEPOINT_SYMBOL(kmalloc_node);
1516EXPORT_TRACEPOINT_SYMBOL(kmem_cache_alloc_node);
1517EXPORT_TRACEPOINT_SYMBOL(kfree);
1518EXPORT_TRACEPOINT_SYMBOL(kmem_cache_free);
1519
1520int should_failslab(struct kmem_cache *s, gfp_t gfpflags)
1521{
1522 if (__should_failslab(s, gfpflags))
1523 return -ENOMEM;
1524 return 0;
1525}
1526ALLOW_ERROR_INJECTION(should_failslab, ERRNO);
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Slab allocator functions that are independent of the allocator strategy
4 *
5 * (C) 2012 Christoph Lameter <cl@linux.com>
6 */
7#include <linux/slab.h>
8
9#include <linux/mm.h>
10#include <linux/poison.h>
11#include <linux/interrupt.h>
12#include <linux/memory.h>
13#include <linux/cache.h>
14#include <linux/compiler.h>
15#include <linux/kfence.h>
16#include <linux/module.h>
17#include <linux/cpu.h>
18#include <linux/uaccess.h>
19#include <linux/seq_file.h>
20#include <linux/dma-mapping.h>
21#include <linux/swiotlb.h>
22#include <linux/proc_fs.h>
23#include <linux/debugfs.h>
24#include <linux/kmemleak.h>
25#include <linux/kasan.h>
26#include <asm/cacheflush.h>
27#include <asm/tlbflush.h>
28#include <asm/page.h>
29#include <linux/memcontrol.h>
30#include <linux/stackdepot.h>
31
32#include "internal.h"
33#include "slab.h"
34
35#define CREATE_TRACE_POINTS
36#include <trace/events/kmem.h>
37
38enum slab_state slab_state;
39LIST_HEAD(slab_caches);
40DEFINE_MUTEX(slab_mutex);
41struct kmem_cache *kmem_cache;
42
43static LIST_HEAD(slab_caches_to_rcu_destroy);
44static void slab_caches_to_rcu_destroy_workfn(struct work_struct *work);
45static DECLARE_WORK(slab_caches_to_rcu_destroy_work,
46 slab_caches_to_rcu_destroy_workfn);
47
48/*
49 * Set of flags that will prevent slab merging
50 */
51#define SLAB_NEVER_MERGE (SLAB_RED_ZONE | SLAB_POISON | SLAB_STORE_USER | \
52 SLAB_TRACE | SLAB_TYPESAFE_BY_RCU | SLAB_NOLEAKTRACE | \
53 SLAB_FAILSLAB | SLAB_NO_MERGE)
54
55#define SLAB_MERGE_SAME (SLAB_RECLAIM_ACCOUNT | SLAB_CACHE_DMA | \
56 SLAB_CACHE_DMA32 | SLAB_ACCOUNT)
57
58/*
59 * Merge control. If this is set then no merging of slab caches will occur.
60 */
61static bool slab_nomerge = !IS_ENABLED(CONFIG_SLAB_MERGE_DEFAULT);
62
63static int __init setup_slab_nomerge(char *str)
64{
65 slab_nomerge = true;
66 return 1;
67}
68
69static int __init setup_slab_merge(char *str)
70{
71 slab_nomerge = false;
72 return 1;
73}
74
75__setup_param("slub_nomerge", slub_nomerge, setup_slab_nomerge, 0);
76__setup_param("slub_merge", slub_merge, setup_slab_merge, 0);
77
78__setup("slab_nomerge", setup_slab_nomerge);
79__setup("slab_merge", setup_slab_merge);
80
81/*
82 * Determine the size of a slab object
83 */
84unsigned int kmem_cache_size(struct kmem_cache *s)
85{
86 return s->object_size;
87}
88EXPORT_SYMBOL(kmem_cache_size);
89
90#ifdef CONFIG_DEBUG_VM
91static int kmem_cache_sanity_check(const char *name, unsigned int size)
92{
93 if (!name || in_interrupt() || size > KMALLOC_MAX_SIZE) {
94 pr_err("kmem_cache_create(%s) integrity check failed\n", name);
95 return -EINVAL;
96 }
97
98 WARN_ON(strchr(name, ' ')); /* It confuses parsers */
99 return 0;
100}
101#else
102static inline int kmem_cache_sanity_check(const char *name, unsigned int size)
103{
104 return 0;
105}
106#endif
107
108/*
109 * Figure out what the alignment of the objects will be given a set of
110 * flags, a user specified alignment and the size of the objects.
111 */
112static unsigned int calculate_alignment(slab_flags_t flags,
113 unsigned int align, unsigned int size)
114{
115 /*
116 * If the user wants hardware cache aligned objects then follow that
117 * suggestion if the object is sufficiently large.
118 *
119 * The hardware cache alignment cannot override the specified
120 * alignment though. If that is greater then use it.
121 */
122 if (flags & SLAB_HWCACHE_ALIGN) {
123 unsigned int ralign;
124
125 ralign = cache_line_size();
126 while (size <= ralign / 2)
127 ralign /= 2;
128 align = max(align, ralign);
129 }
130
131 align = max(align, arch_slab_minalign());
132
133 return ALIGN(align, sizeof(void *));
134}
135
136/*
137 * Find a mergeable slab cache
138 */
139int slab_unmergeable(struct kmem_cache *s)
140{
141 if (slab_nomerge || (s->flags & SLAB_NEVER_MERGE))
142 return 1;
143
144 if (s->ctor)
145 return 1;
146
147#ifdef CONFIG_HARDENED_USERCOPY
148 if (s->usersize)
149 return 1;
150#endif
151
152 /*
153 * We may have set a slab to be unmergeable during bootstrap.
154 */
155 if (s->refcount < 0)
156 return 1;
157
158 return 0;
159}
160
161struct kmem_cache *find_mergeable(unsigned int size, unsigned int align,
162 slab_flags_t flags, const char *name, void (*ctor)(void *))
163{
164 struct kmem_cache *s;
165
166 if (slab_nomerge)
167 return NULL;
168
169 if (ctor)
170 return NULL;
171
172 size = ALIGN(size, sizeof(void *));
173 align = calculate_alignment(flags, align, size);
174 size = ALIGN(size, align);
175 flags = kmem_cache_flags(flags, name);
176
177 if (flags & SLAB_NEVER_MERGE)
178 return NULL;
179
180 list_for_each_entry_reverse(s, &slab_caches, list) {
181 if (slab_unmergeable(s))
182 continue;
183
184 if (size > s->size)
185 continue;
186
187 if ((flags & SLAB_MERGE_SAME) != (s->flags & SLAB_MERGE_SAME))
188 continue;
189 /*
190 * Check if alignment is compatible.
191 * Courtesy of Adrian Drzewiecki
192 */
193 if ((s->size & ~(align - 1)) != s->size)
194 continue;
195
196 if (s->size - size >= sizeof(void *))
197 continue;
198
199 return s;
200 }
201 return NULL;
202}
203
204static struct kmem_cache *create_cache(const char *name,
205 unsigned int object_size, unsigned int align,
206 slab_flags_t flags, unsigned int useroffset,
207 unsigned int usersize, void (*ctor)(void *),
208 struct kmem_cache *root_cache)
209{
210 struct kmem_cache *s;
211 int err;
212
213 if (WARN_ON(useroffset + usersize > object_size))
214 useroffset = usersize = 0;
215
216 err = -ENOMEM;
217 s = kmem_cache_zalloc(kmem_cache, GFP_KERNEL);
218 if (!s)
219 goto out;
220
221 s->name = name;
222 s->size = s->object_size = object_size;
223 s->align = align;
224 s->ctor = ctor;
225#ifdef CONFIG_HARDENED_USERCOPY
226 s->useroffset = useroffset;
227 s->usersize = usersize;
228#endif
229
230 err = __kmem_cache_create(s, flags);
231 if (err)
232 goto out_free_cache;
233
234 s->refcount = 1;
235 list_add(&s->list, &slab_caches);
236 return s;
237
238out_free_cache:
239 kmem_cache_free(kmem_cache, s);
240out:
241 return ERR_PTR(err);
242}
243
244/**
245 * kmem_cache_create_usercopy - Create a cache with a region suitable
246 * for copying to userspace
247 * @name: A string which is used in /proc/slabinfo to identify this cache.
248 * @size: The size of objects to be created in this cache.
249 * @align: The required alignment for the objects.
250 * @flags: SLAB flags
251 * @useroffset: Usercopy region offset
252 * @usersize: Usercopy region size
253 * @ctor: A constructor for the objects.
254 *
255 * Cannot be called within a interrupt, but can be interrupted.
256 * The @ctor is run when new pages are allocated by the cache.
257 *
258 * The flags are
259 *
260 * %SLAB_POISON - Poison the slab with a known test pattern (a5a5a5a5)
261 * to catch references to uninitialised memory.
262 *
263 * %SLAB_RED_ZONE - Insert `Red` zones around the allocated memory to check
264 * for buffer overruns.
265 *
266 * %SLAB_HWCACHE_ALIGN - Align the objects in this cache to a hardware
267 * cacheline. This can be beneficial if you're counting cycles as closely
268 * as davem.
269 *
270 * Return: a pointer to the cache on success, NULL on failure.
271 */
272struct kmem_cache *
273kmem_cache_create_usercopy(const char *name,
274 unsigned int size, unsigned int align,
275 slab_flags_t flags,
276 unsigned int useroffset, unsigned int usersize,
277 void (*ctor)(void *))
278{
279 struct kmem_cache *s = NULL;
280 const char *cache_name;
281 int err;
282
283#ifdef CONFIG_SLUB_DEBUG
284 /*
285 * If no slab_debug was enabled globally, the static key is not yet
286 * enabled by setup_slub_debug(). Enable it if the cache is being
287 * created with any of the debugging flags passed explicitly.
288 * It's also possible that this is the first cache created with
289 * SLAB_STORE_USER and we should init stack_depot for it.
290 */
291 if (flags & SLAB_DEBUG_FLAGS)
292 static_branch_enable(&slub_debug_enabled);
293 if (flags & SLAB_STORE_USER)
294 stack_depot_init();
295#endif
296
297 mutex_lock(&slab_mutex);
298
299 err = kmem_cache_sanity_check(name, size);
300 if (err) {
301 goto out_unlock;
302 }
303
304 /* Refuse requests with allocator specific flags */
305 if (flags & ~SLAB_FLAGS_PERMITTED) {
306 err = -EINVAL;
307 goto out_unlock;
308 }
309
310 /*
311 * Some allocators will constraint the set of valid flags to a subset
312 * of all flags. We expect them to define CACHE_CREATE_MASK in this
313 * case, and we'll just provide them with a sanitized version of the
314 * passed flags.
315 */
316 flags &= CACHE_CREATE_MASK;
317
318 /* Fail closed on bad usersize of useroffset values. */
319 if (!IS_ENABLED(CONFIG_HARDENED_USERCOPY) ||
320 WARN_ON(!usersize && useroffset) ||
321 WARN_ON(size < usersize || size - usersize < useroffset))
322 usersize = useroffset = 0;
323
324 if (!usersize)
325 s = __kmem_cache_alias(name, size, align, flags, ctor);
326 if (s)
327 goto out_unlock;
328
329 cache_name = kstrdup_const(name, GFP_KERNEL);
330 if (!cache_name) {
331 err = -ENOMEM;
332 goto out_unlock;
333 }
334
335 s = create_cache(cache_name, size,
336 calculate_alignment(flags, align, size),
337 flags, useroffset, usersize, ctor, NULL);
338 if (IS_ERR(s)) {
339 err = PTR_ERR(s);
340 kfree_const(cache_name);
341 }
342
343out_unlock:
344 mutex_unlock(&slab_mutex);
345
346 if (err) {
347 if (flags & SLAB_PANIC)
348 panic("%s: Failed to create slab '%s'. Error %d\n",
349 __func__, name, err);
350 else {
351 pr_warn("%s(%s) failed with error %d\n",
352 __func__, name, err);
353 dump_stack();
354 }
355 return NULL;
356 }
357 return s;
358}
359EXPORT_SYMBOL(kmem_cache_create_usercopy);
360
361/**
362 * kmem_cache_create - Create a cache.
363 * @name: A string which is used in /proc/slabinfo to identify this cache.
364 * @size: The size of objects to be created in this cache.
365 * @align: The required alignment for the objects.
366 * @flags: SLAB flags
367 * @ctor: A constructor for the objects.
368 *
369 * Cannot be called within a interrupt, but can be interrupted.
370 * The @ctor is run when new pages are allocated by the cache.
371 *
372 * The flags are
373 *
374 * %SLAB_POISON - Poison the slab with a known test pattern (a5a5a5a5)
375 * to catch references to uninitialised memory.
376 *
377 * %SLAB_RED_ZONE - Insert `Red` zones around the allocated memory to check
378 * for buffer overruns.
379 *
380 * %SLAB_HWCACHE_ALIGN - Align the objects in this cache to a hardware
381 * cacheline. This can be beneficial if you're counting cycles as closely
382 * as davem.
383 *
384 * Return: a pointer to the cache on success, NULL on failure.
385 */
386struct kmem_cache *
387kmem_cache_create(const char *name, unsigned int size, unsigned int align,
388 slab_flags_t flags, void (*ctor)(void *))
389{
390 return kmem_cache_create_usercopy(name, size, align, flags, 0, 0,
391 ctor);
392}
393EXPORT_SYMBOL(kmem_cache_create);
394
395#ifdef SLAB_SUPPORTS_SYSFS
396/*
397 * For a given kmem_cache, kmem_cache_destroy() should only be called
398 * once or there will be a use-after-free problem. The actual deletion
399 * and release of the kobject does not need slab_mutex or cpu_hotplug_lock
400 * protection. So they are now done without holding those locks.
401 *
402 * Note that there will be a slight delay in the deletion of sysfs files
403 * if kmem_cache_release() is called indrectly from a work function.
404 */
405static void kmem_cache_release(struct kmem_cache *s)
406{
407 if (slab_state >= FULL) {
408 sysfs_slab_unlink(s);
409 sysfs_slab_release(s);
410 } else {
411 slab_kmem_cache_release(s);
412 }
413}
414#else
415static void kmem_cache_release(struct kmem_cache *s)
416{
417 slab_kmem_cache_release(s);
418}
419#endif
420
421static void slab_caches_to_rcu_destroy_workfn(struct work_struct *work)
422{
423 LIST_HEAD(to_destroy);
424 struct kmem_cache *s, *s2;
425
426 /*
427 * On destruction, SLAB_TYPESAFE_BY_RCU kmem_caches are put on the
428 * @slab_caches_to_rcu_destroy list. The slab pages are freed
429 * through RCU and the associated kmem_cache are dereferenced
430 * while freeing the pages, so the kmem_caches should be freed only
431 * after the pending RCU operations are finished. As rcu_barrier()
432 * is a pretty slow operation, we batch all pending destructions
433 * asynchronously.
434 */
435 mutex_lock(&slab_mutex);
436 list_splice_init(&slab_caches_to_rcu_destroy, &to_destroy);
437 mutex_unlock(&slab_mutex);
438
439 if (list_empty(&to_destroy))
440 return;
441
442 rcu_barrier();
443
444 list_for_each_entry_safe(s, s2, &to_destroy, list) {
445 debugfs_slab_release(s);
446 kfence_shutdown_cache(s);
447 kmem_cache_release(s);
448 }
449}
450
451static int shutdown_cache(struct kmem_cache *s)
452{
453 /* free asan quarantined objects */
454 kasan_cache_shutdown(s);
455
456 if (__kmem_cache_shutdown(s) != 0)
457 return -EBUSY;
458
459 list_del(&s->list);
460
461 if (s->flags & SLAB_TYPESAFE_BY_RCU) {
462 list_add_tail(&s->list, &slab_caches_to_rcu_destroy);
463 schedule_work(&slab_caches_to_rcu_destroy_work);
464 } else {
465 kfence_shutdown_cache(s);
466 debugfs_slab_release(s);
467 }
468
469 return 0;
470}
471
472void slab_kmem_cache_release(struct kmem_cache *s)
473{
474 __kmem_cache_release(s);
475 kfree_const(s->name);
476 kmem_cache_free(kmem_cache, s);
477}
478
479void kmem_cache_destroy(struct kmem_cache *s)
480{
481 int err = -EBUSY;
482 bool rcu_set;
483
484 if (unlikely(!s) || !kasan_check_byte(s))
485 return;
486
487 cpus_read_lock();
488 mutex_lock(&slab_mutex);
489
490 rcu_set = s->flags & SLAB_TYPESAFE_BY_RCU;
491
492 s->refcount--;
493 if (s->refcount)
494 goto out_unlock;
495
496 err = shutdown_cache(s);
497 WARN(err, "%s %s: Slab cache still has objects when called from %pS",
498 __func__, s->name, (void *)_RET_IP_);
499out_unlock:
500 mutex_unlock(&slab_mutex);
501 cpus_read_unlock();
502 if (!err && !rcu_set)
503 kmem_cache_release(s);
504}
505EXPORT_SYMBOL(kmem_cache_destroy);
506
507/**
508 * kmem_cache_shrink - Shrink a cache.
509 * @cachep: The cache to shrink.
510 *
511 * Releases as many slabs as possible for a cache.
512 * To help debugging, a zero exit status indicates all slabs were released.
513 *
514 * Return: %0 if all slabs were released, non-zero otherwise
515 */
516int kmem_cache_shrink(struct kmem_cache *cachep)
517{
518 kasan_cache_shrink(cachep);
519
520 return __kmem_cache_shrink(cachep);
521}
522EXPORT_SYMBOL(kmem_cache_shrink);
523
524bool slab_is_available(void)
525{
526 return slab_state >= UP;
527}
528
529#ifdef CONFIG_PRINTK
530static void kmem_obj_info(struct kmem_obj_info *kpp, void *object, struct slab *slab)
531{
532 if (__kfence_obj_info(kpp, object, slab))
533 return;
534 __kmem_obj_info(kpp, object, slab);
535}
536
537/**
538 * kmem_dump_obj - Print available slab provenance information
539 * @object: slab object for which to find provenance information.
540 *
541 * This function uses pr_cont(), so that the caller is expected to have
542 * printed out whatever preamble is appropriate. The provenance information
543 * depends on the type of object and on how much debugging is enabled.
544 * For a slab-cache object, the fact that it is a slab object is printed,
545 * and, if available, the slab name, return address, and stack trace from
546 * the allocation and last free path of that object.
547 *
548 * Return: %true if the pointer is to a not-yet-freed object from
549 * kmalloc() or kmem_cache_alloc(), either %true or %false if the pointer
550 * is to an already-freed object, and %false otherwise.
551 */
552bool kmem_dump_obj(void *object)
553{
554 char *cp = IS_ENABLED(CONFIG_MMU) ? "" : "/vmalloc";
555 int i;
556 struct slab *slab;
557 unsigned long ptroffset;
558 struct kmem_obj_info kp = { };
559
560 /* Some arches consider ZERO_SIZE_PTR to be a valid address. */
561 if (object < (void *)PAGE_SIZE || !virt_addr_valid(object))
562 return false;
563 slab = virt_to_slab(object);
564 if (!slab)
565 return false;
566
567 kmem_obj_info(&kp, object, slab);
568 if (kp.kp_slab_cache)
569 pr_cont(" slab%s %s", cp, kp.kp_slab_cache->name);
570 else
571 pr_cont(" slab%s", cp);
572 if (is_kfence_address(object))
573 pr_cont(" (kfence)");
574 if (kp.kp_objp)
575 pr_cont(" start %px", kp.kp_objp);
576 if (kp.kp_data_offset)
577 pr_cont(" data offset %lu", kp.kp_data_offset);
578 if (kp.kp_objp) {
579 ptroffset = ((char *)object - (char *)kp.kp_objp) - kp.kp_data_offset;
580 pr_cont(" pointer offset %lu", ptroffset);
581 }
582 if (kp.kp_slab_cache && kp.kp_slab_cache->object_size)
583 pr_cont(" size %u", kp.kp_slab_cache->object_size);
584 if (kp.kp_ret)
585 pr_cont(" allocated at %pS\n", kp.kp_ret);
586 else
587 pr_cont("\n");
588 for (i = 0; i < ARRAY_SIZE(kp.kp_stack); i++) {
589 if (!kp.kp_stack[i])
590 break;
591 pr_info(" %pS\n", kp.kp_stack[i]);
592 }
593
594 if (kp.kp_free_stack[0])
595 pr_cont(" Free path:\n");
596
597 for (i = 0; i < ARRAY_SIZE(kp.kp_free_stack); i++) {
598 if (!kp.kp_free_stack[i])
599 break;
600 pr_info(" %pS\n", kp.kp_free_stack[i]);
601 }
602
603 return true;
604}
605EXPORT_SYMBOL_GPL(kmem_dump_obj);
606#endif
607
608/* Create a cache during boot when no slab services are available yet */
609void __init create_boot_cache(struct kmem_cache *s, const char *name,
610 unsigned int size, slab_flags_t flags,
611 unsigned int useroffset, unsigned int usersize)
612{
613 int err;
614 unsigned int align = ARCH_KMALLOC_MINALIGN;
615
616 s->name = name;
617 s->size = s->object_size = size;
618
619 /*
620 * For power of two sizes, guarantee natural alignment for kmalloc
621 * caches, regardless of SL*B debugging options.
622 */
623 if (is_power_of_2(size))
624 align = max(align, size);
625 s->align = calculate_alignment(flags, align, size);
626
627#ifdef CONFIG_HARDENED_USERCOPY
628 s->useroffset = useroffset;
629 s->usersize = usersize;
630#endif
631
632 err = __kmem_cache_create(s, flags);
633
634 if (err)
635 panic("Creation of kmalloc slab %s size=%u failed. Reason %d\n",
636 name, size, err);
637
638 s->refcount = -1; /* Exempt from merging for now */
639}
640
641static struct kmem_cache *__init create_kmalloc_cache(const char *name,
642 unsigned int size,
643 slab_flags_t flags)
644{
645 struct kmem_cache *s = kmem_cache_zalloc(kmem_cache, GFP_NOWAIT);
646
647 if (!s)
648 panic("Out of memory when creating slab %s\n", name);
649
650 create_boot_cache(s, name, size, flags | SLAB_KMALLOC, 0, size);
651 list_add(&s->list, &slab_caches);
652 s->refcount = 1;
653 return s;
654}
655
656struct kmem_cache *
657kmalloc_caches[NR_KMALLOC_TYPES][KMALLOC_SHIFT_HIGH + 1] __ro_after_init =
658{ /* initialization for https://llvm.org/pr42570 */ };
659EXPORT_SYMBOL(kmalloc_caches);
660
661#ifdef CONFIG_RANDOM_KMALLOC_CACHES
662unsigned long random_kmalloc_seed __ro_after_init;
663EXPORT_SYMBOL(random_kmalloc_seed);
664#endif
665
666/*
667 * Conversion table for small slabs sizes / 8 to the index in the
668 * kmalloc array. This is necessary for slabs < 192 since we have non power
669 * of two cache sizes there. The size of larger slabs can be determined using
670 * fls.
671 */
672u8 kmalloc_size_index[24] __ro_after_init = {
673 3, /* 8 */
674 4, /* 16 */
675 5, /* 24 */
676 5, /* 32 */
677 6, /* 40 */
678 6, /* 48 */
679 6, /* 56 */
680 6, /* 64 */
681 1, /* 72 */
682 1, /* 80 */
683 1, /* 88 */
684 1, /* 96 */
685 7, /* 104 */
686 7, /* 112 */
687 7, /* 120 */
688 7, /* 128 */
689 2, /* 136 */
690 2, /* 144 */
691 2, /* 152 */
692 2, /* 160 */
693 2, /* 168 */
694 2, /* 176 */
695 2, /* 184 */
696 2 /* 192 */
697};
698
699size_t kmalloc_size_roundup(size_t size)
700{
701 if (size && size <= KMALLOC_MAX_CACHE_SIZE) {
702 /*
703 * The flags don't matter since size_index is common to all.
704 * Neither does the caller for just getting ->object_size.
705 */
706 return kmalloc_slab(size, GFP_KERNEL, 0)->object_size;
707 }
708
709 /* Above the smaller buckets, size is a multiple of page size. */
710 if (size && size <= KMALLOC_MAX_SIZE)
711 return PAGE_SIZE << get_order(size);
712
713 /*
714 * Return 'size' for 0 - kmalloc() returns ZERO_SIZE_PTR
715 * and very large size - kmalloc() may fail.
716 */
717 return size;
718
719}
720EXPORT_SYMBOL(kmalloc_size_roundup);
721
722#ifdef CONFIG_ZONE_DMA
723#define KMALLOC_DMA_NAME(sz) .name[KMALLOC_DMA] = "dma-kmalloc-" #sz,
724#else
725#define KMALLOC_DMA_NAME(sz)
726#endif
727
728#ifdef CONFIG_MEMCG_KMEM
729#define KMALLOC_CGROUP_NAME(sz) .name[KMALLOC_CGROUP] = "kmalloc-cg-" #sz,
730#else
731#define KMALLOC_CGROUP_NAME(sz)
732#endif
733
734#ifndef CONFIG_SLUB_TINY
735#define KMALLOC_RCL_NAME(sz) .name[KMALLOC_RECLAIM] = "kmalloc-rcl-" #sz,
736#else
737#define KMALLOC_RCL_NAME(sz)
738#endif
739
740#ifdef CONFIG_RANDOM_KMALLOC_CACHES
741#define __KMALLOC_RANDOM_CONCAT(a, b) a ## b
742#define KMALLOC_RANDOM_NAME(N, sz) __KMALLOC_RANDOM_CONCAT(KMA_RAND_, N)(sz)
743#define KMA_RAND_1(sz) .name[KMALLOC_RANDOM_START + 1] = "kmalloc-rnd-01-" #sz,
744#define KMA_RAND_2(sz) KMA_RAND_1(sz) .name[KMALLOC_RANDOM_START + 2] = "kmalloc-rnd-02-" #sz,
745#define KMA_RAND_3(sz) KMA_RAND_2(sz) .name[KMALLOC_RANDOM_START + 3] = "kmalloc-rnd-03-" #sz,
746#define KMA_RAND_4(sz) KMA_RAND_3(sz) .name[KMALLOC_RANDOM_START + 4] = "kmalloc-rnd-04-" #sz,
747#define KMA_RAND_5(sz) KMA_RAND_4(sz) .name[KMALLOC_RANDOM_START + 5] = "kmalloc-rnd-05-" #sz,
748#define KMA_RAND_6(sz) KMA_RAND_5(sz) .name[KMALLOC_RANDOM_START + 6] = "kmalloc-rnd-06-" #sz,
749#define KMA_RAND_7(sz) KMA_RAND_6(sz) .name[KMALLOC_RANDOM_START + 7] = "kmalloc-rnd-07-" #sz,
750#define KMA_RAND_8(sz) KMA_RAND_7(sz) .name[KMALLOC_RANDOM_START + 8] = "kmalloc-rnd-08-" #sz,
751#define KMA_RAND_9(sz) KMA_RAND_8(sz) .name[KMALLOC_RANDOM_START + 9] = "kmalloc-rnd-09-" #sz,
752#define KMA_RAND_10(sz) KMA_RAND_9(sz) .name[KMALLOC_RANDOM_START + 10] = "kmalloc-rnd-10-" #sz,
753#define KMA_RAND_11(sz) KMA_RAND_10(sz) .name[KMALLOC_RANDOM_START + 11] = "kmalloc-rnd-11-" #sz,
754#define KMA_RAND_12(sz) KMA_RAND_11(sz) .name[KMALLOC_RANDOM_START + 12] = "kmalloc-rnd-12-" #sz,
755#define KMA_RAND_13(sz) KMA_RAND_12(sz) .name[KMALLOC_RANDOM_START + 13] = "kmalloc-rnd-13-" #sz,
756#define KMA_RAND_14(sz) KMA_RAND_13(sz) .name[KMALLOC_RANDOM_START + 14] = "kmalloc-rnd-14-" #sz,
757#define KMA_RAND_15(sz) KMA_RAND_14(sz) .name[KMALLOC_RANDOM_START + 15] = "kmalloc-rnd-15-" #sz,
758#else // CONFIG_RANDOM_KMALLOC_CACHES
759#define KMALLOC_RANDOM_NAME(N, sz)
760#endif
761
762#define INIT_KMALLOC_INFO(__size, __short_size) \
763{ \
764 .name[KMALLOC_NORMAL] = "kmalloc-" #__short_size, \
765 KMALLOC_RCL_NAME(__short_size) \
766 KMALLOC_CGROUP_NAME(__short_size) \
767 KMALLOC_DMA_NAME(__short_size) \
768 KMALLOC_RANDOM_NAME(RANDOM_KMALLOC_CACHES_NR, __short_size) \
769 .size = __size, \
770}
771
772/*
773 * kmalloc_info[] is to make slab_debug=,kmalloc-xx option work at boot time.
774 * kmalloc_index() supports up to 2^21=2MB, so the final entry of the table is
775 * kmalloc-2M.
776 */
777const struct kmalloc_info_struct kmalloc_info[] __initconst = {
778 INIT_KMALLOC_INFO(0, 0),
779 INIT_KMALLOC_INFO(96, 96),
780 INIT_KMALLOC_INFO(192, 192),
781 INIT_KMALLOC_INFO(8, 8),
782 INIT_KMALLOC_INFO(16, 16),
783 INIT_KMALLOC_INFO(32, 32),
784 INIT_KMALLOC_INFO(64, 64),
785 INIT_KMALLOC_INFO(128, 128),
786 INIT_KMALLOC_INFO(256, 256),
787 INIT_KMALLOC_INFO(512, 512),
788 INIT_KMALLOC_INFO(1024, 1k),
789 INIT_KMALLOC_INFO(2048, 2k),
790 INIT_KMALLOC_INFO(4096, 4k),
791 INIT_KMALLOC_INFO(8192, 8k),
792 INIT_KMALLOC_INFO(16384, 16k),
793 INIT_KMALLOC_INFO(32768, 32k),
794 INIT_KMALLOC_INFO(65536, 64k),
795 INIT_KMALLOC_INFO(131072, 128k),
796 INIT_KMALLOC_INFO(262144, 256k),
797 INIT_KMALLOC_INFO(524288, 512k),
798 INIT_KMALLOC_INFO(1048576, 1M),
799 INIT_KMALLOC_INFO(2097152, 2M)
800};
801
802/*
803 * Patch up the size_index table if we have strange large alignment
804 * requirements for the kmalloc array. This is only the case for
805 * MIPS it seems. The standard arches will not generate any code here.
806 *
807 * Largest permitted alignment is 256 bytes due to the way we
808 * handle the index determination for the smaller caches.
809 *
810 * Make sure that nothing crazy happens if someone starts tinkering
811 * around with ARCH_KMALLOC_MINALIGN
812 */
813void __init setup_kmalloc_cache_index_table(void)
814{
815 unsigned int i;
816
817 BUILD_BUG_ON(KMALLOC_MIN_SIZE > 256 ||
818 !is_power_of_2(KMALLOC_MIN_SIZE));
819
820 for (i = 8; i < KMALLOC_MIN_SIZE; i += 8) {
821 unsigned int elem = size_index_elem(i);
822
823 if (elem >= ARRAY_SIZE(kmalloc_size_index))
824 break;
825 kmalloc_size_index[elem] = KMALLOC_SHIFT_LOW;
826 }
827
828 if (KMALLOC_MIN_SIZE >= 64) {
829 /*
830 * The 96 byte sized cache is not used if the alignment
831 * is 64 byte.
832 */
833 for (i = 64 + 8; i <= 96; i += 8)
834 kmalloc_size_index[size_index_elem(i)] = 7;
835
836 }
837
838 if (KMALLOC_MIN_SIZE >= 128) {
839 /*
840 * The 192 byte sized cache is not used if the alignment
841 * is 128 byte. Redirect kmalloc to use the 256 byte cache
842 * instead.
843 */
844 for (i = 128 + 8; i <= 192; i += 8)
845 kmalloc_size_index[size_index_elem(i)] = 8;
846 }
847}
848
849static unsigned int __kmalloc_minalign(void)
850{
851 unsigned int minalign = dma_get_cache_alignment();
852
853 if (IS_ENABLED(CONFIG_DMA_BOUNCE_UNALIGNED_KMALLOC) &&
854 is_swiotlb_allocated())
855 minalign = ARCH_KMALLOC_MINALIGN;
856
857 return max(minalign, arch_slab_minalign());
858}
859
860static void __init
861new_kmalloc_cache(int idx, enum kmalloc_cache_type type)
862{
863 slab_flags_t flags = 0;
864 unsigned int minalign = __kmalloc_minalign();
865 unsigned int aligned_size = kmalloc_info[idx].size;
866 int aligned_idx = idx;
867
868 if ((KMALLOC_RECLAIM != KMALLOC_NORMAL) && (type == KMALLOC_RECLAIM)) {
869 flags |= SLAB_RECLAIM_ACCOUNT;
870 } else if (IS_ENABLED(CONFIG_MEMCG_KMEM) && (type == KMALLOC_CGROUP)) {
871 if (mem_cgroup_kmem_disabled()) {
872 kmalloc_caches[type][idx] = kmalloc_caches[KMALLOC_NORMAL][idx];
873 return;
874 }
875 flags |= SLAB_ACCOUNT;
876 } else if (IS_ENABLED(CONFIG_ZONE_DMA) && (type == KMALLOC_DMA)) {
877 flags |= SLAB_CACHE_DMA;
878 }
879
880#ifdef CONFIG_RANDOM_KMALLOC_CACHES
881 if (type >= KMALLOC_RANDOM_START && type <= KMALLOC_RANDOM_END)
882 flags |= SLAB_NO_MERGE;
883#endif
884
885 /*
886 * If CONFIG_MEMCG_KMEM is enabled, disable cache merging for
887 * KMALLOC_NORMAL caches.
888 */
889 if (IS_ENABLED(CONFIG_MEMCG_KMEM) && (type == KMALLOC_NORMAL))
890 flags |= SLAB_NO_MERGE;
891
892 if (minalign > ARCH_KMALLOC_MINALIGN) {
893 aligned_size = ALIGN(aligned_size, minalign);
894 aligned_idx = __kmalloc_index(aligned_size, false);
895 }
896
897 if (!kmalloc_caches[type][aligned_idx])
898 kmalloc_caches[type][aligned_idx] = create_kmalloc_cache(
899 kmalloc_info[aligned_idx].name[type],
900 aligned_size, flags);
901 if (idx != aligned_idx)
902 kmalloc_caches[type][idx] = kmalloc_caches[type][aligned_idx];
903}
904
905/*
906 * Create the kmalloc array. Some of the regular kmalloc arrays
907 * may already have been created because they were needed to
908 * enable allocations for slab creation.
909 */
910void __init create_kmalloc_caches(void)
911{
912 int i;
913 enum kmalloc_cache_type type;
914
915 /*
916 * Including KMALLOC_CGROUP if CONFIG_MEMCG_KMEM defined
917 */
918 for (type = KMALLOC_NORMAL; type < NR_KMALLOC_TYPES; type++) {
919 for (i = KMALLOC_SHIFT_LOW; i <= KMALLOC_SHIFT_HIGH; i++) {
920 if (!kmalloc_caches[type][i])
921 new_kmalloc_cache(i, type);
922
923 /*
924 * Caches that are not of the two-to-the-power-of size.
925 * These have to be created immediately after the
926 * earlier power of two caches
927 */
928 if (KMALLOC_MIN_SIZE <= 32 && i == 6 &&
929 !kmalloc_caches[type][1])
930 new_kmalloc_cache(1, type);
931 if (KMALLOC_MIN_SIZE <= 64 && i == 7 &&
932 !kmalloc_caches[type][2])
933 new_kmalloc_cache(2, type);
934 }
935 }
936#ifdef CONFIG_RANDOM_KMALLOC_CACHES
937 random_kmalloc_seed = get_random_u64();
938#endif
939
940 /* Kmalloc array is now usable */
941 slab_state = UP;
942}
943
944/**
945 * __ksize -- Report full size of underlying allocation
946 * @object: pointer to the object
947 *
948 * This should only be used internally to query the true size of allocations.
949 * It is not meant to be a way to discover the usable size of an allocation
950 * after the fact. Instead, use kmalloc_size_roundup(). Using memory beyond
951 * the originally requested allocation size may trigger KASAN, UBSAN_BOUNDS,
952 * and/or FORTIFY_SOURCE.
953 *
954 * Return: size of the actual memory used by @object in bytes
955 */
956size_t __ksize(const void *object)
957{
958 struct folio *folio;
959
960 if (unlikely(object == ZERO_SIZE_PTR))
961 return 0;
962
963 folio = virt_to_folio(object);
964
965 if (unlikely(!folio_test_slab(folio))) {
966 if (WARN_ON(folio_size(folio) <= KMALLOC_MAX_CACHE_SIZE))
967 return 0;
968 if (WARN_ON(object != folio_address(folio)))
969 return 0;
970 return folio_size(folio);
971 }
972
973#ifdef CONFIG_SLUB_DEBUG
974 skip_orig_size_check(folio_slab(folio)->slab_cache, object);
975#endif
976
977 return slab_ksize(folio_slab(folio)->slab_cache);
978}
979
980gfp_t kmalloc_fix_flags(gfp_t flags)
981{
982 gfp_t invalid_mask = flags & GFP_SLAB_BUG_MASK;
983
984 flags &= ~GFP_SLAB_BUG_MASK;
985 pr_warn("Unexpected gfp: %#x (%pGg). Fixing up to gfp: %#x (%pGg). Fix your code!\n",
986 invalid_mask, &invalid_mask, flags, &flags);
987 dump_stack();
988
989 return flags;
990}
991
992#ifdef CONFIG_SLAB_FREELIST_RANDOM
993/* Randomize a generic freelist */
994static void freelist_randomize(unsigned int *list,
995 unsigned int count)
996{
997 unsigned int rand;
998 unsigned int i;
999
1000 for (i = 0; i < count; i++)
1001 list[i] = i;
1002
1003 /* Fisher-Yates shuffle */
1004 for (i = count - 1; i > 0; i--) {
1005 rand = get_random_u32_below(i + 1);
1006 swap(list[i], list[rand]);
1007 }
1008}
1009
1010/* Create a random sequence per cache */
1011int cache_random_seq_create(struct kmem_cache *cachep, unsigned int count,
1012 gfp_t gfp)
1013{
1014
1015 if (count < 2 || cachep->random_seq)
1016 return 0;
1017
1018 cachep->random_seq = kcalloc(count, sizeof(unsigned int), gfp);
1019 if (!cachep->random_seq)
1020 return -ENOMEM;
1021
1022 freelist_randomize(cachep->random_seq, count);
1023 return 0;
1024}
1025
1026/* Destroy the per-cache random freelist sequence */
1027void cache_random_seq_destroy(struct kmem_cache *cachep)
1028{
1029 kfree(cachep->random_seq);
1030 cachep->random_seq = NULL;
1031}
1032#endif /* CONFIG_SLAB_FREELIST_RANDOM */
1033
1034#ifdef CONFIG_SLUB_DEBUG
1035#define SLABINFO_RIGHTS (0400)
1036
1037static void print_slabinfo_header(struct seq_file *m)
1038{
1039 /*
1040 * Output format version, so at least we can change it
1041 * without _too_ many complaints.
1042 */
1043 seq_puts(m, "slabinfo - version: 2.1\n");
1044 seq_puts(m, "# name <active_objs> <num_objs> <objsize> <objperslab> <pagesperslab>");
1045 seq_puts(m, " : tunables <limit> <batchcount> <sharedfactor>");
1046 seq_puts(m, " : slabdata <active_slabs> <num_slabs> <sharedavail>");
1047 seq_putc(m, '\n');
1048}
1049
1050static void *slab_start(struct seq_file *m, loff_t *pos)
1051{
1052 mutex_lock(&slab_mutex);
1053 return seq_list_start(&slab_caches, *pos);
1054}
1055
1056static void *slab_next(struct seq_file *m, void *p, loff_t *pos)
1057{
1058 return seq_list_next(p, &slab_caches, pos);
1059}
1060
1061static void slab_stop(struct seq_file *m, void *p)
1062{
1063 mutex_unlock(&slab_mutex);
1064}
1065
1066static void cache_show(struct kmem_cache *s, struct seq_file *m)
1067{
1068 struct slabinfo sinfo;
1069
1070 memset(&sinfo, 0, sizeof(sinfo));
1071 get_slabinfo(s, &sinfo);
1072
1073 seq_printf(m, "%-17s %6lu %6lu %6u %4u %4d",
1074 s->name, sinfo.active_objs, sinfo.num_objs, s->size,
1075 sinfo.objects_per_slab, (1 << sinfo.cache_order));
1076
1077 seq_printf(m, " : tunables %4u %4u %4u",
1078 sinfo.limit, sinfo.batchcount, sinfo.shared);
1079 seq_printf(m, " : slabdata %6lu %6lu %6lu",
1080 sinfo.active_slabs, sinfo.num_slabs, sinfo.shared_avail);
1081 slabinfo_show_stats(m, s);
1082 seq_putc(m, '\n');
1083}
1084
1085static int slab_show(struct seq_file *m, void *p)
1086{
1087 struct kmem_cache *s = list_entry(p, struct kmem_cache, list);
1088
1089 if (p == slab_caches.next)
1090 print_slabinfo_header(m);
1091 cache_show(s, m);
1092 return 0;
1093}
1094
1095void dump_unreclaimable_slab(void)
1096{
1097 struct kmem_cache *s;
1098 struct slabinfo sinfo;
1099
1100 /*
1101 * Here acquiring slab_mutex is risky since we don't prefer to get
1102 * sleep in oom path. But, without mutex hold, it may introduce a
1103 * risk of crash.
1104 * Use mutex_trylock to protect the list traverse, dump nothing
1105 * without acquiring the mutex.
1106 */
1107 if (!mutex_trylock(&slab_mutex)) {
1108 pr_warn("excessive unreclaimable slab but cannot dump stats\n");
1109 return;
1110 }
1111
1112 pr_info("Unreclaimable slab info:\n");
1113 pr_info("Name Used Total\n");
1114
1115 list_for_each_entry(s, &slab_caches, list) {
1116 if (s->flags & SLAB_RECLAIM_ACCOUNT)
1117 continue;
1118
1119 get_slabinfo(s, &sinfo);
1120
1121 if (sinfo.num_objs > 0)
1122 pr_info("%-17s %10luKB %10luKB\n", s->name,
1123 (sinfo.active_objs * s->size) / 1024,
1124 (sinfo.num_objs * s->size) / 1024);
1125 }
1126 mutex_unlock(&slab_mutex);
1127}
1128
1129/*
1130 * slabinfo_op - iterator that generates /proc/slabinfo
1131 *
1132 * Output layout:
1133 * cache-name
1134 * num-active-objs
1135 * total-objs
1136 * object size
1137 * num-active-slabs
1138 * total-slabs
1139 * num-pages-per-slab
1140 * + further values on SMP and with statistics enabled
1141 */
1142static const struct seq_operations slabinfo_op = {
1143 .start = slab_start,
1144 .next = slab_next,
1145 .stop = slab_stop,
1146 .show = slab_show,
1147};
1148
1149static int slabinfo_open(struct inode *inode, struct file *file)
1150{
1151 return seq_open(file, &slabinfo_op);
1152}
1153
1154static const struct proc_ops slabinfo_proc_ops = {
1155 .proc_flags = PROC_ENTRY_PERMANENT,
1156 .proc_open = slabinfo_open,
1157 .proc_read = seq_read,
1158 .proc_write = slabinfo_write,
1159 .proc_lseek = seq_lseek,
1160 .proc_release = seq_release,
1161};
1162
1163static int __init slab_proc_init(void)
1164{
1165 proc_create("slabinfo", SLABINFO_RIGHTS, NULL, &slabinfo_proc_ops);
1166 return 0;
1167}
1168module_init(slab_proc_init);
1169
1170#endif /* CONFIG_SLUB_DEBUG */
1171
1172static __always_inline __realloc_size(2) void *
1173__do_krealloc(const void *p, size_t new_size, gfp_t flags)
1174{
1175 void *ret;
1176 size_t ks;
1177
1178 /* Check for double-free before calling ksize. */
1179 if (likely(!ZERO_OR_NULL_PTR(p))) {
1180 if (!kasan_check_byte(p))
1181 return NULL;
1182 ks = ksize(p);
1183 } else
1184 ks = 0;
1185
1186 /* If the object still fits, repoison it precisely. */
1187 if (ks >= new_size) {
1188 p = kasan_krealloc((void *)p, new_size, flags);
1189 return (void *)p;
1190 }
1191
1192 ret = kmalloc_track_caller(new_size, flags);
1193 if (ret && p) {
1194 /* Disable KASAN checks as the object's redzone is accessed. */
1195 kasan_disable_current();
1196 memcpy(ret, kasan_reset_tag(p), ks);
1197 kasan_enable_current();
1198 }
1199
1200 return ret;
1201}
1202
1203/**
1204 * krealloc - reallocate memory. The contents will remain unchanged.
1205 * @p: object to reallocate memory for.
1206 * @new_size: how many bytes of memory are required.
1207 * @flags: the type of memory to allocate.
1208 *
1209 * The contents of the object pointed to are preserved up to the
1210 * lesser of the new and old sizes (__GFP_ZERO flag is effectively ignored).
1211 * If @p is %NULL, krealloc() behaves exactly like kmalloc(). If @new_size
1212 * is 0 and @p is not a %NULL pointer, the object pointed to is freed.
1213 *
1214 * Return: pointer to the allocated memory or %NULL in case of error
1215 */
1216void *krealloc(const void *p, size_t new_size, gfp_t flags)
1217{
1218 void *ret;
1219
1220 if (unlikely(!new_size)) {
1221 kfree(p);
1222 return ZERO_SIZE_PTR;
1223 }
1224
1225 ret = __do_krealloc(p, new_size, flags);
1226 if (ret && kasan_reset_tag(p) != kasan_reset_tag(ret))
1227 kfree(p);
1228
1229 return ret;
1230}
1231EXPORT_SYMBOL(krealloc);
1232
1233/**
1234 * kfree_sensitive - Clear sensitive information in memory before freeing
1235 * @p: object to free memory of
1236 *
1237 * The memory of the object @p points to is zeroed before freed.
1238 * If @p is %NULL, kfree_sensitive() does nothing.
1239 *
1240 * Note: this function zeroes the whole allocated buffer which can be a good
1241 * deal bigger than the requested buffer size passed to kmalloc(). So be
1242 * careful when using this function in performance sensitive code.
1243 */
1244void kfree_sensitive(const void *p)
1245{
1246 size_t ks;
1247 void *mem = (void *)p;
1248
1249 ks = ksize(mem);
1250 if (ks) {
1251 kasan_unpoison_range(mem, ks);
1252 memzero_explicit(mem, ks);
1253 }
1254 kfree(mem);
1255}
1256EXPORT_SYMBOL(kfree_sensitive);
1257
1258size_t ksize(const void *objp)
1259{
1260 /*
1261 * We need to first check that the pointer to the object is valid.
1262 * The KASAN report printed from ksize() is more useful, then when
1263 * it's printed later when the behaviour could be undefined due to
1264 * a potential use-after-free or double-free.
1265 *
1266 * We use kasan_check_byte(), which is supported for the hardware
1267 * tag-based KASAN mode, unlike kasan_check_read/write().
1268 *
1269 * If the pointed to memory is invalid, we return 0 to avoid users of
1270 * ksize() writing to and potentially corrupting the memory region.
1271 *
1272 * We want to perform the check before __ksize(), to avoid potentially
1273 * crashing in __ksize() due to accessing invalid metadata.
1274 */
1275 if (unlikely(ZERO_OR_NULL_PTR(objp)) || !kasan_check_byte(objp))
1276 return 0;
1277
1278 return kfence_ksize(objp) ?: __ksize(objp);
1279}
1280EXPORT_SYMBOL(ksize);
1281
1282/* Tracepoints definitions. */
1283EXPORT_TRACEPOINT_SYMBOL(kmalloc);
1284EXPORT_TRACEPOINT_SYMBOL(kmem_cache_alloc);
1285EXPORT_TRACEPOINT_SYMBOL(kfree);
1286EXPORT_TRACEPOINT_SYMBOL(kmem_cache_free);
1287