1 //===- llvm/ADT/SmallBitVector.h - 'Normally small' bit vectors -*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the SmallBitVector class.
12 //===----------------------------------------------------------------------===//
14 #ifndef LLVM_ADT_SMALLBITVECTOR_H
15 #define LLVM_ADT_SMALLBITVECTOR_H
17 #include "llvm/ADT/BitVector.h"
18 #include "llvm/Support/Compiler.h"
19 #include "llvm/Support/MathExtras.h"
24 /// SmallBitVector - This is a 'bitvector' (really, a variable-sized bit array),
25 /// optimized for the case when the array is small. It contains one
26 /// pointer-sized field, which is directly used as a plain collection of bits
27 /// when possible, or as a pointer to a larger heap-allocated array when
28 /// necessary. This allows normal "small" cases to be fast without losing
29 /// generality for large inputs.
31 class SmallBitVector {
32 // TODO: In "large" mode, a pointer to a BitVector is used, leading to an
33 // unnecessary level of indirection. It would be more efficient to use a
34 // pointer to memory containing size, allocation size, and the array of bits.
38 // The number of bits in this class.
39 NumBaseBits = sizeof(uintptr_t) * CHAR_BIT,
41 // One bit is used to discriminate between small and large mode. The
42 // remaining bits are used for the small-mode representation.
43 SmallNumRawBits = NumBaseBits - 1,
45 // A few more bits are used to store the size of the bit set in small mode.
46 // Theoretically this is a ceil-log2. These bits are encoded in the most
47 // significant bits of the raw bits.
48 SmallNumSizeBits = (NumBaseBits == 32 ? 5 :
49 NumBaseBits == 64 ? 6 :
52 // The remaining bits are used to store the actual set in small mode.
53 SmallNumDataBits = SmallNumRawBits - SmallNumSizeBits
57 // Encapsulation of a single bit.
59 SmallBitVector &TheVector;
63 reference(SmallBitVector &b, unsigned Idx) : TheVector(b), BitPos(Idx) {}
65 reference& operator=(reference t) {
70 reference& operator=(bool t) {
72 TheVector.set(BitPos);
74 TheVector.reset(BitPos);
78 operator bool() const {
79 return const_cast<const SmallBitVector &>(TheVector).operator[](BitPos);
84 bool isSmall() const {
85 return X & uintptr_t(1);
88 BitVector *getPointer() const {
90 return reinterpret_cast<BitVector *>(X);
93 void switchToSmall(uintptr_t NewSmallBits, size_t NewSize) {
95 setSmallSize(NewSize);
96 setSmallBits(NewSmallBits);
99 void switchToLarge(BitVector *BV) {
100 X = reinterpret_cast<uintptr_t>(BV);
101 assert(!isSmall() && "Tried to use an unaligned pointer");
104 // Return all the bits used for the "small" representation; this includes
105 // bits for the size as well as the element bits.
106 uintptr_t getSmallRawBits() const {
111 void setSmallRawBits(uintptr_t NewRawBits) {
113 X = (NewRawBits << 1) | uintptr_t(1);
117 size_t getSmallSize() const {
118 return getSmallRawBits() >> SmallNumDataBits;
121 void setSmallSize(size_t Size) {
122 setSmallRawBits(getSmallBits() | (Size << SmallNumDataBits));
125 // Return the element bits.
126 uintptr_t getSmallBits() const {
127 return getSmallRawBits() & ~(~uintptr_t(0) << getSmallSize());
130 void setSmallBits(uintptr_t NewBits) {
131 setSmallRawBits((NewBits & ~(~uintptr_t(0) << getSmallSize())) |
132 (getSmallSize() << SmallNumDataBits));
136 /// SmallBitVector default ctor - Creates an empty bitvector.
137 SmallBitVector() : X(1) {}
139 /// SmallBitVector ctor - Creates a bitvector of specified number of bits. All
140 /// bits are initialized to the specified value.
141 explicit SmallBitVector(unsigned s, bool t = false) {
142 if (s <= SmallNumDataBits)
143 switchToSmall(t ? ~uintptr_t(0) : 0, s);
145 switchToLarge(new BitVector(s, t));
148 /// SmallBitVector copy ctor.
149 SmallBitVector(const SmallBitVector &RHS) {
153 switchToLarge(new BitVector(*RHS.getPointer()));
156 #if LLVM_USE_RVALUE_REFERENCES
157 SmallBitVector(SmallBitVector &&RHS) : X(RHS.X) {
167 /// empty - Tests whether there are no bits in this bitvector.
169 return isSmall() ? getSmallSize() == 0 : getPointer()->empty();
172 /// size - Returns the number of bits in this bitvector.
173 size_t size() const {
174 return isSmall() ? getSmallSize() : getPointer()->size();
177 /// count - Returns the number of bits which are set.
178 unsigned count() const {
180 uintptr_t Bits = getSmallBits();
181 if (sizeof(uintptr_t) * CHAR_BIT == 32)
182 return CountPopulation_32(Bits);
183 if (sizeof(uintptr_t) * CHAR_BIT == 64)
184 return CountPopulation_64(Bits);
185 llvm_unreachable("Unsupported!");
187 return getPointer()->count();
190 /// any - Returns true if any bit is set.
193 return getSmallBits() != 0;
194 return getPointer()->any();
197 /// all - Returns true if all bits are set.
200 return getSmallBits() == (uintptr_t(1) << getSmallSize()) - 1;
201 return getPointer()->all();
204 /// none - Returns true if none of the bits are set.
207 return getSmallBits() == 0;
208 return getPointer()->none();
211 /// find_first - Returns the index of the first set bit, -1 if none
212 /// of the bits are set.
213 int find_first() const {
215 uintptr_t Bits = getSmallBits();
218 if (sizeof(uintptr_t) * CHAR_BIT == 32)
219 return CountTrailingZeros_32(Bits);
220 if (sizeof(uintptr_t) * CHAR_BIT == 64)
221 return CountTrailingZeros_64(Bits);
222 llvm_unreachable("Unsupported!");
224 return getPointer()->find_first();
227 /// find_next - Returns the index of the next set bit following the
228 /// "Prev" bit. Returns -1 if the next set bit is not found.
229 int find_next(unsigned Prev) const {
231 uintptr_t Bits = getSmallBits();
232 // Mask off previous bits.
233 Bits &= ~uintptr_t(0) << (Prev + 1);
234 if (Bits == 0 || Prev + 1 >= getSmallSize())
236 if (sizeof(uintptr_t) * CHAR_BIT == 32)
237 return CountTrailingZeros_32(Bits);
238 if (sizeof(uintptr_t) * CHAR_BIT == 64)
239 return CountTrailingZeros_64(Bits);
240 llvm_unreachable("Unsupported!");
242 return getPointer()->find_next(Prev);
245 /// clear - Clear all bits.
252 /// resize - Grow or shrink the bitvector.
253 void resize(unsigned N, bool t = false) {
255 getPointer()->resize(N, t);
256 } else if (SmallNumDataBits >= N) {
257 uintptr_t NewBits = t ? ~uintptr_t(0) << getSmallSize() : 0;
259 setSmallBits(NewBits | getSmallBits());
261 BitVector *BV = new BitVector(N, t);
262 uintptr_t OldBits = getSmallBits();
263 for (size_t i = 0, e = getSmallSize(); i != e; ++i)
264 (*BV)[i] = (OldBits >> i) & 1;
269 void reserve(unsigned N) {
271 if (N > SmallNumDataBits) {
272 uintptr_t OldBits = getSmallRawBits();
273 size_t SmallSize = getSmallSize();
274 BitVector *BV = new BitVector(SmallSize);
275 for (size_t i = 0; i < SmallSize; ++i)
276 if ((OldBits >> i) & 1)
282 getPointer()->reserve(N);
287 SmallBitVector &set() {
289 setSmallBits(~uintptr_t(0));
295 SmallBitVector &set(unsigned Idx) {
297 setSmallBits(getSmallBits() | (uintptr_t(1) << Idx));
299 getPointer()->set(Idx);
303 SmallBitVector &reset() {
307 getPointer()->reset();
311 SmallBitVector &reset(unsigned Idx) {
313 setSmallBits(getSmallBits() & ~(uintptr_t(1) << Idx));
315 getPointer()->reset(Idx);
319 SmallBitVector &flip() {
321 setSmallBits(~getSmallBits());
323 getPointer()->flip();
327 SmallBitVector &flip(unsigned Idx) {
329 setSmallBits(getSmallBits() ^ (uintptr_t(1) << Idx));
331 getPointer()->flip(Idx);
336 SmallBitVector operator~() const {
337 return SmallBitVector(*this).flip();
341 reference operator[](unsigned Idx) {
342 assert(Idx < size() && "Out-of-bounds Bit access.");
343 return reference(*this, Idx);
346 bool operator[](unsigned Idx) const {
347 assert(Idx < size() && "Out-of-bounds Bit access.");
349 return ((getSmallBits() >> Idx) & 1) != 0;
350 return getPointer()->operator[](Idx);
353 bool test(unsigned Idx) const {
357 /// Test if any common bits are set.
358 bool anyCommon(const SmallBitVector &RHS) const {
359 if (isSmall() && RHS.isSmall())
360 return (getSmallBits() & RHS.getSmallBits()) != 0;
361 if (!isSmall() && !RHS.isSmall())
362 return getPointer()->anyCommon(*RHS.getPointer());
364 for (unsigned i = 0, e = std::min(size(), RHS.size()); i != e; ++i)
365 if (test(i) && RHS.test(i))
370 // Comparison operators.
371 bool operator==(const SmallBitVector &RHS) const {
372 if (size() != RHS.size())
375 return getSmallBits() == RHS.getSmallBits();
377 return *getPointer() == *RHS.getPointer();
380 bool operator!=(const SmallBitVector &RHS) const {
381 return !(*this == RHS);
384 // Intersection, union, disjoint union.
385 SmallBitVector &operator&=(const SmallBitVector &RHS) {
386 resize(std::max(size(), RHS.size()));
388 setSmallBits(getSmallBits() & RHS.getSmallBits());
389 else if (!RHS.isSmall())
390 getPointer()->operator&=(*RHS.getPointer());
392 SmallBitVector Copy = RHS;
394 getPointer()->operator&=(*Copy.getPointer());
399 SmallBitVector &operator|=(const SmallBitVector &RHS) {
400 resize(std::max(size(), RHS.size()));
402 setSmallBits(getSmallBits() | RHS.getSmallBits());
403 else if (!RHS.isSmall())
404 getPointer()->operator|=(*RHS.getPointer());
406 SmallBitVector Copy = RHS;
408 getPointer()->operator|=(*Copy.getPointer());
413 SmallBitVector &operator^=(const SmallBitVector &RHS) {
414 resize(std::max(size(), RHS.size()));
416 setSmallBits(getSmallBits() ^ RHS.getSmallBits());
417 else if (!RHS.isSmall())
418 getPointer()->operator^=(*RHS.getPointer());
420 SmallBitVector Copy = RHS;
422 getPointer()->operator^=(*Copy.getPointer());
427 // Assignment operator.
428 const SmallBitVector &operator=(const SmallBitVector &RHS) {
433 switchToLarge(new BitVector(*RHS.getPointer()));
436 *getPointer() = *RHS.getPointer();
445 #if LLVM_USE_RVALUE_REFERENCES
446 const SmallBitVector &operator=(SmallBitVector &&RHS) {
455 void swap(SmallBitVector &RHS) {
459 /// setBitsInMask - Add '1' bits from Mask to this vector. Don't resize.
460 /// This computes "*this |= Mask".
461 void setBitsInMask(const uint32_t *Mask, unsigned MaskWords = ~0u) {
463 applyMask<true, false>(Mask, MaskWords);
465 getPointer()->setBitsInMask(Mask, MaskWords);
468 /// clearBitsInMask - Clear any bits in this vector that are set in Mask.
469 /// Don't resize. This computes "*this &= ~Mask".
470 void clearBitsInMask(const uint32_t *Mask, unsigned MaskWords = ~0u) {
472 applyMask<false, false>(Mask, MaskWords);
474 getPointer()->clearBitsInMask(Mask, MaskWords);
477 /// setBitsNotInMask - Add a bit to this vector for every '0' bit in Mask.
478 /// Don't resize. This computes "*this |= ~Mask".
479 void setBitsNotInMask(const uint32_t *Mask, unsigned MaskWords = ~0u) {
481 applyMask<true, true>(Mask, MaskWords);
483 getPointer()->setBitsNotInMask(Mask, MaskWords);
486 /// clearBitsNotInMask - Clear a bit in this vector for every '0' bit in Mask.
487 /// Don't resize. This computes "*this &= Mask".
488 void clearBitsNotInMask(const uint32_t *Mask, unsigned MaskWords = ~0u) {
490 applyMask<false, true>(Mask, MaskWords);
492 getPointer()->clearBitsNotInMask(Mask, MaskWords);
496 template<bool AddBits, bool InvertMask>
497 void applyMask(const uint32_t *Mask, unsigned MaskWords) {
498 assert((NumBaseBits == 64 || NumBaseBits == 32) && "Unsupported word size");
499 if (NumBaseBits == 64 && MaskWords >= 2) {
500 uint64_t M = Mask[0] | (uint64_t(Mask[1]) << 32);
501 if (InvertMask) M = ~M;
502 if (AddBits) setSmallBits(getSmallBits() | M);
503 else setSmallBits(getSmallBits() & ~M);
505 uint32_t M = Mask[0];
506 if (InvertMask) M = ~M;
507 if (AddBits) setSmallBits(getSmallBits() | M);
508 else setSmallBits(getSmallBits() & ~M);
513 inline SmallBitVector
514 operator&(const SmallBitVector &LHS, const SmallBitVector &RHS) {
515 SmallBitVector Result(LHS);
520 inline SmallBitVector
521 operator|(const SmallBitVector &LHS, const SmallBitVector &RHS) {
522 SmallBitVector Result(LHS);
527 inline SmallBitVector
528 operator^(const SmallBitVector &LHS, const SmallBitVector &RHS) {
529 SmallBitVector Result(LHS);
534 } // End llvm namespace
537 /// Implement std::swap in terms of BitVector swap.
539 swap(llvm::SmallBitVector &LHS, llvm::SmallBitVector &RHS) {