vendor/llvm/llvm-release_39-r276489

1 files changed, 39 insertions, 0 deletions

diff --git a/test/Analysis/LoopAccessAnalysis/memcheck-for-loop-invariant.ll b/test/Analysis/LoopAccessAnalysis/memcheck-for-loop-invariant.ll
new file mode 100644
index 0000000000000..f06bb00ec64aa
--- /dev/null
+++ b/test/Analysis/LoopAccessAnalysis/memcheck-for-loop-invariant.ll
@@ -0,0 +1,39 @@
+; RUN: opt -loop-accesses -analyze < %s | FileCheck %s
+; RUN: opt -passes='require<scalar-evolution>,require<aa>,loop(print-access-info)' -disable-output  < %s 2>&1 | FileCheck %s
+
+; Handle memchecks involving loop-invariant addresses:
+;
+; extern int *A, *b;
+; for (i = 0; i < N; ++i) {
+;  A[i] = b;
+; }
+
+target datalayout = "e-m:o-i64:64-f80:128-n8:16:32:64-S128"
+
+; CHECK: Memory dependences are safe with run-time checks
+; CHECK: Run-time memory checks:
+; CHECK-NEXT: Check 0:
+; CHECK-NEXT:   Comparing group ({{.*}}):
+; CHECK-NEXT:     %arrayidxA = getelementptr inbounds i32, i32* %a, i64 %ind
+; CHECK-NEXT:   Against group ({{.*}}):
+; CHECK-NEXT:   i32* %b
+
+define void @f(i32* %a, i32* %b) {
+entry:
+  br label %for.body
+
+for.body:                                         ; preds = %for.body, %entry
+  %ind = phi i64 [ 0, %entry ], [ %inc, %for.body ]
+
+  %arrayidxA = getelementptr inbounds i32, i32* %a, i64 %ind
+
+  %loadB = load i32, i32* %b, align 4
+  store i32 %loadB, i32* %arrayidxA, align 4
+
+  %inc = add nuw nsw i64 %ind, 1
+  %exitcond = icmp eq i64 %inc, 20
+  br i1 %exitcond, label %for.end, label %for.body
+
+for.end:                                          ; preds = %for.body
+  ret void
+}