Print pairwise dependence results, add testcases.

llvm-svn: 74402

5 files changed, 113 insertions, 0 deletions

diff --git a/llvm/test/Analysis/LoopDependenceAnalysis/dg.exp b/llvm/test/Analysis/LoopDependenceAnalysis/dg.exp
new file mode 100644
index 00000000000..f2005891a59
--- /dev/null
+++ b/llvm/test/Analysis/LoopDependenceAnalysis/dg.exp
@@ -0,0 +1,3 @@
+load_lib llvm.exp
+
+RunLLVMTests [lsort [glob -nocomplain $srcdir/$subdir/*.{ll,c,cpp}]]
diff --git a/llvm/test/Analysis/LoopDependenceAnalysis/siv-strong1.ll b/llvm/test/Analysis/LoopDependenceAnalysis/siv-strong1.ll
new file mode 100644
index 00000000000..01f11137d78
--- /dev/null
+++ b/llvm/test/Analysis/LoopDependenceAnalysis/siv-strong1.ll
@@ -0,0 +1,30 @@
+; RUN: llvm-as < %s | opt -disable-output -analyze -lda > %t
+; RUN: grep {instructions: 3} %t | count 1
+; RUN: grep {0,2: dependent} %t | count 1
+; RUN: grep {1,2: dependent} %t | count 1
+
+; for (i = 0; i < 256; i++)
+;   x[i] = x[i] + y[i]
+
+@x = common global [256 x i32] zeroinitializer, align 4
+@y = common global [256 x i32] zeroinitializer, align 4
+
+define void @foo(...) nounwind {
+entry:
+  br label %for.body
+
+for.body:
+  %i = phi i64 [ 0, %entry ], [ %i.next, %for.body ]
+  %y.addr = getelementptr [256 x i32]* @y, i64 0, i64 %i
+  %x.addr = getelementptr [256 x i32]* @x, i64 0, i64 %i
+  %x = load i32* %x.addr
+  %y = load i32* %y.addr
+  %r = add i32 %y, %x
+  store i32 %r, i32* %x.addr
+  %i.next = add i64 %i, 1
+  %exitcond = icmp eq i64 %i.next, 256
+  br i1 %exitcond, label %for.end, label %for.body
+
+for.end:
+  ret void
+}
diff --git a/llvm/test/Analysis/LoopDependenceAnalysis/siv-strong2.ll b/llvm/test/Analysis/LoopDependenceAnalysis/siv-strong2.ll
new file mode 100644
index 00000000000..e64b92c3e76
--- /dev/null
+++ b/llvm/test/Analysis/LoopDependenceAnalysis/siv-strong2.ll
@@ -0,0 +1,31 @@
+; RUN: llvm-as < %s | opt -disable-output -analyze -lda > %t
+; RUN: grep {instructions: 3} %t | count 1
+; RUN: grep {0,2: dependent} %t | count 1
+; RUN: grep {1,2: dependent} %t | count 1
+
+; for (i = 0; i < 256; i++)
+;   x[i+1] = x[i] + y[i]
+
+@x = common global [256 x i32] zeroinitializer, align 4
+@y = common global [256 x i32] zeroinitializer, align 4
+
+define void @foo(...) nounwind {
+entry:
+  br label %for.body
+
+for.body:
+  %i = phi i64 [ 0, %entry ], [ %i.next, %for.body ]
+  %y.ld.addr = getelementptr [256 x i32]* @y, i64 0, i64 %i
+  %x.ld.addr = getelementptr [256 x i32]* @x, i64 0, i64 %i
+  %i.next = add i64 %i, 1
+  %x.st.addr = getelementptr [256 x i32]* @x, i64 0, i64 %i.next
+  %x = load i32* %x.ld.addr
+  %y = load i32* %y.ld.addr
+  %r = add i32 %y, %x
+  store i32 %r, i32* %x.st.addr
+  %exitcond = icmp eq i64 %i.next, 256
+  br i1 %exitcond, label %for.end, label %for.body
+
+for.end:
+  ret void
+}
diff --git a/llvm/test/Analysis/LoopDependenceAnalysis/ziv1.ll b/llvm/test/Analysis/LoopDependenceAnalysis/ziv1.ll
new file mode 100644
index 00000000000..e42c0a08cb2
--- /dev/null
+++ b/llvm/test/Analysis/LoopDependenceAnalysis/ziv1.ll
@@ -0,0 +1,23 @@
+; RUN: llvm-as < %s | opt -disable-output -analyze -lda > %t
+; RUN: grep {instructions: 2} %t | count 1
+; RUN: grep {0,1: dependent} %t | count 1
+
+; x[5] = x[6]
+
+@x = common global [256 x i32] zeroinitializer, align 4
+
+define void @foo(...) nounwind {
+entry:
+  br label %for.body
+
+for.body:
+  %i = phi i64 [ 0, %entry ], [ %i.next, %for.body ]
+  %x = load i32* getelementptr ([256 x i32]* @x, i32 0, i64 6)
+  store i32 %x, i32* getelementptr ([256 x i32]* @x, i32 0, i64 5)
+  %i.next = add i64 %i, 1
+  %exitcond = icmp eq i64 %i.next, 256
+  br i1 %exitcond, label %for.end, label %for.body
+
+for.end:
+  ret void
+}
diff --git a/llvm/test/Analysis/LoopDependenceAnalysis/ziv2.ll b/llvm/test/Analysis/LoopDependenceAnalysis/ziv2.ll
new file mode 100644
index 00000000000..cecf3a750b6
--- /dev/null
+++ b/llvm/test/Analysis/LoopDependenceAnalysis/ziv2.ll
@@ -0,0 +1,26 @@
+; RUN: llvm-as < %s | opt -disable-output -analyze -lda > %t
+; RUN: grep {instructions: 2} %t | count 1
+; RUN: grep {0,1: dependent} %t | count 1
+
+; x[c] = x[c+1] // with c being a loop-invariant constant
+
+@x = common global [256 x i32] zeroinitializer, align 4
+
+define void @foo(i64 %c0) nounwind {
+entry:
+  %c1 = add i64 %c0, 1
+  %x.ld.addr = getelementptr [256 x i32]* @x, i64 0, i64 %c0
+  %x.st.addr = getelementptr [256 x i32]* @x, i64 0, i64 %c1
+  br label %for.body
+
+for.body:
+  %i = phi i64 [ 0, %entry ], [ %i.next, %for.body ]
+  %x = load i32* %x.ld.addr
+  store i32 %x, i32* %x.st.addr
+  %i.next = add i64 %i, 1
+  %exitcond = icmp eq i64 %i.next, 256
+  br i1 %exitcond, label %for.end, label %for.body
+
+for.end:
+  ret void
+}