blob: 0fdc6c2c05e406b513871f3463c67e2d08ddbbf5 (
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
|
/* { dg-do compile } */
/* { dg-additional-options "-fdump-tree-gimple" } */
#ifdef __cplusplus
extern "C"
#else
extern
#endif
void abort (void);
int
main (void)
{
#define N 5
int array[N][N];
for (int i = 0; i < N; i++)
{
#pragma omp target enter data map(alloc: array[i:1][0:N])
#pragma omp target
for (int j = 0; j < N; j++)
array[i][j] = i * 10 + j;
#pragma omp target exit data map(from: array[i:1][0:N])
}
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
if (array[i][j] != i + j)
abort ();
return 0;
}
/* { dg-final { scan-tree-dump {#pragma omp target enter data map\(alloc:array\[[^]]+\]\[0\] \[len: [0-9]+\]\)} "gimple" } } */
/* { dg-final { scan-tree-dump {#pragma omp target num_teams.* firstprivate\(i\) map\(tofrom:array \[len: [0-9]+\] \[runtime_implicit\]\)} "gimple" } } */
/* { dg-final { scan-tree-dump {#pragma omp target exit data map\(from:array\[[^]]+\]\[0\] \[len: [0-9]+\]\)} "gimple" } } */
|
