Home
last modified time | relevance | path

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

/linux/tools/lib/
A 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/lib/
A Dfind_bit_benchmark.c30 static DECLARE_BITMAP(bitmap2, BITMAP_LEN) __initdata;
100 const void *bitmap2, unsigned long len) in test_find_next_and_bit() argument
107 i = find_next_and_bit(bitmap, bitmap2, BITMAP_LEN, i + 1); in test_find_next_and_bit()
121 get_random_bytes(bitmap2, sizeof(bitmap2)); in find_bit_test()
132 test_find_next_and_bit(bitmap, bitmap2, BITMAP_LEN); in find_bit_test()
137 bitmap_zero(bitmap2, BITMAP_LEN); in find_bit_test()
141 __set_bit(prandom_u32() % BITMAP_LEN, bitmap2); in find_bit_test()
148 test_find_next_and_bit(bitmap, bitmap2, BITMAP_LEN); in find_bit_test()
A Dbitmap.c49 const unsigned long *bitmap2, unsigned int bits) in __bitmap_equal() argument
53 if (bitmap1[k] != bitmap2[k]) in __bitmap_equal()
65 const unsigned long *bitmap2, in __bitmap_or_equal() argument
73 if ((bitmap1[k] | bitmap2[k]) != bitmap3[k]) in __bitmap_or_equal()
80 tmp = (bitmap1[k] | bitmap2[k]) ^ bitmap3[k]; in __bitmap_or_equal()
248 result |= (dst[k] = bitmap1[k] & bitmap2[k]); in __bitmap_and()
250 result |= (dst[k] = bitmap1[k] & bitmap2[k] & in __bitmap_and()
263 dst[k] = bitmap1[k] | bitmap2[k]; in __bitmap_or()
274 dst[k] = bitmap1[k] ^ bitmap2[k]; in __bitmap_xor()
311 if (bitmap1[k] & bitmap2[k]) in __bitmap_intersects()
[all …]
/linux/tools/testing/selftests/seccomp/
A Dseccomp_benchmark.c143 unsigned long long native, filter1, filter2, bitmap1, bitmap2; in main() local
181 bitmap2 = timing(CLOCK_PROCESS_CPUTIME_ID, samples) / samples; in main()
182 printf("getpid RET_ALLOW 2 filters (bitmap): %llu ns\n", bitmap2); in main()
209 bitmap2 - native); in main()
215 bitmap1 - native - (bitmap2 - bitmap1)); in main()
231 bitmap1 - native, approx, bitmap2 - native); in main()
238 ret |= compare("entry", "≈", "2 bitmapped", entry, approx, bitmap2 - native); in main()
/linux/tools/include/linux/
A Dbitmap.h15 const unsigned long *bitmap2, int bits);
17 const unsigned long *bitmap2, unsigned int bits);
19 const unsigned long *bitmap2, unsigned int bits);
22 const unsigned long *bitmap2, unsigned int bits);
/linux/include/linux/
A Dbitmap.h141 const unsigned long *bitmap2, unsigned int nbits);
155 const unsigned long *bitmap2, unsigned int nbits);
157 const unsigned long *bitmap2, unsigned int nbits);
159 const unsigned long *bitmap2, unsigned int nbits);
161 const unsigned long *bitmap2, unsigned int nbits);
166 const unsigned long *bitmap2, unsigned int nbits);
168 const unsigned long *bitmap2, unsigned int nbits);

Completed in 11 milliseconds