Debian Codegraph @

libgomp/testsuite/libgomp.c-c++-common/baseptrs-7.c

raw
1 /* { dg-do run } */
2
3 #include <stdlib.h>
4 #include <assert.h>
5
6 int main (void)
7 {
8 int **a,i,j,n;
9
10 j = 3;
11 n = 12;
12
13 a = (int **) calloc (32, sizeof (int *));
14 for (int x = 0; x < 32; x++)
15 a[x] = (int *) calloc (32, sizeof (int));
16
17 for (int i = 2; i < 32; i++)
18 {
19 #pragma omp target enter data map(a, a[2:30])
20 #pragma omp target enter data map(a[i][j:n])
21 #pragma omp target map(alloc: a)
22 {
23 for (int x = j; x < j + n; x++)
24 a[i][x]++;
25 }
26 #pragma omp target exit data map(a[i][j:n])
27
28 #pragma omp target data map(a, a[i][j:n])
29 {
30 #pragma omp target map(alloc: a)
31 {
32 for (int x = j; x < j + n; x++)
33 a[i][x]++;
34 }
35 }
36 #pragma omp target exit data map(a, a[2:30])
37
38 #pragma omp target data map(a, a[0:32])
39 {
40 #pragma omp target map(a[i][j:n])
41 {
42 for (int x = j; x < j + n; x++)
43 a[i][x]++;
44 }
45 }
46 }
47
48 for (int i = 0; i < 32; i++)
49 for (int j = 0; j < 32; j++)
50 if (i >= 2 && j >= 3 && j < 15)
51 assert (a[i][j] == 3);
52 else
53 assert (a[i][j] == 0);
54
55 return 0;
56 }