1! { dg-additional-options "-O2" } 2! { dg-additional-options "-fdump-tree-parloops1-all" } 3! { dg-additional-options "-fdump-tree-optimized" } 4 5program main 6 implicit none 7 integer, parameter :: n = 1024 8 integer, dimension (0:n-1) :: a, b, c 9 integer :: i, ii 10 11 do i = 0, n - 1 12 a(i) = i * 2 13 end do 14 15 do i = 0, n -1 16 b(i) = i * 4 17 end do 18 19 !$acc kernels copyin (a(0:n-1), b(0:n-1)) copyout (c(0:n-1)) 20 do ii = 0, n - 1 21 c(ii) = a(ii) + b(ii) 22 end do 23 !$acc end kernels 24 25 do i = 0, n - 1 26 if (c(i) .ne. a(i) + b(i)) STOP 1 27 end do 28 29end program main 30 31! Check that only one loop is analyzed, and that it can be parallelized. 32! { dg-final { scan-tree-dump-times "SUCCESS: may be parallelized" 1 "parloops1" } } 33! { dg-final { scan-tree-dump-times "(?n)__attribute__\\(\\(oacc kernels parallelized, oacc function \\(, , \\), oacc kernels, omp target entrypoint\\)\\)" 1 "parloops1" } } 34! { dg-final { scan-tree-dump-not "FAILED:" "parloops1" } } 35 36! Check that the loop has been split off into a function. 37! { dg-final { scan-tree-dump-times "(?n);; Function MAIN__._omp_fn.0 " 1 "optimized" } } 38