From 554fd8c5195424bdbcabf5de30fdc183aba391bd Mon Sep 17 00:00:00 2001
From: upstream source tree <ports@midipix.org>
Date: Sun, 15 Mar 2015 20:14:05 -0400
Subject: obtained gcc-4.6.4.tar.bz2 from upstream website; verified
 gcc-4.6.4.tar.bz2.sig; imported gcc-4.6.4 source tree from verified upstream
 tarball.

downloading a git-generated archive based on the 'upstream' tag
should provide you with a source tree that is binary identical
to the one extracted from the above tarball.

if you have obtained the source via the command 'git clone',
however, do note that line-endings of files in your working
directory might differ from line-endings of the respective
files in the upstream repository.
---
 libgomp/testsuite/libgomp.fortran/do2.f90 | 366 ++++++++++++++++++++++++++++++
 1 file changed, 366 insertions(+)
 create mode 100644 libgomp/testsuite/libgomp.fortran/do2.f90

(limited to 'libgomp/testsuite/libgomp.fortran/do2.f90')

diff --git a/libgomp/testsuite/libgomp.fortran/do2.f90 b/libgomp/testsuite/libgomp.fortran/do2.f90
new file mode 100644
index 000000000..b90ccddd8
--- /dev/null
+++ b/libgomp/testsuite/libgomp.fortran/do2.f90
@@ -0,0 +1,366 @@
+! { dg-do run }
+
+  integer, dimension (128) :: a, b
+  integer :: i, j
+  logical :: k
+  a = -1
+  b = -1
+  do i = 1, 128
+    if (i .ge. 8 .and. i .le. 15) then
+      b(i) = 1 * 256 + i
+    else if (i .ge. 19 .and. i .le. 23) then
+      b(i) = 2 * 256 + i
+    else if (i .ge. 28 .and. i .le. 38) then
+      if (iand (i, 1) .eq. 0) b(i) = 3 * 256 + i
+    else if (i .ge. 59 .and. i .le. 79) then
+      if (iand (i - 59, 3) .eq. 0) b(i) = 4 * 256 + i
+    else if (i .ge. 101 .and. i .le. 125) then
+      if (mod (i - 101, 12) .eq. 0) b(i) = 5 * 256 + i
+    end if
+  end do
+
+  k = .false.
+  j = 8
+!$omp parallel num_threads (4)
+
+!$omp do ordered
+  do i = 8, 15
+    a(i) = 1 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j + 1
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 23
+!$omp end single
+
+!$omp do ordered
+  do i = 23, 19, -1
+    a(i) = 2 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j - 1
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 28
+!$omp end single
+
+!$omp do ordered
+  do i = 28, 39, 2
+    a(i) = 3 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j + 2
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 79
+!$omp end single
+
+!$omp do ordered
+  do i = 79, 59, -4
+    a(i) = 4 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j - 4
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 125
+!$omp end single
+
+!$omp do ordered
+  do i = 125, 90, -12
+    a(i) = 5 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j - 12
+!$omp end ordered
+  end do
+
+!$omp end parallel
+
+  if (any (a .ne. b) .or. k) call abort
+  a = -1
+  k = .false.
+  j = 8
+!$omp parallel num_threads (4)
+
+!$omp do ordered schedule (static)
+  do i = 8, 15
+    a(i) = 1 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j + 1
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 23
+!$omp end single
+
+!$omp do ordered schedule (static, 1)
+  do i = 23, 19, -1
+    a(i) = 2 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j - 1
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 28
+!$omp end single
+
+!$omp do ordered schedule (static, 3)
+  do i = 28, 39, 2
+    a(i) = 3 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j + 2
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 79
+!$omp end single
+
+!$omp do ordered schedule (static, 6)
+  do i = 79, 59, -4
+    a(i) = 4 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j - 4
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 125
+!$omp end single
+
+!$omp do ordered schedule (static, 2)
+  do i = 125, 90, -12
+    a(i) = 5 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j - 12
+!$omp end ordered
+  end do
+
+!$omp end parallel
+
+  if (any (a .ne. b) .or. k) call abort
+  a = -1
+  k = .false.
+  j = 8
+!$omp parallel num_threads (4)
+
+!$omp do ordered schedule (dynamic)
+  do i = 8, 15
+    a(i) = 1 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j + 1
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 23
+!$omp end single
+
+!$omp do ordered schedule (dynamic, 4)
+  do i = 23, 19, -1
+    a(i) = 2 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j - 1
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 28
+!$omp end single
+
+!$omp do ordered schedule (dynamic, 1)
+  do i = 28, 39, 2
+    a(i) = 3 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j + 2
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 79
+!$omp end single
+
+!$omp do ordered schedule (dynamic, 2)
+  do i = 79, 59, -4
+    a(i) = 4 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j - 4
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 125
+!$omp end single
+
+!$omp do ordered schedule (dynamic, 3)
+  do i = 125, 90, -12
+    a(i) = 5 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j - 12
+!$omp end ordered
+  end do
+
+!$omp end parallel
+
+  if (any (a .ne. b) .or. k) call abort
+  a = -1
+  k = .false.
+  j = 8
+!$omp parallel num_threads (4)
+
+!$omp do ordered schedule (guided)
+  do i = 8, 15
+    a(i) = 1 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j + 1
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 23
+!$omp end single
+
+!$omp do ordered schedule (guided, 4)
+  do i = 23, 19, -1
+    a(i) = 2 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j - 1
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 28
+!$omp end single
+
+!$omp do ordered schedule (guided, 1)
+  do i = 28, 39, 2
+    a(i) = 3 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j + 2
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 79
+!$omp end single
+
+!$omp do ordered schedule (guided, 2)
+  do i = 79, 59, -4
+    a(i) = 4 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j - 4
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 125
+!$omp end single
+
+!$omp do ordered schedule (guided, 3)
+  do i = 125, 90, -12
+    a(i) = 5 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j - 12
+!$omp end ordered
+  end do
+
+!$omp end parallel
+
+  if (any (a .ne. b) .or. k) call abort
+  a = -1
+  k = .false.
+  j = 8
+!$omp parallel num_threads (4)
+
+!$omp do ordered schedule (runtime)
+  do i = 8, 15
+    a(i) = 1 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j + 1
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 23
+!$omp end single
+
+!$omp do ordered schedule (runtime)
+  do i = 23, 19, -1
+    a(i) = 2 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j - 1
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 28
+!$omp end single
+
+!$omp do ordered schedule (runtime)
+  do i = 28, 39, 2
+    a(i) = 3 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j + 2
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 79
+!$omp end single
+
+!$omp do ordered schedule (runtime)
+  do i = 79, 59, -4
+    a(i) = 4 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j - 4
+!$omp end ordered
+  end do
+
+!$omp single
+  j = 125
+!$omp end single
+
+!$omp do ordered schedule (runtime)
+  do i = 125, 90, -12
+    a(i) = 5 * 256 + i
+!$omp ordered
+    if (i .ne. j) k = .true.
+    j = j - 12
+!$omp end ordered
+  end do
+
+!$omp end parallel
+
+  if (any (a .ne. b) .or. k) call abort
+end
-- 
cgit v1.2.3