8 for (i
= 0; i
< N
; i
++)
9 for (j
= 0; j
< N
; j
++)
12 for (i
= 0; i
< N
; i
++)
13 for (j
= 0; j
< N
; j
++)
14 if (x
[i
][j
] != i
+ j
+ 3)
25 /* Check that parallel code generation part make the right answer. */
26 /* { dg-final { scan-tree-dump-times "2 loops carried no dependency" 1 "graphite" } } */
27 /* { dg-final { scan-tree-dump-times "loopfn" 4 "optimized" } } */