Home
last modified time | relevance | path

Searched refs:SparseBitVector (Results 1 – 6 of 6) sorted by relevance

/external/llvm/include/llvm/ADT/
DSparseBitVector.h283 class SparseBitVector {
332 const SparseBitVector<ElementSize> *BitVector;
438 SparseBitVectorIterator(const SparseBitVector<ElementSize> *RHS,
451 SparseBitVector () {
455 ~SparseBitVector() {
459 SparseBitVector(const SparseBitVector &RHS) {
475 SparseBitVector& operator=(const SparseBitVector& RHS) {
564 bool operator!=(const SparseBitVector &RHS) const {
568 bool operator==(const SparseBitVector &RHS) const {
581 bool operator|=(const SparseBitVector &RHS) {
[all …]
/external/llvm/include/llvm/CodeGen/
DLiveIntervalUnion.h29 template <unsigned Element> class SparseBitVector; variable
30 typedef SparseBitVector<128> LiveVirtRegBitSet;
DLiveVariables.h84 SparseBitVector<> AliveBlocks;
125 SparseBitVector<> PHIJoins;
/external/llvm/unittests/ADT/
DSparseBitVectorTest.cpp18 SparseBitVector<> Vec; in TEST()
/external/llvm/lib/CodeGen/
DLiveVariables.cpp70 for (SparseBitVector<>::iterator I = AliveBlocks.begin(), in dump()
/external/llvm/docs/
DProgrammersManual.rst1491 Bit storage containers (BitVector, SparseBitVector)
1531 SparseBitVector argument
1534 The SparseBitVector container is much like BitVector, with one major difference:
1535 Only the bits that are set, are stored. This makes the SparseBitVector much
1538 downside to the SparseBitVector is that setting and testing of random bits is
1543 testing/setting bits in a SparseBitVector is O(distance away from last set bit).