[polly] r297157 - [tests] Update bounds-check elimination test cases

[Tobias Grosser via llvm-commits]

Author: grosser
Date: Tue Mar  7 10:17:58 2017
New Revision: 297157

URL: http://llvm.org/viewvc/llvm-project?rev=297157&view=rev
Log:
[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.

Modified:
    polly/trunk/test/ScopInfo/BoundChecks/single-loop.ll
    polly/trunk/test/ScopInfo/BoundChecks/two-loops.ll

Modified: polly/trunk/test/ScopInfo/BoundChecks/single-loop.ll
URL: http://llvm.org/viewvc/llvm-project/polly/trunk/test/ScopInfo/BoundChecks/single-loop.ll?rev=297157&r1=297156&r2=297157&view=diff
==============================================================================
--- polly/trunk/test/ScopInfo/BoundChecks/single-loop.ll (original)
+++ polly/trunk/test/ScopInfo/BoundChecks/single-loop.ll Tue Mar  7 10:17:58 2017
@@ -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

Modified: polly/trunk/test/ScopInfo/BoundChecks/two-loops.ll
URL: http://llvm.org/viewvc/llvm-project/polly/trunk/test/ScopInfo/BoundChecks/two-loops.ll?rev=297157&r1=297156&r2=297157&view=diff
==============================================================================
--- polly/trunk/test/ScopInfo/BoundChecks/two-loops.ll (original)
+++ polly/trunk/test/ScopInfo/BoundChecks/two-loops.ll Tue Mar  7 10:17:58 2017
@@ -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