1//===- llvm/ADT/BitVector.h - Bit vectors -----------------------*- C++ -*-===// 3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 4// See https://llvm.org/LICENSE.txt for license information. 5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7//===----------------------------------------------------------------------===// 10/// This file implements the BitVector class. 12//===----------------------------------------------------------------------===// 14#ifndef LLVM_ADT_BITVECTOR_H 15#define LLVM_ADT_BITVECTOR_H 32/// ForwardIterator for the bits that are set. 33/// Iterators get invalidated when resize / reserve is called. 35const BitVectorT &Parent;
39assert(Current != -1 &&
"Trying to advance past end.");
40 Current = Parent.find_next(Current);
51 : Parent(Parent), Current(Current) {}
71"Comparing iterators from different BitVectors");
72return Current ==
Other.Current;
77"Comparing iterators from different BitVectors");
78return Current !=
Other.Current;
83typedef uintptr_t BitWord;
85enum { BITWORD_SIZE = (
unsigned)
sizeof(BitWord) * CHAR_BIT };
87static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32,
88"Unsupported word size");
93unsigned Size = 0;
// Size of bitvector in bits. 98// Encapsulation of a single bit. 106 WordRef = &b.Bits[
Idx / BITWORD_SIZE];
107 BitPos =
Idx % BITWORD_SIZE;
120 *WordRef |= BitWord(1) << BitPos;
122 *WordRef &= ~(BitWord(1) << BitPos);
127return ((*WordRef) & (BitWord(1) << BitPos)) != 0;
144 /// BitVector default ctor - Creates an empty bitvector. 147 /// BitVector ctor - Creates a bitvector of specified number of bits. All 148 /// bits are initialized to the specified value. 150 : Bits(NumBitWords(s), 0 - (BitWord)t), Size(s) {
155 /// empty - Tests whether there are no bits in this bitvector. 156boolempty()
const{
return Size == 0; }
158 /// size - Returns the number of bits in this bitvector. 161 /// count - Returns the number of bits which are set. 169 /// any - Returns true if any bit is set. 171returnany_of(Bits, [](BitWord Bit) {
return Bit != 0; });
174 /// all - Returns true if all bits are set. 176for (
unsigned i = 0; i < Size / BITWORD_SIZE; ++i)
177if (Bits[i] != ~BitWord(0))
180// If bits remain check that they are ones. The unused bits are always zero. 181if (
unsigned Remainder = Size % BITWORD_SIZE)
182return Bits[Size / BITWORD_SIZE] == (BitWord(1) << Remainder) - 1;
187 /// none - Returns true if none of the bits are set. 192 /// find_first_in - Returns the index of the first set / unset bit, 193 /// depending on \p Set, in the range [Begin, End). 194 /// Returns -1 if all bits in the range are unset / set. 200unsigned FirstWord = Begin / BITWORD_SIZE;
201unsigned LastWord = (
End - 1) / BITWORD_SIZE;
203// Check subsequent words. 204// The code below is based on search for the first _set_ bit. If 205// we're searching for the first _unset_, we just take the 206// complement of each word before we use it and apply 208for (
unsigned i = FirstWord; i <= LastWord; ++i) {
209 BitWord Copy = Bits[i];
214unsigned FirstBit = Begin % BITWORD_SIZE;
215 Copy &= maskTrailingZeros<BitWord>(FirstBit);
219unsigned LastBit = (
End - 1) % BITWORD_SIZE;
220 Copy &= maskTrailingOnes<BitWord>(LastBit + 1);
228 /// find_last_in - Returns the index of the last set bit in the range 229 /// [Begin, End). Returns -1 if all bits in the range are unset. 235unsigned LastWord = (
End - 1) / BITWORD_SIZE;
236unsigned FirstWord = Begin / BITWORD_SIZE;
238for (
unsigned i = LastWord + 1; i >= FirstWord + 1; --i) {
239unsigned CurrentWord = i - 1;
241 BitWord Copy = Bits[CurrentWord];
242if (CurrentWord == LastWord) {
243unsigned LastBit = (
End - 1) % BITWORD_SIZE;
244 Copy &= maskTrailingOnes<BitWord>(LastBit + 1);
247if (CurrentWord == FirstWord) {
248unsigned FirstBit = Begin % BITWORD_SIZE;
249 Copy &= maskTrailingZeros<BitWord>(FirstBit);
259 /// find_first_unset_in - Returns the index of the first unset bit in the 260 /// range [Begin, End). Returns -1 if all bits in the range are set. 265 /// find_last_unset_in - Returns the index of the last unset bit in the 266 /// range [Begin, End). Returns -1 if all bits in the range are set. 272unsigned LastWord = (
End - 1) / BITWORD_SIZE;
273unsigned FirstWord = Begin / BITWORD_SIZE;
275for (
unsigned i = LastWord + 1; i >= FirstWord + 1; --i) {
276unsigned CurrentWord = i - 1;
278 BitWord Copy = Bits[CurrentWord];
279if (CurrentWord == LastWord) {
280unsigned LastBit = (
End - 1) % BITWORD_SIZE;
281 Copy |= maskTrailingZeros<BitWord>(LastBit + 1);
284if (CurrentWord == FirstWord) {
285unsigned FirstBit = Begin % BITWORD_SIZE;
286 Copy |= maskTrailingOnes<BitWord>(FirstBit);
289if (Copy != ~BitWord(0)) {
292return Result < Size ? Result : -1;
298 /// find_first - Returns the index of the first set bit, -1 if none 299 /// of the bits are set. 302 /// find_last - Returns the index of the last set bit, -1 if none of the bits 306 /// find_next - Returns the index of the next set bit following the 307 /// "Prev" bit. Returns -1 if the next set bit is not found. 310 /// find_prev - Returns the index of the first set bit that precedes the 311 /// the bit at \p PriorTo. Returns -1 if all previous bits are unset. 314 /// find_first_unset - Returns the index of the first unset bit, -1 if all 315 /// of the bits are set. 318 /// find_next_unset - Returns the index of the next unset bit following the 319 /// "Prev" bit. Returns -1 if all remaining bits are set. 324 /// find_last_unset - Returns the index of the last unset bit, -1 if all of 325 /// the bits are set. 328 /// find_prev_unset - Returns the index of the first unset bit that precedes 329 /// the bit at \p PriorTo. Returns -1 if all previous bits are set. 334 /// clear - Removes all bits from the bitvector. 340 /// resize - Grow or shrink the bitvector. 344 Bits.resize(NumBitWords(
N), 0 - BitWord(t));
359 Bits[
Idx / BITWORD_SIZE] |= BitWord(1) << (
Idx % BITWORD_SIZE);
363 /// set - Efficiently set a range of bits in [I, E) 365assert(
I <=
E &&
"Attempted to set backwards range!");
366assert(
E <=
size() &&
"Attempted to set out-of-bounds range!");
368if (
I ==
E)
return *
this;
370if (
I / BITWORD_SIZE ==
E / BITWORD_SIZE) {
371 BitWord EMask = BitWord(1) << (
E % BITWORD_SIZE);
372 BitWord IMask = BitWord(1) << (
I % BITWORD_SIZE);
373 BitWord Mask = EMask - IMask;
374 Bits[
I / BITWORD_SIZE] |= Mask;
378 BitWord PrefixMask = ~BitWord(0) << (
I % BITWORD_SIZE);
379 Bits[
I / BITWORD_SIZE] |= PrefixMask;
382for (;
I + BITWORD_SIZE <=
E;
I += BITWORD_SIZE)
383 Bits[
I / BITWORD_SIZE] = ~BitWord(0);
385 BitWord PostfixMask = (BitWord(1) << (
E % BITWORD_SIZE)) - 1;
387 Bits[
I / BITWORD_SIZE] |= PostfixMask;
398 Bits[
Idx / BITWORD_SIZE] &= ~(BitWord(1) << (
Idx % BITWORD_SIZE));
402 /// reset - Efficiently reset a range of bits in [I, E) 404assert(
I <=
E &&
"Attempted to reset backwards range!");
405assert(
E <=
size() &&
"Attempted to reset out-of-bounds range!");
407if (
I ==
E)
return *
this;
409if (
I / BITWORD_SIZE ==
E / BITWORD_SIZE) {
410 BitWord EMask = BitWord(1) << (
E % BITWORD_SIZE);
411 BitWord IMask = BitWord(1) << (
I % BITWORD_SIZE);
412 BitWord Mask = EMask - IMask;
413 Bits[
I / BITWORD_SIZE] &= ~Mask;
417 BitWord PrefixMask = ~BitWord(0) << (
I % BITWORD_SIZE);
418 Bits[
I / BITWORD_SIZE] &= ~PrefixMask;
421for (;
I + BITWORD_SIZE <=
E;
I += BITWORD_SIZE)
422 Bits[
I / BITWORD_SIZE] = BitWord(0);
424 BitWord PostfixMask = (BitWord(1) << (
E % BITWORD_SIZE)) - 1;
426 Bits[
I / BITWORD_SIZE] &= ~PostfixMask;
432for (
auto &Bit : Bits)
439 Bits[
Idx / BITWORD_SIZE] ^= BitWord(1) << (
Idx % BITWORD_SIZE);
445assert (
Idx < Size &&
"Out-of-bounds Bit access.");
450assert (
Idx < Size &&
"Out-of-bounds Bit access.");
451 BitWord Mask = BitWord(1) << (
Idx % BITWORD_SIZE);
452return (Bits[
Idx / BITWORD_SIZE] & Mask) != 0;
455 /// Return the last element in the vector. 457assert(!
empty() &&
"Getting last element of empty vector.");
458return (*
this)[
size() - 1];
465// Push single bit to end of vector. 467unsigned OldSize = Size;
468unsigned NewSize = Size + 1;
470// Resize, which will insert zeros. 471// If we already fit then the unused bits will be already zero. 477// If true, set single bit. 482 /// Pop one bit from the end of the vector. 484assert(!
empty() &&
"Empty vector has no element to pop.");
488 /// Test if any common bits are set. 490unsigned ThisWords = Bits.size();
491unsigned RHSWords =
RHS.Bits.size();
492for (
unsigned i = 0, e = std::min(ThisWords, RHSWords); i != e; ++i)
493if (Bits[i] &
RHS.Bits[i])
498// Comparison operators. 502unsigned NumWords = Bits.size();
503return std::equal(Bits.begin(), Bits.begin() + NumWords,
RHS.Bits.begin());
508 /// Intersection, union, disjoint union. 510unsigned ThisWords = Bits.size();
511unsigned RHSWords =
RHS.Bits.size();
513for (i = 0; i != std::min(ThisWords, RHSWords); ++i)
514 Bits[i] &=
RHS.Bits[i];
516// Any bits that are just in this bitvector become zero, because they aren't 517// in the RHS bit vector. Any words only in RHS are ignored because they 518// are already zero in the LHS. 519for (; i != ThisWords; ++i)
525 /// reset - Reset bits that are set in RHS. Same as *this &= ~RHS. 527unsigned ThisWords = Bits.size();
528unsigned RHSWords =
RHS.Bits.size();
529for (
unsigned i = 0; i != std::min(ThisWords, RHSWords); ++i)
530 Bits[i] &= ~
RHS.Bits[i];
534 /// test - Check if (This - RHS) is zero. 535 /// This is the same as reset(RHS) and any(). 537unsigned ThisWords = Bits.size();
538unsigned RHSWords =
RHS.Bits.size();
540for (i = 0; i != std::min(ThisWords, RHSWords); ++i)
541if ((Bits[i] & ~
RHS.Bits[i]) != 0)
544for (; i != ThisWords ; ++i)
551template <
classF,
class... ArgTys>
553 ArgTys
const &...Args) {
555 std::initializer_list<unsigned>{Args.size()...},
556 [&Arg](
autoconst &BV) {
return Arg.
size() == BV; }) &&
560 Out.Bits[
I] = f(Arg.Bits[
I], Args.Bits[
I]...);
561 Out.clear_unused_bits();
569 Bits[
I] |=
RHS.Bits[
I];
577 Bits[
I] ^=
RHS.Bits[
I];
586unsigned NumWords = Bits.size();
589 wordShr(
N / BITWORD_SIZE);
591unsigned BitDistance =
N % BITWORD_SIZE;
595// When the shift size is not a multiple of the word size, then we have 596// a tricky situation where each word in succession needs to extract some 597// of the bits from the next word and or them into this word while 598// shifting this word to make room for the new bits. This has to be done 599// for every word in the array. 601// Since we're shifting each word right, some bits will fall off the end 602// of each word to the right, and empty space will be created on the left. 603// The final word in the array will lose bits permanently, so starting at 604// the beginning, work forwards shifting each word to the right, and 605// OR'ing in the bits from the end of the next word to the beginning of 609// Starting with {0xAABBCCDD, 0xEEFF0011, 0x22334455} and shifting right 611// Step 1: Word[0] >>= 4 ; 0x0ABBCCDD 612// Step 2: Word[0] |= 0x10000000 ; 0x1ABBCCDD 613// Step 3: Word[1] >>= 4 ; 0x0EEFF001 614// Step 4: Word[1] |= 0x50000000 ; 0x5EEFF001 615// Step 5: Word[2] >>= 4 ; 0x02334455 616// Result: { 0x1ABBCCDD, 0x5EEFF001, 0x02334455 } 617const BitWord Mask = maskTrailingOnes<BitWord>(BitDistance);
618constunsigned LSH = BITWORD_SIZE - BitDistance;
620for (
unsignedI = 0;
I < NumWords - 1; ++
I) {
621 Bits[
I] >>= BitDistance;
622 Bits[
I] |= (Bits[
I + 1] & Mask) << LSH;
625 Bits[NumWords - 1] >>= BitDistance;
635unsigned NumWords = Bits.size();
638 wordShl(
N / BITWORD_SIZE);
640unsigned BitDistance =
N % BITWORD_SIZE;
644// When the shift size is not a multiple of the word size, then we have 645// a tricky situation where each word in succession needs to extract some 646// of the bits from the previous word and or them into this word while 647// shifting this word to make room for the new bits. This has to be done 648// for every word in the array. This is similar to the algorithm outlined 649// in operator>>=, but backwards. 651// Since we're shifting each word left, some bits will fall off the end 652// of each word to the left, and empty space will be created on the right. 653// The first word in the array will lose bits permanently, so starting at 654// the end, work backwards shifting each word to the left, and OR'ing 655// in the bits from the end of the next word to the beginning of the 659// Starting with {0xAABBCCDD, 0xEEFF0011, 0x22334455} and shifting left 661// Step 1: Word[2] <<= 4 ; 0x23344550 662// Step 2: Word[2] |= 0x0000000E ; 0x2334455E 663// Step 3: Word[1] <<= 4 ; 0xEFF00110 664// Step 4: Word[1] |= 0x0000000A ; 0xEFF0011A 665// Step 5: Word[0] <<= 4 ; 0xABBCCDD0 666// Result: { 0xABBCCDD0, 0xEFF0011A, 0x2334455E } 667const BitWord Mask = maskLeadingOnes<BitWord>(BitDistance);
668constunsigned RSH = BITWORD_SIZE - BitDistance;
670for (
intI = NumWords - 1;
I > 0; --
I) {
671 Bits[
I] <<= BitDistance;
672 Bits[
I] |= (Bits[
I - 1] & Mask) >> RSH;
674 Bits[0] <<= BitDistance;
686assert(!Size && Bits.empty());
693//===--------------------------------------------------------------------===// 694// Portable bit mask operations. 695//===--------------------------------------------------------------------===// 697// These methods all operate on arrays of uint32_t, each holding 32 bits. The 698// fixed word size makes it easier to work with literal bit vector constants 701// The LSB in each word is the lowest numbered bit. The size of a portable 702// bit mask is always a whole multiple of 32 bits. If no bit mask size is 703// given, the bit mask is assumed to cover the entire BitVector. 705 /// setBitsInMask - Add '1' bits from Mask to this vector. Don't resize. 706 /// This computes "*this |= Mask". 708 applyMask<true, false>(Mask, MaskWords);
711 /// clearBitsInMask - Clear any bits in this vector that are set in Mask. 712 /// Don't resize. This computes "*this &= ~Mask". 714 applyMask<false, false>(Mask, MaskWords);
717 /// setBitsNotInMask - Add a bit to this vector for every '0' bit in Mask. 718 /// Don't resize. This computes "*this |= ~Mask". 720 applyMask<true, true>(Mask, MaskWords);
723 /// clearBitsNotInMask - Clear a bit in this vector for every '0' bit in Mask. 724 /// Don't resize. This computes "*this &= Mask". 726 applyMask<false, true>(Mask, MaskWords);
730 /// Perform a logical left shift of \p Count words by moving everything 731 /// \p Count words to the right in memory. 733 /// While confusing, words are stored from least significant at Bits[0] to 734 /// most significant at Bits[NumWords-1]. A logical shift left, however, 735 /// moves the current least significant bit to a higher logical index, and 736 /// fills the previous least significant bits with 0. Thus, we actually 737 /// need to move the bytes of the memory to the right, not to the left. 739 /// Words = [0xBBBBAAAA, 0xDDDDFFFF, 0x00000000, 0xDDDD0000] 740 /// represents a BitVector where 0xBBBBAAAA contain the least significant 741 /// bits. So if we want to shift the BitVector left by 2 words, we need 742 /// to turn this into 0x00000000 0x00000000 0xBBBBAAAA 0xDDDDFFFF by using a 743 /// memmove which moves right, not left. 750// Since we always move Word-sized chunks of data with src and dest both 751// aligned to a word-boundary, we don't need to worry about endianness 753 std::copy(Bits.begin(), Bits.begin() + NumWords - Count,
754 Bits.begin() + Count);
755 std::fill(Bits.begin(), Bits.begin() + Count, 0);
759 /// Perform a logical right shift of \p Count words by moving those 760 /// words to the left in memory. See wordShl for more information. 768 std::copy(Bits.begin() + Count, Bits.begin() + NumWords, Bits.begin());
769 std::fill(Bits.begin() + NumWords - Count, Bits.begin() + NumWords, 0);
772int next_unset_in_word(
int WordIndex, BitWord Word)
const{
777unsigned NumBitWords(
unsigned S)
const{
778return (S + BITWORD_SIZE-1) / BITWORD_SIZE;
781// Set the unused bits in the high words. 782void set_unused_bits(
bool t =
true) {
783// Then set any stray high bits of the last used word. 784if (
unsigned ExtraBits = Size % BITWORD_SIZE) {
785 BitWord ExtraBitMask = ~BitWord(0) << ExtraBits;
787Bits.back() |= ExtraBitMask;
789Bits.back() &= ~ExtraBitMask;
793// Clear the unused bits in the high words. 794void clear_unused_bits() {
795 set_unused_bits(
false);
798void init_words(
bool t) {
799 std::fill(
Bits.begin(),
Bits.end(), 0 - (BitWord)t);
802template<
bool AddBits,
bool InvertMask>
803void applyMask(
constuint32_t *Mask,
unsigned MaskWords) {
804static_assert(BITWORD_SIZE % 32 == 0,
"Unsupported BitWord size.");
805 MaskWords = std::min(MaskWords, (
size() + 31) / 32);
806constunsigned Scale = BITWORD_SIZE / 32;
808for (i = 0; MaskWords >= Scale; ++i, MaskWords -= Scale) {
810// This inner loop should unroll completely when BITWORD_SIZE > 32. 811for (
unsigned b = 0;
b != BITWORD_SIZE;
b += 32) {
813if (InvertMask)
M = ~M;
814if (AddBits) BW |= BitWord(M) <<
b;
815else BW &= ~(BitWord(M) <<
b);
819for (
unsigned b = 0; MaskWords;
b += 32, --MaskWords) {
821if (InvertMask)
M = ~M;
822if (AddBits)
Bits[i] |= BitWord(M) <<
b;
823elseBits[i] &= ~(BitWord(M) <<
b);
830 /// Return the size (in bytes) of the bit vector. 836returnX.getMemorySize();
848 getHashValue(std::make_pair(V.size(), V.getData()));
851if (
LHS.isInvalid() ||
RHS.isInvalid())
852returnLHS.isInvalid() ==
RHS.isInvalid();
856}
// end namespace llvm 859 /// Implement std::swap in terms of BitVector swap. 863#endif// LLVM_ADT_BITVECTOR_H for(const MachineOperand &MO :llvm::drop_begin(OldMI.operands(), Desc.getNumOperands()))
static GCRegistry::Add< CoreCLRGC > E("coreclr", "CoreCLR-compatible GC")
#define LLVM_UNLIKELY(EXPR)
Returns the sub type a function will return at a given Idx Should correspond to the result type of an ExtractValue instruction executed with just that one unsigned Idx
This file defines DenseMapInfo traits for DenseMap.
static GCMetadataPrinterRegistry::Add< ErlangGCPrinter > X("erlang", "erlang-compatible garbage collector")
assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef())
ArrayRef - Represent a constant reference to an array (0 or more elements consecutively in memory),...
reference & operator=(bool t)
reference(BitVector &b, unsigned Idx)
reference & operator=(reference t)
reference(const reference &)=default
BitVector & operator>>=(unsigned N)
bool test(unsigned Idx) const
void swap(BitVector &RHS)
int find_first() const
find_first - Returns the index of the first set bit, -1 if none of the bits are set.
void resize(unsigned N, bool t=false)
resize - Grow or shrink the bitvector.
bool anyCommon(const BitVector &RHS) const
Test if any common bits are set.
void clear()
clear - Removes all bits from the bitvector.
bool test(const BitVector &RHS) const
test - Check if (This - RHS) is zero.
BitVector()=default
BitVector default ctor - Creates an empty bitvector.
bool back() const
Return the last element in the vector.
bool operator!=(const BitVector &RHS) const
void clearBitsNotInMask(const uint32_t *Mask, unsigned MaskWords=~0u)
clearBitsNotInMask - Clear a bit in this vector for every '0' bit in Mask.
int find_last() const
find_last - Returns the index of the last set bit, -1 if none of the bits are set.
int find_first_unset_in(unsigned Begin, unsigned End) const
find_first_unset_in - Returns the index of the first unset bit in the range [Begin,...
size_type count() const
count - Returns the number of bits which are set.
BitVector & operator<<=(unsigned N)
ArrayRef< BitWord > getData() const
const_set_bits_iterator set_bits_end() const
BitVector & reset(unsigned Idx)
const_set_bits_iterator set_iterator
int find_last_unset() const
find_last_unset - Returns the index of the last unset bit, -1 if all of the bits are set.
void setBitsInMask(const uint32_t *Mask, unsigned MaskWords=~0u)
setBitsInMask - Add '1' bits from Mask to this vector.
bool any() const
any - Returns true if any bit is set.
int find_prev_unset(unsigned PriorTo)
find_prev_unset - Returns the index of the first unset bit that precedes the bit at PriorTo.
bool all() const
all - Returns true if all bits are set.
BitVector(unsigned s, bool t=false)
BitVector ctor - Creates a bitvector of specified number of bits.
BitVector & reset(const BitVector &RHS)
reset - Reset bits that are set in RHS. Same as *this &= ~RHS.
BitVector & operator|=(const BitVector &RHS)
void pop_back()
Pop one bit from the end of the vector.
void clearBitsInMask(const uint32_t *Mask, unsigned MaskWords=~0u)
clearBitsInMask - Clear any bits in this vector that are set in Mask.
int find_prev(unsigned PriorTo) const
find_prev - Returns the index of the first set bit that precedes the the bit at PriorTo.
int find_last_in(unsigned Begin, unsigned End) const
find_last_in - Returns the index of the last set bit in the range [Begin, End).
void setBitsNotInMask(const uint32_t *Mask, unsigned MaskWords=~0u)
setBitsNotInMask - Add a bit to this vector for every '0' bit in Mask.
BitVector & reset(unsigned I, unsigned E)
reset - Efficiently reset a range of bits in [I, E)
bool operator==(const BitVector &RHS) const
int find_next(unsigned Prev) const
find_next - Returns the index of the next set bit following the "Prev" bit.
const_set_bits_iterator_impl< BitVector > const_set_bits_iterator
bool none() const
none - Returns true if none of the bits are set.
const_set_bits_iterator set_bits_begin() const
iterator_range< const_set_bits_iterator > set_bits() const
BitVector & set(unsigned I, unsigned E)
set - Efficiently set a range of bits in [I, E)
size_type getBitCapacity() const
int find_first_in(unsigned Begin, unsigned End, bool Set=true) const
find_first_in - Returns the index of the first set / unset bit, depending on Set, in the range [Begin...
size_type size() const
size - Returns the number of bits in this bitvector.
BitVector & operator^=(const BitVector &RHS)
BitVector & flip(unsigned Idx)
size_type getMemorySize() const
Return the size (in bytes) of the bit vector.
static BitVector & apply(F &&f, BitVector &Out, BitVector const &Arg, ArgTys const &...Args)
bool empty() const
empty - Tests whether there are no bits in this bitvector.
int find_next_unset(unsigned Prev) const
find_next_unset - Returns the index of the next unset bit following the "Prev" bit.
BitVector & set(unsigned Idx)
BitVector & operator&=(const BitVector &RHS)
Intersection, union, disjoint union.
int find_first_unset() const
find_first_unset - Returns the index of the first unset bit, -1 if all of the bits are set.
int find_last_unset_in(unsigned Begin, unsigned End) const
find_last_unset_in - Returns the index of the last unset bit in the range [Begin, End).
bool operator[](unsigned Idx) const
reference operator[](unsigned Idx)
ForwardIterator for the bits that are set.
const_set_bits_iterator_impl(const BitVectorT &Parent)
bool operator==(const const_set_bits_iterator_impl &Other) const
const_set_bits_iterator_impl(const const_set_bits_iterator_impl &)=default
const_set_bits_iterator_impl & operator++()
const_set_bits_iterator_impl operator++(int)
std::ptrdiff_t difference_type
const_set_bits_iterator_impl(const BitVectorT &Parent, int Current)
bool operator!=(const const_set_bits_iterator_impl &Other) const
std::forward_iterator_tag iterator_category
unsigned operator*() const
A range adaptor for a pair of iterators.
This provides a very simple, boring adaptor for a begin and end iterator into a range type.
constexpr std::underlying_type_t< E > Mask()
Get a bitmask with 1s in all places up to the high-order bit of E's largest value.
This is an optimization pass for GlobalISel generic memory operations.
bool all_of(R &&range, UnaryPredicate P)
Provide wrappers to std::all_of which take ranges instead of having to pass begin/end explicitly.
int popcount(T Value) noexcept
Count the number of set bits in a value.
int countr_one(T Value)
Count the number of ones from the least significant bit to the first zero bit.
BitVector::size_type capacity_in_bytes(const BitVector &X)
iterator_range< T > make_range(T x, T y)
Convenience function for iterating over sub-ranges.
int countr_zero(T Val)
Count number of 0's from the least significant bit to the most stopping at the first 1.
bool any_of(R &&range, UnaryPredicate P)
Provide wrappers to std::any_of which take ranges instead of having to pass begin/end explicitly.
int countl_zero(T Val)
Count number of 0's from the most significant bit to the least stopping at the first 1.
int countl_one(T Value)
Count the number of ones from the most significant bit to the first zero bit.
uint64_t alignTo(uint64_t Size, Align A)
Returns a multiple of A needed to store Size bytes.
Implement std::hash so that hash_code can be used in STL containers.
void swap(llvm::BitVector &LHS, llvm::BitVector &RHS)
Implement std::swap in terms of BitVector swap.
static BitVector getEmptyKey()
static bool isEqual(const BitVector &LHS, const BitVector &RHS)
static unsigned getHashValue(const BitVector &V)
static BitVector getTombstoneKey()
An information struct used to provide DenseMap with the various necessary components for a given valu...
