| 1 |
void abort (void); |
| 2 |
|
| 3 |
#define N 500 |
| 4 |
|
| 5 |
int Z[2*N+2][2*N+2], B[2*N+2][2*N+2]; |
| 6 |
|
| 7 |
void foo(void) |
| 8 |
{ |
| 9 |
int i,j; |
| 10 |
|
| 11 |
for (i = 0; i < 2*N+2; i++) |
| 12 |
for (j = 0; j < 2*N+2; j++) |
| 13 |
B[i][j] = Z[i][j] = i + j; |
| 14 |
|
| 15 |
for (i = 0; i <= N; i++) |
| 16 |
for (j = 0; j <= N; j++) |
| 17 |
Z[i][j] = Z[j+N][i+N+1]; |
| 18 |
|
| 19 |
for (i = 0; i <= N; i++) |
| 20 |
for (j = 0; j <=N; j++) |
| 21 |
if (Z[i][j] != B[j+N][i+N+1]) |
| 22 |
abort(); |
| 23 |
} |
| 24 |
|
| 25 |
int main(void) |
| 26 |
{ |
| 27 |
foo(); |
| 28 |
return 0; |
| 29 |
} |
| 30 |
|
| 31 |
/* Check that parallel code generation part make the right answer. */ |
| 32 |
/* { dg-final { scan-tree-dump-times "4 loops carried no dependency" 1 "graphite" } } */ |
| 33 |
/* { dg-final { scan-tree-dump-times "loopfn.0" 4 "optimized" } } */ |
| 34 |
/* { dg-final { scan-tree-dump-times "loopfn.1" 4 "optimized" } } */ |