Debian Codegraph @

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

raw
1 // { dg-do run }
2
3 typedef __PTRDIFF_TYPE__ ptrdiff_t;
4 extern "C" void abort ();
5
6 template <typename T>
7 class I
8 {
9 public:
10 typedef ptrdiff_t difference_type;
11 I ();
12 ~I ();
13 I (T *);
14 I (const I &);
15 T &operator * ();
16 T *operator -> ();
17 T &operator [] (const difference_type &) const;
18 I &operator = (const I &);
19 I &operator ++ ();
20 I operator ++ (int);
21 I &operator -- ();
22 I operator -- (int);
23 I &operator += (const difference_type &);
24 I &operator -= (const difference_type &);
25 I operator + (const difference_type &) const;
26 I operator - (const difference_type &) const;
27 template <typename S> friend bool operator == (I<S> &, I<S> &);
28 template <typename S> friend bool operator == (const I<S> &, const I<S> &);
29 template <typename S> friend bool operator < (I<S> &, I<S> &);
30 template <typename S> friend bool operator < (const I<S> &, const I<S> &);
31 template <typename S> friend bool operator <= (I<S> &, I<S> &);
32 template <typename S> friend bool operator <= (const I<S> &, const I<S> &);
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 typename I<S>::difference_type operator - (I<S> &, I<S> &);
38 template <typename S> friend typename I<S>::difference_type operator - (const I<S> &, const I<S> &);
39 template <typename S> friend I<S> operator + (typename I<S>::difference_type , const I<S> &);
40 private:
41 T *p;
42 };
43 template <typename T> I<T>::I () : p (0) {}
44 template <typename T> I<T>::~I () { p = (T *) 0; }
45 template <typename T> I<T>::I (T *x) : p (x) {}
46 template <typename T> I<T>::I (const I &x) : p (x.p) {}
47 template <typename T> T &I<T>::operator * () { return *p; }
48 template <typename T> T *I<T>::operator -> () { return p; }
49 template <typename T> T &I<T>::operator [] (const difference_type &x) const { return p[x]; }
50 template <typename T> I<T> &I<T>::operator = (const I &x) { p = x.p; return *this; }
51 template <typename T> I<T> &I<T>::operator ++ () { ++p; return *this; }
52 template <typename T> I<T> I<T>::operator ++ (int) { return I (p++); }
53 template <typename T> I<T> &I<T>::operator -- () { --p; return *this; }
54 template <typename T> I<T> I<T>::operator -- (int) { return I (p--); }
55 template <typename T> I<T> &I<T>::operator += (const difference_type &x) { p += x; return *this; }
56 template <typename T> I<T> &I<T>::operator -= (const difference_type &x) { p -= x; return *this; }
57 template <typename T> I<T> I<T>::operator + (const difference_type &x) const { return I (p + x); }
58 template <typename T> I<T> I<T>::operator - (const difference_type &x) const { return I (p - x); }
59 template <typename T> bool operator == (I<T> &x, I<T> &y) { return x.p == y.p; }
60 template <typename T> bool operator == (const I<T> &x, const I<T> &y) { return x.p == y.p; }
61 template <typename T> bool operator != (I<T> &x, I<T> &y) { return !(x == y); }
62 template <typename T> bool operator != (const I<T> &x, const I<T> &y) { return !(x == y); }
63 template <typename T> bool operator < (I<T> &x, I<T> &y) { return x.p < y.p; }
64 template <typename T> bool operator < (const I<T> &x, const I<T> &y) { return x.p < y.p; }
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.p > y.p; }
68 template <typename T> bool operator > (const I<T> &x, const I<T> &y) { return x.p > y.p; }
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> typename I<T>::difference_type operator - (I<T> &x, I<T> &y) { return x.p - y.p; }
72 template <typename T> typename I<T>::difference_type operator - (const I<T> &x, const I<T> &y) { return x.p - y.p; }
73 template <typename T> I<T> operator + (typename I<T>::difference_type x, const I<T> &y) { return I<T> (x + y.p); }
74
75 template <typename T>
76 class J
77 {
78 public:
79 J(const I<T> &x, const I<T> &y) : b (x), e (y) {}
80 const I<T> &begin ();
81 const I<T> &end ();
82 private:
83 I<T> b, e;
84 };
85
86 template <typename T> const I<T> &J<T>::begin () { return b; }
87 template <typename T> const I<T> &J<T>::end () { return e; }
88
89 int results[2000];
90
91 template <typename T>
92 void
93 baz (I<T> &i)
94 {
95 if (*i < 0 || *i >= 2000)
96 abort ();
97 results[*i]++;
98 }
99
100 I<int>
101 f1 (const I<int> &x, const I<int> &y)
102 {
103 I<int> i;
104 #pragma omp parallel shared(i)
105 {
106 #pragma omp for lastprivate (i) schedule(runtime)
107 for (i = x; i != y; i++)
108 baz (i);
109 #pragma omp single
110 i += 3;
111 }
112 return I<int> (i);
113 }
114
115 I<int>
116 f2 (const I<int> &x, const I<int> &y)
117 {
118 I<int> i;
119 #pragma omp parallel for lastprivate(i)
120 for (i = x; i != y - 1; i = 2 - 8 + 7 + i)
121 baz (i);
122 return I<int> (i);
123 }
124
125 template <typename T>
126 I<int>
127 f3 (const I<int> &x, const I<int> &y)
128 {
129 I<int> i;
130 #pragma omp parallel
131 #pragma omp for lastprivate (i)
132 for (i = x; i != y; i = i + 9 - 8)
133 baz (i);
134 return i;
135 }
136
137 template <typename T>
138 I<int>
139 f4 (const I<int> &x, const I<int> &y)
140 {
141 I<int> i;
142 #pragma omp parallel for lastprivate(i)
143 for (i = x + 2000 - 64; i != y + 10; --i)
144 baz (i);
145 return I<int> (i);
146 }
147
148 template <typename T>
149 I<int>
150 f5 (const I<int> &x, const I<int> &y)
151 {
152 I<int> i;
153 #pragma omp parallel for lastprivate(i)
154 for (i = x + 2000 - 64; i != y + T (10); i--)
155 baz (i);
156 return i;
157 }
158
159 template <typename T>
160 I<int>
161 f6 (const I<int> &x, const I<int> &y)
162 {
163 I<int> i;
164 #pragma omp parallel for lastprivate (i)
165 for (i = x + 2000 - 64; i != y + 10; i = i - T (12) + T (11))
166 {
167 I<int> j = i + -10;
168 baz (j);
169 }
170 return I<int> (i);
171 }
172
173 template <int N>
174 I<int>
175 f7 (I<int> i, const I<int> &x, const I<int> &y)
176 {
177 #pragma omp parallel for lastprivate(i)
178 for (i = x - 10; i != y + 10; i += N)
179 baz (i);
180 return I<int> (i);
181 }
182
183 template <int N>
184 I<int>
185 f8 (J<int> j)
186 {
187 I<int> i;
188 #pragma omp parallel shared \
189 (i)
190 #pragma omp for lastprivate (i)
191 for (i = j.begin (); i != j.end () + N; i += 1)
192 baz (i);
193 return i;
194 }
195
196 I<int> i9;
197
198 template <long N>
199 I<int> &
200 f9 (J<int> j)
201 {
202 #pragma omp parallel for lastprivate(i9)
203 for (i9 = j.begin (); i9 != j.end () - N; i9 = i9 - N)
204 baz (i9);
205 return i9;
206 }
207
208 template <typename T, int N>
209 I<T>
210 f10 (const I<T> &x, const I<T> &y)
211 {
212 I<T> i;
213 #pragma omp parallel for lastprivate (i)
214 for (i = x; i != y; i = i + N)
215 baz (i);
216 return i;
217 }
218
219 template <typename T, typename U>
220 T
221 f11 (T i, const T &x, const T &y)
222 {
223 #pragma omp parallel
224 {
225 #pragma omp for lastprivate (i)
226 for (i = x + U (0); i != y + U (2 - 2); i = U(3) + U(-2) + i)
227 baz (i);
228 #pragma omp single
229 {
230 T j = y + 3;
231 baz (j);
232 }
233 }
234 return i;
235 }
236
237 template <typename T>
238 T
239 f12 (const T &x, const T &y)
240 {
241 T i;
242 #pragma omp parallel for lastprivate (i)
243 for (i = x; i != y; --i)
244 baz (i);
245 return i;
246 }
247
248 #define check(expr) \
249 for (int i = 0; i < 2000; i++) \
250 if (expr) \
251 { \
252 if (results[i] != 1) \
253 abort (); \
254 results[i] = 0; \
255 } \
256 else if (results[i]) \
257 abort ()
258
259 int
260 main ()
261 {
262 int a[2000];
263 long b[2000];
264 for (int i = 0; i < 2000; i++)
265 {
266 a[i] = i;
267 b[i] = i;
268 }
269 if (*f1 (&a[10], &a[1990]) != 1993)
270 abort ();
271 check (i >= 10 && i < 1990);
272 if (*f2 (&a[0], &a[1999]) != 1998)
273 abort ();
274 check (i < 1998);
275 if (*f3<char> (&a[20], &a[1837]) != 1837)
276 abort ();
277 check (i >= 20 && i < 1837);
278 if (*f4<int> (&a[0], &a[30]) != 40)
279 abort ();
280 check (i > 40 && i <= 2000 - 64);
281 if (*f5<int> (&a[0], &a[100]) != 110)
282 abort ();
283 check (i > 110 && i <= 2000 - 64);
284 if (*f6<int> (&a[10], &a[110]) != 120)
285 abort ();
286 check (i > 110 && i <= 2000 - 64);
287 if (*f7<1> (I<int> (), &a[12], &a[1800]) != 1810)
288 abort ();
289 check (i >= 2 && i < 1810);
290 if (*f8<121> (J<int> (&a[14], &a[1803])) != 1924)
291 abort ();
292 check (i >= 14 && i < 1924);
293 if (*f9<-1> (J<int> (&a[33], &a[1967])) != 1968)
294 abort ();
295 check (i >= 33 && i <= 1967);
296 if (*f10<int, -1> (&a[1939], &a[17]) != 17)
297 abort ();
298 check (i > 17 && i <= 1939);
299 if (*f11<I<int>, int> (I<int> (), &a[16], &a[1981]) != 1981)
300 abort ();
301 check ((i >= 16 && i < 1981) || i == 1984);
302 if (*f12<I<int> > (&a[1761], &a[37]) != 37)
303 abort ();
304 check (i > 37 && i <= 1761);
305 if (*f10<long, -1> (&b[1939], &b[17]) != 17)
306 abort ();
307 check (i > 17 && i <= 1939);
308 if (*f11<I<long>, long> (I<long> (), &b[16], &b[1981]) != 1981)
309 abort ();
310 check ((i >= 16 && i < 1981) || i == 1984);
311 if (*f12<I<long> > (&b[1761], &b[37]) != 37)
312 abort ();
313 check (i > 37 && i <= 1761);
314 }