Debian Codegraph @

libgomp/testsuite/libgomp.c++/for-26.C

raw
1 // { dg-do run }
2 // { dg-additional-options "-std=c++17" }
3
4 typedef __PTRDIFF_TYPE__ ptrdiff_t;
5 extern "C" void abort ();
6
7 namespace std {
8 template<typename T> struct tuple_size;
9 template<int, typename> struct tuple_element;
10 }
11
12 template <typename T>
13 class I
14 {
15 public:
16 typedef ptrdiff_t difference_type;
17 I ();
18 ~I ();
19 I (T *);
20 I (const I &);
21 T &operator * ();
22 T *operator -> ();
23 T &operator [] (const difference_type &) const;
24 I &operator = (const I &);
25 I &operator ++ ();
26 I operator ++ (int);
27 I &operator -- ();
28 I operator -- (int);
29 I &operator += (const difference_type &);
30 I &operator -= (const difference_type &);
31 I operator + (const difference_type &) const;
32 I operator - (const difference_type &) const;
33 template <typename S> friend bool operator == (I<S> &, I<S> &);
34 template <typename S> friend bool operator == (const I<S> &, const I<S> &);
35 template <typename S> friend bool operator < (I<S> &, I<S> &);
36 template <typename S> friend bool operator < (const I<S> &, const I<S> &);
37 template <typename S> friend bool operator <= (I<S> &, I<S> &);
38 template <typename S> friend bool operator <= (const I<S> &, const I<S> &);
39 template <typename S> friend bool operator > (I<S> &, I<S> &);
40 template <typename S> friend bool operator > (const I<S> &, const I<S> &);
41 template <typename S> friend bool operator >= (I<S> &, I<S> &);
42 template <typename S> friend bool operator >= (const I<S> &, const I<S> &);
43 template <typename S> friend typename I<S>::difference_type operator - (I<S> &, I<S> &);
44 template <typename S> friend typename I<S>::difference_type operator - (const I<S> &, const I<S> &);
45 template <typename S> friend I<S> operator + (typename I<S>::difference_type , const I<S> &);
46 private:
47 T *p;
48 };
49 template <typename T> I<T>::I () : p (0) {}
50 template <typename T> I<T>::~I () {}
51 template <typename T> I<T>::I (T *x) : p (x) {}
52 template <typename T> I<T>::I (const I &x) : p (x.p) {}
53 template <typename T> T &I<T>::operator * () { return *p; }
54 template <typename T> T *I<T>::operator -> () { return p; }
55 template <typename T> T &I<T>::operator [] (const difference_type &x) const { return p[x]; }
56 template <typename T> I<T> &I<T>::operator = (const I &x) { p = x.p; return *this; }
57 template <typename T> I<T> &I<T>::operator ++ () { ++p; return *this; }
58 template <typename T> I<T> I<T>::operator ++ (int) { return I (p++); }
59 template <typename T> I<T> &I<T>::operator -- () { --p; return *this; }
60 template <typename T> I<T> I<T>::operator -- (int) { return I (p--); }
61 template <typename T> I<T> &I<T>::operator += (const difference_type &x) { p += x; return *this; }
62 template <typename T> I<T> &I<T>::operator -= (const difference_type &x) { p -= x; return *this; }
63 template <typename T> I<T> I<T>::operator + (const difference_type &x) const { return I (p + x); }
64 template <typename T> I<T> I<T>::operator - (const difference_type &x) const { return I (p - x); }
65 template <typename T> bool operator == (I<T> &x, I<T> &y) { return x.p == y.p; }
66 template <typename T> bool operator == (const I<T> &x, const I<T> &y) { return x.p == y.p; }
67 template <typename T> bool operator != (I<T> &x, I<T> &y) { return !(x == y); }
68 template <typename T> bool operator != (const I<T> &x, const I<T> &y) { return !(x == y); }
69 template <typename T> bool operator < (I<T> &x, I<T> &y) { return x.p < y.p; }
70 template <typename T> bool operator < (const I<T> &x, const I<T> &y) { return x.p < y.p; }
71 template <typename T> bool operator <= (I<T> &x, I<T> &y) { return x.p <= y.p; }
72 template <typename T> bool operator <= (const I<T> &x, const I<T> &y) { return x.p <= y.p; }
73 template <typename T> bool operator > (I<T> &x, I<T> &y) { return x.p > y.p; }
74 template <typename T> bool operator > (const I<T> &x, const I<T> &y) { return x.p > y.p; }
75 template <typename T> bool operator >= (I<T> &x, I<T> &y) { return x.p >= y.p; }
76 template <typename T> bool operator >= (const I<T> &x, const I<T> &y) { return x.p >= y.p; }
77 template <typename T> typename I<T>::difference_type operator - (I<T> &x, I<T> &y) { return x.p - y.p; }
78 template <typename T> typename I<T>::difference_type operator - (const I<T> &x, const I<T> &y) { return x.p - y.p; }
79 template <typename T> I<T> operator + (typename I<T>::difference_type x, const I<T> &y) { return I<T> (x + y.p); }
80
81 template <typename T>
82 class J
83 {
84 public:
85 J(const I<T> &x, const I<T> &y) : b (x), e (y) {}
86 const I<T> &begin ();
87 const I<T> &end ();
88 private:
89 I<T> b, e;
90 };
91
92 template <typename T> const I<T> &J<T>::begin () { return b; }
93 template <typename T> const I<T> &J<T>::end () { return e; }
94
95 struct K
96 {
97 template <int N> int &get () { if (N == 0) return c; else if (N == 1) return b; return a; }
98 int a, b, c;
99 };
100
101 template <> struct std::tuple_size<K> { static constexpr int value = 3; };
102 template <int N> struct std::tuple_element<N, K> { using type = int; };
103
104 struct L
105 {
106 int a, b, c;
107 };
108
109 int a[2000];
110 long b[40];
111 short c[50];
112 int d[1024];
113 K e[1089];
114 L f[1093];
115
116 int results[2000];
117
118 template <typename T>
119 void
120 baz (I<T> &i)
121 {
122 if (*i < 0 || *i >= 2000)
123 abort ();
124 results[*i]++;
125 }
126
127 void
128 baz (int i)
129 {
130 if (i < 0 || i >= 2000)
131 abort ();
132 results[i]++;
133 }
134
135 void
136 f1 ()
137 {
138 #pragma omp distribute parallel for default(none) shared(a)
139 for (auto i : a)
140 baz (i);
141 }
142
143 void
144 f2 ()
145 {
146 #pragma omp distribute parallel for default(none) shared(a)
147 for (auto &i : a)
148 if (&i != &a[i])
149 abort ();
150 else
151 baz (i);
152 }
153
154 void
155 f3 ()
156 {
157 #pragma omp distribute parallel for collapse(3) default(none) shared(b, c)
158 for (auto &i : b)
159 for (int j = 9; j < 10; j++)
160 for (auto k : c)
161 if (&i != &b[i] || i < 0 || i >= 40 || j != 9 || k < 0 || k >= 50)
162 abort ();
163 else
164 baz (i * 50 + k);
165 }
166
167 void
168 f4 (J<int> j)
169 {
170 #pragma omp distribute parallel for default(none) shared(j, a)
171 for (auto &i : j)
172 if (&i != &a[i])
173 abort ();
174 else
175 baz (i);
176 }
177
178 void
179 f5 ()
180 {
181 #pragma omp distribute parallel for simd default(none) shared(d, results)
182 for (auto i : d)
183 results[i % 1024] += 2 * ((unsigned) i >> 10) + 1;
184 }
185
186 void
187 f6 (J<K> j)
188 {
189 #pragma omp distribute parallel for default(none) shared(j, e)
190 for (auto & [k, l, m] : j)
191 if (&k != &e[m].c || &l != &e[m].b || &m != &e[m].a || k != m * 3 || l != m * 2)
192 abort ();
193 else
194 baz (m);
195 }
196
197 void
198 f7 (J<L> j)
199 {
200 #pragma omp distribute parallel for default(none) shared(j, f)
201 for (auto & [k, l, m] : j)
202 if (&k != &f[k].a || &l != &f[k].b || &m != &f[k].c || l != k * 4 || m != k * 5)
203 abort ();
204 else
205 baz (k);
206 }
207
208 void
209 f8 (J<K> j)
210 {
211 #pragma omp distribute parallel for default(none) shared(j)
212 for (auto [k, l, m] : j)
213 if (k != m * 3 || l != m * 2)
214 abort ();
215 else
216 baz (m);
217 }
218
219 void
220 f9 (J<L> j)
221 {
222 #pragma omp distribute parallel for default(none) shared(j)
223 for (auto [k, l, m] : j)
224 if (l != k * 4 || m != k * 5)
225 abort ();
226 else
227 baz (k);
228 }
229
230 template <int N>
231 void
232 f10 ()
233 {
234 #pragma omp distribute parallel for default(none) shared(a)
235 for (auto i : a)
236 baz (i);
237 }
238
239 template <int N>
240 void
241 f11 ()
242 {
243 #pragma omp distribute parallel for default(none) shared(a)
244 for (auto &i : a)
245 if (&i != &a[i])
246 abort ();
247 else
248 baz (i);
249 }
250
251 template <int N>
252 void
253 f12 ()
254 {
255 #pragma omp distribute parallel for collapse(3) default(none) shared(a, b, c)
256 for (auto &i : b)
257 for (I<int> j = I<int> (&a[9]); j < I<int> (&a[10]); j++)
258 for (auto k : c)
259 if (&i != &b[i] || i < 0 || i >= 40 || *j != 9 || k < 0 || k >= 50)
260 abort ();
261 else
262 baz (i * 50 + k);
263 }
264
265 template <typename T>
266 void
267 f13 (J<T> j)
268 {
269 #pragma omp distribute parallel for default(none) shared(j, a)
270 for (auto &i : j)
271 if (&i != &a[i])
272 abort ();
273 else
274 baz (i);
275 }
276
277 template <int N>
278 void
279 f14 ()
280 {
281 #pragma omp distribute parallel for simd default(none) shared(d, results)
282 for (auto i : d)
283 results[i % N] += 2 * ((unsigned) i >> 10) + 1;
284 }
285
286 template <typename T>
287 void
288 f15 (J<T> j)
289 {
290 #pragma omp distribute parallel for default(none) shared(j, e)
291 for (auto & [k, l, m] : j)
292 if (&k != &e[m].c || &l != &e[m].b || &m != &e[m].a || k != m * 3 || l != m * 2)
293 abort ();
294 else
295 baz (m);
296 }
297
298 template <typename T>
299 void
300 f16 (J<T> j)
301 {
302 #pragma omp distribute parallel for default(none) shared(j, f)
303 for (auto & [k, l, m] : j)
304 if (&k != &f[k].a || &l != &f[k].b || &m != &f[k].c || l != k * 4 || m != k * 5)
305 abort ();
306 else
307 baz (k);
308 }
309
310 template <int N>
311 void
312 f17 (J<K> j)
313 {
314 #pragma omp distribute parallel for default(none) shared(j)
315 for (auto [k, l, m] : j)
316 if (k != m * 3 || l != m * 2)
317 abort ();
318 else
319 baz (m);
320 }
321
322 template <int N>
323 void
324 f18 (J<L> j)
325 {
326 #pragma omp distribute parallel for default(none) shared(j)
327 for (auto [k, l, m] : j)
328 if (l != k * 4 || m != k * 5)
329 abort ();
330 else
331 baz (k);
332 }
333
334 #define check(expr) \
335 for (int i = 0; i < 2000; i++) \
336 if (expr) \
337 { \
338 if (results[i] != 1) \
339 abort (); \
340 results[i] = 0; \
341 } \
342 else if (results[i]) \
343 abort ()
344
345 int
346 main ()
347 {
348 for (int i = 0; i < 2000; i++)
349 a[i] = i;
350 for (int i = 0; i < 40; i++)
351 b[i] = i;
352 for (int i = 0; i < 50; i++)
353 c[i] = i;
354 for (int i = 0; i < 1024; i++)
355 d[i] = i;
356 for (int i = 0; i < 1089; i++)
357 {
358 e[i].a = i;
359 e[i].b = 2 * i;
360 e[i].c = 3 * i;
361 }
362 for (int i = 0; i < 1093; i++)
363 {
364 f[i].a = i;
365 f[i].b = 4 * i;
366 f[i].c = 5 * i;
367 }
368 #pragma omp teams
369 f1 ();
370 check (1);
371 #pragma omp teams
372 f2 ();
373 check (1);
374 #pragma omp teams
375 f3 ();
376 check (1);
377 #pragma omp teams
378 f4 (J<int> (&a[14], &a[1803]));
379 check (i >= 14 && i < 1803);
380 #pragma omp teams
381 f5 ();
382 check (i >= 0 && i < 1024);
383 #pragma omp teams
384 f6 (J<K> (&e[19], &e[1029]));
385 check (i >= 19 && i < 1029);
386 #pragma omp teams
387 f7 (J<L> (&f[15], &f[1091]));
388 check (i >= 15 && i < 1091);
389 #pragma omp teams
390 f8 (J<K> (&e[27], &e[1037]));
391 check (i >= 27 && i < 1037);
392 #pragma omp teams
393 f9 (J<L> (&f[1], &f[1012]));
394 check (i >= 1 && i < 1012);
395 #pragma omp teams
396 f10 <0> ();
397 check (1);
398 #pragma omp teams
399 f11 <1> ();
400 check (1);
401 #pragma omp teams
402 f12 <2> ();
403 check (1);
404 #pragma omp teams
405 f13 (J<int> (&a[24], &a[1703]));
406 check (i >= 24 && i < 1703);
407 #pragma omp teams
408 f14 <1024> ();
409 check (i >= 0 && i < 1024);
410 #pragma omp teams
411 f15 (J<K> (&e[39], &e[929]));
412 check (i >= 39 && i < 929);
413 #pragma omp teams
414 f16 (J<L> (&f[17], &f[1071]));
415 check (i >= 17 && i < 1071);
416 #pragma omp teams
417 f17 <3> (J<K> (&e[7], &e[1017]));
418 check (i >= 7 && i < 1017);
419 #pragma omp teams
420 f18 <5> (J<L> (&f[121], &f[1010]));
421 check (i >= 121 && i < 1010);
422 }