| /llvm-project/llvm/include/llvm/ADT/ |
| H A D | SparseBitVector.h | 256 class SparseBitVector {
280 const_cast<SparseBitVector<ElementSize> *>(this)->Elements.begin(); in FindLowerBoundImpl()
282 const_cast<SparseBitVector<ElementSize> *>(this)->Elements.end(); in FindLowerBoundImpl()
323 const SparseBitVector<ElementSize> *BitVector = nullptr;
397 SparseBitVectorIterator(const SparseBitVector<ElementSize> *RHS,
444 SparseBitVector() : Elements(), CurrElementIter(Elements.begin()) {} in SparseBitVector() function
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) {
[all …]
|
| H A D | GenericUniformityImpl.h | 507 SparseBitVector<> FreshLabels;
|
| /llvm-project/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/llvm/lib/DebugInfo/PDB/Native/ |
| H A D | HashTable.cpp | 22 SparseBitVector<> &V) { in readSparseBitVector()
44 SparseBitVector<> &Vec) { in writeSparseBitVector()
|
| /llvm-project/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/llvm/include/llvm/CodeGen/ |
| H A D | LiveIntervalUnion.h | 33 template <unsigned Element> class SparseBitVector; variable
35 using LiveVirtRegBitSet = SparseBitVector<128>;
|
| H A D | LiveVariables.h | 35 #include "llvm/ADT/SparseBitVector.h"
83 SparseBitVector<> AliveBlocks;
301 std::vector<SparseBitVector<>> &LiveInSets);
|
| H A D | MachineBasicBlock.h | 18 #include "llvm/ADT/SparseBitVector.h"
976 std::vector<SparseBitVector<>> *LiveInSets = nullptr,
984 std::vector<SparseBitVector<>> *LiveInSets = nullptr,
992 std::vector<SparseBitVector<>> *LiveInSets, MachineDomTreeUpdater *MDTU);
|
| /llvm-project/llvm/lib/CodeGen/ |
| H A D | PHIElimination.cpp | 94 std::vector<SparseBitVector<>> *LiveInSets,
224 std::vector<SparseBitVector<>> LiveInSets; in runOnMachineFunction()
235 SparseBitVector<>::iterator AliveBlockItr = VI.AliveBlocks.begin(); in EliminatePHINodes()
236 SparseBitVector<>::iterator EndItr = VI.AliveBlocks.end(); in EliminatePHINodes()
764 std::vector<SparseBitVector<>> *LiveInSets, MachineDomTreeUpdater &MDTU) { in SplitPHIEdges()
|
| H A D | LiveVariables.cpp | 699 SparseBitVector<> UseBlocks; in recomputeForSingleDefVirtReg()
903 std::vector<SparseBitVector<>> &LiveInSets) {
906 SparseBitVector<> &BV = LiveInSets[SuccBB->getNumber()];
|
| H A D | MachineBasicBlock.cpp | 1151 std::vector<SparseBitVector<>> *LiveInSets, MachineDomTreeUpdater *MDTU) { in SplitCriticalEdge()
|
| /llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | AMDGPUEmitPrintf.cpp | 184 static void locateCStrings(SparseBitVector<8> &BV, StringRef Str) { in locateCStrings()
224 bool isConstFmtStr, SparseBitVector<8> &SpecIsCString, in callBufferedPrintfStart()
374 Value *PtrToStore, SparseBitVector<8> &SpecIsCString, in callBufferedPrintfArgPush()
432 SparseBitVector<8> SpecIsCString; in emitAMDGPUPrintfCall()
|
| /llvm-project/llvm/utils/TableGen/ |
| H A D | RegisterInfoEmitter.cpp | 26 #include "llvm/ADT/SparseBitVector.h"
630 static DiffVec &diffEncode(DiffVec &V, SparseBitVector<> List) {
632 SparseBitVector<>::iterator I = List.begin(), E = List.end();
914 const SparseBitVector<> &RUs = Reg.getNativeRegUnits(); in runMCDesc()
|
| /llvm-project/llvm/utils/TableGen/Common/ |
| H A D | CodeGenRegisters.h | 26 #include "llvm/ADT/SparseBitVector.h"
249 typedef SparseBitVector<> RegUnitList;
|
| /llvm-project/llvm/lib/Analysis/ |
| H A D | BlockFrequencyInfoImpl.cpp | 306 SparseBitVector<> SavedIsIrrLoopHeader(std::move(BFI.IsIrrLoopHeader)); in cleanup()
|
| /llvm-project/llvm/include/llvm/Analysis/ |
| H A D | BlockFrequencyInfoImpl.h | 24 #include "llvm/ADT/SparseBitVector.h"
426 SparseBitVector<> IsIrrLoopHeader;
|
| /llvm-project/llvm/docs/ |
| H A D | ProgrammersManual.rst | 2507 SparseBitVector
2510 The SparseBitVector container is much like BitVector, with one major difference:
2511 Only the bits that are set, are stored. This makes the SparseBitVector much
2514 downside to the SparseBitVector is that setting and testing of random bits is
2519 testing/setting bits in a SparseBitVector is O(distance away from last set bit).
2526 The CoalescingBitVector container is similar in principle to a SparseBitVector,
2532 of set bits are large. It's a better choice than SparseBitVector when find()
2505 SparseBitVector global() subsection
2524 dss_coalescingbitvectorSparseBitVector global() argument
|
| /llvm-project/llvm/lib/Target/X86/ |
| H A D | X86SpeculativeLoadHardening.cpp | 31 #include "llvm/ADT/SparseBitVector.h"
1275 SparseBitVector<> LoadDepRegs; in tracePredStateThroughBlocksAndHarden()
|
| /llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | NewGVN.cpp | 68 #include "llvm/ADT/SparseBitVector.h"
584 DenseMap<BasicBlock *, SparseBitVector<>> RevisitOnReachabilityChange;
2215 // here, or use SparseBitVector or .... in moveMemoryToNewCongruenceClass()
2490 // SparseBitVector. We can do it word by word faster than we are doing it in processOutgoingEdges()
|