|
111
|
1 /* { dg-additional-options "-O2" } */
|
|
|
2 /* { dg-additional-options "-fdump-tree-parloops1-all" } */
|
|
|
3 /* { dg-additional-options "-fdump-tree-optimized" } */
|
|
|
4
|
|
|
5 #include <stdlib.h>
|
|
|
6
|
|
|
7 #define N (1024 * 512)
|
|
|
8 #define COUNTERTYPE unsigned int
|
|
|
9
|
|
|
10 int
|
|
|
11 main (void)
|
|
|
12 {
|
|
|
13 unsigned int *__restrict a;
|
|
|
14 unsigned int *__restrict b;
|
|
|
15 unsigned int *__restrict c;
|
|
|
16 COUNTERTYPE i;
|
|
|
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 (i = 0; i < N; i++)
|
|
|
23 a[i] = i * 2;
|
|
|
24
|
|
|
25 for (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 for (i = 0; i < N; i++)
|
|
|
31 c[i] = a[i] + b[i];
|
|
|
32 }
|
|
|
33
|
|
|
34 for (i = 0; i < N; i++)
|
|
|
35 if (c[i] != a[i] + b[i])
|
|
|
36 abort ();
|
|
|
37
|
|
|
38 free (a);
|
|
|
39 free (b);
|
|
|
40 free (c);
|
|
|
41
|
|
|
42 return 0;
|
|
|
43 }
|
|
|
44
|
|
|
45 /* Check that only one loop is analyzed, and that it can be parallelized. */
|
|
|
46 /* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 1 "parloops1" } } */
|
|
|
47 /* { dg-final { scan-tree-dump-times "(?n)__attribute__\\(\\(oacc kernels parallelized, oacc function \\(, , \\), oacc kernels, omp target entrypoint\\)\\)" 1 "parloops1" } } */
|
|
|
48 /* { dg-final { scan-tree-dump-not "FAILED:" "parloops1" } } */
|
|
|
49
|
|
|
50 /* Check that the loop has been split off into a function. */
|
|
|
51 /* { dg-final { scan-tree-dump-times "(?n);; Function .*main._omp_fn.0" 1 "optimized" } } */
|
