//
// The LLVM Compiler Infrastructure
//
-// This file was developed by Daniel Berlin and is distributed under
-// the University of Illinois Open Source License. See LICENSE.TXT for details.
+// This file is distributed under the University of Illinois Open Source
+// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
#include <cassert>
#include <cstring>
-#include <list>
#include <algorithm>
#include "llvm/Support/DataTypes.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/Support/MathExtras.h"
-
+#include "llvm/ADT/ilist.h"
namespace llvm {
/// SparseBitVector is an implementation of a bitvector that is sparse by only
BITWORDS_PER_ELEMENT = (ElementSize + BITWORD_SIZE - 1) / BITWORD_SIZE,
BITS_PER_ELEMENT = ElementSize
};
+
+ SparseBitVectorElement<ElementSize> *getNext() const {
+ return Next;
+ }
+ SparseBitVectorElement<ElementSize> *getPrev() const {
+ return Prev;
+ }
+
+ void setNext(SparseBitVectorElement<ElementSize> *RHS) {
+ Next = RHS;
+ }
+ void setPrev(SparseBitVectorElement<ElementSize> *RHS) {
+ Prev = RHS;
+ }
+
private:
+ SparseBitVectorElement<ElementSize> *Next;
+ SparseBitVectorElement<ElementSize> *Prev;
// Index of Element in terms of where first bit starts.
unsigned ElementIndex;
BitWord Bits[BITWORDS_PER_ELEMENT];
- SparseBitVectorElement();
+ // Needed for sentinels
+ SparseBitVectorElement() {
+ ElementIndex = ~0U;
+ memset(&Bits[0], 0, sizeof (BitWord) * BITWORDS_PER_ELEMENT);
+ }
+
+ friend struct ilist_traits<SparseBitVectorElement<ElementSize> >;
public:
explicit SparseBitVectorElement(unsigned Idx) {
ElementIndex = Idx;
ElementIndex = RHS.ElementIndex;
std::copy(&RHS.Bits[0], &RHS.Bits[BITWORDS_PER_ELEMENT], Bits);
}
+
+ // Assignment
+ SparseBitVectorElement& operator=(const SparseBitVectorElement& RHS) {
+ ElementIndex = RHS.ElementIndex;
+ std::copy(&RHS.Bits[0], &RHS.Bits[BITWORDS_PER_ELEMENT], Bits);
+
+ return *this;
+ }
// Comparison.
bool operator==(const SparseBitVectorElement &RHS) const {
bool test_and_set (unsigned Idx) {
bool old = test(Idx);
- if (!old)
+ if (!old) {
set(Idx);
- return !old;
+ return true;
+ }
+ return false;
}
void reset(unsigned Idx) {
assert(0 && "Unsupported!");
}
assert(0 && "Illegal empty element");
+ return 0; // Not reached
}
- /// 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 >= BITS_PER_ELEMENT)
+ /// find_next - Returns the index of the next set bit starting from the
+ /// "Curr" bit. Returns -1 if the next set bit is not found.
+ int find_next(unsigned Curr) const {
+ if (Curr >= BITS_PER_ELEMENT)
return -1;
- unsigned WordPos = Prev / BITWORD_SIZE;
- unsigned BitPos = Prev % BITWORD_SIZE;
+ unsigned WordPos = Curr / BITWORD_SIZE;
+ unsigned BitPos = Curr % BITWORD_SIZE;
BitWord Copy = Bits[WordPos];
assert (WordPos <= BITWORDS_PER_ELEMENT
&& "Word Position outside of element");
BitWord old = changed ? 0 : Bits[i];
Bits[i] |= RHS.Bits[i];
- if (old != Bits[i])
+ if (!changed && old != Bits[i])
changed = true;
}
return changed;
if (Bits[i] != 0)
allzero = false;
- if (old != Bits[i])
+ if (!changed && old != Bits[i])
changed = true;
}
- BecameZero = !allzero;
+ BecameZero = allzero;
return changed;
}
// Intersect this Element with the complement of RHS and return true if this
// one changed. BecameZero is set to true if this element became all-zero
// bits.
bool intersectWithComplement(const SparseBitVectorElement &RHS,
- bool &BecameZero) {
+ bool &BecameZero) {
bool changed = false;
bool allzero = true;
if (Bits[i] != 0)
allzero = false;
- if (old != Bits[i])
+ if (!changed && old != Bits[i])
changed = true;
}
- BecameZero = !allzero;
+ BecameZero = allzero;
return changed;
}
// Three argument version of intersectWithComplement that intersects
if (Bits[i] != 0)
allzero = false;
}
- BecameZero = !allzero;
+ BecameZero = allzero;
}
+ // Get a hash value for this element;
+ uint64_t getHashValue() const {
+ uint64_t HashVal = 0;
+ for (unsigned i = 0; i < BITWORDS_PER_ELEMENT; ++i) {
+ HashVal ^= Bits[i];
+ }
+ return HashVal;
+ }
};
template <unsigned ElementSize = 128>
class SparseBitVector {
- typedef std::list<SparseBitVectorElement<ElementSize> *> ElementList;
+ typedef ilist<SparseBitVectorElement<ElementSize> > ElementList;
typedef typename ElementList::iterator ElementListIter;
typedef typename ElementList::const_iterator ElementListConstIter;
enum {
// Search from our current iterator, either backwards or forwards,
// depending on what element we are looking for.
ElementListIter ElementIter = CurrElementIter;
- if ((*CurrElementIter)->index() == ElementIndex) {
+ if (CurrElementIter->index() == ElementIndex) {
return ElementIter;
- } else if ((*CurrElementIter)->index() > ElementIndex) {
+ } else if (CurrElementIter->index() > ElementIndex) {
while (ElementIter != Elements.begin()
- && (*ElementIter)->index() > ElementIndex)
+ && ElementIter->index() > ElementIndex)
--ElementIter;
} else {
while (ElementIter != Elements.end() &&
- (*ElementIter)->index() <= ElementIndex)
+ ElementIter->index() < ElementIndex)
++ElementIter;
- --ElementIter;
}
CurrElementIter = ElementIter;
return ElementIter;
return;
}
Iter = BitVector->Elements.begin();
- BitNumber = (*Iter)->index() * ElementSize;
- unsigned BitPos = (*Iter)->find_first();
+ BitNumber = Iter->index() * ElementSize;
+ unsigned BitPos = Iter->find_first();
BitNumber += BitPos;
WordNumber = (BitNumber % ElementSize) / BITWORD_SIZE;
- Bits = (*Iter)->word(WordNumber);
+ Bits = Iter->word(WordNumber);
Bits >>= BitPos % BITWORD_SIZE;
}
// See if we ran out of Bits in this word.
if (!Bits) {
- int NextSetBitNumber = (*Iter)->find_next(BitNumber % ElementSize) ;
+ int NextSetBitNumber = Iter->find_next(BitNumber % ElementSize) ;
// If we ran out of set bits in this element, move to next element.
if (NextSetBitNumber == -1 || (BitNumber % ElementSize == 0)) {
++Iter;
return;
}
// Set up for next non zero word in bitmap.
- BitNumber = (*Iter)->index() * ElementSize;
- NextSetBitNumber = (*Iter)->find_first();
+ BitNumber = Iter->index() * ElementSize;
+ NextSetBitNumber = Iter->find_first();
BitNumber += NextSetBitNumber;
WordNumber = (BitNumber % ElementSize) / BITWORD_SIZE;
- Bits = (*Iter)->word(WordNumber);
+ Bits = Iter->word(WordNumber);
Bits >>= NextSetBitNumber % BITWORD_SIZE;
} else {
WordNumber = (NextSetBitNumber % ElementSize) / BITWORD_SIZE;
- Bits = (*Iter)->word(WordNumber);
+ Bits = Iter->word(WordNumber);
Bits >>= NextSetBitNumber % BITWORD_SIZE;
+ BitNumber = Iter->index() * ElementSize;
+ BitNumber += NextSetBitNumber;
}
}
}
bool operator==(const SparseBitVectorIterator &RHS) const {
// If they are both at the end, ignore the rest of the fields.
- if (AtEnd == RHS.AtEnd)
+ if (AtEnd && RHS.AtEnd)
return true;
// Otherwise they are the same if they have the same bit number and
// bitmap.
}
~SparseBitVector() {
- for_each(Elements.begin(), Elements.end(),
- deleter<SparseBitVectorElement<ElementSize> >);
}
// SparseBitVector copy ctor.
SparseBitVector(const SparseBitVector &RHS) {
ElementListConstIter ElementIter = RHS.Elements.begin();
while (ElementIter != RHS.Elements.end()) {
- SparseBitVectorElement<ElementSize> *ElementCopy;
- ElementCopy = new SparseBitVectorElement<ElementSize>(*(*ElementIter));
- Elements.push_back(ElementCopy);
+ Elements.push_back(SparseBitVectorElement<ElementSize>(*ElementIter));
+ ++ElementIter;
+ }
+
+ CurrElementIter = Elements.begin ();
+ }
+
+ // Assignment
+ SparseBitVector& operator=(const SparseBitVector& RHS) {
+ Elements.clear();
+
+ ElementListConstIter ElementIter = RHS.Elements.begin();
+ while (ElementIter != RHS.Elements.end()) {
+ Elements.push_back(SparseBitVectorElement<ElementSize>(*ElementIter));
+ ++ElementIter;
}
CurrElementIter = Elements.begin ();
+
+ return *this;
}
// Test, Reset, and Set a bit in the bitmap.
// If we can't find an element that is supposed to contain this bit, there
// is nothing more to do.
if (ElementIter == Elements.end() ||
- (*ElementIter)->index() != ElementIndex)
+ ElementIter->index() != ElementIndex)
return false;
- return (*ElementIter)->test(Idx % ElementSize);
+ return ElementIter->test(Idx % ElementSize);
}
void reset(unsigned Idx) {
// If we can't find an element that is supposed to contain this bit, there
// is nothing more to do.
if (ElementIter == Elements.end() ||
- (*ElementIter)->index() != ElementIndex)
+ ElementIter->index() != ElementIndex)
return;
- (*ElementIter)->reset(Idx % ElementSize);
+ ElementIter->reset(Idx % ElementSize);
// When the element is zeroed out, delete it.
- if ((*ElementIter)->empty()) {
- delete (*ElementIter);
+ if (ElementIter->empty()) {
++CurrElementIter;
Elements.erase(ElementIter);
}
}
void set(unsigned Idx) {
- SparseBitVectorElement<ElementSize> *Element;
unsigned ElementIndex = Idx / ElementSize;
-
+ SparseBitVectorElement<ElementSize> *Element;
+ ElementListIter ElementIter;
if (Elements.empty()) {
Element = new SparseBitVectorElement<ElementSize>(ElementIndex);
- Elements.push_back(Element);
+ ElementIter = Elements.insert(Elements.end(), Element);
+
} else {
- ElementListIter ElementIter = FindLowerBound(ElementIndex);
+ ElementIter = FindLowerBound(ElementIndex);
- if (ElementIter != Elements.end() &&
- (*ElementIter)->index() == ElementIndex)
- Element = *ElementIter;
- else {
+ if (ElementIter == Elements.end() ||
+ ElementIter->index() != ElementIndex) {
Element = new SparseBitVectorElement<ElementSize>(ElementIndex);
- // Insert does insert before, and lower bound gives the one before.
- Elements.insert(++ElementIter, Element);
+ // We may have hit the beginning of our SparseBitVector, in which case,
+ // we may need to insert right after this element, which requires moving
+ // the current iterator forward one, because insert does insert before.
+ if (ElementIter != Elements.end() &&
+ ElementIter->index() < ElementIndex)
+ ElementIter = Elements.insert(++ElementIter, Element);
+ else
+ ElementIter = Elements.insert(ElementIter, Element);
}
}
- Element->set(Idx % ElementSize);
+ CurrElementIter = ElementIter;
+
+ ElementIter->set(Idx % ElementSize);
}
bool test_and_set (unsigned Idx) {
bool old = test(Idx);
- if (!old)
+ if (!old) {
set(Idx);
- return !old;
+ return true;
+ }
+ return false;
+ }
+
+ bool operator!=(const SparseBitVector &RHS) const {
+ return !(*this == RHS);
+ }
+
+ bool operator==(const SparseBitVector &RHS) const {
+ ElementListConstIter Iter1 = Elements.begin();
+ ElementListConstIter Iter2 = RHS.Elements.begin();
+
+ for (; Iter1 != Elements.end() && Iter2 != RHS.Elements.end();
+ ++Iter1, ++Iter2) {
+ if (*Iter1 != *Iter2)
+ return false;
+ }
+ return Iter1 == Elements.end() && Iter2 == RHS.Elements.end();
}
// Union our bitmap with the RHS and return true if we changed.
ElementListIter Iter1 = Elements.begin();
ElementListConstIter Iter2 = RHS.Elements.begin();
- // IE They may both be end
- if (Iter1 == Iter2)
+ // If RHS is empty, we are done
+ if (RHS.Elements.empty())
return false;
- // See if the first bitmap element is the same in both. This is only
- // possible if they are the same bitmap.
- if (Iter1 != Elements.end() && Iter2 != RHS.Elements.end())
- if (*Iter1 == *Iter2)
- return false;
-
while (Iter2 != RHS.Elements.end()) {
- if (Iter1 == Elements.end() || (*Iter1)->index() > (*Iter2)->index()) {
- SparseBitVectorElement<ElementSize> *NewElem;
-
- NewElem = new SparseBitVectorElement<ElementSize>(*(*Iter2));
- Elements.insert(Iter1, NewElem);
+ if (Iter1 == Elements.end() || Iter1->index() > Iter2->index()) {
+ Elements.insert(Iter1,
+ new SparseBitVectorElement<ElementSize>(*Iter2));
++Iter2;
changed = true;
- } else if ((*Iter1)->index() == (*Iter2)->index()) {
- changed |= (*Iter1)->unionWith(*(*Iter2));
+ } else if (Iter1->index() == Iter2->index()) {
+ changed |= Iter1->unionWith(*Iter2);
++Iter1;
++Iter2;
} else {
ElementListIter Iter1 = Elements.begin();
ElementListConstIter Iter2 = RHS.Elements.begin();
- // IE They may both be end.
- if (Iter1 == Iter2)
+ // Check if both bitmaps are empty.
+ if (Elements.empty() && RHS.Elements.empty())
return false;
- // See if the first bitmap element is the same in both. This is only
- // possible if they are the same bitmap.
- if (Iter1 != Elements.end() && Iter2 != RHS.Elements.end())
- if (*Iter1 == *Iter2)
- return false;
-
// Loop through, intersecting as we go, erasing elements when necessary.
while (Iter2 != RHS.Elements.end()) {
- if (Iter1 == Elements.end())
+ if (Iter1 == Elements.end()) {
+ CurrElementIter = Elements.begin();
return changed;
+ }
- if ((*Iter1)->index() > (*Iter2)->index()) {
+ if (Iter1->index() > Iter2->index()) {
++Iter2;
- } else if ((*Iter1)->index() == (*Iter2)->index()) {
+ } else if (Iter1->index() == Iter2->index()) {
bool BecameZero;
- changed |= (*Iter1)->intersectWith(*(*Iter2), BecameZero);
+ changed |= Iter1->intersectWith(*Iter2, BecameZero);
if (BecameZero) {
ElementListIter IterTmp = Iter1;
- delete *IterTmp;
+ ++Iter1;
Elements.erase(IterTmp);
+ } else {
+ ++Iter1;
}
- ++Iter1;
++Iter2;
} else {
ElementListIter IterTmp = Iter1;
++Iter1;
- delete *IterTmp;
Elements.erase(IterTmp);
}
}
- for_each(Iter1, Elements.end(),
- deleter<SparseBitVectorElement<ElementSize> >);
Elements.erase(Iter1, Elements.end());
CurrElementIter = Elements.begin();
return changed;
ElementListIter Iter1 = Elements.begin();
ElementListConstIter Iter2 = RHS.Elements.begin();
- // IE They may both be end.
- if (Iter1 == Iter2)
+ // If either our bitmap or RHS is empty, we are done
+ if (Elements.empty() || RHS.Elements.empty())
return false;
- // See if the first bitmap element is the same in both. This is only
- // possible if they are the same bitmap.
- if (Iter1 != Elements.end() && Iter2 != RHS.Elements.end())
- if (*Iter1 == *Iter2) {
- for_each(Elements.begin(), Elements.end(),
- deleter<SparseBitVectorElement<ElementSize> >);
- Elements.clear();
- return true;
- }
-
// Loop through, intersecting as we go, erasing elements when necessary.
while (Iter2 != RHS.Elements.end()) {
- if (Iter1 == Elements.end())
+ if (Iter1 == Elements.end()) {
+ CurrElementIter = Elements.begin();
return changed;
+ }
- if ((*Iter1)->index() > (*Iter2)->index()) {
+ if (Iter1->index() > Iter2->index()) {
++Iter2;
- } else if ((*Iter1)->index() == (*Iter2)->index()) {
+ } else if (Iter1->index() == Iter2->index()) {
bool BecameZero;
- changed |= (*Iter1)->intersectWithComplement(*(*Iter2), BecameZero);
+ changed |= Iter1->intersectWithComplement(*Iter2, BecameZero);
if (BecameZero) {
ElementListIter IterTmp = Iter1;
- delete *IterTmp;
+ ++Iter1;
Elements.erase(IterTmp);
+ } else {
+ ++Iter1;
}
- ++Iter1;
++Iter2;
} else {
- ElementListIter IterTmp = Iter1;
++Iter1;
- delete *IterTmp;
- Elements.erase(IterTmp);
}
}
CurrElementIter = Elements.begin();
void intersectWithComplement(const SparseBitVector<ElementSize> &RHS1,
const SparseBitVector<ElementSize> &RHS2)
{
- for_each(Elements.begin(), Elements.end(),
- deleter<SparseBitVectorElement<ElementSize> >);
Elements.clear();
-
+ CurrElementIter = Elements.begin();
ElementListConstIter Iter1 = RHS1.Elements.begin();
ElementListConstIter Iter2 = RHS2.Elements.begin();
- // IE They may both be end.
- if (Iter1 == Iter2)
+ // If RHS1 is empty, we are done
+ // If RHS2 is empty, we still have to copy RHS1
+ if (RHS1.Elements.empty())
return;
- // See if the first bitmap element is the same in both. This is only
- // possible if they are the same bitmap.
- if (Iter1 != RHS1.Elements.end() && Iter2 != RHS2.Elements.end())
- if (*Iter1 == *Iter2) {
- return;
- }
-
// Loop through, intersecting as we go, erasing elements when necessary.
while (Iter2 != RHS2.Elements.end()) {
if (Iter1 == RHS1.Elements.end())
return;
- if ((*Iter1)->index() > (*Iter2)->index()) {
+ if (Iter1->index() > Iter2->index()) {
++Iter2;
- } else if ((*Iter1)->index() == (*Iter2)->index()) {
+ } else if (Iter1->index() == Iter2->index()) {
bool BecameZero = false;
SparseBitVectorElement<ElementSize> *NewElement =
- new SparseBitVectorElement<ElementSize>((*Iter1)->index());
-
- NewElement->intersectWithComplement(*(*Iter1), *(*Iter2), BecameZero);
- if (BecameZero) {
- delete NewElement;
- } else {
+ new SparseBitVectorElement<ElementSize>(Iter1->index());
+ NewElement->intersectWithComplement(*Iter1, *Iter2, BecameZero);
+ if (!BecameZero) {
Elements.push_back(NewElement);
}
-
+ else
+ delete NewElement;
++Iter1;
++Iter2;
} else {
+ SparseBitVectorElement<ElementSize> *NewElement =
+ new SparseBitVectorElement<ElementSize>(*Iter1);
+ Elements.push_back(NewElement);
++Iter1;
}
}
+
// copy the remaining elements
-
while (Iter1 != RHS1.Elements.end()) {
SparseBitVectorElement<ElementSize> *NewElement =
- new SparseBitVectorElement<ElementSize>(*(*Iter1));
+ new SparseBitVectorElement<ElementSize>(*Iter1);
Elements.push_back(NewElement);
+ ++Iter1;
}
-
- CurrElementIter = Elements.begin();
+
return;
}
ElementListConstIter Iter1 = Elements.begin();
ElementListConstIter Iter2 = RHS.Elements.begin();
- // IE They may both be end.
- if (Iter1 == Iter2)
+ // Check if both bitmaps are empty.
+ if (Elements.empty() && RHS.Elements.empty())
return false;
- // See if the first bitmap element is the same in both. This is only
- // possible if they are the same bitmap.
- if (Iter1 != Elements.end() && Iter2 != RHS.Elements.end())
- if (*Iter1 == *Iter2) {
- return true;
- }
-
// Loop through, intersecting stopping when we hit bits in common.
while (Iter2 != RHS.Elements.end()) {
if (Iter1 == Elements.end())
return false;
- if ((*Iter1)->index() > (*Iter2)->index()) {
+ if (Iter1->index() > Iter2->index()) {
++Iter2;
- } else if ((*Iter1)->index() == (*Iter2)->index()) {
- if ((*Iter1)->intersects(*(*Iter2)))
+ } else if (Iter1->index() == Iter2->index()) {
+ if (Iter1->intersects(*Iter2))
return true;
++Iter1;
++Iter2;
int find_first() const {
if (Elements.empty())
return -1;
- const SparseBitVectorElement<ElementSize> *First = *(Elements.begin());
- return (First->index() * ElementSize) + First->find_first();
+ const SparseBitVectorElement<ElementSize> &First = *(Elements.begin());
+ return (First.index() * ElementSize) + First.find_first();
}
// Return true if the SparseBitVector is empty
for (ElementListConstIter Iter = Elements.begin();
Iter != Elements.end();
++Iter)
- BitCount += (*Iter)->count();
+ BitCount += Iter->count();
return BitCount;
}
}
iterator end() const {
- return iterator(this, ~0);
+ return iterator(this, true);
+ }
+
+ // Get a hash value for this bitmap.
+ uint64_t getHashValue() const {
+ uint64_t HashVal = 0;
+ for (ElementListConstIter Iter = Elements.begin();
+ Iter != Elements.end();
+ ++Iter) {
+ HashVal ^= Iter->index();
+ HashVal ^= Iter->getHashValue();
+ }
+ return HashVal;
}
};
return LHS &= (*RHS);
}
+
+// Dump a SparseBitVector to a stream
+template <unsigned ElementSize>
+void dump(const SparseBitVector<ElementSize> &LHS, llvm::OStream &out) {
+ out << "[ ";
+
+ typename SparseBitVector<ElementSize>::iterator bi;
+ for (bi = LHS.begin(); bi != LHS.end(); ++bi) {
+ out << *bi << " ";
+ }
+ out << " ]\n";
}
+}
+
+
#endif