mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-02-07 14:33:15 +00:00
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
This commit is contained in:
parent
f5b9eb37a9
commit
f50af088f1
@ -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.
|
||||
//
|
||||
|
Loading…
x
Reference in New Issue
Block a user