Lines Matching defs:BITSET_WORDBITS
42 #define BITSET_WORDBITS (sizeof (BITSET_WORD) * 8)
46 #define BITSET_WORDS(bits) (((bits) + BITSET_WORDBITS - 1) / BITSET_WORDBITS)
57 #define BITSET_BITWORD(b) ((b) / BITSET_WORDBITS)
58 #define BITSET_BIT(b) (1u << ((b) % BITSET_WORDBITS))
66 #define BITSET_MASK(b) (((b) % BITSET_WORDBITS == 0) ? ~0 : BITSET_BIT(b) - 1)
112 assert(amount < BITSET_WORDBITS);
118 x[i] = (x[i] >> amount) | (x[i + 1] << (BITSET_WORDBITS - amount));
127 assert(amount < BITSET_WORDBITS);
133 x[i] = (x[i] << amount) | (x[i - 1] >> (BITSET_WORDBITS - amount));
142 const unsigned int words = amount / BITSET_WORDBITS;
156 amount %= BITSET_WORDBITS;
166 const int words = amount / BITSET_WORDBITS;
182 amount %= BITSET_WORDBITS;
213 const unsigned start_mod = start % BITSET_WORDBITS;
215 if (start_mod + size <= BITSET_WORDBITS) {
218 const unsigned first_size = BITSET_WORDBITS - start_mod;
232 const unsigned start_mod = start % BITSET_WORDBITS;
234 if (start_mod + size <= BITSET_WORDBITS) {
237 const unsigned first_size = BITSET_WORDBITS - start_mod;
251 const unsigned start_mod = start % BITSET_WORDBITS;
253 if (start_mod + size <= BITSET_WORDBITS) {
256 const unsigned first_size = BITSET_WORDBITS - start_mod;
272 if ((i + 1) * BITSET_WORDBITS <= b) {
275 prefix += util_bitcount(x[i] & BITFIELD_MASK(b - i * BITSET_WORDBITS));
306 return ffs(x[i]) + BITSET_WORDBITS * i;
319 return util_last_bit(x[i]) + BITSET_WORDBITS * i;
358 return word * BITSET_WORDBITS + bit;
396 *start = word * BITSET_WORDBITS + ffs(tmp) - 1;
421 *end = MIN2(word * BITSET_WORDBITS + ffs(~tmp) - 1, size);