Update isl to isl-0.15-117-ge42acfe

Besides other changes this version of isl contains a fundamental fix to memory
corruption issues we have seen with imath-32 backed isl_ints.

This update also contains a fix that ensures that the schedule-tree based
version of isl's dependence analysis takes the domain of the schedule into
account.

llvm-svn: 244585

3 files changed, 3 insertions, 3 deletions

diff --git a/polly/lib/External/isl/test_inputs/codegen/omega/iter9-0.c b/polly/lib/External/isl/test_inputs/codegen/omega/iter9-0.c
index 4f268a6a767..d25a354a4dc 100644
--- a/polly/lib/External/isl/test_inputs/codegen/omega/iter9-0.c
+++ b/polly/lib/External/isl/test_inputs/codegen/omega/iter9-0.c
@@ -6,6 +6,6 @@ for (int c0 = 1; c0 <= 15; c0 += 1) {
     s2(c0);
     s1(c0);
   }
-  if (((-exprVar1 + 15) % 8) + c0 <= 15 || (c0 >= 9 && (exprVar1 - c0 + 1) % 8 == 0))
+  if (((-exprVar1 + 15) % 8) + c0 <= 15 || (exprVar1 - c0 + 1) % 8 == 0)
     s5(c0);
 }
diff --git a/polly/lib/External/isl/test_inputs/codegen/roman.c b/polly/lib/External/isl/test_inputs/codegen/roman.c
index 1dd43c52012..d7e4077ec0e 100644
--- a/polly/lib/External/isl/test_inputs/codegen/roman.c
+++ b/polly/lib/External/isl/test_inputs/codegen/roman.c
@@ -17,7 +17,7 @@
       S_24(c1, c3);
       S_19(c1, c3);
     }
-    if (np1 >= i && i + c1 <= 21) {
+    if (i + c1 <= 21) {
       S_15(c1, i + c1 - 2);
       for (int c5 = 0; c5 < i + c1 - 2; c5 += 1) {
         S_16(c1, i + c1 - 2, c5);
diff --git a/polly/lib/External/isl/test_inputs/codegen/separate2.c b/polly/lib/External/isl/test_inputs/codegen/separate2.c
index 0fba4f1f552..469c894a945 100644
--- a/polly/lib/External/isl/test_inputs/codegen/separate2.c
+++ b/polly/lib/External/isl/test_inputs/codegen/separate2.c
@@ -4,6 +4,6 @@ if ((length - 1) % 16 <= 14)
       for (int c6 = max(0, 2 * ((length - 1) % 16) + 2 * c5 - 60); c6 <= 30; c6 += 1) {
         if (2 * length + c6 >= 2 * ((length - 1) % 16) + 4 && 2 * ((length - 1) % 16) >= c6 && 2 * ((length - 1) % 16) + 2 * c5 >= c6 && c6 + 62 >= 2 * ((length - 1) % 16) + 2 * c5 && 2 * ((length - 1) % 16) + 2 * c5 == 2 * ((length - 1) % 32) + c6 && (2 * c5 - c6) % 32 == 0)
           S_3(c0, 0, (c6 / 2) - ((length - 1) % 16) + length - 1);
-        if (length <= 16 && length >= c5 + 1 && c6 >= 1 && length >= c6)
+        if (length <= 15 && length >= c5 + 1 && c6 >= 1 && length >= c6)
           S_0(c0, c5, c6 - 1);
       }