| 1 |
/* { dg-additional-options "-fdump-tree-gimple" } */ |
| 2 |
|
| 3 |
/* Test for implied copy of reduction variable on combined construct. */ |
| 4 |
void test1 (void) |
| 5 |
{ |
| 6 |
int i, sum = 0, prod = 1, a[100]; |
| 7 |
|
| 8 |
#pragma acc kernels loop reduction(+:sum) reduction(*:prod) |
| 9 |
for (int i = 0; i < 10; ++i) |
| 10 |
{ |
| 11 |
sum += a[i]; |
| 12 |
prod *= a[i]; |
| 13 |
} |
| 14 |
|
| 15 |
#pragma acc parallel loop reduction(+:sum) reduction(*:prod) |
| 16 |
for (int i = 0; i < 10; ++i) |
| 17 |
{ |
| 18 |
sum += a[i]; |
| 19 |
prod *= a[i]; |
| 20 |
} |
| 21 |
|
| 22 |
#pragma acc serial loop reduction(+:sum) reduction(*:prod) |
| 23 |
for (int i = 0; i < 10; ++i) |
| 24 |
{ |
| 25 |
sum += a[i]; |
| 26 |
prod *= a[i]; |
| 27 |
} |
| 28 |
} |
| 29 |
|
| 30 |
/* { dg-final { scan-tree-dump-times "map\\(force_tofrom:sum \\\[len: \[0-9\]+\\\]\\)" 1 "gimple" } } */ |
| 31 |
/* { dg-final { scan-tree-dump-times "map\\(force_tofrom:prod \\\[len: \[0-9\]+\\\]\\)" 1 "gimple" } } */ |
| 32 |
/* { dg-final { scan-tree-dump-times "map\\(tofrom:sum \\\[len: \[0-9\]+\\\]\\)" 2 "gimple" } } */ |
| 33 |
/* { dg-final { scan-tree-dump-times "map\\(tofrom:prod \\\[len: \[0-9\]+\\\]\\)" 2 "gimple" } } */ |