1 /* { dg-additional-options "-O2" } */
2 /* { dg-additional-options "-fdump-tree-parloops1-all" } */
3 /* { dg-additional-options "-fdump-tree-optimized" } */
8 #define COUNTERTYPE unsigned int
15 unsigned int *__restrict c
;
17 c
= (unsigned int *__restrict
)malloc (N
* sizeof (unsigned int));
19 for (COUNTERTYPE i
= 0; i
< N
; i
++)
22 #pragma acc kernels copy (c[0:N])
27 for (COUNTERTYPE ii
= 0; ii
< N
; ii
++)
28 c
[ii
] = c
[ii
] + ii
+ 1;
31 for (COUNTERTYPE i
= 0; i
< N
; i
++)
32 if (c
[i
] != i
* 2 + i
+ 1)
40 /* Check that only one loop is analyzed, and that it can be parallelized. */
41 /* { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 1 "parloops1" } } */
42 /* { dg-final { scan-tree-dump-times "(?n)__attribute__\\(\\(oacc kernels parallelized, oacc function \\(, , \\), oacc kernels, omp target entrypoint\\)\\)" 1 "parloops1" } } */
43 /* { dg-final { scan-tree-dump-not "FAILED:" "parloops1" } } */
45 /* Check that the loop has been split off into a function. */
46 /* { dg-final { scan-tree-dump-times "(?n);; Function .*main._omp_fn.0" 1 "optimized" } } */