| /llvm-project-15.0.7/llvm/include/llvm/ADT/ |
| H A D | SparseBitVector.h | 256 class SparseBitVector {
446 SparseBitVector(const SparseBitVector &RHS) in SparseBitVector() function
448 SparseBitVector(SparseBitVector &&RHS) in SparseBitVector() function
457 SparseBitVector& operator=(const SparseBitVector& RHS) {
465 SparseBitVector &operator=(SparseBitVector &&RHS) {
695 SparseBitVector RHS2Copy(RHS2); in intersectWithComplement()
849 inline SparseBitVector<ElementSize>
852 SparseBitVector<ElementSize> Result(LHS);
858 inline SparseBitVector<ElementSize>
867 inline SparseBitVector<ElementSize>
[all …]
|
| /llvm-project-15.0.7/llvm/unittests/ADT/ |
| H A D | SparseBitVectorTest.cpp | 17 SparseBitVector<> Vec; in TEST()
35 const SparseBitVector<> ConstVec = Vec; in TEST()
46 SparseBitVector<> MovedVec(std::move(Vec)); in TEST()
57 SparseBitVector<> Vec, Other; in TEST()
87 SparseBitVector<> Vec, Other; in TEST()
91 Vec = static_cast<SparseBitVector<> &>(Vec); in TEST()
151 SparseBitVector<> Vec; in TEST()
|
| /llvm-project-15.0.7/llvm/lib/DebugInfo/PDB/Native/ |
| H A D | HashTable.cpp | 22 SparseBitVector<> &V) { in readSparseBitVector()
44 SparseBitVector<> &Vec) { in writeSparseBitVector()
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | LiveVariables.h | 85 SparseBitVector<> AliveBlocks;
124 SparseBitVector<> PHIJoins;
308 std::vector<SparseBitVector<>> &LiveInSets);
|
| H A D | LiveIntervalUnion.h | 33 template <unsigned Element> class SparseBitVector; variable
35 using LiveVirtRegBitSet = SparseBitVector<128>;
|
| H A D | MachineBasicBlock.h | 865 std::vector<SparseBitVector<>> *LiveInSets = nullptr);
|
| /llvm-project-15.0.7/llvm/include/llvm/DebugInfo/PDB/Native/ |
| H A D | HashTable.h | 28 Error readSparseBitVector(BinaryStreamReader &Stream, SparseBitVector<> &V);
29 Error writeSparseBitVector(BinaryStreamWriter &Writer, SparseBitVector<> &Vec);
266 mutable SparseBitVector<> Present;
267 mutable SparseBitVector<> Deleted;
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | PHIElimination.cpp | 98 std::vector<SparseBitVector<>> *LiveInSets);
158 std::vector<SparseBitVector<>> LiveInSets; in runOnMachineFunction()
169 SparseBitVector<>::iterator AliveBlockItr = VI.AliveBlocks.begin(); in runOnMachineFunction()
170 SparseBitVector<>::iterator EndItr = VI.AliveBlocks.end(); in runOnMachineFunction()
654 std::vector<SparseBitVector<>> *LiveInSets) { in SplitPHIEdges()
|
| H A D | LiveVariables.cpp | 693 SparseBitVector<> UseBlocks; in recomputeForSingleDefVirtReg()
885 std::vector<SparseBitVector<>> &LiveInSets) { in addNewBlock()
888 SparseBitVector<> &BV = LiveInSets[SuccBB->getNumber()]; in addNewBlock()
|
| H A D | MachineBasicBlock.cpp | 1013 std::vector<SparseBitVector<>> *LiveInSets) { in SplitCriticalEdge()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | AMDGPUEmitPrintf.cpp | 182 static void locateCStrings(SparseBitVector<8> &BV, Value *Fmt) { in locateCStrings()
216 SparseBitVector<8> SpecIsCString; in emitAMDGPUPrintfCall()
|
| /llvm-project-15.0.7/llvm/utils/TableGen/ |
| H A D | CodeGenRegisters.h | 225 typedef SparseBitVector<> RegUnitList;
|
| H A D | RegisterInfoEmitter.cpp | 642 DiffVec &diffEncode(DiffVec &V, unsigned InitVal, SparseBitVector<> List) { in diffEncode()
942 SparseBitVector<> RUs = Reg.getNativeRegUnits(); in runMCDesc()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | BlockFrequencyInfoImpl.cpp | 305 SparseBitVector<> SavedIsIrrLoopHeader(std::move(BFI.IsIrrLoopHeader)); in cleanup()
|
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | BlockFrequencyInfoImpl.h | 425 SparseBitVector<> IsIrrLoopHeader;
|
| /llvm-project-15.0.7/llvm/docs/ |
| H A D | ProgrammersManual.rst | 2431 SparseBitVector subsection
2434 The SparseBitVector container is much like BitVector, with one major difference:
2435 Only the bits that are set, are stored. This makes the SparseBitVector much
2438 downside to the SparseBitVector is that setting and testing of random bits is
2443 testing/setting bits in a SparseBitVector is O(distance away from last set bit).
2450 The CoalescingBitVector container is similar in principle to a SparseBitVector, argument
2456 of set bits are large. It's a better choice than SparseBitVector when find()
|
| /llvm-project-15.0.7/llvm/lib/Target/X86/ |
| H A D | X86SpeculativeLoadHardening.cpp | 1275 SparseBitVector<> LoadDepRegs; in tracePredStateThroughBlocksAndHarden()
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | NewGVN.cpp | 572 DenseMap<BasicBlock *, SparseBitVector<>> RevisitOnReachabilityChange;
|