Lines Matching refs:BestPred
1998 MachineBasicBlock *BestPred = nullptr; in FallThroughGains() local
2009 BestPred = Pred; in FallThroughGains()
2017 if (BestPred) { in FallThroughGains()
2018 for (MachineBasicBlock *Succ : BestPred->successors()) { in FallThroughGains()
2019 if ((Succ == NewTop) || (Succ == BestPred) || !LoopBlockSet.count(Succ)) in FallThroughGains()
2025 (SuccChain == BlockToChain[BestPred])) in FallThroughGains()
2027 BlockFrequency EdgeFreq = MBFI->getBlockFreq(BestPred) * in FallThroughGains()
2028 MBPI->getEdgeProbability(BestPred, Succ); in FallThroughGains()
2032 BlockFrequency OrigEdgeFreq = MBFI->getBlockFreq(BestPred) * in FallThroughGains()
2033 MBPI->getEdgeProbability(BestPred, NewTop); in FallThroughGains()
2092 MachineBasicBlock *BestPred = nullptr; in findBestLoopTopHelper() local
2119 BestPred = Pred; in findBestLoopTopHelper()
2125 if (!BestPred) { in findBestLoopTopHelper()
2131 while (BestPred->pred_size() == 1 && in findBestLoopTopHelper()
2132 (*BestPred->pred_begin())->succ_size() == 1 && in findBestLoopTopHelper()
2133 *BestPred->pred_begin() != L.getHeader()) in findBestLoopTopHelper()
2134 BestPred = *BestPred->pred_begin(); in findBestLoopTopHelper()
2136 LLVM_DEBUG(dbgs() << " final top: " << getBlockName(BestPred) << "\n"); in findBestLoopTopHelper()
2137 return BestPred; in findBestLoopTopHelper()