diff options
| author | Chandler Carruth <chandlerc@gmail.com> | 2017-01-18 02:41:26 +0000 |
|---|---|---|
| committer | Chandler Carruth <chandlerc@gmail.com> | 2017-01-18 02:41:26 +0000 |
| commit | d50c5fb13f00ceac3353ce1a17fb5c53c5d65c03 (patch) | |
| tree | c80b6101a7fbbf50bd784a0eda354e550148fdb8 /llvm/test | |
| parent | 88c36d78529ebb0c9cd8605dbcca4630901bd9b0 (diff) | |
| download | bcm5719-llvm-d50c5fb13f00ceac3353ce1a17fb5c53c5d65c03.tar.gz bcm5719-llvm-d50c5fb13f00ceac3353ce1a17fb5c53c5d65c03.zip | |
[PM] Teach LoopDeletion to correctly update the LPM when loops are
deleted.
I've expanded its test coverage a bit including adding one test that
will crash clearly without this change.
llvm-svn: 292332
Diffstat (limited to 'llvm/test')
| -rw-r--r-- | llvm/test/Transforms/LoopDeletion/invalidation.ll | 42 | ||||
| -rw-r--r-- | llvm/test/Transforms/LoopDeletion/multiple-exit-conditions.ll | 2 | ||||
| -rw-r--r-- | llvm/test/Transforms/LoopDeletion/multiple-exits.ll | 3 |
3 files changed, 46 insertions, 1 deletions
diff --git a/llvm/test/Transforms/LoopDeletion/invalidation.ll b/llvm/test/Transforms/LoopDeletion/invalidation.ll new file mode 100644 index 00000000000..5564f90e1ea --- /dev/null +++ b/llvm/test/Transforms/LoopDeletion/invalidation.ll @@ -0,0 +1,42 @@ +; Ensure we don't run analyses over loops after they've been deleted. We run +; one version with a no-op loop pass to make sure that the loop doesn't get +; simplified away. +; +; RUN: opt < %s -passes='require<ivusers>,no-op-loop,require<ivusers>' -S \ +; RUN: | FileCheck %s --check-prefixes=CHECK,BEFORE +; RUN: opt < %s -passes='require<ivusers>,loop-deletion,require<ivusers>' -S \ +; RUN: | FileCheck %s --check-prefixes=CHECK,AFTER + + +define void @foo(i64 %n, i64 %m) nounwind { +; CHECK-LABEL: @foo( + +entry: + br label %bb +; CHECK: entry: +; BEFORE-NEXT: br label %bb +; AFTER-NEXT: br label %return + +bb: + %x.0 = phi i64 [ 0, %entry ], [ %t0, %bb2 ] + %t0 = add i64 %x.0, 1 + %t1 = icmp slt i64 %x.0, %n + br i1 %t1, label %bb2, label %return +; BEFORE: bb: +; BEFORE: br i1 {{.*}}, label %bb2, label %return +; AFTER-NOT: bb: +; AFTER-NOT: br + +bb2: + %t2 = icmp slt i64 %x.0, %m + br i1 %t1, label %bb, label %return +; BEFORE: bb2: +; BEFORE: br i1 {{.*}}, label %bb, label %return +; AFTER-NOT: bb2: +; AFTER-NOT: br + +return: + ret void +; CHECK: return: +; CHECK-NEXT: ret void +} diff --git a/llvm/test/Transforms/LoopDeletion/multiple-exit-conditions.ll b/llvm/test/Transforms/LoopDeletion/multiple-exit-conditions.ll index d7d6badb165..e7b47211d57 100644 --- a/llvm/test/Transforms/LoopDeletion/multiple-exit-conditions.ll +++ b/llvm/test/Transforms/LoopDeletion/multiple-exit-conditions.ll @@ -1,5 +1,5 @@ ; RUN: opt < %s -loop-deletion -S | FileCheck %s -; RUN: opt < %s -passes='require<scalar-evolution>,loop(loop-deletion)' -S | FileCheck %s +; RUN: opt < %s -passes='loop(loop-deletion)' -S | FileCheck %s ; ScalarEvolution can prove the loop iteration is finite, even though ; it can't represent the exact trip count as an expression. That's diff --git a/llvm/test/Transforms/LoopDeletion/multiple-exits.ll b/llvm/test/Transforms/LoopDeletion/multiple-exits.ll index ad9a30601f3..760c3aae4ee 100644 --- a/llvm/test/Transforms/LoopDeletion/multiple-exits.ll +++ b/llvm/test/Transforms/LoopDeletion/multiple-exits.ll @@ -5,6 +5,9 @@ ; ; RUN: opt < %s -loop-simplify -lcssa -S | FileCheck %s --check-prefixes=CHECK,BEFORE ; RUN: opt < %s -loop-deletion -S | FileCheck %s --check-prefixes=CHECK,AFTER +; +; RUN: opt < %s -passes=no-op-loop -S | FileCheck %s --check-prefixes=CHECK,BEFORE +; RUN: opt < %s -passes=loop-deletion -S | FileCheck %s --check-prefixes=CHECK,AFTER define void @foo(i64 %n, i64 %m) nounwind { |
