mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-01 08:23:21 +01:00
c40eb525ad
bug fixes, and with improved heuristics for analyzing foreign-loop addrecs. This change also flattens IVUsers, eliminating the stride-oriented groupings, which makes it easier to work with. llvm-svn: 95975
25 lines
735 B
LLVM
25 lines
735 B
LLVM
; Check that this test makes INDVAR and related stuff dead, because P[indvar]
|
|
; gets reduced, making INDVAR dead.
|
|
|
|
; RUN: opt < %s -loop-reduce -S -default-data-layout="e-p:32:32:32" | not grep INDVAR
|
|
|
|
declare i1 @pred()
|
|
|
|
declare i32 @getidx()
|
|
|
|
define void @test([10000 x i32]* %P) {
|
|
; <label>:0
|
|
br label %Loop
|
|
Loop: ; preds = %Loop, %0
|
|
%INDVAR = phi i32 [ 0, %0 ], [ %INDVAR2, %Loop ] ; <i32> [#uses=2]
|
|
%idx = call i32 @getidx( ) ; <i32> [#uses=1]
|
|
%STRRED = getelementptr [10000 x i32]* %P, i32 %INDVAR, i32 %idx ; <i32*> [#uses=1]
|
|
store i32 0, i32* %STRRED
|
|
%INDVAR2 = add i32 %INDVAR, 1 ; <i32> [#uses=1]
|
|
%cond = call i1 @pred( ) ; <i1> [#uses=1]
|
|
br i1 %cond, label %Loop, label %Out
|
|
Out: ; preds = %Loop
|
|
ret void
|
|
}
|
|
|