| 1 |
/* Test erroneous cases of nested 'reduction' clauses. */ |
| 2 |
|
| 3 |
/* See also 'gfortran.dg/goacc/nested-reductions-2-kernels.f90'. */ |
| 4 |
|
| 5 |
/* { dg-additional-options -Wuninitialized } */ |
| 6 |
|
| 7 |
void acc_kernels (void) |
| 8 |
{ |
| 9 |
int i, j, k, l, 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 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 19 |
for (j = 0; j < 10; j++) |
| 20 |
#pragma acc loop reduction(+:sum) |
| 21 |
for (k = 0; k < 10; k++) |
| 22 |
sum = 1; |
| 23 |
|
| 24 |
#pragma acc loop reduction(+:sum) |
| 25 |
for (i = 0; i < 10; i++) |
| 26 |
#pragma acc loop collapse(2) // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 27 |
for (j = 0; j < 10; j++) |
| 28 |
for (k = 0; k < 10; k++) |
| 29 |
#pragma acc loop reduction(+:sum) |
| 30 |
for (l = 0; l < 10; l++) |
| 31 |
sum = 1; |
| 32 |
|
| 33 |
#pragma acc loop reduction(+:sum) |
| 34 |
for (i = 0; i < 10; i++) |
| 35 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 36 |
for (j = 0; j < 10; j++) |
| 37 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 38 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 39 |
for (k = 0; k < 10; k++) |
| 40 |
#pragma acc loop reduction(+:sum) |
| 41 |
for (l = 0; l < 10; l++) |
| 42 |
sum = 1; |
| 43 |
|
| 44 |
#pragma acc loop reduction(+:sum) |
| 45 |
for (i = 0; i < 10; i++) |
| 46 |
#pragma acc loop reduction(-:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 47 |
for (j = 0; j < 10; j++) |
| 48 |
#pragma acc loop reduction(+:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 49 |
for (k = 0; k < 10; k++) |
| 50 |
sum = 1; |
| 51 |
|
| 52 |
#pragma acc loop reduction(+:sum) |
| 53 |
for (i = 0; i < 10; i++) |
| 54 |
#pragma acc loop reduction(-:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 55 |
for (j = 0; j < 10; j++) |
| 56 |
#pragma acc loop reduction(-:sum) |
| 57 |
for (k = 0; k < 10; k++) |
| 58 |
sum = 1; |
| 59 |
|
| 60 |
#pragma acc loop reduction(+:sum) |
| 61 |
for (i = 0; i < 10; i++) |
| 62 |
#pragma acc loop reduction(-:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 63 |
for (j = 0; j < 10; j++) |
| 64 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 65 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 66 |
for (k = 0; k < 10; k++) |
| 67 |
#pragma acc loop reduction(*:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 68 |
for (l = 0; l < 10; l++) |
| 69 |
sum = 1; |
| 70 |
|
| 71 |
#pragma acc loop reduction(+:sum) |
| 72 |
for (i = 0; i < 10; i++) |
| 73 |
#pragma acc loop reduction(-:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 74 |
for (j = 0; j < 10; j++) |
| 75 |
#pragma acc loop reduction(+:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 76 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 77 |
for (k = 0; k < 10; k++) |
| 78 |
#pragma acc loop reduction(*:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 79 |
for (l = 0; l < 10; l++) |
| 80 |
sum = 1; |
| 81 |
|
| 82 |
#pragma acc loop reduction(+:sum) reduction(-:diff) |
| 83 |
for (i = 0; i < 10; i++) |
| 84 |
{ |
| 85 |
#pragma acc loop reduction(-:diff) // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 86 |
for (j = 0; j < 10; j++) |
| 87 |
#pragma acc loop reduction(+:sum) |
| 88 |
for (k = 0; k < 10; k++) |
| 89 |
sum = 1; |
| 90 |
|
| 91 |
#pragma acc loop reduction(+:sum) // { dg-warning "nested loop in reduction needs reduction clause for .diff." } |
| 92 |
for (j = 0; j < 10; j++) |
| 93 |
#pragma acc loop reduction(-:diff) |
| 94 |
for (k = 0; k < 10; k++) |
| 95 |
diff = 1; |
| 96 |
} |
| 97 |
} |
| 98 |
} |
| 99 |
|
| 100 |
/* The same tests as above, but using a combined kernels loop construct. */ |
| 101 |
|
| 102 |
void acc_kernels_loop (void) |
| 103 |
{ |
| 104 |
int i, j, k, l, sum, diff; |
| 105 |
|
| 106 |
#pragma acc kernels loop |
| 107 |
/* implicit 'copy (sum, diff)' |
| 108 |
{ dg-warning {'sum' is used uninitialized} TODO { xfail *-*-* } .-2 } |
| 109 |
{ dg-warning {'diff' is used uninitialized} TODO { xfail *-*-* } .-3 } */ |
| 110 |
for (int h = 0; h < 10; ++h) |
| 111 |
{ |
| 112 |
#pragma acc loop reduction(+:sum) |
| 113 |
for (i = 0; i < 10; i++) |
| 114 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 115 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 116 |
for (j = 0; j < 10; j++) |
| 117 |
#pragma acc loop reduction(+:sum) |
| 118 |
for (k = 0; k < 10; k++) |
| 119 |
sum = 1; |
| 120 |
|
| 121 |
#pragma acc loop reduction(+:sum) |
| 122 |
for (i = 0; i < 10; i++) |
| 123 |
#pragma acc loop collapse(2) // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 124 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 125 |
for (j = 0; j < 10; j++) |
| 126 |
for (k = 0; k < 10; k++) |
| 127 |
#pragma acc loop reduction(+:sum) |
| 128 |
for (l = 0; l < 10; l++) |
| 129 |
sum = 1; |
| 130 |
|
| 131 |
#pragma acc loop reduction(+:sum) |
| 132 |
for (i = 0; i < 10; i++) |
| 133 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 134 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 135 |
for (j = 0; j < 10; j++) |
| 136 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 137 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 138 |
for (k = 0; k < 10; k++) |
| 139 |
#pragma acc loop reduction(+:sum) |
| 140 |
for (l = 0; l < 10; l++) |
| 141 |
sum = 1; |
| 142 |
|
| 143 |
#pragma acc loop reduction(+:sum) |
| 144 |
for (i = 0; i < 10; i++) |
| 145 |
#pragma acc loop reduction(-:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 146 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 147 |
for (j = 0; j < 10; j++) |
| 148 |
#pragma acc loop reduction(+:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 149 |
for (k = 0; k < 10; k++) |
| 150 |
sum = 1; |
| 151 |
|
| 152 |
#pragma acc loop reduction(+:sum) |
| 153 |
for (i = 0; i < 10; i++) |
| 154 |
#pragma acc loop reduction(-:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 155 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 156 |
for (j = 0; j < 10; j++) |
| 157 |
#pragma acc loop reduction(-:sum) |
| 158 |
for (k = 0; k < 10; k++) |
| 159 |
sum = 1; |
| 160 |
|
| 161 |
#pragma acc loop reduction(+:sum) |
| 162 |
for (i = 0; i < 10; i++) |
| 163 |
#pragma acc loop reduction(-:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 164 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 165 |
for (j = 0; j < 10; j++) |
| 166 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 167 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 168 |
for (k = 0; k < 10; k++) |
| 169 |
#pragma acc loop reduction(*:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 170 |
for (l = 0; l < 10; l++) |
| 171 |
sum = 1; |
| 172 |
|
| 173 |
#pragma acc loop reduction(+:sum) |
| 174 |
for (i = 0; i < 10; i++) |
| 175 |
#pragma acc loop reduction(-:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 176 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 177 |
for (j = 0; j < 10; j++) |
| 178 |
#pragma acc loop reduction(+:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 179 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 180 |
for (k = 0; k < 10; k++) |
| 181 |
#pragma acc loop reduction(*:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 182 |
for (l = 0; l < 10; l++) |
| 183 |
sum = 1; |
| 184 |
|
| 185 |
#pragma acc loop reduction(+:sum) reduction(-:diff) |
| 186 |
for (i = 0; i < 10; i++) |
| 187 |
{ |
| 188 |
#pragma acc loop reduction(-:diff) // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 189 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 190 |
for (j = 0; j < 10; j++) |
| 191 |
#pragma acc loop reduction(+:sum) |
| 192 |
for (k = 0; k < 10; k++) |
| 193 |
sum = 1; |
| 194 |
|
| 195 |
#pragma acc loop reduction(+:sum) // { dg-warning "nested loop in reduction needs reduction clause for .diff." } |
| 196 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 197 |
for (j = 0; j < 10; j++) |
| 198 |
#pragma acc loop reduction(-:diff) |
| 199 |
for (k = 0; k < 10; k++) |
| 200 |
diff = 1; |
| 201 |
} |
| 202 |
} |
| 203 |
} |
| 204 |
|
| 205 |
/* The same tests as above, but now the outermost reduction clause is on |
| 206 |
the kernels region, not the outermost loop. */ |
| 207 |
void acc_kernels_reduction (void) |
| 208 |
{ |
| 209 |
/* In contrast to the 'parallel' construct, the 'reduction' clause is not |
| 210 |
supported on the 'kernels' construct. */ |
| 211 |
} |
| 212 |
|
| 213 |
/* The same tests as above, but using a combined kernels loop construct, and |
| 214 |
the outermost reduction clause is on that one, not the outermost loop. */ |
| 215 |
void acc_kernels_loop_reduction (void) |
| 216 |
{ |
| 217 |
int i, j, k, l, sum, diff; |
| 218 |
|
| 219 |
#pragma acc kernels loop reduction(+:sum) |
| 220 |
/* implicit 'copy (sum, diff)' |
| 221 |
{ dg-warning {'sum' is used uninitialized} TODO { xfail *-*-* } .-2 } |
| 222 |
{ dg-warning {'diff' is used uninitialized} TODO { xfail *-*-* } .-3 } */ |
| 223 |
for (int h = 0; h < 10; ++h) |
| 224 |
{ |
| 225 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 226 |
for (i = 0; i < 10; i++) |
| 227 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 228 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 229 |
for (j = 0; j < 10; j++) |
| 230 |
#pragma acc loop reduction(+:sum) |
| 231 |
for (k = 0; k < 10; k++) |
| 232 |
sum = 1; |
| 233 |
|
| 234 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 235 |
for (i = 0; i < 10; i++) |
| 236 |
#pragma acc loop collapse(2) // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 237 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 238 |
for (j = 0; j < 10; j++) |
| 239 |
for (k = 0; k < 10; k++) |
| 240 |
#pragma acc loop reduction(+:sum) |
| 241 |
for (l = 0; l < 10; l++) |
| 242 |
sum = 1; |
| 243 |
|
| 244 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 245 |
for (i = 0; i < 10; i++) |
| 246 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 247 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 248 |
for (j = 0; j < 10; j++) |
| 249 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 250 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 251 |
for (k = 0; k < 10; k++) |
| 252 |
#pragma acc loop reduction(+:sum) |
| 253 |
for (l = 0; l < 10; l++) |
| 254 |
sum = 1; |
| 255 |
|
| 256 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 257 |
for (i = 0; i < 10; i++) |
| 258 |
#pragma acc loop reduction(-:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 259 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 260 |
for (j = 0; j < 10; j++) |
| 261 |
#pragma acc loop reduction(+:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 262 |
for (k = 0; k < 10; k++) |
| 263 |
sum = 1; |
| 264 |
|
| 265 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 266 |
for (i = 0; i < 10; i++) |
| 267 |
#pragma acc loop reduction(-:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 268 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 269 |
for (j = 0; j < 10; j++) |
| 270 |
#pragma acc loop reduction(-:sum) |
| 271 |
for (k = 0; k < 10; k++) |
| 272 |
sum = 1; |
| 273 |
|
| 274 |
#pragma acc loop reduction(max:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 275 |
for (i = 0; i < 10; i++) |
| 276 |
#pragma acc loop reduction(-:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 277 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 278 |
for (j = 0; j < 10; j++) |
| 279 |
#pragma acc loop // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 280 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 281 |
for (k = 0; k < 10; k++) |
| 282 |
#pragma acc loop reduction(*:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 283 |
for (l = 0; l < 10; l++) |
| 284 |
sum = 1; |
| 285 |
|
| 286 |
#pragma acc loop reduction(max:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 287 |
for (i = 0; i < 10; i++) |
| 288 |
#pragma acc loop reduction(-:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 289 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 290 |
for (j = 0; j < 10; j++) |
| 291 |
#pragma acc loop reduction(+:sum) // { dg-warning "conflicting reduction operations for .sum." }) |
| 292 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 293 |
for (k = 0; k < 10; k++) |
| 294 |
#pragma acc loop reduction(*:sum) // { dg-warning "conflicting reduction operations for .sum." } |
| 295 |
for (l = 0; l < 10; l++) |
| 296 |
sum = 1; |
| 297 |
|
| 298 |
#pragma acc loop reduction(-:diff) // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 299 |
for (i = 0; i < 10; i++) |
| 300 |
{ |
| 301 |
#pragma acc loop reduction(-:diff) // { dg-warning "nested loop in reduction needs reduction clause for .sum." } |
| 302 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 303 |
for (j = 0; j < 10; j++) |
| 304 |
#pragma acc loop reduction(+:sum) |
| 305 |
for (k = 0; k < 10; k++) |
| 306 |
sum = 1; |
| 307 |
|
| 308 |
#pragma acc loop reduction(+:sum) // { dg-warning "nested loop in reduction needs reduction clause for .diff." } |
| 309 |
// { dg-warning "insufficient partitioning available to parallelize loop" "TODO" { xfail *-*-* } .-1 } |
| 310 |
for (j = 0; j < 10; j++) |
| 311 |
#pragma acc loop reduction(-:diff) |
| 312 |
for (k = 0; k < 10; k++) |
| 313 |
diff = 1; |
| 314 |
} |
| 315 |
} |
| 316 |
} |