Searched refs:BITWORD_SIZE (Results 1 – 6 of 6) sorted by relevance
31 enum { BITWORD_SIZE = (unsigned)sizeof(BitWord) * CHAR_BIT }; enumerator33 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32,51 WordRef = &b.Bits[Idx / BITWORD_SIZE]; in reference()52 BitPos = Idx % BITWORD_SIZE; in reference()139 for (unsigned i = 0; i < Size / BITWORD_SIZE; ++i) in all()144 if (unsigned Remainder = Size % BITWORD_SIZE) in all()145 return Bits[Size / BITWORD_SIZE] == (1UL << Remainder) - 1; in all()160 return i * BITWORD_SIZE + countTrailingZeros(Bits[i]); in find_first()171 unsigned WordPos = Prev / BITWORD_SIZE; in find_next()172 unsigned BitPos = Prev % BITWORD_SIZE; in find_next()[all …]
30 enum { BITWORD_SIZE = (unsigned)sizeof(BitWord) * CHAR_BIT }; enumerator32 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32,52 WordRef = &b.Bits[Idx / BITWORD_SIZE]; in reference()53 BitPos = Idx % BITWORD_SIZE; in reference()139 for (unsigned i = 0; i < Size / BITWORD_SIZE; ++i) in all()144 if (unsigned Remainder = Size % BITWORD_SIZE) in all()145 return Bits[Size / BITWORD_SIZE] == (1UL << Remainder) - 1; in all()160 return i * BITWORD_SIZE + countTrailingZeros(Bits[i]); in find_first()171 unsigned WordPos = Prev / BITWORD_SIZE; in find_next()172 unsigned BitPos = Prev % BITWORD_SIZE; 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));134 return i * BITWORD_SIZE + countTrailingZeros(Bits[i]);144 unsigned WordPos = Curr / BITWORD_SIZE;145 unsigned BitPos = Curr % BITWORD_SIZE;154 return WordPos * BITWORD_SIZE + countTrailingZeros(Copy);159 return i * BITWORD_SIZE + countTrailingZeros(Bits[i]);[all …]
76 enum { BITWORD_SIZE = (unsigned)sizeof(BitWord) * CHAR_BIT }; enumerator78 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32,95 WordRef = &b.Bits[Idx / BITWORD_SIZE]; in reference()96 BitPos = Idx % BITWORD_SIZE; in reference()189 for (unsigned i = 0; i < Size / BITWORD_SIZE; ++i) in all()194 if (unsigned Remainder = Size % BITWORD_SIZE) in all()195 return Bits[Size / BITWORD_SIZE] == (BitWord(1) << Remainder) - 1; in all()212 unsigned FirstWord = Begin / BITWORD_SIZE; in find_first_in()213 unsigned LastWord = (End - 1) / BITWORD_SIZE; in find_first_in()220 unsigned FirstBit = Begin % BITWORD_SIZE; in find_first_in()[all …]
46 BITWORD_SIZE = sizeof(BitWord) * CHAR_BIT, enumerator47 BITWORDS_PER_ELEMENT = (ElementSize + BITWORD_SIZE - 1) / BITWORD_SIZE,99 Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE); in set()112 Bits[Idx / BITWORD_SIZE] &= ~(1L << (Idx % BITWORD_SIZE)); in reset()116 return Bits[Idx / BITWORD_SIZE] & (1L << (Idx % BITWORD_SIZE)); in test()130 return i * BITWORD_SIZE + countTrailingZeros(Bits[i]); in find_first()139 return Idx * BITWORD_SIZE + BITWORD_SIZE - in find_last()151 unsigned WordPos = Curr / BITWORD_SIZE; in find_next()152 unsigned BitPos = Curr % BITWORD_SIZE; in find_next()161 return WordPos * BITWORD_SIZE + countTrailingZeros(Copy); in find_next()[all …]
251 enum { BITWORD_SIZE = (unsigned)sizeof(BitWord) * CHAR_BIT }; enumerator253 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32,282 WordRef = &b.Bits[Idx / BITWORD_SIZE]; in reference()283 BitPos = Idx % BITWORD_SIZE; in reference()372 for (unsigned i = 0; i < Size / BITWORD_SIZE; ++i) in all()377 if (unsigned Remainder = Size % BITWORD_SIZE) in all()378 return Bits[Size / BITWORD_SIZE] == (1UL << Remainder) - 1; in all()391 return i * BITWORD_SIZE + llvm::countTrailingZeros(Bits[i]); in find_first()402 unsigned WordPos = Prev / BITWORD_SIZE; in find_next()403 unsigned BitPos = Prev % BITWORD_SIZE; in find_next()[all …]