523                                const MachineBasicBlock *OldTop);
529                                   const MachineBasicBlock *OldTop,
532   MachineBasicBlock *findBestLoopTopHelper(MachineBasicBlock *OldTop,
1946     const MachineBasicBlock *OldTop) {  in canMoveBottomBlockToTop()  argument
1956   if (OtherBB == OldTop)  in canMoveBottomBlockToTop()
2022     const MachineBasicBlock *OldTop,  in FallThroughGains()  argument
2025   BlockFrequency FallThrough2Top = TopFallThroughFreq(OldTop, LoopBlockSet);  in FallThroughGains()
2031       MBPI->getEdgeProbability(NewTop, OldTop);  in FallThroughGains()
2112     MachineBasicBlock *OldTop,  in findBestLoopTopHelper()  argument
2118   BlockChain &HeaderChain = *BlockToChain[OldTop];  in findBestLoopTopHelper()
2120     return OldTop;  in findBestLoopTopHelper()
2121   if (OldTop != *HeaderChain.begin())  in findBestLoopTopHelper()
2122     return OldTop;  in findBestLoopTopHelper()
2124   LLVM_DEBUG(dbgs() << "Finding best loop top for: " << getBlockName(OldTop)  in findBestLoopTopHelper()
2129   for (MachineBasicBlock *Pred : OldTop->predecessors()) {  in findBestLoopTopHelper()
2143       if (OtherBB == OldTop)  in findBestLoopTopHelper()
2147     if (!canMoveBottomBlockToTop(Pred, OldTop))  in findBestLoopTopHelper()
2150     BlockFrequency Gains = FallThroughGains(Pred, OldTop, OtherBB,  in findBestLoopTopHelper()
2154          ((Gains == BestGains) && Pred->isLayoutSuccessor(OldTop)))) {  in findBestLoopTopHelper()
2163     return OldTop;  in findBestLoopTopHelper()
2195   MachineBasicBlock *OldTop = nullptr;  in findBestLoopTop()  local
2197   while (NewTop != OldTop) {  in findBestLoopTop()
2198     OldTop = NewTop;  in findBestLoopTop()
2199     NewTop = findBestLoopTopHelper(OldTop, L, LoopBlockSet);  in findBestLoopTop()
2200     if (NewTop != OldTop)  in findBestLoopTop()
2201       ComputedEdges[NewTop] = { OldTop, false };  in findBestLoopTop()