Debian Codegraph @

libgomp/testsuite/libgomp.c-c++-common/ptr-attach-2.c

raw
1 #include <stdlib.h>
2
3 struct blk { int x, y; };
4 struct L
5 {
6 #define N 10
7 struct {
8 int num_blocks[N];
9 struct blk * blocks[N];
10 } m;
11 };
12
13 void foo (struct L *l)
14 {
15 for (int i = 0; i < N; i++)
16 {
17 l->m.blocks[i] = (struct blk *) malloc (sizeof (struct blk) * N);
18 l->m.num_blocks[i] = N;
19 }
20
21 #pragma omp target enter data map(to:l[:1])
22 for (int i = 0; i < N; i++)
23 {
24 #pragma omp target enter data map(to:l->m.blocks[i][:l->m.num_blocks[i]])
25 }
26
27 #pragma omp target
28 {
29 for (int i = 0; i < N; i++)
30 for (int j = 0; j < N; j++)
31 {
32 l->m.blocks[i][j].x = i + j;
33 l->m.blocks[i][j].y = i * j;
34 }
35 }
36
37 for (int i = 0; i < N; i++)
38 {
39 #pragma omp target exit data map(from:l->m.blocks[i][:l->m.num_blocks[i]])
40 }
41 #pragma omp target exit data map(from:l[:1])
42
43
44 for (int i = 0; i < N; i++)
45 for (int j = 0; j < N; j++)
46 {
47 if (l->m.blocks[i][j].x != i + j)
48 abort ();
49 if (l->m.blocks[i][j].y != i * j)
50 abort ();
51 }
52
53 }
54
55 int main (void)
56 {
57 struct L l;
58 foo (&l);
59 return 0;
60 }