Lines Matching defs:Latch
87 // Latch's terminator is a conditional branch, Latch is exiting and
88 // all non Latch exits ends up with deoptimize.
89 const BasicBlock *Latch = L->getLoopLatch();
90 const BranchInst *T = dyn_cast<BranchInst>(Latch->getTerminator());
91 return T && T->isConditional() && L->isLoopExiting(Latch) &&
444 /// \param[out] ExitWeight The weight of the edge from Latch to Exit.
445 /// \param[out] FallThroughWeight The weight of the edge from Latch to Header.
457 /// Update the weights of original Latch block after peeling off all iterations.
461 /// \param ExitWeight The weight of the edge from Latch to Exit.
462 /// \param FallThroughWeight The weight of the edge from Latch to Header.
497 BasicBlock *Latch = L->getLoopLatch();
539 BasicBlock *NewLatch = cast<BasicBlock>(VMap[Latch]);
562 Value *LatchVal = NewPHI->getIncomingValueForBlock(Latch);
611 BasicBlock *Latch = L->getLoopLatch();
622 // Let Latch' and ExitingSet' are copies after a peeling.
628 // Taking into account that we have a single Latch, Latch' will dominate
630 // So the idom'(Exit) is nearest common dominator of idom(Exit)' and Latch'.
632 // (nearest common dominator of idom(Exit) and Latch)'.
634 // Latch to update idom of Exit later.
640 DT->getNode(Edge.second)->getIDom()->getBlock(), Latch);
708 cast<BranchInst>(cast<BasicBlock>(Latch)->getTerminator());
756 Value *NewVal = PHI->getIncomingValueForBlock(Latch);