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