summaryrefslogtreecommitdiffstats
path: root/libgomp
diff options
context:
space:
mode:
authorjakub <jakub@138bc75d-0d04-0410-961f-82ee72b054a4>2010-12-14 13:56:25 +0000
committerjakub <jakub@138bc75d-0d04-0410-961f-82ee72b054a4>2010-12-14 13:56:25 +0000
commit23d56640c40e49695d05ff76b51b01680432bbc0 (patch)
tree5b50de920ec355e80344945e3a433b52bd6cdc9e /libgomp
parentb8a89e7e81e9f94852d36724878f1ae328a5ba85 (diff)
downloadppe42-gcc-23d56640c40e49695d05ff76b51b01680432bbc0.tar.gz
ppe42-gcc-23d56640c40e49695d05ff76b51b01680432bbc0.zip
PR fortran/46874
* trans-openmp.c (gfc_trans_omp_array_reduction): Handle allocatable dummy variables. * libgomp.fortran/allocatable6.f90: New test. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@167798 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'libgomp')
-rw-r--r--libgomp/testsuite/libgomp.fortran/allocatable6.f9045
1 files changed, 45 insertions, 0 deletions
diff --git a/libgomp/testsuite/libgomp.fortran/allocatable6.f90 b/libgomp/testsuite/libgomp.fortran/allocatable6.f90
new file mode 100644
index 00000000000..47b67aa56d0
--- /dev/null
+++ b/libgomp/testsuite/libgomp.fortran/allocatable6.f90
@@ -0,0 +1,45 @@
+! PR fortran/46874
+! { dg-do run }
+
+ interface
+ subroutine sub (a, b, c, d, n)
+ integer :: n
+ integer, allocatable :: a(:), b(:), c(:), d(:)
+ end subroutine
+ end interface
+
+ integer, allocatable :: a(:), b(:), c(:), d(:)
+ integer :: i, j
+ allocate (a(50), b(50), c(50), d(50))
+ do i = 1, 50
+ a(i) = 2 + modulo (i, 7)
+ b(i) = 179 - modulo (i, 11)
+ end do
+ c = 0
+ d = 2147483647
+ call sub (a, b, c, d, 50)
+ do i = 1, 50
+ j = 0
+ if (i .eq. 3) then
+ j = 8
+ else if (i .gt. 1 .and. i .lt. 9) then
+ j = 7
+ end if
+ if (c(i) .ne. j) call abort
+ j = 179 - modulo (i, 11)
+ if (i .gt. 1 .and. i .lt. 9) j = i
+ if (d(i) .ne. j) call abort
+ end do
+ deallocate (a, b, c, d)
+end
+
+subroutine sub (a, b, c, d, n)
+ integer :: n
+ integer, allocatable :: a(:), b(:), c(:), d(:)
+!$omp parallel do shared(a, b) reduction(+:c) reduction(min:d)
+ do i = 1, n
+ c(a(i)) = c(a(i)) + 1
+ d(i) = min(d(i), b(i))
+ d(a(i)) = min(d(a(i)), a(i))
+ end do
+end
OpenPOWER on IntegriCloud