Procedures

@brief subroutine checks start/count for out of bounds, adjusts if the start/count is too high, zeroes start if it is invalid POST-EFFECTS:
all start/counts are now legal, non-IO tasks have zeroed start counts @param[in] global_dims int(3) global grid dimensions @param[in] rank int rank of current MPI task @param[inout] start int(3) current MPI task global start @param[inout] count int(3) current MPI task global count

currentPatch%AB !daily area burnt (m2) currentPatch%NF !Daily number of ignitions (lightning and human-caused), adjusted for size of patch.

@brief subroutine that, given a global grid, VDC blocksize, and max # of nioprocs, will automatically create an VDC optimized IO decomposition that uses the most possible IO tasks POST-EFFECTS:
Each MPI Task is now either and IO task or a computational task. IO tasks have nonzero start/counts @param[in] rank int rank of the current MPI task @param[inout] nioprocs int represents the max possible # of IO procs, @algorithm will try to get as close as possible to this # and return it in nioprocs @param[in] blockdims int(3) global grid dimensions represented as VDC blocks @param[out] start int(3) iostart for the current MPI task @param[out] count int(3) iocount for the current MPI task @param[in] bsize int(3) VDC block size

@private

$ SUBROUTINE SGBSV( N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB, INFO ) $ $ -- LAPACK driver routine (version 3.1) -- $ Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. $ November 2006 $ $ .. Scalar Arguments .. $ INTEGER INFO, KL, KU, LDAB, LDB, N, NRHS $ .. $ .. Array Arguments .. $ INTEGER IPIV( * ) $ REAL AB( LDAB, * ), B( LDB, * ) $ .. $ $ Purpose $ ======= $ $ SGBSV computes the solution to a real system of linear equations $ A * X = B, where A is a band matrix of order N with KL subdiagonals $ and KU superdiagonals, and X and B are N-by-NRHS matrices. $ $ The LU decomposition with partial pivoting and row interchanges is $ used to factor A as A = L * U, where L is a product of permutation $ and unit lower triangular matrices with KL subdiagonals, and U is $ upper triangular with KL+KU superdiagonals. The factored form of A $ is then used to solve the system of equations A * X = B. $ $ Arguments $ ========= $ $ N (input) INTEGER $ The number of linear equations, i.e., the order of the $ matrix A. N >= 0. $ $ KL (input) INTEGER $ The number of subdiagonals within the band of A. KL >= 0. $ $ KU (input) INTEGER $ The number of superdiagonals within the band of A. KU >= 0. $ $ NRHS (input) INTEGER $ The number of right hand sides, i.e., the number of columns $ of the matrix B. NRHS >= 0. $ $ AB (input/output) REAL array, dimension (LDAB,N) $ On entry, the matrix A in band storage, in rows KL+1 to $ 2KL+KU+1; rows 1 to KL of the array need not be set. $ The j-th column of A is stored in the j-th column of the $ array AB as follows: $ AB(KL+KU+1+i-j,j) = A(i,j) for max(1,j-KU)<=i<=min(N,j+KL) $ On exit, details of the factorization: U is stored as an $ upper triangular band matrix with KL+KU superdiagonals in $ rows 1 to KL+KU+1, and the multipliers used during the $ factorization are stored in rows KL+KU+2 to 2KL+KU+1. $ See below for further details. $ $ LDAB (input) INTEGER $ The leading dimension of the array AB. LDAB >= 2KL+KU+1. $ $ IPIV (output) INTEGER array, dimension (N) $ The pivot indices that define the permutation matrix P; $ row i of the matrix was interchanged with row IPIV(i). $ $ B (input/output) REAL array, dimension (LDB,NRHS) $ On entry, the N-by-NRHS right hand side matrix B. $ On exit, if INFO = 0, the N-by-NRHS solution matrix X. $ $ LDB (input) INTEGER $ The leading dimension of the array B. LDB >= max(1,N). $ $ INFO (output) INTEGER $ = 0: successful exit $ < 0: if INFO = -i, the i-th argument had an illegal value $ > 0: if INFO = i, U(i,i) is exactly zero. The factorization $ has been completed, but the factor U is exactly $ singular, and the solution has not been computed. $ $ Further Details $ =============== $ $ The band storage scheme is illustrated by the following example, when $ M = N = 6, KL = 2, KU = 1: $ $ On entry: On exit: $ $ * * * + + + * * * u14 u25 u36 $ * * + + + + * * u13 u24 u35 u46 $ * a12 a23 a34 a45 a56 * u12 u23 u34 u45 u56 $ a11 a22 a33 a44 a55 a66 u11 u22 u33 u44 u55 u66 $ a21 a32 a43 a54 a65 * m21 m32 m43 m54 m65 * $ a31 a42 a53 a64 * * m31 m42 m53 m64 * * $ $ Array elements marked * are not used by the routine; elements marked $ + need not be set on entry, but are required by the routine to store $ elements of U because of fill-in resulting from the row interchanges.

allocate arrays based on size of netcdf timeseries

allocate arrays based on size of netcdf timeseries

routine description. returns the probability that trees dies due to cambial char currentPatch%tau_l = duration of lethal stem heating (min). Calculated at patch level.

modify csoilc value (0.004) if the under-canopy is in stable condition

!! Begin biochemistry

Component Initialization Note that within each component initialization, the relevant x_present flag part of CIMEInit can be modified By default, all these flags are set to true The atm can reset the lnd_present, ice_present and ocn_present flags based on aqua_planet, ideal_phys and adiabatic modes The stub components will reset the present flags to false, all other components will set them to true for the purposes of symmetry

mt call shr_mem_init(prt=.true.)

Advance Clock (this is time that models should have before they return to the driver). Write timestamp and run alarm status

!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

! END OF RUN !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

***/ Define cohort state variable ***/

currentPatch%SH !average scorch height for the patch(m) currentPatch%FI average fire intensity of flaming front during day. kW/m.

use separate (possibly equal) t funcs above and below freezing point t_scalar(c,1)=t_scalar(c,1) + (1.5((t_soisno(c,j)-(SHR_CONST_TKFRZ+25._r8))/10._r8))*fr(c,j) use separate (possibly equal) t funcs above and below freezing point t_scalar(c,j)= (1.5((t_soisno(c,j)-(SHR_CONST_TKFRZ+25._r8))/10._r8))

!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

Fire, growth, biogeochemistry.

currentSite%acc_NI is the accumulated Nesterov fire danger index

returns the updated currentPatch%FI value for each patch.

USES:

!!!!!!!!!!!! WARNING HACK TO ENABLE Gregorian CALENDAR WITH SHR_ORB !!!!!!!!!!!!!!!!!!!! !! The following hack fakes day 366 by reusing day 365. This is just because the !!!!!! !! current shr_orb_decl calculation can't handle days > 366. !!!!!! !! Dani Bundy-Coleman and Erik Kluzek Aug/2008 !!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!!!!!!! END HACK TO ENABLE Gregorian CALENDAR WITH SHR_ORB !!!!!!!!!!!!!!!!!!!!!!!!

!!!!!!!!!!!! WARNING HACK TO ENABLE Gregorian CALENDAR WITH SHR_ORB !!!!!!!!!!!!!!!!!!!! !! The following hack fakes day 366 by reusing day 365. This is just because the !!!!!! !! current shr_orb_decl calculation can't handle days > 366. !!!!!! !! Dani Bundy-Coleman and Erik Kluzek Aug/2008 !!!!!! !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!!!!!!!!!! END HACK TO ENABLE Gregorian CALENDAR WITH SHR_ORB !!!!!!!!!!!!!!!!!!!!!!!!

returns the the hypothetic fuel consumed by the fire

for terminal pools (i.e. 100% respiration)

@brief subroutine that prepares the global grid to be split by the auto_start_count routine POST-EFFECTS:
A valid IO decomposition is created that can be used with PIO @param[in] rank int rank of the current @param[in] data_dims int(3) size of the global grid @param[in] vdc_bsize int(3) VDC block size @param[out] iostart int(3) IO start for the current MPI task @param[out] iocount int(3) IO count for the current MPI task @param[inout] ioprocs int max # of IO procs, gets returned as the actual # used

! TODO - is this needed?

allocate(cnp_allom_prt) prt => cnp_allom_prt

!!!!!!!!!!!!!!!!!!!!!!!!!

!!!!!!!!!!!!!!!!!

Purpose: Reduced version of original swapm (for swap of multiple messages using MPI point-to-point routines), more efficiently implementing a subset of the swap protocols.

Purpose: Reduced version of original swapm (for swap of multiple messages using MPI point-to-point routines), more efficiently implementing a subset of the swap protocols.

!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!