| 1 |
/* PR middle-end/61486 */ |
| 2 |
/* { dg-do compile } */ |
| 3 |
|
| 4 |
#pragma omp declare target |
| 5 |
void dosomething (int *a, int n, int m); |
| 6 |
#pragma omp end declare target |
| 7 |
|
| 8 |
void |
| 9 |
test (int n, int o, int p, int q, int r, int s, int *pp) |
| 10 |
{ |
| 11 |
int a[o], i, j; |
| 12 |
#pragma omp target data device (n + 1) if (n != 6) map (tofrom: n, r) |
| 13 |
{ |
| 14 |
#pragma omp target device (n + 1) if (n != 6) map (from: n) map (alloc: a[2:o-2]) |
| 15 |
dosomething (a, n, 0); |
| 16 |
#pragma omp target teams device (n + 1) num_teams (n + 4) thread_limit (n * 2) \ |
| 17 |
if (n != 6)map (from: n) map (alloc: a[2:o-2]) default(shared) \ |
| 18 |
private (p) firstprivate (q) shared (n) reduction (+: r) |
| 19 |
{ |
| 20 |
r = r + 1; |
| 21 |
p = q; |
| 22 |
dosomething (a, n, p + q); |
| 23 |
} |
| 24 |
#pragma omp target teams distribute device (n + 1) num_teams (n + 4) collapse (2) \ |
| 25 |
if (n != 6)map (from: n) map (alloc: a[2:o-2]) default(shared) \ |
| 26 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 27 |
thread_limit (n * 2) dist_schedule (static, 4) |
| 28 |
for (i = 0; i < 10; i++) |
| 29 |
for (j = 0; j < 10; j++) |
| 30 |
{ |
| 31 |
r = r + 1; |
| 32 |
p = q; |
| 33 |
dosomething (a, n, p + q); |
| 34 |
} |
| 35 |
#pragma omp target teams distribute device (n + 1) num_teams (n + 4) \ |
| 36 |
if (n != 6)map (from: n) map (alloc: a[2:o-2]) default(shared) \ |
| 37 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 38 |
thread_limit (n * 2) dist_schedule (static, 4) |
| 39 |
for (i = 0; i < 10; i++) |
| 40 |
for (j = 0; j < 10; j++) |
| 41 |
{ |
| 42 |
r = r + 1; |
| 43 |
p = q; |
| 44 |
dosomething (a, n, p + q); |
| 45 |
} |
| 46 |
#pragma omp target teams distribute parallel for device (n + 1) num_teams (n + 4) \ |
| 47 |
if (n != 6)map (from: n) map (alloc: a[2:o-2]) default(shared) \ |
| 48 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 49 |
thread_limit (n * 2) dist_schedule (static, 4) collapse (2) \ |
| 50 |
num_threads (n + 4) proc_bind (spread) lastprivate (s) \ |
| 51 |
schedule (static, 8) |
| 52 |
for (i = 0; i < 10; i++) |
| 53 |
for (j = 0; j < 10; j++) |
| 54 |
{ |
| 55 |
r = r + 1; |
| 56 |
p = q; |
| 57 |
dosomething (a, n, p + q); |
| 58 |
p = q; |
| 59 |
s = i * 10 + j; |
| 60 |
} |
| 61 |
#pragma omp target teams distribute parallel for device (n + 1) num_teams (n + 4) \ |
| 62 |
if (n != 6)map (from: n) map (alloc: a[2:o-2]) default(shared) \ |
| 63 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 64 |
thread_limit (n * 2) dist_schedule (static, 4) num_threads (n + 4) \ |
| 65 |
proc_bind (master) lastprivate (s) schedule (static, 8) |
| 66 |
for (i = 0; i < 10; i++) |
| 67 |
{ |
| 68 |
for (j = 0; j < 10; j++) |
| 69 |
{ |
| 70 |
r = r + 1; |
| 71 |
p = q; |
| 72 |
dosomething (a, n, p + q); |
| 73 |
} |
| 74 |
p = q; |
| 75 |
s = i * 10; |
| 76 |
} |
| 77 |
#pragma omp target teams distribute parallel for simd device (n + 1) \ |
| 78 |
if (n != 6)map (from: n) map (alloc: a[2:o-2]) default(shared) \ |
| 79 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 80 |
thread_limit (n * 2) dist_schedule (static, 4) collapse (2) \ |
| 81 |
num_threads (n + 4) proc_bind (spread) lastprivate (s) \ |
| 82 |
schedule (static, 8) num_teams (n + 4) safelen(8) |
| 83 |
for (i = 0; i < 10; i++) |
| 84 |
for (j = 0; j < 10; j++) |
| 85 |
{ |
| 86 |
r = r + 1; |
| 87 |
p = q; |
| 88 |
a[2+i*10+j] = p + q; |
| 89 |
s = i * 10 + j; |
| 90 |
} |
| 91 |
#pragma omp target teams distribute parallel for simd device (n + 1) \ |
| 92 |
if (n != 6)map (from: n) map (alloc: a[2:o-2]) default(shared) \ |
| 93 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 94 |
thread_limit (n * 2) dist_schedule (static, 4) num_threads (n + 4) \ |
| 95 |
proc_bind (master) lastprivate (s) schedule (static, 8) \ |
| 96 |
num_teams (n + 4) safelen(16) linear(i:1) aligned (pp:4) |
| 97 |
for (i = 0; i < 10; i++) |
| 98 |
{ |
| 99 |
r = r + 1; |
| 100 |
p = q; |
| 101 |
a[2+i] = p + q; |
| 102 |
s = i * 10; |
| 103 |
} |
| 104 |
#pragma omp target teams distribute simd device (n + 1) \ |
| 105 |
if (n != 6)map (from: n) map (alloc: a[2:o-2]) default(shared) \ |
| 106 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 107 |
thread_limit (n * 2) dist_schedule (static, 4) collapse (2) \ |
| 108 |
lastprivate (s) num_teams (n + 4) safelen(8) |
| 109 |
for (i = 0; i < 10; i++) |
| 110 |
for (j = 0; j < 10; j++) |
| 111 |
{ |
| 112 |
r = r + 1; |
| 113 |
p = q; |
| 114 |
a[2+i*10+j] = p + q; |
| 115 |
s = i * 10 + j; |
| 116 |
} |
| 117 |
#pragma omp target teams distribute simd device (n + 1) \ |
| 118 |
if (n != 6)map (from: n) map (alloc: a[2:o-2]) default(shared) \ |
| 119 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 120 |
thread_limit (n * 2) dist_schedule (static, 4) lastprivate (s) \ |
| 121 |
num_teams (n + 4) safelen(16) linear(i:1) aligned (pp:4) |
| 122 |
for (i = 0; i < 10; i++) |
| 123 |
{ |
| 124 |
r = r + 1; |
| 125 |
p = q; |
| 126 |
a[2+i] = p + q; |
| 127 |
s = i * 10; |
| 128 |
} |
| 129 |
#pragma omp target device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) |
| 130 |
#pragma omp teams num_teams (n + 4) thread_limit (n * 2) default(shared) \ |
| 131 |
private (p) firstprivate (q) shared (n) reduction (+: r) |
| 132 |
{ |
| 133 |
r = r + 1; |
| 134 |
p = q; |
| 135 |
dosomething (a, n, p + q); |
| 136 |
} |
| 137 |
#pragma omp target device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) |
| 138 |
#pragma omp teams distribute num_teams (n + 4) collapse (2) default(shared) \ |
| 139 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 140 |
thread_limit (n * 2) dist_schedule (static, 4) |
| 141 |
for (i = 0; i < 10; i++) |
| 142 |
for (j = 0; j < 10; j++) |
| 143 |
{ |
| 144 |
r = r + 1; |
| 145 |
p = q; |
| 146 |
dosomething (a, n, p + q); |
| 147 |
} |
| 148 |
#pragma omp target device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) |
| 149 |
#pragma omp teams distribute num_teams (n + 4) default(shared) \ |
| 150 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 151 |
thread_limit (n * 2) dist_schedule (static, 4) |
| 152 |
for (i = 0; i < 10; i++) |
| 153 |
for (j = 0; j < 10; j++) |
| 154 |
{ |
| 155 |
r = r + 1; |
| 156 |
p = q; |
| 157 |
dosomething (a, n, p + q); |
| 158 |
} |
| 159 |
#pragma omp target device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) |
| 160 |
#pragma omp teams distribute parallel for num_teams (n + 4) if (n != 6) \ |
| 161 |
default(shared) private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 162 |
thread_limit (n * 2) dist_schedule (static, 4) collapse (2) \ |
| 163 |
num_threads (n + 4) proc_bind (spread) lastprivate (s) \ |
| 164 |
schedule (static, 8) |
| 165 |
for (i = 0; i < 10; i++) |
| 166 |
for (j = 0; j < 10; j++) |
| 167 |
{ |
| 168 |
r = r + 1; |
| 169 |
p = q; |
| 170 |
dosomething (a, n, p + q); |
| 171 |
p = q; |
| 172 |
s = i * 10 + j; |
| 173 |
} |
| 174 |
#pragma omp target device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) |
| 175 |
#pragma omp teams distribute parallel for num_teams (n + 4) if (n != 6) \ |
| 176 |
default(shared) private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 177 |
thread_limit (n * 2) dist_schedule (static, 4) num_threads (n + 4) \ |
| 178 |
proc_bind (master) lastprivate (s) schedule (static, 8) |
| 179 |
for (i = 0; i < 10; i++) |
| 180 |
{ |
| 181 |
for (j = 0; j < 10; j++) |
| 182 |
{ |
| 183 |
r = r + 1; |
| 184 |
p = q; |
| 185 |
dosomething (a, n, p + q); |
| 186 |
} |
| 187 |
p = q; |
| 188 |
s = i * 10; |
| 189 |
} |
| 190 |
#pragma omp target device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) |
| 191 |
#pragma omp teams distribute parallel for simd if (n != 6)default(shared) \ |
| 192 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 193 |
thread_limit (n * 2) dist_schedule (static, 4) collapse (2) \ |
| 194 |
num_threads (n + 4) proc_bind (spread) lastprivate (s) \ |
| 195 |
schedule (static, 8) num_teams (n + 4) safelen(8) |
| 196 |
for (i = 0; i < 10; i++) |
| 197 |
for (j = 0; j < 10; j++) |
| 198 |
{ |
| 199 |
r = r + 1; |
| 200 |
p = q; |
| 201 |
a[2+i*10+j] = p + q; |
| 202 |
s = i * 10 + j; |
| 203 |
} |
| 204 |
#pragma omp target device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) |
| 205 |
#pragma omp teams distribute parallel for simd if (n != 6)default(shared) \ |
| 206 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 207 |
thread_limit (n * 2) dist_schedule (static, 4) num_threads (n + 4) \ |
| 208 |
proc_bind (master) lastprivate (s) schedule (static, 8) \ |
| 209 |
num_teams (n + 4) safelen(16) linear(i:1) aligned (pp:4) |
| 210 |
for (i = 0; i < 10; i++) |
| 211 |
{ |
| 212 |
r = r + 1; |
| 213 |
p = q; |
| 214 |
a[2+i] = p + q; |
| 215 |
s = i * 10; |
| 216 |
} |
| 217 |
#pragma omp target device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) |
| 218 |
#pragma omp teams distribute parallel for simd if (n != 6)default(shared) \ |
| 219 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 220 |
thread_limit (n * 2) dist_schedule (static, 4) num_threads (n + 4) \ |
| 221 |
proc_bind (primary) lastprivate (s) schedule (static, 8) \ |
| 222 |
num_teams (n + 4) safelen(16) linear(i:1) aligned (pp:4) |
| 223 |
for (i = 0; i < 10; i++) |
| 224 |
{ |
| 225 |
r = r + 1; |
| 226 |
p = q; |
| 227 |
a[2+i] = p + q; |
| 228 |
s = i * 10; |
| 229 |
} |
| 230 |
#pragma omp target device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) |
| 231 |
#pragma omp teams distribute simd default(shared) \ |
| 232 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 233 |
thread_limit (n * 2) dist_schedule (static, 4) collapse (2) \ |
| 234 |
lastprivate (s) num_teams (n + 4) safelen(8) |
| 235 |
for (i = 0; i < 10; i++) |
| 236 |
for (j = 0; j < 10; j++) |
| 237 |
{ |
| 238 |
r = r + 1; |
| 239 |
p = q; |
| 240 |
a[2+i*10+j] = p + q; |
| 241 |
s = i * 10 + j; |
| 242 |
} |
| 243 |
#pragma omp target device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) |
| 244 |
#pragma omp teams distribute simd default(shared) \ |
| 245 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 246 |
thread_limit (n * 2) dist_schedule (static, 4) lastprivate (s) \ |
| 247 |
num_teams (n + 4) safelen(16) linear(i:1) aligned (pp:4) |
| 248 |
for (i = 0; i < 10; i++) |
| 249 |
{ |
| 250 |
r = r + 1; |
| 251 |
p = q; |
| 252 |
a[2+i] = p + q; |
| 253 |
s = i * 10; |
| 254 |
} |
| 255 |
#pragma omp target teams device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) \ |
| 256 |
num_teams (n + 4) thread_limit (n * 2)default(shared) shared(n) \ |
| 257 |
private (p) reduction (+: r) |
| 258 |
#pragma omp distribute collapse (2) dist_schedule (static, 4) firstprivate (q) |
| 259 |
for (i = 0; i < 10; i++) |
| 260 |
for (j = 0; j < 10; j++) |
| 261 |
{ |
| 262 |
r = r + 1; |
| 263 |
p = q; |
| 264 |
dosomething (a, n, p + q); |
| 265 |
} |
| 266 |
#pragma omp target teams device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) \ |
| 267 |
num_teams (n + 4) thread_limit (n * 2) shared(n) private(p) reduction (+ : r) \ |
| 268 |
default(shared) |
| 269 |
#pragma omp distribute dist_schedule (static, 4) firstprivate (q) |
| 270 |
for (i = 0; i < 10; i++) |
| 271 |
for (j = 0; j < 10; j++) |
| 272 |
{ |
| 273 |
r = r + 1; |
| 274 |
p = q; |
| 275 |
dosomething (a, n, p + q); |
| 276 |
} |
| 277 |
#pragma omp target teams device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) \ |
| 278 |
num_teams (n + 4) thread_limit (n * 2) |
| 279 |
#pragma omp distribute parallel for if (n != 6) \ |
| 280 |
default(shared) private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 281 |
collapse (2) dist_schedule (static, 4) \ |
| 282 |
num_threads (n + 4) proc_bind (spread) lastprivate (s) \ |
| 283 |
schedule (static, 8) |
| 284 |
for (i = 0; i < 10; i++) |
| 285 |
for (j = 0; j < 10; j++) |
| 286 |
{ |
| 287 |
r = r + 1; |
| 288 |
p = q; |
| 289 |
dosomething (a, n, p + q); |
| 290 |
p = q; |
| 291 |
s = i * 10 + j; |
| 292 |
} |
| 293 |
#pragma omp target teams device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) \ |
| 294 |
num_teams (n + 4) thread_limit (n * 2) |
| 295 |
#pragma omp distribute parallel for if (n != 6) \ |
| 296 |
default(shared) private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 297 |
num_threads (n + 4) dist_schedule (static, 4) \ |
| 298 |
proc_bind (master) lastprivate (s) schedule (static, 8) |
| 299 |
for (i = 0; i < 10; i++) |
| 300 |
{ |
| 301 |
for (j = 0; j < 10; j++) |
| 302 |
{ |
| 303 |
r = r + 1; |
| 304 |
p = q; |
| 305 |
dosomething (a, n, p + q); |
| 306 |
} |
| 307 |
p = q; |
| 308 |
s = i * 10; |
| 309 |
} |
| 310 |
#pragma omp target teams device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) \ |
| 311 |
num_teams (n + 4) thread_limit (n * 2) |
| 312 |
#pragma omp distribute parallel for simd if (n != 6)default(shared) \ |
| 313 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 314 |
collapse (2) dist_schedule (static, 4) \ |
| 315 |
num_threads (n + 4) proc_bind (spread) lastprivate (s) \ |
| 316 |
schedule (static, 8) safelen(8) |
| 317 |
for (i = 0; i < 10; i++) |
| 318 |
for (j = 0; j < 10; j++) |
| 319 |
{ |
| 320 |
r = r + 1; |
| 321 |
p = q; |
| 322 |
a[2+i*10+j] = p + q; |
| 323 |
s = i * 10 + j; |
| 324 |
} |
| 325 |
#pragma omp target teams device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) \ |
| 326 |
num_teams (n + 4) thread_limit (n * 2) |
| 327 |
#pragma omp distribute parallel for simd if (n != 6)default(shared) \ |
| 328 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 329 |
num_threads (n + 4) dist_schedule (static, 4) \ |
| 330 |
proc_bind (master) lastprivate (s) schedule (static, 8) \ |
| 331 |
safelen(16) linear(i:1) aligned (pp:4) |
| 332 |
for (i = 0; i < 10; i++) |
| 333 |
{ |
| 334 |
r = r + 1; |
| 335 |
p = q; |
| 336 |
a[2+i] = p + q; |
| 337 |
s = i * 10; |
| 338 |
} |
| 339 |
#pragma omp target teams device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) \ |
| 340 |
num_teams (n + 4) thread_limit (n * 2) default(shared) shared(n) private(p) \ |
| 341 |
reduction(+:r) |
| 342 |
#pragma omp distribute simd private (p) firstprivate (q) reduction (+: r) \ |
| 343 |
collapse (2) dist_schedule (static, 4) lastprivate (s) safelen(8) |
| 344 |
for (i = 0; i < 10; i++) |
| 345 |
for (j = 0; j < 10; j++) |
| 346 |
{ |
| 347 |
r = r + 1; |
| 348 |
p = q; |
| 349 |
a[2+i*10+j] = p + q; |
| 350 |
s = i * 10 + j; |
| 351 |
} |
| 352 |
#pragma omp target teams device (n + 1) if (n != 6)map(from:n) map(alloc:a[2:o-2]) \ |
| 353 |
num_teams (n + 4) thread_limit (n * 2) default(shared) shared(n) private(p) \ |
| 354 |
reduction(+:r) |
| 355 |
#pragma omp distribute simd private (p) firstprivate (q) reduction (+: r) \ |
| 356 |
lastprivate (s) dist_schedule (static, 4) safelen(16) linear(i:1) aligned (pp:4) |
| 357 |
for (i = 0; i < 10; i++) |
| 358 |
{ |
| 359 |
r = r + 1; |
| 360 |
p = q; |
| 361 |
a[2+i] = p + q; |
| 362 |
s = i * 10; |
| 363 |
} |
| 364 |
} |
| 365 |
} |
| 366 |
|
| 367 |
int q, i, j; |
| 368 |
|
| 369 |
#pragma omp declare target |
| 370 |
int s; |
| 371 |
|
| 372 |
void |
| 373 |
test2 (int n, int o, int p, int r, int *pp) |
| 374 |
{ |
| 375 |
int a[o]; |
| 376 |
#pragma omp distribute collapse (2) dist_schedule (static, 4) firstprivate (q) |
| 377 |
for (i = 0; i < 10; i++) |
| 378 |
for (j = 0; j < 10; j++) |
| 379 |
{ |
| 380 |
r = r + 1; |
| 381 |
p = q; |
| 382 |
dosomething (a, n, p + q); |
| 383 |
} |
| 384 |
#pragma omp distribute dist_schedule (static, 4) firstprivate (q) |
| 385 |
for (i = 0; i < 10; i++) |
| 386 |
for (j = 0; j < 10; j++) |
| 387 |
{ |
| 388 |
r = r + 1; |
| 389 |
p = q; |
| 390 |
dosomething (a, n, p + q); |
| 391 |
} |
| 392 |
#pragma omp distribute parallel for if (n != 6) \ |
| 393 |
default(shared) private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 394 |
collapse (2) dist_schedule (static, 4) \ |
| 395 |
num_threads (n + 4) proc_bind (spread) lastprivate (s) \ |
| 396 |
schedule (static, 8) |
| 397 |
for (i = 0; i < 10; i++) |
| 398 |
for (j = 0; j < 10; j++) |
| 399 |
{ |
| 400 |
r = r + 1; |
| 401 |
p = q; |
| 402 |
dosomething (a, n, p + q); |
| 403 |
p = q; |
| 404 |
s = i * 10 + j; |
| 405 |
} |
| 406 |
#pragma omp distribute parallel for if (n != 6) \ |
| 407 |
default(shared) private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 408 |
num_threads (n + 4) dist_schedule (static, 4) \ |
| 409 |
proc_bind (master) lastprivate (s) schedule (static, 8) |
| 410 |
for (i = 0; i < 10; i++) |
| 411 |
{ |
| 412 |
for (j = 0; j < 10; j++) |
| 413 |
{ |
| 414 |
r = r + 1; |
| 415 |
p = q; |
| 416 |
dosomething (a, n, p + q); |
| 417 |
} |
| 418 |
p = q; |
| 419 |
s = i * 10; |
| 420 |
} |
| 421 |
#pragma omp distribute parallel for simd if (n != 6)default(shared) \ |
| 422 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 423 |
collapse (2) dist_schedule (static, 4) \ |
| 424 |
num_threads (n + 4) proc_bind (spread) lastprivate (s) \ |
| 425 |
schedule (static, 8) safelen(8) |
| 426 |
for (i = 0; i < 10; i++) |
| 427 |
for (j = 0; j < 10; j++) |
| 428 |
{ |
| 429 |
r = r + 1; |
| 430 |
p = q; |
| 431 |
a[2+i*10+j] = p + q; |
| 432 |
s = i * 10 + j; |
| 433 |
} |
| 434 |
#pragma omp distribute parallel for simd if (n != 6)default(shared) \ |
| 435 |
private (p) firstprivate (q) shared (n) reduction (+: r) \ |
| 436 |
num_threads (n + 4) dist_schedule (static, 4) \ |
| 437 |
proc_bind (master) lastprivate (s) schedule (static, 8) \ |
| 438 |
safelen(16) linear(i:1) aligned (pp:4) |
| 439 |
for (i = 0; i < 10; i++) |
| 440 |
{ |
| 441 |
r = r + 1; |
| 442 |
p = q; |
| 443 |
a[2+i] = p + q; |
| 444 |
s = i * 10; |
| 445 |
} |
| 446 |
#pragma omp distribute simd private (p) firstprivate (q) reduction (+: r) \ |
| 447 |
collapse (2) dist_schedule (static, 4) lastprivate (s) safelen(8) |
| 448 |
for (i = 0; i < 10; i++) |
| 449 |
for (j = 0; j < 10; j++) |
| 450 |
{ |
| 451 |
r = r + 1; |
| 452 |
p = q; |
| 453 |
a[2+i*10+j] = p + q; |
| 454 |
s = i * 10 + j; |
| 455 |
} |
| 456 |
#pragma omp distribute simd private (p) firstprivate (q) reduction (+: r) \ |
| 457 |
lastprivate (s) dist_schedule (static, 4) safelen(16) linear(i:1) aligned (pp:4) |
| 458 |
for (i = 0; i < 10; i++) |
| 459 |
{ |
| 460 |
r = r + 1; |
| 461 |
p = q; |
| 462 |
a[2+i] = p + q; |
| 463 |
s = i * 10; |
| 464 |
} |
| 465 |
} |
| 466 |
#pragma omp end declare target |