Home
last modified time | relevance | path

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

/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DBitVector.h364 BitWord EMask = BitWord(1) << (E % BITWORD_SIZE); in set()
365 BitWord IMask = BitWord(1) << (I % BITWORD_SIZE); in set()
371 BitWord PrefixMask = ~BitWord(0) << (I % BITWORD_SIZE); in set()
378 BitWord PostfixMask = (BitWord(1) << (E % BITWORD_SIZE)) - 1; in set()
403 BitWord EMask = BitWord(1) << (E % BITWORD_SIZE); in reset()
404 BitWord IMask = BitWord(1) << (I % BITWORD_SIZE); in reset()
410 BitWord PrefixMask = ~BitWord(0) << (I % BITWORD_SIZE); in reset()
417 BitWord PostfixMask = (BitWord(1) << (E % BITWORD_SIZE)) - 1; in reset()
444 BitWord Mask = BitWord(1) << (Idx % BITWORD_SIZE);
660 const BitWord Mask = maskLeadingOnes<BitWord>(BitDistance);
[all …]
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 …]