[linux-block.git] / lib / test_bitmap.c

// SPDX-License-Identifier: GPL-2.0-only
/*
 * Test cases for bitmap API.
 */

#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>
#include <linux/uaccess.h>

#include "../tools/testing/selftests/kselftest_module.h"

static unsigned total_tests __initdata;
static unsigned failed_tests __initdata;

static char pbl_buffer[PAGE_SIZE] __initdata;

static const unsigned long exp1[] __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),
	BITMAP_FROM_U64(0),
};

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

/* Fibonacci sequence */
static const unsigned long exp2_to_exp3_mask[] __initconst = {
	BITMAP_FROM_U64(0x008000020020212eULL),
};
/* exp3_0_1 = (exp2[0] & ~exp2_to_exp3_mask) | (exp2[1] & exp2_to_exp3_mask) */
static const unsigned long exp3_0_1[] __initconst = {
	BITMAP_FROM_U64(0x33b3333311313137ULL),
};
/* exp3_1_0 = (exp2[1] & ~exp2_to_exp3_mask) | (exp2[0] & exp2_to_exp3_mask) */
static const unsigned long exp3_1_0[] __initconst = {
	BITMAP_FROM_U64(0xff7fffff77575751ULL),
};

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;
}

static bool __init __check_eq_clump8(const char *srcfile, unsigned int line,
				    const unsigned int offset,
				    const unsigned int size,
				    const unsigned char *const clump_exp,
				    const unsigned long *const clump)
{
	unsigned long exp;

	if (offset >= size) {
		pr_warn("[%s:%u] bit offset for clump out-of-bounds: expected less than %u, got %u\n",
			srcfile, line, size, offset);
		return false;
	}

	exp = clump_exp[offset / 8];
	if (!exp) {
		pr_warn("[%s:%u] bit offset for zero clump: expected nonzero clump, got bit offset %u with clump value 0",
			srcfile, line, offset);
		return false;
	}

	if (*clump != exp) {
		pr_warn("[%s:%u] expected clump value of 0x%lX, got clump value of 0x%lX",
			srcfile, line, exp, *clump);
		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__)
#define expect_eq_clump8(...)		__expect_eq(clump8, ##__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_copy(void)
{
	DECLARE_BITMAP(bmap1, 1024);
	DECLARE_BITMAP(bmap2, 1024);

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

	/* single-word bitmaps */
	bitmap_set(bmap1, 0, 19);
	bitmap_copy(bmap2, bmap1, 23);
	expect_eq_pbl("0-18", bmap2, 1024);

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

	/* multi-word bitmaps */
	bitmap_set(bmap1, 0, 109);
	bitmap_copy(bmap2, bmap1, 1024);
	expect_eq_pbl("0-108", bmap2, 1024);

	bitmap_fill(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);
}

#define EXP2_IN_BITS	(sizeof(exp2) * 8)

static void __init test_replace(void)
{
	unsigned int nbits = 64;
	unsigned int nlongs = DIV_ROUND_UP(nbits, BITS_PER_LONG);
	DECLARE_BITMAP(bmap, 1024);

	bitmap_zero(bmap, 1024);
	bitmap_replace(bmap, &exp2[0 * nlongs], &exp2[1 * nlongs], exp2_to_exp3_mask, nbits);
	expect_eq_bitmap(bmap, exp3_0_1, nbits);

	bitmap_zero(bmap, 1024);
	bitmap_replace(bmap, &exp2[1 * nlongs], &exp2[0 * nlongs], exp2_to_exp3_mask, nbits);
	expect_eq_bitmap(bmap, exp3_1_0, nbits);

	bitmap_fill(bmap, 1024);
	bitmap_replace(bmap, &exp2[0 * nlongs], &exp2[1 * nlongs], exp2_to_exp3_mask, nbits);
	expect_eq_bitmap(bmap, exp3_0_1, nbits);

	bitmap_fill(bmap, 1024);
	bitmap_replace(bmap, &exp2[1 * nlongs], &exp2[0 * nlongs], exp2_to_exp3_mask, nbits);
	expect_eq_bitmap(bmap, exp3_1_0, nbits);
}

#define PARSE_TIME	0x1
#define NO_LEN		0x2

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

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

	{0, "0",			&exp1[0], 8, 0},
	{0, "1",			&exp1[1 * step], 8, 0},
	{0, "0-15",			&exp1[2 * step], 32, 0},
	{0, "16-31",			&exp1[3 * step], 32, 0},
	{0, "0-31:1/2",			&exp1[4 * step], 32, 0},
	{0, "1-31:1/2",			&exp1[5 * step], 32, 0},
	{0, "0-31:1/4",			&exp1[6 * step], 32, 0},
	{0, "1-31:1/4",			&exp1[7 * step], 32, 0},
	{0, "0-31:4/4",			&exp1[8 * step], 32, 0},
	{0, "1-31:4/4",			&exp1[9 * step], 32, 0},
	{0, "0-31:1/4,32-63:2/4",	&exp1[10 * step], 64, 0},
	{0, "0-31:3/4,32-63:4/4",	&exp1[11 * step], 64, 0},
	{0, "  ,,  0-31:3/4  ,, 32-63:4/4  ,,  ",	&exp1[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},

	{0, "",				&exp1[12 * step], 8, 0},
	{0, "\n",			&exp1[12 * step], 8, 0},
	{0, ",,  ,,  , ,  ,",		&exp1[12 * step], 8, 0},
	{0, " ,  ,,  , ,   ",		&exp1[12 * step], 8, 0},
	{0, " ,  ,,  , ,   \n",		&exp1[12 * step], 8, 0},

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

	{-EINVAL, "a-31", NULL, 8, 0},
	{-EINVAL, "0-a1", NULL, 8, 0},
	{-EINVAL, "a-31:10/1", NULL, 8, 0},
	{-EINVAL, "0-31:a/1", NULL, 8, 0},
	{-EINVAL, "0-\n", NULL, 8, 0},

};

static void __init __test_bitmap_parselist(int is_user)
{
	int i;
	int err;
	ktime_t time;
	DECLARE_BITMAP(bmap, 2048);
	char *mode = is_user ? "_user"  : "";

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

		if (is_user) {
			mm_segment_t orig_fs = get_fs();
			size_t len = strlen(ptest.in);

			set_fs(KERNEL_DS);
			time = ktime_get();
			err = bitmap_parselist_user((__force const char __user *)ptest.in, len,
						    bmap, ptest.nbits);
			time = ktime_get() - time;
			set_fs(orig_fs);
		} else {
			time = ktime_get();
			err = bitmap_parselist(ptest.in, bmap, ptest.nbits);
			time = ktime_get() - time;
		}

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

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

		if (ptest.flags & PARSE_TIME)
			pr_err("parselist%s: %d: input is '%s' OK, Time: %llu\n",
					mode, i, ptest.in, time);

#undef ptest
	}
}

static const unsigned long parse_test[] __initconst = {
	BITMAP_FROM_U64(0),
	BITMAP_FROM_U64(1),
	BITMAP_FROM_U64(0xdeadbeef),
	BITMAP_FROM_U64(0x100000000ULL),
};

static const unsigned long parse_test2[] __initconst = {
	BITMAP_FROM_U64(0x100000000ULL), BITMAP_FROM_U64(0xdeadbeef),
	BITMAP_FROM_U64(0x100000000ULL), BITMAP_FROM_U64(0xbaadf00ddeadbeef),
	BITMAP_FROM_U64(0x100000000ULL), BITMAP_FROM_U64(0x0badf00ddeadbeef),
};

static const struct test_bitmap_parselist parse_tests[] __initconst = {
	{0, "0",			&parse_test[0 * step], 32, 0},
	{0, "1",			&parse_test[1 * step], 32, 0},
	{0, "deadbeef",			&parse_test[2 * step], 32, 0},
	{0, "1,0",			&parse_test[3 * step], 33, 0},

	{0, "deadbeef,1,0",		&parse_test2[0 * 2 * step], 96, 0},
	{0, "baadf00d,deadbeef,1,0",	&parse_test2[1 * 2 * step], 128, 0},
	{0, "badf00d,deadbeef,1,0",	&parse_test2[2 * 2 * step], 124, 0},

	{-EINVAL,    "goodfood,deadbeef,1,0",	NULL, 128, 0},
	{-EOVERFLOW, "3,0",			NULL, 33, 0},
	{-EOVERFLOW, "123badf00d,deadbeef,1,0",	NULL, 128, 0},
	{-EOVERFLOW, "badf00d,deadbeef,1,0",	NULL, 90, 0},
	{-EOVERFLOW, "fbadf00d,deadbeef,1,0",	NULL, 95, 0},
	{-EOVERFLOW, "badf00d,deadbeef,1,0",	NULL, 100, 0},
#undef step
};

static void __init __test_bitmap_parse(int is_user)
{
	int i;
	int err;
	ktime_t time;
	DECLARE_BITMAP(bmap, 2048);
	char *mode = is_user ? "_user"  : "";

	for (i = 0; i < ARRAY_SIZE(parse_tests); i++) {
		struct test_bitmap_parselist test = parse_tests[i];

		if (is_user) {
			size_t len = strlen(test.in);
			mm_segment_t orig_fs = get_fs();

			set_fs(KERNEL_DS);
			time = ktime_get();
			err = bitmap_parse_user((__force const char __user *)test.in, len,
						bmap, test.nbits);
			time = ktime_get() - time;
			set_fs(orig_fs);
		} else {
			size_t len = test.flags & NO_LEN ?
				UINT_MAX : strlen(test.in);
			time = ktime_get();
			err = bitmap_parse(test.in, len, bmap, test.nbits);
			time = ktime_get() - time;
		}

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

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

		if (test.flags & PARSE_TIME)
			pr_err("parse%s: %d: input is '%s' OK, Time: %llu\n",
					mode, i, test.in, time);
	}
}

static void __init test_bitmap_parselist(void)
{
	__test_bitmap_parselist(0);
}

static void __init test_bitmap_parselist_user(void)
{
	__test_bitmap_parselist(1);
}

static void __init test_bitmap_parse(void)
{
	__test_bitmap_parse(0);
}

static void __init test_bitmap_parse_user(void)
{
	__test_bitmap_parse(1);
}

#define EXP1_IN_BITS	(sizeof(exp1) * 8)

static void __init test_bitmap_arr32(void)
{
	unsigned int nbits, next_bit;
	u32 arr[EXP1_IN_BITS / 32];
	DECLARE_BITMAP(bmap2, EXP1_IN_BITS);

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

	for (nbits = 0; nbits < EXP1_IN_BITS; ++nbits) {
		bitmap_to_arr32(arr, exp1, nbits);
		bitmap_from_arr32(bmap2, arr, nbits);
		expect_eq_bitmap(bmap2, exp1, 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 < EXP1_IN_BITS - 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) {
		for (nbits = 0; nbits < 1024 - start; nbits += 8) {
			memset(bmap1, 0x5a, sizeof(bmap1));
			memset(bmap2, 0x5a, sizeof(bmap2));

			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);
				failed_tests++;
			}
			if (!__bitmap_equal(bmap1, bmap2, 1024)) {
				printk("set not __equal %d %d\n", start, nbits);
				failed_tests++;
			}

			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);
				failed_tests++;
			}
			if (!__bitmap_equal(bmap1, bmap2, 1024)) {
				printk("clear not __equal %d %d\n", start,
									nbits);
				failed_tests++;
			}
		}
	}
}

static const unsigned char clump_exp[] __initconst = {
	0x01,	/* 1 bit set */
	0x02,	/* non-edge 1 bit set */
	0x00,	/* zero bits set */
	0x38,	/* 3 bits set across 4-bit boundary */
	0x38,	/* Repeated clump */
	0x0F,	/* 4 bits set */
	0xFF,	/* all bits set */
	0x05,	/* non-adjacent 2 bits set */
};

static void __init test_for_each_set_clump8(void)
{
#define CLUMP_EXP_NUMBITS 64
	DECLARE_BITMAP(bits, CLUMP_EXP_NUMBITS);
	unsigned int start;
	unsigned long clump;

	/* set bitmap to test case */
	bitmap_zero(bits, CLUMP_EXP_NUMBITS);
	bitmap_set(bits, 0, 1);		/* 0x01 */
	bitmap_set(bits, 9, 1);		/* 0x02 */
	bitmap_set(bits, 27, 3);	/* 0x28 */
	bitmap_set(bits, 35, 3);	/* 0x28 */
	bitmap_set(bits, 40, 4);	/* 0x0F */
	bitmap_set(bits, 48, 8);	/* 0xFF */
	bitmap_set(bits, 56, 1);	/* 0x05 - part 1 */
	bitmap_set(bits, 58, 1);	/* 0x05 - part 2 */

	for_each_set_clump8(start, clump, bits, CLUMP_EXP_NUMBITS)
		expect_eq_clump8(start, CLUMP_EXP_NUMBITS, clump_exp, &clump);
}

static void __init selftest(void)
{
	test_zero_clear();
	test_fill_set();
	test_copy();
	test_replace();
	test_bitmap_arr32();
	test_bitmap_parse();
	test_bitmap_parse_user();
	test_bitmap_parselist();
	test_bitmap_parselist_user();
	test_mem_optimisations();
	test_for_each_set_clump8();
}

KSTM_MODULE_LOADERS(test_bitmap);
MODULE_AUTHOR("david decotigny <david.decotigny@googlers.com>");
MODULE_LICENSE("GPL");
Commit	Line	Data
09c434b8	1	// SPDX-License-Identifier: GPL-2.0-only
5fd003f5	2	/*
780ff33b	3	* Test cases for bitmap API.
5fd003f5 DD	4	*/
	5
	6	#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
	7
	8	#include <linux/bitmap.h>
	9	#include <linux/init.h>
	10	#include <linux/kernel.h>
	11	#include <linux/module.h>
	12	#include <linux/printk.h>
	13	#include <linux/slab.h>
	14	#include <linux/string.h>
6ea86bdf	15	#include <linux/uaccess.h>
5fd003f5	16
6b1a4d5b TH	17	#include "../tools/testing/selftests/kselftest_module.h"
6b1a4d5b TH	18
5fd003f5 DD	19	static unsigned total_tests __initdata;
	20	static unsigned failed_tests __initdata;
	21
	22	static char pbl_buffer[PAGE_SIZE] __initdata;
	23
c21dd8a7 AS	24	static const unsigned long exp1[] __initconst = {
	25	BITMAP_FROM_U64(1),
	26	BITMAP_FROM_U64(2),
	27	BITMAP_FROM_U64(0x0000ffff),
	28	BITMAP_FROM_U64(0xffff0000),
	29	BITMAP_FROM_U64(0x55555555),
	30	BITMAP_FROM_U64(0xaaaaaaaa),
	31	BITMAP_FROM_U64(0x11111111),
	32	BITMAP_FROM_U64(0x22222222),
	33	BITMAP_FROM_U64(0xffffffff),
	34	BITMAP_FROM_U64(0xfffffffe),
	35	BITMAP_FROM_U64(0x3333333311111111ULL),
	36	BITMAP_FROM_U64(0xffffffff77777777ULL),
	37	BITMAP_FROM_U64(0),
	38	};
	39
	40	static const unsigned long exp2[] __initconst = {
	41	BITMAP_FROM_U64(0x3333333311111111ULL),
	42	BITMAP_FROM_U64(0xffffffff77777777ULL),
	43	};
5fd003f5	44
30544ed5 AS	45	/* Fibonacci sequence */
	46	static const unsigned long exp2_to_exp3_mask[] __initconst = {
	47	BITMAP_FROM_U64(0x008000020020212eULL),
	48	};
	49	/* exp3_0_1 = (exp2[0] & ~exp2_to_exp3_mask) \| (exp2[1] & exp2_to_exp3_mask) */
	50	static const unsigned long exp3_0_1[] __initconst = {
	51	BITMAP_FROM_U64(0x33b3333311313137ULL),
	52	};
	53	/* exp3_1_0 = (exp2[1] & ~exp2_to_exp3_mask) \| (exp2[0] & exp2_to_exp3_mask) */
	54	static const unsigned long exp3_1_0[] __initconst = {
	55	BITMAP_FROM_U64(0xff7fffff77575751ULL),
	56	};
	57
5fd003f5 DD	58	static bool __init
	59	__check_eq_uint(const char *srcfile, unsigned int line,
	60	const unsigned int exp_uint, unsigned int x)
	61	{
	62	if (exp_uint != x) {
3aa56885	63	pr_err("[%s:%u] expected %u, got %u\n",
5fd003f5 DD	64	srcfile, line, exp_uint, x);
	65	return false;
	66	}
	67	return true;
	68	}
	69
	70
	71	static bool __init
	72	__check_eq_bitmap(const char *srcfile, unsigned int line,
3aa56885 YN	73	const unsigned long exp_bmap, const unsigned long bmap,
3aa56885 YN	74	unsigned int nbits)
5fd003f5	75	{
5fd003f5 DD	76	if (!bitmap_equal(exp_bmap, bmap, nbits)) {
	77	pr_warn("[%s:%u] bitmaps contents differ: expected \"%pbl\", got \"%pbl\"\n",
	78	srcfile, line,
3aa56885	79	nbits, exp_bmap, nbits, bmap);
5fd003f5 DD	80	return false;
	81	}
	82	return true;
	83	}
	84
	85	static bool __init
	86	__check_eq_pbl(const char *srcfile, unsigned int line,
	87	const char *expected_pbl,
	88	const unsigned long *bitmap, unsigned int nbits)
	89	{
	90	snprintf(pbl_buffer, sizeof(pbl_buffer), "%*pbl", nbits, bitmap);
	91	if (strcmp(expected_pbl, pbl_buffer)) {
	92	pr_warn("[%s:%u] expected \"%s\", got \"%s\"\n",
	93	srcfile, line,
	94	expected_pbl, pbl_buffer);
	95	return false;
	96	}
	97	return true;
	98	}
	99
3aa56885 YN	100	static bool __init
	101	__check_eq_u32_array(const char *srcfile, unsigned int line,
	102	const u32 *exp_arr, unsigned int exp_len,
	103	const u32 *arr, unsigned int len) __used;
5fd003f5 DD	104	static bool __init
	105	__check_eq_u32_array(const char *srcfile, unsigned int line,
	106	const u32 *exp_arr, unsigned int exp_len,
	107	const u32 *arr, unsigned int len)
	108	{
	109	if (exp_len != len) {
	110	pr_warn("[%s:%u] array length differ: expected %u, got %u\n",
	111	srcfile, line,
	112	exp_len, len);
	113	return false;
	114	}
	115
	116	if (memcmp(exp_arr, arr, lensizeof(arr))) {
	117	pr_warn("[%s:%u] array contents differ\n", srcfile, line);
	118	print_hex_dump(KERN_WARNING, " exp: ", DUMP_PREFIX_OFFSET,
	119	32, 4, exp_arr, exp_lensizeof(exp_arr), false);
	120	print_hex_dump(KERN_WARNING, " got: ", DUMP_PREFIX_OFFSET,
	121	32, 4, arr, lensizeof(arr), false);
	122	return false;
	123	}
	124
	125	return true;
	126	}
	127
e4aa168d WBG	128	static bool __init __check_eq_clump8(const char *srcfile, unsigned int line,
	129	const unsigned int offset,
	130	const unsigned int size,
	131	const unsigned char *const clump_exp,
	132	const unsigned long *const clump)
	133	{
	134	unsigned long exp;
	135
	136	if (offset >= size) {
	137	pr_warn("[%s:%u] bit offset for clump out-of-bounds: expected less than %u, got %u\n",
	138	srcfile, line, size, offset);
	139	return false;
	140	}
	141
	142	exp = clump_exp[offset / 8];
	143	if (!exp) {
	144	pr_warn("[%s:%u] bit offset for zero clump: expected nonzero clump, got bit offset %u with clump value 0",
	145	srcfile, line, offset);
	146	return false;
	147	}
	148
	149	if (*clump != exp) {
	150	pr_warn("[%s:%u] expected clump value of 0x%lX, got clump value of 0x%lX",
	151	srcfile, line, exp, *clump);
	152	return false;
	153	}
	154
	155	return true;
	156	}
	157
5fd003f5 DD	158	#define __expect_eq(suffix, ...) \
	159	({ \
	160	int result = 0; \
	161	total_tests++; \
	162	if (!__check_eq_ ## suffix(__FILE__, __LINE__, \
	163	##__VA_ARGS__)) { \
	164	failed_tests++; \
	165	result = 1; \
	166	} \
	167	result; \
	168	})
	169
	170	#define expect_eq_uint(...) __expect_eq(uint, ##__VA_ARGS__)
	171	#define expect_eq_bitmap(...) __expect_eq(bitmap, ##__VA_ARGS__)
	172	#define expect_eq_pbl(...) __expect_eq(pbl, ##__VA_ARGS__)
	173	#define expect_eq_u32_array(...) __expect_eq(u32_array, ##__VA_ARGS__)
e4aa168d	174	#define expect_eq_clump8(...) __expect_eq(clump8, ##__VA_ARGS__)
5fd003f5	175
ee3527bd AS	176	static void __init test_zero_clear(void)
	177	{
	178	DECLARE_BITMAP(bmap, 1024);
	179
	180	/* Known way to set all bits */
	181	memset(bmap, 0xff, 128);
	182
	183	expect_eq_pbl("0-22", bmap, 23);
	184	expect_eq_pbl("0-1023", bmap, 1024);
	185
	186	/* single-word bitmaps */
	187	bitmap_clear(bmap, 0, 9);
	188	expect_eq_pbl("9-1023", bmap, 1024);
	189
	190	bitmap_zero(bmap, 35);
	191	expect_eq_pbl("64-1023", bmap, 1024);
	192
	193	/* cross boundaries operations */
	194	bitmap_clear(bmap, 79, 19);
	195	expect_eq_pbl("64-78,98-1023", bmap, 1024);
	196
	197	bitmap_zero(bmap, 115);
	198	expect_eq_pbl("128-1023", bmap, 1024);
	199
	200	/* Zeroing entire area */
	201	bitmap_zero(bmap, 1024);
	202	expect_eq_pbl("", bmap, 1024);
	203	}
	204
978f369c AS	205	static void __init test_fill_set(void)
	206	{
	207	DECLARE_BITMAP(bmap, 1024);
	208
	209	/* Known way to clear all bits */
	210	memset(bmap, 0x00, 128);
	211
	212	expect_eq_pbl("", bmap, 23);
	213	expect_eq_pbl("", bmap, 1024);
	214
	215	/* single-word bitmaps */
	216	bitmap_set(bmap, 0, 9);
	217	expect_eq_pbl("0-8", bmap, 1024);
	218
	219	bitmap_fill(bmap, 35);
	220	expect_eq_pbl("0-63", bmap, 1024);
	221
	222	/* cross boundaries operations */
	223	bitmap_set(bmap, 79, 19);
	224	expect_eq_pbl("0-63,79-97", bmap, 1024);
	225
	226	bitmap_fill(bmap, 115);
	227	expect_eq_pbl("0-127", bmap, 1024);
	228
	229	/* Zeroing entire area */
	230	bitmap_fill(bmap, 1024);
	231	expect_eq_pbl("0-1023", bmap, 1024);
	232	}
	233
fe81814c	234	static void __init test_copy(void)
5fd003f5 DD	235	{
	236	DECLARE_BITMAP(bmap1, 1024);
	237	DECLARE_BITMAP(bmap2, 1024);
	238
	239	bitmap_zero(bmap1, 1024);
	240	bitmap_zero(bmap2, 1024);
	241
	242	/* single-word bitmaps */
fe81814c	243	bitmap_set(bmap1, 0, 19);
5fd003f5 DD	244	bitmap_copy(bmap2, bmap1, 23);
	245	expect_eq_pbl("0-18", bmap2, 1024);
	246
fe81814c	247	bitmap_set(bmap2, 0, 23);
5fd003f5 DD	248	bitmap_copy(bmap2, bmap1, 23);
	249	expect_eq_pbl("0-18", bmap2, 1024);
	250
5fd003f5	251	/* multi-word bitmaps */
fe81814c	252	bitmap_set(bmap1, 0, 109);
5fd003f5 DD	253	bitmap_copy(bmap2, bmap1, 1024);
	254	expect_eq_pbl("0-108", bmap2, 1024);
	255
	256	bitmap_fill(bmap2, 1024);
5fd003f5 DD	257	bitmap_copy(bmap2, bmap1, 1024);
	258	expect_eq_pbl("0-108", bmap2, 1024);
	259
	260	/* the following tests assume a 32- or 64-bit arch (even 128b
	261	* if we care)
	262	*/
	263
	264	bitmap_fill(bmap2, 1024);
	265	bitmap_copy(bmap2, bmap1, 109); /* ... but 0-padded til word length */
	266	expect_eq_pbl("0-108,128-1023", bmap2, 1024);
	267
	268	bitmap_fill(bmap2, 1024);
	269	bitmap_copy(bmap2, bmap1, 97); /* ... but aligned on word length */
	270	expect_eq_pbl("0-108,128-1023", bmap2, 1024);
5fd003f5 DD	271	}
5fd003f5 DD	272
30544ed5 AS	273	#define EXP2_IN_BITS (sizeof(exp2) * 8)
	274
	275	static void __init test_replace(void)
	276	{
	277	unsigned int nbits = 64;
69334ca5	278	unsigned int nlongs = DIV_ROUND_UP(nbits, BITS_PER_LONG);
30544ed5 AS	279	DECLARE_BITMAP(bmap, 1024);
	280
	281	bitmap_zero(bmap, 1024);
69334ca5	282	bitmap_replace(bmap, &exp2[0 * nlongs], &exp2[1 * nlongs], exp2_to_exp3_mask, nbits);
30544ed5 AS	283	expect_eq_bitmap(bmap, exp3_0_1, nbits);
	284
	285	bitmap_zero(bmap, 1024);
69334ca5	286	bitmap_replace(bmap, &exp2[1 * nlongs], &exp2[0 * nlongs], exp2_to_exp3_mask, nbits);
30544ed5 AS	287	expect_eq_bitmap(bmap, exp3_1_0, nbits);
	288
	289	bitmap_fill(bmap, 1024);
69334ca5	290	bitmap_replace(bmap, &exp2[0 * nlongs], &exp2[1 * nlongs], exp2_to_exp3_mask, nbits);
30544ed5 AS	291	expect_eq_bitmap(bmap, exp3_0_1, nbits);
	292
	293	bitmap_fill(bmap, 1024);
69334ca5	294	bitmap_replace(bmap, &exp2[1 * nlongs], &exp2[0 * nlongs], exp2_to_exp3_mask, nbits);
30544ed5 AS	295	expect_eq_bitmap(bmap, exp3_1_0, nbits);
	296	}
	297
7eb2e94e YN	298	#define PARSE_TIME 0x1
7eb2e94e YN	299	#define NO_LEN 0x2
6df0d464 YN	300
	301	struct test_bitmap_parselist{
	302	const int errno;
	303	const char *in;
	304	const unsigned long *expected;
	305	const int nbits;
	306	const int flags;
	307	};
	308
6df0d464	309	static const struct test_bitmap_parselist parselist_tests[] __initconst = {
60ef6900 YN	310	#define step (sizeof(u64) / sizeof(unsigned long))
60ef6900 YN	311
0ee312e3 AS	312	{0, "0", &exp1[0], 8, 0},
	313	{0, "1", &exp1[1 * step], 8, 0},
	314	{0, "0-15", &exp1[2 * step], 32, 0},
	315	{0, "16-31", &exp1[3 * step], 32, 0},
	316	{0, "0-31:1/2", &exp1[4 * step], 32, 0},
	317	{0, "1-31:1/2", &exp1[5 * step], 32, 0},
	318	{0, "0-31:1/4", &exp1[6 * step], 32, 0},
	319	{0, "1-31:1/4", &exp1[7 * step], 32, 0},
	320	{0, "0-31:4/4", &exp1[8 * step], 32, 0},
	321	{0, "1-31:4/4", &exp1[9 * step], 32, 0},
	322	{0, "0-31:1/4,32-63:2/4", &exp1[10 * step], 64, 0},
	323	{0, "0-31:3/4,32-63:4/4", &exp1[11 * step], 64, 0},
	324	{0, " ,, 0-31:3/4 ,, 32-63:4/4 ,, ", &exp1[11 * step], 64, 0},
6df0d464 YN	325
	326	{0, "0-31:1/4,32-63:2/4,64-95:3/4,96-127:4/4", exp2, 128, 0},
	327
	328	{0, "0-2047:128/256", NULL, 2048, PARSE_TIME},
	329
0ee312e3 AS	330	{0, "", &exp1[12 * step], 8, 0},
	331	{0, "\n", &exp1[12 * step], 8, 0},
	332	{0, ",, ,, , , ,", &exp1[12 * step], 8, 0},
	333	{0, " , ,, , , ", &exp1[12 * step], 8, 0},
	334	{0, " , ,, , , \n", &exp1[12 * step], 8, 0},
a4ab5050	335
6df0d464 YN	336	{-EINVAL, "-1", NULL, 8, 0},
	337	{-EINVAL, "-0", NULL, 8, 0},
	338	{-EINVAL, "10-1", NULL, 8, 0},
8351760f YN	339	{-EINVAL, "0-31:", NULL, 8, 0},
8351760f YN	340	{-EINVAL, "0-31:0", NULL, 8, 0},
a4ab5050	341	{-EINVAL, "0-31:0/", NULL, 8, 0},
8351760f YN	342	{-EINVAL, "0-31:0/0", NULL, 8, 0},
8351760f YN	343	{-EINVAL, "0-31:1/0", NULL, 8, 0},
6df0d464	344	{-EINVAL, "0-31:10/1", NULL, 8, 0},
a4ab5050 YN	345	{-EOVERFLOW, "0-98765432123456789:10/1", NULL, 8, 0},
	346
	347	{-EINVAL, "a-31", NULL, 8, 0},
	348	{-EINVAL, "0-a1", NULL, 8, 0},
	349	{-EINVAL, "a-31:10/1", NULL, 8, 0},
	350	{-EINVAL, "0-31:a/1", NULL, 8, 0},
	351	{-EINVAL, "0-\n", NULL, 8, 0},
54224044	352
6df0d464 YN	353	};
6df0d464 YN	354
6ea86bdf	355	static void __init __test_bitmap_parselist(int is_user)
6df0d464 YN	356	{
	357	int i;
	358	int err;
0c2111a5	359	ktime_t time;
6df0d464	360	DECLARE_BITMAP(bmap, 2048);
6ea86bdf	361	char *mode = is_user ? "_user" : "";
6df0d464 YN	362
	363	for (i = 0; i < ARRAY_SIZE(parselist_tests); i++) {
	364	#define ptest parselist_tests[i]
	365
6ea86bdf YN	366	if (is_user) {
	367	mm_segment_t orig_fs = get_fs();
	368	size_t len = strlen(ptest.in);
	369
	370	set_fs(KERNEL_DS);
	371	time = ktime_get();
17b6753f	372	err = bitmap_parselist_user((__force const char __user *)ptest.in, len,
6ea86bdf YN	373	bmap, ptest.nbits);
	374	time = ktime_get() - time;
	375	set_fs(orig_fs);
	376	} else {
	377	time = ktime_get();
	378	err = bitmap_parselist(ptest.in, bmap, ptest.nbits);
	379	time = ktime_get() - time;
	380	}
6df0d464 YN	381
6df0d464 YN	382	if (err != ptest.errno) {
6ea86bdf YN	383	pr_err("parselist%s: %d: input is %s, errno is %d, expected %d\n",
6ea86bdf YN	384	mode, i, ptest.in, err, ptest.errno);
6df0d464 YN	385	continue;
	386	}
	387
	388	if (!err && ptest.expected
	389	&& !__bitmap_equal(bmap, ptest.expected, ptest.nbits)) {
6ea86bdf YN	390	pr_err("parselist%s: %d: input is %s, result is 0x%lx, expected 0x%lx\n",
	391	mode, i, ptest.in, bmap[0],
	392	*ptest.expected);
6df0d464 YN	393	continue;
	394	}
	395
	396	if (ptest.flags & PARSE_TIME)
6ea86bdf YN	397	pr_err("parselist%s: %d: input is '%s' OK, Time: %llu\n",
6ea86bdf YN	398	mode, i, ptest.in, time);
54224044 AS	399
54224044 AS	400	#undef ptest
6df0d464 YN	401	}
	402	}
	403
7eb2e94e YN	404	static const unsigned long parse_test[] __initconst = {
	405	BITMAP_FROM_U64(0),
	406	BITMAP_FROM_U64(1),
	407	BITMAP_FROM_U64(0xdeadbeef),
	408	BITMAP_FROM_U64(0x100000000ULL),
	409	};
	410
	411	static const unsigned long parse_test2[] __initconst = {
	412	BITMAP_FROM_U64(0x100000000ULL), BITMAP_FROM_U64(0xdeadbeef),
	413	BITMAP_FROM_U64(0x100000000ULL), BITMAP_FROM_U64(0xbaadf00ddeadbeef),
	414	BITMAP_FROM_U64(0x100000000ULL), BITMAP_FROM_U64(0x0badf00ddeadbeef),
	415	};
	416
	417	static const struct test_bitmap_parselist parse_tests[] __initconst = {
	418	{0, "0", &parse_test[0 * step], 32, 0},
	419	{0, "1", &parse_test[1 * step], 32, 0},
	420	{0, "deadbeef", &parse_test[2 * step], 32, 0},
	421	{0, "1,0", &parse_test[3 * step], 33, 0},
	422
	423	{0, "deadbeef,1,0", &parse_test2[0 * 2 * step], 96, 0},
	424	{0, "baadf00d,deadbeef,1,0", &parse_test2[1 * 2 * step], 128, 0},
	425	{0, "badf00d,deadbeef,1,0", &parse_test2[2 * 2 * step], 124, 0},
	426
	427	{-EINVAL, "goodfood,deadbeef,1,0", NULL, 128, 0},
	428	{-EOVERFLOW, "3,0", NULL, 33, 0},
	429	{-EOVERFLOW, "123badf00d,deadbeef,1,0", NULL, 128, 0},
	430	{-EOVERFLOW, "badf00d,deadbeef,1,0", NULL, 90, 0},
	431	{-EOVERFLOW, "fbadf00d,deadbeef,1,0", NULL, 95, 0},
	432	{-EOVERFLOW, "badf00d,deadbeef,1,0", NULL, 100, 0},
	433	#undef step
	434	};
	435
	436	static void __init __test_bitmap_parse(int is_user)
	437	{
	438	int i;
	439	int err;
	440	ktime_t time;
	441	DECLARE_BITMAP(bmap, 2048);
	442	char *mode = is_user ? "_user" : "";
	443
	444	for (i = 0; i < ARRAY_SIZE(parse_tests); i++) {
	445	struct test_bitmap_parselist test = parse_tests[i];
	446
	447	if (is_user) {
	448	size_t len = strlen(test.in);
	449	mm_segment_t orig_fs = get_fs();
	450
	451	set_fs(KERNEL_DS);
	452	time = ktime_get();
	453	err = bitmap_parse_user((__force const char __user *)test.in, len,
	454	bmap, test.nbits);
	455	time = ktime_get() - time;
	456	set_fs(orig_fs);
	457	} else {
	458	size_t len = test.flags & NO_LEN ?
	459	UINT_MAX : strlen(test.in);
	460	time = ktime_get();
	461	err = bitmap_parse(test.in, len, bmap, test.nbits);
	462	time = ktime_get() - time;
	463	}
	464
	465	if (err != test.errno) {
	466	pr_err("parse%s: %d: input is %s, errno is %d, expected %d\n",
	467	mode, i, test.in, err, test.errno);
468	continue;
469	}
470
471	if (!err && test.expected
472	&& !__bitmap_equal(bmap, test.expected, test.nbits)) {
473	pr_err("parse%s: %d: input is %s, result is 0x%lx, expected 0x%lx\n",
474	mode, i, test.in, bmap[0],
475	*test.expected);
476	continue;
477	}
478
479	if (test.flags & PARSE_TIME)
480	pr_err("parse%s: %d: input is '%s' OK, Time: %llu\n",
481	mode, i, test.in, time);
482	}
483	}
484
6ea86bdf YN	485	static void __init test_bitmap_parselist(void)
	486	{
	487	__test_bitmap_parselist(0);
	488	}
	489
	490	static void __init test_bitmap_parselist_user(void)
	491	{
	492	__test_bitmap_parselist(1);
	493	}
	494
7eb2e94e YN	495	static void __init test_bitmap_parse(void)
	496	{
	497	__test_bitmap_parse(0);
	498	}
	499
	500	static void __init test_bitmap_parse_user(void)
	501	{
	502	__test_bitmap_parse(1);
	503	}
	504
0ee312e3	505	#define EXP1_IN_BITS (sizeof(exp1) * 8)
f6f66c1b	506
3aa56885	507	static void __init test_bitmap_arr32(void)
5fd003f5	508	{
f6f66c1b	509	unsigned int nbits, next_bit;
a4881d1c AS	510	u32 arr[EXP1_IN_BITS / 32];
a4881d1c AS	511	DECLARE_BITMAP(bmap2, EXP1_IN_BITS);
3aa56885 YN	512
	513	memset(arr, 0xa5, sizeof(arr));
	514
a4881d1c	515	for (nbits = 0; nbits < EXP1_IN_BITS; ++nbits) {
0ee312e3	516	bitmap_to_arr32(arr, exp1, nbits);
3aa56885	517	bitmap_from_arr32(bmap2, arr, nbits);
0ee312e3	518	expect_eq_bitmap(bmap2, exp1, nbits);
3aa56885 YN	519
	520	next_bit = find_next_bit(bmap2,
	521	round_up(nbits, BITS_PER_LONG), nbits);
	522	if (next_bit < round_up(nbits, BITS_PER_LONG))
	523	pr_err("bitmap_copy_arr32(nbits == %d:"
	524	" tail is not safely cleared: %d\n",
	525	nbits, next_bit);
	526
a4881d1c	527	if (nbits < EXP1_IN_BITS - 32)
3aa56885 YN	528	expect_eq_uint(arr[DIV_ROUND_UP(nbits, 32)],
3aa56885 YN	529	0xa5a5a5a5);
5fd003f5 DD	530	}
	531	}
	532
3cc78125 MW	533	static void noinline __init test_mem_optimisations(void)
	534	{
	535	DECLARE_BITMAP(bmap1, 1024);
	536	DECLARE_BITMAP(bmap2, 1024);
	537	unsigned int start, nbits;
	538
	539	for (start = 0; start < 1024; start += 8) {
3cc78125	540	for (nbits = 0; nbits < 1024 - start; nbits += 8) {
1e3054b9 MW	541	memset(bmap1, 0x5a, sizeof(bmap1));
	542	memset(bmap2, 0x5a, sizeof(bmap2));
	543
3cc78125 MW	544	bitmap_set(bmap1, start, nbits);
3cc78125 MW	545	__bitmap_set(bmap2, start, nbits);
1e3054b9	546	if (!bitmap_equal(bmap1, bmap2, 1024)) {
3cc78125	547	printk("set not equal %d %d\n", start, nbits);
1e3054b9 MW	548	failed_tests++;
	549	}
	550	if (!__bitmap_equal(bmap1, bmap2, 1024)) {
3cc78125	551	printk("set not __equal %d %d\n", start, nbits);
1e3054b9 MW	552	failed_tests++;
1e3054b9 MW	553	}
3cc78125 MW	554
	555	bitmap_clear(bmap1, start, nbits);
	556	__bitmap_clear(bmap2, start, nbits);
1e3054b9	557	if (!bitmap_equal(bmap1, bmap2, 1024)) {
3cc78125	558	printk("clear not equal %d %d\n", start, nbits);
1e3054b9 MW	559	failed_tests++;
	560	}
	561	if (!__bitmap_equal(bmap1, bmap2, 1024)) {
3cc78125 MW	562	printk("clear not __equal %d %d\n", start,
3cc78125 MW	563	nbits);
1e3054b9 MW	564	failed_tests++;
1e3054b9 MW	565	}
3cc78125 MW	566	}
	567	}
	568	}
	569
e4aa168d WBG	570	static const unsigned char clump_exp[] __initconst = {
	571	0x01, /* 1 bit set */
	572	0x02, /* non-edge 1 bit set */
	573	0x00, /* zero bits set */
	574	0x38, /* 3 bits set across 4-bit boundary */
	575	0x38, /* Repeated clump */
	576	0x0F, /* 4 bits set */
	577	0xFF, /* all bits set */
	578	0x05, /* non-adjacent 2 bits set */
	579	};
	580
	581	static void __init test_for_each_set_clump8(void)
	582	{
	583	#define CLUMP_EXP_NUMBITS 64
	584	DECLARE_BITMAP(bits, CLUMP_EXP_NUMBITS);
	585	unsigned int start;
	586	unsigned long clump;
	587
	588	/* set bitmap to test case */
	589	bitmap_zero(bits, CLUMP_EXP_NUMBITS);
	590	bitmap_set(bits, 0, 1); /* 0x01 */
	591	bitmap_set(bits, 9, 1); /* 0x02 */
	592	bitmap_set(bits, 27, 3); /* 0x28 */
	593	bitmap_set(bits, 35, 3); /* 0x28 */
	594	bitmap_set(bits, 40, 4); /* 0x0F */
	595	bitmap_set(bits, 48, 8); /* 0xFF */
	596	bitmap_set(bits, 56, 1); /* 0x05 - part 1 */
	597	bitmap_set(bits, 58, 1); /* 0x05 - part 2 */
	598
	599	for_each_set_clump8(start, clump, bits, CLUMP_EXP_NUMBITS)
	600	expect_eq_clump8(start, CLUMP_EXP_NUMBITS, clump_exp, &clump);
	601	}
	602
6b1a4d5b	603	static void __init selftest(void)
5fd003f5	604	{
ee3527bd	605	test_zero_clear();
978f369c	606	test_fill_set();
fe81814c	607	test_copy();
30544ed5	608	test_replace();
3aa56885	609	test_bitmap_arr32();
7eb2e94e YN	610	test_bitmap_parse();
7eb2e94e YN	611	test_bitmap_parse_user();
6df0d464	612	test_bitmap_parselist();
6ea86bdf	613	test_bitmap_parselist_user();
3cc78125	614	test_mem_optimisations();
e4aa168d	615	test_for_each_set_clump8();
5fd003f5 DD	616	}
5fd003f5 DD	617
6b1a4d5b	618	KSTM_MODULE_LOADERS(test_bitmap);
5fd003f5 DD	619	MODULE_AUTHOR("david decotigny <david.decotigny@googlers.com>");
5fd003f5 DD	620	MODULE_LICENSE("GPL");