have_bdy.F90 4.05 KB
Newer Older
1
!$Id: have_bdy.F90,v 1.7 2006-03-01 14:45:12 hb Exp $
gotm's avatar
gotm committed
2 3 4 5
#include "cppdefs.h"
!-----------------------------------------------------------------------
!BOP
!
6
! !IROUTINE: have_bdy - checks whether this node has boundaries.
gotm's avatar
gotm committed
7 8 9 10 11 12
!
! !INTERFACE:
   subroutine have_bdy
!
! !DESCRIPTION:
!
hb's avatar
hb committed
13 14 15 16
! This routine which is called in {\tt domain.F90} checks whether the present
! node has open lateral boundaries. The integer field {\tt bdy\_index}
! is then set accordingly.
!
gotm's avatar
gotm committed
17 18
! !USES:
   use domain
kbk's avatar
kbk committed
19
   use m2d, only: have_boundaries
gotm's avatar
gotm committed
20 21 22 23 24 25 26 27 28
   IMPLICIT NONE
!
! !INPUT PARAMETERS:
!
! !INPUT/OUTPUT PARAMETERS:
!
! !OUTPUT PARAMETERS:
!
! !LOCAL VARIABLES:
kbk's avatar
kbk committed
29 30 31
   integer                   :: i,j,k,n
   integer                   :: nbdy
   integer                   :: f,l
gotm's avatar
gotm committed
32 33 34 35 36 37 38 39 40 41 42 43 44
!EOP
!-----------------------------------------------------------------------
!BOC
#ifdef DEBUG
   integer, save :: Ncall = 0
   Ncall = Ncall+1
   write(debug,*) 'have_bdy() # ',Ncall
#endif

   nbdy = 0
   i = 0
   if (NWB .ge. 1) then
      do n = 1,NWB
kbk's avatar
kbk committed
45 46 47 48
         if (wi(n) .ge. imin+ioff .and. wi(n) .le. imax+ioff) then
            f = max(jmin+joff,wfj(n)) - joff
            l = min(jmax+joff,wlj(n)) - joff
            if(f .le. l) then
gotm's avatar
gotm committed
49
               i = i+1
50
               wi(i) = wi(n) - ioff
gotm's avatar
gotm committed
51 52 53
               wfj(i) = f
               wlj(i) = l
               nbdy = nbdy+1
54 55 56 57 58 59
               do k=1,nsbv
                  if (bdy_map(k,1) .eq. wi(i)+ioff .and. &
                      bdy_map(k,2) .eq. f+joff) then
                     bdy_index(nbdy) = k
                  end if
               end do
gotm's avatar
gotm committed
60 61 62 63 64 65 66 67 68
            end if
         end if
      end do
   end if
   NWB = i

   i = 0
   if (NNB .ge. 1) then
      do n = 1,NNB
kbk's avatar
kbk committed
69 70 71 72
         if (nj(n) .ge. jmin+joff .and. nj(n) .le. jmax+joff) then
            f = max(imin+ioff,nfi(n)) - ioff
            l = min(imax+ioff,nli(n)) - ioff
            if(f .le. l) then
gotm's avatar
gotm committed
73 74 75
               i = i+1
               nfi(i) = f
               nli(i) = l
76
               nj(i) = nj(n) - joff
gotm's avatar
gotm committed
77
               nbdy = nbdy+1
78 79 80 81 82 83
               do k=1,nsbv
                  if (bdy_map(k,1) .eq. f+ioff .and.  &
                      bdy_map(k,2) .eq. nj(i)+joff) then
                     bdy_index(nbdy) = k
                  end if
               end do
gotm's avatar
gotm committed
84 85 86 87 88 89 90 91 92
            end if
         end if
      end do
   end if
   NNB = i

   i = 0
   if (NEB .ge. 1) then
      do n = 1,NEB
kbk's avatar
kbk committed
93 94 95 96
         if (ei(n) .ge. imin+ioff .and. ei(n) .le. imax+ioff) then
            f = max(jmin+joff,efj(n)) - joff
            l = min(jmax+joff,elj(n)) - joff
            if(f .le. l) then
gotm's avatar
gotm committed
97
               i = i+1
98
               ei(i) = ei(n) - ioff
gotm's avatar
gotm committed
99 100 101
               efj(i) = f
               elj(i) = l
               nbdy = nbdy+1
102 103
               do k=1,nsbv
                  if (bdy_map(k,1) .eq. ei(i)+ioff .and. &
104
                      bdy_map(k,2) .eq. f+joff) then
105 106 107
                     bdy_index(nbdy) = k
                  end if
               end do
gotm's avatar
gotm committed
108 109 110 111 112 113 114 115 116
            end if
         end if
      end do
   end if
   NEB = i

   i = 0
   if (NSB .ge. 1) then
      do n = 1,NSB
kbk's avatar
kbk committed
117 118 119 120
         if (sj(n) .ge. jmin+joff .and. sj(n) .le. jmax+joff) then
            f = max(imin+ioff,sfi(n)) - ioff
            l = min(imax+ioff,sli(n)) - ioff
            if(f .le. l) then
gotm's avatar
gotm committed
121 122 123
               i = i+1
               sfi(i) = f
               sli(i) = l
124
               sj(i) = sj(n) - joff
gotm's avatar
gotm committed
125
               nbdy = nbdy+1
126 127 128 129 130 131
               do k=1,nsbv
                  if (bdy_map(k,1) .eq. f+ioff .and. &
                      bdy_map(k,2) .eq. sj(i)+joff) then
                     bdy_index(nbdy) = k
                  end if
               end do
gotm's avatar
gotm committed
132 133 134 135 136 137
            end if
         end if
      end do
   end if
   NSB = i

kbk's avatar
kbk committed
138 139 140 141 142 143 144
   if (nbdy .gt. 0) then
      have_boundaries = .true.
      bdy_index(nbdy+1:) = -1
   else
      have_boundaries = .false.
      bdy_index = -1
   end if
gotm's avatar
gotm committed
145 146 147 148 149 150 151 152 153 154 155 156

#ifdef DEBUG
   write(debug,*) 'Leaving have_bdy()'
   write(debug,*)
#endif
   return
   end subroutine have_bdy
!EOC

!-----------------------------------------------------------------------
! Copyright (C) 2001 - Hans Burchard and Karsten Bolding               !
!-----------------------------------------------------------------------