[tests] Update bounds-check elimination test cases

These test cases should work in combination with
https://reviews.llvm.org/D12676, but became outdated over time. Update them
in preparation of discussions with Daniel Berlin on how to represent unreachable
in the post-dominator tree.

llvm-svn: 297157

2 files changed, 8 insertions, 8 deletions

diff --git a/polly/test/ScopInfo/BoundChecks/single-loop.ll b/polly/test/ScopInfo/BoundChecks/single-loop.ll
index 8a00193ad41..42d2e455026 100644
--- a/polly/test/ScopInfo/BoundChecks/single-loop.ll
+++ b/polly/test/ScopInfo/BoundChecks/single-loop.ll
@@ -22,11 +22,11 @@
 ; We should detect this kernel as a SCoP and derive run-time conditions such
 ; that the bound-checked blocks are not part of the optimized SCoP.
 
-; CHECK: Assumed Context:
-; CHECK:  [n] -> {  : n <= 100 }
+; CHECK: Invalid Context:
+; CHECK:  [n] -> {  : n >= 101 }
 
-; AST: if (n <= 100)
-; AST:     for (int c0 = 0; c0 <= min(99, n - 1); c0 += 1)
+; AST: if (1 && 0 == n >= 101)
+; AST:     for (int c0 = 0; c0 < n; c0 += 1)
 ; AST:       Stmt_if_end_4(c0);
 ;
 ; AST-NOT: for
diff --git a/polly/test/ScopInfo/BoundChecks/two-loops.ll b/polly/test/ScopInfo/BoundChecks/two-loops.ll
index 314a81b6756..472a231e8ba 100644
--- a/polly/test/ScopInfo/BoundChecks/two-loops.ll
+++ b/polly/test/ScopInfo/BoundChecks/two-loops.ll
@@ -21,11 +21,11 @@
 ;    }
 ;
 ; CHECK: Assumed Context:
-; CHECK:  [n] -> {  : n <= 100 }
+; CHECK:  [n] -> {  : n >= 101 }
 
-; AST: if (n <= 100)
-; AST:     for (int c0 = 0; c0 <= min(99, n - 1); c0 += 1)
-; AST:       for (int c1 = 0; c1 <= min(n - c0 - 1, -c0 + 99); c1 += 1)
+; AST: if (1 && 0 == n >= 101)
+; AST:     for (int c0 = 0; c0 < n; c0 += 1)
+; AST:       for (int c1 = 0; c1 < n - c0; c1 += 1)
 ; AST:         Stmt_if_end_7(c0, c1);
 ;
 ; AST-NOT: for