8 for (i = 0; i < N; i++)
9 for (j = 0; j < N; j++)
12 for (i = 1; i < N; i++)
13 for (j = 1; j < (N-1) ; j++)
14 a[i][j] = a[i-1][j+1] * a[i-1][j+1]/2;
16 for (i = 0; i < N; i++)
17 for (j = 0; j < N; j++)
21 /* { dg-final { scan-tree-dump-times "number of SCoPs: 2" 1 "graphite"} } */
22 /* { dg-final { cleanup-tree-dump "graphite" } } */