| 1 |
cnh |
1.3 |
C $Header: /u/gcmpack/models/MITgcmUV/eesupp/src/exch_z_rx_cube.template,v 1.2 2001/05/29 14:01:36 adcroft Exp $ |
| 2 |
|
|
C $Name: $ |
| 3 |
adcroft |
1.2 |
|
| 4 |
|
|
#include "CPP_EEOPTIONS.h" |
| 5 |
|
|
|
| 6 |
cnh |
1.3 |
CBOP |
| 7 |
|
|
|
| 8 |
|
|
C !ROUTINE: EXCH_Z_RX_CUBE |
| 9 |
|
|
|
| 10 |
|
|
C !INTERFACE: |
| 11 |
adcroft |
1.2 |
SUBROUTINE EXCH_Z_RX_CUBE( |
| 12 |
|
|
U array, |
| 13 |
|
|
I myOLw, myOLe, myOLn, myOLs, myNz, |
| 14 |
|
|
I exchWidthX, exchWidthY, |
| 15 |
|
|
I simulationMode, cornerMode, myThid ) |
| 16 |
|
|
IMPLICIT NONE |
| 17 |
cnh |
1.3 |
C !DESCRIPTION: |
| 18 |
|
|
C *==========================================================* |
| 19 |
|
|
C | SUBROUTINE EXCH_Z_RX_CUBE |
| 20 |
|
|
C | o Control edge exchanges for RX zeta point array on CS |
| 21 |
|
|
C *==========================================================* |
| 22 |
|
|
C | |
| 23 |
|
|
C | Controlling routine for exchange of XY edges of an array |
| 24 |
|
|
C | distributed in X and Y. The routine interfaces to |
| 25 |
|
|
C | communication routines that can use messages passing |
| 26 |
|
|
C | exchanges, put type exchanges or get type exchanges. |
| 27 |
|
|
C | This allows anything from MPI to raw memory channel to |
| 28 |
|
|
C | memmap segments to be used as a inter-process and/or |
| 29 |
|
|
C | inter-thread communiation and synchronisation |
| 30 |
|
|
C | mechanism. |
| 31 |
|
|
C | Notes -- |
| 32 |
|
|
C | 1. Some low-level mechanisms such as raw memory-channel |
| 33 |
|
|
C | or SGI/CRAY shmem put do not have direct Fortran bindings |
| 34 |
|
|
C | and are invoked through C stub routines. |
| 35 |
|
|
C | 2. Although this routine is fairly general but it does |
| 36 |
|
|
C | require nSx and nSy are the same for all innvocations. |
| 37 |
|
|
C | There are many common data structures ( myByLo, |
| 38 |
|
|
C | westCommunicationMode, mpiIdW etc... ) tied in with |
| 39 |
|
|
C | (nSx,nSy). To support arbitray nSx and nSy would require |
| 40 |
|
|
C | general forms of these. |
| 41 |
|
|
C | 3. zeta coord exchange operation for cube sphere grid |
| 42 |
|
|
C | |
| 43 |
|
|
C *==========================================================* |
| 44 |
adcroft |
1.2 |
|
| 45 |
cnh |
1.3 |
C !USES: |
| 46 |
adcroft |
1.2 |
C == Global data == |
| 47 |
|
|
#include "SIZE.h" |
| 48 |
|
|
#include "EEPARAMS.h" |
| 49 |
|
|
#include "EESUPPORT.h" |
| 50 |
|
|
#include "EXCH.h" |
| 51 |
|
|
|
| 52 |
cnh |
1.3 |
C !INPUT/OUTPUT PARAMETERS: |
| 53 |
adcroft |
1.2 |
C == Routine arguments == |
| 54 |
cnh |
1.3 |
C array :: Array with edges to exchange. |
| 55 |
|
|
C myOLw :: West, East, North and South overlap region sizes. |
| 56 |
adcroft |
1.2 |
C myOLe |
| 57 |
|
|
C myOLn |
| 58 |
|
|
C myOLs |
| 59 |
cnh |
1.3 |
C exchWidthX :: Width of data region exchanged in X. |
| 60 |
|
|
C exchWidthY :: Width of data region exchanged in Y. |
| 61 |
|
|
C Note -- |
| 62 |
|
|
C 1. In theory one could have a send width and |
| 63 |
|
|
C a receive width for each face of each tile. The only |
| 64 |
|
|
C restriction woul be that the send width of one |
| 65 |
|
|
C face should equal the receive width of the sent to |
| 66 |
|
|
C tile face. Dont know if this would be useful. I |
| 67 |
|
|
C have left it out for now as it requires additional |
| 68 |
|
|
C bookeeping. |
| 69 |
|
|
C simulationMode :: Forward or reverse mode exchange ( provides |
| 70 |
|
|
C support for adjoint integration of code. ) |
| 71 |
|
|
C cornerMode :: Flag indicating whether corner updates are |
| 72 |
|
|
C needed. |
| 73 |
|
|
C myThid :: Thread number of this instance of S/R EXCH... |
| 74 |
adcroft |
1.2 |
INTEGER myOLw |
| 75 |
|
|
INTEGER myOLe |
| 76 |
|
|
INTEGER myOLs |
| 77 |
|
|
INTEGER myOLn |
| 78 |
|
|
INTEGER myNz |
| 79 |
|
|
INTEGER exchWidthX |
| 80 |
|
|
INTEGER exchWidthY |
| 81 |
|
|
INTEGER simulationMode |
| 82 |
|
|
INTEGER cornerMode |
| 83 |
|
|
INTEGER myThid |
| 84 |
|
|
_RX array(1-myOLw:sNx+myOLe, |
| 85 |
|
|
& 1-myOLs:sNy+myOLn, |
| 86 |
|
|
& myNZ, nSx, nSy) |
| 87 |
|
|
|
| 88 |
cnh |
1.3 |
C !LOCAL VARIABLES: |
| 89 |
adcroft |
1.2 |
C == Local variables == |
| 90 |
cnh |
1.3 |
C theSimulationMode :: Holds working copy of simulation mode |
| 91 |
|
|
C theCornerMode :: Holds working copy of corner mode |
| 92 |
|
|
C I,J,K,repeat :: Loop counters and index |
| 93 |
|
|
C bl,bt,bn,bs,be,bw |
| 94 |
adcroft |
1.2 |
INTEGER theSimulationMode |
| 95 |
|
|
INTEGER theCornerMode |
| 96 |
|
|
INTEGER I,J,K,repeat |
| 97 |
|
|
INTEGER bl,bt,bn,bs,be,bw |
| 98 |
|
|
C == Statement function == |
| 99 |
|
|
INTEGER tilemod |
| 100 |
|
|
tilemod(I)=1+mod(I-1+6,6) |
| 101 |
cnh |
1.3 |
CEOP |
| 102 |
adcroft |
1.2 |
|
| 103 |
|
|
theSimulationMode = simulationMode |
| 104 |
|
|
theCornerMode = cornerMode |
| 105 |
|
|
|
| 106 |
|
|
C For now tile<->tile exchanges are sequentialised through |
| 107 |
|
|
C thread 1. This is a temporary feature for preliminary testing until |
| 108 |
|
|
C general tile decomposistion is in place (CNH April 11, 2001) |
| 109 |
|
|
CALL BAR2( myThid ) |
| 110 |
|
|
IF ( myThid .EQ. 1 ) THEN |
| 111 |
|
|
|
| 112 |
|
|
DO repeat=1,2 |
| 113 |
|
|
|
| 114 |
|
|
DO bl = 1, 5, 2 |
| 115 |
|
|
|
| 116 |
|
|
bt = bl |
| 117 |
|
|
bn=tilemod(bt+2) |
| 118 |
|
|
bs=tilemod(bt-1) |
| 119 |
|
|
be=tilemod(bt+1) |
| 120 |
|
|
bw=tilemod(bt-2) |
| 121 |
|
|
|
| 122 |
|
|
DO K = 1, myNz |
| 123 |
|
|
DO J = 1, sNy+1 |
| 124 |
|
|
DO I = 0, exchWidthX-1 |
| 125 |
|
|
|
| 126 |
|
|
C Tile Odd:Odd+2 [get] [North<-West] |
| 127 |
|
|
array(J,sNy+I+1,K,bt,1) = array(I+1,sNy+2-J,K,bn,1) |
| 128 |
|
|
C Tile Odd:Odd+1 [get] [East<-West] |
| 129 |
|
|
array(sNx+I+1,J,K,bt,1) = array(I+1,J,K,be,1) |
| 130 |
|
|
|
| 131 |
|
|
cs- these above loop should really have the same range the lower one |
| 132 |
|
|
ENDDO |
| 133 |
|
|
DO I = 1, exchWidthX-0 |
| 134 |
|
|
cs- but this replaces the missing I/O routines for now |
| 135 |
|
|
|
| 136 |
|
|
C Tile Odd:Odd-1 [get] [South<-North] |
| 137 |
|
|
array(J,1-I,K,bt,1) = array(J,sNy+1-I,K,bs,1) |
| 138 |
|
|
C Tile Odd:Odd-2 [get] [West<-North] |
| 139 |
|
|
array(1-I,J,K,bt,1) = array(sNx+2-J,sNy+1-I,K,bw,1) |
| 140 |
|
|
|
| 141 |
|
|
ENDDO |
| 142 |
|
|
ENDDO |
| 143 |
|
|
ENDDO |
| 144 |
|
|
|
| 145 |
|
|
bt = bl+1 |
| 146 |
|
|
bn=tilemod(bt+1) |
| 147 |
|
|
bs=tilemod(bt-2) |
| 148 |
|
|
be=tilemod(bt+2) |
| 149 |
|
|
bw=tilemod(bt-1) |
| 150 |
|
|
|
| 151 |
|
|
DO K = 1, myNz |
| 152 |
|
|
DO J = 1, sNy+1 |
| 153 |
|
|
DO I = 0, exchWidthX-1 |
| 154 |
|
|
|
| 155 |
|
|
C Tile Even:Even+1 [get] [North<-South] |
| 156 |
|
|
array(J,sNy+I+1,K,bt,1) = array(J,I+1,K,bn,1) |
| 157 |
|
|
C Tile Even:Even+2 [get] [East<-South] |
| 158 |
|
|
array(sNx+I+1,J,K,bt,1) = array(sNx+2-J,I+1,K,be,1) |
| 159 |
|
|
|
| 160 |
|
|
cs- these above loop should really have the same range the lower one |
| 161 |
|
|
ENDDO |
| 162 |
|
|
DO I = 1, exchWidthX-0 |
| 163 |
|
|
cs- but this replaces the missing I/O routines for now |
| 164 |
|
|
|
| 165 |
|
|
C Tile Even:Even-2 [get] [South<-East] |
| 166 |
|
|
array(J,1-I,K,bt,1) = array(sNx+1-I,sNy+2-J,K,bs,1) |
| 167 |
|
|
C Tile Even:Even-1 [get] [West<-East] |
| 168 |
|
|
array(1-I,J,K,bt,1) = array(sNx+1-I,J,K,bw,1) |
| 169 |
|
|
|
| 170 |
|
|
ENDDO |
| 171 |
|
|
ENDDO |
| 172 |
|
|
ENDDO |
| 173 |
|
|
|
| 174 |
|
|
ENDDO |
| 175 |
|
|
|
| 176 |
|
|
ENDDO |
| 177 |
|
|
|
| 178 |
|
|
ENDIF |
| 179 |
|
|
CALL BAR2(myThid) |
| 180 |
|
|
|
| 181 |
|
|
RETURN |
| 182 |
|
|
END |
Parent Directory
| 
Revision Log
| 
Revision Graph