1 // { dg-do run }
2
3 template <typename T>
4 struct A
5 {
AA6 A () { t = 0; }
AA7 A (T x) { t = x; }
AA8 A (const A &x) { t = x.t; }
~AA9 ~A () {}
10 T t;
11 };
12 template <typename T>
13 struct M
14 {
MM15 M () { t = 1; }
MM16 M (T x) { t = x; }
MM17 M (const M &x) { t = x.t; }
~MM18 ~M () {}
19 T t;
20 };
21 template <typename T>
22 struct B
23 {
BB24 B () { t = ~(T) 0; }
BB25 B (T x) { t = x; }
BB26 B (const B &x) { t = x.t; }
~BB27 ~B () {}
28 T t;
29 };
30 template <typename T>
31 void
add(T & x,T & y)32 add (T &x, T &y)
33 {
34 x.t += y.t;
35 }
36 template <typename T>
37 void
zero(T & x)38 zero (T &x)
39 {
40 x.t = 0;
41 }
42 template <typename T>
43 void
orit(T * x,T * y)44 orit (T *x, T *y)
45 {
46 y->t |= x->t;
47 }
48 B<long> bb;
49 #pragma omp declare reduction(+:A<int>:omp_out.t += omp_in.t)
50 #pragma omp declare reduction(+:A<char>:add (omp_out, omp_in)) initializer(zero (omp_priv))
51 #pragma omp declare reduction(*:M<int>:omp_out.t *= omp_in.t) initializer(omp_priv = 1)
52 #pragma omp declare reduction(|:A<unsigned long long>:orit (&omp_in, &omp_out))
53 #pragma omp declare reduction(&:B<long>:omp_out.t = omp_out.t & omp_in.t) initializer(orit (&omp_priv, &omp_orig))
54 #pragma omp declare reduction(maxb:short:omp_out = omp_in > omp_out ? omp_in : omp_out) initializer(omp_priv = -6)
55
56 A<char> z[10];
57
58 template <int N>
59 __attribute__((noinline, noclone)) void
foo(A<int> (* & x)[3][N],M<int> * y,B<long> (& w)[1][N],int p1,long p2,long p3,int p4,int p5,long p6,short p7,int s,int t)60 foo (A<int> (*&x)[3][N], M<int> *y, B<long> (&w)[1][N], int p1, long p2, long p3, int p4,
61 int p5, long p6, short p7, int s, int t)
62 {
63 A<unsigned long long> a[p7 + 4];
64 short bb[p7];
65 short (&b)[p7] = bb;
66 for (int i = 0; i < p7; i++)
67 bb[i] = -6;
68 #pragma omp parallel for reduction(+:x[-1:p1 + 1][:p2 + N - 2], z[t + N:p3]) \
69 reduction(*:y[-s:p4]) reduction(|:a[s + 3:p5 - N + 2]) \
70 reduction(&:w[s + 1:p6 - 3 + N][t:p6]) reduction(maxb:b[N:])
71 for (int i = 0; i < 128; i++)
72 {
73 x[i / 64 - 1][i % 3][(i / 4) & 1].t += i;
74 if ((i & 15) == 1)
75 y[1].t *= 3;
76 if ((i & 31) == N)
77 y[2].t *= 7;
78 if ((i & 63) == 3)
79 y[N + 1].t *= 17;
80 z[i / 32 + 2].t += (i & 3);
81 if (i < 4)
82 z[i + N].t += i;
83 a[i / 32 + 2].t |= 1ULL << (i & 30);
84 w[0][i & 1].t &= ~(1L << (i / 17 * 3));
85 if ((i % 23) > b[N])
86 b[N] = i % 23;
87 if ((i % 85) > b[3])
88 b[3] = i % 85;
89 if ((i % 192) > b[4])
90 b[4] = i % 192;
91 }
92 for (int i = 0; i < 9; i++)
93 if (a[i].t != ((i < 6 && i >= 2) ? 0x55555555ULL : 0))
94 __builtin_abort ();
95 if (bb[0] != -6 || bb[1] != -6 || bb[N] != 22 || bb[3] != 84 || bb[4] != 127)
96 __builtin_abort ();
97 }
98
99 A<int> a3[4][3][2];
100 A<int> (*p3)[3][2] = &a3[2];
101 M<int> y3[5] = { 0, 1, 1, 1, 0 };
102 B<long> w3[1][2];
103
104 template <int N>
105 struct S
106 {
107 A<int> (*&x)[3][N];
108 M<int> *y;
109 B<long> (&w)[1][N];
110 A<char> z[10];
111 short b[5];
112 A<unsigned long long> a[9];
SS113 S() : x(p3), y(y3), w(w3), z(), a(), b() {}
114 __attribute__((noinline, noclone)) void foo (int, long, long, int, int, long, short, int, int);
115 };
116
117 template <int N>
118 void
foo(int p1,long p2,long p3,int p4,int p5,long p6,short p7,int s,int t)119 S<N>::foo (int p1, long p2, long p3, int p4, int p5, long p6, short p7, int s, int t)
120 {
121 #pragma omp parallel for reduction(+:x[-1:p1 + 1][:p2][0:N], z[t + N:p3 + N - 2]) \
122 reduction(*:y[-s:p4]) reduction(|:a[s + 3:p5]) \
123 reduction(&:w[s + 1:p6 - 3 + N][t:p6]) reduction(maxb:b[N:])
124 for (int i = 0; i < 128; i++)
125 {
126 x[i / 64 - 1][i % 3][(i / 4) & 1].t += i;
127 if ((i & 15) == 1)
128 y[1].t *= 3;
129 if ((i & 31) == N)
130 y[2].t *= 7;
131 if ((i & 63) == 3)
132 y[N + 1].t *= 17;
133 z[i / 32 + 2].t += (i & 3);
134 if (i < 4)
135 z[i + N].t += i;
136 a[i / 32 + 2].t |= 1ULL << (i & 30);
137 w[0][i & 1].t &= ~(1L << (i / 17 * 3));
138 if ((i % 23) > b[N])
139 b[N] = i % 23;
140 if ((i % 85) > b[3])
141 b[3] = i % 85;
142 if ((i % 192) > b[4])
143 b[4] = i % 192;
144 }
145 }
146
147 int
main()148 main ()
149 {
150 A<int> a[4][3][2];
151 static int a2[4][3][2] = {{{ 0, 0 }, { 0, 0 }, { 0, 0 }},
152 {{ 312, 381 }, { 295, 356 }, { 337, 335 }},
153 {{ 1041, 975 }, { 1016, 1085 }, { 935, 1060 }},
154 {{ 0, 0 }, { 0, 0 }, { 0, 0 }}};
155 A<int> (*p)[3][2] = &a[2];
156 M<int> y[5] = { 0, 1, 1, 1, 0 };
157 int y2[5] = { 0, 6561, 2401, 289, 0 };
158 char z2[10] = { 0, 0, 48, 49, 50, 51, 0, 0, 0, 0 };
159 B<long> w[1][2];
160 foo<2> (p, y, w, 1, 3L, 4L, 3, 4, 2L, 5, -1, 0);
161 for (int i = 0; i < 4; i++)
162 for (int j = 0; j < 3; j++)
163 for (int k = 0; k < 2; k++)
164 if (a[i][j][k].t != a2[i][j][k])
165 __builtin_abort ();
166 for (int i = 0; i < 5; i++)
167 if (y[i].t != y2[i])
168 __builtin_abort ();
169 for (int i = 0; i < 10; i++)
170 if (z[i].t != z2[i])
171 __builtin_abort ();
172 if (w[0][0].t != ~0x249249L || w[0][1].t != ~0x249249L)
173 __builtin_abort ();
174 S<2> s;
175 s.foo (1, 3L, 4L, 3, 4, 2L, 5, -1, 0);
176 for (int i = 0; i < 9; i++)
177 if (s.a[i].t != ((i < 6 && i >= 2) ? 0x55555555ULL : 0))
178 __builtin_abort ();
179 for (int i = 0; i < 4; i++)
180 for (int j = 0; j < 3; j++)
181 for (int k = 0; k < 2; k++)
182 if (a3[i][j][k].t != a2[i][j][k])
183 __builtin_abort ();
184 for (int i = 0; i < 5; i++)
185 if (y3[i].t != y2[i])
186 __builtin_abort ();
187 for (int i = 0; i < 10; i++)
188 if (s.z[i].t != z2[i])
189 __builtin_abort ();
190 if (w3[0][0].t != ~0x249249L || w3[0][1].t != ~0x249249L)
191 __builtin_abort ();
192 if (s.b[0] != 0 || s.b[1] != 0 || s.b[2] != 22
193 || s.b[3] != 84 || s.b[4] != 127)
194 __builtin_abort ();
195 }
196