Debian Codegraph @

gcc/testsuite/c-c++-common/gomp/map-9.c

raw
1 /* { dg-do compile } */
2 /* { dg-additional-options "-fdump-tree-gimple" } */
3
4 #define N 1000
5
6 void
7 foo (void)
8 {
9 int a[N], b[N], c[N];
10
11 /* Should be able to parse 'present' map modifier. */
12 #pragma omp target enter data map (present, to: a, b)
13
14 #pragma omp target data map (present, to: a, b) map (always, present, from: c)
15
16 #pragma omp target map (present, to: a, b) map (present, from: c)
17 for (int i = 0; i < N; i++)
18 c[i] = a[i] + b[i];
19
20 #pragma omp target exit data map (always, present, from: c)
21
22 /* Map clauses with 'present' modifier should go ahead of those without. */
23 #pragma omp target map (to: a) map (present, to: b) map (from: c)
24 for (int i = 0; i < N; i++)
25 c[i] = a[i] + b[i];
26 }
27
28 /* { dg-final { scan-tree-dump "pragma omp target enter data map\\(force_present:b \\\[len: \[0-9\]+\\\]\\) map\\(force_present:a \\\[len: \[0-9\]+\\\]\\)" "gimple" } } */
29 /* { dg-final { scan-tree-dump "pragma omp target data map\\(force_present:b \\\[len: \[0-9\]+\\\]\\) map\\(force_present:a \\\[len: \[0-9\]+\\\]\\) map\\(always,present,from:c \\\[len: \[0-9\]+\\\]\\)" "gimple" } } */
30 /* { dg-final { scan-tree-dump "pragma omp target.*map\\(force_present:c \\\[len: \[0-9\]+\\\]\\) map\\(force_present:b \\\[len: \[0-9\]+\\\]\\) map\\(force_present:a \\\[len: \[0-9\]+\\\]\\)" "gimple" } } */
31 /* { dg-final { scan-tree-dump "pragma omp target exit data map\\(always,present,from:c \\\[len: \[0-9\]+\\\]\\)" "gimple" } } */
32 /* { dg-final { scan-tree-dump "pragma omp target.*map\\(force_present:b \\\[len: \[0-9\]+\\\]\\) map\\(from:c \\\[len: \[0-9\]+\\\]\\) map\\(to:a \\\[len: \[0-9\]+\\\]\\)" "gimple" } } */