[mirror_ubuntu-hirsute-kernel.git] / lib / test_bitmap.c

/*
 * Test cases for printf facility.
 */

#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt

#include <linux/bitmap.h>
#include <linux/init.h>
#include <linux/kernel.h>
#include <linux/module.h>
#include <linux/printk.h>
#include <linux/slab.h>
#include <linux/string.h>

static unsigned total_tests __initdata;
static unsigned failed_tests __initdata;

static char pbl_buffer[PAGE_SIZE] __initdata;


static bool __init
__check_eq_uint(const char *srcfile, unsigned int line,
		const unsigned int exp_uint, unsigned int x)
{
	if (exp_uint != x) {
		pr_err("[%s:%u] expected %u, got %u\n",
			srcfile, line, exp_uint, x);
		return false;
	}
	return true;
}


static bool __init
__check_eq_bitmap(const char *srcfile, unsigned int line,
		  const unsigned long *exp_bmap, const unsigned long *bmap,
		  unsigned int nbits)
{
	if (!bitmap_equal(exp_bmap, bmap, nbits)) {
		pr_warn("[%s:%u] bitmaps contents differ: expected \"%*pbl\", got \"%*pbl\"\n",
			srcfile, line,
			nbits, exp_bmap, nbits, bmap);
		return false;
	}
	return true;
}

static bool __init
__check_eq_pbl(const char *srcfile, unsigned int line,
	       const char *expected_pbl,
	       const unsigned long *bitmap, unsigned int nbits)
{
	snprintf(pbl_buffer, sizeof(pbl_buffer), "%*pbl", nbits, bitmap);
	if (strcmp(expected_pbl, pbl_buffer)) {
		pr_warn("[%s:%u] expected \"%s\", got \"%s\"\n",
			srcfile, line,
			expected_pbl, pbl_buffer);
		return false;
	}
	return true;
}

static bool __init
__check_eq_u32_array(const char *srcfile, unsigned int line,
		     const u32 *exp_arr, unsigned int exp_len,
		     const u32 *arr, unsigned int len) __used;
static bool __init
__check_eq_u32_array(const char *srcfile, unsigned int line,
		     const u32 *exp_arr, unsigned int exp_len,
		     const u32 *arr, unsigned int len)
{
	if (exp_len != len) {
		pr_warn("[%s:%u] array length differ: expected %u, got %u\n",
			srcfile, line,
			exp_len, len);
		return false;
	}

	if (memcmp(exp_arr, arr, len*sizeof(*arr))) {
		pr_warn("[%s:%u] array contents differ\n", srcfile, line);
		print_hex_dump(KERN_WARNING, "  exp:  ", DUMP_PREFIX_OFFSET,
			       32, 4, exp_arr, exp_len*sizeof(*exp_arr), false);
		print_hex_dump(KERN_WARNING, "  got:  ", DUMP_PREFIX_OFFSET,
			       32, 4, arr, len*sizeof(*arr), false);
		return false;
	}

	return true;
}

#define __expect_eq(suffix, ...)					\
	({								\
		int result = 0;						\
		total_tests++;						\
		if (!__check_eq_ ## suffix(__FILE__, __LINE__,		\
					   ##__VA_ARGS__)) {		\
			failed_tests++;					\
			result = 1;					\
		}							\
		result;							\
	})

#define expect_eq_uint(...)		__expect_eq(uint, ##__VA_ARGS__)
#define expect_eq_bitmap(...)		__expect_eq(bitmap, ##__VA_ARGS__)
#define expect_eq_pbl(...)		__expect_eq(pbl, ##__VA_ARGS__)
#define expect_eq_u32_array(...)	__expect_eq(u32_array, ##__VA_ARGS__)

static void __init test_zero_clear(void)
{
	DECLARE_BITMAP(bmap, 1024);

	/* Known way to set all bits */
	memset(bmap, 0xff, 128);

	expect_eq_pbl("0-22", bmap, 23);
	expect_eq_pbl("0-1023", bmap, 1024);

	/* single-word bitmaps */
	bitmap_clear(bmap, 0, 9);
	expect_eq_pbl("9-1023", bmap, 1024);

	bitmap_zero(bmap, 35);
	expect_eq_pbl("64-1023", bmap, 1024);

	/* cross boundaries operations */
	bitmap_clear(bmap, 79, 19);
	expect_eq_pbl("64-78,98-1023", bmap, 1024);

	bitmap_zero(bmap, 115);
	expect_eq_pbl("128-1023", bmap, 1024);

	/* Zeroing entire area */
	bitmap_zero(bmap, 1024);
	expect_eq_pbl("", bmap, 1024);
}

static void __init test_fill_set(void)
{
	DECLARE_BITMAP(bmap, 1024);

	/* Known way to clear all bits */
	memset(bmap, 0x00, 128);

	expect_eq_pbl("", bmap, 23);
	expect_eq_pbl("", bmap, 1024);

	/* single-word bitmaps */
	bitmap_set(bmap, 0, 9);
	expect_eq_pbl("0-8", bmap, 1024);

	bitmap_fill(bmap, 35);
	expect_eq_pbl("0-63", bmap, 1024);

	/* cross boundaries operations */
	bitmap_set(bmap, 79, 19);
	expect_eq_pbl("0-63,79-97", bmap, 1024);

	bitmap_fill(bmap, 115);
	expect_eq_pbl("0-127", bmap, 1024);

	/* Zeroing entire area */
	bitmap_fill(bmap, 1024);
	expect_eq_pbl("0-1023", bmap, 1024);
}

static void __init test_zero_fill_copy(void)
{
	DECLARE_BITMAP(bmap1, 1024);
	DECLARE_BITMAP(bmap2, 1024);

	bitmap_zero(bmap1, 1024);
	bitmap_zero(bmap2, 1024);

	/* single-word bitmaps */
	expect_eq_pbl("", bmap1, 23);

	bitmap_fill(bmap1, 19);
	expect_eq_pbl("0-18", bmap1, 1024);

	bitmap_copy(bmap2, bmap1, 23);
	expect_eq_pbl("0-18", bmap2, 1024);

	bitmap_fill(bmap2, 23);
	expect_eq_pbl("0-22", bmap2, 1024);

	bitmap_copy(bmap2, bmap1, 23);
	expect_eq_pbl("0-18", bmap2, 1024);

	bitmap_zero(bmap1, 23);
	expect_eq_pbl("", bmap1, 1024);

	/* multi-word bitmaps */
	bitmap_zero(bmap1, 1024);
	expect_eq_pbl("", bmap1, 1024);

	bitmap_fill(bmap1, 109);
	expect_eq_pbl("0-108", bmap1, 1024);

	bitmap_copy(bmap2, bmap1, 1024);
	expect_eq_pbl("0-108", bmap2, 1024);

	bitmap_fill(bmap2, 1024);
	expect_eq_pbl("0-1023", bmap2, 1024);

	bitmap_copy(bmap2, bmap1, 1024);
	expect_eq_pbl("0-108", bmap2, 1024);

	/* the following tests assume a 32- or 64-bit arch (even 128b
	 * if we care)
	 */

	bitmap_fill(bmap2, 1024);
	bitmap_copy(bmap2, bmap1, 109);  /* ... but 0-padded til word length */
	expect_eq_pbl("0-108,128-1023", bmap2, 1024);

	bitmap_fill(bmap2, 1024);
	bitmap_copy(bmap2, bmap1, 97);  /* ... but aligned on word length */
	expect_eq_pbl("0-108,128-1023", bmap2, 1024);

	bitmap_zero(bmap2, 97);  /* ... but 0-padded til word length */
	expect_eq_pbl("128-1023", bmap2, 1024);
}

#define PARSE_TIME 0x1

struct test_bitmap_parselist{
	const int errno;
	const char *in;
	const unsigned long *expected;
	const int nbits;
	const int flags;
};

static const unsigned long exp[] __initconst = {
	BITMAP_FROM_U64(1),
	BITMAP_FROM_U64(2),
	BITMAP_FROM_U64(0x0000ffff),
	BITMAP_FROM_U64(0xffff0000),
	BITMAP_FROM_U64(0x55555555),
	BITMAP_FROM_U64(0xaaaaaaaa),
	BITMAP_FROM_U64(0x11111111),
	BITMAP_FROM_U64(0x22222222),
	BITMAP_FROM_U64(0xffffffff),
	BITMAP_FROM_U64(0xfffffffe),
	BITMAP_FROM_U64(0x3333333311111111ULL),
	BITMAP_FROM_U64(0xffffffff77777777ULL)
};

static const unsigned long exp2[] __initconst = {
	BITMAP_FROM_U64(0x3333333311111111ULL),
	BITMAP_FROM_U64(0xffffffff77777777ULL)
};

static const struct test_bitmap_parselist parselist_tests[] __initconst = {
#define step (sizeof(u64) / sizeof(unsigned long))

	{0, "0",			&exp[0], 8, 0},
	{0, "1",			&exp[1 * step], 8, 0},
	{0, "0-15",			&exp[2 * step], 32, 0},
	{0, "16-31",			&exp[3 * step], 32, 0},
	{0, "0-31:1/2",			&exp[4 * step], 32, 0},
	{0, "1-31:1/2",			&exp[5 * step], 32, 0},
	{0, "0-31:1/4",			&exp[6 * step], 32, 0},
	{0, "1-31:1/4",			&exp[7 * step], 32, 0},
	{0, "0-31:4/4",			&exp[8 * step], 32, 0},
	{0, "1-31:4/4",			&exp[9 * step], 32, 0},
	{0, "0-31:1/4,32-63:2/4",	&exp[10 * step], 64, 0},
	{0, "0-31:3/4,32-63:4/4",	&exp[11 * step], 64, 0},

	{0, "0-31:1/4,32-63:2/4,64-95:3/4,96-127:4/4",	exp2, 128, 0},

	{0, "0-2047:128/256", NULL, 2048, PARSE_TIME},

	{-EINVAL, "-1",	NULL, 8, 0},
	{-EINVAL, "-0",	NULL, 8, 0},
	{-EINVAL, "10-1", NULL, 8, 0},
	{-EINVAL, "0-31:10/1", NULL, 8, 0},
};

static void __init test_bitmap_parselist(void)
{
	int i;
	int err;
	cycles_t cycles;
	DECLARE_BITMAP(bmap, 2048);

	for (i = 0; i < ARRAY_SIZE(parselist_tests); i++) {
#define ptest parselist_tests[i]

		cycles = get_cycles();
		err = bitmap_parselist(ptest.in, bmap, ptest.nbits);
		cycles = get_cycles() - cycles;

		if (err != ptest.errno) {
			pr_err("test %d: input is %s, errno is %d, expected %d\n",
					i, ptest.in, err, ptest.errno);
			continue;
		}

		if (!err && ptest.expected
			 && !__bitmap_equal(bmap, ptest.expected, ptest.nbits)) {
			pr_err("test %d: input is %s, result is 0x%lx, expected 0x%lx\n",
					i, ptest.in, bmap[0], *ptest.expected);
			continue;
		}

		if (ptest.flags & PARSE_TIME)
			pr_err("test %d: input is '%s' OK, Time: %llu\n",
					i, ptest.in,
					(unsigned long long)cycles);
	}
}

static void __init test_bitmap_arr32(void)
{
	unsigned int nbits, next_bit, len = sizeof(exp) * 8;
	u32 arr[sizeof(exp) / 4];
	DECLARE_BITMAP(bmap2, len);

	memset(arr, 0xa5, sizeof(arr));

	for (nbits = 0; nbits < len; ++nbits) {
		bitmap_to_arr32(arr, exp, nbits);
		bitmap_from_arr32(bmap2, arr, nbits);
		expect_eq_bitmap(bmap2, exp, nbits);

		next_bit = find_next_bit(bmap2,
				round_up(nbits, BITS_PER_LONG), nbits);
		if (next_bit < round_up(nbits, BITS_PER_LONG))
			pr_err("bitmap_copy_arr32(nbits == %d:"
				" tail is not safely cleared: %d\n",
				nbits, next_bit);

		if (nbits < len - 32)
			expect_eq_uint(arr[DIV_ROUND_UP(nbits, 32)],
								0xa5a5a5a5);
	}
}

static void noinline __init test_mem_optimisations(void)
{
	DECLARE_BITMAP(bmap1, 1024);
	DECLARE_BITMAP(bmap2, 1024);
	unsigned int start, nbits;

	for (start = 0; start < 1024; start += 8) {
		memset(bmap1, 0x5a, sizeof(bmap1));
		memset(bmap2, 0x5a, sizeof(bmap2));
		for (nbits = 0; nbits < 1024 - start; nbits += 8) {
			bitmap_set(bmap1, start, nbits);
			__bitmap_set(bmap2, start, nbits);
			if (!bitmap_equal(bmap1, bmap2, 1024))
				printk("set not equal %d %d\n", start, nbits);
			if (!__bitmap_equal(bmap1, bmap2, 1024))
				printk("set not __equal %d %d\n", start, nbits);

			bitmap_clear(bmap1, start, nbits);
			__bitmap_clear(bmap2, start, nbits);
			if (!bitmap_equal(bmap1, bmap2, 1024))
				printk("clear not equal %d %d\n", start, nbits);
			if (!__bitmap_equal(bmap1, bmap2, 1024))
				printk("clear not __equal %d %d\n", start,
									nbits);
		}
	}
}

static int __init test_bitmap_init(void)
{
	test_zero_clear();
	test_fill_set();
	test_zero_fill_copy();
	test_bitmap_arr32();
	test_bitmap_parselist();
	test_mem_optimisations();

	if (failed_tests == 0)
		pr_info("all %u tests passed\n", total_tests);
	else
		pr_warn("failed %u out of %u tests\n",
			failed_tests, total_tests);

	return failed_tests ? -EINVAL : 0;
}

static void __exit test_bitmap_cleanup(void)
{
}

module_init(test_bitmap_init);
module_exit(test_bitmap_cleanup);

MODULE_AUTHOR("david decotigny <david.decotigny@googlers.com>");
MODULE_LICENSE("GPL");
Commit	Line	Data
5fd003f5 DD	1	/*
	2	* Test cases for printf facility.
	3	*/
	4
	5	#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
	6
	7	#include <linux/bitmap.h>
	8	#include <linux/init.h>
	9	#include <linux/kernel.h>
	10	#include <linux/module.h>
	11	#include <linux/printk.h>
	12	#include <linux/slab.h>
	13	#include <linux/string.h>
	14
	15	static unsigned total_tests __initdata;
	16	static unsigned failed_tests __initdata;
	17
	18	static char pbl_buffer[PAGE_SIZE] __initdata;
	19
	20
	21	static bool __init
	22	__check_eq_uint(const char *srcfile, unsigned int line,
	23	const unsigned int exp_uint, unsigned int x)
	24	{
	25	if (exp_uint != x) {
3aa56885	26	pr_err("[%s:%u] expected %u, got %u\n",
5fd003f5 DD	27	srcfile, line, exp_uint, x);
	28	return false;
	29	}
	30	return true;
	31	}
	32
	33
	34	static bool __init
	35	__check_eq_bitmap(const char *srcfile, unsigned int line,
3aa56885 YN	36	const unsigned long exp_bmap, const unsigned long bmap,
3aa56885 YN	37	unsigned int nbits)
5fd003f5	38	{
5fd003f5 DD	39	if (!bitmap_equal(exp_bmap, bmap, nbits)) {
	40	pr_warn("[%s:%u] bitmaps contents differ: expected \"%pbl\", got \"%pbl\"\n",
	41	srcfile, line,
3aa56885	42	nbits, exp_bmap, nbits, bmap);
5fd003f5 DD	43	return false;
	44	}
	45	return true;
	46	}
	47
	48	static bool __init
	49	__check_eq_pbl(const char *srcfile, unsigned int line,
	50	const char *expected_pbl,
	51	const unsigned long *bitmap, unsigned int nbits)
	52	{
	53	snprintf(pbl_buffer, sizeof(pbl_buffer), "%*pbl", nbits, bitmap);
	54	if (strcmp(expected_pbl, pbl_buffer)) {
	55	pr_warn("[%s:%u] expected \"%s\", got \"%s\"\n",
	56	srcfile, line,
	57	expected_pbl, pbl_buffer);
	58	return false;
	59	}
	60	return true;
	61	}
	62
3aa56885 YN	63	static bool __init
	64	__check_eq_u32_array(const char *srcfile, unsigned int line,
	65	const u32 *exp_arr, unsigned int exp_len,
	66	const u32 *arr, unsigned int len) __used;
5fd003f5 DD	67	static bool __init
	68	__check_eq_u32_array(const char *srcfile, unsigned int line,
	69	const u32 *exp_arr, unsigned int exp_len,
	70	const u32 *arr, unsigned int len)
	71	{
	72	if (exp_len != len) {
	73	pr_warn("[%s:%u] array length differ: expected %u, got %u\n",
	74	srcfile, line,
	75	exp_len, len);
	76	return false;
	77	}
	78
	79	if (memcmp(exp_arr, arr, lensizeof(arr))) {
	80	pr_warn("[%s:%u] array contents differ\n", srcfile, line);
	81	print_hex_dump(KERN_WARNING, " exp: ", DUMP_PREFIX_OFFSET,
	82	32, 4, exp_arr, exp_lensizeof(exp_arr), false);
	83	print_hex_dump(KERN_WARNING, " got: ", DUMP_PREFIX_OFFSET,
	84	32, 4, arr, lensizeof(arr), false);
	85	return false;
	86	}
	87
	88	return true;
	89	}
	90
	91	#define __expect_eq(suffix, ...) \
	92	({ \
	93	int result = 0; \
	94	total_tests++; \
	95	if (!__check_eq_ ## suffix(__FILE__, __LINE__, \
	96	##__VA_ARGS__)) { \
	97	failed_tests++; \
	98	result = 1; \
	99	} \
	100	result; \
	101	})
	102
	103	#define expect_eq_uint(...) __expect_eq(uint, ##__VA_ARGS__)
	104	#define expect_eq_bitmap(...) __expect_eq(bitmap, ##__VA_ARGS__)
	105	#define expect_eq_pbl(...) __expect_eq(pbl, ##__VA_ARGS__)
	106	#define expect_eq_u32_array(...) __expect_eq(u32_array, ##__VA_ARGS__)
	107
ee3527bd AS	108	static void __init test_zero_clear(void)
	109	{
	110	DECLARE_BITMAP(bmap, 1024);
	111
	112	/* Known way to set all bits */
	113	memset(bmap, 0xff, 128);
	114
	115	expect_eq_pbl("0-22", bmap, 23);
	116	expect_eq_pbl("0-1023", bmap, 1024);
	117
	118	/* single-word bitmaps */
	119	bitmap_clear(bmap, 0, 9);
	120	expect_eq_pbl("9-1023", bmap, 1024);
	121
	122	bitmap_zero(bmap, 35);
	123	expect_eq_pbl("64-1023", bmap, 1024);
	124
	125	/* cross boundaries operations */
	126	bitmap_clear(bmap, 79, 19);
	127	expect_eq_pbl("64-78,98-1023", bmap, 1024);
	128
	129	bitmap_zero(bmap, 115);
	130	expect_eq_pbl("128-1023", bmap, 1024);
	131
	132	/* Zeroing entire area */
	133	bitmap_zero(bmap, 1024);
	134	expect_eq_pbl("", bmap, 1024);
	135	}
	136
978f369c AS	137	static void __init test_fill_set(void)
	138	{
	139	DECLARE_BITMAP(bmap, 1024);
	140
	141	/* Known way to clear all bits */
	142	memset(bmap, 0x00, 128);
	143
	144	expect_eq_pbl("", bmap, 23);
	145	expect_eq_pbl("", bmap, 1024);
	146
	147	/* single-word bitmaps */
	148	bitmap_set(bmap, 0, 9);
	149	expect_eq_pbl("0-8", bmap, 1024);
	150
	151	bitmap_fill(bmap, 35);
	152	expect_eq_pbl("0-63", bmap, 1024);
	153
	154	/* cross boundaries operations */
	155	bitmap_set(bmap, 79, 19);
	156	expect_eq_pbl("0-63,79-97", bmap, 1024);
	157
	158	bitmap_fill(bmap, 115);
	159	expect_eq_pbl("0-127", bmap, 1024);
	160
	161	/* Zeroing entire area */
	162	bitmap_fill(bmap, 1024);
	163	expect_eq_pbl("0-1023", bmap, 1024);
	164	}
	165
5fd003f5 DD	166	static void __init test_zero_fill_copy(void)
	167	{
	168	DECLARE_BITMAP(bmap1, 1024);
	169	DECLARE_BITMAP(bmap2, 1024);
	170
	171	bitmap_zero(bmap1, 1024);
	172	bitmap_zero(bmap2, 1024);
	173
	174	/* single-word bitmaps */
	175	expect_eq_pbl("", bmap1, 23);
	176
	177	bitmap_fill(bmap1, 19);
	178	expect_eq_pbl("0-18", bmap1, 1024);
	179
	180	bitmap_copy(bmap2, bmap1, 23);
	181	expect_eq_pbl("0-18", bmap2, 1024);
	182
	183	bitmap_fill(bmap2, 23);
	184	expect_eq_pbl("0-22", bmap2, 1024);
	185
	186	bitmap_copy(bmap2, bmap1, 23);
	187	expect_eq_pbl("0-18", bmap2, 1024);
	188
	189	bitmap_zero(bmap1, 23);
	190	expect_eq_pbl("", bmap1, 1024);
	191
	192	/* multi-word bitmaps */
	193	bitmap_zero(bmap1, 1024);
	194	expect_eq_pbl("", bmap1, 1024);
	195
	196	bitmap_fill(bmap1, 109);
	197	expect_eq_pbl("0-108", bmap1, 1024);
	198
	199	bitmap_copy(bmap2, bmap1, 1024);
	200	expect_eq_pbl("0-108", bmap2, 1024);
	201
	202	bitmap_fill(bmap2, 1024);
	203	expect_eq_pbl("0-1023", bmap2, 1024);
	204
	205	bitmap_copy(bmap2, bmap1, 1024);
	206	expect_eq_pbl("0-108", bmap2, 1024);
	207
	208	/* the following tests assume a 32- or 64-bit arch (even 128b
	209	* if we care)
	210	*/
	211
	212	bitmap_fill(bmap2, 1024);
	213	bitmap_copy(bmap2, bmap1, 109); /* ... but 0-padded til word length */
	214	expect_eq_pbl("0-108,128-1023", bmap2, 1024);
	215
	216	bitmap_fill(bmap2, 1024);
	217	bitmap_copy(bmap2, bmap1, 97); /* ... but aligned on word length */
	218	expect_eq_pbl("0-108,128-1023", bmap2, 1024);
	219
	220	bitmap_zero(bmap2, 97); /* ... but 0-padded til word length */
	221	expect_eq_pbl("128-1023", bmap2, 1024);
	222	}
	223
6df0d464 YN	224	#define PARSE_TIME 0x1
	225
	226	struct test_bitmap_parselist{
	227	const int errno;
	228	const char *in;
	229	const unsigned long *expected;
	230	const int nbits;
	231	const int flags;
	232	};
	233
60ef6900 YN	234	static const unsigned long exp[] __initconst = {
	235	BITMAP_FROM_U64(1),
	236	BITMAP_FROM_U64(2),
	237	BITMAP_FROM_U64(0x0000ffff),
	238	BITMAP_FROM_U64(0xffff0000),
	239	BITMAP_FROM_U64(0x55555555),
	240	BITMAP_FROM_U64(0xaaaaaaaa),
	241	BITMAP_FROM_U64(0x11111111),
	242	BITMAP_FROM_U64(0x22222222),
	243	BITMAP_FROM_U64(0xffffffff),
	244	BITMAP_FROM_U64(0xfffffffe),
8185f570 GU	245	BITMAP_FROM_U64(0x3333333311111111ULL),
8185f570 GU	246	BITMAP_FROM_U64(0xffffffff77777777ULL)
60ef6900 YN	247	};
	248
	249	static const unsigned long exp2[] __initconst = {
8185f570 GU	250	BITMAP_FROM_U64(0x3333333311111111ULL),
8185f570 GU	251	BITMAP_FROM_U64(0xffffffff77777777ULL)
60ef6900	252	};
6df0d464 YN	253
6df0d464 YN	254	static const struct test_bitmap_parselist parselist_tests[] __initconst = {
60ef6900 YN	255	#define step (sizeof(u64) / sizeof(unsigned long))
60ef6900 YN	256
6df0d464	257	{0, "0", &exp[0], 8, 0},
60ef6900 YN	258	{0, "1", &exp[1 * step], 8, 0},
	259	{0, "0-15", &exp[2 * step], 32, 0},
	260	{0, "16-31", &exp[3 * step], 32, 0},
	261	{0, "0-31:1/2", &exp[4 * step], 32, 0},
	262	{0, "1-31:1/2", &exp[5 * step], 32, 0},
	263	{0, "0-31:1/4", &exp[6 * step], 32, 0},
	264	{0, "1-31:1/4", &exp[7 * step], 32, 0},
	265	{0, "0-31:4/4", &exp[8 * step], 32, 0},
	266	{0, "1-31:4/4", &exp[9 * step], 32, 0},
	267	{0, "0-31:1/4,32-63:2/4", &exp[10 * step], 64, 0},
	268	{0, "0-31:3/4,32-63:4/4", &exp[11 * step], 64, 0},
6df0d464 YN	269
	270	{0, "0-31:1/4,32-63:2/4,64-95:3/4,96-127:4/4", exp2, 128, 0},
	271
	272	{0, "0-2047:128/256", NULL, 2048, PARSE_TIME},
	273
	274	{-EINVAL, "-1", NULL, 8, 0},
	275	{-EINVAL, "-0", NULL, 8, 0},
	276	{-EINVAL, "10-1", NULL, 8, 0},
	277	{-EINVAL, "0-31:10/1", NULL, 8, 0},
	278	};
	279
	280	static void __init test_bitmap_parselist(void)
	281	{
	282	int i;
	283	int err;
	284	cycles_t cycles;
	285	DECLARE_BITMAP(bmap, 2048);
	286
	287	for (i = 0; i < ARRAY_SIZE(parselist_tests); i++) {
	288	#define ptest parselist_tests[i]
	289
	290	cycles = get_cycles();
	291	err = bitmap_parselist(ptest.in, bmap, ptest.nbits);
	292	cycles = get_cycles() - cycles;
	293
	294	if (err != ptest.errno) {
	295	pr_err("test %d: input is %s, errno is %d, expected %d\n",
	296	i, ptest.in, err, ptest.errno);
	297	continue;
	298	}
	299
	300	if (!err && ptest.expected
	301	&& !__bitmap_equal(bmap, ptest.expected, ptest.nbits)) {
	302	pr_err("test %d: input is %s, result is 0x%lx, expected 0x%lx\n",
	303	i, ptest.in, bmap[0], *ptest.expected);
	304	continue;
	305	}
	306
	307	if (ptest.flags & PARSE_TIME)
	308	pr_err("test %d: input is '%s' OK, Time: %llu\n",
	309	i, ptest.in,
	310	(unsigned long long)cycles);
	311	}
	312	}
	313
3aa56885	314	static void __init test_bitmap_arr32(void)
5fd003f5	315	{
3aa56885 YN	316	unsigned int nbits, next_bit, len = sizeof(exp) * 8;
	317	u32 arr[sizeof(exp) / 4];
	318	DECLARE_BITMAP(bmap2, len);
	319
	320	memset(arr, 0xa5, sizeof(arr));
	321
	322	for (nbits = 0; nbits < len; ++nbits) {
	323	bitmap_to_arr32(arr, exp, nbits);
	324	bitmap_from_arr32(bmap2, arr, nbits);
	325	expect_eq_bitmap(bmap2, exp, nbits);
	326
	327	next_bit = find_next_bit(bmap2,
	328	round_up(nbits, BITS_PER_LONG), nbits);
	329	if (next_bit < round_up(nbits, BITS_PER_LONG))
	330	pr_err("bitmap_copy_arr32(nbits == %d:"
	331	" tail is not safely cleared: %d\n",
	332	nbits, next_bit);
	333
	334	if (nbits < len - 32)
	335	expect_eq_uint(arr[DIV_ROUND_UP(nbits, 32)],
	336	0xa5a5a5a5);
5fd003f5 DD	337	}
	338	}
	339
3cc78125 MW	340	static void noinline __init test_mem_optimisations(void)
	341	{
	342	DECLARE_BITMAP(bmap1, 1024);
	343	DECLARE_BITMAP(bmap2, 1024);
	344	unsigned int start, nbits;
	345
	346	for (start = 0; start < 1024; start += 8) {
	347	memset(bmap1, 0x5a, sizeof(bmap1));
	348	memset(bmap2, 0x5a, sizeof(bmap2));
	349	for (nbits = 0; nbits < 1024 - start; nbits += 8) {
	350	bitmap_set(bmap1, start, nbits);
	351	__bitmap_set(bmap2, start, nbits);
	352	if (!bitmap_equal(bmap1, bmap2, 1024))
	353	printk("set not equal %d %d\n", start, nbits);
	354	if (!__bitmap_equal(bmap1, bmap2, 1024))
	355	printk("set not __equal %d %d\n", start, nbits);
	356
	357	bitmap_clear(bmap1, start, nbits);
	358	__bitmap_clear(bmap2, start, nbits);
	359	if (!bitmap_equal(bmap1, bmap2, 1024))
	360	printk("clear not equal %d %d\n", start, nbits);
	361	if (!__bitmap_equal(bmap1, bmap2, 1024))
	362	printk("clear not __equal %d %d\n", start,
	363	nbits);
	364	}
	365	}
	366	}
	367
5fd003f5 DD	368	static int __init test_bitmap_init(void)
5fd003f5 DD	369	{
ee3527bd	370	test_zero_clear();
978f369c	371	test_fill_set();
5fd003f5	372	test_zero_fill_copy();
3aa56885	373	test_bitmap_arr32();
6df0d464	374	test_bitmap_parselist();
3cc78125	375	test_mem_optimisations();
5fd003f5 DD	376
	377	if (failed_tests == 0)
	378	pr_info("all %u tests passed\n", total_tests);
	379	else
	380	pr_warn("failed %u out of %u tests\n",
	381	failed_tests, total_tests);
	382
	383	return failed_tests ? -EINVAL : 0;
	384	}
	385
	386	static void __exit test_bitmap_cleanup(void)
	387	{
	388	}
	389
	390	module_init(test_bitmap_init);
	391	module_exit(test_bitmap_cleanup);
	392
	393	MODULE_AUTHOR("david decotigny <david.decotigny@googlers.com>");
	394	MODULE_LICENSE("GPL");