Searched refs:BITWORD_SIZE (Results 1 – 2 of 2) sorted by relevance
30 enum { BITWORD_SIZE = (unsigned)sizeof(BitWord) * CHAR_BIT }; enumerator48 WordRef = &b.Bits[Idx / BITWORD_SIZE]; in reference()49 BitPos = Idx % BITWORD_SIZE; in reference()156 return i * BITWORD_SIZE + CountTrailingZeros_32((uint32_t)Bits[i]); in find_first()158 return i * BITWORD_SIZE + CountTrailingZeros_64(Bits[i]); in find_first()171 unsigned WordPos = Prev / BITWORD_SIZE; in find_next()172 unsigned BitPos = Prev % BITWORD_SIZE; in find_next()179 return WordPos * BITWORD_SIZE + CountTrailingZeros_32((uint32_t)Copy); in find_next()181 return WordPos * BITWORD_SIZE + CountTrailingZeros_64(Copy); in find_next()189 return i * BITWORD_SIZE + CountTrailingZeros_32((uint32_t)Bits[i]); in find_next()[all …]
49 BITWORD_SIZE = sizeof(BitWord) * CHAR_BIT, enumerator50 BITWORDS_PER_ELEMENT = (ElementSize + BITWORD_SIZE - 1) / BITWORD_SIZE,103 Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE);116 Bits[Idx / BITWORD_SIZE] &= ~(1L << (Idx % BITWORD_SIZE));120 return Bits[Idx / BITWORD_SIZE] & (1L << (Idx % BITWORD_SIZE));140 return i * BITWORD_SIZE + CountTrailingZeros_32(Bits[i]);142 return i * BITWORD_SIZE + CountTrailingZeros_64(Bits[i]);154 unsigned WordPos = Curr / BITWORD_SIZE;155 unsigned BitPos = Curr % BITWORD_SIZE;165 return WordPos * BITWORD_SIZE + CountTrailingZeros_32(Copy);[all …]