Home
last modified time | relevance | path

Searched refs:BitWord (Results 1 – 3 of 3) sorted by relevance

/llvm-project/llvm/include/llvm/ADT/
H A DBitVector.h83 typedef uintptr_t BitWord; typedef
85 enum { BITWORD_SIZE = (unsigned)sizeof(BitWord) * CHAR_BIT };
90 using Storage = SmallVector<BitWord>;
101 BitWord *WordRef;
120 *WordRef |= BitWord(1) << BitPos;
122 *WordRef &= ~(BitWord(1) << BitPos);
127 return ((*WordRef) & (BitWord(1) << BitPos)) != 0;
150 : Bits(NumBitWords(s), 0 - (BitWord)t), Size(s) { in NumBitWords()
171 return any_of(Bits, [](BitWord Bit) { return Bit != 0; }); in any()
177 if (Bits[i] != ~BitWord(0)) in all()
[all …]
H A DBitset.h31 typedef uintptr_t BitWord; typedef
33 enum { BITWORD_SIZE = (unsigned)sizeof(BitWord) * CHAR_BIT };
39 std::array<BitWord, NumWords> Bits{};
42 constexpr Bitset(const std::array<BitWord, NumWords> &B) in Bitset() argument
53 std::fill(std::begin(Bits), std::end(Bits), -BitWord(0)); in set()
58 Bits[I / BITWORD_SIZE] |= BitWord(1) << (I % BITWORD_SIZE); in set()
63 Bits[I / BITWORD_SIZE] &= ~(BitWord(1) << (I % BITWORD_SIZE)); in reset()
68 Bits[I / BITWORD_SIZE] ^= BitWord(1) << (I % BITWORD_SIZE); in flip()
73 BitWord Mask = BitWord(1) << (I % BITWORD_SIZE);
82 return llvm::any_of(Bits, [](BitWord I) { return I != 0; }); in any()
H A DSparseBitVector.h44 using BitWord = unsigned long;
47 BITWORD_SIZE = sizeof(BitWord) * CHAR_BIT,
55 BitWord Bits[BITWORDS_PER_ELEMENT];
59 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT); in SparseBitVectorElement()
65 memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT); in SparseBitVectorElement()
83 BitWord word(unsigned Idx) const { in word()
154 BitWord Copy = Bits[WordPos]; in find_next()
175 BitWord old = changed ? 0 : Bits[i]; in unionWith()
202 BitWord old = changed ? 0 : Bits[i]; in intersectWith()
225 BitWord old = changed ? 0 : Bits[i]; in intersectWithComplement()
[all …]