Searched refs:UseBlocks (Results 1 – 4 of 4) sorted by relevance
603 ArrayRef<SplitAnalysis::BlockInfo> UseBlocks = SA->getUseBlocks(); in addSplitConstraints() local606 SplitConstraints.resize(UseBlocks.size()); in addSplitConstraints()608 for (unsigned I = 0; I != UseBlocks.size(); ++I) { in addSplitConstraints()609 const SplitAnalysis::BlockInfo &BI = UseBlocks[I]; in addSplitConstraints()851 ArrayRef<SplitAnalysis::BlockInfo> UseBlocks = SA->getUseBlocks(); in calcSpillCost() local852 for (const SplitAnalysis::BlockInfo &BI : UseBlocks) { in calcSpillCost()872 ArrayRef<SplitAnalysis::BlockInfo> UseBlocks = SA->getUseBlocks(); in calcGlobalSplitCost() local873 for (unsigned I = 0; I != UseBlocks.size(); ++I) { in calcGlobalSplitCost()874 const SplitAnalysis::BlockInfo &BI = UseBlocks[I]; in calcGlobalSplitCost()938 ArrayRef<SplitAnalysis::BlockInfo> UseBlocks = SA->getUseBlocks(); in splitAroundRegion() local[all …]
149 /// UseBlocks - Blocks where CurLI has uses.150 SmallVector<BlockInfo, 8> UseBlocks; variable 152 /// NumGapBlocks - Number of duplicate entries in UseBlocks for blocks where200 ArrayRef<BlockInfo> getUseBlocks() const { return UseBlocks; }
162 UseBlocks.clear(); in clear()194 << UseBlocks.size() << " blocks, through " in analyzeUses()267 UseBlocks.push_back(BI); in calcLiveBlockInfo()268 UseBlocks.back().LastInstr = LastStop; in calcLiveBlockInfo()282 UseBlocks.push_back(BI); in calcLiveBlockInfo()300 LooksLikeLoopIV = EnableLoopIVHeuristic && UseBlocks.size() == 2 && in calcLiveBlockInfo()301 any_of(UseBlocks, [this](BlockInfo &BI) { in calcLiveBlockInfo()
699 SparseBitVector<> UseBlocks; in recomputeForSingleDefVirtReg() local708 UseBlocks.set(UseBB.getNumber()); in recomputeForSingleDefVirtReg()747 for (unsigned UseBBNum : UseBlocks) { in recomputeForSingleDefVirtReg()