Debian Codegraph @

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