[mirror_ubuntu-jammy-kernel.git] / lib / test_meminit.c

// SPDX-License-Identifier: GPL-2.0
/*
 * Test cases for SL[AOU]B/page initialization at alloc/free time.
 */
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt

#include <linux/init.h>
#include <linux/kernel.h>
#include <linux/mm.h>
#include <linux/module.h>
#include <linux/slab.h>
#include <linux/string.h>
#include <linux/vmalloc.h>

#define GARBAGE_INT (0x09A7BA9E)
#define GARBAGE_BYTE (0x9E)

#define REPORT_FAILURES_IN_FN() \
	do {	\
		if (failures)	\
			pr_info("%s failed %d out of %d times\n",	\
				__func__, failures, num_tests);		\
		else		\
			pr_info("all %d tests in %s passed\n",		\
				num_tests, __func__);			\
	} while (0)

/* Calculate the number of uninitialized bytes in the buffer. */
static int __init count_nonzero_bytes(void *ptr, size_t size)
{
	int i, ret = 0;
	unsigned char *p = (unsigned char *)ptr;

	for (i = 0; i < size; i++)
		if (p[i])
			ret++;
	return ret;
}

/* Fill a buffer with garbage, skipping |skip| first bytes. */
static void __init fill_with_garbage_skip(void *ptr, int size, size_t skip)
{
	unsigned int *p = (unsigned int *)((char *)ptr + skip);
	int i = 0;

	WARN_ON(skip > size);
	size -= skip;

	while (size >= sizeof(*p)) {
		p[i] = GARBAGE_INT;
		i++;
		size -= sizeof(*p);
	}
	if (size)
		memset(&p[i], GARBAGE_BYTE, size);
}

static void __init fill_with_garbage(void *ptr, size_t size)
{
	fill_with_garbage_skip(ptr, size, 0);
}

static int __init do_alloc_pages_order(int order, int *total_failures)
{
	struct page *page;
	void *buf;
	size_t size = PAGE_SIZE << order;

	page = alloc_pages(GFP_KERNEL, order);
	buf = page_address(page);
	fill_with_garbage(buf, size);
	__free_pages(page, order);

	page = alloc_pages(GFP_KERNEL, order);
	buf = page_address(page);
	if (count_nonzero_bytes(buf, size))
		(*total_failures)++;
	fill_with_garbage(buf, size);
	__free_pages(page, order);
	return 1;
}

/* Test the page allocator by calling alloc_pages with different orders. */
static int __init test_pages(int *total_failures)
{
	int failures = 0, num_tests = 0;
	int i;

	for (i = 0; i < 10; i++)
		num_tests += do_alloc_pages_order(i, &failures);

	REPORT_FAILURES_IN_FN();
	*total_failures += failures;
	return num_tests;
}

/* Test kmalloc() with given parameters. */
static int __init do_kmalloc_size(size_t size, int *total_failures)
{
	void *buf;

	buf = kmalloc(size, GFP_KERNEL);
	fill_with_garbage(buf, size);
	kfree(buf);

	buf = kmalloc(size, GFP_KERNEL);
	if (count_nonzero_bytes(buf, size))
		(*total_failures)++;
	fill_with_garbage(buf, size);
	kfree(buf);
	return 1;
}

/* Test vmalloc() with given parameters. */
static int __init do_vmalloc_size(size_t size, int *total_failures)
{
	void *buf;

	buf = vmalloc(size);
	fill_with_garbage(buf, size);
	vfree(buf);

	buf = vmalloc(size);
	if (count_nonzero_bytes(buf, size))
		(*total_failures)++;
	fill_with_garbage(buf, size);
	vfree(buf);
	return 1;
}

/* Test kmalloc()/vmalloc() by allocating objects of different sizes. */
static int __init test_kvmalloc(int *total_failures)
{
	int failures = 0, num_tests = 0;
	int i, size;

	for (i = 0; i < 20; i++) {
		size = 1 << i;
		num_tests += do_kmalloc_size(size, &failures);
		num_tests += do_vmalloc_size(size, &failures);
	}

	REPORT_FAILURES_IN_FN();
	*total_failures += failures;
	return num_tests;
}

#define CTOR_BYTES (sizeof(unsigned int))
#define CTOR_PATTERN (0x41414141)
/* Initialize the first 4 bytes of the object. */
static void test_ctor(void *obj)
{
	*(unsigned int *)obj = CTOR_PATTERN;
}

/*
 * Check the invariants for the buffer allocated from a slab cache.
 * If the cache has a test constructor, the first 4 bytes of the object must
 * always remain equal to CTOR_PATTERN.
 * If the cache isn't an RCU-typesafe one, or if the allocation is done with
 * __GFP_ZERO, then the object contents must be zeroed after allocation.
 * If the cache is an RCU-typesafe one, the object contents must never be
 * zeroed after the first use. This is checked by memcmp() in
 * do_kmem_cache_size().
 */
static bool __init check_buf(void *buf, int size, bool want_ctor,
			     bool want_rcu, bool want_zero)
{
	int bytes;
	bool fail = false;

	bytes = count_nonzero_bytes(buf, size);
	WARN_ON(want_ctor && want_zero);
	if (want_zero)
		return bytes;
	if (want_ctor) {
		if (*(unsigned int *)buf != CTOR_PATTERN)
			fail = 1;
	} else {
		if (bytes)
			fail = !want_rcu;
	}
	return fail;
}

#define BULK_SIZE 100
static void *bulk_array[BULK_SIZE];

/*
 * Test kmem_cache with given parameters:
 *  want_ctor - use a constructor;
 *  want_rcu - use SLAB_TYPESAFE_BY_RCU;
 *  want_zero - use __GFP_ZERO.
 */
static int __init do_kmem_cache_size(size_t size, bool want_ctor,
				     bool want_rcu, bool want_zero,
				     int *total_failures)
{
	struct kmem_cache *c;
	int iter;
	bool fail = false;
	gfp_t alloc_mask = GFP_KERNEL | (want_zero ? __GFP_ZERO : 0);
	void *buf, *buf_copy;

	c = kmem_cache_create("test_cache", size, 1,
			      want_rcu ? SLAB_TYPESAFE_BY_RCU : 0,
			      want_ctor ? test_ctor : NULL);
	for (iter = 0; iter < 10; iter++) {
		/* Do a test of bulk allocations */
		if (!want_rcu && !want_ctor) {
			int ret;

			ret = kmem_cache_alloc_bulk(c, alloc_mask, BULK_SIZE, bulk_array);
			if (!ret) {
				fail = true;
			} else {
				int i;
				for (i = 0; i < ret; i++)
					fail |= check_buf(bulk_array[i], size, want_ctor, want_rcu, want_zero);
				kmem_cache_free_bulk(c, ret, bulk_array);
			}
		}

		buf = kmem_cache_alloc(c, alloc_mask);
		/* Check that buf is zeroed, if it must be. */
		fail |= check_buf(buf, size, want_ctor, want_rcu, want_zero);
		fill_with_garbage_skip(buf, size, want_ctor ? CTOR_BYTES : 0);

		if (!want_rcu) {
			kmem_cache_free(c, buf);
			continue;
		}

		/*
		 * If this is an RCU cache, use a critical section to ensure we
		 * can touch objects after they're freed.
		 */
		rcu_read_lock();
		/*
		 * Copy the buffer to check that it's not wiped on
		 * free().
		 */
		buf_copy = kmalloc(size, GFP_ATOMIC);
		if (buf_copy)
			memcpy(buf_copy, buf, size);

		kmem_cache_free(c, buf);
		/*
		 * Check that |buf| is intact after kmem_cache_free().
		 * |want_zero| is false, because we wrote garbage to
		 * the buffer already.
		 */
		fail |= check_buf(buf, size, want_ctor, want_rcu,
				  false);
		if (buf_copy) {
			fail |= (bool)memcmp(buf, buf_copy, size);
			kfree(buf_copy);
		}
		rcu_read_unlock();
	}
	kmem_cache_destroy(c);

	*total_failures += fail;
	return 1;
}

/*
 * Check that the data written to an RCU-allocated object survives
 * reallocation.
 */
static int __init do_kmem_cache_rcu_persistent(int size, int *total_failures)
{
	struct kmem_cache *c;
	void *buf, *buf_contents, *saved_ptr;
	void **used_objects;
	int i, iter, maxiter = 1024;
	bool fail = false;

	c = kmem_cache_create("test_cache", size, size, SLAB_TYPESAFE_BY_RCU,
			      NULL);
	buf = kmem_cache_alloc(c, GFP_KERNEL);
	saved_ptr = buf;
	fill_with_garbage(buf, size);
	buf_contents = kmalloc(size, GFP_KERNEL);
	if (!buf_contents)
		goto out;
	used_objects = kmalloc_array(maxiter, sizeof(void *), GFP_KERNEL);
	if (!used_objects) {
		kfree(buf_contents);
		goto out;
	}
	memcpy(buf_contents, buf, size);
	kmem_cache_free(c, buf);
	/*
	 * Run for a fixed number of iterations. If we never hit saved_ptr,
	 * assume the test passes.
	 */
	for (iter = 0; iter < maxiter; iter++) {
		buf = kmem_cache_alloc(c, GFP_KERNEL);
		used_objects[iter] = buf;
		if (buf == saved_ptr) {
			fail = memcmp(buf_contents, buf, size);
			for (i = 0; i <= iter; i++)
				kmem_cache_free(c, used_objects[i]);
			goto free_out;
		}
	}

free_out:
	kmem_cache_destroy(c);
	kfree(buf_contents);
	kfree(used_objects);
out:
	*total_failures += fail;
	return 1;
}

static int __init do_kmem_cache_size_bulk(int size, int *total_failures)
{
	struct kmem_cache *c;
	int i, iter, maxiter = 1024;
	int num, bytes;
	bool fail = false;
	void *objects[10];

	c = kmem_cache_create("test_cache", size, size, 0, NULL);
	for (iter = 0; (iter < maxiter) && !fail; iter++) {
		num = kmem_cache_alloc_bulk(c, GFP_KERNEL, ARRAY_SIZE(objects),
					    objects);
		for (i = 0; i < num; i++) {
			bytes = count_nonzero_bytes(objects[i], size);
			if (bytes)
				fail = true;
			fill_with_garbage(objects[i], size);
		}

		if (num)
			kmem_cache_free_bulk(c, num, objects);
	}
	kmem_cache_destroy(c);
	*total_failures += fail;
	return 1;
}

/*
 * Test kmem_cache allocation by creating caches of different sizes, with and
 * without constructors, with and without SLAB_TYPESAFE_BY_RCU.
 */
static int __init test_kmemcache(int *total_failures)
{
	int failures = 0, num_tests = 0;
	int i, flags, size;
	bool ctor, rcu, zero;

	for (i = 0; i < 10; i++) {
		size = 8 << i;
		for (flags = 0; flags < 8; flags++) {
			ctor = flags & 1;
			rcu = flags & 2;
			zero = flags & 4;
			if (ctor & zero)
				continue;
			num_tests += do_kmem_cache_size(size, ctor, rcu, zero,
							&failures);
		}
		num_tests += do_kmem_cache_size_bulk(size, &failures);
	}
	REPORT_FAILURES_IN_FN();
	*total_failures += failures;
	return num_tests;
}

/* Test the behavior of SLAB_TYPESAFE_BY_RCU caches of different sizes. */
static int __init test_rcu_persistent(int *total_failures)
{
	int failures = 0, num_tests = 0;
	int i, size;

	for (i = 0; i < 10; i++) {
		size = 8 << i;
		num_tests += do_kmem_cache_rcu_persistent(size, &failures);
	}
	REPORT_FAILURES_IN_FN();
	*total_failures += failures;
	return num_tests;
}

/*
 * Run the tests. Each test function returns the number of executed tests and
 * updates |failures| with the number of failed tests.
 */
static int __init test_meminit_init(void)
{
	int failures = 0, num_tests = 0;

	num_tests += test_pages(&failures);
	num_tests += test_kvmalloc(&failures);
	num_tests += test_kmemcache(&failures);
	num_tests += test_rcu_persistent(&failures);

	if (failures == 0)
		pr_info("all %d tests passed!\n", num_tests);
	else
		pr_info("failures: %d out of %d\n", failures, num_tests);

	return failures ? -EINVAL : 0;
}
module_init(test_meminit_init);

MODULE_LICENSE("GPL");
Commit	Line	Data
5015a300 AP	1	// SPDX-License-Identifier: GPL-2.0
	2	/*
	3	* Test cases for SL[AOU]B/page initialization at alloc/free time.
	4	*/
	5	#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
	6
	7	#include <linux/init.h>
	8	#include <linux/kernel.h>
	9	#include <linux/mm.h>
	10	#include <linux/module.h>
	11	#include <linux/slab.h>
	12	#include <linux/string.h>
	13	#include <linux/vmalloc.h>
	14
	15	#define GARBAGE_INT (0x09A7BA9E)
	16	#define GARBAGE_BYTE (0x9E)
	17
	18	#define REPORT_FAILURES_IN_FN() \
	19	do { \
	20	if (failures) \
	21	pr_info("%s failed %d out of %d times\n", \
	22	__func__, failures, num_tests); \
	23	else \
	24	pr_info("all %d tests in %s passed\n", \
	25	num_tests, __func__); \
	26	} while (0)
	27
	28	/* Calculate the number of uninitialized bytes in the buffer. */
	29	static int __init count_nonzero_bytes(void *ptr, size_t size)
	30	{
	31	int i, ret = 0;
	32	unsigned char p = (unsigned char )ptr;
	33
	34	for (i = 0; i < size; i++)
	35	if (p[i])
	36	ret++;
	37	return ret;
	38	}
	39
	40	/* Fill a buffer with garbage, skipping \|skip\| first bytes. */
4ab7ace4	41	static void __init fill_with_garbage_skip(void *ptr, int size, size_t skip)
5015a300	42	{
4ab7ace4	43	unsigned int p = (unsigned int )((char *)ptr + skip);
5015a300 AP	44	int i = 0;
5015a300 AP	45
4ab7ace4 AP	46	WARN_ON(skip > size);
	47	size -= skip;
	48
5015a300 AP	49	while (size >= sizeof(*p)) {
	50	p[i] = GARBAGE_INT;
	51	i++;
	52	size -= sizeof(*p);
	53	}
	54	if (size)
	55	memset(&p[i], GARBAGE_BYTE, size);
	56	}
	57
	58	static void __init fill_with_garbage(void *ptr, size_t size)
	59	{
	60	fill_with_garbage_skip(ptr, size, 0);
	61	}
	62
	63	static int __init do_alloc_pages_order(int order, int *total_failures)
	64	{
	65	struct page *page;
	66	void *buf;
	67	size_t size = PAGE_SIZE << order;
	68
	69	page = alloc_pages(GFP_KERNEL, order);
	70	buf = page_address(page);
	71	fill_with_garbage(buf, size);
	72	__free_pages(page, order);
	73
	74	page = alloc_pages(GFP_KERNEL, order);
	75	buf = page_address(page);
	76	if (count_nonzero_bytes(buf, size))
	77	(*total_failures)++;
	78	fill_with_garbage(buf, size);
	79	__free_pages(page, order);
	80	return 1;
	81	}
	82
	83	/* Test the page allocator by calling alloc_pages with different orders. */
	84	static int __init test_pages(int *total_failures)
	85	{
	86	int failures = 0, num_tests = 0;
	87	int i;
	88
	89	for (i = 0; i < 10; i++)
	90	num_tests += do_alloc_pages_order(i, &failures);
	91
	92	REPORT_FAILURES_IN_FN();
	93	*total_failures += failures;
	94	return num_tests;
	95	}
	96
	97	/* Test kmalloc() with given parameters. */
	98	static int __init do_kmalloc_size(size_t size, int *total_failures)
	99	{
	100	void *buf;
	101
	102	buf = kmalloc(size, GFP_KERNEL);
	103	fill_with_garbage(buf, size);
	104	kfree(buf);
	105
	106	buf = kmalloc(size, GFP_KERNEL);
	107	if (count_nonzero_bytes(buf, size))
	108	(*total_failures)++;
	109	fill_with_garbage(buf, size);
	110	kfree(buf);
	111	return 1;
	112	}
113
114	/* Test vmalloc() with given parameters. */
115	static int __init do_vmalloc_size(size_t size, int *total_failures)
116	{
117	void *buf;
118
119	buf = vmalloc(size);
120	fill_with_garbage(buf, size);
121	vfree(buf);
122
123	buf = vmalloc(size);
124	if (count_nonzero_bytes(buf, size))
125	(*total_failures)++;
126	fill_with_garbage(buf, size);
127	vfree(buf);
128	return 1;
129	}
130
131	/* Test kmalloc()/vmalloc() by allocating objects of different sizes. */
132	static int __init test_kvmalloc(int *total_failures)
133	{
134	int failures = 0, num_tests = 0;
135	int i, size;
136
137	for (i = 0; i < 20; i++) {
138	size = 1 << i;
139	num_tests += do_kmalloc_size(size, &failures);
140	num_tests += do_vmalloc_size(size, &failures);
141	}
142
143	REPORT_FAILURES_IN_FN();
144	*total_failures += failures;
145	return num_tests;
146	}
147
148	#define CTOR_BYTES (sizeof(unsigned int))
149	#define CTOR_PATTERN (0x41414141)
150	/* Initialize the first 4 bytes of the object. */
151	static void test_ctor(void *obj)
152	{
153	(unsigned int )obj = CTOR_PATTERN;
154	}
155
156	/*
157	* Check the invariants for the buffer allocated from a slab cache.
158	* If the cache has a test constructor, the first 4 bytes of the object must
159	* always remain equal to CTOR_PATTERN.
160	* If the cache isn't an RCU-typesafe one, or if the allocation is done with
161	* __GFP_ZERO, then the object contents must be zeroed after allocation.
162	* If the cache is an RCU-typesafe one, the object contents must never be
163	* zeroed after the first use. This is checked by memcmp() in
164	* do_kmem_cache_size().
165	*/
166	static bool __init check_buf(void *buf, int size, bool want_ctor,
167	bool want_rcu, bool want_zero)
168	{
169	int bytes;
170	bool fail = false;
171
172	bytes = count_nonzero_bytes(buf, size);
173	WARN_ON(want_ctor && want_zero);
174	if (want_zero)
175	return bytes;
176	if (want_ctor) {
177	if ((unsigned int )buf != CTOR_PATTERN)
178	fail = 1;
179	} else {
180	if (bytes)
181	fail = !want_rcu;
182	}
183	return fail;
184	}
185
dc5c5ad7 LA	186	#define BULK_SIZE 100
	187	static void *bulk_array[BULK_SIZE];
	188
5015a300 AP	189	/*
	190	* Test kmem_cache with given parameters:
	191	* want_ctor - use a constructor;
	192	* want_rcu - use SLAB_TYPESAFE_BY_RCU;
	193	* want_zero - use __GFP_ZERO.
	194	*/
	195	static int __init do_kmem_cache_size(size_t size, bool want_ctor,
	196	bool want_rcu, bool want_zero,
	197	int *total_failures)
	198	{
	199	struct kmem_cache *c;
	200	int iter;
	201	bool fail = false;
	202	gfp_t alloc_mask = GFP_KERNEL \| (want_zero ? __GFP_ZERO : 0);
	203	void buf, buf_copy;
	204
	205	c = kmem_cache_create("test_cache", size, 1,
	206	want_rcu ? SLAB_TYPESAFE_BY_RCU : 0,
	207	want_ctor ? test_ctor : NULL);
	208	for (iter = 0; iter < 10; iter++) {
dc5c5ad7 LA	209	/* Do a test of bulk allocations */
	210	if (!want_rcu && !want_ctor) {
	211	int ret;
	212
	213	ret = kmem_cache_alloc_bulk(c, alloc_mask, BULK_SIZE, bulk_array);
	214	if (!ret) {
	215	fail = true;
	216	} else {
	217	int i;
	218	for (i = 0; i < ret; i++)
	219	fail \|= check_buf(bulk_array[i], size, want_ctor, want_rcu, want_zero);
	220	kmem_cache_free_bulk(c, ret, bulk_array);
	221	}
	222	}
	223
5015a300 AP	224	buf = kmem_cache_alloc(c, alloc_mask);
5015a300 AP	225	/* Check that buf is zeroed, if it must be. */
dc5c5ad7	226	fail \|= check_buf(buf, size, want_ctor, want_rcu, want_zero);
5015a300	227	fill_with_garbage_skip(buf, size, want_ctor ? CTOR_BYTES : 0);
d3a81161 AB	228
	229	if (!want_rcu) {
	230	kmem_cache_free(c, buf);
	231	continue;
	232	}
	233
5015a300 AP	234	/*
	235	* If this is an RCU cache, use a critical section to ensure we
	236	* can touch objects after they're freed.
	237	*/
d3a81161 AB	238	rcu_read_lock();
	239	/*
	240	* Copy the buffer to check that it's not wiped on
	241	* free().
	242	*/
733d1d1a	243	buf_copy = kmalloc(size, GFP_ATOMIC);
d3a81161 AB	244	if (buf_copy)
	245	memcpy(buf_copy, buf, size);
	246
4ab7ace4	247	kmem_cache_free(c, buf);
d3a81161 AB	248	/*
	249	* Check that \|buf\| is intact after kmem_cache_free().
	250	* \|want_zero\| is false, because we wrote garbage to
	251	* the buffer already.
	252	*/
	253	fail \|= check_buf(buf, size, want_ctor, want_rcu,
	254	false);
	255	if (buf_copy) {
	256	fail \|= (bool)memcmp(buf, buf_copy, size);
	257	kfree(buf_copy);
5015a300	258	}
d3a81161	259	rcu_read_unlock();
5015a300 AP	260	}
	261	kmem_cache_destroy(c);
	262
	263	*total_failures += fail;
	264	return 1;
	265	}
	266
	267	/*
	268	* Check that the data written to an RCU-allocated object survives
	269	* reallocation.
	270	*/
	271	static int __init do_kmem_cache_rcu_persistent(int size, int *total_failures)
	272	{
	273	struct kmem_cache *c;
	274	void buf, buf_contents, *saved_ptr;
	275	void **used_objects;
	276	int i, iter, maxiter = 1024;
	277	bool fail = false;
	278
	279	c = kmem_cache_create("test_cache", size, size, SLAB_TYPESAFE_BY_RCU,
	280	NULL);
	281	buf = kmem_cache_alloc(c, GFP_KERNEL);
	282	saved_ptr = buf;
	283	fill_with_garbage(buf, size);
	284	buf_contents = kmalloc(size, GFP_KERNEL);
	285	if (!buf_contents)
	286	goto out;
	287	used_objects = kmalloc_array(maxiter, sizeof(void *), GFP_KERNEL);
	288	if (!used_objects) {
	289	kfree(buf_contents);
	290	goto out;
	291	}
	292	memcpy(buf_contents, buf, size);
	293	kmem_cache_free(c, buf);
	294	/*
	295	* Run for a fixed number of iterations. If we never hit saved_ptr,
	296	* assume the test passes.
	297	*/
	298	for (iter = 0; iter < maxiter; iter++) {
	299	buf = kmem_cache_alloc(c, GFP_KERNEL);
	300	used_objects[iter] = buf;
	301	if (buf == saved_ptr) {
	302	fail = memcmp(buf_contents, buf, size);
	303	for (i = 0; i <= iter; i++)
	304	kmem_cache_free(c, used_objects[i]);
	305	goto free_out;
	306	}
	307	}
	308
	309	free_out:
	310	kmem_cache_destroy(c);
	311	kfree(buf_contents);
	312	kfree(used_objects);
	313	out:
	314	*total_failures += fail;
	315	return 1;
	316	}
	317
03a9349a AP	318	static int __init do_kmem_cache_size_bulk(int size, int *total_failures)
	319	{
	320	struct kmem_cache *c;
	321	int i, iter, maxiter = 1024;
	322	int num, bytes;
	323	bool fail = false;
	324	void *objects[10];
	325
	326	c = kmem_cache_create("test_cache", size, size, 0, NULL);
	327	for (iter = 0; (iter < maxiter) && !fail; iter++) {
	328	num = kmem_cache_alloc_bulk(c, GFP_KERNEL, ARRAY_SIZE(objects),
	329	objects);
	330	for (i = 0; i < num; i++) {
	331	bytes = count_nonzero_bytes(objects[i], size);
	332	if (bytes)
	333	fail = true;
	334	fill_with_garbage(objects[i], size);
	335	}
	336
	337	if (num)
	338	kmem_cache_free_bulk(c, num, objects);
	339	}
8da4aba3	340	kmem_cache_destroy(c);
03a9349a AP	341	*total_failures += fail;
	342	return 1;
	343	}
	344
5015a300 AP	345	/*
	346	* Test kmem_cache allocation by creating caches of different sizes, with and
	347	* without constructors, with and without SLAB_TYPESAFE_BY_RCU.
	348	*/
	349	static int __init test_kmemcache(int *total_failures)
	350	{
	351	int failures = 0, num_tests = 0;
	352	int i, flags, size;
	353	bool ctor, rcu, zero;
	354
	355	for (i = 0; i < 10; i++) {
	356	size = 8 << i;
	357	for (flags = 0; flags < 8; flags++) {
	358	ctor = flags & 1;
	359	rcu = flags & 2;
	360	zero = flags & 4;
	361	if (ctor & zero)
	362	continue;
	363	num_tests += do_kmem_cache_size(size, ctor, rcu, zero,
	364	&failures);
	365	}
03a9349a	366	num_tests += do_kmem_cache_size_bulk(size, &failures);
5015a300 AP	367	}
	368	REPORT_FAILURES_IN_FN();
	369	*total_failures += failures;
	370	return num_tests;
	371	}
	372
	373	/* Test the behavior of SLAB_TYPESAFE_BY_RCU caches of different sizes. */
	374	static int __init test_rcu_persistent(int *total_failures)
	375	{
	376	int failures = 0, num_tests = 0;
	377	int i, size;
	378
	379	for (i = 0; i < 10; i++) {
	380	size = 8 << i;
	381	num_tests += do_kmem_cache_rcu_persistent(size, &failures);
	382	}
	383	REPORT_FAILURES_IN_FN();
	384	*total_failures += failures;
	385	return num_tests;
	386	}
	387
	388	/*
	389	* Run the tests. Each test function returns the number of executed tests and
	390	* updates \|failures\| with the number of failed tests.
	391	*/
	392	static int __init test_meminit_init(void)
	393	{
	394	int failures = 0, num_tests = 0;
	395
	396	num_tests += test_pages(&failures);
	397	num_tests += test_kvmalloc(&failures);
	398	num_tests += test_kmemcache(&failures);
	399	num_tests += test_rcu_persistent(&failures);
	400
	401	if (failures == 0)
	402	pr_info("all %d tests passed!\n", num_tests);
	403	else
	404	pr_info("failures: %d out of %d\n", failures, num_tests);
	405
	406	return failures ? -EINVAL : 0;
	407	}
	408	module_init(test_meminit_init);
	409
	410	MODULE_LICENSE("GPL");