6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-07-21 02:29:22 +00:00
Code Issues Projects Releases Wiki Activity

Fix normalization and de-normalization of non-affine SCEVs.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@105480 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dan Gohman 2010-06-04 19:16:34 +00:00
parent 6de07178e1
commit c87b40b1cd
2 changed files with 32 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
lib/Analysis/ScalarEvolutionNormalization.cpp
View File

@ -105,22 +105,25 @@ const SCEV *llvm::TransformForPostIncUse(TransformKind Kind,
case NormalizeAutodetect:
if (Instruction *OI = dyn_cast<Instruction>(OperandValToReplace))
if (IVUseShouldUsePostIncValue(User, OI, L, &DT)) {
Result = SE.getMinusSCEV(Result, AR->getStepRecurrence(SE));
const SCEV *TransformedStep =
TransformForPostIncUse(Kind, AR->getStepRecurrence(SE),
User, OperandValToReplace, Loops, SE, DT);
Result = SE.getMinusSCEV(Result, TransformedStep);
Loops.insert(L);
}
break;
case Normalize:
if (Loops.count(L))
Result = SE.getMinusSCEV(Result, AR->getStepRecurrence(SE));
break;
case Denormalize:
if (Loops.count(L)) {
const SCEV *TransformedStep =
TransformForPostIncUse(Kind, AR->getStepRecurrence(SE),
User, OperandValToReplace, Loops, SE, DT);
Result = SE.getAddExpr(Result, TransformedStep);
Result = SE.getMinusSCEV(Result, TransformedStep);
}
break;
case Denormalize:
if (Loops.count(L))
Result = SE.getAddExpr(Result, AR->getStepRecurrence(SE));
break;
}
return Result;
}

23
test/CodeGen/X86/lsr-nonaffine.ll Normal file
View File

@ -0,0 +1,23 @@
; RUN: llc -march=x86-64 < %s | FileCheck %s
; LSR should compute the correct starting values for this loop. Note that
; it's not necessarily LSR's job to compute loop exit expressions; that's
; indvars' job.
; CHECK: movl $12
; CHECK: movl $42
define i32 @real_symmetric_eigen(i32 %n) nounwind {
while.body127: ; preds = %while.cond122
br label %while.cond141
while.cond141: ; preds = %while.cond141, %while.body127
%0 = phi i32 [ 7, %while.body127 ], [ %indvar.next67, %while.cond141 ] ; <i32> [#uses=3]
%indvar.next67 = add i32 %0, 1 ; <i32> [#uses=1]
%t = icmp slt i32 %indvar.next67, %n
br i1 %t, label %if.then171, label %while.cond141
if.then171: ; preds = %while.cond141
%mul150 = mul i32 %0, %0 ; <i32> [#uses=1]
%add174 = add i32 %mul150, %0 ; <i32> [#uses=1]
ret i32 %add174
}