Debian Codegraph @

gcc/testsuite/c-c++-common/goacc/kernels-loop-data-enter-exit-2.c

raw
1 /* { dg-additional-options "-O2" } */
2 /* { dg-additional-options "-fdump-tree-parloops1-all" } */
3 /* { dg-additional-options "-fdump-tree-optimized" } */
4 /* { dg-skip-if "requires hosted libstdc++ for stdlib malloc" { ! hostedlib } } */
5
6 #include <stdlib.h>
7
8 #define N (1024 * 512)
9 #define COUNTERTYPE unsigned int
10
11 int
12 main (void)
13 {
14 unsigned int *__restrict a;
15 unsigned int *__restrict b;
16 unsigned int *__restrict c;
17
18 a = (unsigned int *)malloc (N * sizeof (unsigned int));
19 b = (unsigned int *)malloc (N * sizeof (unsigned int));
20 c = (unsigned int *)malloc (N * sizeof (unsigned int));
21
22 #pragma acc enter data create (a[0:N])
23 #pragma acc kernels present (a[0:N])
24 {
25 for (COUNTERTYPE i = 0; i < N; i++)
26 a[i] = i * 2;
27 }
28 #pragma acc exit data copyout (a[0:N])
29
30 #pragma acc enter data create (b[0:N])
31 #pragma acc kernels present (b[0:N])
32 {
33 for (COUNTERTYPE i = 0; i < N; i++)
34 b[i] = i * 4;
35 }
36 #pragma acc exit data copyout (b[0:N])
37
38
39 #pragma acc enter data copyin (a[0:N], b[0:N]) create (c[0:N])
40 #pragma acc kernels present (a[0:N], b[0:N], c[0:N])
41 {
42 for (COUNTERTYPE ii = 0; ii < N; ii++)
43 c[ii] = a[ii] + b[ii];
44 }
45 #pragma acc exit data copyout (c[0:N])
46
47 for (COUNTERTYPE i = 0; i < N; i++)
48 if (c[i] != a[i] + b[i])
49 abort ();
50
51 free (a);
52 free (b);
53 free (c);
54
55 return 0;
56 }
57
58 /* Check that only three loops are analyzed, and that all can be
59 parallelized. */
60 /* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 3 "parloops1" } } */
61 /* { dg-final { scan-tree-dump-times "(?n)__attribute__\\(\\(oacc kernels parallelized, oacc function \\(, , \\), oacc kernels, omp target entrypoint, noclone\\)\\)" 3 "parloops1" } } */
62 /* { dg-final { scan-tree-dump-not "FAILED:" "parloops1" } } */
63
64 /* Check that the loop has been split off into a function. */
65 /* { dg-final { scan-tree-dump-times "(?n);; Function .*main._omp_fn.0" 1 "optimized" } } */
66 /* { dg-final { scan-tree-dump-times "(?n);; Function .*main._omp_fn.1" 1 "optimized" } } */
67 /* { dg-final { scan-tree-dump-times "(?n);; Function .*main._omp_fn.2" 1 "optimized" } } */