blob: 6e027d2f69af125f3f904746264ba1c64c239c32 (
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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
|
/* { dg-do compile } */
/* { dg-options "-O2 -ftree-parallelize-loops=4 -fdump-tree-parloops-details -fdump-tree-optimized" } */
void abort (void);
int x[500][500];
int y[500];
int g_sum=0;
__attribute__((noinline))
void init (int i, int j)
{
x[i][j]=1;
}
__attribute__((noinline))
void parloop (int N)
{
int i, j;
int sum;
/* Outer loop reduction, outerloop is parallelized. */
sum=0;
for (i = 0; i < N; i++)
{
for (j = 0; j < N; j++)
y[i]=x[i][j];
sum += y[i];
}
g_sum = sum;
}
int main(void)
{
int i,j;
for (i = 0; i < 500; i++)
for (j = 0; j < 500; j++)
init(i, j);
parloop(500);
return 0;
}
/* Check that outer loop is parallelized. */
/* { dg-final { scan-tree-dump-times "parallelizing outer loop" 1 "parloops" } } */
/* { dg-final { scan-tree-dump-times "parallelizing inner loop" 0 "parloops" } } */
/* { dg-final { scan-tree-dump-times "loopfn" 5 "optimized" } } */
/* { dg-final { cleanup-tree-dump "parloops" } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
|
