llvm-6502/test/Transforms/IndVarSimplify/2003-09-23-NotAtTop.ll
Dan Gohman cab9cf01ce Make this testcase slightly less trivial, so that it doesn't fail
if indvars happens to optimize away the unused primary induction
variable.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@70333 91177308-0d34-0410-b5e6-96231b3b80d8
2009-04-28 22:03:26 +00:00

19 lines
692 B
LLVM

; RUN: llvm-as < %s | opt -indvars | llvm-dis | %prcontext Loop: 1 | grep %indvar
; The indvar simplification code should ensure that the first PHI in the block
; is the canonical one!
define i32 @test() {
; <label>:0
br label %Loop
Loop: ; preds = %Loop, %0
%NonIndvar = phi i32 [ 200, %0 ], [ %NonIndvarNext, %Loop ] ; <i32> [#uses=1]
%Canonical = phi i32 [ 0, %0 ], [ %CanonicalNext, %Loop ] ; <i32> [#uses=2]
store i32 %Canonical, i32* null
%NonIndvarNext = sdiv i32 %NonIndvar, 2 ; <i32> [#uses=1]
%CanonicalNext = add i32 %Canonical, 1 ; <i32> [#uses=1]
br label %Loop
}