Loading...
1// SPDX-License-Identifier: GPL-2.0-only
2/*
3 * mm/kmemleak-test.c
4 *
5 * Copyright (C) 2008 ARM Limited
6 * Written by Catalin Marinas <catalin.marinas@arm.com>
7 */
8
9#define pr_fmt(fmt) "kmemleak: " fmt
10
11#include <linux/init.h>
12#include <linux/kernel.h>
13#include <linux/module.h>
14#include <linux/slab.h>
15#include <linux/vmalloc.h>
16#include <linux/list.h>
17#include <linux/percpu.h>
18#include <linux/fdtable.h>
19
20#include <linux/kmemleak.h>
21
22struct test_node {
23 long header[25];
24 struct list_head list;
25 long footer[25];
26};
27
28static LIST_HEAD(test_list);
29static DEFINE_PER_CPU(void *, kmemleak_test_pointer);
30
31/*
32 * Some very simple testing. This function needs to be extended for
33 * proper testing.
34 */
35static int __init kmemleak_test_init(void)
36{
37 struct test_node *elem;
38 int i;
39
40 pr_info("Kmemleak testing\n");
41
42 /* make some orphan objects */
43 pr_info("kmalloc(32) = %p\n", kmalloc(32, GFP_KERNEL));
44 pr_info("kmalloc(32) = %p\n", kmalloc(32, GFP_KERNEL));
45 pr_info("kmalloc(1024) = %p\n", kmalloc(1024, GFP_KERNEL));
46 pr_info("kmalloc(1024) = %p\n", kmalloc(1024, GFP_KERNEL));
47 pr_info("kmalloc(2048) = %p\n", kmalloc(2048, GFP_KERNEL));
48 pr_info("kmalloc(2048) = %p\n", kmalloc(2048, GFP_KERNEL));
49 pr_info("kmalloc(4096) = %p\n", kmalloc(4096, GFP_KERNEL));
50 pr_info("kmalloc(4096) = %p\n", kmalloc(4096, GFP_KERNEL));
51#ifndef CONFIG_MODULES
52 pr_info("kmem_cache_alloc(files_cachep) = %p\n",
53 kmem_cache_alloc(files_cachep, GFP_KERNEL));
54 pr_info("kmem_cache_alloc(files_cachep) = %p\n",
55 kmem_cache_alloc(files_cachep, GFP_KERNEL));
56#endif
57 pr_info("vmalloc(64) = %p\n", vmalloc(64));
58 pr_info("vmalloc(64) = %p\n", vmalloc(64));
59 pr_info("vmalloc(64) = %p\n", vmalloc(64));
60 pr_info("vmalloc(64) = %p\n", vmalloc(64));
61 pr_info("vmalloc(64) = %p\n", vmalloc(64));
62
63 /*
64 * Add elements to a list. They should only appear as orphan
65 * after the module is removed.
66 */
67 for (i = 0; i < 10; i++) {
68 elem = kzalloc(sizeof(*elem), GFP_KERNEL);
69 pr_info("kzalloc(sizeof(*elem)) = %p\n", elem);
70 if (!elem)
71 return -ENOMEM;
72 INIT_LIST_HEAD(&elem->list);
73 list_add_tail(&elem->list, &test_list);
74 }
75
76 for_each_possible_cpu(i) {
77 per_cpu(kmemleak_test_pointer, i) = kmalloc(129, GFP_KERNEL);
78 pr_info("kmalloc(129) = %p\n",
79 per_cpu(kmemleak_test_pointer, i));
80 }
81
82 return 0;
83}
84module_init(kmemleak_test_init);
85
86static void __exit kmemleak_test_exit(void)
87{
88 struct test_node *elem, *tmp;
89
90 /*
91 * Remove the list elements without actually freeing the
92 * memory.
93 */
94 list_for_each_entry_safe(elem, tmp, &test_list, list)
95 list_del(&elem->list);
96}
97module_exit(kmemleak_test_exit);
98
99MODULE_LICENSE("GPL");
1/*
2 * mm/kmemleak-test.c
3 *
4 * Copyright (C) 2008 ARM Limited
5 * Written by Catalin Marinas <catalin.marinas@arm.com>
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License version 2 as
9 * published by the Free Software Foundation.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
19 */
20
21#include <linux/init.h>
22#include <linux/kernel.h>
23#include <linux/module.h>
24#include <linux/slab.h>
25#include <linux/vmalloc.h>
26#include <linux/list.h>
27#include <linux/percpu.h>
28#include <linux/fdtable.h>
29
30#include <linux/kmemleak.h>
31
32struct test_node {
33 long header[25];
34 struct list_head list;
35 long footer[25];
36};
37
38static LIST_HEAD(test_list);
39static DEFINE_PER_CPU(void *, kmemleak_test_pointer);
40
41/*
42 * Some very simple testing. This function needs to be extended for
43 * proper testing.
44 */
45static int __init kmemleak_test_init(void)
46{
47 struct test_node *elem;
48 int i;
49
50 printk(KERN_INFO "Kmemleak testing\n");
51
52 /* make some orphan objects */
53 pr_info("kmemleak: kmalloc(32) = %p\n", kmalloc(32, GFP_KERNEL));
54 pr_info("kmemleak: kmalloc(32) = %p\n", kmalloc(32, GFP_KERNEL));
55 pr_info("kmemleak: kmalloc(1024) = %p\n", kmalloc(1024, GFP_KERNEL));
56 pr_info("kmemleak: kmalloc(1024) = %p\n", kmalloc(1024, GFP_KERNEL));
57 pr_info("kmemleak: kmalloc(2048) = %p\n", kmalloc(2048, GFP_KERNEL));
58 pr_info("kmemleak: kmalloc(2048) = %p\n", kmalloc(2048, GFP_KERNEL));
59 pr_info("kmemleak: kmalloc(4096) = %p\n", kmalloc(4096, GFP_KERNEL));
60 pr_info("kmemleak: kmalloc(4096) = %p\n", kmalloc(4096, GFP_KERNEL));
61#ifndef CONFIG_MODULES
62 pr_info("kmemleak: kmem_cache_alloc(files_cachep) = %p\n",
63 kmem_cache_alloc(files_cachep, GFP_KERNEL));
64 pr_info("kmemleak: kmem_cache_alloc(files_cachep) = %p\n",
65 kmem_cache_alloc(files_cachep, GFP_KERNEL));
66#endif
67 pr_info("kmemleak: vmalloc(64) = %p\n", vmalloc(64));
68 pr_info("kmemleak: vmalloc(64) = %p\n", vmalloc(64));
69 pr_info("kmemleak: vmalloc(64) = %p\n", vmalloc(64));
70 pr_info("kmemleak: vmalloc(64) = %p\n", vmalloc(64));
71 pr_info("kmemleak: vmalloc(64) = %p\n", vmalloc(64));
72
73 /*
74 * Add elements to a list. They should only appear as orphan
75 * after the module is removed.
76 */
77 for (i = 0; i < 10; i++) {
78 elem = kzalloc(sizeof(*elem), GFP_KERNEL);
79 pr_info("kmemleak: kzalloc(sizeof(*elem)) = %p\n", elem);
80 if (!elem)
81 return -ENOMEM;
82 INIT_LIST_HEAD(&elem->list);
83 list_add_tail(&elem->list, &test_list);
84 }
85
86 for_each_possible_cpu(i) {
87 per_cpu(kmemleak_test_pointer, i) = kmalloc(129, GFP_KERNEL);
88 pr_info("kmemleak: kmalloc(129) = %p\n",
89 per_cpu(kmemleak_test_pointer, i));
90 }
91
92 return 0;
93}
94module_init(kmemleak_test_init);
95
96static void __exit kmemleak_test_exit(void)
97{
98 struct test_node *elem, *tmp;
99
100 /*
101 * Remove the list elements without actually freeing the
102 * memory.
103 */
104 list_for_each_entry_safe(elem, tmp, &test_list, list)
105 list_del(&elem->list);
106}
107module_exit(kmemleak_test_exit);
108
109MODULE_LICENSE("GPL");