| /* { dg-options "-O2 -floop-block -fdump-tree-graphite-all" } */ |
| |
| #define N 10000 |
| void foo (int); |
| int test () |
| { |
| int a[N][N]; |
| int b[N][N]; |
| unsigned i, j; |
| |
| for (i = 0; i < N; i++) |
| for (j = 0; j < N; j++) |
| a[i][j] = i*j; |
| |
| for (j = 1; j < N; j++) |
| for (i = 0; i < N; i++) |
| a[i][j] = a[i][j-1] + b[i][j]; |
| |
| for (i = 0; i < N; i++) |
| for (j = 0; j < N; j++) |
| foo (a[i][j]); |
| } |
| |
| /* Interchange is legal for loops 0 and 1 of the first two SCoPs */ |
| /* { dg-final { scan-tree-dump-times "Interchange valid for loops 0 and 1:" 2 "graphite"} } */ |
| /* { dg-final { cleanup-tree-dump "graphite" } } */ |
