Home
last modified time | relevance | path

Searched refs:BITMAP_LEN (Results 1 - 2 of 2) sorted by relevance

/kernel/linux/linux-6.6/lib/
H A Dfind_bit_benchmark.c26 #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, in test_find_next_and_bit()
[all...]
/kernel/linux/linux-5.10/lib/
H A Dfind_bit_benchmark.c26 #define BITMAP_LEN (4096UL * 8 * 10) macro
29 static DECLARE_BITMAP(bitmap, BITMAP_LEN) __initdata;
30 static DECLARE_BITMAP(bitmap2, BITMAP_LEN) __initdata;
58 for (cnt = i = 0; i < BITMAP_LEN; cnt++) in test_find_next_bit()
59 i = find_next_bit(bitmap, BITMAP_LEN, i) + 1; in test_find_next_bit()
72 for (cnt = i = 0; i < BITMAP_LEN; cnt++) in test_find_next_zero_bit()
106 for (cnt = i = 0; i < BITMAP_LEN; cnt++) in test_find_next_and_bit()
107 i = find_next_and_bit(bitmap, bitmap2, BITMAP_LEN, i + 1); in test_find_next_and_bit()
116 unsigned long nbits = BITMAP_LEN / SPARSE; in find_bit_test()
123 test_find_next_bit(bitmap, BITMAP_LEN); in find_bit_test()
[all...]

Completed in 1 milliseconds