1 //===- llvm/ADT/BitVector.h - Bit vectors -----------------------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by Evan Cheng and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the BitVector class.
12 //===----------------------------------------------------------------------===//
14 #ifndef LLVM_ADT_BITVECTOR_H
15 #define LLVM_ADT_BITVECTOR_H
17 #include "llvm/Support/MathExtras.h"
25 typedef unsigned long BitWord;
27 enum { BITWORD_SIZE = sizeof(BitWord) * 8 };
29 BitWord *Bits; // Actual bits.
30 unsigned Size; // Size of bitvector in bits.
31 unsigned Capacity; // Size of allocated memory in BitWord.
34 // Encapsulation of a single bit.
36 friend class BitVector;
41 reference(); // Undefined
44 reference(BitVector &b, unsigned Idx) {
45 WordRef = &b.Bits[Idx / BITWORD_SIZE];
46 BitPos = Idx % BITWORD_SIZE;
51 reference& operator=(bool t) {
53 *WordRef |= 1L << BitPos;
55 *WordRef &= ~(1L << BitPos);
59 operator bool() const {
60 return (*WordRef) & (1L << BitPos);
65 /// BitVector default ctor - Creates an empty bitvector.
66 BitVector() : Size(0), Capacity(0) {
70 /// BitVector ctor - Creates a bitvector of specified number of bits. All
71 /// bits are initialized to the specified value.
72 explicit BitVector(unsigned s, bool t = false) : Size(s) {
73 Capacity = NumBitWords(s);
74 Bits = new BitWord[Capacity];
75 init_words(Bits, Capacity, t);
80 /// BitVector copy ctor.
81 BitVector(const BitVector &RHS) : Size(RHS.size()) {
88 Capacity = NumBitWords(RHS.size());
89 Bits = new BitWord[Capacity];
90 std::copy(RHS.Bits, &RHS.Bits[Capacity], Bits);
97 /// size - Returns the number of bits in this bitvector.
98 unsigned size() const { return Size; }
100 /// count - Returns the number of bits which are set.
101 unsigned count() const {
102 unsigned NumBits = 0;
103 for (unsigned i = 0; i < NumBitWords(size()); ++i)
104 if (sizeof(BitWord) == 4)
105 NumBits += CountPopulation_32(Bits[i]);
106 else if (sizeof(BitWord) == 8)
107 NumBits += CountPopulation_64(Bits[i]);
109 assert(0 && "Unsupported!");
113 /// any - Returns true if any bit is set.
115 for (unsigned i = 0; i < NumBitWords(size()); ++i)
121 /// none - Returns true if none of the bits are set.
126 /// find_first - Returns the index of the first set bit, -1 if none
127 /// of the bits are set.
128 int find_first() const {
129 for (unsigned i = 0; i < NumBitWords(size()); ++i)
131 if (sizeof(BitWord) == 4)
132 return i * BITWORD_SIZE + CountTrailingZeros_32(Bits[i]);
133 else if (sizeof(BitWord) == 8)
134 return i * BITWORD_SIZE + CountTrailingZeros_64(Bits[i]);
136 assert(0 && "Unsupported!");
141 /// find_next - Returns the index of the next set bit following the
142 /// "Prev" bit. Returns -1 if the next set bit is not found.
143 int find_next(unsigned Prev) const {
148 unsigned WordPos = Prev / BITWORD_SIZE;
149 unsigned BitPos = Prev % BITWORD_SIZE;
150 BitWord Copy = Bits[WordPos];
151 // Mask off previous bits.
152 Copy &= ~0L << BitPos;
155 if (sizeof(BitWord) == 4)
156 return WordPos * BITWORD_SIZE + CountTrailingZeros_32(Copy);
157 else if (sizeof(BitWord) == 8)
158 return WordPos * BITWORD_SIZE + CountTrailingZeros_64(Copy);
160 assert(0 && "Unsupported!");
163 // Check subsequent words.
164 for (unsigned i = WordPos+1; i < NumBitWords(size()); ++i)
166 if (sizeof(BitWord) == 4)
167 return i * BITWORD_SIZE + CountTrailingZeros_32(Bits[i]);
168 else if (sizeof(BitWord) == 8)
169 return i * BITWORD_SIZE + CountTrailingZeros_64(Bits[i]);
171 assert(0 && "Unsupported!");
176 /// clear - Clear all bits.
181 /// resize - Grow or shrink the bitvector.
182 void resize(unsigned N, bool t = false) {
183 if (N > Capacity * BITWORD_SIZE) {
184 unsigned OldCapacity = Capacity;
186 init_words(&Bits[OldCapacity], (Capacity-OldCapacity), t);
189 // Set any old unused bits that are now included in the BitVector. This
190 // may set bits that are not included in the new vector, but we will clear
191 // them back out below.
195 // Update the size, and clear out any bits that are now unused
196 unsigned OldSize = Size;
198 if (t || N < OldSize)
202 void reserve(unsigned N) {
203 if (N > Capacity * BITWORD_SIZE)
209 init_words(Bits, Capacity, true);
214 BitVector &set(unsigned Idx) {
215 Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE);
220 init_words(Bits, Capacity, false);
224 BitVector &reset(unsigned Idx) {
225 Bits[Idx / BITWORD_SIZE] &= ~(1L << (Idx % BITWORD_SIZE));
230 for (unsigned i = 0; i < NumBitWords(size()); ++i)
236 BitVector &flip(unsigned Idx) {
237 Bits[Idx / BITWORD_SIZE] ^= 1L << (Idx % BITWORD_SIZE);
242 BitVector operator~() const {
243 return BitVector(*this).flip();
247 reference operator[](unsigned Idx) {
248 return reference(*this, Idx);
251 bool operator[](unsigned Idx) const {
252 BitWord Mask = 1L << (Idx % BITWORD_SIZE);
253 return (Bits[Idx / BITWORD_SIZE] & Mask) != 0;
256 bool test(unsigned Idx) const {
260 // Comparison operators.
261 bool operator==(const BitVector &RHS) const {
262 if (Size != RHS.Size)
265 for (unsigned i = 0; i < NumBitWords(size()); ++i)
266 if (Bits[i] != RHS.Bits[i])
271 bool operator!=(const BitVector &RHS) const {
272 return !(*this == RHS);
275 // Intersection, union, disjoint union.
276 BitVector operator&=(const BitVector &RHS) {
277 assert(Size == RHS.Size && "Illegal operation!");
278 for (unsigned i = 0; i < NumBitWords(size()); ++i)
279 Bits[i] &= RHS.Bits[i];
283 BitVector operator|=(const BitVector &RHS) {
284 assert(Size == RHS.Size && "Illegal operation!");
285 for (unsigned i = 0; i < NumBitWords(size()); ++i)
286 Bits[i] |= RHS.Bits[i];
290 BitVector operator^=(const BitVector &RHS) {
291 assert(Size == RHS.Size && "Illegal operation!");
292 for (unsigned i = 0; i < NumBitWords(size()); ++i)
293 Bits[i] ^= RHS.Bits[i];
297 // Assignment operator.
298 const BitVector &operator=(const BitVector &RHS) {
299 if (this == &RHS) return *this;
302 unsigned RHSWords = NumBitWords(Size);
303 if (Size <= Capacity * BITWORD_SIZE) {
304 std::copy(RHS.Bits, &RHS.Bits[RHSWords], Bits);
309 // Grow the bitvector to have enough elements.
311 BitWord *NewBits = new BitWord[Capacity];
312 std::copy(RHS.Bits, &RHS.Bits[RHSWords], NewBits);
314 // Destroy the old bits.
322 unsigned NumBitWords(unsigned S) const {
323 return (S + BITWORD_SIZE-1) / BITWORD_SIZE;
326 // Set the unused bits in the high words.
327 void set_unused_bits(bool t = true) {
328 // Set high words first.
329 unsigned UsedWords = NumBitWords(Size);
330 if (Capacity > UsedWords)
331 init_words(&Bits[UsedWords], (Capacity-UsedWords), t);
333 // Then set any stray high bits of the last used word.
334 unsigned ExtraBits = Size % BITWORD_SIZE;
336 Bits[UsedWords-1] &= ~(~0L << ExtraBits);
337 Bits[UsedWords-1] |= (0 - (BitWord)t) << ExtraBits;
341 // Clear the unused bits in the high words.
342 void clear_unused_bits() {
343 set_unused_bits(false);
346 void grow(unsigned NewSize) {
347 unsigned OldCapacity = Capacity;
348 Capacity = NumBitWords(NewSize);
349 BitWord *NewBits = new BitWord[Capacity];
351 // Copy the old bits over.
352 if (OldCapacity != 0)
353 std::copy(Bits, &Bits[OldCapacity], NewBits);
355 // Destroy the old bits.
360 void init_words(BitWord *B, unsigned NumWords, bool t) {
361 memset(B, 0 - (int)t, NumWords*sizeof(BitWord));
365 inline BitVector operator&(const BitVector &LHS, const BitVector &RHS) {
366 BitVector Result(LHS);
371 inline BitVector operator|(const BitVector &LHS, const BitVector &RHS) {
372 BitVector Result(LHS);
377 inline BitVector operator^(const BitVector &LHS, const BitVector &RHS) {
378 BitVector Result(LHS);
383 } // End llvm namespace