26 #define BITMAP_LEN	(4096UL * 8 * 10)  macro
29 static DECLARE_BITMAP(bitmap, BITMAP_LEN) __initdata;
30 static DECLARE_BITMAP(bitmap2, BITMAP_LEN) __initdata;
54 	static DECLARE_BITMAP(cp, BITMAP_LEN) __initdata;  in test_find_first_and_bit()
58 	bitmap_copy(cp, bitmap, BITMAP_LEN);  in test_find_first_and_bit()
77 	for (cnt = i = 0; i < BITMAP_LEN; cnt++)  in test_find_next_bit()
78 		i = find_next_bit(bitmap, BITMAP_LEN, i) + 1;  in test_find_next_bit()
91 	for (cnt = i = 0; i < BITMAP_LEN; cnt++)  in test_find_next_zero_bit()
141 	for (cnt = i = 0; i < BITMAP_LEN; cnt++)  in test_find_next_and_bit()
142 		i = find_next_and_bit(bitmap, bitmap2, BITMAP_LEN, i + 1);  in test_find_next_and_bit()
151 	unsigned long nbits = BITMAP_LEN / SPARSE;  in find_bit_test()
158 	test_find_next_bit(bitmap, BITMAP_LEN);  in find_bit_test()
159 	test_find_next_zero_bit(bitmap, BITMAP_LEN);  in find_bit_test()
160 	test_find_last_bit(bitmap, BITMAP_LEN);  in find_bit_test()
161 	test_find_nth_bit(bitmap, BITMAP_LEN / 10);  in find_bit_test()
167 	test_find_first_bit(bitmap, BITMAP_LEN / 10);  in find_bit_test()
168 	test_find_first_and_bit(bitmap, bitmap2, BITMAP_LEN / 2);  in find_bit_test()
169 	test_find_next_and_bit(bitmap, bitmap2, BITMAP_LEN);  in find_bit_test()
173 	bitmap_zero(bitmap, BITMAP_LEN);  in find_bit_test()
174 	bitmap_zero(bitmap2, BITMAP_LEN);  in find_bit_test()
177 		__set_bit(get_random_u32_below(BITMAP_LEN), bitmap);  in find_bit_test()
178 		__set_bit(get_random_u32_below(BITMAP_LEN), bitmap2);  in find_bit_test()
181 	test_find_next_bit(bitmap, BITMAP_LEN);  in find_bit_test()
182 	test_find_next_zero_bit(bitmap, BITMAP_LEN);  in find_bit_test()
183 	test_find_last_bit(bitmap, BITMAP_LEN);  in find_bit_test()
184 	test_find_nth_bit(bitmap, BITMAP_LEN);  in find_bit_test()
185 	test_find_first_bit(bitmap, BITMAP_LEN);  in find_bit_test()
186 	test_find_first_and_bit(bitmap, bitmap2, BITMAP_LEN);  in find_bit_test()
187 	test_find_next_and_bit(bitmap, bitmap2, BITMAP_LEN);  in find_bit_test()