Searched refs:BITWORD_SIZE (Results 1 – 8 of 8) sorted by relevance
/external/llvm/include/llvm/ADT/ |
D | BitVector.h | 30 enum { BITWORD_SIZE = (unsigned)sizeof(BitWord) * CHAR_BIT }; enumerator 32 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 …]
|
D | SparseBitVector.h | 49 BITWORD_SIZE = sizeof(BitWord) * CHAR_BIT, enumerator 50 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 …]
|
/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
D | BitVector.h | 31 enum { BITWORD_SIZE = (unsigned)sizeof(BitWord) * CHAR_BIT }; enumerator 33 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 …]
|
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
D | BitVector.h | 76 enum { BITWORD_SIZE = (unsigned)sizeof(BitWord) * CHAR_BIT }; enumerator 78 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 …]
|
D | SparseBitVector.h | 46 BITWORD_SIZE = sizeof(BitWord) * CHAR_BIT, enumerator 47 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 …]
|
/external/llvm-project/llvm/include/llvm/ADT/ |
D | BitVector.h | 77 enum { BITWORD_SIZE = (unsigned)sizeof(BitWord) * CHAR_BIT }; enumerator 79 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 96 WordRef = &b.Bits[Idx / BITWORD_SIZE]; in reference() 97 BitPos = Idx % BITWORD_SIZE; in reference() 190 for (unsigned i = 0; i < Size / BITWORD_SIZE; ++i) in all() 195 if (unsigned Remainder = Size % BITWORD_SIZE) in all() 196 return Bits[Size / BITWORD_SIZE] == (BitWord(1) << Remainder) - 1; in all() 214 unsigned FirstWord = Begin / BITWORD_SIZE; 215 unsigned LastWord = (End - 1) / BITWORD_SIZE; 228 unsigned FirstBit = Begin % BITWORD_SIZE; [all …]
|
D | SparseBitVector.h | 46 BITWORD_SIZE = sizeof(BitWord) * CHAR_BIT, enumerator 47 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 …]
|
/external/swiftshader/third_party/subzero/src/ |
D | IceBitVector.h | 251 enum { BITWORD_SIZE = (unsigned)sizeof(BitWord) * CHAR_BIT }; enumerator 253 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 …]
|