blob: 9c6710e4e5b8689c8a5a1550ad7242a3779fd0e0 (
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
56
|
/* { dg-do run } */
#include <stdlib.h>
#include <assert.h>
int main (void)
{
int **a,i,j,n;
j = 3;
n = 12;
a = (int **) calloc (32, sizeof (int *));
for (int x = 0; x < 32; x++)
a[x] = (int *) calloc (32, sizeof (int));
for (int i = 2; i < 32; i++)
{
#pragma omp target enter data map(a, a[2:30])
#pragma omp target enter data map(a[i][j:n])
#pragma omp target map(alloc: a)
{
for (int x = j; x < j + n; x++)
a[i][x]++;
}
#pragma omp target exit data map(a[i][j:n])
#pragma omp target data map(a, a[i][j:n])
{
#pragma omp target map(alloc: a)
{
for (int x = j; x < j + n; x++)
a[i][x]++;
}
}
#pragma omp target exit data map(a, a[2:30])
#pragma omp target data map(a, a[0:32])
{
#pragma omp target map(a[i][j:n])
{
for (int x = j; x < j + n; x++)
a[i][x]++;
}
}
}
for (int i = 0; i < 32; i++)
for (int j = 0; j < 32; j++)
if (i >= 2 && j >= 3 && j < 15)
assert (a[i][j] == 3);
else
assert (a[i][j] == 0);
return 0;
}
|
