8 for (i
= 0; i
< N
; i
++)
11 for (i
= 0; i
< N
; i
++)
25 /* Check that parallel code generation part make the right answer. */
26 /* { dg-final { scan-tree-dump-times "1 loops carried no dependency" 2 "graphite" } } */
27 /* { dg-final { cleanup-tree-dump "graphite" } } */
28 /* { dg-final { scan-tree-dump-times "loopfn" 5 "optimized" } } */
29 /* { dg-final { cleanup-tree-dump "parloops" } } */
30 /* { dg-final { cleanup-tree-dump "optimized" } } */