blob: b2e5159820365a5b41ee959be585554dbe142bdd (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
|
/* { 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[401][10][401];
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" } } */
|
