Home
last modified time | relevance | path

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

/linux-4.19.296/lib/
Dfind_bit_benchmark.c38 static DECLARE_BITMAP(bitmap2, BITMAP_LEN) __initdata;
108 const void *bitmap2, unsigned long len) in test_find_next_and_bit() argument
115 i = find_next_and_bit(bitmap, bitmap2, BITMAP_LEN, i+1); in test_find_next_and_bit()
130 get_random_bytes(bitmap2, sizeof(bitmap2)); in find_bit_test()
141 test_find_next_and_bit(bitmap, bitmap2, BITMAP_LEN); in find_bit_test()
146 bitmap_zero(bitmap2, BITMAP_LEN); in find_bit_test()
150 __set_bit(prandom_u32() % BITMAP_LEN, bitmap2); in find_bit_test()
157 test_find_next_and_bit(bitmap, bitmap2, BITMAP_LEN); in find_bit_test()
Dbitmap.c52 const unsigned long *bitmap2, unsigned int bits) in __bitmap_equal() argument
56 if (bitmap1[k] != bitmap2[k]) in __bitmap_equal()
60 if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_equal()
157 const unsigned long *bitmap2, unsigned int bits) in __bitmap_and() argument
164 result |= (dst[k] = bitmap1[k] & bitmap2[k]); in __bitmap_and()
166 result |= (dst[k] = bitmap1[k] & bitmap2[k] & in __bitmap_and()
173 const unsigned long *bitmap2, unsigned int bits) in __bitmap_or() argument
179 dst[k] = bitmap1[k] | bitmap2[k]; in __bitmap_or()
184 const unsigned long *bitmap2, unsigned int bits) in __bitmap_xor() argument
190 dst[k] = bitmap1[k] ^ bitmap2[k]; in __bitmap_xor()
[all …]
/linux-4.19.296/include/linux/
Dbitmap.h122 const unsigned long *bitmap2, unsigned int nbits);
130 const unsigned long *bitmap2, unsigned int nbits);
132 const unsigned long *bitmap2, unsigned int nbits);
134 const unsigned long *bitmap2, unsigned int nbits);
136 const unsigned long *bitmap2, unsigned int nbits);
138 const unsigned long *bitmap2, unsigned int nbits);
140 const unsigned long *bitmap2, unsigned int nbits);