| 1 |
typedef __SIZE_TYPE__ size_t; |
| 2 |
extern "C" void abort (); |
| 3 |
|
| 4 |
void |
| 5 |
bar (int *a, int *b, int *c, int (*d)[2], int (*e)[4], int *f, int *g, size_t n) |
| 6 |
{ |
| 7 |
#pragma omp task in_reduction (*: a[:n], b[3:n], c[n:n], d[0][:n], e[0][1:n], f[:n], g[1:n]) |
| 8 |
{ |
| 9 |
a[0] *= 12; |
| 10 |
a[1] *= 13; |
| 11 |
b[3] *= 14; |
| 12 |
b[4] *= 15; |
| 13 |
c[n] *= 16; |
| 14 |
c[n + 1] *= 17; |
| 15 |
d[0][0] *= 18; |
| 16 |
d[0][1] *= 19; |
| 17 |
e[0][1] *= 20; |
| 18 |
e[0][2] *= 21; |
| 19 |
f[0] *= 22; |
| 20 |
f[1] *= 23; |
| 21 |
g[1] *= 24; |
| 22 |
g[2] *= 25; |
| 23 |
} |
| 24 |
} |
| 25 |
|
| 26 |
void |
| 27 |
foo (size_t n, void *x, void *y) |
| 28 |
{ |
| 29 |
int a[n], b[n + 3], c[2 * n]; |
| 30 |
int (*d)[n] = (int (*)[n]) x; |
| 31 |
int (*e)[n * 2] = (int (*)[n * 2]) y; |
| 32 |
int fb[n], gb[n * 2]; |
| 33 |
int (&f)[n] = fb; |
| 34 |
int (&g)[n * 2] = gb; |
| 35 |
int i; |
| 36 |
for (i = 0; i < n; i++) |
| 37 |
{ |
| 38 |
a[i] = 1; |
| 39 |
b[i + 3] = 1; |
| 40 |
c[i + n] = 1; |
| 41 |
d[0][i] = 1; |
| 42 |
e[0][i + 1] = 1; |
| 43 |
f[i] = 1; |
| 44 |
g[i + 1] = 1; |
| 45 |
} |
| 46 |
#pragma omp taskgroup task_reduction (*: a, b[3:n], c[n:n], d[0][:n], e[0][1:n], f, g[1:n]) |
| 47 |
{ |
| 48 |
bar (a, b, c, (int (*)[2]) d, (int (*)[4]) e, &f[0], &g[0], n); |
| 49 |
#pragma omp task in_reduction (*: a, b[3:n], c[n:n], d[0][:n], e[0][1:n], f, g[1:n]) |
| 50 |
{ |
| 51 |
a[0] *= 2; |
| 52 |
a[1] *= 3; |
| 53 |
b[3] *= 4; |
| 54 |
b[4] *= 5; |
| 55 |
c[n] *= 6; |
| 56 |
c[n + 1] *= 7; |
| 57 |
d[0][0] *= 8; |
| 58 |
d[0][1] *= 9; |
| 59 |
e[0][1] *= 10; |
| 60 |
e[0][2] *= 11; |
| 61 |
f[0] *= 12; |
| 62 |
f[1] *= 13; |
| 63 |
g[1] *= 14; |
| 64 |
g[2] *= 15; |
| 65 |
} |
| 66 |
n = 0; |
| 67 |
} |
| 68 |
if (a[0] != 24 || a[1] != 39 || b[3] != 56 || b[4] != 75) |
| 69 |
abort (); |
| 70 |
if (c[2] != 96 || c[3] != 119 || d[0][0] != 144 || d[0][1] != 171) |
| 71 |
abort (); |
| 72 |
if (e[0][1] != 200 || e[0][2] != 231 || f[0] != 264 || f[1] != 299) |
| 73 |
abort (); |
| 74 |
if (g[1] != 336 || g[2] != 375) |
| 75 |
abort (); |
| 76 |
} |
| 77 |
|
| 78 |
void |
| 79 |
baz (size_t n, void *x, void *y) |
| 80 |
{ |
| 81 |
int a[n], b[n + 3], c[2 * n]; |
| 82 |
int (*d)[n] = (int (*)[n]) x; |
| 83 |
int (*e)[n * 2] = (int (*)[n * 2]) y; |
| 84 |
int fb[n], gb[n * 2]; |
| 85 |
int i; |
| 86 |
for (i = 0; i < n; i++) |
| 87 |
{ |
| 88 |
a[i] = 1; |
| 89 |
b[i + 3] = 1; |
| 90 |
c[i + n] = 1; |
| 91 |
d[0][i] = 1; |
| 92 |
e[0][i + 1] = 1; |
| 93 |
fb[i] = 1; |
| 94 |
gb[i + 1] = 1; |
| 95 |
} |
| 96 |
#pragma omp parallel num_threads(2) |
| 97 |
#pragma omp master |
| 98 |
{ |
| 99 |
int (&f)[n] = fb; |
| 100 |
int (&g)[n * 2] = gb; |
| 101 |
#pragma omp taskgroup task_reduction (*: a, b[3:n], c[n:n], d[0][:n], e[0][1:n], f, g[1:n]) |
| 102 |
{ |
| 103 |
bar (a, b, c, (int (*)[2]) d, (int (*)[4]) e, &f[0], &g[0], n); |
| 104 |
#pragma omp task in_reduction (*: a, b[3:n], c[n:n], d[0][:n], e[0][1:n], f, g[1:n]) |
| 105 |
{ |
| 106 |
a[0] *= 2; |
| 107 |
a[1] *= 3; |
| 108 |
b[3] *= 4; |
| 109 |
b[4] *= 5; |
| 110 |
c[n] *= 6; |
| 111 |
c[n + 1] *= 7; |
| 112 |
d[0][0] *= 8; |
| 113 |
d[0][1] *= 9; |
| 114 |
e[0][1] *= 10; |
| 115 |
e[0][2] *= 11; |
| 116 |
f[0] *= 12; |
| 117 |
f[1] *= 13; |
| 118 |
g[1] *= 14; |
| 119 |
g[2] *= 15; |
| 120 |
} |
| 121 |
n = 0; |
| 122 |
} |
| 123 |
} |
| 124 |
if (a[0] != 24 || a[1] != 39 || b[3] != 56 || b[4] != 75) |
| 125 |
abort (); |
| 126 |
if (c[2] != 96 || c[3] != 119 || d[0][0] != 144 || d[0][1] != 171) |
| 127 |
abort (); |
| 128 |
if (e[0][1] != 200 || e[0][2] != 231 || fb[0] != 264 || fb[1] != 299) |
| 129 |
abort (); |
| 130 |
if (gb[1] != 336 || gb[2] != 375) |
| 131 |
abort (); |
| 132 |
} |
| 133 |
|
| 134 |
int |
| 135 |
main () |
| 136 |
{ |
| 137 |
int d[2], e[4]; |
| 138 |
volatile int two; |
| 139 |
two = 2; |
| 140 |
#pragma omp parallel num_threads (2) |
| 141 |
#pragma omp master |
| 142 |
foo (two, (void *) d, (void *) e); |
| 143 |
baz (two, (void *) d, (void *) e); |
| 144 |
return 0; |
| 145 |
} |