Mercurial > hg > CbC > CbC_gcc

comparison libgomp/testsuite/libgomp.fortran/vla4.f90 @ 111:04ced10e8804

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
gcc 7
author kono
date Fri, 27 Oct 2017 22:46:09 +0900
parents a06113de4d67
children 84e7813d76e9
comparison
equal deleted inserted replaced
68:561a7518be6b 111:04ced10e8804
8 l = l .or. x .ne. y 8 l = l .or. x .ne. y
9 end subroutine check 9 end subroutine check
10 10
11 subroutine foo (c, d, e, f, g, h, i, j, k, n) 11 subroutine foo (c, d, e, f, g, h, i, j, k, n)
12 use omp_lib 12 use omp_lib
13 interface
14 subroutine GOMP_barrier () bind(c, name="GOMP_barrier")
15 end subroutine
16 end interface
13 integer :: n 17 integer :: n
14 character (len = *) :: c 18 character (len = *) :: c
15 character (len = n) :: d 19 character (len = n) :: d
16 integer, dimension (2, 3:5, n) :: e 20 integer, dimension (2, 3:5, n) :: e
17 integer, dimension (2, 3:n, n) :: f 21 integer, dimension (2, 3:n, n) :: f
92 s = w(20:26) 96 s = w(20:26)
93 forall (p = 1:2, q = 3:5, r = 1:7) t(p, q, r) = -10 + x + p - q + 2 * r 97 forall (p = 1:2, q = 3:5, r = 1:7) t(p, q, r) = -10 + x + p - q + 2 * r
94 forall (p = 1:2, q = 3:7, r = 1:7) u(p, q, r) = 30 - x - p + q - 2 * r 98 forall (p = 1:2, q = 3:7, r = 1:7) u(p, q, r) = 30 - x - p + q - 2 * r
95 forall (p = 1:5, q = 3:7, p + q .le. 8) v(p, q) = w(1:7) 99 forall (p = 1:5, q = 3:7, p + q .le. 8) v(p, q) = w(1:7)
96 forall (p = 1:5, q = 3:7, p + q .gt. 8) v(p, q) = w(20:26) 100 forall (p = 1:5, q = 3:7, p + q .gt. 8) v(p, q) = w(20:26)
97 !$omp barrier ! { dg-warning "may not be closely nested" } 101 call GOMP_barrier
98 y = '' 102 y = ''
99 if (x .eq. 0) y = '0' 103 if (x .eq. 0) y = '0'
100 if (x .eq. 1) y = '1' 104 if (x .eq. 1) y = '1'
101 if (x .eq. 2) y = '2' 105 if (x .eq. 2) y = '2'
102 if (x .eq. 3) y = '3' 106 if (x .eq. 3) y = '3'