libgomp/testsuite/libgomp.c/reduction-14.c

   1 struct A { int t; };
   2 struct B { char t; };
   3 struct C { unsigned long long t; };
   4 struct D { long t; };
   5 void
   6 add (struct B *x, struct B *y)
   7 {
   8   x->t += y->t;
   9 }
  10 void
  11 zero (struct B *x)
  12 {
  13   x->t = 0;
  14 }
  15 void
  16 orit (struct C *x, struct C *y)
  17 {
  18   y->t |= x->t;
  19 }
  20 #pragma omp declare reduction(+:struct A:omp_out.t += omp_in.t)
  21 #pragma omp declare reduction(+:struct B:add (&omp_out, &omp_in)) initializer(zero (&omp_priv))
  22 #pragma omp declare reduction(*:struct A:omp_out.t *= omp_in.t) initializer(omp_priv = { 1 })
  23 #pragma omp declare reduction(|:struct C:orit (&omp_in, &omp_out))
  24 #pragma omp declare reduction(&:struct D:omp_out.t = omp_out.t & omp_in.t) initializer(omp_priv = { ~0L })
  25 #pragma omp declare reduction(maxb:short:omp_out = omp_in > omp_out ? omp_in : omp_out) initializer(omp_priv = -6)
  26
  27 struct B z[10];
  28
  29 __attribute__((noinline, noclone)) void
  30 foo (struct A (*x)[3][2], struct A *y, struct D w[1][2], int p1, long p2, long p3, int p4,
  31      int p5, long p6, short p7, int s, int t)
  32 {
  33   struct C a[p7 + 4];
  34   short b[p7];
  35   int i;
  36   for (i = 0; i < p7 + 4; i++)
  37     {
  38       if (i < p7)
  39         b[i] = -6;
  40       a[i].t = 0;
  41     }
  42   #pragma omp parallel for reduction(+:x[-1:p1 + 1][:p2], z[t + 2:p3]) \
  43                            reduction(*:y[-s:p4]) reduction(|:a[s + 3:p5]) \
  44                            reduction(&:w[s + 1:p6 - 1][t:p6]) reduction(maxb:b[2:])
  45   for (i = 0; i < 128; i++)
  46     {
  47       x[i / 64 - 1][i % 3][(i / 4) & 1].t += i;
  48       if ((i & 15) == 1)
  49         y[1].t *= 3;
  50       if ((i & 31) == 2)
  51         y[2].t *= 7;
  52       if ((i & 63) == 3)
  53         y[3].t *= 17;
  54       z[i / 32 + 2].t += (i & 3);
  55       if (i < 4)
  56         z[i + 2].t += i;
  57       a[i / 32 + 2].t |= 1ULL << (i & 30);
  58       w[0][i & 1].t &= ~(1L << (i / 17 * 3));
  59       if ((i % 23) > b[2])
  60         b[2] = i % 23;
  61       if ((i % 85) > b[3])
  62         b[3] = i % 85;
  63       if ((i % 192) > b[4])
  64         b[4] = i % 192;
  65     }
  66   for (i = 0; i < 9; i++)
  67     if (a[i].t != ((i < 6 && i >= 2) ? 0x55555555ULL : 0))
  68       __builtin_abort ();
  69   if (b[0] != -6 || b[1] != -6 || b[2] != 22 || b[3] != 84 || b[4] != 127)
  70     __builtin_abort ();
  71 }
  72
  73 int
  74 main ()
  75 {
  76   struct A a[4][3][2] = {};
  77   static int a2[4][3][2] = {{{ 0, 0 }, { 0, 0 }, { 0, 0 }},
  78                             {{ 312, 381 }, { 295, 356 }, { 337, 335 }},
  79                             {{ 1041, 975 }, { 1016, 1085 }, { 935, 1060 }},
  80                             {{ 0, 0 }, { 0, 0 }, { 0, 0 }}};
  81   struct A y[5] = { { 0 }, { 1 }, { 1 }, { 1 }, { 0 } };
  82   int y2[5] = { 0, 6561, 2401, 289, 0 };
  83   char z2[10] = { 0, 0, 48, 49, 50, 51, 0, 0, 0, 0 };
  84   struct D w[1][2] = { { { ~0L }, { ~0L } } };
  85   foo (&a[2], y, w, 1, 3L, 4L, 3, 4, 2L, 5, -1, 0);
  86   int i, j, k;
  87   for (i = 0; i < 4; i++)
  88     for (j = 0; j < 3; j++)
  89       for (k = 0; k < 2; k++)
  90         if (a[i][j][k].t != a2[i][j][k])
  91           __builtin_abort ();
  92   for (i = 0; i < 5; i++)
  93     if (y[i].t != y2[i])
  94       __builtin_abort ();
  95   for (i = 0; i < 10; i++)
  96     if (z[i].t != z2[i])
  97       __builtin_abort ();
  98   if (w[0][0].t != ~0x249249L || w[0][1].t != ~0x249249L)
  99     __builtin_abort ();
 100   return 0;
 101 }