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