/* { dg-require-effective-target size32plus } */
+/* { dg-require-effective-target run_expensive_tests } PR testsuite/48283 */
#define DEBUG 0
#if DEBUG
{
int i, j, k;
+ /* This should NOT be blocked: each loop iterates only 24 times. */
for (i = 0; i < 24; i++)
for (j = 0; j < 24; j++)
for (k = 0; k < 24; k++)
A[i][j] = B[i][k] * C[k][j];
+ /* This should be blocked. */
for (i = 0; i < M; i++)
for (j = 0; j < M; j++)
for (k = 0; k < M; k++)
return A[0][0] + A[M-1][M-1];
}
+extern void abort ();
+
int
main (void)
{
fprintf (stderr, "res = %d \n", res);
#endif
- return res != 998001;
+ if (res != 998001)
+ abort ();
+
+ return 0;
}
/* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" { xfail *-*-* } } } */