Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
awilliam
GitHub Repository: awilliam/linux-vfio
 Path: blob/master/mm/kmemleak-test.c
10814 views
1
/*

2
 * mm/kmemleak-test.c

3
 *

4
 * Copyright (C) 2008 ARM Limited

5
 * Written by Catalin Marinas <[email protected]>

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


32
struct test_node {

33
	long header[25];

34
	struct list_head list;

35
	long footer[25];

36
};

37


38
static LIST_HEAD(test_list);

39
static 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
 */

45
static 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
}

94
module_init(kmemleak_test_init);

95


96
static 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
}

107
module_exit(kmemleak_test_exit);

108


109
MODULE_LICENSE("GPL");

110


111