6 int X[2*N], Y[2*N], B[2*N];
7 int A[2*N][2*N], C[2*N][2*N];
9 for (i = 1; i <= N; i++)
12 for (j = 1; j <= N; j++)
15 for (k = 1; k <= N; k++)
17 A[j+1][k] = B[j] + C[j][k];
33 /* Check that parallel code generation part make the right answer. */
34 /* { dg-final { scan-tree-dump-times "1 loops carried no dependency" 1 "graphite" } } */
35 /* { dg-final { cleanup-tree-dump "graphite" } } */
36 /* { dg-final { scan-tree-dump-times "loopfn.0" 5 "optimized" } } */
37 /* { dg-final { cleanup-tree-dump "parloops" } } */
38 /* { dg-final { cleanup-tree-dump "optimized" } } */