Searched refs:BITSET_WORDBITS (Results 1 – 2 of 2) sorted by relevance
42 #define BITSET_WORDBITS (sizeof (BITSET_WORD) * 8) macro46 #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)126 assert(amount < BITSET_WORDBITS); in __bitset_rotate_right()132 x[i] = (x[i] >> amount) | (x[i + 1] << (BITSET_WORDBITS - amount)); in __bitset_rotate_right()141 assert(amount < BITSET_WORDBITS); in __bitset_rotate_left()147 x[i] = (x[i] << amount) | (x[i - 1] >> (BITSET_WORDBITS - amount)); in __bitset_rotate_left()156 const unsigned int words = amount / BITSET_WORDBITS; in __bitset_shr()[all …]
546 assert(g->alloc % BITSET_WORDBITS == 0); in ra_realloc_interference_graph()547 alloc = align(alloc, BITSET_WORDBITS); in ra_realloc_interference_graph()659 int i = n / BITSET_WORDBITS; in update_pq_info()703 g->tmp.min_q_total[n / BITSET_WORDBITS] = UINT_MAX; in add_node_to_stack()725 const unsigned int top_word_high_bit = (g->count - 1) % BITSET_WORDBITS; in ra_simplify()730 i >= 0; i--, high_bit = BITSET_WORDBITS - 1) { in ra_simplify()737 unsigned int n = i * BITSET_WORDBITS + j; in ra_simplify()753 i >= 0; i--, high_bit = BITSET_WORDBITS - 1) { in ra_simplify()770 unsigned int n = i * BITSET_WORDBITS + j; in ra_simplify()790 unsigned int n = i * BITSET_WORDBITS + j; in ra_simplify()