mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2026-04-21 08:17:40 +00:00
[SCEV] Look at backedge dominating conditions.
Summary: This change teaches ScalarEvolution::isLoopBackedgeGuardedByCond to look at edges within the loop body that dominate the latch. We don't do an exhaustive search for all possible edges, but only a quick walk up the dom tree. Reviewers: atrick, hfinkel Subscribers: llvm-commits Differential Revision: http://reviews.llvm.org/D8627 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@233447 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -6686,6 +6686,46 @@ ScalarEvolution::isLoopBackedgeGuardedByCond(const Loop *L,
|
||||
LoopContinuePredicate->getSuccessor(0) != L->getHeader()))
|
||||
return true;
|
||||
|
||||
// If the loop is not reachable from the entry block, we risk running into an
|
||||
// infinite loop as we walk up into the dom tree. These loops do not matter
|
||||
// anyway, so we just return a conservative answer when we see them.
|
||||
if (!DT->isReachableFromEntry(L->getHeader()))
|
||||
return false;
|
||||
|
||||
for (DomTreeNode *DTN = (*DT)[Latch], *HeaderDTN = (*DT)[L->getHeader()];
|
||||
DTN != HeaderDTN;
|
||||
DTN = DTN->getIDom()) {
|
||||
|
||||
assert(DTN && "should reach the loop header before reaching the root!");
|
||||
|
||||
BasicBlock *BB = DTN->getBlock();
|
||||
BasicBlock *PBB = BB->getSinglePredecessor();
|
||||
if (!PBB)
|
||||
continue;
|
||||
|
||||
BranchInst *ContinuePredicate = dyn_cast<BranchInst>(PBB->getTerminator());
|
||||
if (!ContinuePredicate || !ContinuePredicate->isConditional())
|
||||
continue;
|
||||
|
||||
Value *Condition = ContinuePredicate->getCondition();
|
||||
|
||||
// If we have an edge `E` within the loop body that dominates the only
|
||||
// latch, the condition guarding `E` also guards the backedge. This
|
||||
// reasoning works only for loops with a single latch.
|
||||
|
||||
BasicBlockEdge DominatingEdge(PBB, BB);
|
||||
if (DominatingEdge.isSingleEdge()) {
|
||||
// We're constructively (and conservatively) enumerating edges within the
|
||||
// loop body that dominate the latch. The dominator tree better agree
|
||||
// with us on this:
|
||||
assert(DT->dominates(DominatingEdge, Latch) && "should be!");
|
||||
|
||||
if (isImpliedCond(Pred, LHS, RHS, Condition,
|
||||
BB != ContinuePredicate->getSuccessor(0)))
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
// Check conditions due to any @llvm.assume intrinsics.
|
||||
for (auto &AssumeVH : AC->assumptions()) {
|
||||
if (!AssumeVH)
|
||||
|
||||
Reference in New Issue
Block a user