BitVector(const BitVector &RHS) : Size(RHS.size()) {
if (Size == 0) {
Bits = NULL;
+ Capacity = 0;
return;
}
/// of the bits are set.
int find_first() const {
for (unsigned i = 0; i < NumBitWords(size()); ++i)
- if (Bits[i] != 0)
- return i * BITS_PER_WORD + CountTrailingZeros_32(Bits[i]);
+ if (Bits[i] != 0) {
+ if (sizeof(BitWord) == 4)
+ return i * BITS_PER_WORD + CountTrailingZeros_32(Bits[i]);
+ else if (sizeof(BitWord) == 8)
+ return i * BITS_PER_WORD + CountTrailingZeros_64(Bits[i]);
+ else
+ assert(0 && "Unsupported!");
+ }
return -1;
}
unsigned BitPos = Prev % BITS_PER_WORD;
BitWord Copy = Bits[WordPos];
// Mask off previous bits.
- Copy &= ~0 << BitPos;
+ Copy &= ~0L << BitPos;
- if (Copy != 0)
- return WordPos * BITS_PER_WORD + CountTrailingZeros_32(Copy);
+ if (Copy != 0) {
+ if (sizeof(BitWord) == 4)
+ return WordPos * BITS_PER_WORD + CountTrailingZeros_32(Copy);
+ else if (sizeof(BitWord) == 8)
+ return WordPos * BITS_PER_WORD + CountTrailingZeros_64(Copy);
+ else
+ assert(0 && "Unsupported!");
+ }
// Check subsequent words.
for (unsigned i = WordPos+1; i < NumBitWords(size()); ++i)
- if (Bits[i] != 0)
- return i * BITS_PER_WORD + CountTrailingZeros_32(Bits[i]);
+ if (Bits[i] != 0) {
+ if (sizeof(BitWord) == 4)
+ return i * BITS_PER_WORD + CountTrailingZeros_32(Bits[i]);
+ else if (sizeof(BitWord) == 8)
+ return i * BITS_PER_WORD + CountTrailingZeros_64(Bits[i]);
+ else
+ assert(0 && "Unsupported!");
+ }
return -1;
}
// Clear the unused top bits in the high word.
void clear_unused_bits() {
- if (Size) {
- unsigned ExtraBits = Size % BITS_PER_WORD;
- Bits[Size / BITS_PER_WORD] &= ~(~0 << ExtraBits);
+ unsigned ExtraBits = Size % BITS_PER_WORD;
+ if (ExtraBits) {
+ unsigned index = Size / BITS_PER_WORD;
+ Bits[index] &= ~(~0L << ExtraBits);
}
}