| 1 |
/* PR middle-end/111017 */ |
| 2 |
|
| 3 |
#include <omp.h> |
| 4 |
|
| 5 |
#define DIM 32 |
| 6 |
#define N (DIM*DIM) |
| 7 |
|
| 8 |
int |
| 9 |
main () |
| 10 |
{ |
| 11 |
int a[N], b[N], c[N]; |
| 12 |
int dim = DIM; |
| 13 |
|
| 14 |
for (int i = 0; i < N; i++) |
| 15 |
{ |
| 16 |
a[i] = 3*i; |
| 17 |
b[i] = 7*i; |
| 18 |
c[i] = 42; |
| 19 |
} |
| 20 |
|
| 21 |
#pragma omp parallel for collapse(2) |
| 22 |
for (int i = 0; i < DIM; i++) |
| 23 |
for (int j = (i*DIM); j < (i*DIM + DIM); j++) |
| 24 |
c[j] = a[j] + b[j]; |
| 25 |
|
| 26 |
for (int i = 0; i < DIM; i++) |
| 27 |
for (int j = (i*DIM); j < (i*DIM + DIM); j++) |
| 28 |
if (c[j] != a[j] + b[j] || c[j] != 3*j +7*j) |
| 29 |
__builtin_abort (); |
| 30 |
for (int i = 0; i < N; i++) |
| 31 |
c[i] = 42; |
| 32 |
|
| 33 |
#pragma omp parallel for collapse(2) |
| 34 |
for (int i = 0; i < dim; i++) |
| 35 |
for (int j = (i*dim); j < (i*dim + dim); j++) |
| 36 |
c[j] = a[j] + b[j]; |
| 37 |
|
| 38 |
for (int i = 0; i < DIM; i++) |
| 39 |
for (int j = (i*DIM); j < (i*DIM + DIM); j++) |
| 40 |
if (c[j] != a[j] + b[j] || c[j] != 3*j +7*j) |
| 41 |
__builtin_abort (); |
| 42 |
for (int i = 0; i < N; i++) |
| 43 |
c[i] = 42; |
| 44 |
|
| 45 |
for (int dev = 0; dev <= omp_get_num_devices(); dev++) |
| 46 |
{ |
| 47 |
#pragma omp target teams loop device(dev) map(to:a,b) map(from:c) |
| 48 |
for (int i = 0; i < DIM; i++) |
| 49 |
for (int j = (i*DIM); j < (i*DIM + DIM); j++) |
| 50 |
c[j] = a[j] + b[j]; |
| 51 |
|
| 52 |
for (int i = 0; i < DIM; i++) |
| 53 |
for (int j = (i*DIM); j < (i*DIM + DIM); j++) |
| 54 |
if (c[j] != a[j] + b[j] || c[j] != 3*j +7*j) |
| 55 |
__builtin_abort (); |
| 56 |
for (int i = 0; i < N; i++) |
| 57 |
c[i] = 42; |
| 58 |
|
| 59 |
#pragma omp target teams loop device(dev) map(to:a,b) map(from:c) |
| 60 |
for (int i = 0; i < dim; i++) |
| 61 |
for (int j = (i*dim); j < (i*dim + dim); j++) |
| 62 |
c[j] = a[j] + b[j]; |
| 63 |
|
| 64 |
for (int i = 0; i < DIM; i++) |
| 65 |
for (int j = (i*DIM); j < (i*DIM + DIM); j++) |
| 66 |
if (c[j] != a[j] + b[j] || c[j] != 3*j +7*j) |
| 67 |
__builtin_abort (); |
| 68 |
for (int i = 0; i < N; i++) |
| 69 |
c[i] = 42; |
| 70 |
} |
| 71 |
return 0; |
| 72 |
} |