Debian Codegraph @

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