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