-//===- llvm/ADT/BitVector.h - Bit vectors -----------------------*- C++ -*-===//\r
-//\r
-// The LLVM Compiler Infrastructure\r
-//\r
-// This file is distributed under the University of Illinois Open Source\r
-// License. See LICENSE.TXT for details.\r
-//\r
-//===----------------------------------------------------------------------===//\r
-//\r
-// This file implements the BitVector class.\r
-//\r
-//===----------------------------------------------------------------------===//\r
-\r
-#ifndef LLVM_ADT_BITVECTOR_H\r
-#define LLVM_ADT_BITVECTOR_H\r
-\r
-#include "llvm/Support/MathExtras.h"\r
-#include <algorithm>\r
-#include <cassert>\r
-#include <climits>\r
-#include <cstdint>\r
-#include <cstdlib>\r
-#include <cstring>\r
-#include <utility>\r
-\r
-namespace llvm {\r
-\r
-class BitVector {\r
- typedef unsigned long BitWord;\r
-\r
- enum { BITWORD_SIZE = (unsigned)sizeof(BitWord) * CHAR_BIT };\r
-\r
- static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32,\r
- "Unsupported word size");\r
-\r
- BitWord *Bits; // Actual bits.\r
- unsigned Size; // Size of bitvector in bits.\r
- unsigned Capacity; // Number of BitWords allocated in the Bits array.\r
-\r
-public:\r
- typedef unsigned size_type;\r
- // Encapsulation of a single bit.\r
- class reference {\r
- friend class BitVector;\r
-\r
- BitWord *WordRef;\r
- unsigned BitPos;\r
-\r
- public:\r
- reference(BitVector &b, unsigned Idx) {\r
- WordRef = &b.Bits[Idx / BITWORD_SIZE];\r
- BitPos = Idx % BITWORD_SIZE;\r
- }\r
-\r
- reference() = delete;\r
- reference(const reference&) = default;\r
-\r
- reference &operator=(reference t) {\r
- *this = bool(t);\r
- return *this;\r
- }\r
-\r
- reference& operator=(bool t) {\r
- if (t)\r
- *WordRef |= BitWord(1) << BitPos;\r
- else\r
- *WordRef &= ~(BitWord(1) << BitPos);\r
- return *this;\r
- }\r
-\r
- operator bool() const {\r
- return ((*WordRef) & (BitWord(1) << BitPos)) != 0;\r
- }\r
- };\r
-\r
-\r
- /// BitVector default ctor - Creates an empty bitvector.\r
- BitVector() : Size(0), Capacity(0) {\r
- Bits = nullptr;\r
- }\r
-\r
- /// BitVector ctor - Creates a bitvector of specified number of bits. All\r
- /// bits are initialized to the specified value.\r
- explicit BitVector(unsigned s, bool t = false) : Size(s) {\r
- Capacity = NumBitWords(s);\r
- Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));\r
- init_words(Bits, Capacity, t);\r
- if (t)\r
- clear_unused_bits();\r
- }\r
-\r
- /// BitVector copy ctor.\r
- BitVector(const BitVector &RHS) : Size(RHS.size()) {\r
- if (Size == 0) {\r
- Bits = nullptr;\r
- Capacity = 0;\r
- return;\r
- }\r
-\r
- Capacity = NumBitWords(RHS.size());\r
- Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));\r
- std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord));\r
- }\r
-\r
- BitVector(BitVector &&RHS)\r
- : Bits(RHS.Bits), Size(RHS.Size), Capacity(RHS.Capacity) {\r
- RHS.Bits = nullptr;\r
- RHS.Size = RHS.Capacity = 0;\r
- }\r
-\r
- ~BitVector() {\r
- std::free(Bits);\r
- }\r
-\r
- /// empty - Tests whether there are no bits in this bitvector.\r
- bool empty() const { return Size == 0; }\r
-\r
- /// size - Returns the number of bits in this bitvector.\r
- size_type size() const { return Size; }\r
-\r
- /// count - Returns the number of bits which are set.\r
- size_type count() const {\r
- unsigned NumBits = 0;\r
- for (unsigned i = 0; i < NumBitWords(size()); ++i)\r
- NumBits += countPopulation(Bits[i]);\r
- return NumBits;\r
- }\r
-\r
- /// any - Returns true if any bit is set.\r
- bool any() const {\r
- for (unsigned i = 0; i < NumBitWords(size()); ++i)\r
- if (Bits[i] != 0)\r
- return true;\r
- return false;\r
- }\r
-\r
- /// all - Returns true if all bits are set.\r
- bool all() const {\r
- for (unsigned i = 0; i < Size / BITWORD_SIZE; ++i)\r
- if (Bits[i] != ~0UL)\r
- return false;\r
-\r
- // If bits remain check that they are ones. The unused bits are always zero.\r
- if (unsigned Remainder = Size % BITWORD_SIZE)\r
- return Bits[Size / BITWORD_SIZE] == (1UL << Remainder) - 1;\r
-\r
- return true;\r
- }\r
-\r
- /// none - Returns true if none of the bits are set.\r
- bool none() const {\r
- return !any();\r
- }\r
-\r
- /// find_first - Returns the index of the first set bit, -1 if none\r
- /// of the bits are set.\r
- int find_first() const {\r
- for (unsigned i = 0; i < NumBitWords(size()); ++i)\r
- if (Bits[i] != 0)\r
- return i * BITWORD_SIZE + countTrailingZeros(Bits[i]);\r
- return -1;\r
- }\r
-\r
- /// find_next - Returns the index of the next set bit following the\r
- /// "Prev" bit. Returns -1 if the next set bit is not found.\r
- int find_next(unsigned Prev) const {\r
- ++Prev;\r
- if (Prev >= Size)\r
- return -1;\r
-\r
- unsigned WordPos = Prev / BITWORD_SIZE;\r
- unsigned BitPos = Prev % BITWORD_SIZE;\r
- BitWord Copy = Bits[WordPos];\r
- // Mask off previous bits.\r
- Copy &= ~0UL << BitPos;\r
-\r
- if (Copy != 0)\r
- return WordPos * BITWORD_SIZE + countTrailingZeros(Copy);\r
-\r
- // Check subsequent words.\r
- for (unsigned i = WordPos+1; i < NumBitWords(size()); ++i)\r
- if (Bits[i] != 0)\r
- return i * BITWORD_SIZE + countTrailingZeros(Bits[i]);\r
- return -1;\r
- }\r
-\r
- /// clear - Clear all bits.\r
- void clear() {\r
- Size = 0;\r
- }\r
-\r
- /// resize - Grow or shrink the bitvector.\r
- void resize(unsigned N, bool t = false) {\r
- if (N > Capacity * BITWORD_SIZE) {\r
- unsigned OldCapacity = Capacity;\r
- grow(N);\r
- init_words(&Bits[OldCapacity], (Capacity-OldCapacity), t);\r
- }\r
-\r
- // Set any old unused bits that are now included in the BitVector. This\r
- // may set bits that are not included in the new vector, but we will clear\r
- // them back out below.\r
- if (N > Size)\r
- set_unused_bits(t);\r
-\r
- // Update the size, and clear out any bits that are now unused\r
- unsigned OldSize = Size;\r
- Size = N;\r
- if (t || N < OldSize)\r
- clear_unused_bits();\r
- }\r
-\r
- void reserve(unsigned N) {\r
- if (N > Capacity * BITWORD_SIZE)\r
- grow(N);\r
- }\r
-\r
- // Set, reset, flip\r
- BitVector &set() {\r
- init_words(Bits, Capacity, true);\r
- clear_unused_bits();\r
- return *this;\r
- }\r
-\r
- BitVector &set(unsigned Idx) {\r
- assert(Bits && "Bits never allocated");\r
- Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE);\r
- return *this;\r
- }\r
-\r
- /// set - Efficiently set a range of bits in [I, E)\r
- BitVector &set(unsigned I, unsigned E) {\r
- assert(I <= E && "Attempted to set backwards range!");\r
- assert(E <= size() && "Attempted to set out-of-bounds range!");\r
-\r
- if (I == E) return *this;\r
-\r
- if (I / BITWORD_SIZE == E / BITWORD_SIZE) {\r
- BitWord EMask = 1UL << (E % BITWORD_SIZE);\r
- BitWord IMask = 1UL << (I % BITWORD_SIZE);\r
- BitWord Mask = EMask - IMask;\r
- Bits[I / BITWORD_SIZE] |= Mask;\r
- return *this;\r
- }\r
-\r
- BitWord PrefixMask = ~0UL << (I % BITWORD_SIZE);\r
- Bits[I / BITWORD_SIZE] |= PrefixMask;\r
- I = alignTo(I, BITWORD_SIZE);\r
-\r
- for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE)\r
- Bits[I / BITWORD_SIZE] = ~0UL;\r
-\r
- BitWord PostfixMask = (1UL << (E % BITWORD_SIZE)) - 1;\r
- if (I < E)\r
- Bits[I / BITWORD_SIZE] |= PostfixMask;\r
-\r
- return *this;\r
- }\r
-\r
- BitVector &reset() {\r
- init_words(Bits, Capacity, false);\r
- return *this;\r
- }\r
-\r
- BitVector &reset(unsigned Idx) {\r
- Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE));\r
- return *this;\r
- }\r
-\r
- /// reset - Efficiently reset a range of bits in [I, E)\r
- BitVector &reset(unsigned I, unsigned E) {\r
- assert(I <= E && "Attempted to reset backwards range!");\r
- assert(E <= size() && "Attempted to reset out-of-bounds range!");\r
-\r
- if (I == E) return *this;\r
-\r
- if (I / BITWORD_SIZE == E / BITWORD_SIZE) {\r
- BitWord EMask = 1UL << (E % BITWORD_SIZE);\r
- BitWord IMask = 1UL << (I % BITWORD_SIZE);\r
- BitWord Mask = EMask - IMask;\r
- Bits[I / BITWORD_SIZE] &= ~Mask;\r
- return *this;\r
- }\r
-\r
- BitWord PrefixMask = ~0UL << (I % BITWORD_SIZE);\r
- Bits[I / BITWORD_SIZE] &= ~PrefixMask;\r
- I = alignTo(I, BITWORD_SIZE);\r
-\r
- for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE)\r
- Bits[I / BITWORD_SIZE] = 0UL;\r
-\r
- BitWord PostfixMask = (1UL << (E % BITWORD_SIZE)) - 1;\r
- if (I < E)\r
- Bits[I / BITWORD_SIZE] &= ~PostfixMask;\r
-\r
- return *this;\r
- }\r
-\r
- BitVector &flip() {\r
- for (unsigned i = 0; i < NumBitWords(size()); ++i)\r
- Bits[i] = ~Bits[i];\r
- clear_unused_bits();\r
- return *this;\r
- }\r
-\r
- BitVector &flip(unsigned Idx) {\r
- Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE);\r
- return *this;\r
- }\r
-\r
- // Indexing.\r
- reference operator[](unsigned Idx) {\r
- assert (Idx < Size && "Out-of-bounds Bit access.");\r
- return reference(*this, Idx);\r
- }\r
-\r
- bool operator[](unsigned Idx) const {\r
- assert (Idx < Size && "Out-of-bounds Bit access.");\r
- BitWord Mask = BitWord(1) << (Idx % BITWORD_SIZE);\r
- return (Bits[Idx / BITWORD_SIZE] & Mask) != 0;\r
- }\r
-\r
- bool test(unsigned Idx) const {\r
- return (*this)[Idx];\r
- }\r
-\r
- /// Test if any common bits are set.\r
- bool anyCommon(const BitVector &RHS) const {\r
- unsigned ThisWords = NumBitWords(size());\r
- unsigned RHSWords = NumBitWords(RHS.size());\r
- for (unsigned i = 0, e = std::min(ThisWords, RHSWords); i != e; ++i)\r
- if (Bits[i] & RHS.Bits[i])\r
- return true;\r
- return false;\r
- }\r
-\r
- // Comparison operators.\r
- bool operator==(const BitVector &RHS) const {\r
- unsigned ThisWords = NumBitWords(size());\r
- unsigned RHSWords = NumBitWords(RHS.size());\r
- unsigned i;\r
- for (i = 0; i != std::min(ThisWords, RHSWords); ++i)\r
- if (Bits[i] != RHS.Bits[i])\r
- return false;\r
-\r
- // Verify that any extra words are all zeros.\r
- if (i != ThisWords) {\r
- for (; i != ThisWords; ++i)\r
- if (Bits[i])\r
- return false;\r
- } else if (i != RHSWords) {\r
- for (; i != RHSWords; ++i)\r
- if (RHS.Bits[i])\r
- return false;\r
- }\r
- return true;\r
- }\r
-\r
- bool operator!=(const BitVector &RHS) const {\r
- return !(*this == RHS);\r
- }\r
-\r
- /// Intersection, union, disjoint union.\r
- BitVector &operator&=(const BitVector &RHS) {\r
- unsigned ThisWords = NumBitWords(size());\r
- unsigned RHSWords = NumBitWords(RHS.size());\r
- unsigned i;\r
- for (i = 0; i != std::min(ThisWords, RHSWords); ++i)\r
- Bits[i] &= RHS.Bits[i];\r
-\r
- // Any bits that are just in this bitvector become zero, because they aren't\r
- // in the RHS bit vector. Any words only in RHS are ignored because they\r
- // are already zero in the LHS.\r
- for (; i != ThisWords; ++i)\r
- Bits[i] = 0;\r
-\r
- return *this;\r
- }\r
-\r
- /// reset - Reset bits that are set in RHS. Same as *this &= ~RHS.\r
- BitVector &reset(const BitVector &RHS) {\r
- unsigned ThisWords = NumBitWords(size());\r
- unsigned RHSWords = NumBitWords(RHS.size());\r
- unsigned i;\r
- for (i = 0; i != std::min(ThisWords, RHSWords); ++i)\r
- Bits[i] &= ~RHS.Bits[i];\r
- return *this;\r
- }\r
-\r
- /// test - Check if (This - RHS) is zero.\r
- /// This is the same as reset(RHS) and any().\r
- bool test(const BitVector &RHS) const {\r
- unsigned ThisWords = NumBitWords(size());\r
- unsigned RHSWords = NumBitWords(RHS.size());\r
- unsigned i;\r
- for (i = 0; i != std::min(ThisWords, RHSWords); ++i)\r
- if ((Bits[i] & ~RHS.Bits[i]) != 0)\r
- return true;\r
-\r
- for (; i != ThisWords ; ++i)\r
- if (Bits[i] != 0)\r
- return true;\r
-\r
- return false;\r
- }\r
-\r
- BitVector &operator|=(const BitVector &RHS) {\r
- if (size() < RHS.size())\r
- resize(RHS.size());\r
- for (size_t i = 0, e = NumBitWords(RHS.size()); i != e; ++i)\r
- Bits[i] |= RHS.Bits[i];\r
- return *this;\r
- }\r
-\r
- BitVector &operator^=(const BitVector &RHS) {\r
- if (size() < RHS.size())\r
- resize(RHS.size());\r
- for (size_t i = 0, e = NumBitWords(RHS.size()); i != e; ++i)\r
- Bits[i] ^= RHS.Bits[i];\r
- return *this;\r
- }\r
-\r
- // Assignment operator.\r
- const BitVector &operator=(const BitVector &RHS) {\r
- if (this == &RHS) return *this;\r
-\r
- Size = RHS.size();\r
- unsigned RHSWords = NumBitWords(Size);\r
- if (Size <= Capacity * BITWORD_SIZE) {\r
- if (Size)\r
- std::memcpy(Bits, RHS.Bits, RHSWords * sizeof(BitWord));\r
- clear_unused_bits();\r
- return *this;\r
- }\r
-\r
- // Grow the bitvector to have enough elements.\r
- Capacity = RHSWords;\r
- assert(Capacity > 0 && "negative capacity?");\r
- BitWord *NewBits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));\r
- std::memcpy(NewBits, RHS.Bits, Capacity * sizeof(BitWord));\r
-\r
- // Destroy the old bits.\r
- std::free(Bits);\r
- Bits = NewBits;\r
-\r
- return *this;\r
- }\r
-\r
- const BitVector &operator=(BitVector &&RHS) {\r
- if (this == &RHS) return *this;\r
-\r
- std::free(Bits);\r
- Bits = RHS.Bits;\r
- Size = RHS.Size;\r
- Capacity = RHS.Capacity;\r
-\r
- RHS.Bits = nullptr;\r
- RHS.Size = RHS.Capacity = 0;\r
-\r
- return *this;\r
- }\r
-\r
- void swap(BitVector &RHS) {\r
- std::swap(Bits, RHS.Bits);\r
- std::swap(Size, RHS.Size);\r
- std::swap(Capacity, RHS.Capacity);\r
- }\r
-\r
- //===--------------------------------------------------------------------===//\r
- // Portable bit mask operations.\r
- //===--------------------------------------------------------------------===//\r
- //\r
- // These methods all operate on arrays of uint32_t, each holding 32 bits. The\r
- // fixed word size makes it easier to work with literal bit vector constants\r
- // in portable code.\r
- //\r
- // The LSB in each word is the lowest numbered bit. The size of a portable\r
- // bit mask is always a whole multiple of 32 bits. If no bit mask size is\r
- // given, the bit mask is assumed to cover the entire BitVector.\r
-\r
- /// setBitsInMask - Add '1' bits from Mask to this vector. Don't resize.\r
- /// This computes "*this |= Mask".\r
- void setBitsInMask(const uint32_t *Mask, unsigned MaskWords = ~0u) {\r
- applyMask<true, false>(Mask, MaskWords);\r
- }\r
-\r
- /// clearBitsInMask - Clear any bits in this vector that are set in Mask.\r
- /// Don't resize. This computes "*this &= ~Mask".\r
- void clearBitsInMask(const uint32_t *Mask, unsigned MaskWords = ~0u) {\r
- applyMask<false, false>(Mask, MaskWords);\r
- }\r
-\r
- /// setBitsNotInMask - Add a bit to this vector for every '0' bit in Mask.\r
- /// Don't resize. This computes "*this |= ~Mask".\r
- void setBitsNotInMask(const uint32_t *Mask, unsigned MaskWords = ~0u) {\r
- applyMask<true, true>(Mask, MaskWords);\r
- }\r
-\r
- /// clearBitsNotInMask - Clear a bit in this vector for every '0' bit in Mask.\r
- /// Don't resize. This computes "*this &= Mask".\r
- void clearBitsNotInMask(const uint32_t *Mask, unsigned MaskWords = ~0u) {\r
- applyMask<false, true>(Mask, MaskWords);\r
- }\r
-\r
-private:\r
- unsigned NumBitWords(unsigned S) const {\r
- return (S + BITWORD_SIZE-1) / BITWORD_SIZE;\r
- }\r
-\r
- // Set the unused bits in the high words.\r
- void set_unused_bits(bool t = true) {\r
- // Set high words first.\r
- unsigned UsedWords = NumBitWords(Size);\r
- if (Capacity > UsedWords)\r
- init_words(&Bits[UsedWords], (Capacity-UsedWords), t);\r
-\r
- // Then set any stray high bits of the last used word.\r
- unsigned ExtraBits = Size % BITWORD_SIZE;\r
- if (ExtraBits) {\r
- BitWord ExtraBitMask = ~0UL << ExtraBits;\r
- if (t)\r
- Bits[UsedWords-1] |= ExtraBitMask;\r
- else\r
- Bits[UsedWords-1] &= ~ExtraBitMask;\r
- }\r
- }\r
-\r
- // Clear the unused bits in the high words.\r
- void clear_unused_bits() {\r
- set_unused_bits(false);\r
- }\r
-\r
- void grow(unsigned NewSize) {\r
- Capacity = std::max(NumBitWords(NewSize), Capacity * 2);\r
- assert(Capacity > 0 && "realloc-ing zero space");\r
- Bits = (BitWord *)std::realloc(Bits, Capacity * sizeof(BitWord));\r
-\r
- clear_unused_bits();\r
- }\r
-\r
- void init_words(BitWord *B, unsigned NumWords, bool t) {\r
- if (NumWords > 0)\r
- memset(B, 0 - (int)t, NumWords*sizeof(BitWord));\r
- }\r
-\r
- template<bool AddBits, bool InvertMask>\r
- void applyMask(const uint32_t *Mask, unsigned MaskWords) {\r
- static_assert(BITWORD_SIZE % 32 == 0, "Unsupported BitWord size.");\r
- MaskWords = std::min(MaskWords, (size() + 31) / 32);\r
- const unsigned Scale = BITWORD_SIZE / 32;\r
- unsigned i;\r
- for (i = 0; MaskWords >= Scale; ++i, MaskWords -= Scale) {\r
- BitWord BW = Bits[i];\r
- // This inner loop should unroll completely when BITWORD_SIZE > 32.\r
- for (unsigned b = 0; b != BITWORD_SIZE; b += 32) {\r
- uint32_t M = *Mask++;\r
- if (InvertMask) M = ~M;\r
- if (AddBits) BW |= BitWord(M) << b;\r
- else BW &= ~(BitWord(M) << b);\r
- }\r
- Bits[i] = BW;\r
- }\r
- for (unsigned b = 0; MaskWords; b += 32, --MaskWords) {\r
- uint32_t M = *Mask++;\r
- if (InvertMask) M = ~M;\r
- if (AddBits) Bits[i] |= BitWord(M) << b;\r
- else Bits[i] &= ~(BitWord(M) << b);\r
- }\r
- if (AddBits)\r
- clear_unused_bits();\r
- }\r
-\r
-public:\r
- /// Return the size (in bytes) of the bit vector.\r
- size_t getMemorySize() const { return Capacity * sizeof(BitWord); }\r
-};\r
-\r
-static inline size_t capacity_in_bytes(const BitVector &X) {\r
- return X.getMemorySize();\r
-}\r
-\r
-} // end namespace llvm\r
-\r
-namespace std {\r
- /// Implement std::swap in terms of BitVector swap.\r
- inline void\r
- swap(llvm::BitVector &LHS, llvm::BitVector &RHS) {\r
- LHS.swap(RHS);\r
- }\r
-} // end namespace std\r
-\r
-#endif // LLVM_ADT_BITVECTOR_H\r
+//===- llvm/ADT/BitVector.h - Bit vectors -----------------------*- C++ -*-===//
+//
+// The LLVM Compiler Infrastructure
+//
+// This file is distributed under the University of Illinois Open Source
+// License. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
+//
+// This file implements the BitVector class.
+//
+//===----------------------------------------------------------------------===//
+
+#ifndef LLVM_ADT_BITVECTOR_H
+#define LLVM_ADT_BITVECTOR_H
+
+#include "llvm/Support/MathExtras.h"
+#include <algorithm>
+#include <cassert>
+#include <climits>
+#include <cstdint>
+#include <cstdlib>
+#include <cstring>
+#include <utility>
+
+namespace llvm {
+
+class BitVector {
+ typedef unsigned long BitWord;
+
+ enum { BITWORD_SIZE = (unsigned)sizeof(BitWord) * CHAR_BIT };
+
+ static_assert(BITWORD_SIZE == 64 || BITWORD_SIZE == 32,
+ "Unsupported word size");
+
+ BitWord *Bits; // Actual bits.
+ unsigned Size; // Size of bitvector in bits.
+ unsigned Capacity; // Number of BitWords allocated in the Bits array.
+
+public:
+ typedef unsigned size_type;
+ // Encapsulation of a single bit.
+ class reference {
+ friend class BitVector;
+
+ BitWord *WordRef;
+ unsigned BitPos;
+
+ public:
+ reference(BitVector &b, unsigned Idx) {
+ WordRef = &b.Bits[Idx / BITWORD_SIZE];
+ BitPos = Idx % BITWORD_SIZE;
+ }
+
+ reference() = delete;
+ reference(const reference&) = default;
+
+ reference &operator=(reference t) {
+ *this = bool(t);
+ return *this;
+ }
+
+ reference& operator=(bool t) {
+ if (t)
+ *WordRef |= BitWord(1) << BitPos;
+ else
+ *WordRef &= ~(BitWord(1) << BitPos);
+ return *this;
+ }
+
+ operator bool() const {
+ return ((*WordRef) & (BitWord(1) << BitPos)) != 0;
+ }
+ };
+
+
+ /// BitVector default ctor - Creates an empty bitvector.
+ BitVector() : Size(0), Capacity(0) {
+ Bits = nullptr;
+ }
+
+ /// BitVector ctor - Creates a bitvector of specified number of bits. All
+ /// bits are initialized to the specified value.
+ explicit BitVector(unsigned s, bool t = false) : Size(s) {
+ Capacity = NumBitWords(s);
+ Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));
+ init_words(Bits, Capacity, t);
+ if (t)
+ clear_unused_bits();
+ }
+
+ /// BitVector copy ctor.
+ BitVector(const BitVector &RHS) : Size(RHS.size()) {
+ if (Size == 0) {
+ Bits = nullptr;
+ Capacity = 0;
+ return;
+ }
+
+ Capacity = NumBitWords(RHS.size());
+ Bits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));
+ std::memcpy(Bits, RHS.Bits, Capacity * sizeof(BitWord));
+ }
+
+ BitVector(BitVector &&RHS)
+ : Bits(RHS.Bits), Size(RHS.Size), Capacity(RHS.Capacity) {
+ RHS.Bits = nullptr;
+ RHS.Size = RHS.Capacity = 0;
+ }
+
+ ~BitVector() {
+ std::free(Bits);
+ }
+
+ /// empty - Tests whether there are no bits in this bitvector.
+ bool empty() const { return Size == 0; }
+
+ /// size - Returns the number of bits in this bitvector.
+ size_type size() const { return Size; }
+
+ /// count - Returns the number of bits which are set.
+ size_type count() const {
+ unsigned NumBits = 0;
+ for (unsigned i = 0; i < NumBitWords(size()); ++i)
+ NumBits += countPopulation(Bits[i]);
+ return NumBits;
+ }
+
+ /// any - Returns true if any bit is set.
+ bool any() const {
+ for (unsigned i = 0; i < NumBitWords(size()); ++i)
+ if (Bits[i] != 0)
+ return true;
+ return false;
+ }
+
+ /// all - Returns true if all bits are set.
+ bool all() const {
+ for (unsigned i = 0; i < Size / BITWORD_SIZE; ++i)
+ if (Bits[i] != ~0UL)
+ return false;
+
+ // If bits remain check that they are ones. The unused bits are always zero.
+ if (unsigned Remainder = Size % BITWORD_SIZE)
+ return Bits[Size / BITWORD_SIZE] == (1UL << Remainder) - 1;
+
+ return true;
+ }
+
+ /// none - Returns true if none of the bits are set.
+ bool none() const {
+ return !any();
+ }
+
+ /// find_first - Returns the index of the first set bit, -1 if none
+ /// of the bits are set.
+ int find_first() const {
+ for (unsigned i = 0; i < NumBitWords(size()); ++i)
+ if (Bits[i] != 0)
+ return i * BITWORD_SIZE + countTrailingZeros(Bits[i]);
+ return -1;
+ }
+
+ /// find_next - Returns the index of the next set bit following the
+ /// "Prev" bit. Returns -1 if the next set bit is not found.
+ int find_next(unsigned Prev) const {
+ ++Prev;
+ if (Prev >= Size)
+ return -1;
+
+ unsigned WordPos = Prev / BITWORD_SIZE;
+ unsigned BitPos = Prev % BITWORD_SIZE;
+ BitWord Copy = Bits[WordPos];
+ // Mask off previous bits.
+ Copy &= ~0UL << BitPos;
+
+ if (Copy != 0)
+ return WordPos * BITWORD_SIZE + countTrailingZeros(Copy);
+
+ // Check subsequent words.
+ for (unsigned i = WordPos+1; i < NumBitWords(size()); ++i)
+ if (Bits[i] != 0)
+ return i * BITWORD_SIZE + countTrailingZeros(Bits[i]);
+ return -1;
+ }
+
+ /// clear - Clear all bits.
+ void clear() {
+ Size = 0;
+ }
+
+ /// resize - Grow or shrink the bitvector.
+ void resize(unsigned N, bool t = false) {
+ if (N > Capacity * BITWORD_SIZE) {
+ unsigned OldCapacity = Capacity;
+ grow(N);
+ init_words(&Bits[OldCapacity], (Capacity-OldCapacity), t);
+ }
+
+ // Set any old unused bits that are now included in the BitVector. This
+ // may set bits that are not included in the new vector, but we will clear
+ // them back out below.
+ if (N > Size)
+ set_unused_bits(t);
+
+ // Update the size, and clear out any bits that are now unused
+ unsigned OldSize = Size;
+ Size = N;
+ if (t || N < OldSize)
+ clear_unused_bits();
+ }
+
+ void reserve(unsigned N) {
+ if (N > Capacity * BITWORD_SIZE)
+ grow(N);
+ }
+
+ // Set, reset, flip
+ BitVector &set() {
+ init_words(Bits, Capacity, true);
+ clear_unused_bits();
+ return *this;
+ }
+
+ BitVector &set(unsigned Idx) {
+ assert(Bits && "Bits never allocated");
+ Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE);
+ return *this;
+ }
+
+ /// set - Efficiently set a range of bits in [I, E)
+ BitVector &set(unsigned I, unsigned E) {
+ assert(I <= E && "Attempted to set backwards range!");
+ assert(E <= size() && "Attempted to set out-of-bounds range!");
+
+ if (I == E) return *this;
+
+ if (I / BITWORD_SIZE == E / BITWORD_SIZE) {
+ BitWord EMask = 1UL << (E % BITWORD_SIZE);
+ BitWord IMask = 1UL << (I % BITWORD_SIZE);
+ BitWord Mask = EMask - IMask;
+ Bits[I / BITWORD_SIZE] |= Mask;
+ return *this;
+ }
+
+ BitWord PrefixMask = ~0UL << (I % BITWORD_SIZE);
+ Bits[I / BITWORD_SIZE] |= PrefixMask;
+ I = alignTo(I, BITWORD_SIZE);
+
+ for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE)
+ Bits[I / BITWORD_SIZE] = ~0UL;
+
+ BitWord PostfixMask = (1UL << (E % BITWORD_SIZE)) - 1;
+ if (I < E)
+ Bits[I / BITWORD_SIZE] |= PostfixMask;
+
+ return *this;
+ }
+
+ BitVector &reset() {
+ init_words(Bits, Capacity, false);
+ return *this;
+ }
+
+ BitVector &reset(unsigned Idx) {
+ Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE));
+ return *this;
+ }
+
+ /// reset - Efficiently reset a range of bits in [I, E)
+ BitVector &reset(unsigned I, unsigned E) {
+ assert(I <= E && "Attempted to reset backwards range!");
+ assert(E <= size() && "Attempted to reset out-of-bounds range!");
+
+ if (I == E) return *this;
+
+ if (I / BITWORD_SIZE == E / BITWORD_SIZE) {
+ BitWord EMask = 1UL << (E % BITWORD_SIZE);
+ BitWord IMask = 1UL << (I % BITWORD_SIZE);
+ BitWord Mask = EMask - IMask;
+ Bits[I / BITWORD_SIZE] &= ~Mask;
+ return *this;
+ }
+
+ BitWord PrefixMask = ~0UL << (I % BITWORD_SIZE);
+ Bits[I / BITWORD_SIZE] &= ~PrefixMask;
+ I = alignTo(I, BITWORD_SIZE);
+
+ for (; I + BITWORD_SIZE <= E; I += BITWORD_SIZE)
+ Bits[I / BITWORD_SIZE] = 0UL;
+
+ BitWord PostfixMask = (1UL << (E % BITWORD_SIZE)) - 1;
+ if (I < E)
+ Bits[I / BITWORD_SIZE] &= ~PostfixMask;
+
+ return *this;
+ }
+
+ BitVector &flip() {
+ for (unsigned i = 0; i < NumBitWords(size()); ++i)
+ Bits[i] = ~Bits[i];
+ clear_unused_bits();
+ return *this;
+ }
+
+ BitVector &flip(unsigned Idx) {
+ Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE);
+ return *this;
+ }
+
+ // Indexing.
+ reference operator[](unsigned Idx) {
+ assert (Idx < Size && "Out-of-bounds Bit access.");
+ return reference(*this, Idx);
+ }
+
+ bool operator[](unsigned Idx) const {
+ assert (Idx < Size && "Out-of-bounds Bit access.");
+ BitWord Mask = BitWord(1) << (Idx % BITWORD_SIZE);
+ return (Bits[Idx / BITWORD_SIZE] & Mask) != 0;
+ }
+
+ bool test(unsigned Idx) const {
+ return (*this)[Idx];
+ }
+
+ /// Test if any common bits are set.
+ bool anyCommon(const BitVector &RHS) const {
+ unsigned ThisWords = NumBitWords(size());
+ unsigned RHSWords = NumBitWords(RHS.size());
+ for (unsigned i = 0, e = std::min(ThisWords, RHSWords); i != e; ++i)
+ if (Bits[i] & RHS.Bits[i])
+ return true;
+ return false;
+ }
+
+ // Comparison operators.
+ bool operator==(const BitVector &RHS) const {
+ unsigned ThisWords = NumBitWords(size());
+ unsigned RHSWords = NumBitWords(RHS.size());
+ unsigned i;
+ for (i = 0; i != std::min(ThisWords, RHSWords); ++i)
+ if (Bits[i] != RHS.Bits[i])
+ return false;
+
+ // Verify that any extra words are all zeros.
+ if (i != ThisWords) {
+ for (; i != ThisWords; ++i)
+ if (Bits[i])
+ return false;
+ } else if (i != RHSWords) {
+ for (; i != RHSWords; ++i)
+ if (RHS.Bits[i])
+ return false;
+ }
+ return true;
+ }
+
+ bool operator!=(const BitVector &RHS) const {
+ return !(*this == RHS);
+ }
+
+ /// Intersection, union, disjoint union.
+ BitVector &operator&=(const BitVector &RHS) {
+ unsigned ThisWords = NumBitWords(size());
+ unsigned RHSWords = NumBitWords(RHS.size());
+ unsigned i;
+ for (i = 0; i != std::min(ThisWords, RHSWords); ++i)
+ Bits[i] &= RHS.Bits[i];
+
+ // Any bits that are just in this bitvector become zero, because they aren't
+ // in the RHS bit vector. Any words only in RHS are ignored because they
+ // are already zero in the LHS.
+ for (; i != ThisWords; ++i)
+ Bits[i] = 0;
+
+ return *this;
+ }
+
+ /// reset - Reset bits that are set in RHS. Same as *this &= ~RHS.
+ BitVector &reset(const BitVector &RHS) {
+ unsigned ThisWords = NumBitWords(size());
+ unsigned RHSWords = NumBitWords(RHS.size());
+ unsigned i;
+ for (i = 0; i != std::min(ThisWords, RHSWords); ++i)
+ Bits[i] &= ~RHS.Bits[i];
+ return *this;
+ }
+
+ /// test - Check if (This - RHS) is zero.
+ /// This is the same as reset(RHS) and any().
+ bool test(const BitVector &RHS) const {
+ unsigned ThisWords = NumBitWords(size());
+ unsigned RHSWords = NumBitWords(RHS.size());
+ unsigned i;
+ for (i = 0; i != std::min(ThisWords, RHSWords); ++i)
+ if ((Bits[i] & ~RHS.Bits[i]) != 0)
+ return true;
+
+ for (; i != ThisWords ; ++i)
+ if (Bits[i] != 0)
+ return true;
+
+ return false;
+ }
+
+ BitVector &operator|=(const BitVector &RHS) {
+ if (size() < RHS.size())
+ resize(RHS.size());
+ for (size_t i = 0, e = NumBitWords(RHS.size()); i != e; ++i)
+ Bits[i] |= RHS.Bits[i];
+ return *this;
+ }
+
+ BitVector &operator^=(const BitVector &RHS) {
+ if (size() < RHS.size())
+ resize(RHS.size());
+ for (size_t i = 0, e = NumBitWords(RHS.size()); i != e; ++i)
+ Bits[i] ^= RHS.Bits[i];
+ return *this;
+ }
+
+ // Assignment operator.
+ const BitVector &operator=(const BitVector &RHS) {
+ if (this == &RHS) return *this;
+
+ Size = RHS.size();
+ unsigned RHSWords = NumBitWords(Size);
+ if (Size <= Capacity * BITWORD_SIZE) {
+ if (Size)
+ std::memcpy(Bits, RHS.Bits, RHSWords * sizeof(BitWord));
+ clear_unused_bits();
+ return *this;
+ }
+
+ // Grow the bitvector to have enough elements.
+ Capacity = RHSWords;
+ assert(Capacity > 0 && "negative capacity?");
+ BitWord *NewBits = (BitWord *)std::malloc(Capacity * sizeof(BitWord));
+ std::memcpy(NewBits, RHS.Bits, Capacity * sizeof(BitWord));
+
+ // Destroy the old bits.
+ std::free(Bits);
+ Bits = NewBits;
+
+ return *this;
+ }
+
+ const BitVector &operator=(BitVector &&RHS) {
+ if (this == &RHS) return *this;
+
+ std::free(Bits);
+ Bits = RHS.Bits;
+ Size = RHS.Size;
+ Capacity = RHS.Capacity;
+
+ RHS.Bits = nullptr;
+ RHS.Size = RHS.Capacity = 0;
+
+ return *this;
+ }
+
+ void swap(BitVector &RHS) {
+ std::swap(Bits, RHS.Bits);
+ std::swap(Size, RHS.Size);
+ std::swap(Capacity, RHS.Capacity);
+ }
+
+ //===--------------------------------------------------------------------===//
+ // Portable bit mask operations.
+ //===--------------------------------------------------------------------===//
+ //
+ // These methods all operate on arrays of uint32_t, each holding 32 bits. The
+ // fixed word size makes it easier to work with literal bit vector constants
+ // in portable code.
+ //
+ // The LSB in each word is the lowest numbered bit. The size of a portable
+ // bit mask is always a whole multiple of 32 bits. If no bit mask size is
+ // given, the bit mask is assumed to cover the entire BitVector.
+
+ /// setBitsInMask - Add '1' bits from Mask to this vector. Don't resize.
+ /// This computes "*this |= Mask".
+ void setBitsInMask(const uint32_t *Mask, unsigned MaskWords = ~0u) {
+ applyMask<true, false>(Mask, MaskWords);
+ }
+
+ /// clearBitsInMask - Clear any bits in this vector that are set in Mask.
+ /// Don't resize. This computes "*this &= ~Mask".
+ void clearBitsInMask(const uint32_t *Mask, unsigned MaskWords = ~0u) {
+ applyMask<false, false>(Mask, MaskWords);
+ }
+
+ /// setBitsNotInMask - Add a bit to this vector for every '0' bit in Mask.
+ /// Don't resize. This computes "*this |= ~Mask".
+ void setBitsNotInMask(const uint32_t *Mask, unsigned MaskWords = ~0u) {
+ applyMask<true, true>(Mask, MaskWords);
+ }
+
+ /// clearBitsNotInMask - Clear a bit in this vector for every '0' bit in Mask.
+ /// Don't resize. This computes "*this &= Mask".
+ void clearBitsNotInMask(const uint32_t *Mask, unsigned MaskWords = ~0u) {
+ applyMask<false, true>(Mask, MaskWords);
+ }
+
+private:
+ unsigned NumBitWords(unsigned S) const {
+ return (S + BITWORD_SIZE-1) / BITWORD_SIZE;
+ }
+
+ // Set the unused bits in the high words.
+ void set_unused_bits(bool t = true) {
+ // Set high words first.
+ unsigned UsedWords = NumBitWords(Size);
+ if (Capacity > UsedWords)
+ init_words(&Bits[UsedWords], (Capacity-UsedWords), t);
+
+ // Then set any stray high bits of the last used word.
+ unsigned ExtraBits = Size % BITWORD_SIZE;
+ if (ExtraBits) {
+ BitWord ExtraBitMask = ~0UL << ExtraBits;
+ if (t)
+ Bits[UsedWords-1] |= ExtraBitMask;
+ else
+ Bits[UsedWords-1] &= ~ExtraBitMask;
+ }
+ }
+
+ // Clear the unused bits in the high words.
+ void clear_unused_bits() {
+ set_unused_bits(false);
+ }
+
+ void grow(unsigned NewSize) {
+ Capacity = std::max(NumBitWords(NewSize), Capacity * 2);
+ assert(Capacity > 0 && "realloc-ing zero space");
+ Bits = (BitWord *)std::realloc(Bits, Capacity * sizeof(BitWord));
+
+ clear_unused_bits();
+ }
+
+ void init_words(BitWord *B, unsigned NumWords, bool t) {
+ if (NumWords > 0)
+ memset(B, 0 - (int)t, NumWords*sizeof(BitWord));
+ }
+
+ template<bool AddBits, bool InvertMask>
+ void applyMask(const uint32_t *Mask, unsigned MaskWords) {
+ static_assert(BITWORD_SIZE % 32 == 0, "Unsupported BitWord size.");
+ MaskWords = std::min(MaskWords, (size() + 31) / 32);
+ const unsigned Scale = BITWORD_SIZE / 32;
+ unsigned i;
+ for (i = 0; MaskWords >= Scale; ++i, MaskWords -= Scale) {
+ BitWord BW = Bits[i];
+ // This inner loop should unroll completely when BITWORD_SIZE > 32.
+ for (unsigned b = 0; b != BITWORD_SIZE; b += 32) {
+ uint32_t M = *Mask++;
+ if (InvertMask) M = ~M;
+ if (AddBits) BW |= BitWord(M) << b;
+ else BW &= ~(BitWord(M) << b);
+ }
+ Bits[i] = BW;
+ }
+ for (unsigned b = 0; MaskWords; b += 32, --MaskWords) {
+ uint32_t M = *Mask++;
+ if (InvertMask) M = ~M;
+ if (AddBits) Bits[i] |= BitWord(M) << b;
+ else Bits[i] &= ~(BitWord(M) << b);
+ }
+ if (AddBits)
+ clear_unused_bits();
+ }
+
+public:
+ /// Return the size (in bytes) of the bit vector.
+ size_t getMemorySize() const { return Capacity * sizeof(BitWord); }
+};
+
+static inline size_t capacity_in_bytes(const BitVector &X) {
+ return X.getMemorySize();
+}
+
+} // end namespace llvm
+
+namespace std {
+ /// Implement std::swap in terms of BitVector swap.
+ inline void
+ swap(llvm::BitVector &LHS, llvm::BitVector &RHS) {
+ LHS.swap(RHS);
+ }
+} // end namespace std
+
+#endif // LLVM_ADT_BITVECTOR_H