Lines Matching defs:OldTop

523                                const MachineBasicBlock *OldTop);
529                                   const MachineBasicBlock *OldTop,
532   MachineBasicBlock *findBestLoopTopHelper(MachineBasicBlock *OldTop,
1929 // If bottom of block BB has only one successor OldTop, in most cases it is
1930 // profitable to move it before OldTop, except the following case:
1932 //     -->OldTop<-
1940 // If BB is moved before OldTop, Pred needs a taken branch to BB, and it can't
1946     const MachineBasicBlock *OldTop) {
1956   if (OtherBB == OldTop)
1998 // Compute the fall through gains when move NewTop before OldTop.
2008 //        --->OldTop
2022     const MachineBasicBlock *OldTop,
2025   BlockFrequency FallThrough2Top = TopFallThroughFreq(OldTop, LoopBlockSet);
2031       MBPI->getEdgeProbability(NewTop, OldTop);
2112     MachineBasicBlock *OldTop,
2118   BlockChain &HeaderChain = *BlockToChain[OldTop];
2120     return OldTop;
2121   if (OldTop != *HeaderChain.begin())
2122     return OldTop;
2124   LLVM_DEBUG(dbgs() << "Finding best loop top for: " << getBlockName(OldTop)
2129   for (MachineBasicBlock *Pred : OldTop->predecessors()) {
2143       if (OtherBB == OldTop)
2147     if (!canMoveBottomBlockToTop(Pred, OldTop))
2150     BlockFrequency Gains = FallThroughGains(Pred, OldTop, OtherBB,
2154          ((Gains == BestGains) && Pred->isLayoutSuccessor(OldTop)))) {
2163     return OldTop;
2195   MachineBasicBlock *OldTop = nullptr;
2197   while (NewTop != OldTop) {
2198     OldTop = NewTop;
2199     NewTop = findBestLoopTopHelper(OldTop, L, LoopBlockSet);
2200     if (NewTop != OldTop)
2201       ComputedEdges[NewTop] = { OldTop, false };