1 ; RUN: llvm-as < %s | llc -march=x86 -relocation-model=static | \
2 ; RUN: grep {A+} | count 2
4 ; Make sure the common loop invariant A is not hoisted up to preheader,
5 ; since it can be subsumed into the addressing mode in all uses.
7 @A = internal global [16 x [16 x i32]] zeroinitializer, align 32 ; <[16 x [16 x i32]]*> [#uses=2]
9 define void @test(i32 %row, i32 %N.in) nounwind {
11 %N = bitcast i32 %N.in to i32 ; <i32> [#uses=1]
12 %tmp5 = icmp sgt i32 %N.in, 0 ; <i1> [#uses=1]
13 br i1 %tmp5, label %cond_true, label %return
15 cond_true: ; preds = %cond_true, %entry
16 %indvar = phi i32 [ 0, %entry ], [ %indvar.next, %cond_true ] ; <i32> [#uses=2]
17 %i.0.0 = bitcast i32 %indvar to i32 ; <i32> [#uses=2]
18 %tmp2 = add i32 %i.0.0, 1 ; <i32> [#uses=1]
19 %tmp = getelementptr [16 x [16 x i32]]* @A, i32 0, i32 %row, i32 %tmp2 ; <i32*> [#uses=1]
20 store i32 4, i32* %tmp
21 %tmp5.upgrd.1 = add i32 %i.0.0, 2 ; <i32> [#uses=1]
22 %tmp7 = getelementptr [16 x [16 x i32]]* @A, i32 0, i32 %row, i32 %tmp5.upgrd.1 ; <i32*> [#uses=1]
23 store i32 5, i32* %tmp7
24 %indvar.next = add i32 %indvar, 1 ; <i32> [#uses=2]
25 %exitcond = icmp eq i32 %indvar.next, %N ; <i1> [#uses=1]
26 br i1 %exitcond, label %return, label %cond_true
28 return: ; preds = %cond_true, %entry