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