34 lines
766 B
C
34 lines
766 B
C
/* { dg-do compile } */
|
|
/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
|
|
|
|
void abort (void);
|
|
|
|
void parloop (int N)
|
|
{
|
|
int i, j,ii;
|
|
int x[400][10][400];
|
|
|
|
for (ii = 0; ii < N; ii++)
|
|
for (i = 0; i < N; i++)
|
|
for (j = 0; j < N; j++)
|
|
x[i][j][ii] = ii+i + j + 3;
|
|
|
|
for (ii = 0; ii < N; ii++)
|
|
for (i = 0; i < N;i++)
|
|
for (j = 0; j < N; j++)
|
|
if (x[i][j][ii] != ii+i + j + 3)
|
|
abort ();
|
|
}
|
|
|
|
int main(void)
|
|
{
|
|
parloop(400);
|
|
|
|
return 0;
|
|
}
|
|
|
|
/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops" } } */
|
|
/* { dg-final { scan-tree-dump-times "loopfn" 5 "optimized" } } */
|
|
/* { dg-final { cleanup-tree-dump "parloops" } } */
|
|
/* { dg-final { cleanup-tree-dump "optimized" } } */
|