Debian Codegraph @

gcc/testsuite/c-c++-common/goacc/nested-reductions-1-kernels.c

raw
1 /* Test cases of nested 'reduction' clauses expected to compile cleanly. */
2
3 /* See also 'gfortran.dg/goacc/nested-reductions-1-kernels.f90'. */
4
5 /* { dg-additional-options -Wuninitialized } */
6
7 void acc_kernels (void)
8 {
9 int i, j, k, sum, diff;
10
11 #pragma acc kernels
12 /* implicit 'copy (sum, diff)'
13 { dg-warning {'sum' is used uninitialized} TODO { xfail *-*-* } .-2 }
14 { dg-warning {'diff' is used uninitialized} TODO { xfail *-*-* } .-3 } */
15 {
16 #pragma acc loop reduction(+:sum)
17 for (i = 0; i < 10; i++)
18 for (j = 0; j < 10; j++)
19 for (k = 0; k < 10; k++)
20 sum = 1;
21
22 #pragma acc loop collapse(2) reduction(+:sum)
23 for (i = 0; i < 10; i++)
24 for (j = 0; j < 10; j++)
25 for (k = 0; k < 10; k++)
26 sum = 1;
27
28 #pragma acc loop reduction(+:sum)
29 for (i = 0; i < 10; i++)
30 #pragma acc loop reduction(+:sum)
31 for (j = 0; j < 10; j++)
32 for (k = 0; k < 10; k++)
33 sum = 1;
34
35 #pragma acc loop reduction(+:sum)
36 for (i = 0; i < 10; i++)
37 #pragma acc loop collapse(2) reduction(+:sum)
38 for (j = 0; j < 10; j++)
39 for (k = 0; k < 10; k++)
40 sum = 1;
41
42 #pragma acc loop reduction(+:sum)
43 for (i = 0; i < 10; i++)
44 for (j = 0; j < 10; j++)
45 #pragma acc loop reduction(+:sum)
46 for (k = 0; k < 10; k++)
47 sum = 1;
48
49 #pragma acc loop reduction(+:sum)
50 for (i = 0; i < 10; i++)
51 #pragma acc loop reduction(+:sum)
52 for (j = 0; j < 10; j++)
53 #pragma acc loop reduction(+:sum)
54 for (k = 0; k < 10; k++)
55 sum = 1;
56
57 #pragma acc loop reduction(+:sum) reduction(-:diff)
58 for (i = 0; i < 10; i++)
59 {
60 #pragma acc loop reduction(+:sum)
61 for (j = 0; j < 10; j++)
62 #pragma acc loop reduction(+:sum)
63 for (k = 0; k < 10; k++)
64 sum = 1;
65
66 #pragma acc loop reduction(-:diff)
67 for (j = 0; j < 10; j++)
68 #pragma acc loop reduction(-:diff)
69 for (k = 0; k < 10; k++)
70 diff = 1;
71 }
72 }
73 }
74
75 /* The same tests as above, but using a combined kernels loop construct. */
76
77 void acc_kernels_loop (void)
78 {
79 int i, j, k, l, sum, diff;
80
81 #pragma acc kernels loop
82 /* implicit 'copy (sum, diff)'
83 { dg-warning {'sum' is used uninitialized} TODO { xfail *-*-* } .-2 }
84 { dg-warning {'diff' is used uninitialized} TODO { xfail *-*-* } .-3 } */
85 for (int h = 0; h < 10; ++h)
86 {
87 #pragma acc loop reduction(+:sum)
88 for (i = 0; i < 10; i++)
89 for (j = 0; j < 10; j++)
90 for (k = 0; k < 10; k++)
91 sum = 1;
92
93 #pragma acc loop collapse(2) reduction(+:sum)
94 for (i = 0; i < 10; i++)
95 for (j = 0; j < 10; j++)
96 for (k = 0; k < 10; k++)
97 sum = 1;
98
99 #pragma acc loop reduction(+:sum)
100 for (i = 0; i < 10; i++)
101 #pragma acc loop reduction(+:sum)
102 for (j = 0; j < 10; j++)
103 for (k = 0; k < 10; k++)
104 sum = 1;
105
106 #pragma acc loop reduction(+:sum)
107 for (i = 0; i < 10; i++)
108 #pragma acc loop collapse(2) reduction(+:sum)
109 for (j = 0; j < 10; j++)
110 for (k = 0; k < 10; k++)
111 sum = 1;
112
113 #pragma acc loop reduction(+:sum)
114 for (i = 0; i < 10; i++)
115 for (j = 0; j < 10; j++)
116 #pragma acc loop reduction(+:sum)
117 for (k = 0; k < 10; k++)
118 sum = 1;
119
120 #pragma acc loop reduction(+:sum)
121 for (i = 0; i < 10; i++)
122 #pragma acc loop reduction(+:sum) // { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } }
123 for (j = 0; j < 10; j++)
124 #pragma acc loop reduction(+:sum)
125 for (k = 0; k < 10; k++)
126 sum = 1;
127
128 #pragma acc loop reduction(+:sum) reduction(-:diff)
129 for (i = 0; i < 10; i++)
130 {
131 #pragma acc loop reduction(+:sum) // { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } }
132 for (j = 0; j < 10; j++)
133 #pragma acc loop reduction(+:sum)
134 for (k = 0; k < 10; k++)
135 sum = 1;
136
137 #pragma acc loop reduction(-:diff) // { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } }
138 for (j = 0; j < 10; j++)
139 #pragma acc loop reduction(-:diff)
140 for (k = 0; k < 10; k++)
141 diff = 1;
142 }
143 }
144 }
145
146 /* The same tests as above, but now the outermost reduction clause is on
147 the kernels region, not the outermost loop. */
148
149 void acc_kernels_reduction (void)
150 {
151 /* In contrast to the 'parallel' construct, the 'reduction' clause is not
152 supported on the 'kernels' construct. */
153 }
154
155 /* The same tests as above, but using a combined kernels loop construct, and
156 the outermost reduction clause is on that one, not the outermost loop. */
157 void acc_kernels_loop_reduction (void)
158 {
159 int i, j, k, sum, diff;
160
161 #pragma acc kernels loop reduction(+:sum)
162 /* implicit 'copy (sum, diff)'
163 { dg-warning {'sum' is used uninitialized} TODO { xfail *-*-* } .-2 }
164 { dg-warning {'diff' is used uninitialized} TODO { xfail *-*-* } .-3 } */
165 for (int h = 0; h < 10; ++h)
166 {
167 for (i = 0; i < 10; i++)
168 for (j = 0; j < 10; j++)
169 for (k = 0; k < 10; k++)
170 sum = 1;
171
172 for (i = 0; i < 10; i++)
173 #pragma acc loop
174 for (j = 0; j < 10; j++)
175 for (k = 0; k < 10; k++)
176 sum = 1;
177
178 #pragma acc loop reduction(+:sum)
179 for (i = 0; i < 10; i++)
180 for (j = 0; j < 10; j++)
181 #pragma acc loop reduction(+:sum)
182 for (k = 0; k < 10; k++)
183 sum = 1;
184
185 for (i = 0; i < 10; i++)
186 for (j = 0; j < 10; j++)
187 #pragma acc loop
188 for (k = 0; k < 10; k++)
189 sum = 1;
190
191 #pragma acc loop reduction(+:sum)
192 for (i = 0; i < 10; i++)
193 #pragma acc loop reduction(+:sum) // { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } }
194 for (j = 0; j < 10; j++)
195 #pragma acc loop reduction(+:sum)
196 for (k = 0; k < 10; k++)
197 sum = 1;
198
199 #pragma acc loop reduction(+:sum) reduction(-:diff)
200 for (i = 0; i < 10; i++)
201 {
202 #pragma acc loop reduction(+:sum) // { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } }
203 for (j = 0; j < 10; j++)
204 #pragma acc loop reduction(+:sum)
205 for (k = 0; k < 10; k++)
206 sum = 1;
207
208 #pragma acc loop reduction(-:diff) // { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } }
209 for (j = 0; j < 10; j++)
210 #pragma acc loop reduction(-:diff)
211 for (k = 0; k < 10; k++)
212 diff = 1;
213 }
214
215 #pragma acc loop reduction(+:sum)
216 for (i = 0; i < 10; i++)
217 {
218 #pragma acc loop reduction(+:sum) // { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } }
219 for (j = 0; j < 10; j++)
220 #pragma acc loop reduction(+:sum)
221 for (k = 0; k < 10; k++)
222 sum = 1;
223
224 #pragma acc loop reduction(-:diff) // { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } }
225 for (j = 0; j < 10; j++)
226 #pragma acc loop reduction(-:diff)
227 for (k = 0; k < 10; k++)
228 diff = 1;
229 }
230
231 #pragma acc loop reduction(+:sum)
232 for (i = 0; i < 10; i++)
233 {
234 #pragma acc loop reduction(+:sum) // { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } }
235 for (j = 0; j < 10; j++)
236 #pragma acc loop reduction(+:sum)
237 for (k = 0; k < 10; k++)
238 sum = 1;
239
240 #pragma acc loop // { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } }
241 for (j = 0; j < 10; j++)
242 #pragma acc loop reduction(-:diff)
243 for (k = 0; k < 10; k++)
244 diff = 1;
245 }
246 }
247 }