8 for (i = 0; i < N; i++)
12 for (j = 0; j < N; j++)
34 /* Check that parallel code generation part make the right answer. */
35 /* { dg-final { scan-tree-dump-times "2 loops carried no dependency" 1 "graphite" } } */
36 /* { dg-final { cleanup-tree-dump "graphite" } } */
37 /* { dg-final { scan-tree-dump-times "loopfn.0" 5 "optimized" } } */
38 /* { dg-final { scan-tree-dump-times "loopfn.1" 5 "optimized" } } */
39 /* { dg-final { cleanup-tree-dump "parloops" } } */
40 /* { dg-final { cleanup-tree-dump "optimized" } } */