1 // SPDX-License-Identifier: GPL-2.0-only
3 * Test cases for bitmap API.
6 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
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>
15 #include <linux/uaccess.h>
17 #include "../tools/testing/selftests/kselftest_module.h"
19 KSTM_MODULE_GLOBALS();
21 static char pbl_buffer
[PAGE_SIZE
] __initdata
;
23 static const unsigned long exp1
[] __initconst
= {
26 BITMAP_FROM_U64(0x0000ffff),
27 BITMAP_FROM_U64(0xffff0000),
28 BITMAP_FROM_U64(0x55555555),
29 BITMAP_FROM_U64(0xaaaaaaaa),
30 BITMAP_FROM_U64(0x11111111),
31 BITMAP_FROM_U64(0x22222222),
32 BITMAP_FROM_U64(0xffffffff),
33 BITMAP_FROM_U64(0xfffffffe),
34 BITMAP_FROM_U64(0x3333333311111111ULL
),
35 BITMAP_FROM_U64(0xffffffff77777777ULL
),
37 BITMAP_FROM_U64(0x00008000),
38 BITMAP_FROM_U64(0x80000000),
41 static const unsigned long exp2
[] __initconst
= {
42 BITMAP_FROM_U64(0x3333333311111111ULL
),
43 BITMAP_FROM_U64(0xffffffff77777777ULL
),
46 /* Fibonacci sequence */
47 static const unsigned long exp2_to_exp3_mask
[] __initconst
= {
48 BITMAP_FROM_U64(0x008000020020212eULL
),
50 /* exp3_0_1 = (exp2[0] & ~exp2_to_exp3_mask) | (exp2[1] & exp2_to_exp3_mask) */
51 static const unsigned long exp3_0_1
[] __initconst
= {
52 BITMAP_FROM_U64(0x33b3333311313137ULL
),
54 /* exp3_1_0 = (exp2[1] & ~exp2_to_exp3_mask) | (exp2[0] & exp2_to_exp3_mask) */
55 static const unsigned long exp3_1_0
[] __initconst
= {
56 BITMAP_FROM_U64(0xff7fffff77575751ULL
),
60 __check_eq_uint(const char *srcfile
, unsigned int line
,
61 const unsigned int exp_uint
, unsigned int x
)
64 pr_err("[%s:%u] expected %u, got %u\n",
65 srcfile
, line
, exp_uint
, x
);
73 __check_eq_bitmap(const char *srcfile
, unsigned int line
,
74 const unsigned long *exp_bmap
, const unsigned long *bmap
,
77 if (!bitmap_equal(exp_bmap
, bmap
, nbits
)) {
78 pr_warn("[%s:%u] bitmaps contents differ: expected \"%*pbl\", got \"%*pbl\"\n",
80 nbits
, exp_bmap
, nbits
, bmap
);
87 __check_eq_pbl(const char *srcfile
, unsigned int line
,
88 const char *expected_pbl
,
89 const unsigned long *bitmap
, unsigned int nbits
)
91 snprintf(pbl_buffer
, sizeof(pbl_buffer
), "%*pbl", nbits
, bitmap
);
92 if (strcmp(expected_pbl
, pbl_buffer
)) {
93 pr_warn("[%s:%u] expected \"%s\", got \"%s\"\n",
95 expected_pbl
, pbl_buffer
);
102 __check_eq_u32_array(const char *srcfile
, unsigned int line
,
103 const u32
*exp_arr
, unsigned int exp_len
,
104 const u32
*arr
, unsigned int len
) __used
;
106 __check_eq_u32_array(const char *srcfile
, unsigned int line
,
107 const u32
*exp_arr
, unsigned int exp_len
,
108 const u32
*arr
, unsigned int len
)
110 if (exp_len
!= len
) {
111 pr_warn("[%s:%u] array length differ: expected %u, got %u\n",
117 if (memcmp(exp_arr
, arr
, len
*sizeof(*arr
))) {
118 pr_warn("[%s:%u] array contents differ\n", srcfile
, line
);
119 print_hex_dump(KERN_WARNING
, " exp: ", DUMP_PREFIX_OFFSET
,
120 32, 4, exp_arr
, exp_len
*sizeof(*exp_arr
), false);
121 print_hex_dump(KERN_WARNING
, " got: ", DUMP_PREFIX_OFFSET
,
122 32, 4, arr
, len
*sizeof(*arr
), false);
129 static bool __init
__check_eq_clump8(const char *srcfile
, unsigned int line
,
130 const unsigned int offset
,
131 const unsigned int size
,
132 const unsigned char *const clump_exp
,
133 const unsigned long *const clump
)
137 if (offset
>= size
) {
138 pr_warn("[%s:%u] bit offset for clump out-of-bounds: expected less than %u, got %u\n",
139 srcfile
, line
, size
, offset
);
143 exp
= clump_exp
[offset
/ 8];
145 pr_warn("[%s:%u] bit offset for zero clump: expected nonzero clump, got bit offset %u with clump value 0",
146 srcfile
, line
, offset
);
151 pr_warn("[%s:%u] expected clump value of 0x%lX, got clump value of 0x%lX",
152 srcfile
, line
, exp
, *clump
);
159 #define __expect_eq(suffix, ...) \
163 if (!__check_eq_ ## suffix(__FILE__, __LINE__, \
171 #define expect_eq_uint(...) __expect_eq(uint, ##__VA_ARGS__)
172 #define expect_eq_bitmap(...) __expect_eq(bitmap, ##__VA_ARGS__)
173 #define expect_eq_pbl(...) __expect_eq(pbl, ##__VA_ARGS__)
174 #define expect_eq_u32_array(...) __expect_eq(u32_array, ##__VA_ARGS__)
175 #define expect_eq_clump8(...) __expect_eq(clump8, ##__VA_ARGS__)
177 static void __init
test_zero_clear(void)
179 DECLARE_BITMAP(bmap
, 1024);
181 /* Known way to set all bits */
182 memset(bmap
, 0xff, 128);
184 expect_eq_pbl("0-22", bmap
, 23);
185 expect_eq_pbl("0-1023", bmap
, 1024);
187 /* single-word bitmaps */
188 bitmap_clear(bmap
, 0, 9);
189 expect_eq_pbl("9-1023", bmap
, 1024);
191 bitmap_zero(bmap
, 35);
192 expect_eq_pbl("64-1023", bmap
, 1024);
194 /* cross boundaries operations */
195 bitmap_clear(bmap
, 79, 19);
196 expect_eq_pbl("64-78,98-1023", bmap
, 1024);
198 bitmap_zero(bmap
, 115);
199 expect_eq_pbl("128-1023", bmap
, 1024);
201 /* Zeroing entire area */
202 bitmap_zero(bmap
, 1024);
203 expect_eq_pbl("", bmap
, 1024);
206 static void __init
test_fill_set(void)
208 DECLARE_BITMAP(bmap
, 1024);
210 /* Known way to clear all bits */
211 memset(bmap
, 0x00, 128);
213 expect_eq_pbl("", bmap
, 23);
214 expect_eq_pbl("", bmap
, 1024);
216 /* single-word bitmaps */
217 bitmap_set(bmap
, 0, 9);
218 expect_eq_pbl("0-8", bmap
, 1024);
220 bitmap_fill(bmap
, 35);
221 expect_eq_pbl("0-63", bmap
, 1024);
223 /* cross boundaries operations */
224 bitmap_set(bmap
, 79, 19);
225 expect_eq_pbl("0-63,79-97", bmap
, 1024);
227 bitmap_fill(bmap
, 115);
228 expect_eq_pbl("0-127", bmap
, 1024);
230 /* Zeroing entire area */
231 bitmap_fill(bmap
, 1024);
232 expect_eq_pbl("0-1023", bmap
, 1024);
235 static void __init
test_copy(void)
237 DECLARE_BITMAP(bmap1
, 1024);
238 DECLARE_BITMAP(bmap2
, 1024);
240 bitmap_zero(bmap1
, 1024);
241 bitmap_zero(bmap2
, 1024);
243 /* single-word bitmaps */
244 bitmap_set(bmap1
, 0, 19);
245 bitmap_copy(bmap2
, bmap1
, 23);
246 expect_eq_pbl("0-18", bmap2
, 1024);
248 bitmap_set(bmap2
, 0, 23);
249 bitmap_copy(bmap2
, bmap1
, 23);
250 expect_eq_pbl("0-18", bmap2
, 1024);
252 /* multi-word bitmaps */
253 bitmap_set(bmap1
, 0, 109);
254 bitmap_copy(bmap2
, bmap1
, 1024);
255 expect_eq_pbl("0-108", bmap2
, 1024);
257 bitmap_fill(bmap2
, 1024);
258 bitmap_copy(bmap2
, bmap1
, 1024);
259 expect_eq_pbl("0-108", bmap2
, 1024);
261 /* the following tests assume a 32- or 64-bit arch (even 128b
265 bitmap_fill(bmap2
, 1024);
266 bitmap_copy(bmap2
, bmap1
, 109); /* ... but 0-padded til word length */
267 expect_eq_pbl("0-108,128-1023", bmap2
, 1024);
269 bitmap_fill(bmap2
, 1024);
270 bitmap_copy(bmap2
, bmap1
, 97); /* ... but aligned on word length */
271 expect_eq_pbl("0-108,128-1023", bmap2
, 1024);
274 #define EXP2_IN_BITS (sizeof(exp2) * 8)
276 static void __init
test_replace(void)
278 unsigned int nbits
= 64;
279 unsigned int nlongs
= DIV_ROUND_UP(nbits
, BITS_PER_LONG
);
280 DECLARE_BITMAP(bmap
, 1024);
282 BUILD_BUG_ON(EXP2_IN_BITS
< nbits
* 2);
284 bitmap_zero(bmap
, 1024);
285 bitmap_replace(bmap
, &exp2
[0 * nlongs
], &exp2
[1 * nlongs
], exp2_to_exp3_mask
, nbits
);
286 expect_eq_bitmap(bmap
, exp3_0_1
, nbits
);
288 bitmap_zero(bmap
, 1024);
289 bitmap_replace(bmap
, &exp2
[1 * nlongs
], &exp2
[0 * nlongs
], exp2_to_exp3_mask
, nbits
);
290 expect_eq_bitmap(bmap
, exp3_1_0
, nbits
);
292 bitmap_fill(bmap
, 1024);
293 bitmap_replace(bmap
, &exp2
[0 * nlongs
], &exp2
[1 * nlongs
], exp2_to_exp3_mask
, nbits
);
294 expect_eq_bitmap(bmap
, exp3_0_1
, nbits
);
296 bitmap_fill(bmap
, 1024);
297 bitmap_replace(bmap
, &exp2
[1 * nlongs
], &exp2
[0 * nlongs
], exp2_to_exp3_mask
, nbits
);
298 expect_eq_bitmap(bmap
, exp3_1_0
, nbits
);
301 #define PARSE_TIME 0x1
304 struct test_bitmap_parselist
{
307 const unsigned long *expected
;
312 static const struct test_bitmap_parselist parselist_tests
[] __initconst
= {
313 #define step (sizeof(u64) / sizeof(unsigned long))
315 {0, "0", &exp1
[0], 8, 0},
316 {0, "1", &exp1
[1 * step
], 8, 0},
317 {0, "0-15", &exp1
[2 * step
], 32, 0},
318 {0, "16-31", &exp1
[3 * step
], 32, 0},
319 {0, "0-31:1/2", &exp1
[4 * step
], 32, 0},
320 {0, "1-31:1/2", &exp1
[5 * step
], 32, 0},
321 {0, "0-31:1/4", &exp1
[6 * step
], 32, 0},
322 {0, "1-31:1/4", &exp1
[7 * step
], 32, 0},
323 {0, "0-31:4/4", &exp1
[8 * step
], 32, 0},
324 {0, "1-31:4/4", &exp1
[9 * step
], 32, 0},
325 {0, "0-31:1/4,32-63:2/4", &exp1
[10 * step
], 64, 0},
326 {0, "0-31:3/4,32-63:4/4", &exp1
[11 * step
], 64, 0},
327 {0, " ,, 0-31:3/4 ,, 32-63:4/4 ,, ", &exp1
[11 * step
], 64, 0},
329 {0, "0-31:1/4,32-63:2/4,64-95:3/4,96-127:4/4", exp2
, 128, 0},
331 {0, "0-2047:128/256", NULL
, 2048, PARSE_TIME
},
333 {0, "", &exp1
[12 * step
], 8, 0},
334 {0, "\n", &exp1
[12 * step
], 8, 0},
335 {0, ",, ,, , , ,", &exp1
[12 * step
], 8, 0},
336 {0, " , ,, , , ", &exp1
[12 * step
], 8, 0},
337 {0, " , ,, , , \n", &exp1
[12 * step
], 8, 0},
339 {0, "0-0", &exp1
[0], 32, 0},
340 {0, "1-1", &exp1
[1 * step
], 32, 0},
341 {0, "15-15", &exp1
[13 * step
], 32, 0},
342 {0, "31-31", &exp1
[14 * step
], 32, 0},
344 {0, "0-0:0/1", &exp1
[12 * step
], 32, 0},
345 {0, "0-0:1/1", &exp1
[0], 32, 0},
346 {0, "0-0:1/31", &exp1
[0], 32, 0},
347 {0, "0-0:31/31", &exp1
[0], 32, 0},
348 {0, "1-1:1/1", &exp1
[1 * step
], 32, 0},
349 {0, "0-15:16/31", &exp1
[2 * step
], 32, 0},
350 {0, "15-15:1/2", &exp1
[13 * step
], 32, 0},
351 {0, "15-15:31/31", &exp1
[13 * step
], 32, 0},
352 {0, "15-31:1/31", &exp1
[13 * step
], 32, 0},
353 {0, "16-31:16/31", &exp1
[3 * step
], 32, 0},
354 {0, "31-31:31/31", &exp1
[14 * step
], 32, 0},
356 {0, "N-N", &exp1
[14 * step
], 32, 0},
357 {0, "0-0:1/N", &exp1
[0], 32, 0},
358 {0, "0-0:N/N", &exp1
[0], 32, 0},
359 {0, "0-15:16/N", &exp1
[2 * step
], 32, 0},
360 {0, "15-15:N/N", &exp1
[13 * step
], 32, 0},
361 {0, "15-N:1/N", &exp1
[13 * step
], 32, 0},
362 {0, "16-N:16/N", &exp1
[3 * step
], 32, 0},
363 {0, "N-N:N/N", &exp1
[14 * step
], 32, 0},
365 {0, "0-N:1/3,1-N:1/3,2-N:1/3", &exp1
[8 * step
], 32, 0},
366 {0, "0-31:1/3,1-31:1/3,2-31:1/3", &exp1
[8 * step
], 32, 0},
367 {0, "1-10:8/12,8-31:24/29,0-31:0/3", &exp1
[9 * step
], 32, 0},
369 {-EINVAL
, "-1", NULL
, 8, 0},
370 {-EINVAL
, "-0", NULL
, 8, 0},
371 {-EINVAL
, "10-1", NULL
, 8, 0},
372 {-ERANGE
, "8-8", NULL
, 8, 0},
373 {-ERANGE
, "0-31", NULL
, 8, 0},
374 {-EINVAL
, "0-31:", NULL
, 32, 0},
375 {-EINVAL
, "0-31:0", NULL
, 32, 0},
376 {-EINVAL
, "0-31:0/", NULL
, 32, 0},
377 {-EINVAL
, "0-31:0/0", NULL
, 32, 0},
378 {-EINVAL
, "0-31:1/0", NULL
, 32, 0},
379 {-EINVAL
, "0-31:10/1", NULL
, 32, 0},
380 {-EOVERFLOW
, "0-98765432123456789:10/1", NULL
, 8, 0},
382 {-EINVAL
, "a-31", NULL
, 8, 0},
383 {-EINVAL
, "0-a1", NULL
, 8, 0},
384 {-EINVAL
, "a-31:10/1", NULL
, 8, 0},
385 {-EINVAL
, "0-31:a/1", NULL
, 8, 0},
386 {-EINVAL
, "0-\n", NULL
, 8, 0},
390 static void __init
test_bitmap_parselist(void)
395 DECLARE_BITMAP(bmap
, 2048);
397 for (i
= 0; i
< ARRAY_SIZE(parselist_tests
); i
++) {
398 #define ptest parselist_tests[i]
401 err
= bitmap_parselist(ptest
.in
, bmap
, ptest
.nbits
);
402 time
= ktime_get() - time
;
404 if (err
!= ptest
.errno
) {
405 pr_err("parselist: %d: input is %s, errno is %d, expected %d\n",
406 i
, ptest
.in
, err
, ptest
.errno
);
410 if (!err
&& ptest
.expected
411 && !__bitmap_equal(bmap
, ptest
.expected
, ptest
.nbits
)) {
412 pr_err("parselist: %d: input is %s, result is 0x%lx, expected 0x%lx\n",
413 i
, ptest
.in
, bmap
[0],
418 if (ptest
.flags
& PARSE_TIME
)
419 pr_err("parselist: %d: input is '%s' OK, Time: %llu\n",
426 static const unsigned long parse_test
[] __initconst
= {
429 BITMAP_FROM_U64(0xdeadbeef),
430 BITMAP_FROM_U64(0x100000000ULL
),
433 static const unsigned long parse_test2
[] __initconst
= {
434 BITMAP_FROM_U64(0x100000000ULL
), BITMAP_FROM_U64(0xdeadbeef),
435 BITMAP_FROM_U64(0x100000000ULL
), BITMAP_FROM_U64(0xbaadf00ddeadbeef),
436 BITMAP_FROM_U64(0x100000000ULL
), BITMAP_FROM_U64(0x0badf00ddeadbeef),
439 static const struct test_bitmap_parselist parse_tests
[] __initconst
= {
440 {0, "", &parse_test
[0 * step
], 32, 0},
441 {0, " ", &parse_test
[0 * step
], 32, 0},
442 {0, "0", &parse_test
[0 * step
], 32, 0},
443 {0, "0\n", &parse_test
[0 * step
], 32, 0},
444 {0, "1", &parse_test
[1 * step
], 32, 0},
445 {0, "deadbeef", &parse_test
[2 * step
], 32, 0},
446 {0, "1,0", &parse_test
[3 * step
], 33, 0},
447 {0, "deadbeef,\n,0,1", &parse_test
[2 * step
], 96, 0},
449 {0, "deadbeef,1,0", &parse_test2
[0 * 2 * step
], 96, 0},
450 {0, "baadf00d,deadbeef,1,0", &parse_test2
[1 * 2 * step
], 128, 0},
451 {0, "badf00d,deadbeef,1,0", &parse_test2
[2 * 2 * step
], 124, 0},
452 {0, "badf00d,deadbeef,1,0", &parse_test2
[2 * 2 * step
], 124, NO_LEN
},
453 {0, " badf00d,deadbeef,1,0 ", &parse_test2
[2 * 2 * step
], 124, 0},
454 {0, " , badf00d,deadbeef,1,0 , ", &parse_test2
[2 * 2 * step
], 124, 0},
455 {0, " , badf00d, ,, ,,deadbeef,1,0 , ", &parse_test2
[2 * 2 * step
], 124, 0},
457 {-EINVAL
, "goodfood,deadbeef,1,0", NULL
, 128, 0},
458 {-EOVERFLOW
, "3,0", NULL
, 33, 0},
459 {-EOVERFLOW
, "123badf00d,deadbeef,1,0", NULL
, 128, 0},
460 {-EOVERFLOW
, "badf00d,deadbeef,1,0", NULL
, 90, 0},
461 {-EOVERFLOW
, "fbadf00d,deadbeef,1,0", NULL
, 95, 0},
462 {-EOVERFLOW
, "badf00d,deadbeef,1,0", NULL
, 100, 0},
466 static void __init
test_bitmap_parse(void)
471 DECLARE_BITMAP(bmap
, 2048);
473 for (i
= 0; i
< ARRAY_SIZE(parse_tests
); i
++) {
474 struct test_bitmap_parselist test
= parse_tests
[i
];
475 size_t len
= test
.flags
& NO_LEN
? UINT_MAX
: strlen(test
.in
);
478 err
= bitmap_parse(test
.in
, len
, bmap
, test
.nbits
);
479 time
= ktime_get() - time
;
481 if (err
!= test
.errno
) {
482 pr_err("parse: %d: input is %s, errno is %d, expected %d\n",
483 i
, test
.in
, err
, test
.errno
);
487 if (!err
&& test
.expected
488 && !__bitmap_equal(bmap
, test
.expected
, test
.nbits
)) {
489 pr_err("parse: %d: input is %s, result is 0x%lx, expected 0x%lx\n",
495 if (test
.flags
& PARSE_TIME
)
496 pr_err("parse: %d: input is '%s' OK, Time: %llu\n",
501 #define EXP1_IN_BITS (sizeof(exp1) * 8)
503 static void __init
test_bitmap_arr32(void)
505 unsigned int nbits
, next_bit
;
506 u32 arr
[EXP1_IN_BITS
/ 32];
507 DECLARE_BITMAP(bmap2
, EXP1_IN_BITS
);
509 memset(arr
, 0xa5, sizeof(arr
));
511 for (nbits
= 0; nbits
< EXP1_IN_BITS
; ++nbits
) {
512 bitmap_to_arr32(arr
, exp1
, nbits
);
513 bitmap_from_arr32(bmap2
, arr
, nbits
);
514 expect_eq_bitmap(bmap2
, exp1
, nbits
);
516 next_bit
= find_next_bit(bmap2
,
517 round_up(nbits
, BITS_PER_LONG
), nbits
);
518 if (next_bit
< round_up(nbits
, BITS_PER_LONG
))
519 pr_err("bitmap_copy_arr32(nbits == %d:"
520 " tail is not safely cleared: %d\n",
523 if (nbits
< EXP1_IN_BITS
- 32)
524 expect_eq_uint(arr
[DIV_ROUND_UP(nbits
, 32)],
529 static void noinline __init
test_mem_optimisations(void)
531 DECLARE_BITMAP(bmap1
, 1024);
532 DECLARE_BITMAP(bmap2
, 1024);
533 unsigned int start
, nbits
;
535 for (start
= 0; start
< 1024; start
+= 8) {
536 for (nbits
= 0; nbits
< 1024 - start
; nbits
+= 8) {
537 memset(bmap1
, 0x5a, sizeof(bmap1
));
538 memset(bmap2
, 0x5a, sizeof(bmap2
));
540 bitmap_set(bmap1
, start
, nbits
);
541 __bitmap_set(bmap2
, start
, nbits
);
542 if (!bitmap_equal(bmap1
, bmap2
, 1024)) {
543 printk("set not equal %d %d\n", start
, nbits
);
546 if (!__bitmap_equal(bmap1
, bmap2
, 1024)) {
547 printk("set not __equal %d %d\n", start
, nbits
);
551 bitmap_clear(bmap1
, start
, nbits
);
552 __bitmap_clear(bmap2
, start
, nbits
);
553 if (!bitmap_equal(bmap1
, bmap2
, 1024)) {
554 printk("clear not equal %d %d\n", start
, nbits
);
557 if (!__bitmap_equal(bmap1
, bmap2
, 1024)) {
558 printk("clear not __equal %d %d\n", start
,
566 static const unsigned char clump_exp
[] __initconst
= {
567 0x01, /* 1 bit set */
568 0x02, /* non-edge 1 bit set */
569 0x00, /* zero bits set */
570 0x38, /* 3 bits set across 4-bit boundary */
571 0x38, /* Repeated clump */
572 0x0F, /* 4 bits set */
573 0xFF, /* all bits set */
574 0x05, /* non-adjacent 2 bits set */
577 static void __init
test_for_each_set_clump8(void)
579 #define CLUMP_EXP_NUMBITS 64
580 DECLARE_BITMAP(bits
, CLUMP_EXP_NUMBITS
);
584 /* set bitmap to test case */
585 bitmap_zero(bits
, CLUMP_EXP_NUMBITS
);
586 bitmap_set(bits
, 0, 1); /* 0x01 */
587 bitmap_set(bits
, 9, 1); /* 0x02 */
588 bitmap_set(bits
, 27, 3); /* 0x28 */
589 bitmap_set(bits
, 35, 3); /* 0x28 */
590 bitmap_set(bits
, 40, 4); /* 0x0F */
591 bitmap_set(bits
, 48, 8); /* 0xFF */
592 bitmap_set(bits
, 56, 1); /* 0x05 - part 1 */
593 bitmap_set(bits
, 58, 1); /* 0x05 - part 2 */
595 for_each_set_clump8(start
, clump
, bits
, CLUMP_EXP_NUMBITS
)
596 expect_eq_clump8(start
, CLUMP_EXP_NUMBITS
, clump_exp
, &clump
);
599 struct test_bitmap_cut
{
604 unsigned long expected
[4];
607 static struct test_bitmap_cut test_cut
[] = {
608 { 0, 0, 8, { 0x0000000aUL
, }, { 0x0000000aUL
, }, },
609 { 0, 0, 32, { 0xdadadeadUL
, }, { 0xdadadeadUL
, }, },
610 { 0, 3, 8, { 0x000000aaUL
, }, { 0x00000015UL
, }, },
611 { 3, 3, 8, { 0x000000aaUL
, }, { 0x00000012UL
, }, },
612 { 0, 1, 32, { 0xa5a5a5a5UL
, }, { 0x52d2d2d2UL
, }, },
613 { 0, 8, 32, { 0xdeadc0deUL
, }, { 0x00deadc0UL
, }, },
614 { 1, 1, 32, { 0x5a5a5a5aUL
, }, { 0x2d2d2d2cUL
, }, },
615 { 0, 15, 32, { 0xa5a5a5a5UL
, }, { 0x00014b4bUL
, }, },
616 { 0, 16, 32, { 0xa5a5a5a5UL
, }, { 0x0000a5a5UL
, }, },
617 { 15, 15, 32, { 0xa5a5a5a5UL
, }, { 0x000125a5UL
, }, },
618 { 15, 16, 32, { 0xa5a5a5a5UL
, }, { 0x0000a5a5UL
, }, },
619 { 16, 15, 32, { 0xa5a5a5a5UL
, }, { 0x0001a5a5UL
, }, },
621 { BITS_PER_LONG
, BITS_PER_LONG
, BITS_PER_LONG
,
622 { 0xa5a5a5a5UL
, 0xa5a5a5a5UL
, },
623 { 0xa5a5a5a5UL
, 0xa5a5a5a5UL
, },
625 { 1, BITS_PER_LONG
- 1, BITS_PER_LONG
,
626 { 0xa5a5a5a5UL
, 0xa5a5a5a5UL
, },
627 { 0x00000001UL
, 0x00000001UL
, },
630 { 0, BITS_PER_LONG
* 2, BITS_PER_LONG
* 2 + 1,
631 { 0xa5a5a5a5UL
, 0x00000001UL
, 0x00000001UL
, 0x00000001UL
},
634 { 16, BITS_PER_LONG
* 2 + 1, BITS_PER_LONG
* 2 + 1 + 16,
635 { 0x0000ffffUL
, 0x5a5a5a5aUL
, 0x5a5a5a5aUL
, 0x5a5a5a5aUL
},
640 static void __init
test_bitmap_cut(void)
642 unsigned long b
[5], *in
= &b
[1], *out
= &b
[0]; /* Partial overlap */
645 for (i
= 0; i
< ARRAY_SIZE(test_cut
); i
++) {
646 struct test_bitmap_cut
*t
= &test_cut
[i
];
648 memcpy(in
, t
->in
, sizeof(t
->in
));
650 bitmap_cut(out
, in
, t
->first
, t
->cut
, t
->nbits
);
652 expect_eq_bitmap(t
->expected
, out
, t
->nbits
);
656 static void __init
selftest(void)
664 test_bitmap_parselist();
665 test_mem_optimisations();
666 test_for_each_set_clump8();
670 KSTM_MODULE_LOADERS(test_bitmap
);
671 MODULE_AUTHOR("david decotigny <david.decotigny@googlers.com>");
672 MODULE_LICENSE("GPL");