11 for (i = 0; i < 3*N; i++)
14 for (i = 1; i < N; i++)
15 for (j = 1; j < i; j++)
16 /* This loop carried no dependency, it fails
17 at code generation part.*/
20 for (i = 1; i < N; i++)
21 for (j = 1; j < i; j++)
22 if (A[j+N] != B[j] + j)
33 /* Check that parallel code generation part make the right answer. */
34 /* { dg-final { scan-tree-dump-times "2 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 { scan-tree-dump-times "loopfn.1" 5 "optimized" { xfail *-*-* } } } */
38 /* { dg-final { cleanup-tree-dump "parloops" } } */
39 /* { dg-final { cleanup-tree-dump "optimized" } } */