| 1 |
extern "C" void abort (); |
| 2 |
|
| 3 |
struct S { S (); S (long int, long int); ~S (); static int cnt1, cnt2, cnt3; long int s, t; }; |
| 4 |
|
| 5 |
int S::cnt1; |
| 6 |
int S::cnt2; |
| 7 |
int S::cnt3; |
| 8 |
|
| 9 |
S::S () |
| 10 |
{ |
| 11 |
#pragma omp atomic |
| 12 |
cnt1++; |
| 13 |
} |
| 14 |
|
| 15 |
S::S (long int x, long int y) : s (x), t (y) |
| 16 |
{ |
| 17 |
#pragma omp atomic update |
| 18 |
++cnt2; |
| 19 |
} |
| 20 |
|
| 21 |
S::~S () |
| 22 |
{ |
| 23 |
#pragma omp atomic |
| 24 |
cnt3 = cnt3 + 1; |
| 25 |
if (t < 3 || t > 9 || (t & 1) == 0) |
| 26 |
abort (); |
| 27 |
} |
| 28 |
|
| 29 |
void |
| 30 |
bar (S *p, S *o) |
| 31 |
{ |
| 32 |
p->s = 1; |
| 33 |
if (o->t != 5) |
| 34 |
abort (); |
| 35 |
p->t = 9; |
| 36 |
} |
| 37 |
|
| 38 |
static inline void |
| 39 |
baz (S *o, S *i) |
| 40 |
{ |
| 41 |
if (o->t != 5 || i->t != 9) |
| 42 |
abort (); |
| 43 |
o->s *= i->s; |
| 44 |
} |
| 45 |
|
| 46 |
#pragma omp declare reduction (+: S : omp_out.s += omp_in.s) initializer (omp_priv (0, 3)) |
| 47 |
#pragma omp declare reduction (*: S : baz (&omp_out, &omp_in)) initializer (bar (&omp_priv, &omp_orig)) |
| 48 |
|
| 49 |
S as[2] = { { 0, 7 }, { 0, 7 } }; |
| 50 |
S (&a)[2] = as; |
| 51 |
S bs[7] = { { 9, 5 }, { 11, 5 }, { 1, 5 }, { 1, 5 }, { 1, 5 }, { 13, 5 }, { 15, 5 } }; |
| 52 |
S (&b)[7] = bs; |
| 53 |
S es[3] = { { 5, 7 }, { 0, 7 }, { 5, 7 } }; |
| 54 |
S (&e)[3] = es; |
| 55 |
S fs[5] = { { 6, 7 }, { 7, 7 }, { 0, 7 }, { 0, 7 }, { 9, 7 } }; |
| 56 |
S (&f)[5] = fs; |
| 57 |
S gs[4] = { { 1, 7 }, { 0, 7 }, { 0, 7 }, { 2, 7 } }; |
| 58 |
S (&g)[4] = gs; |
| 59 |
S hs[3] = { { 0, 7 }, { 1, 7 }, { 4, 7 } }; |
| 60 |
S (&h)[3] = hs; |
| 61 |
S ks[4][2] = { { { 5, 7 }, { 6, 7 } }, { { 0, 7 }, { 0, 7 } }, { { 0, 7 }, { 0, 7 } }, { { 7, 7 }, { 8, 7 } } }; |
| 62 |
S (&k)[4][2] = ks; |
| 63 |
S *ss; |
| 64 |
S *&s = ss; |
| 65 |
S (*ts)[2]; |
| 66 |
S (*&t)[2] = ts; |
| 67 |
|
| 68 |
template <typename S, typename T> |
| 69 |
void |
| 70 |
foo (T &n, S *&c, S *&d, S (&m)[3], S *&r, S (&o)[4], S *&p, S (&q)[4][2]) |
| 71 |
{ |
| 72 |
T i; |
| 73 |
for (i = 0; i < 2; i++) |
| 74 |
#pragma omp task in_reduction (+: a, c[:2]) in_reduction (*: b[2 * n:3 * n], d[0:2]) \ |
| 75 |
in_reduction (+: o[n:n*2], m[1], k[1:2][:], p[0], f[2:2]) \ |
| 76 |
in_reduction (+: q[1:2][:], g[n:n*2], e[1], h[0], r[2:2]) \ |
| 77 |
in_reduction (*: s[1:2], t[2:2][:]) |
| 78 |
{ |
| 79 |
a[0].s += 7; |
| 80 |
a[1].s += 17; |
| 81 |
b[2].s *= 2; |
| 82 |
b[4].s *= 2; |
| 83 |
c[0].s += 6; |
| 84 |
d[1].s *= 2; |
| 85 |
e[1].s += 19; |
| 86 |
f[2].s += 21; |
| 87 |
f[3].s += 23; |
| 88 |
g[1].s += 25; |
| 89 |
g[2].s += 27; |
| 90 |
h[0].s += 29; |
| 91 |
k[1][0].s += 31; |
| 92 |
k[2][1].s += 33; |
| 93 |
m[1].s += 19; |
| 94 |
r[2].s += 21; |
| 95 |
r[3].s += 23; |
| 96 |
o[1].s += 25; |
| 97 |
o[2].s += 27; |
| 98 |
p[0].s += 29; |
| 99 |
q[1][0].s += 31; |
| 100 |
q[2][1].s += 33; |
| 101 |
s[1].s *= 2; |
| 102 |
t[2][0].s *= 2; |
| 103 |
t[3][1].s *= 2; |
| 104 |
if ((e[1].t != 7 && e[1].t != 3) || (h[0].t != 7 && h[0].t != 3) |
| 105 |
|| (m[1].t != 7 && m[1].t != 3) || (p[0].t != 7 && p[0].t != 3)) |
| 106 |
abort (); |
| 107 |
for (T z = 0; z < 2; z++) |
| 108 |
if ((a[z].t != 7 && a[z].t != 3) || (c[z].t != 7 && c[z].t != 3) |
| 109 |
|| (d[z].t != 5 && d[z].t != 9) || (f[z + 2].t != 7 && f[z + 2].t != 3) |
| 110 |
|| (g[z + 1].t != 7 && g[z + 1].t != 3) || (r[z + 2].t != 7 && r[z + 2].t != 3) |
| 111 |
|| (s[z + 1].t != 5 && s[z + 1].t != 9) || (o[z + 1].t != 7 && o[z + 1].t != 3) |
| 112 |
|| (k[z + 1][0].t != 7 && k[z + 1][0].t != 3) || (k[z + 1][1].t != 7 && k[z + 1][1].t != 3) |
| 113 |
|| (q[z + 1][0].t != 7 && q[z + 1][0].t != 3) || (q[z + 1][1].t != 7 && q[z + 1][1].t != 3) |
| 114 |
|| (t[z + 2][0].t != 5 && t[z + 2][0].t != 9) || (t[z + 2][1].t != 5 && t[z + 2][1].t != 9)) |
| 115 |
abort (); |
| 116 |
for (T z = 0; z < 3; z++) |
| 117 |
if (b[z + 2].t != 5 && b[z + 2].t != 9) |
| 118 |
abort (); |
| 119 |
} |
| 120 |
} |
| 121 |
|
| 122 |
template <typename S, typename T> |
| 123 |
void |
| 124 |
test (T &n) |
| 125 |
{ |
| 126 |
S cs[2] = { { 0, 7 }, { 0, 7 } }; |
| 127 |
S (&c)[2] = cs; |
| 128 |
S ps[3] = { { 0, 7 }, { 1, 7 }, { 4, 7 } }; |
| 129 |
S (&p)[3] = ps; |
| 130 |
S qs[4][2] = { { { 5, 7 }, { 6, 7 } }, { { 0, 7 }, { 0, 7 } }, { { 0, 7 }, { 0, 7 } }, { { 7, 7 }, { 8, 7 } } }; |
| 131 |
S (&q)[4][2] = qs; |
| 132 |
S sb[4] = { { 5, 5 }, { 1, 5 }, { 1, 5 }, { 6, 5 } }; |
| 133 |
S tb[5][2] = { { { 9, 5 }, { 10, 5 } }, { { 11, 5 }, { 12, 5 } }, { { 1, 5 }, { 1, 5 } }, { { 1, 5 }, { 1, 5 } }, { { 13, 5 }, { 14, 5 } } }; |
| 134 |
S ms[3] = { { 5, 7 }, { 0, 7 }, { 5, 7 } }; |
| 135 |
S os[4] = { { 1, 7 }, { 0, 7 }, { 0, 7 }, { 2, 7 } }; |
| 136 |
s = sb; |
| 137 |
t = tb; |
| 138 |
#pragma omp parallel if (0) |
| 139 |
{ |
| 140 |
S ds[] = { { 1, 5 }, { 1, 5 } }; |
| 141 |
S (&d)[2] = ds; |
| 142 |
S (&m)[3] = ms; |
| 143 |
S rs[5] = { { 6, 7 }, { 7, 7 }, { 0, 7 }, { 0, 7 }, { 9, 7 } }; |
| 144 |
S (&r)[5] = rs; |
| 145 |
S (&o)[4] = os; |
| 146 |
#pragma omp parallel |
| 147 |
{ |
| 148 |
#pragma omp for reduction (task, +: a, c) reduction (task, *: b[2 * n:3 * n], d) \ |
| 149 |
reduction (task, +: e[1], f[2:2], g[n:n*2], h[0], k[1:2][0:2]) \ |
| 150 |
reduction (task, +: o[n:n*2], m[1], q[1:2][:], p[0], r[2:2]) \ |
| 151 |
reduction (task, *: t[2:2][:], s[1:n + 1]) \ |
| 152 |
schedule (monotonic: runtime) |
| 153 |
for (T i = 0; i < 4; i++) |
| 154 |
#pragma omp task in_reduction (+: a, c) in_reduction (*: b[2 * n:3 * n], d) \ |
| 155 |
in_reduction (+: o[n:n*2], q[1:2][:], p[0], m[1], r[2:2]) \ |
| 156 |
in_reduction (+: g[n:n * 2], e[1], k[1:2][:], h[0], f[2:2]) \ |
| 157 |
in_reduction (*: s[1:2], t[2:2][:]) |
| 158 |
{ |
| 159 |
T j; |
| 160 |
a[0].s += 2; |
| 161 |
a[1].s += 3; |
| 162 |
b[2].s *= 2; |
| 163 |
f[3].s += 8; |
| 164 |
g[1].s += 9; |
| 165 |
g[2].s += 10; |
| 166 |
h[0].s += 11; |
| 167 |
k[1][1].s += 13; |
| 168 |
k[2][1].s += 15; |
| 169 |
m[1].s += 16; |
| 170 |
r[2].s += 8; |
| 171 |
s[1].s *= 2; |
| 172 |
t[2][1].s *= 2; |
| 173 |
t[3][1].s *= 2; |
| 174 |
if ((e[1].t != 7 && e[1].t != 3) || (h[0].t != 7 && h[0].t != 3) |
| 175 |
|| (m[1].t != 7 && m[1].t != 3) || (p[0].t != 7 && p[0].t != 3)) |
| 176 |
abort (); |
| 177 |
for (T z = 0; z < 2; z++) |
| 178 |
if ((a[z].t != 7 && a[z].t != 3) || (c[z].t != 7 && c[z].t != 3) |
| 179 |
|| (d[z].t != 5 && d[z].t != 9) || (f[z + 2].t != 7 && f[z + 2].t != 3) |
| 180 |
|| (g[z + 1].t != 7 && g[z + 1].t != 3) || (r[z + 2].t != 7 && r[z + 2].t != 3) |
| 181 |
|| (s[z + 1].t != 5 && s[z + 1].t != 9) || (o[z + 1].t != 7 && o[z + 1].t != 3) |
| 182 |
|| (k[z + 1][0].t != 7 && k[z + 1][0].t != 3) || (k[z + 1][1].t != 7 && k[z + 1][1].t != 3) |
| 183 |
|| (q[z + 1][0].t != 7 && q[z + 1][0].t != 3) || (q[z + 1][1].t != 7 && q[z + 1][1].t != 3) |
| 184 |
|| (t[z + 2][0].t != 5 && t[z + 2][0].t != 9) || (t[z + 2][1].t != 5 && t[z + 2][1].t != 9)) |
| 185 |
abort (); |
| 186 |
for (T z = 0; z < 3; z++) |
| 187 |
if (b[z + 2].t != 5 && b[z + 2].t != 9) |
| 188 |
abort (); |
| 189 |
for (j = 0; j < 2; j++) |
| 190 |
#pragma omp task in_reduction (+: a, c[:2]) \ |
| 191 |
in_reduction (*: b[2 * n:3 * n], d[n - 1:n + 1]) \ |
| 192 |
in_reduction (+: e[1], f[2:2], g[n:n*2], h[0], k[1:2][:2]) \ |
| 193 |
in_reduction (+: m[1], r[2:2], o[n:n*2], p[0], q[1:2][:2]) \ |
| 194 |
in_reduction (*: s[n:2], t[2:2][:]) |
| 195 |
{ |
| 196 |
m[1].s += 6; |
| 197 |
r[2].s += 7; |
| 198 |
q[1][0].s += 17; |
| 199 |
q[2][0].s += 19; |
| 200 |
a[0].s += 4; |
| 201 |
a[1].s += 5; |
| 202 |
b[3].s *= 2; |
| 203 |
b[4].s *= 2; |
| 204 |
f[3].s += 18; |
| 205 |
g[1].s += 29; |
| 206 |
g[2].s += 18; |
| 207 |
h[0].s += 19; |
| 208 |
s[2].s *= 2; |
| 209 |
t[2][0].s *= 2; |
| 210 |
t[3][0].s *= 2; |
| 211 |
S *cp = c; |
| 212 |
S *dp = d; |
| 213 |
S *rp = r; |
| 214 |
S *pp = p; |
| 215 |
if ((e[1].t != 7 && e[1].t != 3) || (h[0].t != 7 && h[0].t != 3) |
| 216 |
|| (m[1].t != 7 && m[1].t != 3) || (p[0].t != 7 && p[0].t != 3)) |
| 217 |
abort (); |
| 218 |
for (T z = 0; z < 2; z++) |
| 219 |
if ((a[z].t != 7 && a[z].t != 3) || (c[z].t != 7 && c[z].t != 3) |
| 220 |
|| (d[z].t != 5 && d[z].t != 9) || (f[z + 2].t != 7 && f[z + 2].t != 3) |
| 221 |
|| (g[z + 1].t != 7 && g[z + 1].t != 3) || (r[z + 2].t != 7 && r[z + 2].t != 3) |
| 222 |
|| (s[z + 1].t != 5 && s[z + 1].t != 9) || (o[z + 1].t != 7 && o[z + 1].t != 3) |
| 223 |
|| (k[z + 1][0].t != 7 && k[z + 1][0].t != 3) || (k[z + 1][1].t != 7 && k[z + 1][1].t != 3) |
| 224 |
|| (q[z + 1][0].t != 7 && q[z + 1][0].t != 3) || (q[z + 1][1].t != 7 && q[z + 1][1].t != 3) |
| 225 |
|| (t[z + 2][0].t != 5 && t[z + 2][0].t != 9) || (t[z + 2][1].t != 5 && t[z + 2][1].t != 9)) |
| 226 |
abort (); |
| 227 |
for (T z = 0; z < 3; z++) |
| 228 |
if (b[z + 2].t != 5 && b[z + 2].t != 9) |
| 229 |
abort (); |
| 230 |
foo (n, cp, dp, m, rp, o, pp, q); |
| 231 |
r[3].s += 18; |
| 232 |
o[1].s += 29; |
| 233 |
o[2].s += 18; |
| 234 |
p[0].s += 19; |
| 235 |
c[0].s += 4; |
| 236 |
c[1].s += 5; |
| 237 |
d[0].s *= 2; |
| 238 |
e[1].s += 6; |
| 239 |
f[2].s += 7; |
| 240 |
k[1][0].s += 17; |
| 241 |
k[2][0].s += 19; |
| 242 |
} |
| 243 |
r[3].s += 8; |
| 244 |
o[1].s += 9; |
| 245 |
o[2].s += 10; |
| 246 |
p[0].s += 11; |
| 247 |
q[1][1].s += 13; |
| 248 |
q[2][1].s += 15; |
| 249 |
b[3].s *= 2; |
| 250 |
c[0].s += 4; |
| 251 |
c[1].s += 9; |
| 252 |
d[0].s *= 2; |
| 253 |
e[1].s += 16; |
| 254 |
f[2].s += 8; |
| 255 |
} |
| 256 |
if (a[0].s != 7 * 16 + 4 * 8 + 2 * 4 |
| 257 |
|| a[1].s != 17 * 16 + 5 * 8 + 3 * 4 |
| 258 |
|| b[0].s != 9 || b[1].s != 11 |
| 259 |
|| b[2].s != 1LL << (16 + 4) |
| 260 |
|| b[3].s != 1LL << (8 + 4) |
| 261 |
|| b[4].s != 1LL << (16 + 8) |
| 262 |
|| b[5].s != 13 || b[6].s != 15 |
| 263 |
|| c[0].s != 6 * 16 + 4 * 8 + 4 * 4 |
| 264 |
|| c[1].s != 5 * 8 + 9 * 4 |
| 265 |
|| e[0].s != 5 |
| 266 |
|| e[1].s != 19 * 16 + 6 * 8 + 16 * 4 |
| 267 |
|| e[2].s != 5 |
| 268 |
|| f[0].s != 6 |
| 269 |
|| f[1].s != 7 |
| 270 |
|| f[2].s != 21 * 16 + 7 * 8 + 8 * 4 |
| 271 |
|| f[3].s != 23 * 16 + 18 * 8 + 8 * 4 |
| 272 |
|| f[4].s != 9 |
| 273 |
|| g[0].s != 1 |
| 274 |
|| g[1].s != 25 * 16 + 29 * 8 + 9 * 4 |
| 275 |
|| g[2].s != 27 * 16 + 18 * 8 + 10 * 4 |
| 276 |
|| g[3].s != 2 |
| 277 |
|| h[0].s != 29 * 16 + 19 * 8 + 11 * 4 |
| 278 |
|| h[1].s != 1 || h[2].s != 4 |
| 279 |
|| k[0][0].s != 5 || k[0][1].s != 6 |
| 280 |
|| k[1][0].s != 31 * 16 + 17 * 8 |
| 281 |
|| k[1][1].s != 13 * 4 |
| 282 |
|| k[2][0].s != 19 * 8 |
| 283 |
|| k[2][1].s != 33 * 16 + 15 * 4 |
| 284 |
|| k[3][0].s != 7 || k[3][1].s != 8 |
| 285 |
|| p[0].s != 29 * 16 + 19 * 8 + 11 * 4 |
| 286 |
|| p[1].s != 1 || p[2].s != 4 |
| 287 |
|| q[0][0].s != 5 || q[0][1].s != 6 |
| 288 |
|| q[1][0].s != 31 * 16 + 17 * 8 |
| 289 |
|| q[1][1].s != 13 * 4 |
| 290 |
|| q[2][0].s != 19 * 8 |
| 291 |
|| q[2][1].s != 33 * 16 + 15 * 4 |
| 292 |
|| q[3][0].s != 7 || q[3][1].s != 8 |
| 293 |
|| sb[0].s != 5 |
| 294 |
|| sb[1].s != 1LL << (16 + 4) |
| 295 |
|| sb[2].s != 1LL << 8 |
| 296 |
|| sb[3].s != 6 |
| 297 |
|| tb[0][0].s != 9 || tb[0][1].s != 10 || tb[1][0].s != 11 || tb[1][1].s != 12 |
| 298 |
|| tb[2][0].s != 1LL << (16 + 8) |
| 299 |
|| tb[2][1].s != 1LL << 4 |
| 300 |
|| tb[3][0].s != 1LL << 8 |
| 301 |
|| tb[3][1].s != 1LL << (16 + 4) |
| 302 |
|| tb[4][0].s != 13 || tb[4][1].s != 14) |
| 303 |
abort (); |
| 304 |
if (d[0].s != 1LL << (8 + 4) |
| 305 |
|| d[1].s != 1LL << 16 |
| 306 |
|| m[0].s != 5 |
| 307 |
|| m[1].s != 19 * 16 + 6 * 8 + 16 * 4 |
| 308 |
|| m[2].s != 5 |
| 309 |
|| r[0].s != 6 |
| 310 |
|| r[1].s != 7 |
| 311 |
|| r[2].s != 21 * 16 + 7 * 8 + 8 * 4 |
| 312 |
|| r[3].s != 23 * 16 + 18 * 8 + 8 * 4 |
| 313 |
|| r[4].s != 9 |
| 314 |
|| o[0].s != 1 |
| 315 |
|| o[1].s != 25 * 16 + 29 * 8 + 9 * 4 |
| 316 |
|| o[2].s != 27 * 16 + 18 * 8 + 10 * 4 |
| 317 |
|| o[3].s != 2) |
| 318 |
abort (); |
| 319 |
if (e[1].t != 7 || h[0].t != 7 || m[1].t != 7 || p[0].t != 7) |
| 320 |
abort (); |
| 321 |
for (T z = 0; z < 2; z++) |
| 322 |
if (a[z].t != 7 || c[z].t != 7 || d[z].t != 5 || f[z + 2].t != 7 |
| 323 |
|| g[z + 1].t != 7 || r[z + 2].t != 7 || s[z + 1].t != 5 || o[z + 1].t != 7 |
| 324 |
|| k[z + 1][0].t != 7 || k[z + 1][1].t != 7 || q[z + 1][0].t != 7 || q[z + 1][1].t != 7 |
| 325 |
|| t[z + 2][0].t != 5 || t[z + 2][1].t != 5) |
| 326 |
abort (); |
| 327 |
for (T z = 0; z < 3; z++) |
| 328 |
if (b[z + 2].t != 5) |
| 329 |
abort (); |
| 330 |
} |
| 331 |
} |
| 332 |
} |
| 333 |
|
| 334 |
int |
| 335 |
main () |
| 336 |
{ |
| 337 |
int c1 = S::cnt1, c2 = S::cnt2, c3 = S::cnt3; |
| 338 |
int n = 1; |
| 339 |
test<S, int> (n); |
| 340 |
if (S::cnt1 + S::cnt2 - c1 - c2 != S::cnt3 - c3) |
| 341 |
abort (); |
| 342 |
return 0; |
| 343 |
} |