1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441
|
C Copyright 1981-2007 ECMWF
C
C Licensed under the GNU Lesser General Public License which
C incorporates the terms and conditions of version 3 of the GNU
C General Public License.
C See LICENSE and gpl-3.0.txt for details.
C
INTEGER FUNCTION HRG2LL(L12PNT,OLDFLD,KGAUSS,AREA,POLE,GRID,
X NEWFLD,KSIZE,NLON,NLAT)
C
C---->
C**** HRG2LL
C
C Purpose
C -------
C
C This routine creates a rotated regular lat/long field from a
C reduced gaussian field using 12-point horizontal interpolation.
C
C
C Interface
C ---------
C
C IRET = HRG2LL(L12PNT,OLDFLD,KGAUSS,AREA,POLE,GRID,NEWFLD,KSIZE,
C X NLON,NLAT)
C
C
C Input parameters
C ----------------
C
C L12PNT - Chooses between 12-point and 4-point interpolation
C OLDFLD - The array of values from the reduced gaussian field
C KGAUSS - Gaussian number for the reduced gaussian field
C AREA - Limits of area (N/W/S/E)
C POLE - Pole of rotation (lat/long)
C GRID - Grid increments (i/j)
C KSIZE - The size of the array to fill with the regular
C lat/long field
C
C
C Output parameters
C -----------------
C
C NEWFLD - The array of values for the regular lat/long field
C NLON - Number of longitudes in the regular lat/long field
C NLAT - Number of latitudes in the regular lat/long field
C
C Returns 0 if function successful, non-zero otherwise.
C
C Common block usage
C ------------------
C
C
C
C Method
C ------
C
C Numbering of the points (I is the interpolation point):
C
C 13 5 6 14
C
C 7 1 2 8
C (I)
C 9 3 4 10
C
C 15 11 12 16
C
C The 12-point interpolation is not possible if either of the top
C two rows is above the original field northern latitude. The
C nearest neighbour is used if both rows are above, and a 4-pt
C bilinear interpolation is used if the top row is above.
C Similarily, if either of the bottom two rows is below the original
C field southern latitude.
C
C
C Externals
C ---------
C
C INTLOG - Log error message.
C JMALLOC - Dynamically allocate memory
C JFREE - Free dynamically allocated memory
C JGETGG - Reads the definition of a gaussian grid
C HGENLL - Calculates original lat/long (before rotation) for
C a rotated grid
C HNEI12 - Finds neighbours for points for interpolation
C HWTS12 - Calculates weightings for points for interpolation
C
C
C Reference
C ---------
C
C None.
C
C
C Comments
C --------
C
C None.
C
C
C Author
C ------
C
C J.D.Chambers ECMWF January 2001
C
C
C Modifications
C -------------
C
C None.
C
C----<
C -----------------------------------------------------------------|
C* Section 0. Definition of variables.
C -----------------------------------------------------------------|
C
IMPLICIT NONE
C
#include "parim.h"
#include "nofld.common"
C
C Parameters
C
INTEGER JNORTH, JSOUTH, JWEST, JEAST, JW_E, JN_S, JLAT, JLON
INTEGER JP12PT, JP4PT, JPNEARN
PARAMETER (JP12PT = 0)
PARAMETER (JP4PT = 1)
PARAMETER (JPNEARN = 2)
PARAMETER (JNORTH = 1 )
PARAMETER (JWEST = 2 )
PARAMETER (JSOUTH = 3 )
PARAMETER (JEAST = 4 )
PARAMETER (JW_E = 1 )
PARAMETER (JN_S = 2 )
PARAMETER (JLAT = 1 )
PARAMETER (JLON = 2 )
C
C Function arguments
C
LOGICAL L12PNT
INTEGER KGAUSS, KSIZE, NLON, NLAT
REAL AREA(4), POLE(2), GRID(2), OLDFLD(*), NEWFLD(KSIZE)
C
C Local variables
C
INTEGER NEXT, LOOP, IRET, NLEN, NPREV, NBYTES, NUMBER
C
LOGICAL LNEW, LFIRST
INTEGER KSCHEME(1),NEIGH(12,1), KLA(1)
REAL PWTS(12,1)
POINTER (IPKSCHE, KSCHEME)
POINTER (IPNEIGH, NEIGH)
POINTER (IPKLA, KLA)
POINTER (IPPWTS, PWTS)
C
REAL PDLO0(1),PDLO1(1),PDLO2(1),PDLO3(1),PDLAT(1)
POINTER (IPPDLO0, PDLO0)
POINTER (IPPDLO1, PDLO1)
POINTER (IPPDLO2, PDLO2)
POINTER (IPPDLO3, PDLO3)
POINTER (IPPDLAT, PDLAT)
C
INTEGER IGG, IGGOLD
INTEGER KPTS(1)
REAL GLATS(1)
INTEGER IOFFS(1)
POINTER (IPKPTS, KPTS)
POINTER (IPIOFFS, IOFFS)
POINTER (IPGLATS, GLATS)
C
INTEGER ILL, ILLOLD
REAL RLAT(1),RLON(1)
POINTER (IPRLAT, RLAT)
POINTER (IPRLON, RLON)
C
REAL OLD(1)
POINTER (IOLD, OLD)
C
DATA NPREV/-1/
DATA LNEW/.FALSE./, LFIRST/.TRUE./
DATA IGGOLD/-1/, ILLOLD/-1/, IOLD/-1/
C
SAVE LNEW, LFIRST
SAVE IPKSCHE, IPNEIGH, IPKLA, IPPWTS
SAVE IPPDLO0, IPPDLO1, IPPDLO2, IPPDLO3, IPPDLAT
SAVE NPREV, IGGOLD, IPKPTS, IPIOFFS, IPGLATS
SAVE ILLOLD, IPRLAT, IPRLON, IOLD
C
C Externals
C
INTEGER HNEI12, HGENLL
#ifdef POINTER_64
INTEGER*8 JMALLOC
#else
INTEGER JMALLOC
#endif
C
C -----------------------------------------------------------------|
C Section 1. Initialise.
C -----------------------------------------------------------------|
C
100 CONTINUE
C
HRG2LL = 0
C
CALL JDEBUG()
C
C Dynamically allocate memory for gaussian grid information.
C
IGG = KGAUSS*2
C
IF( IGG.GT.IGGOLD ) THEN
C
IF( IGGOLD.GT.0 ) CALL JFREE(IPKPTS)
C
NBYTES = (IGG*JPRLEN) + (2*IGG+1)*JPBYTES
C
IPKPTS = JMALLOC(NBYTES)
#ifdef hpR64
IPKPTS = IPKPTS/(1024*1024*1024*4)
#endif
IF( IPKPTS.EQ.0 ) THEN
CALL INTLOG(JP_ERROR,'HRG2LL: Memory allocation fail',JPQUIET)
HRG2LL = 1
GOTO 900
ENDIF
C
IPGLATS = IPKPTS + (IGG*JPBYTES)
IPIOFFS = IPGLATS + (IGG*JPRLEN)
C
IGGOLD = IGG
NPREV = -1
C
ENDIF
C
C Build up offsets to start of each latitude in the original field.
C
IF( KGAUSS.NE.NPREV ) THEN
CALL JGETGG(KGAUSS,'R',GLATS,KPTS,IRET)
IF( IRET.NE.0 ) THEN
CALL INTLOG(JP_ERROR,
X 'HRG2LL: JGETGG failed to get gaussian data',JPQUIET)
HRG2LL = 2
GOTO 900
ENDIF
C
IOFFS(1) = 1
DO LOOP = 2, (KGAUSS*2+1)
IOFFS(LOOP) = IOFFS(LOOP-1) + KPTS(LOOP-1)
ENDDO
C
C Allocate memory to hold the input field
C (in case OLDFLD and NEWFLD are the same arrays)
C
IF( IOLD.GT.0 ) CALL JFREE(IOLD)
C
NUMBER = (IOFFS(KGAUSS*2+1) - 1)
NBYTES = NUMBER * JPRLEN
C
IOLD = JMALLOC(NBYTES)
#ifdef hpR64
IOLD = IOLD/(1024*1024*1024*4)
#endif
IF( IOLD.EQ.0 ) THEN
CALL INTLOG(JP_ERROR,'HRG2LL: Memory allocation fail',JPQUIET)
HRG2LL = 3
GOTO 900
ENDIF
C
NPREV = KGAUSS
ENDIF
C
C Preserve the input field
C
NUMBER = (IOFFS(KGAUSS*2+1) - 1)
DO LOOP = 1, NUMBER
OLD(LOOP) = OLDFLD(LOOP)
ENDDO
C
C -----------------------------------------------------------------|
C Section 2. Generate the lat/long points for the output grid
C -----------------------------------------------------------------|
C
200 CONTINUE
C
NLON = 1 + NINT((AREA(JEAST) - AREA(JWEST)) / GRID(JW_E))
NLAT = 1 + NINT((AREA(JNORTH) - AREA(JSOUTH)) / GRID(JN_S))
C
NLEN = NLON * NLAT
NOWE = NLON
NONS = NLAT
C
C Check that given array is big enough for the new field.
C
IF( NLEN.GT.KSIZE ) THEN
CALL INTLOG(JP_ERROR,'HRG2LL: Given array size = ',KSIZE)
CALL INTLOG(JP_ERROR,'HRG2LL: Required size = ',NLEN)
HRG2LL = 4
GOTO 900
ENDIF
C
C Dynamically allocate memory for lat/long arrays.
C
ILL = NLEN
IF( ILL.GT.ILLOLD ) THEN
C
LNEW = .TRUE.
C
IF( ILLOLD.GT.0 ) CALL JFREE(IPRLON)
C
NBYTES = 2*ILL*JPRLEN
C
IPRLON = JMALLOC(NBYTES)
#ifdef hpR64
IPRLON = IPRLON/(1024*1024*1024*4)
#endif
IF( IPRLON.EQ.0 ) THEN
CALL INTLOG(JP_ERROR,'HRG2LL: Memory allocation fail',JPQUIET)
HRG2LL = 5
GOTO 900
ENDIF
C
IPRLAT = IPRLON + (ILL*JPRLEN)
C
ILLOLD = ILL
C
ENDIF
C
IRET = HGENLL(AREA,POLE,GRID,NLON,NLAT,RLAT,RLON)
IF( IRET.NE.0 ) THEN
CALL INTLOG(JP_ERROR,
X 'HRG2LL: HGENLL failed to get lat/lon grid data',JPQUIET)
HRG2LL = 6
GOTO 900
ENDIF
C
C -----------------------------------------------------------------|
C Section 3. Find neighbours for each point for interpolation.
C -----------------------------------------------------------------|
C
300 CONTINUE
C
C Dynamically allocate memory for interpolation arrays.
C
IF( LNEW ) THEN
C
IF( .NOT.LFIRST ) CALL JFREE(IPPDLO0)
C
NBYTES = (17*JPRLEN + 14*JPBYTES) * ILL
C
IPPDLO0 = JMALLOC(NBYTES)
#ifdef hpR64
IPPDLO0 = IPPDLO0/(1024*1024*1024*4)
#endif
IF( IPPDLO0.EQ.0 ) THEN
CALL INTLOG(JP_ERROR,'HRG2LL: Memory allocation fail',JPQUIET)
HRG2LL = 7
GOTO 900
ENDIF
C
IPPDLO1 = IPPDLO0 + (ILL*JPRLEN)
IPPDLO2 = IPPDLO1 + (ILL*JPRLEN)
IPPDLO3 = IPPDLO2 + (ILL*JPRLEN)
IPPDLAT = IPPDLO3 + (ILL*JPRLEN)
IPPWTS = IPPDLAT + (ILL*JPRLEN)
IPKSCHE = IPPWTS + (12*ILL*JPRLEN)
IPKLA = IPKSCHE + (ILL*JPBYTES)
IPNEIGH = IPKLA + (ILL*JPBYTES)
C
LFIRST = .FALSE.
LNEW = .FALSE.
C
ENDIF
C
C Find neighbours.
C
IRET = HNEI12(L12PNT,NLEN,RLAT,RLON,KGAUSS,KPTS,GLATS,
X KSCHEME,PDLAT,PDLO0,PDLO1,PDLO2,PDLO3,KLA,NEIGH)
IF( IRET.NE.0 ) THEN
CALL INTLOG(JP_ERROR,
X 'HRG2LL: HNEI12 failed to find neighbours',JPQUIET)
HRG2LL = 8
GOTO 900
ENDIF
C
C -----------------------------------------------------------------|
C Section 4. Perform the 12-point horizontal interpolation.
C -----------------------------------------------------------------|
C
400 CONTINUE
C
C Setup the 12-point horizontal interpolation weights
C
CALL HWTS12
X (NLEN,KSCHEME,KLA,PDLAT,GLATS,PDLO0,PDLO1,PDLO2,PDLO3,NEIGH,
X PWTS)
C
C Calculate the interpolated grid point values
C
DO LOOP = 1, NLEN
IF( KSCHEME(LOOP).EQ.JP12PT ) THEN
NEWFLD(LOOP) =
X OLD(NEIGH( 1,LOOP)) * PWTS( 1,LOOP) +
X OLD(NEIGH( 2,LOOP)) * PWTS( 2,LOOP) +
X OLD(NEIGH( 3,LOOP)) * PWTS( 3,LOOP) +
X OLD(NEIGH( 4,LOOP)) * PWTS( 4,LOOP) +
X OLD(NEIGH( 5,LOOP)) * PWTS( 5,LOOP) +
X OLD(NEIGH( 6,LOOP)) * PWTS( 6,LOOP) +
X OLD(NEIGH( 7,LOOP)) * PWTS( 7,LOOP) +
X OLD(NEIGH( 8,LOOP)) * PWTS( 8,LOOP) +
X OLD(NEIGH( 9,LOOP)) * PWTS( 9,LOOP) +
X OLD(NEIGH(10,LOOP)) * PWTS(10,LOOP) +
X OLD(NEIGH(11,LOOP)) * PWTS(11,LOOP) +
X OLD(NEIGH(12,LOOP)) * PWTS(12,LOOP)
C
ELSE IF( KSCHEME(LOOP).EQ.JP4PT ) THEN
NEWFLD(LOOP) =
X OLD(NEIGH( 1,LOOP)) * PWTS( 1,LOOP) +
X OLD(NEIGH( 2,LOOP)) * PWTS( 2,LOOP) +
X OLD(NEIGH( 3,LOOP)) * PWTS( 3,LOOP) +
X OLD(NEIGH( 4,LOOP)) * PWTS( 4,LOOP)
C
ELSE
DO NEXT = 1, 4
IF( NEIGH(NEXT,LOOP).NE.0 )
X NEWFLD(LOOP) = OLD(NEIGH(NEXT,LOOP))
ENDDO
C
ENDIF
ENDDO
C
C -----------------------------------------------------------------|
C Section 9. Return.
C -----------------------------------------------------------------|
C
900 CONTINUE
C
RETURN
END
|