libgomp/testsuite/libgomp.c++/task-reduction-12.C

   1 extern "C" void abort ();
   2
   3 struct S { S (); S (long int, long int); ~S (); static int cnt1, cnt2, cnt3; long int s, t; };
   4
   5 int S::cnt1;
   6 int S::cnt2;
   7 int S::cnt3;
   8
   9 S::S ()
  10 {
  11   #pragma omp atomic
  12   cnt1++;
  13 }
  14
  15 S::S (long int x, long int y) : s (x), t (y)
  16 {
  17   #pragma omp atomic update
  18   ++cnt2;
  19 }
  20
  21 S::~S ()
  22 {
  23   #pragma omp atomic
  24   cnt3 = cnt3 + 1;
  25   if (t < 3 || t > 9 || (t & 1) == 0)
  26     abort ();
  27 }
  28
  29 void
  30 bar (S *p, S *o)
  31 {
  32   p->s = 1;
  33   if (o->t != 5)
  34     abort ();
  35   p->t = 9;
  36 }
  37
  38 static inline void
  39 baz (S *o, S *i)
  40 {
  41   if (o->t != 5 || i->t != 9)
  42     abort ();
  43   o->s *= i->s;
  44 }
  45
  46 #pragma omp declare reduction (+: S : omp_out.s += omp_in.s) initializer (omp_priv (0, 3))
  47 #pragma omp declare reduction (*: S : baz (&omp_out, &omp_in)) initializer (bar (&omp_priv, &omp_orig))
  48
  49 S a[2] = { { 0, 7 }, { 0, 7 } };
  50 S b[7] = { { 9, 5 }, { 11, 5 }, { 1, 5 }, { 1, 5 }, { 1, 5 }, { 13, 5 }, { 15, 5 } };
  51 S e[3] = { { 5, 7 }, { 0, 7 }, { 5, 7 } };
  52 S f[5] = { { 6, 7 }, { 7, 7 }, { 0, 7 }, { 0, 7 }, { 9, 7 } };
  53 S g[4] = { { 1, 7 }, { 0, 7 }, { 0, 7 }, { 2, 7 } };
  54 S h[3] = { { 0, 7 }, { 1, 7 }, { 4, 7 } };
  55 S k[4][2] = { { { 5, 7 }, { 6, 7 } }, { { 0, 7 }, { 0, 7 } }, { { 0, 7 }, { 0, 7 } }, { { 7, 7 }, { 8, 7 } } };
  56 S *s;
  57 S (*t)[2];
  58
  59 template <int N>
  60 void
  61 foo (int n, S *c, S *d, S m[3], S *r, S o[4], S *p, S q[4][2])
  62 {
  63   int i;
  64   for (i = 0; i < 2; i++)
  65     #pragma omp task in_reduction (+: a, c[:2]) in_reduction (*: b[2 * n:3 * n], d[0:2]) \
  66                      in_reduction (+: o[n:n*2], m[1], k[1:2][:], p[0], f[2:2]) \
  67                      in_reduction (+: q[1:2][:], g[n:n*2], e[1], h[0], r[2:2]) \
  68                      in_reduction (*: s[1:2], t[2:2][:])
  69     {
  70       a[0].s += 7;
  71       a[1].s += 17;
  72       b[2].s *= 2;
  73       b[4].s *= 2;
  74       c[0].s += 6;
  75       d[1].s *= 2;
  76       e[1].s += 19;
  77       f[2].s += 21;
  78       f[3].s += 23;
  79       g[1].s += 25;
  80       g[2].s += 27;
  81       h[0].s += 29;
  82       k[1][0].s += 31;
  83       k[2][1].s += 33;
  84       m[1].s += 19;
  85       r[2].s += 21;
  86       r[3].s += 23;
  87       o[1].s += 25;
  88       o[2].s += 27;
  89       p[0].s += 29;
  90       q[1][0].s += 31;
  91       q[2][1].s += 33;
  92       s[1].s *= 2;
  93       t[2][0].s *= 2;
  94       t[3][1].s *= 2;
  95       if ((e[1].t != 7 && e[1].t != 3) || (h[0].t != 7 && h[0].t != 3)
  96           || (m[1].t != 7 && m[1].t != 3) || (p[0].t != 7 && p[0].t != 3))
  97         abort ();
  98       for (int z = 0; z < 2; z++)
  99         if ((a[z].t != 7 && a[z].t != 3) || (c[z].t != 7 && c[z].t != 3)
 100             || (d[z].t != 5 && d[z].t != 9) || (f[z + 2].t != 7 && f[z + 2].t != 3)
 101             || (g[z + 1].t != 7 && g[z + 1].t != 3) || (r[z + 2].t != 7 && r[z + 2].t != 3)
 102             || (s[z + 1].t != 5 && s[z + 1].t != 9) || (o[z + 1].t != 7 && o[z + 1].t != 3)
 103             || (k[z + 1][0].t != 7 && k[z + 1][0].t != 3) || (k[z + 1][1].t != 7 && k[z + 1][1].t != 3)
 104             || (q[z + 1][0].t != 7 && q[z + 1][0].t != 3) || (q[z + 1][1].t != 7 && q[z + 1][1].t != 3)
 105             || (t[z + 2][0].t != 5 && t[z + 2][0].t != 9) || (t[z + 2][1].t != 5 && t[z + 2][1].t != 9))
 106           abort ();
 107       for (int z = 0; z < 3; z++)
 108         if (b[z + 2].t != 5 && b[z + 2].t != 9)
 109           abort ();
 110     }
 111 }
 112
 113 template <int N>
 114 void
 115 test (int n)
 116 {
 117   S c[2] = { { 0, 7 }, { 0, 7 } };
 118   S p[3] = { { 0, 7 }, { 1, 7 }, { 4, 7 } };
 119   S q[4][2] = { { { 5, 7 }, { 6, 7 } }, { { 0, 7 }, { 0, 7 } }, { { 0, 7 }, { 0, 7 } }, { { 7, 7 }, { 8, 7 } } };
 120   S ss[4] = { { 5, 5 }, { 1, 5 }, { 1, 5 }, { 6, 5 } };
 121   S tt[5][2] = { { { 9, 5 }, { 10, 5 } }, { { 11, 5 }, { 12, 5 } }, { { 1, 5 }, { 1, 5 } }, { { 1, 5 }, { 1, 5 } }, { { 13, 5 }, { 14, 5 } } };
 122   s = ss;
 123   t = tt;
 124   #pragma omp parallel num_threads (1) if (0)
 125   {
 126     S d[] = { { 1, 5 }, { 1, 5 } };
 127     S m[3] = { { 5, 7 }, { 0, 7 }, { 5, 7 } };
 128     S r[5] = { { 6, 7 }, { 7, 7 }, { 0, 7 }, { 0, 7 }, { 9, 7 } };
 129     S o[4] = { { 1, 7 }, { 0, 7 }, { 0, 7 }, { 2, 7 } };
 130     #pragma omp parallel reduction (task, +: a, c) reduction (task, *: b[2 * n:3 * n], d) \
 131                          reduction (task, +: e[1], f[2:2], g[n:n*2], h[0], k[1:2][0:2]) \
 132                          reduction (task, +: o[n:n*2], m[1], q[1:2][:], p[0], r[2:2]) \
 133                          reduction (task, *: t[2:2][:], s[1:n + 1])
 134     {
 135       #pragma omp for
 136       for (int i = 0; i < 4; i++)
 137         #pragma omp task in_reduction (+: a, c) in_reduction (*: b[2 * n:3 * n], d) \
 138                          in_reduction (+: o[n:n*2], q[1:2][:], p[0], m[1], r[2:2]) \
 139                          in_reduction (+: g[n:n * 2], e[1], k[1:2][:], h[0], f[2:2]) \
 140                          in_reduction (*: s[1:2], t[2:2][:])
 141         {
 142           int j;
 143           a[0].s += 2;
 144           a[1].s += 3;
 145           b[2].s *= 2;
 146           f[3].s += 8;
 147           g[1].s += 9;
 148           g[2].s += 10;
 149           h[0].s += 11;
 150           k[1][1].s += 13;
 151           k[2][1].s += 15;
 152           m[1].s += 16;
 153           r[2].s += 8;
 154           s[1].s *= 2;
 155           t[2][1].s *= 2;
 156           t[3][1].s *= 2;
 157           if ((e[1].t != 7 && e[1].t != 3) || (h[0].t != 7 && h[0].t != 3)
 158               || (m[1].t != 7 && m[1].t != 3) || (p[0].t != 7 && p[0].t != 3))
 159             abort ();
 160           for (int z = 0; z < 2; z++)
 161             if ((a[z].t != 7 && a[z].t != 3) || (c[z].t != 7 && c[z].t != 3)
 162                 || (d[z].t != 5 && d[z].t != 9) || (f[z + 2].t != 7 && f[z + 2].t != 3)
 163                 || (g[z + 1].t != 7 && g[z + 1].t != 3) || (r[z + 2].t != 7 && r[z + 2].t != 3)
 164                 || (s[z + 1].t != 5 && s[z + 1].t != 9) || (o[z + 1].t != 7 && o[z + 1].t != 3)
 165                 || (k[z + 1][0].t != 7 && k[z + 1][0].t != 3) || (k[z + 1][1].t != 7 && k[z + 1][1].t != 3)
 166                 || (q[z + 1][0].t != 7 && q[z + 1][0].t != 3) || (q[z + 1][1].t != 7 && q[z + 1][1].t != 3)
 167                 || (t[z + 2][0].t != 5 && t[z + 2][0].t != 9) || (t[z + 2][1].t != 5 && t[z + 2][1].t != 9))
 168               abort ();
 169           for (int z = 0; z < 3; z++)
 170             if (b[z + 2].t != 5 && b[z + 2].t != 9)
 171               abort ();
 172           for (j = 0; j < 2; j++)
 173             #pragma omp task in_reduction (+: a, c[:2]) \
 174                              in_reduction (*: b[2 * n:3 * n], d[n - 1:n + 1]) \
 175                              in_reduction (+: e[1], f[2:2], g[n:n*2], h[0], k[1:2][:2]) \
 176                              in_reduction (+: m[1], r[2:2], o[n:n*2], p[0], q[1:2][:2]) \
 177                              in_reduction (*: s[n:2], t[2:2][:])
 178             {
 179               m[1].s += 6;
 180               r[2].s += 7;
 181               q[1][0].s += 17;
 182               q[2][0].s += 19;
 183               a[0].s += 4;
 184               a[1].s += 5;
 185               b[3].s *= 2;
 186               b[4].s *= 2;
 187               f[3].s += 18;
 188               g[1].s += 29;
 189               g[2].s += 18;
 190               h[0].s += 19;
 191               s[2].s *= 2;
 192               t[2][0].s *= 2;
 193               t[3][0].s *= 2;
 194               foo<N> (n, c, d, m, r, o, p, q);
 195               if ((e[1].t != 7 && e[1].t != 3) || (h[0].t != 7 && h[0].t != 3)
 196                   || (m[1].t != 7 && m[1].t != 3) || (p[0].t != 7 && p[0].t != 3))
 197                 abort ();
 198               for (int z = 0; z < 2; z++)
 199                 if ((a[z].t != 7 && a[z].t != 3) || (c[z].t != 7 && c[z].t != 3)
 200                     || (d[z].t != 5 && d[z].t != 9) || (f[z + 2].t != 7 && f[z + 2].t != 3)
 201                     || (g[z + 1].t != 7 && g[z + 1].t != 3) || (r[z + 2].t != 7 && r[z + 2].t != 3)
 202                     || (s[z + 1].t != 5 && s[z + 1].t != 9) || (o[z + 1].t != 7 && o[z + 1].t != 3)
 203                     || (k[z + 1][0].t != 7 && k[z + 1][0].t != 3) || (k[z + 1][1].t != 7 && k[z + 1][1].t != 3)
 204                     || (q[z + 1][0].t != 7 && q[z + 1][0].t != 3) || (q[z + 1][1].t != 7 && q[z + 1][1].t != 3)
 205                     || (t[z + 2][0].t != 5 && t[z + 2][0].t != 9) || (t[z + 2][1].t != 5 && t[z + 2][1].t != 9))
 206                   abort ();
 207               for (int z = 0; z < 3; z++)
 208                 if (b[z + 2].t != 5 && b[z + 2].t != 9)
 209                   abort ();
 210               r[3].s += 18;
 211               o[1].s += 29;
 212               o[2].s += 18;
 213               p[0].s += 19;
 214               c[0].s += 4;
 215               c[1].s += 5;
 216               d[0].s *= 2;
 217               e[1].s += 6;
 218               f[2].s += 7;
 219               k[1][0].s += 17;
 220               k[2][0].s += 19;
 221             }
 222           r[3].s += 8;
 223           o[1].s += 9;
 224           o[2].s += 10;
 225           p[0].s += 11;
 226           q[1][1].s += 13;
 227           q[2][1].s += 15;
 228           b[3].s *= 2;
 229           c[0].s += 4;
 230           c[1].s += 9;
 231           d[0].s *= 2;
 232           e[1].s += 16;
 233           f[2].s += 8;
 234         }
 235     }
 236     if (d[0].s != 1LL << (8 + 4)
 237         || d[1].s != 1LL << 16
 238         || m[0].s != 5
 239         || m[1].s != 19 * 16 + 6 * 8 + 16 * 4
 240         || m[2].s != 5
 241         || r[0].s != 6
 242         || r[1].s != 7
 243         || r[2].s != 21 * 16 + 7 * 8 + 8 * 4
 244         || r[3].s != 23 * 16 + 18 * 8 + 8 * 4
 245         || r[4].s != 9
 246         || o[0].s != 1
 247         || o[1].s != 25 * 16 + 29 * 8 + 9 * 4
 248         || o[2].s != 27 * 16 + 18 * 8 + 10 * 4
 249         || o[3].s != 2)
 250       abort ();
 251     if (e[1].t != 7 || h[0].t != 7 || m[1].t != 7 || p[0].t != 7)
 252       abort ();
 253     for (int z = 0; z < 2; z++)
 254       if (a[z].t != 7 || c[z].t != 7 || d[z].t != 5 || f[z + 2].t != 7
 255           || g[z + 1].t != 7 || r[z + 2].t != 7 || s[z + 1].t != 5 || o[z + 1].t != 7
 256           || k[z + 1][0].t != 7 || k[z + 1][1].t != 7 || q[z + 1][0].t != 7 || q[z + 1][1].t != 7
 257           || t[z + 2][0].t != 5 || t[z + 2][1].t != 5)
 258         abort ();
 259     for (int z = 0; z < 3; z++)
 260       if (b[z + 2].t != 5)
 261         abort ();
 262   }
 263   if (a[0].s != 7 * 16 + 4 * 8 + 2 * 4
 264       || a[1].s != 17 * 16 + 5 * 8 + 3 * 4
 265       || b[0].s != 9 || b[1].s != 11
 266       || b[2].s != 1LL << (16 + 4)
 267       || b[3].s != 1LL << (8 + 4)
 268       || b[4].s != 1LL << (16 + 8)
 269       || b[5].s != 13 || b[6].s != 15
 270       || c[0].s != 6 * 16 + 4 * 8 + 4 * 4
 271       || c[1].s != 5 * 8 + 9 * 4
 272       || e[0].s != 5
 273       || e[1].s != 19 * 16 + 6 * 8 + 16 * 4
 274       || e[2].s != 5
 275       || f[0].s != 6
 276       || f[1].s != 7
 277       || f[2].s != 21 * 16 + 7 * 8 + 8 * 4
 278       || f[3].s != 23 * 16 + 18 * 8 + 8 * 4
 279       || f[4].s != 9
 280       || g[0].s != 1
 281       || g[1].s != 25 * 16 + 29 * 8 + 9 * 4
 282       || g[2].s != 27 * 16 + 18 * 8 + 10 * 4
 283       || g[3].s != 2
 284       || h[0].s != 29 * 16 + 19 * 8 + 11 * 4
 285       || h[1].s != 1 || h[2].s != 4
 286       || k[0][0].s != 5 || k[0][1].s != 6
 287       || k[1][0].s != 31 * 16 + 17 * 8
 288       || k[1][1].s != 13 * 4
 289       || k[2][0].s != 19 * 8
 290       || k[2][1].s != 33 * 16 + 15 * 4
 291       || k[3][0].s != 7 || k[3][1].s != 8
 292       || p[0].s != 29 * 16 + 19 * 8 + 11 * 4
 293       || p[1].s != 1 || p[2].s != 4
 294       || q[0][0].s != 5 || q[0][1].s != 6
 295       || q[1][0].s != 31 * 16 + 17 * 8
 296       || q[1][1].s != 13 * 4
 297       || q[2][0].s != 19 * 8
 298       || q[2][1].s != 33 * 16 + 15 * 4
 299       || q[3][0].s != 7 || q[3][1].s != 8
 300       || ss[0].s != 5
 301       || ss[1].s != 1LL << (16 + 4)
 302       || ss[2].s != 1LL << 8
 303       || ss[3].s != 6
 304       || tt[0][0].s != 9 || tt[0][1].s != 10 || tt[1][0].s != 11 || tt[1][1].s != 12
 305       || tt[2][0].s != 1LL << (16 + 8)
 306       || tt[2][1].s != 1LL << 4
 307       || tt[3][0].s != 1LL << 8
 308       || tt[3][1].s != 1LL << (16 + 4)
 309       || tt[4][0].s != 13 || tt[4][1].s != 14)
 310     abort ();
 311 }
 312
 313 int
 314 main ()
 315 {
 316   int c1 = S::cnt1, c2 = S::cnt2, c3 = S::cnt3;
 317   test<0> (1);
 318   if (S::cnt1 + S::cnt2 - c1 - c2 != S::cnt3 - c3)
 319     abort ();
 320   return 0;
 321 }