Home
last modified time | relevance | path

Searched refs:bitmap2 (Results 1 – 6 of 6) sorted by relevance

/linux-6.12.1/lib/
Dfind_bit_benchmark.c30 static DECLARE_BITMAP(bitmap2, BITMAP_LEN) __initdata;
52 static int __init test_find_first_and_bit(void *bitmap, const void *bitmap2, unsigned long len) in test_find_first_and_bit() argument
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()
[all …]
Dbitmap.c38 const unsigned long *bitmap2, unsigned int bits) in __bitmap_equal() argument
42 if (bitmap1[k] != bitmap2[k]) in __bitmap_equal()
46 if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) 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()
230 const unsigned long *bitmap2, unsigned int bits) in __bitmap_and() argument
237 result |= (dst[k] = bitmap1[k] & bitmap2[k]); in __bitmap_and()
239 result |= (dst[k] = bitmap1[k] & bitmap2[k] & in __bitmap_and()
246 const unsigned long *bitmap2, unsigned int bits) in __bitmap_or() argument
[all …]
/linux-6.12.1/tools/lib/
Dbitmap.c22 const unsigned long *bitmap2, int bits) in __bitmap_or() argument
28 dst[k] = bitmap1[k] | bitmap2[k]; in __bitmap_or()
61 const unsigned long *bitmap2, unsigned int bits) in __bitmap_and() argument
68 result |= (dst[k] = bitmap1[k] & bitmap2[k]); in __bitmap_and()
70 result |= (dst[k] = bitmap1[k] & bitmap2[k] & in __bitmap_and()
76 const unsigned long *bitmap2, unsigned int bits) in __bitmap_equal() argument
80 if (bitmap1[k] != bitmap2[k]) in __bitmap_equal()
84 if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_equal()
91 const unsigned long *bitmap2, unsigned int bits) in __bitmap_intersects() argument
95 if (bitmap1[k] & bitmap2[k]) in __bitmap_intersects()
[all …]
/linux-6.12.1/tools/testing/selftests/seccomp/
Dseccomp_benchmark.c187 unsigned long long native, filter1, filter2, bitmap1, bitmap2; in main() local
234 bitmap2 = timing(CLOCK_PROCESS_CPUTIME_ID, samples) / samples; in main()
235 ksft_print_msg("getpid RET_ALLOW 2 filters (bitmap): %llu ns\n", bitmap2); in main()
264 bitmap2 - native); in main()
270 bitmap1 - native - (bitmap2 - bitmap1)); in main()
288 bitmap1 - native, approx, bitmap2 - native, skip); in main()
297 bitmap2 - native, skip); in main()
/linux-6.12.1/tools/include/linux/
Dbitmap.h17 const unsigned long *bitmap2, int bits);
19 const unsigned long *bitmap2, unsigned int bits);
21 const unsigned long *bitmap2, unsigned int bits);
24 const unsigned long *bitmap2, unsigned int bits);
/linux-6.12.1/include/linux/
Dbitmap.h151 const unsigned long *bitmap2, unsigned int nbits);
165 const unsigned long *bitmap2, unsigned int nbits);
167 const unsigned long *bitmap2, unsigned int nbits);
169 const unsigned long *bitmap2, unsigned int nbits);
171 const unsigned long *bitmap2, unsigned int nbits);
176 const unsigned long *bitmap2, unsigned int nbits);
178 const unsigned long *bitmap2, unsigned int nbits);
181 const unsigned long *bitmap2, unsigned int nbits);
183 const unsigned long *bitmap2, unsigned int nbits);