1966    MachineBasicBlock *BestPred = nullptr;  in FallThroughGains()  local
1977          BestPred = Pred;  in FallThroughGains()
1985    if (BestPred) {  in FallThroughGains()
1986      for (MachineBasicBlock *Succ : BestPred->successors()) {  in FallThroughGains()
1987        if ((Succ == NewTop) || (Succ == BestPred) || !LoopBlockSet.count(Succ))  in FallThroughGains()
1993            (SuccChain == BlockToChain[BestPred]))  in FallThroughGains()
1995        BlockFrequency EdgeFreq = MBFI->getBlockFreq(BestPred) *  in FallThroughGains()
1996            MBPI->getEdgeProbability(BestPred, Succ);  in FallThroughGains()
2000      BlockFrequency OrigEdgeFreq = MBFI->getBlockFreq(BestPred) *  in FallThroughGains()
2001          MBPI->getEdgeProbability(BestPred, NewTop);  in FallThroughGains()
2058   MachineBasicBlock *BestPred = nullptr;  in findBestLoopTopHelper()  local
2084       BestPred = Pred;  in findBestLoopTopHelper()
2090   if (!BestPred) {  in findBestLoopTopHelper()
2096   while (BestPred->pred_size() == 1 &&  in findBestLoopTopHelper()
2097          (*BestPred->pred_begin())->succ_size() == 1 &&  in findBestLoopTopHelper()
2098          *BestPred->pred_begin() != L.getHeader())  in findBestLoopTopHelper()
2099     BestPred = *BestPred->pred_begin();  in findBestLoopTopHelper()
2101   LLVM_DEBUG(dbgs() << "    final top: " << getBlockName(BestPred) << "\n");  in findBestLoopTopHelper()
2102   return BestPred;  in findBestLoopTopHelper()