Searched refs:SparseBitVector (Results 1 – 9 of 9) sorted by relevance
263 class SparseBitVector {312 const SparseBitVector<ElementSize> *BitVector;418 SparseBitVectorIterator(const SparseBitVector<ElementSize> *RHS,431 SparseBitVector () {435 ~SparseBitVector() {439 SparseBitVector(const SparseBitVector &RHS) {455 SparseBitVector& operator=(const SparseBitVector& RHS) {544 bool operator!=(const SparseBitVector &RHS) const {548 bool operator==(const SparseBitVector &RHS) const {561 bool operator|=(const SparseBitVector &RHS) {[all …]
29 template <unsigned Element> class SparseBitVector; variable30 typedef SparseBitVector<128> LiveVirtRegBitSet;
84 SparseBitVector<> AliveBlocks;125 SparseBitVector<> PHIJoins;
18 SparseBitVector<> Vec; in TEST()
200 typedef SparseBitVector<> RegUnitList;
576 DiffVec &diffEncode(DiffVec &V, unsigned InitVal, SparseBitVector<> List) { in diffEncode()852 SparseBitVector<> RUs = Reg.getNativeRegUnits(); in runMCDesc()
1430 SparseBitVector<> &NormalRegs, in normalizeWeight()1505 SparseBitVector<> NormalRegs; in computeRegUnitWeights()
70 for (SparseBitVector<>::iterator I = AliveBlocks.begin(), in dump()
1495 Bit storage containers (BitVector, SparseBitVector)1535 SparseBitVector argument1538 The SparseBitVector container is much like BitVector, with one major difference:1539 Only the bits that are set, are stored. This makes the SparseBitVector much1542 downside to the SparseBitVector is that setting and testing of random bits is1547 testing/setting bits in a SparseBitVector is O(distance away from last set bit).