1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
#include <stdlib.h>
/* Test array slice with reference to pointer. */
typedef struct {
int *a;
int *b;
int *c;
} mystruct;
int main(int argc, char* argv[])
{
const int N = 1024;
mystruct *m = (mystruct *) malloc (sizeof (*m));
int i;
m->a = (int *) malloc (N * sizeof (int));
m->b = (int *) malloc (N * sizeof (int));
m->c = (int *) malloc (N * sizeof (int));
for (i = 0; i < N; i++)
{
m->a[i] = 0;
m->b[i] = 0;
m->c[i] = 0;
}
#pragma acc enter data copyin(m[0:1])
for (int i = 0; i < 99; i++)
{
int j;
int *&ptr = m->a;
#pragma acc parallel loop copy(ptr[0:N])
for (j = 0; j < N; j++)
ptr[j]++;
#pragma acc parallel loop copy(m->b[0:N], m->c[5:N-10])
for (j = 0; j < N; j++)
{
m->b[j]++;
if (j > 5 && j < N - 5)
m->c[j]++;
}
}
#pragma acc exit data copyout(m[0:1])
for (i = 0; i < N; i++)
{
if (m->a[i] != 99)
abort ();
if (m->b[i] != 99)
abort ();
if (i > 5 && i < N-5)
{
if (m->c[i] != 99)
abort ();
}
else
{
if (m->c[i] != 0)
abort ();
}
}
free (m->a);
free (m->b);
free (m->c);
free (m);
return 0;
}
|
