Home
last modified time | relevance | path

Searched refs:BITWORD_SIZE (Results 1 – 8 of 8) sorted by relevance

/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
DBitVector.h31 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/llvm/include/llvm/ADT/
DBitVector.h30 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 …]
DSparseBitVector.h49 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-7.0/llvm/include/llvm/ADT/
DBitVector.h77 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] == (1UL << Remainder) - 1; in all()
213 unsigned FirstWord = Begin / BITWORD_SIZE; in find_first_in()
214 unsigned LastWord = (End - 1) / BITWORD_SIZE; in find_first_in()
221 unsigned FirstBit = Begin % BITWORD_SIZE; in find_first_in()
[all …]
DSparseBitVector.h47 BITWORD_SIZE = sizeof(BitWord) * CHAR_BIT, enumerator
48 BITWORDS_PER_ELEMENT = (ElementSize + BITWORD_SIZE - 1) / BITWORD_SIZE,
100 Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE); in set()
113 Bits[Idx / BITWORD_SIZE] &= ~(1L << (Idx % BITWORD_SIZE)); in reset()
117 return Bits[Idx / BITWORD_SIZE] & (1L << (Idx % BITWORD_SIZE)); in test()
131 return i * BITWORD_SIZE + countTrailingZeros(Bits[i]); in find_first()
140 return Idx * BITWORD_SIZE + BITWORD_SIZE - in find_last()
152 unsigned WordPos = Curr / BITWORD_SIZE; in find_next()
153 unsigned BitPos = Curr % BITWORD_SIZE; in find_next()
162 return WordPos * BITWORD_SIZE + countTrailingZeros(Copy); in find_next()
[all …]
/external/swiftshader/third_party/subzero/src/
DIceBitVector.h251 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 …]
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
DBitVector.h29 enum { BITWORD_SIZE = (unsigned)sizeof(BitWord) * CHAR_BIT }; enumerator
47 WordRef = &b.Bits[Idx / BITWORD_SIZE]; in reference()
48 BitPos = Idx % BITWORD_SIZE; in reference()
148 return i * BITWORD_SIZE + CountTrailingZeros_32((uint32_t)Bits[i]); in find_first()
150 return i * BITWORD_SIZE + CountTrailingZeros_64(Bits[i]); in find_first()
164 unsigned WordPos = Prev / BITWORD_SIZE; in find_next()
165 unsigned BitPos = Prev % BITWORD_SIZE; in find_next()
172 return WordPos * BITWORD_SIZE + CountTrailingZeros_32((uint32_t)Copy); in find_next()
174 return WordPos * BITWORD_SIZE + CountTrailingZeros_64(Copy); in find_next()
183 return i * BITWORD_SIZE + CountTrailingZeros_32((uint32_t)Bits[i]); in find_next()
[all …]
DSparseBitVector.h49 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));
140 return i * BITWORD_SIZE + CountTrailingZeros_32(Bits[i]);
142 return i * BITWORD_SIZE + CountTrailingZeros_64(Bits[i]);
156 unsigned WordPos = Curr / BITWORD_SIZE;
157 unsigned BitPos = Curr % BITWORD_SIZE;
167 return WordPos * BITWORD_SIZE + CountTrailingZeros_32(Copy);
[all …]