From: Chris Lattner <sabre@nondot.org>
Date: Sat, 17 Apr 2004 18:08:33 +0000 (+0000)
Subject: Even if there are not any induction variables in the loop, if we can compute
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=f50af088f19f525f3d1026eb61db77e0037a9f43;p=oota-llvm.git

Even if there are not any induction variables in the loop, if we can compute
the trip count for the loop, insert one so that we can canonicalize the exit
condition.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@13015 91177308-0d34-0410-b5e6-96231b3b80d8
---

diff --git a/lib/Transforms/Scalar/IndVarSimplify.cpp b/lib/Transforms/Scalar/IndVarSimplify.cpp
index 9bc897fe022..fa81f81f743 100644
--- a/lib/Transforms/Scalar/IndVarSimplify.cpp
+++ b/lib/Transforms/Scalar/IndVarSimplify.cpp
@@ -368,7 +368,17 @@ void IndVarSimplify::runOnLoop(Loop *L) {
 
   // If there are no induction variables in the loop, there is nothing more to
   // do.
-  if (IndVars.empty()) return;
+  if (IndVars.empty()) {
+    // Actually, if we know how many times the loop iterates, lets insert a
+    // canonical induction variable to help subsequent passes.
+    if (!isa<SCEVCouldNotCompute>(IterationCount)) {
+      ScalarEvolutionRewriter Rewriter(*SE, *LI);
+      Rewriter.GetOrInsertCanonicalInductionVariable(L,
+                                                     IterationCount->getType());
+      LinearFunctionTestReplace(L, IterationCount, Rewriter);
+    }
+    return;
+  }
 
   // Compute the type of the largest recurrence expression.
   //