tree iter_type = TREE_TYPE (loop->v);
tree plus_type = iter_type;
- gcc_assert (loop->cond_code == fd->loop.cond_code);
+ gcc_assert (loop->cond_code == LT_EXPR || loop->cond_code == GT_EXPR);
if (POINTER_TYPE_P (iter_type))
plus_type = sizetype;
--- /dev/null
+/* Test for ICE as reported in PR98088. */
+
+int i, j;
+
+void
+f1 (void)
+{
+ #pragma acc parallel
+ #pragma acc loop collapse (2)
+ for (i = 5; i > 5; i--)
+ for (j = 5; j > 0; j--)
+ ;
+}
+
+void
+f2 (void)
+{
+ #pragma acc parallel
+ #pragma acc loop collapse (2)
+ for (i = 0; i < 5; i++)
+ for (j = 5; j > 0; j--)
+ ;
+}
+
+void
+f3 (void)
+{
+ #pragma acc parallel
+ #pragma acc loop collapse (2)
+ for (i = 5; i >= 0; i--)
+ for (j = 5; j >= 0; j--)
+ ;
+}
+
+void f4 ()
+{
+ #pragma acc parallel loop tile(2, 3)
+ for (int i = 0; i > 8; i++)
+ for (int j = 0; j > 8; j++);
+}
+
+void f5 ()
+{
+ #pragma acc parallel loop tile(2, 3)
+ for (int i = 0; i > 8; i++)
+ for (long j = 0; j > 8; j++);
+}
+
+void
+f6 (int a[32][32])
+{
+ #pragma acc parallel loop collapse(2)
+ for (int i = 16; i > 8; i--)
+ for (int j = 16; j > 8; j--)
+ a[i][j] = i + j;
+}
int
main (void)
{
- int i, j, k, l = 0, f = 0, x = 0;
+ int i, j, k, l = 0, f = 0, x = 0, l2 = 0;
int m1 = 4, m2 = -5, m3 = 17;
#pragma acc parallel
}
}
+ /* Test loop with > condition. */
+#pragma acc parallel
+ #pragma acc loop seq collapse(3) reduction(+:l2)
+ for (i = -2; i < m1; i++)
+ for (j = -3; j > (m2 - 1); j--)
+ {
+ for (k = 13; k < m3; k++)
+ {
+ if ((i + 2) * 12 + (j + 5) * 4 + (k - 13) != 9 + f++)
+ l2++;
+ }
+ }
+
for (i = -2; i < m1; i++)
for (j = m2; j < -2; j++)
{
}
}
- if (l != x)
+ if (l != x || l2 != x)
abort ();
return 0;
int
main (void)
{
- int i2, l = 0, r = 0;
+ int i2, l = 0, r = 0, l2 = 0;
int a[3][3][3];
memset (a, '\0', sizeof (a));
l += 1;
}
+ /* Test loop with >= condition. */
+#pragma acc parallel
+ {
+ #pragma acc loop collapse(2) reduction(|:l2)
+ for (i2 = 0; i2 < 2; i2++)
+ for (int j = 1; j >= 0; j--)
+ for (int k = 0; k < 2; k++)
+ if (a[i2][j][k] != i2 + j * 4 + k * 16)
+ l2 += 1;
+ }
+
for (i2 = 0; i2 < 2; i2++)
for (int j = 0; j < 2; j++)
for (int k = 0; k < 2; k++)
if (a[i2][j][k] != i2 + j * 4 + k * 16)
r += 1;
- if (l != r)
+ if (l != r || l2 != r)
abort ();
return 0;
}