2008-12-05 21:47:27 +00:00
|
|
|
; RUN: llvm-as < %s | llc -march=x86 -relocation-model=pic | \
|
2008-12-05 22:38:21 +00:00
|
|
|
; RUN: grep {, 4} | count 1
|
2009-02-21 02:06:47 +00:00
|
|
|
; RUN: llvm-as < %s | llc -march=x86 | not grep lea
|
2008-12-05 21:47:27 +00:00
|
|
|
;
|
|
|
|
|
; Make sure the common loop invariant A is hoisted up to preheader,
|
|
|
|
|
; since too many registers are needed to subsume it into the addressing modes.
|
2009-02-21 02:06:47 +00:00
|
|
|
; It's safe to sink A in when it's not pic.
|
2008-12-05 21:47:27 +00:00
|
|
|
|
|
|
|
|
@A = global [16 x [16 x i32]] zeroinitializer, align 32 ; <[16 x [16 x i32]]*> [#uses=2]
|
|
|
|
|
|
|
|
|
|
define void @test(i32 %row, i32 %N.in) nounwind {
|
|
|
|
|
entry:
|
|
|
|
|
%N = bitcast i32 %N.in to i32 ; <i32> [#uses=1]
|
|
|
|
|
%tmp5 = icmp sgt i32 %N.in, 0 ; <i1> [#uses=1]
|
|
|
|
|
br i1 %tmp5, label %cond_true, label %return
|
|
|
|
|
|
|
|
|
|
cond_true: ; preds = %cond_true, %entry
|
|
|
|
|
%indvar = phi i32 [ 0, %entry ], [ %indvar.next, %cond_true ] ; <i32> [#uses=2]
|
|
|
|
|
%i.0.0 = bitcast i32 %indvar to i32 ; <i32> [#uses=2]
|
|
|
|
|
%tmp2 = add i32 %i.0.0, 1 ; <i32> [#uses=1]
|
|
|
|
|
%tmp = getelementptr [16 x [16 x i32]]* @A, i32 0, i32 %row, i32 %tmp2 ; <i32*> [#uses=1]
|
|
|
|
|
store i32 4, i32* %tmp
|
|
|
|
|
%tmp5.upgrd.1 = add i32 %i.0.0, 2 ; <i32> [#uses=1]
|
|
|
|
|
%tmp7 = getelementptr [16 x [16 x i32]]* @A, i32 0, i32 %row, i32 %tmp5.upgrd.1 ; <i32*> [#uses=1]
|
|
|
|
|
store i32 5, i32* %tmp7
|
|
|
|
|
%indvar.next = add i32 %indvar, 1 ; <i32> [#uses=2]
|
|
|
|
|
%exitcond = icmp eq i32 %indvar.next, %N ; <i1> [#uses=1]
|
|
|
|
|
br i1 %exitcond, label %return, label %cond_true
|
|
|
|
|
|
|
|
|
|
return: ; preds = %cond_true, %entry
|
|
|
|
|
ret void
|
|
|
|
|
}
|
