1 /* { dg-require-effective-target size32plus } */
10 static int x1[NMAX], x2[NMAX], a[NMAX][NMAX], y1[NMAX], y2[NMAX];
12 static int __attribute__((noinline))
18 for (i = 0; i < N; i++)
19 for (j = 0; j < N; j++)
20 x1[i] = x1[i] + a[i][j] * y1[j];
22 for (i = 0; i < N; i++)
23 for (j = 0; j < N; j++)
24 x2[i] = x2[i] + a[j][i] * y2[j];
36 for (i = 0; i < NMAX; i++)
37 for (j = 0; j < NMAX; j++)
40 for (i = 0; i < NMAX; i++)
51 fprintf (stderr, "res = %d \n", res);
60 /* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" { xfail *-*-* } } } */
61 /* { dg-final { cleanup-tree-dump "graphite" } } */