| 1 |
/* Test cases of nested 'reduction' clauses expected to compile cleanly. */ |
| 2 |
|
| 3 |
/* See also 'gfortran.dg/goacc/nested-reductions-1-serial.f90'. */ |
| 4 |
|
| 5 |
/* { dg-additional-options -Wuninitialized } */ |
| 6 |
|
| 7 |
void acc_serial (void) |
| 8 |
{ |
| 9 |
int i, j, k, sum, diff; |
| 10 |
|
| 11 |
#pragma acc serial |
| 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 serial loop construct. */ |
| 76 |
|
| 77 |
void acc_serial_loop (void) |
| 78 |
{ |
| 79 |
int i, j, k, l, sum, diff; |
| 80 |
|
| 81 |
#pragma acc serial 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" } |
| 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" } |
| 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" } |
| 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 serial region, not the outermost loop. */ |
| 148 |
|
| 149 |
void acc_serial_reduction (void) |
| 150 |
{ |
| 151 |
int i, j, k, sum, diff; |
| 152 |
|
| 153 |
#pragma acc serial reduction(+:sum) |
| 154 |
/* implicit 'copy (sum, diff)' |
| 155 |
{ dg-warning {'sum' is used uninitialized} TODO { xfail *-*-* } .-2 } |
| 156 |
{ dg-warning {'diff' is used uninitialized} TODO { xfail *-*-* } .-3 } */ |
| 157 |
{ |
| 158 |
for (i = 0; i < 10; i++) |
| 159 |
for (j = 0; j < 10; j++) |
| 160 |
for (k = 0; k < 10; k++) |
| 161 |
sum = 1; |
| 162 |
|
| 163 |
for (i = 0; i < 10; i++) |
| 164 |
#pragma acc loop |
| 165 |
for (j = 0; j < 10; j++) |
| 166 |
for (k = 0; k < 10; k++) |
| 167 |
sum = 1; |
| 168 |
|
| 169 |
#pragma acc loop reduction(+:sum) |
| 170 |
for (i = 0; i < 10; i++) |
| 171 |
for (j = 0; j < 10; j++) |
| 172 |
#pragma acc loop reduction(+:sum) |
| 173 |
for (k = 0; k < 10; k++) |
| 174 |
sum = 1; |
| 175 |
|
| 176 |
for (i = 0; i < 10; i++) |
| 177 |
for (j = 0; j < 10; j++) |
| 178 |
#pragma acc loop |
| 179 |
for (k = 0; k < 10; k++) |
| 180 |
sum = 1; |
| 181 |
|
| 182 |
#pragma acc loop reduction(+:sum) |
| 183 |
for (i = 0; i < 10; i++) |
| 184 |
#pragma acc loop reduction(+:sum) |
| 185 |
for (j = 0; j < 10; j++) |
| 186 |
#pragma acc loop reduction(+:sum) |
| 187 |
for (k = 0; k < 10; k++) |
| 188 |
sum = 1; |
| 189 |
|
| 190 |
#pragma acc loop reduction(+:sum) reduction(-:diff) |
| 191 |
for (i = 0; i < 10; i++) |
| 192 |
{ |
| 193 |
#pragma acc loop reduction(+:sum) |
| 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(-:diff) |
| 200 |
for (j = 0; j < 10; j++) |
| 201 |
#pragma acc loop reduction(-:diff) |
| 202 |
for (k = 0; k < 10; k++) |
| 203 |
diff = 1; |
| 204 |
} |
| 205 |
|
| 206 |
#pragma acc loop reduction(+:sum) |
| 207 |
for (i = 0; i < 10; i++) |
| 208 |
{ |
| 209 |
#pragma acc loop reduction(+:sum) |
| 210 |
for (j = 0; j < 10; j++) |
| 211 |
#pragma acc loop reduction(+:sum) |
| 212 |
for (k = 0; k < 10; k++) |
| 213 |
sum = 1; |
| 214 |
|
| 215 |
#pragma acc loop reduction(-:diff) |
| 216 |
for (j = 0; j < 10; j++) |
| 217 |
#pragma acc loop reduction(-:diff) |
| 218 |
for (k = 0; k < 10; k++) |
| 219 |
diff = 1; |
| 220 |
} |
| 221 |
|
| 222 |
#pragma acc loop reduction(+:sum) |
| 223 |
for (i = 0; i < 10; i++) |
| 224 |
{ |
| 225 |
#pragma acc loop reduction(+:sum) |
| 226 |
for (j = 0; j < 10; j++) |
| 227 |
#pragma acc loop reduction(+:sum) |
| 228 |
for (k = 0; k < 10; k++) |
| 229 |
sum = 1; |
| 230 |
|
| 231 |
#pragma acc loop |
| 232 |
for (j = 0; j < 10; j++) |
| 233 |
#pragma acc loop reduction(-:diff) |
| 234 |
for (k = 0; k < 10; k++) |
| 235 |
diff = 1; |
| 236 |
} |
| 237 |
} |
| 238 |
} |
| 239 |
|
| 240 |
/* The same tests as above, but using a combined serial loop construct, and |
| 241 |
the outermost reduction clause is on that one, not the outermost loop. */ |
| 242 |
void acc_serial_loop_reduction (void) |
| 243 |
{ |
| 244 |
int i, j, k, sum, diff; |
| 245 |
|
| 246 |
#pragma acc serial loop reduction(+:sum) |
| 247 |
/* implicit 'copy (sum, diff)' |
| 248 |
{ dg-warning {'sum' is used uninitialized} TODO { xfail *-*-* } .-2 } |
| 249 |
{ dg-warning {'diff' is used uninitialized} TODO { xfail *-*-* } .-3 } */ |
| 250 |
for (int h = 0; h < 10; ++h) |
| 251 |
{ |
| 252 |
for (i = 0; i < 10; i++) |
| 253 |
for (j = 0; j < 10; j++) |
| 254 |
for (k = 0; k < 10; k++) |
| 255 |
sum = 1; |
| 256 |
|
| 257 |
for (i = 0; i < 10; i++) |
| 258 |
#pragma acc loop |
| 259 |
for (j = 0; j < 10; j++) |
| 260 |
for (k = 0; k < 10; k++) |
| 261 |
sum = 1; |
| 262 |
|
| 263 |
#pragma acc loop reduction(+:sum) |
| 264 |
for (i = 0; i < 10; i++) |
| 265 |
for (j = 0; j < 10; j++) |
| 266 |
#pragma acc loop reduction(+:sum) |
| 267 |
for (k = 0; k < 10; k++) |
| 268 |
sum = 1; |
| 269 |
|
| 270 |
for (i = 0; i < 10; i++) |
| 271 |
for (j = 0; j < 10; j++) |
| 272 |
#pragma acc loop |
| 273 |
for (k = 0; k < 10; k++) |
| 274 |
sum = 1; |
| 275 |
|
| 276 |
#pragma acc loop reduction(+:sum) |
| 277 |
for (i = 0; i < 10; i++) |
| 278 |
#pragma acc loop reduction(+:sum) // { dg-warning "insufficient partitioning available to parallelize loop" } |
| 279 |
for (j = 0; j < 10; j++) |
| 280 |
#pragma acc loop reduction(+:sum) |
| 281 |
for (k = 0; k < 10; k++) |
| 282 |
sum = 1; |
| 283 |
|
| 284 |
#pragma acc loop reduction(+:sum) reduction(-:diff) |
| 285 |
for (i = 0; i < 10; i++) |
| 286 |
{ |
| 287 |
#pragma acc loop reduction(+:sum) // { dg-warning "insufficient partitioning available to parallelize loop" } |
| 288 |
for (j = 0; j < 10; j++) |
| 289 |
#pragma acc loop reduction(+:sum) |
| 290 |
for (k = 0; k < 10; k++) |
| 291 |
sum = 1; |
| 292 |
|
| 293 |
#pragma acc loop reduction(-:diff) // { dg-warning "insufficient partitioning available to parallelize loop" } |
| 294 |
for (j = 0; j < 10; j++) |
| 295 |
#pragma acc loop reduction(-:diff) |
| 296 |
for (k = 0; k < 10; k++) |
| 297 |
diff = 1; |
| 298 |
} |
| 299 |
|
| 300 |
#pragma acc loop reduction(+:sum) |
| 301 |
for (i = 0; i < 10; i++) |
| 302 |
{ |
| 303 |
#pragma acc loop reduction(+:sum) // { dg-warning "insufficient partitioning available to parallelize loop" } |
| 304 |
for (j = 0; j < 10; j++) |
| 305 |
#pragma acc loop reduction(+:sum) |
| 306 |
for (k = 0; k < 10; k++) |
| 307 |
sum = 1; |
| 308 |
|
| 309 |
#pragma acc loop reduction(-:diff) // { dg-warning "insufficient partitioning available to parallelize loop" } |
| 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 |
#pragma acc loop reduction(+:sum) |
| 317 |
for (i = 0; i < 10; i++) |
| 318 |
{ |
| 319 |
#pragma acc loop reduction(+:sum) // { dg-warning "insufficient partitioning available to parallelize loop" } |
| 320 |
for (j = 0; j < 10; j++) |
| 321 |
#pragma acc loop reduction(+:sum) |
| 322 |
for (k = 0; k < 10; k++) |
| 323 |
sum = 1; |
| 324 |
|
| 325 |
#pragma acc loop // { dg-warning "insufficient partitioning available to parallelize loop" } |
| 326 |
for (j = 0; j < 10; j++) |
| 327 |
#pragma acc loop reduction(-:diff) |
| 328 |
for (k = 0; k < 10; k++) |
| 329 |
diff = 1; |
| 330 |
} |
| 331 |
} |
| 332 |
} |