Debian Codegraph @

libgomp/testsuite/libgomp.c++/task-reduction-17.C

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