2 * Test cases for printf facility.
5 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
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>
15 static unsigned total_tests __initdata
;
16 static unsigned failed_tests __initdata
;
18 static char pbl_buffer
[PAGE_SIZE
] __initdata
;
22 __check_eq_uint(const char *srcfile
, unsigned int line
,
23 const unsigned int exp_uint
, unsigned int x
)
26 pr_err("[%s:%u] expected %u, got %u\n",
27 srcfile
, line
, exp_uint
, x
);
35 __check_eq_bitmap(const char *srcfile
, unsigned int line
,
36 const unsigned long *exp_bmap
, const unsigned long *bmap
,
39 if (!bitmap_equal(exp_bmap
, bmap
, nbits
)) {
40 pr_warn("[%s:%u] bitmaps contents differ: expected \"%*pbl\", got \"%*pbl\"\n",
42 nbits
, exp_bmap
, nbits
, bmap
);
49 __check_eq_pbl(const char *srcfile
, unsigned int line
,
50 const char *expected_pbl
,
51 const unsigned long *bitmap
, unsigned int nbits
)
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",
57 expected_pbl
, pbl_buffer
);
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
;
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
)
73 pr_warn("[%s:%u] array length differ: expected %u, got %u\n",
79 if (memcmp(exp_arr
, arr
, len
*sizeof(*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_len
*sizeof(*exp_arr
), false);
83 print_hex_dump(KERN_WARNING
, " got: ", DUMP_PREFIX_OFFSET
,
84 32, 4, arr
, len
*sizeof(*arr
), false);
91 #define __expect_eq(suffix, ...) \
95 if (!__check_eq_ ## suffix(__FILE__, __LINE__, \
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__)
108 static void __init
test_zero_clear(void)
110 DECLARE_BITMAP(bmap
, 1024);
112 /* Known way to set all bits */
113 memset(bmap
, 0xff, 128);
115 expect_eq_pbl("0-22", bmap
, 23);
116 expect_eq_pbl("0-1023", bmap
, 1024);
118 /* single-word bitmaps */
119 bitmap_clear(bmap
, 0, 9);
120 expect_eq_pbl("9-1023", bmap
, 1024);
122 bitmap_zero(bmap
, 35);
123 expect_eq_pbl("64-1023", bmap
, 1024);
125 /* cross boundaries operations */
126 bitmap_clear(bmap
, 79, 19);
127 expect_eq_pbl("64-78,98-1023", bmap
, 1024);
129 bitmap_zero(bmap
, 115);
130 expect_eq_pbl("128-1023", bmap
, 1024);
132 /* Zeroing entire area */
133 bitmap_zero(bmap
, 1024);
134 expect_eq_pbl("", bmap
, 1024);
137 static void __init
test_fill_set(void)
139 DECLARE_BITMAP(bmap
, 1024);
141 /* Known way to clear all bits */
142 memset(bmap
, 0x00, 128);
144 expect_eq_pbl("", bmap
, 23);
145 expect_eq_pbl("", bmap
, 1024);
147 /* single-word bitmaps */
148 bitmap_set(bmap
, 0, 9);
149 expect_eq_pbl("0-8", bmap
, 1024);
151 bitmap_fill(bmap
, 35);
152 expect_eq_pbl("0-63", bmap
, 1024);
154 /* cross boundaries operations */
155 bitmap_set(bmap
, 79, 19);
156 expect_eq_pbl("0-63,79-97", bmap
, 1024);
158 bitmap_fill(bmap
, 115);
159 expect_eq_pbl("0-127", bmap
, 1024);
161 /* Zeroing entire area */
162 bitmap_fill(bmap
, 1024);
163 expect_eq_pbl("0-1023", bmap
, 1024);
166 static void __init
test_copy(void)
168 DECLARE_BITMAP(bmap1
, 1024);
169 DECLARE_BITMAP(bmap2
, 1024);
171 bitmap_zero(bmap1
, 1024);
172 bitmap_zero(bmap2
, 1024);
174 /* single-word bitmaps */
175 bitmap_set(bmap1
, 0, 19);
176 bitmap_copy(bmap2
, bmap1
, 23);
177 expect_eq_pbl("0-18", bmap2
, 1024);
179 bitmap_set(bmap2
, 0, 23);
180 bitmap_copy(bmap2
, bmap1
, 23);
181 expect_eq_pbl("0-18", bmap2
, 1024);
183 /* multi-word bitmaps */
184 bitmap_set(bmap1
, 0, 109);
185 bitmap_copy(bmap2
, bmap1
, 1024);
186 expect_eq_pbl("0-108", bmap2
, 1024);
188 bitmap_fill(bmap2
, 1024);
189 bitmap_copy(bmap2
, bmap1
, 1024);
190 expect_eq_pbl("0-108", bmap2
, 1024);
192 /* the following tests assume a 32- or 64-bit arch (even 128b
196 bitmap_fill(bmap2
, 1024);
197 bitmap_copy(bmap2
, bmap1
, 109); /* ... but 0-padded til word length */
198 expect_eq_pbl("0-108,128-1023", bmap2
, 1024);
200 bitmap_fill(bmap2
, 1024);
201 bitmap_copy(bmap2
, bmap1
, 97); /* ... but aligned on word length */
202 expect_eq_pbl("0-108,128-1023", bmap2
, 1024);
205 #define PARSE_TIME 0x1
207 struct test_bitmap_parselist
{
210 const unsigned long *expected
;
215 static const unsigned long exp
[] __initconst
= {
218 BITMAP_FROM_U64(0x0000ffff),
219 BITMAP_FROM_U64(0xffff0000),
220 BITMAP_FROM_U64(0x55555555),
221 BITMAP_FROM_U64(0xaaaaaaaa),
222 BITMAP_FROM_U64(0x11111111),
223 BITMAP_FROM_U64(0x22222222),
224 BITMAP_FROM_U64(0xffffffff),
225 BITMAP_FROM_U64(0xfffffffe),
226 BITMAP_FROM_U64(0x3333333311111111ULL
),
227 BITMAP_FROM_U64(0xffffffff77777777ULL
)
230 static const unsigned long exp2
[] __initconst
= {
231 BITMAP_FROM_U64(0x3333333311111111ULL
),
232 BITMAP_FROM_U64(0xffffffff77777777ULL
)
235 static const struct test_bitmap_parselist parselist_tests
[] __initconst
= {
236 #define step (sizeof(u64) / sizeof(unsigned long))
238 {0, "0", &exp
[0], 8, 0},
239 {0, "1", &exp
[1 * step
], 8, 0},
240 {0, "0-15", &exp
[2 * step
], 32, 0},
241 {0, "16-31", &exp
[3 * step
], 32, 0},
242 {0, "0-31:1/2", &exp
[4 * step
], 32, 0},
243 {0, "1-31:1/2", &exp
[5 * step
], 32, 0},
244 {0, "0-31:1/4", &exp
[6 * step
], 32, 0},
245 {0, "1-31:1/4", &exp
[7 * step
], 32, 0},
246 {0, "0-31:4/4", &exp
[8 * step
], 32, 0},
247 {0, "1-31:4/4", &exp
[9 * step
], 32, 0},
248 {0, "0-31:1/4,32-63:2/4", &exp
[10 * step
], 64, 0},
249 {0, "0-31:3/4,32-63:4/4", &exp
[11 * step
], 64, 0},
251 {0, "0-31:1/4,32-63:2/4,64-95:3/4,96-127:4/4", exp2
, 128, 0},
253 {0, "0-2047:128/256", NULL
, 2048, PARSE_TIME
},
255 {-EINVAL
, "-1", NULL
, 8, 0},
256 {-EINVAL
, "-0", NULL
, 8, 0},
257 {-EINVAL
, "10-1", NULL
, 8, 0},
258 {-EINVAL
, "0-31:10/1", NULL
, 8, 0},
261 static void __init
test_bitmap_parselist(void)
266 DECLARE_BITMAP(bmap
, 2048);
268 for (i
= 0; i
< ARRAY_SIZE(parselist_tests
); i
++) {
269 #define ptest parselist_tests[i]
271 cycles
= get_cycles();
272 err
= bitmap_parselist(ptest
.in
, bmap
, ptest
.nbits
);
273 cycles
= get_cycles() - cycles
;
275 if (err
!= ptest
.errno
) {
276 pr_err("test %d: input is %s, errno is %d, expected %d\n",
277 i
, ptest
.in
, err
, ptest
.errno
);
281 if (!err
&& ptest
.expected
282 && !__bitmap_equal(bmap
, ptest
.expected
, ptest
.nbits
)) {
283 pr_err("test %d: input is %s, result is 0x%lx, expected 0x%lx\n",
284 i
, ptest
.in
, bmap
[0], *ptest
.expected
);
288 if (ptest
.flags
& PARSE_TIME
)
289 pr_err("test %d: input is '%s' OK, Time: %llu\n",
291 (unsigned long long)cycles
);
295 static void __init
test_bitmap_arr32(void)
297 unsigned int nbits
, next_bit
, len
= sizeof(exp
) * 8;
298 u32 arr
[sizeof(exp
) / 4];
299 DECLARE_BITMAP(bmap2
, len
);
301 memset(arr
, 0xa5, sizeof(arr
));
303 for (nbits
= 0; nbits
< len
; ++nbits
) {
304 bitmap_to_arr32(arr
, exp
, nbits
);
305 bitmap_from_arr32(bmap2
, arr
, nbits
);
306 expect_eq_bitmap(bmap2
, exp
, nbits
);
308 next_bit
= find_next_bit(bmap2
,
309 round_up(nbits
, BITS_PER_LONG
), nbits
);
310 if (next_bit
< round_up(nbits
, BITS_PER_LONG
))
311 pr_err("bitmap_copy_arr32(nbits == %d:"
312 " tail is not safely cleared: %d\n",
315 if (nbits
< len
- 32)
316 expect_eq_uint(arr
[DIV_ROUND_UP(nbits
, 32)],
321 static void noinline __init
test_mem_optimisations(void)
323 DECLARE_BITMAP(bmap1
, 1024);
324 DECLARE_BITMAP(bmap2
, 1024);
325 unsigned int start
, nbits
;
327 for (start
= 0; start
< 1024; start
+= 8) {
328 memset(bmap1
, 0x5a, sizeof(bmap1
));
329 memset(bmap2
, 0x5a, sizeof(bmap2
));
330 for (nbits
= 0; nbits
< 1024 - start
; nbits
+= 8) {
331 bitmap_set(bmap1
, start
, nbits
);
332 __bitmap_set(bmap2
, start
, nbits
);
333 if (!bitmap_equal(bmap1
, bmap2
, 1024))
334 printk("set not equal %d %d\n", start
, nbits
);
335 if (!__bitmap_equal(bmap1
, bmap2
, 1024))
336 printk("set not __equal %d %d\n", start
, nbits
);
338 bitmap_clear(bmap1
, start
, nbits
);
339 __bitmap_clear(bmap2
, start
, nbits
);
340 if (!bitmap_equal(bmap1
, bmap2
, 1024))
341 printk("clear not equal %d %d\n", start
, nbits
);
342 if (!__bitmap_equal(bmap1
, bmap2
, 1024))
343 printk("clear not __equal %d %d\n", start
,
349 static int __init
test_bitmap_init(void)
355 test_bitmap_parselist();
356 test_mem_optimisations();
358 if (failed_tests
== 0)
359 pr_info("all %u tests passed\n", total_tests
);
361 pr_warn("failed %u out of %u tests\n",
362 failed_tests
, total_tests
);
364 return failed_tests
? -EINVAL
: 0;
367 static void __exit
test_bitmap_cleanup(void)
371 module_init(test_bitmap_init
);
372 module_exit(test_bitmap_cleanup
);
374 MODULE_AUTHOR("david decotigny <david.decotigny@googlers.com>");
375 MODULE_LICENSE("GPL");