1 /* { dg-require-effective-target size32plus } */
11 int A[M][M][M], B[M][M], C[M][M];
13 static int __attribute__((noinline))
18 /* These loops contain too few iterations to be blocked by 64. */
19 for (i = 0; i < 24; i++)
20 for (j = 0; j < 24; j++)
21 for (k = 0; k < 24; k++)
22 A[i][j][k] = B[i][k] * C[k][j];
24 /* These loops should still be loop blocked. */
25 for (i = 0; i < M; i++)
26 for (j = 0; j < M; j++)
27 for (k = 0; k < M; k++)
28 A[i][j][k] = B[i][k] * C[k][j];
30 return A[0][0][0] + A[M-1][M-1][M-1];
40 for (i = 0; i < M; i++)
41 for (j = 0; j < M; j++)
50 fprintf (stderr, "res = %d \n", res);
59 /* { dg-final { scan-tree-dump-times "will be loop blocked" 1 "graphite" } } */
60 /* { dg-final { cleanup-tree-dump "graphite" } } */