Add test for this:

Allow operands after the induction variable (no restrictions):

  int x;
  for (i)
   j = .....
   a[i][x][j]


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

1 files changed, 22 insertions, 0 deletions

diff --git a/test/Transforms/LoopStrengthReduce/ops_after_indvar.ll b/test/Transforms/LoopStrengthReduce/ops_after_indvar.ll
new file mode 100644
index 0000000000..b4bda7e537
--- /dev/null
+++ b/test/Transforms/LoopStrengthReduce/ops_after_indvar.ll
@@ -0,0 +1,22 @@
+; Check that this test makes INDVAR and related stuff dead, because P[indvar]
+; gets reduced, making INDVAR dead.
+
+; RUN: llvm-as < %s | opt -loop-reduce | llvm-dis | not grep INDVAR
+
+declare bool %pred()
+declare int %getidx()
+
+void %test([10000 x int]* %P) {
+	br label %Loop
+Loop:
+	%INDVAR = phi int [0, %0], [%INDVAR2, %Loop]
+	%idx = call int %getidx()
+	%STRRED = getelementptr [10000 x int]* %P, int %INDVAR, int %idx
+	store int 0, int* %STRRED
+
+	%INDVAR2 = add int %INDVAR, 1
+	%cond = call bool %pred()
+	br bool %cond, label %Loop, label %Out
+Out:
+	ret void
+}