Searched refs:bitmap2 (Results 1 – 2 of 2) sorted by relevance
| /lib/ |
| A D | find_bit_benchmark.c | 30 static DECLARE_BITMAP(bitmap2, BITMAP_LEN) __initdata;
62 i = find_first_and_bit(cp, bitmap2, len); in test_find_first_and_bit()
135 const void *bitmap2, unsigned long len) in test_find_next_and_bit() argument
142 i = find_next_and_bit(bitmap, bitmap2, BITMAP_LEN, i + 1); in test_find_next_and_bit()
156 get_random_bytes(bitmap2, sizeof(bitmap2)); 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()
174 bitmap_zero(bitmap2, BITMAP_LEN); in find_bit_test()
178 __set_bit(get_random_u32_below(BITMAP_LEN), bitmap2); in find_bit_test()
186 test_find_first_and_bit(bitmap, bitmap2, BITMAP_LEN); in find_bit_test()
[all …]
|
| A D | bitmap.c | 42 if (bitmap1[k] != bitmap2[k]) in __bitmap_equal()
54 const unsigned long *bitmap2, in __bitmap_or_equal() argument
62 if ((bitmap1[k] | bitmap2[k]) != bitmap3[k]) in __bitmap_or_equal()
69 tmp = (bitmap1[k] | bitmap2[k]) ^ bitmap3[k]; in __bitmap_or_equal()
237 result |= (dst[k] = bitmap1[k] & bitmap2[k]); in __bitmap_and()
239 result |= (dst[k] = bitmap1[k] & bitmap2[k] & in __bitmap_and()
252 dst[k] = bitmap1[k] | bitmap2[k]; in __bitmap_or()
263 dst[k] = bitmap1[k] ^ bitmap2[k]; in __bitmap_xor()
275 result |= (dst[k] = bitmap1[k] & ~bitmap2[k]); in __bitmap_andnot()
300 if (bitmap1[k] & bitmap2[k]) in __bitmap_intersects()
[all …]
|
Completed in 7 milliseconds