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)
      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[0:p1 + 1][:p2], z[:p3]) \
      43  			   reduction(*:y[:p4]) reduction(|:a[:p5]) \
      44  			   reduction(&:w[0:p6 - 1][:p6]) reduction(maxb:b)
      45    for (i = 0; i < 128; i++)
      46      {
      47        x[i / 64][i % 3][(i / 4) & 1].t += i;
      48        if ((i & 15) == 1)
      49  	y[0].t *= 3;
      50        if ((i & 31) == 2)
      51  	y[1].t *= 7;
      52        if ((i & 63) == 3)
      53  	y[2].t *= 17;
      54        z[i / 32].t += (i & 3);
      55        if (i < 4)
      56  	z[i].t += i;
      57        a[i / 32].t |= 1ULL << (i & 30);
      58        w[0][i & 1].t &= ~(1L << (i / 17 * 3));
      59        if ((i % 79) > b[0])
      60  	b[0] = i % 79;
      61        if ((i % 13) > b[1])
      62  	b[1] = i % 13;
      63        if ((i % 23) > b[2])
      64  	b[2] = i % 23;
      65        if ((i % 85) > b[3])
      66  	b[3] = i % 85;
      67        if ((i % 192) > b[4])
      68  	b[4] = i % 192;
      69      }
      70    for (i = 0; i < 9; i++)
      71      if (a[i].t != (i < 4 ? 0x55555555ULL : 0))
      72        __builtin_abort ();
      73    if (b[0] != 78 || b[1] != 12 || b[2] != 22 || b[3] != 84 || b[4] != 127)
      74      __builtin_abort ();
      75  }
      76  
      77  int
      78  main ()
      79  {
      80    struct A a[4][3][2] = {};
      81    static int a2[4][3][2] = {{{ 0, 0 }, { 0, 0 }, { 0, 0 }},
      82  			    {{ 312, 381 }, { 295, 356 }, { 337, 335 }},
      83  			    {{ 1041, 975 }, { 1016, 1085 }, { 935, 1060 }},
      84  			    {{ 0, 0 }, { 0, 0 }, { 0, 0 }}};
      85    struct A y[5] = { { 0 }, { 1 }, { 1 }, { 1 }, { 0 } };
      86    int y2[5] = { 0, 6561, 2401, 289, 0 };
      87    char z2[10] = { 48, 49, 50, 51, 0, 0, 0, 0, 0, 0 };
      88    struct D w[1][2] = { { { ~0L }, { ~0L } } };
      89    foo (&a[1], y + 1, w, 1, 3L, 4L, 3, 4, 2L, 5);
      90    int i, j, k;
      91    for (i = 0; i < 4; i++)
      92      for (j = 0; j < 3; j++)
      93        for (k = 0; k < 2; k++)
      94  	if (a[i][j][k].t != a2[i][j][k])
      95  	  __builtin_abort ();
      96    for (i = 0; i < 5; i++)
      97      if (y[i].t != y2[i])
      98        __builtin_abort ();
      99    for (i = 0; i < 10; i++)
     100      if (z[i].t != z2[i])
     101        __builtin_abort ();
     102    if (w[0][0].t != ~0x249249L || w[0][1].t != ~0x249249L)
     103      __builtin_abort ();
     104    return 0;
     105  }