6 A (const A &x) { t = x.t; }
15 M (const M &x) { t = x.t; }
24 B (const B &x) { t = x.t; }
47 #pragma omp declare reduction(+:A<int>:omp_out.t += omp_in.t)
48 #pragma omp declare reduction(+:A<char>:add (omp_out, omp_in)) initializer(zero (omp_priv))
49 #pragma omp declare reduction(*:M<int>:omp_out.t *= omp_in.t) initializer(omp_priv = 1)
50 #pragma omp declare reduction(|:A<unsigned long long>:orit (&omp_in, &omp_out))
51 #pragma omp declare reduction(&:B<long>:omp_out.t = omp_out.t & omp_in.t) initializer(orit (&omp_priv, &omp_orig))
52 #pragma omp declare reduction(maxb:short:omp_out = omp_in > omp_out ? omp_in : omp_out) initializer(omp_priv = -6)
56 __attribute__((noinline, noclone)) void
57 foo (A<int> (*&x)[3][2], M<int> *y, B<long> (&w)[1][2], int p1, long p2, long p3, int p4,
58 int p5, long p6, short p7)
60 A<unsigned long long> a[p7 + 4];
63 for (int i = 0; i < p7; i++)
65 #pragma omp parallel for reduction(+:x[0:p1 + 1][:p2], z[:p3]) \
66 reduction(*:y[:p4]) reduction(|:a[:p5]) \
67 reduction(&:w[0:p6 - 1][:p6]) reduction(maxb:b)
68 for (int i = 0; i < 128; i++)
70 x[i / 64][i % 3][(i / 4) & 1].t += i;
77 z[i / 32].t += (i & 3);
80 a[i / 32].t |= 1ULL << (i & 30);
81 w[0][i & 1].t &= ~(1L << (i / 17 * 3));
93 for (int i = 0; i < 9; i++)
94 if (a[i].t != (i < 4 ? 0x55555555ULL : 0))
96 if (bb[0] != 78 || bb[1] != 12 || bb[2] != 22 || bb[3] != 84 || bb[4] != 127)
101 A<int> (*p3)[3][2] = &a3[1];
102 M<int> y3[5] = { 0, 1, 1, 1, 0 };
112 A<unsigned long long> a[9];
113 S() : x(p3), y(y3+1), w(w3), z(), a(), b() {}
114 __attribute__((noinline, noclone)) void foo (int, long, long, int, int, long, short);
118 S::foo (int p1, long p2, long p3, int p4, int p5, long p6, short p7)
120 #pragma omp parallel for reduction(+:x[0:p1 + 1][:p2][0:2], z[:p3]) \
121 reduction(*:y[:p4]) reduction(|:a[:p5]) \
122 reduction(&:w[0:p6 - 1][:p6]) reduction(maxb:b)
123 for (int i = 0; i < 128; i++)
125 x[i / 64][i % 3][(i / 4) & 1].t += i;
132 z[i / 32].t += (i & 3);
135 a[i / 32].t |= 1ULL << (i & 30);
136 w[0][i & 1].t &= ~(1L << (i / 17 * 3));
145 if ((i % 192) > b[4])
154 static int a2[4][3][2] = {{{ 0, 0 }, { 0, 0 }, { 0, 0 }},
155 {{ 312, 381 }, { 295, 356 }, { 337, 335 }},
156 {{ 1041, 975 }, { 1016, 1085 }, { 935, 1060 }},
157 {{ 0, 0 }, { 0, 0 }, { 0, 0 }}};
158 A<int> (*p)[3][2] = &a[1];
159 M<int> y[5] = { 0, 1, 1, 1, 0 };
160 int y2[5] = { 0, 6561, 2401, 289, 0 };
161 char z2[10] = { 48, 49, 50, 51, 0, 0, 0, 0, 0, 0 };
163 foo (p, y + 1, w, 1, 3L, 4L, 3, 4, 2L, 5);
164 for (int i = 0; i < 4; i++)
165 for (int j = 0; j < 3; j++)
166 for (int k = 0; k < 2; k++)
167 if (a[i][j][k].t != a2[i][j][k])
169 for (int i = 0; i < 5; i++)
172 for (int i = 0; i < 10; i++)
175 if (w[0][0].t != ~0x249249L || w[0][1].t != ~0x249249L)
178 s.foo (1, 3L, 4L, 3, 4, 2L, 5);
179 for (int i = 0; i < 9; i++)
180 if (s.a[i].t != (i < 4 ? 0x55555555ULL : 0))
182 for (int i = 0; i < 4; i++)
183 for (int j = 0; j < 3; j++)
184 for (int k = 0; k < 2; k++)
185 if (a3[i][j][k].t != a2[i][j][k])
187 for (int i = 0; i < 5; i++)
188 if (y3[i].t != y2[i])
190 for (int i = 0; i < 10; i++)
191 if (s.z[i].t != z2[i])
193 if (w3[0][0].t != ~0x249249L || w3[0][1].t != ~0x249249L)
195 if (s.b[0] != 78 || s.b[1] != 12 || s.b[2] != 22
196 || s.b[3] != 84 || s.b[4] != 127)