Lines Matching refs:LoopBB
695 LoopBlock &LoopBB, uint32_t BBWeight, in updateEstimatedBlockWeight() argument
698 BasicBlock *BB = LoopBB.getBlock(); in updateEstimatedBlockWeight()
711 if (isLoopExitingEdge({PredLoop, LoopBB})) { in updateEstimatedBlockWeight()
733 const LoopBlock &LoopBB, DominatorTree *DT, PostDominatorTree *PDT, in propagateEstimatedBlockWeight() argument
736 const BasicBlock *BB = LoopBB.getBlock(); in propagateEstimatedBlockWeight()
751 const LoopEdge Edge{DomLoopBB, LoopBB}; in propagateEstimatedBlockWeight()
828 const LoopBlock LoopBB = LoopWorkList.pop_back_val(); in computeEestimateBlockWeight() local
829 const LoopData LD = LoopBB.getLoopData(); in computeEestimateBlockWeight()
836 getLoopExitBlocks(LoopBB, Exits); in computeEestimateBlockWeight()
838 LoopBB, make_range(Exits.begin(), Exits.end())); in computeEestimateBlockWeight()
847 getLoopEnterBlocks(LoopBB, BlockWorkList); in computeEestimateBlockWeight()
863 const LoopBlock LoopBB = getLoopBlock(BB); in computeEestimateBlockWeight() local
864 auto MaxWeight = getMaxEstimatedEdgeWeight(LoopBB, successors(BB)); in computeEestimateBlockWeight()
867 propagateEstimatedBlockWeight(LoopBB, DT, PDT, *MaxWeight, in computeEestimateBlockWeight()
880 const LoopBlock LoopBB = getLoopBlock(BB); in calcEstimatedHeuristics() local
884 if (LoopBB.getLoop()) in calcEstimatedHeuristics()
885 computeUnlikelySuccessors(BB, LoopBB.getLoop(), UnlikelyBlocks); in calcEstimatedHeuristics()
895 const LoopEdge Edge{LoopBB, SuccLoopBB}; in calcEstimatedHeuristics()
908 bool IsUnlikelyEdge = LoopBB.getLoop() && UnlikelyBlocks.contains(SuccBB); in calcEstimatedHeuristics()