/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/ADT/ |
H A D | BitVector.h | 79 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 351 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 362 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 374 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 390 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 401 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 413 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 431 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 569 wordShr(N / BITWORD_SIZE); 618 wordShl(N / BITWORD_SIZE); [all …]
|
H A 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() 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() 260 BITWORD_SIZE = SparseBitVectorElement<ElementSize>::BITWORD_SIZE enumerator 350 Bits >>= BitPos % BITWORD_SIZE; in AdvanceToFirstNonZero() [all …]
|
/dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/ADT/ |
H A D | BitVector.h | 79 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 351 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 362 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 374 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 390 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 401 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 413 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 431 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 569 wordShr(N / BITWORD_SIZE); 618 wordShl(N / BITWORD_SIZE); [all …]
|
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/include/llvm/ADT/ |
H A D | BitVector.h | 79 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 351 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 362 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 374 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 390 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 401 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 413 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 431 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 569 wordShr(N / BITWORD_SIZE); 618 wordShl(N / BITWORD_SIZE); [all …]
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/include/llvm/ADT/ |
H A D | BitVector.h | 79 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 351 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 362 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 374 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 390 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 401 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 413 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 431 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 569 wordShr(N / BITWORD_SIZE); 618 wordShl(N / BITWORD_SIZE); [all …]
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/ |
H A D | BitVector.h | 79 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 351 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 362 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 374 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 390 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 401 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 413 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 431 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 569 wordShr(N / BITWORD_SIZE); 618 wordShl(N / BITWORD_SIZE); [all …]
|
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/ |
H A D | BitVector.h | 79 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 351 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 362 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 374 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 390 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 401 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 413 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 431 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 569 wordShr(N / BITWORD_SIZE); 618 wordShl(N / BITWORD_SIZE); [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
H A D | BitVector.h | 33 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 52 BitPos = Idx % BITWORD_SIZE; in reference() 227 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 238 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 248 I = alignTo(I, BITWORD_SIZE); in set() 250 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 266 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 277 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 289 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 307 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() [all …]
|
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/include/llvm/ADT/ |
H A D | BitVector.h | 79 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 406 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 417 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 429 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 445 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 456 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 468 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 486 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 613 wordShr(N / BITWORD_SIZE); 662 wordShl(N / BITWORD_SIZE); [all …]
|
/dports/devel/llvm10/llvm-10.0.1.src/include/llvm/ADT/ |
H A D | BitVector.h | 78 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 405 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 416 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 428 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 444 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 455 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 467 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 485 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 626 wordShr(N / BITWORD_SIZE); 675 wordShl(N / BITWORD_SIZE); [all …]
|
/dports/devel/llvm11/llvm-11.0.1.src/include/llvm/ADT/ |
H A D | BitVector.h | 79 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 406 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 417 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 429 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 445 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 456 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 468 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 486 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 613 wordShr(N / BITWORD_SIZE); 662 wordShl(N / BITWORD_SIZE); [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
H A D | BitVector.h | 78 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 405 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 416 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 428 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 444 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 455 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 467 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 485 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 626 wordShr(N / BITWORD_SIZE); 675 wordShl(N / BITWORD_SIZE); [all …]
|
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/include/llvm/ADT/ |
H A D | BitVector.h | 78 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 405 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 416 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 428 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 444 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 455 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 467 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 485 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 626 wordShr(N / BITWORD_SIZE); 675 wordShl(N / BITWORD_SIZE); [all …]
|
/dports/devel/llvm90/llvm-9.0.1.src/include/llvm/ADT/ |
H A D | BitVector.h | 78 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 405 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 416 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 428 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 444 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 455 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 467 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 485 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 626 wordShr(N / BITWORD_SIZE); 675 wordShl(N / BITWORD_SIZE); [all …]
|
/dports/devel/llvm80/llvm-8.0.1.src/include/llvm/ADT/ |
H A D | BitVector.h | 79 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 406 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 417 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 429 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 445 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 456 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 468 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 486 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 627 wordShr(N / BITWORD_SIZE); 676 wordShl(N / BITWORD_SIZE); [all …]
|
/dports/devel/llvm70/llvm-7.0.1.src/include/llvm/ADT/ |
H A D | BitVector.h | 79 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 406 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 417 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 429 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 445 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 456 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 468 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 486 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 610 wordShr(N / BITWORD_SIZE); 659 wordShl(N / BITWORD_SIZE); [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/ADT/ |
H A D | BitVector.h | 79 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 388 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 399 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 411 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 427 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 438 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 450 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 468 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 595 wordShr(N / BITWORD_SIZE); 644 wordShl(N / BITWORD_SIZE); [all …]
|
H A 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() 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() 260 BITWORD_SIZE = SparseBitVectorElement<ElementSize>::BITWORD_SIZE enumerator 350 Bits >>= BitPos % BITWORD_SIZE; in AdvanceToFirstNonZero() [all …]
|
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/include/llvm/ADT/ |
H A D | BitVector.h | 79 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 388 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 399 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 411 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 427 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 438 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 450 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 468 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 595 wordShr(N / BITWORD_SIZE); 644 wordShl(N / BITWORD_SIZE); [all …]
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/include/llvm/ADT/ |
H A D | BitVector.h | 79 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 388 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 399 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 411 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 427 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 438 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 450 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 468 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() 595 wordShr(N / BITWORD_SIZE); 644 wordShl(N / BITWORD_SIZE); [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/subzero/src/ |
H A D | IceBitVector.h | 253 static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32, 283 BitPos = Idx % BITWORD_SIZE; in reference() 456 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set() 468 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in set() 478 I = alignTo(I, BITWORD_SIZE); in set() 480 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in set() 496 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset() 508 if (I / BITWORD_SIZE == E / BITWORD_SIZE) { in reset() 520 for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE) in reset() 538 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip() [all …]
|
/dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/include/llvm/ADT/ |
H A D | BitVector.h | 46 WordRef = &b.Bits[Idx / BITWORD_SIZE]; in reference() 47 BitPos = Idx % BITWORD_SIZE; in reference() 157 unsigned WordPos = Prev / BITWORD_SIZE; in find_next() 158 unsigned BitPos = Prev % BITWORD_SIZE; in find_next() 192 if (N > Capacity * BITWORD_SIZE) { 212 if (N > Capacity * BITWORD_SIZE) in reserve() 224 Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE); in set() 234 Bits[Idx / BITWORD_SIZE] &= ~(1L << (Idx % BITWORD_SIZE)); in reset() 246 Bits[Idx / BITWORD_SIZE] ^= 1L << (Idx % BITWORD_SIZE); in flip() 336 if (Size <= Capacity * BITWORD_SIZE) { [all …]
|
H A 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)); 156 unsigned WordPos = Curr / BITWORD_SIZE; 157 unsigned BitPos = Curr % BITWORD_SIZE; 284 BITWORD_SIZE = SparseBitVectorElement<ElementSize>::BITWORD_SIZE 356 Bits >>= BitPos % BITWORD_SIZE; 388 Bits >>= NextSetBitNumber % BITWORD_SIZE; [all …]
|
/dports/biology/stringtie/stringtie-2.1.1/gclib/ |
H A D | GBitVec.h | 87 BitPos = Idx % BITWORD_SIZE; in GBitRef() 213 uint WordPos = Prev / BITWORD_SIZE; in find_next() 214 uint BitPos = Prev % BITWORD_SIZE; in find_next() 248 if (N > Capacity * BITWORD_SIZE) { 268 if (N > Capacity * BITWORD_SIZE) in reserve() 280 fBits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE); in set() 290 fBits[Idx / BITWORD_SIZE] &= ~(1L << (Idx % BITWORD_SIZE)); in reset() 302 fBits[Idx / BITWORD_SIZE] ^= 1L << (Idx % BITWORD_SIZE); in flip() 401 if (Size <= Capacity * BITWORD_SIZE) { 430 return (S + BITWORD_SIZE-1) / BITWORD_SIZE; in NumBitWords() [all …]
|
/dports/biology/gffread/gffread-0.12.7/gclib/ |
H A D | GBitVec.h | 87 BitPos = Idx % BITWORD_SIZE; in GBitRef() 231 uint WordPos = Prev / BITWORD_SIZE; in find_next() 232 uint BitPos = Prev % BITWORD_SIZE; in find_next() 266 if (N > Capacity * BITWORD_SIZE) { 286 if (N > Capacity * BITWORD_SIZE) in reserve() 301 fBits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE); in set() 314 fBits[Idx / BITWORD_SIZE] &= ~(1L << (Idx % BITWORD_SIZE)); in reset() 329 fBits[Idx / BITWORD_SIZE] ^= 1L << (Idx % BITWORD_SIZE); in flip() 432 if (Size <= Capacity * BITWORD_SIZE) { 461 return (S + BITWORD_SIZE-1) / BITWORD_SIZE; in NumBitWords() [all …]
|