1 /* { dg-require-effective-target size32plus } */
10 int A[N][N], B[N][N], C[N][N];
12 static int __attribute__((noinline))
17 /* Loops J and K should be interchanged. */
18 for (i = 0; i < N; i++)
19 for (j = 0; j < N; j++)
22 for (k = 0; k < N; k++)
23 A[i][j] += B[i][k] * C[k][j];
26 return A[0][0] + A[N-1][N-1];
36 for (i = 0; i < N; i++)
37 for (j = 0; j < N; j++)
47 fprintf (stderr, "res = %d \n", res);
56 /* { dg-final { scan-tree-dump-times "will be interchanged" 1 "graphite" } } */
57 /* { dg-final { cleanup-tree-dump "graphite" } } */