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

diff --git a/test/Transforms/IndVarSimplify/2003-09-23-NotAtTop.ll b/test/Transforms/IndVarSimplify/2003-09-23-NotAtTop.ll
index da22cf2e516419219fde54a43cbbd1eb28d26f5d..d70e604979787ac9099cf550eeff35cd9f6c231b 100644 (file)
--- a/test/Transforms/IndVarSimplify/2003-09-23-NotAtTop.ll
+++ b/test/Transforms/IndVarSimplify/2003-09-23-NotAtTop.ll
@@ -9,7 +9,8 @@ define i32 @test() {
 
 Loop:           ; preds = %Loop, %0
         %NonIndvar = phi i32 [ 200, %0 ], [ %NonIndvarNext, %Loop ]             ; <i32> [#uses=1]
-        %Canonical = phi i32 [ 0, %0 ], [ %CanonicalNext, %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