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
73
74
75
76
77
78
79
80
81
82
83
|
/* { dg-do compile } */
#include <stdlib.h>
#include <stdio.h>
typedef struct {
int *a;
int *b;
int *c;
} mystruct;
int main(int argc, char* argv[])
{
const int N = 1024;
const int S = 32;
mystruct *m = (mystruct *) calloc (S, sizeof (*m));
int i, j;
for (i = 0; i < S; i++)
{
m[i].a = (int *) malloc (N * sizeof (int));
m[i].b = (int *) malloc (N * sizeof (int));
m[i].c = (int *) malloc (N * sizeof (int));
}
for (j = 0; j < S; j++)
for (i = 0; i < N; i++)
{
m[j].a[i] = 0;
m[j].b[i] = 0;
m[j].c[i] = 0;
}
#pragma acc enter data copyin(m[0:1])
for (int i = 0; i < 99; i++)
{
int j, k;
for (k = 0; k < S; k++)
#pragma acc parallel loop copy(m[k].a[0:N])
for (j = 0; j < N; j++)
m[k].a[j]++;
for (k = 0; k < S; k++)
#pragma acc parallel loop copy(m[k].b[0:N], m[k].c[5:N-10])
for (j = 0; j < N; j++)
{
m[k].b[j]++;
if (j > 5 && j < N - 5)
m[k].c[j]++;
}
}
#pragma acc exit data copyout(m[0:1])
for (j = 0; j < S; j++)
{
for (i = 0; i < N; i++)
{
if (m[j].a[i] != 99)
abort ();
if (m[j].b[i] != 99)
abort ();
if (i > 5 && i < N-5)
{
if (m[j].c[i] != 99)
abort ();
}
else
{
if (m[j].c[i] != 0)
abort ();
}
}
free (m[j].a);
free (m[j].b);
free (m[j].c);
}
free (m);
return 0;
}
|
