Lines Matching defs:OldTop

538                                const MachineBasicBlock *OldTop);
544                                   const MachineBasicBlock *OldTop,
547   MachineBasicBlock *findBestLoopTopHelper(MachineBasicBlock *OldTop,
1939 // If bottom of block BB has only one successor OldTop, in most cases it is
1940 // profitable to move it before OldTop, except the following case:
1942 //     -->OldTop<-
1950 // If BB is moved before OldTop, Pred needs a taken branch to BB, and it can't
1954     const MachineBasicBlock *BottomBlock, const MachineBasicBlock *OldTop) {
1964   if (OtherBB == OldTop)
2005 // Compute the fall through gains when move NewTop before OldTop.
2015 //        --->OldTop
2027     const MachineBasicBlock *NewTop, const MachineBasicBlock *OldTop,
2029   BlockFrequency FallThrough2Top = TopFallThroughFreq(OldTop, LoopBlockSet);
2035       MBFI->getBlockFreq(NewTop) * MBPI->getEdgeProbability(NewTop, OldTop);
2115     MachineBasicBlock *OldTop, const MachineLoop &L,
2120   BlockChain &HeaderChain = *BlockToChain[OldTop];
2122     return OldTop;
2123   if (OldTop != *HeaderChain.begin())
2124     return OldTop;
2126   LLVM_DEBUG(dbgs() << "Finding best loop top for: " << getBlockName(OldTop)
2131   for (MachineBasicBlock *Pred : OldTop->predecessors()) {
2145       if (OtherBB == OldTop)
2149     if (!canMoveBottomBlockToTop(Pred, OldTop))
2153         FallThroughGains(Pred, OldTop, OtherBB, LoopBlockSet);
2156          ((Gains == BestGains) && Pred->isLayoutSuccessor(OldTop)))) {
2165     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};