Debian Codegraph @

gcc/testsuite/c-c++-common/goacc/kernels-loop-data.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 data copyout (a[0:N], b[0:N], c[0:N])
23 {
24 #pragma acc kernels present (a[0:N])
25 {
26 for (COUNTERTYPE i = 0; i < N; i++)
27 a[i] = i * 2;
28 }
29
30 #pragma acc kernels present (b[0:N])
31 {
32 for (COUNTERTYPE i = 0; i < N; i++)
33 b[i] = i * 4;
34 }
35
36 #pragma acc kernels present (a[0:N], b[0:N], c[0:N])
37 {
38 for (COUNTERTYPE ii = 0; ii < N; ii++)
39 c[ii] = a[ii] + b[ii];
40 }
41 }
42
43 for (COUNTERTYPE i = 0; i < N; i++)
44 if (c[i] != a[i] + b[i])
45 abort ();
46
47 free (a);
48 free (b);
49 free (c);
50
51 return 0;
52 }
53
54 /* Check that only three loops are analyzed, and that all can be
55 parallelized. */
56 /* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 3 "parloops1" } } */
57 /* { dg-final { scan-tree-dump-times "(?n)__attribute__\\(\\(oacc kernels parallelized, oacc function \\(, , \\), oacc kernels, omp target entrypoint, noclone\\)\\)" 3 "parloops1" } } */
58 /* { dg-final { scan-tree-dump-not "FAILED:" "parloops1" } } */
59
60 /* Check that the loop has been split off into a function. */
61 /* { dg-final { scan-tree-dump-times "(?n);; Function .*main._omp_fn.0" 1 "optimized" } } */
62 /* { dg-final { scan-tree-dump-times "(?n);; Function .*main._omp_fn.1" 1 "optimized" } } */
63 /* { dg-final { scan-tree-dump-times "(?n);; Function .*main._omp_fn.2" 1 "optimized" } } */