| 1 |
// { dg-do run } |
| 2 |
|
| 3 |
typedef __PTRDIFF_TYPE__ ptrdiff_t; |
| 4 |
extern "C" void abort (); |
| 5 |
|
| 6 |
int a[2000]; |
| 7 |
|
| 8 |
template <typename T> |
| 9 |
class I |
| 10 |
{ |
| 11 |
public: |
| 12 |
typedef ptrdiff_t difference_type; |
| 13 |
I (); |
| 14 |
~I (); |
| 15 |
I (T *); |
| 16 |
I (const I &); |
| 17 |
T &operator * (); |
| 18 |
T *operator -> (); |
| 19 |
T &operator [] (const difference_type &) const; |
| 20 |
I &operator = (const I &); |
| 21 |
I &operator ++ (); |
| 22 |
I operator ++ (int); |
| 23 |
I &operator -- (); |
| 24 |
I operator -- (int); |
| 25 |
I &operator += (const difference_type &); |
| 26 |
I &operator -= (const difference_type &); |
| 27 |
I operator + (const difference_type &) const; |
| 28 |
I operator - (const difference_type &) const; |
| 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 bool operator >= (I<S> &, I<S> &); |
| 38 |
template <typename S> friend bool operator >= (const I<S> &, const I<S> &); |
| 39 |
template <typename S> friend typename I<S>::difference_type operator - (I<S> &, I<S> &); |
| 40 |
template <typename S> friend typename I<S>::difference_type operator - (const I<S> &, const I<S> &); |
| 41 |
template <typename S> friend I<S> operator + (typename I<S>::difference_type , const I<S> &); |
| 42 |
private: |
| 43 |
T *p; |
| 44 |
}; |
| 45 |
template <typename T> I<T>::I () : p (0) {} |
| 46 |
template <typename T> I<T>::~I () {} |
| 47 |
template <typename T> I<T>::I (T *x) : p (x) {} |
| 48 |
template <typename T> I<T>::I (const I &x) : p (x.p) {} |
| 49 |
template <typename T> T &I<T>::operator * () { return *p; } |
| 50 |
template <typename T> T *I<T>::operator -> () { return p; } |
| 51 |
template <typename T> T &I<T>::operator [] (const difference_type &x) const { return p[x]; } |
| 52 |
template <typename T> I<T> &I<T>::operator = (const I &x) { p = x.p; return *this; } |
| 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 -- () { --p; return *this; } |
| 56 |
template <typename T> I<T> I<T>::operator -- (int) { return I (p--); } |
| 57 |
template <typename T> I<T> &I<T>::operator += (const difference_type &x) { p += x; return *this; } |
| 58 |
template <typename T> I<T> &I<T>::operator -= (const difference_type &x) { p -= x; return *this; } |
| 59 |
template <typename T> I<T> I<T>::operator + (const difference_type &x) const { return I (p + x); } |
| 60 |
template <typename T> I<T> I<T>::operator - (const difference_type &x) const { return I (p - x); } |
| 61 |
template <typename T> bool operator == (I<T> &x, I<T> &y) { return x.p == y.p; } |
| 62 |
template <typename T> bool operator == (const I<T> &x, const I<T> &y) { return x.p == y.p; } |
| 63 |
template <typename T> bool operator != (I<T> &x, I<T> &y) { return !(x == y); } |
| 64 |
template <typename T> bool operator != (const I<T> &x, const I<T> &y) { return !(x == y); } |
| 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> 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> typename I<T>::difference_type operator - (I<T> &x, I<T> &y) { return x.p - y.p; } |
| 74 |
template <typename T> typename I<T>::difference_type operator - (const I<T> &x, const I<T> &y) { return x.p - y.p; } |
| 75 |
template <typename T> I<T> operator + (typename I<T>::difference_type x, const I<T> &y) { return I<T> (x + y.p); } |
| 76 |
|
| 77 |
template <typename T> |
| 78 |
class J |
| 79 |
{ |
| 80 |
public: |
| 81 |
J(const I<T> &x, const I<T> &y) : b (x), e (y) {} |
| 82 |
const I<T> &begin (); |
| 83 |
const I<T> &end (); |
| 84 |
private: |
| 85 |
I<T> b, e; |
| 86 |
}; |
| 87 |
|
| 88 |
template <typename T> const I<T> &J<T>::begin () { return b; } |
| 89 |
template <typename T> const I<T> &J<T>::end () { return e; } |
| 90 |
|
| 91 |
int results[2000]; |
| 92 |
|
| 93 |
template <typename T> |
| 94 |
void |
| 95 |
baz (I<T> &i) |
| 96 |
{ |
| 97 |
if (*i < 0 || *i >= 2000) |
| 98 |
abort (); |
| 99 |
results[*i]++; |
| 100 |
} |
| 101 |
|
| 102 |
static inline void |
| 103 |
baz (int i) |
| 104 |
{ |
| 105 |
results[i]++; |
| 106 |
} |
| 107 |
|
| 108 |
void |
| 109 |
f1 () |
| 110 |
{ |
| 111 |
#pragma omp simd |
| 112 |
for (auto i : a) |
| 113 |
baz (i); |
| 114 |
} |
| 115 |
|
| 116 |
void |
| 117 |
f2 (const I<int> &x, const I<int> &y) |
| 118 |
{ |
| 119 |
I<int> i; |
| 120 |
#pragma omp distribute parallel for |
| 121 |
for (i = x; i <= y; i += 6) |
| 122 |
baz (*i); |
| 123 |
} |
| 124 |
|
| 125 |
void |
| 126 |
f3 (const I<int> &x, const I<int> &y) |
| 127 |
{ |
| 128 |
I<int> i; |
| 129 |
#pragma omp distribute parallel for private (i) |
| 130 |
for (i = x; i < y - 1; i = 1 - 6 + 7 + i) |
| 131 |
baz (*i); |
| 132 |
} |
| 133 |
|
| 134 |
void |
| 135 |
f4 (const I<int> &x, const I<int> &y) |
| 136 |
{ |
| 137 |
I<int> i; |
| 138 |
#pragma omp teams distribute parallel for lastprivate (i) |
| 139 |
for (i = x + 2000 - 64; i > y + 10; --i) |
| 140 |
baz (*i); |
| 141 |
} |
| 142 |
|
| 143 |
#define check(expr) \ |
| 144 |
for (int i = 0; i < 2000; i++) \ |
| 145 |
if (expr) \ |
| 146 |
{ \ |
| 147 |
if (results[i] != 1) \ |
| 148 |
abort (); \ |
| 149 |
results[i] = 0; \ |
| 150 |
} \ |
| 151 |
else if (results[i]) \ |
| 152 |
abort () |
| 153 |
|
| 154 |
int |
| 155 |
main () |
| 156 |
{ |
| 157 |
for (int i = 0; i < 2000; i++) |
| 158 |
a[i] = i; |
| 159 |
f1 (); |
| 160 |
check (1); |
| 161 |
#pragma omp teams |
| 162 |
f2 (&a[10], &a[1990]); |
| 163 |
check (i >= 10 && i <= 1990 && (i - 10) % 6 == 0); |
| 164 |
#pragma omp teams |
| 165 |
f3 (&a[0], &a[1999]); |
| 166 |
check (i < 1998 && (i & 1) == 0); |
| 167 |
f4 (&a[0], &a[30]); |
| 168 |
check (i > 40 && i <= 2000 - 64); |
| 169 |
} |