Rearrange code so that llvm-upgrade doesn't break the optimization this

test is trying to verify.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@32135 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/test/CodeGen/X86/loop-hoist.ll b/test/CodeGen/X86/loop-hoist.ll
index 0eb20a52f5e6f708527b32d980fa893b3f311742..3ee0cbc469569fa2d814676aa33d388df69fa8c7 100644 (file)
--- a/test/CodeGen/X86/loop-hoist.ll
+++ b/test/CodeGen/X86/loop-hoist.ll
@@ -13,7 +13,7 @@ entry:
 cond_true:              ; preds = %cond_true, %entry
         %indvar = phi uint [ 0, %entry ], [ %indvar.next, %cond_true ]          ; <uint> [#uses=3]
         %i.0.0 = cast uint %indvar to int               ; <int> [#uses=1]
-        %tmp = getelementptr [0 x int]* %Arr, int 0, uint %indvar               ; <int*> [#uses=1]
+        %tmp = getelementptr [0 x int]* %Arr, int 0, int %i.0.0
         store int %i.0.0, int* %tmp
         %indvar.next = add uint %indvar, 1              ; <uint> [#uses=2]
         %exitcond = seteq uint %indvar.next, %N         ; <bool> [#uses=1]