| 1 |
/* { dg-do run } */ |
| 2 |
|
| 3 |
/* Based on '../libgomp.oacc-fortran/asyncwait-3.f90'. */ |
| 4 |
|
| 5 |
/* { dg-additional-options "--param=openacc-kernels=decompose" } */ |
| 6 |
|
| 7 |
/* { dg-additional-options "-fopt-info-all-omp" } |
| 8 |
{ dg-additional-options "-foffload=-fopt-info-all-omp" } */ |
| 9 |
|
| 10 |
/* { dg-additional-options "--param=openacc-privatization=noisy" } |
| 11 |
{ dg-additional-options "-foffload=--param=openacc-privatization=noisy" } |
| 12 |
Prune a few: uninteresting, and potentially varying depending on GCC configuration (data types): |
| 13 |
{ dg-prune-output {note: variable '[Di]\.[0-9]+' declared in block isn't candidate for adjusting OpenACC privatization level: not addressable} } */ |
| 14 |
|
| 15 |
/* It's only with Tcl 8.5 (released in 2007) that "the variable 'varName' |
| 16 |
passed to 'incr' may be unset, and in that case, it will be set to [...]", |
| 17 |
so to maintain compatibility with earlier Tcl releases, we manually |
| 18 |
initialize counter variables: |
| 19 |
{ dg-line l_dummy[variable c_compute 0 c_loop_i 0] } |
| 20 |
{ dg-message "dummy" "" { target iN-VAl-Id } l_dummy } to avoid |
| 21 |
"WARNING: dg-line var l_dummy defined, but not used". */ |
| 22 |
|
| 23 |
#include <stdlib.h> |
| 24 |
|
| 25 |
#define N 64 |
| 26 |
|
| 27 |
int |
| 28 |
main (void) |
| 29 |
{ |
| 30 |
int *a, *b, *c; |
| 31 |
|
| 32 |
a = (int *)malloc (N * sizeof (*a)); |
| 33 |
b = (int *)malloc (N * sizeof (*b)); |
| 34 |
c = (int *)malloc (N * sizeof (*c)); |
| 35 |
|
| 36 |
#pragma acc parallel copy (a[0:N]) async (0) /* { dg-line l_compute[incr c_compute] } */ |
| 37 |
/* { dg-note {variable 'i' declared in block isn't candidate for adjusting OpenACC privatization level: not addressable} "" { target *-*-* } l_compute$c_compute } */ |
| 38 |
#pragma acc loop /* { dg-line l_loop_i[incr c_loop_i] } */ |
| 39 |
/* { dg-note {variable 'i' in 'private' clause isn't candidate for adjusting OpenACC privatization level: not addressable} "" { target *-*-* } l_loop_i$c_loop_i } */ |
| 40 |
/* { dg-optimized "assigned OpenACC gang vector loop parallelism" "" { target *-*-* } l_loop_i$c_loop_i } */ |
| 41 |
for (int i = 0; i < N; ++i) |
| 42 |
a[i] = 1; |
| 43 |
|
| 44 |
#pragma acc parallel copy (b[0:N]) async (1) /* { dg-line l_compute[incr c_compute] } */ |
| 45 |
/* { dg-note {variable 'i' declared in block isn't candidate for adjusting OpenACC privatization level: not addressable} "" { target *-*-* } l_compute$c_compute } */ |
| 46 |
#pragma acc loop /* { dg-line l_loop_i[incr c_loop_i] } */ |
| 47 |
/* { dg-note {variable 'i' in 'private' clause isn't candidate for adjusting OpenACC privatization level: not addressable} "" { target *-*-* } l_loop_i$c_loop_i } */ |
| 48 |
/* { dg-optimized "assigned OpenACC gang vector loop parallelism" "" { target *-*-* } l_loop_i$c_loop_i } */ |
| 49 |
for (int i = 0; i < N; ++i) |
| 50 |
b[i] = 1; |
| 51 |
|
| 52 |
#pragma acc wait (0, 1) |
| 53 |
|
| 54 |
#pragma acc parallel copy (a[0:N], b[0:N], c[0:N]) /* { dg-line l_compute[incr c_compute] } */ |
| 55 |
/* { dg-note {variable 'i' declared in block isn't candidate for adjusting OpenACC privatization level: not addressable} "" { target *-*-* } l_compute$c_compute } */ |
| 56 |
#pragma acc loop /* { dg-line l_loop_i[incr c_loop_i] } */ |
| 57 |
/* { dg-note {variable 'i' in 'private' clause isn't candidate for adjusting OpenACC privatization level: not addressable} "" { target *-*-* } l_loop_i$c_loop_i } */ |
| 58 |
/* { dg-optimized "assigned OpenACC gang vector loop parallelism" "" { target *-*-* } l_loop_i$c_loop_i } */ |
| 59 |
for (int i = 0; i < N; ++i) |
| 60 |
c[i] = a[i] + b[i]; |
| 61 |
|
| 62 |
for (int i = 0; i < N; ++i) |
| 63 |
if (c[i] != 2) |
| 64 |
abort (); |
| 65 |
|
| 66 |
#pragma acc kernels copy (a[0:N]) async (0) |
| 67 |
#pragma acc loop /* { dg-line l_loop_i[incr c_loop_i] } */ |
| 68 |
/* { dg-note {forwarded loop nest in OpenACC 'kernels' region to 'parloops' for analysis} {} { target *-*-* } l_loop_i$c_loop_i } */ |
| 69 |
/* { dg-note {variable 'i' declared in block isn't candidate for adjusting OpenACC privatization level: not addressable} "" { target *-*-* } l_loop_i$c_loop_i } */ |
| 70 |
/* { dg-note {variable 'i' in 'private' clause isn't candidate for adjusting OpenACC privatization level: not addressable} "" { target *-*-* } l_loop_i$c_loop_i } */ |
| 71 |
/* { dg-optimized "assigned OpenACC seq loop parallelism" "" { target *-*-* } l_loop_i$c_loop_i } */ |
| 72 |
for (int i = 0; i < N; ++i) |
| 73 |
a[i] = 1; |
| 74 |
|
| 75 |
#pragma acc kernels copy (b[0:N]) async (1) |
| 76 |
#pragma acc loop /* { dg-line l_loop_i[incr c_loop_i] } */ |
| 77 |
/* { dg-note {forwarded loop nest in OpenACC 'kernels' region to 'parloops' for analysis} {} { target *-*-* } l_loop_i$c_loop_i } */ |
| 78 |
/* { dg-note {variable 'i' declared in block isn't candidate for adjusting OpenACC privatization level: not addressable} "" { target *-*-* } l_loop_i$c_loop_i } */ |
| 79 |
/* { dg-note {variable 'i' in 'private' clause isn't candidate for adjusting OpenACC privatization level: not addressable} "" { target *-*-* } l_loop_i$c_loop_i } */ |
| 80 |
/* { dg-optimized "assigned OpenACC seq loop parallelism" "" { target *-*-* } l_loop_i$c_loop_i } */ |
| 81 |
for (int i = 0; i < N; ++i) |
| 82 |
b[i] = 1; |
| 83 |
|
| 84 |
#pragma acc wait (0, 1) |
| 85 |
|
| 86 |
#pragma acc kernels copy (a[0:N], b[0:N], c[0:N]) |
| 87 |
#pragma acc loop /* { dg-line l_loop_i[incr c_loop_i] } */ |
| 88 |
/* { dg-note {forwarded loop nest in OpenACC 'kernels' region to 'parloops' for analysis} {} { target *-*-* } l_loop_i$c_loop_i } */ |
| 89 |
/* { dg-note {variable 'i' declared in block isn't candidate for adjusting OpenACC privatization level: not addressable} "" { target *-*-* } l_loop_i$c_loop_i } */ |
| 90 |
/* { dg-note {variable 'i' in 'private' clause isn't candidate for adjusting OpenACC privatization level: not addressable} "" { target *-*-* } l_loop_i$c_loop_i } */ |
| 91 |
/* { dg-optimized "assigned OpenACC seq loop parallelism" "" { target *-*-* } l_loop_i$c_loop_i } */ |
| 92 |
for (int i = 0; i < N; ++i) |
| 93 |
c[i] = a[i] + b[i]; |
| 94 |
|
| 95 |
for (int i = 0; i < N; ++i) |
| 96 |
if (c[i] != 2) |
| 97 |
abort (); |
| 98 |
|
| 99 |
free (a); |
| 100 |
free (b); |
| 101 |
free (c); |
| 102 |
} |