blob: a336c2d9f551b576228c91d9e88cf84cd20f6857 (
plain)
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
|
/* { dg-do compile } */
/* { dg-additional-options "-fdump-tree-gimple" } */
/* { dg-skip-if "requires hosted libstdc++ for stdlib malloc" { ! hostedlib } } */
#include <stdlib.h>
#define N 10
struct S
{
int a, b;
int *ptr;
int c, d;
};
int
main (void)
{
struct S a;
a.ptr = (int *) malloc (sizeof (int) * N);
for (int i = 0; i < N; i++)
a.ptr[i] = 0;
#pragma omp target enter data map(to: a.ptr, a.ptr[:N])
#pragma omp target
for (int i = 0; i < N; i++)
a.ptr[i] += 1;
#pragma omp target update from(a.ptr[:N])
for (int i = 0; i < N; i++)
if (a.ptr[i] != 1)
abort ();
#pragma omp target map(a.ptr[:N])
for (int i = 0; i < N; i++)
a.ptr[i] += 1;
#pragma omp target update from(a.ptr[:N])
for (int i = 0; i < N; i++)
if (a.ptr[i] != 2)
abort ();
#pragma omp target exit data map(from:a.ptr, a.ptr[:N])
return 0;
}
/* { dg-final { scan-tree-dump {#pragma omp target num_teams.* map\(tofrom:a \[len: [0-9]+\] \[runtime_implicit\]\)} "gimple" } } */
/* { dg-final { scan-tree-dump {#pragma omp target num_teams.* map\(struct:a \[len: 1\]\) map\(alloc:a\.ptr \[len: [0-9]+\]\) map\(tofrom:\*_[0-9]+ \[len: [0-9]+\]\) map\(attach:a\.ptr \[bias: 0\]\)} "gimple" } } */
/* { dg-final { scan-tree-dump-not {map\(struct:a \[len: 1\]\) map\(alloc:a\.ptr \[len: 0\]\)} "gimple" } } */
|
