| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| H A D | SparseBitVector.h | 255 class SparseBitVector {
279 const_cast<SparseBitVector<ElementSize> *>(this)->Elements.begin(); in FindLowerBoundImpl()
281 const_cast<SparseBitVector<ElementSize> *>(this)->Elements.end(); in FindLowerBoundImpl()
322 const SparseBitVector<ElementSize> *BitVector = nullptr;
396 SparseBitVectorIterator(const SparseBitVector<ElementSize> *RHS,
443 SparseBitVector() : Elements(), CurrElementIter(Elements.begin()) {} in SparseBitVector() function
445 SparseBitVector(const SparseBitVector &RHS) in SparseBitVector() function
447 SparseBitVector(SparseBitVector &&RHS) in SparseBitVector() function
456 SparseBitVector& operator=(const SparseBitVector& RHS) {
464 SparseBitVector &operator=(SparseBitVector &&RHS) {
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| H A D | LiveVariables.h | 84 SparseBitVector<> AliveBlocks;
123 SparseBitVector<> PHIJoins;
303 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 | 837 std::vector<SparseBitVector<>> *LiveInSets = nullptr);
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/ |
| H A D | HashTable.cpp | 25 SparseBitVector<> &V) { in readSparseBitVector()
47 SparseBitVector<> &Vec) { in writeSparseBitVector()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/Native/ |
| H A D | HashTable.h | 31 Error readSparseBitVector(BinaryStreamReader &Stream, SparseBitVector<> &V);
32 Error writeSparseBitVector(BinaryStreamWriter &Writer, SparseBitVector<> &Vec);
270 mutable SparseBitVector<> Present;
271 mutable SparseBitVector<> Deleted;
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| H A D | PHIElimination.cpp | 100 std::vector<SparseBitVector<>> *LiveInSets);
159 std::vector<SparseBitVector<>> LiveInSets; in runOnMachineFunction()
170 SparseBitVector<>::iterator AliveBlockItr = VI.AliveBlocks.begin(); in runOnMachineFunction()
171 SparseBitVector<>::iterator EndItr = VI.AliveBlocks.end(); in runOnMachineFunction()
629 std::vector<SparseBitVector<>> *LiveInSets) { in SplitPHIEdges()
|
| H A D | LiveVariables.cpp | 810 std::vector<SparseBitVector<>> &LiveInSets) { in addNewBlock()
813 SparseBitVector<> &BV = LiveInSets[SuccBB->getNumber()]; in addNewBlock()
|
| H A D | MachineBasicBlock.cpp | 1034 std::vector<SparseBitVector<>> *LiveInSets) { in SplitCriticalEdge()
|
| H A D | MachineSink.cpp | 134 SparseBitVector<> RegsToClearKillFlags;
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| H A D | AMDGPUEmitPrintf.cpp | 193 static void locateCStrings(SparseBitVector<8> &BV, Value *Fmt) { in locateCStrings()
227 SparseBitVector<8> SpecIsCString; in emitAMDGPUPrintfCall()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| H A D | CodeGenRegisters.h | 226 typedef SparseBitVector<> RegUnitList;
|
| H A D | RegisterInfoEmitter.cpp | 642 DiffVec &diffEncode(DiffVec &V, unsigned InitVal, SparseBitVector<> List) { in diffEncode()
936 SparseBitVector<> RUs = Reg.getNativeRegUnits(); in runMCDesc()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | BlockFrequencyInfoImpl.cpp | 292 SparseBitVector<> SavedIsIrrLoopHeader(std::move(BFI.IsIrrLoopHeader)); in cleanup()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | BlockFrequencyInfoImpl.h | 419 SparseBitVector<> IsIrrLoopHeader;
|
| /netbsd-src/external/apache2/llvm/dist/llvm/docs/ |
| H A D | ProgrammersManual.rst | 2363 Bit storage containers (BitVector, SparseBitVector, CoalescingBitVector)
2403 SparseBitVector argument
2406 The SparseBitVector container is much like BitVector, with one major difference:
2407 Only the bits that are set, are stored. This makes the SparseBitVector much
2410 downside to the SparseBitVector is that setting and testing of random bits is
2415 testing/setting bits in a SparseBitVector is O(distance away from last set bit).
2422 The CoalescingBitVector container is similar in principle to a SparseBitVector, argument
2428 of set bits are large. It's a better choice than SparseBitVector when find()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| H A D | X86SpeculativeLoadHardening.cpp | 1276 SparseBitVector<> LoadDepRegs; in tracePredStateThroughBlocksAndHarden()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| H A D | NewGVN.cpp | 573 DenseMap<BasicBlock *, SparseBitVector<>> RevisitOnReachabilityChange;
|