libgomp/testsuite/libgomp.c++/doacross-1.C

   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 int results[2048];
  76
  77 template <typename T>
  78 void
  79 baz (I<T> &i, I<T> &j, I<T> &k, T &l)
  80 {
  81   if (*i < 0 || *i >= 16)
  82     abort ();
  83   if (*j < 0 || *j >= 16)
  84     abort ();
  85   if (*k < 0 || *k >= 16)
  86     abort ();
  87   if (l < 0 || l >= 16)
  88     abort ();
  89   #pragma omp atomic
  90     results[512 * *i + 64 * *j + 8 * *k + l]++;
  91 }
  92
  93 template <typename T>
  94 void
  95 baz (T &i, T &j, T &k, T &l)
  96 {
  97   if (i < 0 || i >= 16)
  98     abort ();
  99   if (j < 0 || j >= 16)
 100     abort ();
 101   if (k < 0 || k >= 16)
 102     abort ();
 103   if (l < 0 || l >= 16)
 104     abort ();
 105   #pragma omp atomic
 106     results[512 * i + 64 * j + 8 * k + l]++;
 107 }
 108
 109 void
 110 f1 (const I<int> &a, const I<int> &b, const I<int> &c, const I<int> &d,
 111     const I<int> &e, const I<int> &f, int g, int h,
 112     I<int> &r1, I<int> &r2, I<int> &r3)
 113 {
 114   I<int> i, j, k;
 115   int l;
 116 #pragma omp parallel for ordered(4) lastprivate (i, j, k) schedule(static, 1)
 117   for (i = a; i <= b; i++)
 118     for (j = c; j < d; j++)
 119       for (k = e; k < f; k++)
 120         for (l = g; l < h; l++)
 121           {
 122             #pragma omp ordered depend(sink: i - 1, j, k + 1, l - 2)
 123             baz (i, j, k, l);
 124             if (i > a && k < f - 1 && l > g + 1)
 125               {
 126                 int m;
 127                 #pragma omp atomic read
 128                 m = results[512 * *(i - 1) + 64 * *j + 8 * *(k + 1) + l - 2];
 129                 if (m == 0)
 130                   abort ();
 131               }
 132             #pragma omp ordered depend(source)
 133           }
 134   r1 = i;
 135   r2 = j;
 136   r3 = k;
 137 }
 138
 139 void
 140 f2 (int a, int b, int c, int d, int e, int f, int g, int h, int &r1, int &r2, int &r3)
 141 {
 142   int i, j, k, l;
 143 #pragma omp parallel for collapse (1) ordered(4) lastprivate (i, j, k) schedule(static, 2)
 144   for (i = a; i <= b; i++)
 145     for (j = c; j < d; j++)
 146       for (k = e; k < f; k++)
 147         for (l = g; l < h; l++)
 148           {
 149             #pragma omp ordered depend(sink: i - 1, j, k + 1, l - 2)
 150             baz (i, j, k, l);
 151             if (i > a && k < f - 1 && l > g + 1)
 152               {
 153                 int m;
 154                 #pragma omp atomic read
 155                 m = results[512 * (i - 1) + 64 * j + 8 * (k + 1) + l - 2];
 156                 if (m == 0)
 157                   abort ();
 158               }
 159             #pragma omp ordered depend(source)
 160           }
 161   r1 = i;
 162   r2 = j;
 163   r3 = k;
 164 }
 165
 166 void
 167 f3 (const I<int> &a, const I<int> &b, const I<int> &c, const I<int> &d,
 168     const I<int> &e, const I<int> &f, int g, int h,
 169     I<int> &r1, I<int> &r2, I<int> &r3)
 170 {
 171   I<int> i, j, k;
 172   int l;
 173 #pragma omp parallel for collapse (2) ordered(4) lastprivate (i, j, k) schedule(static, 1)
 174   for (i = a; i <= b; i++)
 175     for (j = c; j < d; j++)
 176       for (k = e; k < f; k++)
 177         for (l = g; l < h; l++)
 178           {
 179             #pragma omp ordered depend(sink: i - 1, j, k + 1, l - 2)
 180             baz (i, j, k, l);
 181             if (i > a && k < f - 1 && l > g + 1)
 182               {
 183                 int m;
 184                 #pragma omp atomic read
 185                 m = results[512 * *(i - 1) + 64 * *j + 8 * *(k + 1) + l - 2];
 186                 if (m == 0)
 187                   abort ();
 188               }
 189             #pragma omp ordered depend(source)
 190           }
 191   r1 = i;
 192   r2 = j;
 193   r3 = k;
 194 }
 195
 196 void
 197 f4 (int a, int b, int c, int d, int e, int f, int g, int h, int &r1, int &r2, int &r3)
 198 {
 199   int i, j, k, l;
 200 #pragma omp parallel for collapse (2) ordered(4) lastprivate (i, j, k) schedule(static, 2)
 201   for (i = a; i <= b; i++)
 202     for (j = c; j < d; j++)
 203       for (k = e; k < f; k++)
 204         for (l = g; l < h; l++)
 205           {
 206             #pragma omp ordered depend(sink: i - 1, j, k + 1, l - 2)
 207             baz (i, j, k, l);
 208             if (i > a && k < f - 1 && l > g + 1)
 209               {
 210                 int m;
 211                 #pragma omp atomic read
 212                 m = results[512 * (i - 1) + 64 * j + 8 * (k + 1) + l - 2];
 213                 if (m == 0)
 214                   abort ();
 215               }
 216             #pragma omp ordered depend(source)
 217           }
 218   r1 = i;
 219   r2 = j;
 220   r3 = k;
 221 }
 222
 223 #define check(expr) \
 224   for (int i = 0; i < 2048; i++)                        \
 225     if (expr)                                           \
 226       {                                                 \
 227         if (results[i] != 1)                            \
 228           abort ();                                     \
 229         results[i] = 0;                                 \
 230       }                                                 \
 231     else if (results[i])                                \
 232       abort ()
 233
 234 int
 235 main ()
 236 {
 237   int a[16], s1, s2, s3;
 238   I<int> r1, r2, r3;
 239   for (int i = 0; i < 16; i++)
 240     a[i] = i;
 241   r1 = &a[15]; r2 = &a[15]; r3 = &a[15];
 242   f1 (&a[1], &a[3], &a[2], &a[5], &a[1], &a[3], 0, 5, r1, r2, r3);
 243   if (*r1 != 4 || *r2 != 5 || *r3 != 3)
 244     abort ();
 245   check ((i / 512) - 1U < 3U && ((i / 64) & 7) - 2U < 3U && ((i / 8) & 7) - 1U < 2U && (i & 7) < 5);
 246   r1 = &a[15]; r2 = &a[15]; r3 = &a[15];
 247   f1 (&a[1], &a[3], &a[1], &a[4], &a[1], &a[5], 1, 0, r1, r2, r3);
 248   if (*r1 != 4 || *r2 != 4 || *r3 != 5)
 249     abort ();
 250   r1 = &a[15]; r2 = &a[15]; r3 = &a[15];
 251   f1 (&a[1], &a[3], &a[1], &a[9], &a[7], &a[2], 0, 7, r1, r2, r3);
 252   if (*r1 != 4 || *r2 != 9 || *r3 != 7)
 253     abort ();
 254   s1 = 15; s2 = 15; s3 = 15;
 255   f2 (1, 3, 2, 5, 1, 3, 0, 5, s1, s2, s3);
 256   if (s1 != 4 || s2 != 5 || s3 != 3)
 257     abort ();
 258   check ((i / 512) - 1U < 3U && ((i / 64) & 7) - 2U < 3U && ((i / 8) & 7) - 1U < 2U && (i & 7) < 5);
 259   s1 = 15; s2 = 15; s3 = 15;
 260   f2 (1, 3, 1, 4, 1, 5, 1, 0, s1, s2, s3);
 261   if (s1 != 4 || s2 != 4 || s3 != 5)
 262     abort ();
 263   s1 = 15; s2 = 15; s3 = 15;
 264   f2 (1, 3, 1, 9, 7, 2, 0, 7, s1, s2, s3);
 265   if (s1 != 4 || s2 != 9 || s3 != 7)
 266     abort ();
 267   r1 = &a[15]; r2 = &a[15]; r3 = &a[15];
 268   f3 (&a[1], &a[3], &a[2], &a[5], &a[1], &a[3], 0, 5, r1, r2, r3);
 269   if (*r1 != 4 || *r2 != 5 || *r3 != 3)
 270     abort ();
 271   check ((i / 512) - 1U < 3U && ((i / 64) & 7) - 2U < 3U && ((i / 8) & 7) - 1U < 2U && (i & 7) < 5);
 272   r1 = &a[15]; r2 = &a[15]; r3 = &a[15];
 273   f3 (&a[1], &a[3], &a[1], &a[4], &a[1], &a[5], 1, 0, r1, r2, r3);
 274   if (*r1 != 4 || *r2 != 4 || *r3 != 5)
 275     abort ();
 276   r1 = &a[15]; r2 = &a[15]; r3 = &a[15];
 277   f3 (&a[1], &a[3], &a[1], &a[9], &a[7], &a[2], 0, 7, r1, r2, r3);
 278   if (*r1 != 4 || *r2 != 9 || *r3 != 7)
 279     abort ();
 280   s1 = 15; s2 = 15; s3 = 15;
 281   f4 (1, 3, 2, 5, 1, 3, 0, 5, s1, s2, s3);
 282   if (s1 != 4 || s2 != 5 || s3 != 3)
 283     abort ();
 284   check ((i / 512) - 1U < 3U && ((i / 64) & 7) - 2U < 3U && ((i / 8) & 7) - 1U < 2U && (i & 7) < 5);
 285   s1 = 15; s2 = 15; s3 = 15;
 286   f4 (1, 3, 1, 4, 1, 5, 1, 0, s1, s2, s3);
 287   if (s1 != 4 || s2 != 4 || s3 != 5)
 288     abort ();
 289   s1 = 15; s2 = 15; s3 = 15;
 290   f4 (1, 3, 1, 9, 7, 2, 0, 7, s1, s2, s3);
 291   if (s1 != 4 || s2 != 9 || s3 != 7)
 292     abort ();
 293   return 0;
 294 }