Debian Codegraph @

libgomp/testsuite/libgomp.c++/loop-14.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 static inline void
93 baz (I<T> &i)
94 {
95 results[*i]++;
96 }
97
98 I<int>
99 f1 (const I<int> &x, const I<int> &y)
100 {
101 I<int> i;
102 #pragma omp parallel shared (i)
103 {
104 #pragma omp loop lastprivate (i) order(concurrent)
105 for (i = x; i < y - 1; ++i)
106 baz (i);
107 #pragma omp single
108 i += 3;
109 }
110 return I<int> (i);
111 }
112
113 I<int>
114 f2 (const I<int> &x, const I<int> &y)
115 {
116 I<int> i;
117 #pragma omp parallel loop bind(parallel)
118 for (i = x; i < y - 1; i = 1 - 6 + 7 + i)
119 baz (i);
120 return I<int> (i);
121 }
122
123 template <typename T>
124 I<int>
125 f3 (const I<int> &x, const I<int> &y)
126 {
127 I<int> i;
128 #pragma omp teams
129 #pragma omp loop order(concurrent)
130 for (i = x + 1000 - 64; i <= y - 10; i++)
131 baz (i);
132 return i;
133 }
134
135 template <typename T>
136 I<int>
137 f4 (const I<int> &x, const I<int> &y)
138 {
139 I<int> i;
140 #pragma omp teams loop lastprivate (i)
141 for (i = x + 2000 - 64; i > y + 10; --i)
142 baz (i);
143 return I<int> (i);
144 }
145
146 template <typename T>
147 I<int>
148 f5 (const I<int> &x, const I<int> &y)
149 {
150 I<int> i;
151 #pragma omp loop lastprivate (i) bind(thread)
152 for (i = x; i > y + T (6); i--)
153 baz (i);
154 return i;
155 }
156
157 template <typename T>
158 I<int>
159 f6 (const I<int> &x, const I<int> &y)
160 {
161 I<int> i;
162 #pragma omp loop bind(thread)
163 for (i = x - T (7); i > y; i -= T (2))
164 baz (i);
165 return I<int> (i);
166 }
167
168 template <int N>
169 I<int>
170 f7 (I<int> i, const I<int> &x, const I<int> &y)
171 {
172 #pragma omp parallel for lastprivate (i)
173 for (i = x - 10; i <= y + 10; i += N)
174 baz (i);
175 return I<int> (i);
176 }
177
178 template <int N>
179 I<int>
180 f8 (J<int> j)
181 {
182 I<int> i;
183 #pragma omp parallel shared (i)
184 #pragma omp loop lastprivate (i)
185 for (i = j.begin (); i <= j.end () + N; i += 2)
186 baz (i);
187 return i;
188 }
189
190 I<int> i9;
191
192 template <long N>
193 I<int> &
194 f9 (J<int> j)
195 {
196 #pragma omp loop bind(parallel)
197 for (i9 = j.begin () + N; i9 <= j.end () - N; i9 = i9 - N)
198 baz (i9);
199 return i9;
200 }
201
202 template <typename T, int N>
203 I<T>
204 f10 (const I<T> &x, const I<T> &y)
205 {
206 I<T> i;
207 #pragma omp parallel loop lastprivate (i)
208 for (i = x; i > y; i = i + N)
209 baz (i);
210 return i;
211 }
212
213 template <typename T, typename U>
214 T
215 f11 (T i, const T &x, const T &y)
216 {
217 #pragma omp loop bind(thread)
218 for (i = x + U (2); i <= y + U (1); i = U (2) + U (3) + i)
219 baz (i);
220 return T (i);
221 }
222
223 template <typename T>
224 T
225 f12 (const T &x, const T &y)
226 {
227 T i;
228 #pragma omp teams loop
229 for (i = x; i > y; --i)
230 baz (i);
231 return i;
232 }
233
234 #define check(expr) \
235 for (int i = 0; i < 2000; i++) \
236 if (expr) \
237 { \
238 if (results[i] != 1) \
239 abort (); \
240 results[i] = 0; \
241 } \
242 else if (results[i]) \
243 abort ()
244
245 int
246 main ()
247 {
248 int a[2000];
249 long b[2000];
250 for (int i = 0; i < 2000; i++)
251 {
252 a[i] = i;
253 b[i] = i;
254 }
255 if (*f1 (&a[10], &a[1873]) != 1875)
256 abort ();
257 check (i >= 10 && i < 1872);
258 if (*f2 (&a[0], &a[1998]) != 1998)
259 abort ();
260 check (i < 1997 && (i & 1) == 0);
261 if (*f3<int> (&a[10], &a[1971]) != 1962)
262 abort ();
263 check (i >= 946 && i <= 1961);
264 if (*f4<int> (&a[0], &a[30]) != 40)
265 abort ();
266 check (i > 40 && i <= 2000 - 64);
267 if (*f5<short> (&a[1931], &a[17]) != 23)
268 abort ();
269 check (i > 23 && i <= 1931);
270 if (*f6<long> (&a[1931], &a[17]) != 16)
271 abort ();
272 check (i > 17 && i <= 1924 && (i & 1) == 0);
273 if (*f7<6> (I<int> (), &a[12], &a[1800]) != 1814)
274 abort ();
275 check (i >= 2 && i <= 1808 && (i - 2) % 6 == 0);
276 if (*f8<121> (J<int> (&a[14], &a[1803])) != 1926)
277 abort ();
278 check (i >= 14 && i <= 1924 && (i & 1) == 0);
279 #pragma omp parallel
280 if (*f9<-3L> (J<int> (&a[27], &a[1761])) != 1767)
281 abort ();
282 check (i >= 24 && i <= 1764 && (i % 3) == 0);
283 if (*f10<int, -7> (&a[1939], &a[17]) != 14)
284 abort ();
285 check (i >= 21 && i <= 1939 && i % 7 == 0);
286 if (*f11<I<int>, short> (I<int> (), &a[71], &a[1941]) != 1943)
287 abort ();
288 check (i >= 73 && i <= 1938 && (i - 73) % 5 == 0);
289 if (*f12<I<int> > (&a[1761], &a[37]) != 37)
290 abort ();
291 check (i > 37 && i <= 1761);
292 if (*f10<long, -7> (&b[1939], &b[17]) != 14)
293 abort ();
294 check (i >= 21 && i <= 1939 && i % 7 == 0);
295 if (*f11<I<long>, short> (I<long> (), &b[71], &b[1941]) != 1943)
296 abort ();
297 check (i >= 73 && i <= 1938 && (i - 73) % 5 == 0);
298 if (*f12<I<long> > (&b[1761], &b[37]) != 37)
299 abort ();
300 check (i > 37 && i <= 1761);
301 }