Procedures

Find all the virtual children of the sourceID down to the targetLevel and add to the level-wise ghostFromCoarser list in the level descriptor

Add parentID as GhostFromFiner. Then set its BC from its children. If any children do NOT exist, recursively call this routine to add them as GhostFromFiner.

This routine allocates matrix with given dimentions

Compute the angle between to vectors (they should not both be the 0 vector).

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

Interface to append a single point or array of points to growing array of points

Interface to append point, offset_bit and elemPos to pointData

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append position should be only int type. Only the value should be long_k

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append a value to the dynamic array and return its position.

append an array of values to the growing 2d array.

append an array of values to the growing 2d array.

append an array of values to the growing 2d array.

append an array of values to the growing 2d array.

append an array of values to the growing 2d array.

appending a value to the dynamic array

appending a value to the dynamic array

appending a value to the dynamic array

appending a value to the dynamic array

appending a value to the dynamic array

appending a sorted list of values to the dynamic array

appending a sorted list of values to the dynamic array

appending a sorted list of values to the dynamic array

appending a sorted list of values to the dynamic array

appending a sorted list of values to the dynamic array

append an element with its treeID, property, element type, position in Tree, position in boundary_ID, number of neighbors, procID

This routine builds up the matrix for least square fit used in linear and quadratic interpolation.

Routine to append point Datas like points, offset_bit and elemPos Append point datas only if treeID of a point in max level is newly added

append a single value to the growing 2d array.

append a single value to the growing 2d array.

append a single value to the growing 2d array.

append a single value to the growing 2d array.

append a single value to the growing 2d array.

This routine append a single point to growing array of points

This routine appends a new array of space time functions st_fun to the linked list me.

This routine appends new space time function to linked list of tem_st_fun_linkedList

This routine append a array of points to growing array of points

s u b r o u t i n e

t o

a p p e n d

a

r o t a t e d

d e r i v a t i v e

t o

c o o r d R o t a t i o n

t y p e .

add here the dependency for interpolation between the levels For each target cell, there are one or more source cells. The source cell can be of type fluid, ghost or halo. We save the type to update the correct element position later on, when the lists have been assembled.

r o u t i n e

t o

a p p e n d

a

r o t a t e d

v a r i b a l e

t o

c o r r d R o a t i o n

t y p e .

Create the level-wise total lists.

This function check whether there is separating axis between triangle and box. This function can be optimized by explicitly providing cross_product result see example: http://fileadmin.cs.lth.se/cs/Personal/Tomas_Akenine-Moller/code/tribox3.txt

Interface to convert ascii to binary base64 encoder

Compute derivative for Bessel function of first kind of order n.

This function checks for intersection of a axis aligned box and a parallelepiped.

Assemble the fluid list and identify neighbor relations start with building up the ghost and halo element collection as well

This routine builds up the matrix for least square fit used in linear interpolation.

This routine builds up the matrix for least square fit used in quadratic interpolation. We extract momentum information completely on the view of the source coordinate system Set the right hand side of the equation system Solve the problem, where b = rhs, x = coefficients Ax = b overdetermined, solve the least Square fit problem (A^T)Ax = (A^T)b x = ((A^T)A)^-1(A^T)b Solve linear system of equation with inverted matrix. Size of matrix: (nCoeffs, QQ) matrix_LSF = ((A^T)A)^-1(A^T)

Convert from cartesian coordinates (in the x-y plane) to polar coordinates (radius,angle)

Convert from cartesian coordinates (in the x-y plane) to polar coordinates (radius,angle)

this routine encodes data of type char to base64 format

this routine encodes a single variable of type char into base64 format

Check if additional communications have to be performed

This subroutine checks whether input variables satisfy requirements for opertype.

Convert a child coordinate {0,1} to non-zero stencil direction {-1,1}

Combine multiple variables into single variable with nComponent of output variable as sum of all input variables nComponents. In lua file, first define new variable with varType operation kind as "combine" and provide name of the variable from which to extract component index via input_varname (it must be single variable) and index to combine via input_varIndex. If input_varname variable is not part of predefined solver variables then add also that variable via variable table.

same as combine_fromelement except it extract from points

Same as combine_from Point except it combine from points via indices which are setup before

exchange the communication buffers with a non-blocking mpi communication using preposted irecv and isend with a waitall

exchange the communication buffers with a non-blocking mpi communication using preposted irecv and isend with a waitall

fill send buffers and start sending

fill send buffers and start sending

fill send buffers and start sending

exchange the communication buffers with a non-blocking mpi communication using preposted irecv and isend with a waitall

exchange the communication mes with a non-blocking mpi communication using preposted irecv and isend with a waitall

exchange the communication mes with a non-blocking mpi communication using preposted irecv and isend with a waitall

exchange the communication mes with a non-blocking mpi communication using preposted irecv and isend with a waitall

exchange the requested treeIDs between all MPI processs

Communicate with all existing process the number of requested halo elements

This function provides the assignment operator of two convergence. Temporary Solution as CRAY compiler dont have = Operator Copying a convegence object (right) into other convergence (left)

This routine provides assignment operator of tem_matrix_type

This function provides copy assigment for tem_stencilElement_type

This function provides copy assigment for tem_stencilHeader_type

This routine provide funtionality to copy variable type

This function provides the assignment operator of tem_varSys_op_type

create all the neighbors of an element's parent

This function calculate the cross product of two 3D vector

return the cutoff multiplication factor This routine returns the cutoff factor for a circle of size r_min. Outside r_min, the quantity is

Definition of the d3q125 neighborhood

Definition of the d3q81 neighborhood.

description missing

Get the volume of an element

Get the level of an element

Evaluate if the element is fluidifiable or not

compute the volume of the current element as a fraction of a reference bounding hexahedral volume (stored in tree%global%effLength). The sum of all element fractions then gives the fractional fluid volume occupation inside the reference volume, i.e. the porosity

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

Interface to destroy growing array of points

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destroy the dynamic array

destruction of a dynamic array

destruction of a dynamic array

destruction of a dynamic array

destruction of a dynamic array

destruction of a dynamic array

destroy all the lists in the element object

destroy the 2d growing array

destroy the 2d growing array

destroy the 2d growing array

destroy the 2d growing array

destroy the 2d growing array

This routine destroys growing array of points

destroy stencil

f u n c t i o n

t o

c o n v e r t

a

d i r e c t i o n

t o

a

s t r i n g .

Routine to divide vector by scalar

Calculate sine integral of xvalue. AUTHOR: Allan MacLeod Dept. of Mathematics and Statistics University of Paisley Scotland (e-mail: macl_ms0@paisley.ac.uk)

write mesh information

dump normal information

dump normal header information to lua file

dump bc properties

dump bc properties header information to lua file

dump bc properties

dump qval header information to lua file

dump bc properties

A routine to dump global informations into the mesh header in lua format

Subroutine to dump property header informations into a Lua file.

Write a given mesh to disk. it is stored to the directory given in the tem_global_type.

empty the entries without changing arrays

empty the entries without changing arrays

empty the array, reset nvals to be 0

empty the entries without changing arrays

empty the entries without changing arrays

empty the entries without changing arrays

empty the entries without changing arrays

empty the entries without changing arrays

empty the entries without changing arrays

empty the entries without changing arrays

empty the entries without changing arrays

empty the entries without changing arrays

empty the entries without changing arrays

empty the array, reset nvals to be 0

empty the array, reset nvals to be 0

empty the array, reset nvals to be 0

empty the array, reset nvals to be 0

empty the entries without changing arrays

empty the entries without changing arrays

empty the entries without changing arrays

empty the entries without changing arrays

empty the entries without changing arrays

empty the entries without changing arrays

empty the entries without changing arrays

empty the entries without changing arrays

empty the entries without changing arrays

empty the entries without changing arrays

empty all contents of the array without changing the size or status of any array

empty all contents of the array without changing the size or status of any array

empty all contents of the array without changing the size or status of any array

empty all contents of the array without changing the size or status of any array

empty all contents of the array without changing the size or status of any array

Delete all entries in the stencil

Convert one block of input (3 Bytes) into its base64 representation (4 Bytes).

Interface to convert ascii to binary base64 encoder

Relational operator to test the equality of floating point numbers.

Relational operator to test the equality of two arrays of floating point numbers.

Same as evalDiff but output of 2nd dependent variable is used to compute relative difference.

Same as evalRelDiff_forElement except it evaluate relatice diff from points

Same as evalRelDiff_forElement except it evaluate relative diff from points via index which are setup before

This subroutine add multiple spacetime function for given coordinate points. Spacetime function are evaluated only on the coordinate which belong to st_fun shape.

Call the spacetime function for scalar variable, which are stored in method_data which intern points to tem_st_fun_listelem_type. this spacetime function can be used as a analytical solution for reference. note: ndofs is not used by this routine. so, to evaluate spacetime function for ndofs in an element, use tem_varsys_proc_point interface.

This subroutine add multiple spacetime function for given coordinate points. Spacetime function are evaluated only on the coordinate which belong to st_fun shape for vectorial variable.

Call the spacetime function for vector variable, which are stored in method_data which intern points to tem_st_fun_listElem_type. This spacetime function can be used as a analytical solution for reference. NOTE: nDofs is not used by this routine. So, to evaluate spacetime function for nDofs in an element, use tem_varSys_proc_point interface.

This subroutine returns first spacetime function on overlapping regions fo given coordinate points. Spacetime function are evaluated only on the coordinate which belong to st_fun shape.

Call the spacetime function for scalar variable, which are stored in method_data which intern points to tem_st_fun_listelem_type. this spacetime function can be used as a analytical solution for reference. note: ndofs is not used by this routine. so, to evaluate spacetime function for ndofs in an element, use tem_varsys_proc_point interface.

This subroutine returns first spacetime function on overlapping regions fo given coordinate points for vectorial variable. Spacetime function are evaluated only on the coordinate which belong to st_fun shape.

Call the spacetime function for vector variable, which are stored in method_data which intern points to tem_st_fun_listElem_type. This spacetime function can be used as a analytical solution for reference. NOTE: nDofs is not used by this routine. So, to evaluate spacetime function for nDofs in an element, use tem_varSys_proc_point interface.

This subroutine directly evaluate spacetime function for given coordinate points on 1st st_fun assuming global shape.

This subroutine directly evaluate spacetime function for given element position in global TreeID list on 1st st_fun assuming global shape.

This subroutine directly evaluate spacetime function for given coordinate points on 1st st_fun assuming global shape for vectorial variable

This subroutine directly evaluate spacetime function for given element position in global TreeID list on 1st st_fun assuming global shape for vectorial variable.

evaluate the residual For relative errors (defined in convergence%absoluteError ), the result is divided by the current status value

Exchange mesh elements with other process The following data within treelmesh_type is updated in this routine: treeID, ElemPropertyBits, Part_First, Part_Last Data pathList is deallocated.

This subroutine checks at which face, edge or corner the line leaves the element and calculates the next element.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

increase the size of the container for the array.

expanding the dynamic array

expanding the dynamic array

expanding the dynamic array

expanding the dynamic array

expanding the dynamic array

expand the growing 2d array

expand the growing 2d array

expand the growing 2d array

expand the growing 2d array

expand the growing 2d array

Extract component index of any vectorial variable. In lua file, first define new variable with varType operation kind as "extract" and provide name of the variable from which to extract component index via input_varname (it must be single variable) and index to extract via input_varIndex. If input_varname variable is not part of predefined solver variables then add also that variable via variable table.

Same as extract_forElement except it extract from points

Same as extract_from Point except it extract from points via indices which are setup before

Finalize the environment, should be the very last call in the program, and includes the call of MPI_Finalize.

This evaluates relative distance of given point on line

Completely free the memory of the treelmesh again.

Gather the information on a property from the bit fields of all elements

Generate the header for the simple full cube mesh.

Generate the simple single level mesh of a line in the full cube.

Generate the single element mesh.

Generate the simple single level mesh of a slice in the full cube.

G e n e r a t e

a

p r e d e f i n e d

c u b e

Generate a predefined line with a given number of elements

G e n e r a t e

a

p r e d e f i n e d

l i n e

G e n e r a t e

a

p r e d e f i n e d

s i n g l e

e l e m e n t

G e n e r a t e

a

p r e d e f i n e d

s l i c e

This routine process instring and return string with requested info from spacetime function

This routine returns value at the given index. If value is pre-computed and value at given index is returned else value is computing on the points for given index.

This routine returns value at the given index. If value is pre-computed and value at given index is returned else value is computing on the points for given index.

This routine returns value at the given index. If value is pre-computed and value at given index is returned else value is computing on the points for given index.

This routine returns value at the given index. If value is pre-computed and value at given index is returned else value is computing on the points for given index.

This routine returns value at the given index. If value is pre-computed and value at given index is returned else value is computing on the points for given index.

This routine returns value at the given index. If value is pre-computed and value at given index is returned else value is computing on the points for given index.

Get the computational weight of elements

This routine write variable labels into buffer and this buffer is written into the second line of ascii result file for spatial (asciiSpatial) and transient (ascii) tracking.

Get the MPI rank to which the corresponding treeID belongs. This routine is used to visualize the rank affinity of the mesh elements

return the number of actual used memory (bytes) per element

return the number of total allocated memory (bytes) per element

Get the treeID of an element

Relational operator to test if one operand is greater than another.

Relational operator to test if one operand is greater than or equal to another.

Compute Hankel function of second kind of order n.

Compute derivative for Hankel function of second kind of order n.

This function checks intesection of solid cube and hollow ellipsoid

This function checks intesection of solid cube and hollow sphere

close the ascii output unit

Write single log for the right scheme into its ascii file. This routine dumps the element data

Write single log for the right scheme into its ascii file. This routine calls the get_point routine and dumps the exact point data for the point specified in the tracking table

Initialize ascii output format. initialize spatial reduction if reduction is active

open the ascii transient output unit

Write the header of the ascii output files

close the asciiSpatial output unit

Write a spatial representation for elements into an ascii tracking file

Write a spatial representation for list of points into an ascii tracking file

Initialize asciiSpatial output format. initialize reduction if reduction is active

Open the output file for AsciiSpatial format.

Print harvester banner to screen

Dumps the debug_data into a file.

Close all files open for current time step.

Finalize the output

Initialize the output for a given mesh.

Read the output configuration from a Lua script.

Open the output for a given mesh.

This routine finalizes the vtu file i.e closing cellData xml and creating pvtu file to combile all parallel vtu files

This routine finalizes the vtu file i.e closing cellData xml and creating pvtu file to combile all parallel vtu files

This routine finalizes the vtu file i.e closing cellData xml and creating pvtu file to combile all parallel vtu files

This routine closes PVD file

Read the VTK output configuration from a Lua script.

Read the VTK output configuration from a Lua script.

Dump the given data (input) with the given name in the given format (vtu) to the given unit.

Dump the given data (input) with the given name in the given format (vtu) to the given unit.

Initialize the type for VTK format

Initialize the type for VTK format

Open the output files in VTK format.

Open the output files in VTK format.

Write the cell data description into the VTK files.

Write the mesh information into the VTK output files.

Write the mesh information into the VTK output files.

Convert the provided variable system data into celldata description in the given vtk files.

Convert the provided variable system data into celldata description in the given vtk files.

This function defines the density of the spinning (= co-rotating) vortex pair See the matlab file where the pressure is plot in the ase-testcases/ repo in musubi/crvp/matlab/crvp_velPress_plot.m

This function defines the y-velocity component of the spinning (= co-rotating) vortex pair Source: complex velocity potential of both vortices complex coordinates: z = x+i*y Gamma ... circulation

This function defines the y-velocity component of the spinning (= co-rotating) vortex pair Source: complex velocity potential of both vortices complex coordinates: z = x+i*y Gamma ... circulation

This function defines gauss pulse

identify additionally required neighbor elements run over the 'require' list of elements, which was accumulated before in init_elemLevels. The list includes neighbor elements of stencil neighbors, for stencils with the requireNeighNeigh attribute set. This is needed for example for LBM boundary stencil elements, which in turn require their compute stencil neighborhood to allow PULL operations from there

Check, on which partition a given element is located add required elements to corresponding lists: if remote, add to halo if ghost, add to resp. ghost list

Map requested halo to a position in my local fluid list or add recursively ghosts until I reach valid fluid elements return type of added element in levelPos(2) Also, non-existing elements are reported as such (levelPos(2))

create the intermediate, static list totalPnt, which holds pointers to the elem%TID list, but in an ordered fashion. The order is the same as it will be in the total list later on, i.e.: fluid, ghostFC, ghostFF, halo. this four sub-lists are within sorted by their treeID. Additionally, the process-wise collections of halo elements are collected into haloList by grouping the treeIDs according to their belonging process

Determine if the target element (local) targetID is fluid or ghost in the local process If fluid: do nothing, as it will be added later on anyway (or already is) ghostFromFiner (coarser than requested): add all virtual children, i.e. all levels between requested treeID and found one. ghostFromCoarser (finer than requested): not existing( localPos=0): add to halo

Invoke the identify_elements for each neighbor of the stencil and store the positions of the encountered elements

This function calculates the delta function used in the paper of Ota et al. [7] (bibliography of treelm) for a single value. $$w(r) = \left\{ \begin{array}{ll} \frac{1}{8}\left ( 3-2|r|+\sqrt{1+4|r| -4r^{2}} \right )& , |r| \le 1 \\ \frac{1}{8}\left ( 5-2|r|+\sqrt{-7+12|r|-4r^{2}} \right )& , 1 \le |r| \le 2 \\ 0& , else \end{array} \right.$$

This function calculates the delta function used in the paper of Ota et al. [7] (bibliography of treelm) for a vector by multiplying the results of the 1D version. $$W(r) = w\left(\frac{r_1}{\Delta x}\right) \cdot w\left(\frac{r_2}{\Delta x}\right) \cdot w\left(\frac{r_3}{\Delta x}\right) \cdot \frac{1}{\Delta x^3}$$

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

Interface to initialize growing array of points

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialize the dynamic array

initialization of a dynamic array

initialization of a dynamic array

initialization of a dynamic array

Include the subroutines for the dynamic array. initialization of a dynamic array

initialization of a dynamic array

initialize an element and optionally set contents

Initialize the environment, should be the very first call in the program and includes the call of MPI_Init.

Include the subroutines for the dynamic array.

Include the subroutines for the growing array.

This routine initialize growing array of points

This routine initialize interpolation matrix for least square fit

Defines how many properties there are.

Initialized random seed with idx

initialize stencil

initialize stencil

Initialize boundary conditions of a given tree.

r o u t i n e

t o

s p e c i f y

a

c o o r d i n a t e

t r a n s f o r m a t i o n

f o r

t h e

s t a t e

this routine encodes data of type int32 to base64 format

this routine encodes a single variable of type int32 into base64 format

this routine encodes data of type int64 to base64 format

this routine encodes a single variable of type int64 into base64 format

this routine encodes data of type int8 to base64 format

this routine encodes a single variable of type int8 into base64 format

Function computes intersection of ray with triangle

Returns the inverse of a matrix calculated by finding the LU decomposition. Depends on LAPACK.

This function provides the test for equality of two treeIDs.

This function provides a comparison of two paths.

This function provides a comparison of two paths.

This function provides a comparison of two paths.

This function provides a comparison of two paths.

This function provides the test for unequality of two path.

Relational operator to test if one operand is less than another.

Relational operator to test if one operand is less than or equal to another.

Load internal BC property for a single fully periodic element.

Load internal BC property for 1D Line.

Load internal BC property for 2D Slice.

This subroutine reads the data from disc and stores it in the tem_from_file_temporal_type.

This routine loads state names from target_state table

load crvp variables to set initial condition

load gauss pulse variables to set initial condition

load gauss pulse variables to set initial condition

Load space time function as constant

Load predefined space time function

Load spatial as constant

This subroutine load 3d parabola type variables from LUA file.

Load predefined spatial function

Reading the definition for a random distribution function.

This routine load base info for sponge layer

Load the treelmesh

load bc realarray data from disk

load bc qVal header from lua file, qVal from qVal.lsb

load bc property header from lua file, boundaryID from bnd.lsb

load bc qVal header from lua file, qVal from qVal.lsb

load bc realarray data from disk

A routine to load global informations from the header file in the given directory.

Load the property header from the mesh file.

This subroutine loads the information needed to read data from a file.

This subroutine load standard temporal function variables from LUA file.

This subroutine reads a mesh in treelm format from disk at the specified directory name.

Loading of a variable, that is defined in terms of an operation on other variables.

Converts a logical into a real.

Converts an array of logicals into an array of reals.

Routine to multiply scalat times vector

Read out the first integer in the line matched by the specified key in the text provided by print_self_status. The key should include all text in front of the integer. For example the peak memory consumption up to now could be extracted with: peakval = my_status_int('VmPeak:') If the key is not found 0 or the optionally defined value in def will be returned.

Reads out the first integer in the line matched by the specified key in the text provided by print_self_status. The key should include all text in front of the integer. For example the peak memory consumption up to now could be extracted with: peakval = my_status_int('VmPeak:') If the key is not found 0 or the optionally defined value in def will be returned.

This function returns the string in the line which starts with the specified key string in the text returned from print_self_status. The key string itself is excluded from the returned string. If the specified key is not found in the text an empty string will be returned.

This function returns the strings in the first line which starts with the specified key strings in the text returned from print_self_status.

Helper function to provide new unit, as long as F2008 newunit argument in open statement is not commonly available. To be used right in front of the open statement like this: myUnit = newunit() open(myUnit, ...)

Relational operator to test the not-equality of floating point numbers.

Relational operator to test the not-equality of two floating point arrays.

This subroutine partitions the given list for the quicksort algorithm

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

insert an element at a given position

append an array of values to the growing 2d array.

append an array of values to the growing 2d array.

append an array of values to the growing 2d array.

append an array of values to the growing 2d array.

append an array of values to the growing 2d array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

adds the value to a given position inside the growing array.

adds the values starting from a given position inside the growing array.

append a single value to the growing 2d array.

append a single value to the growing 2d array.

append a single value to the growing 2d array.

append a single value to the growing 2d array.

append a single value to the growing 2d array.

This routine checks for plane box overlap this routine is conversion of c-code tribox3.c planeBoxOverlap function

This function returns matrix entries for Linear polynomial for 1D stencil

This function returns matrix entries for Linear polynomial for 2D stencil

This function returns matrix entries for Linear polynomial for 3D stencil

This function returns matrix entries for quadratic polynomial for 1D stencil

This function returns matrix entries for quadratic polynomial for 2D stencil

This function returns matrix entries for quadratic polynomial for 3D stencil

return the position of a given value in the array val, which is what you usually want to know. it is the index of a given value

return the position of a given value in the array val, which is what you usually want to know. it is the index of a given value

return the position of a given value in the array val, which is what you usually want to know. it is the index of a given value

return the position of a given value in the array val, which is what you usually want to know. it is the index of a given value

return the position of a given value in the array val, which is what you usually want to know. it is the index of a given value

the actual position of a given value in the dynamic array

the actual position of a given value in the dynamic array

the actual position of a given value in the dynamic array

the actual position of a given value in the dynamic array

the actual position of a given value in the dynamic array

This subroutine reads out the status of the process if it is available in /proc/self/status, which is provided by the Linux operating system.

Quicksort for long integer kinds.

Function computes intersection of ray with cube

this routine encodes data of type real32 to base64 format

this routine encodes a single variable of type real32 into base64 format

this routine encodes data of type real64 to base64 format

this routine encodes a single variable of type real64 into base64 format

Converts a real into a logical.

Converts an array of reals into an array of logicals.

Report the actually existing elements, which were requested as halos from remote

Routine to return time reduction variables

Same as reductionTransient_forElement except it evaluate it multiply values from points

Same as reductionTransient_forPoint except it multiply values from points via indices which are setup before

Inverse Communication: Communicate, which elements each process needs from me.

Report the actually existing elements, which were requested as halos from remote

r o t a t e

a

s c a l a r ?

r o t a t e

a

t e n s o r

i n

3 D

b y

a

g i v e n

r o t a t i o n .

r o t a t e

a

v e c t o r

i n

2 D

b y

a

g i v e n

r o t a t i o n .

r o t a t e

a

v e c t o r

i n

3 D

b y

a

g i v e n

r o t a t i o n .

Set the offsets for accessing totallist, invsorted etc. arrays for fluids, ghosts and halos

This routine process instring and store information in spacetime function.

This routine stores provided points in method_data of spacetime_listElem and return the indices of points or evaluated value in the growing array. If spacetime function is time-independent then pre-compute values and store in growing array of evalVal in tem_pointData_type.

Determine the location (which process) of a requested element, which was identified to be located on one single process (can be local or remote) If it is located on a remote process: add to halo list local process: identify if ghost or fluid

This function checks intesection of solid cube and solid ellipsoid

This function checks intesection of solid cube and solid sphere

return the position of a given value in the list 'sorted'. this is mainly for internal usage. the sorted list is only a pointer list to the actual values thus, in order to get the index of a given value, you need to look up the entry in the sorted list. this is done by the positionofval routine

return the position of a given value in the list 'sorted'. this is mainly for internal usage. the sorted list is only a pointer list to the actual values thus, in order to get the index of a given value, you need to look up the entry in the sorted list. this is done by the positionofval routine

return the position of a given value in the list 'sorted'. this is mainly for internal usage. the sorted list is only a pointer list to the actual values thus, in order to get the index of a given value, you need to look up the entry in the sorted list. this is done by the positionofval routine

return the position of a given value in the list 'sorted'. this is mainly for internal usage. the sorted list is only a pointer list to the actual values thus, in order to get the index of a given value, you need to look up the entry in the sorted list. this is done by the positionofval routine

return the position of a given value in the list 'sorted'. this is mainly for internal usage. the sorted list is only a pointer list to the actual values thus, in order to get the index of a given value, you need to look up the entry in the sorted list. this is done by the positionofval routine

return the sorted position of a value in the given dynamic array

return the sorted position of a value in the given dynamic array

return the sorted position of a value in the given dynamic array

return the sorted position of a value in the given dynamic array

return the sorted position of a value in the given dynamic array

fix the dynamic array, meaning: store the array in the sorted order and cut off the trailing empty entries

fix the dynamic array, meaning: store the array in the sorted order and cut off the trailing empty entries

fix the dynamic array, meaning: store the array in the sorted order and cut off the trailing empty entries

fix the dynamic array, meaning: store the array in the sorted order and cut off the trailing empty entries

fix the dynamic array, meaning: store the array in the sorted order and cut off the trailing empty entries

fixing the dynamic array

fixing the dynamic array

fixing the dynamic array

fixing the dynamic array

fixing the dynamic array

This function returns sigma for the box shape spongelayer for coord for exponential profile.

This function calculates the sigma for the box shape spongelayer fom treeid for exponential profile

This function calculates the sigma for the 2d box shape sponge layer from coord for polynomial n5. Sponge profile: $$\sigma(x) = \sigma_A*3125*(L+x0-x)*(x-x0)^4)/(256*(L)^5$$ where, \sigma_A - sponge strength, L - thickness, x0 - start of sponge.

This function calculates the sigma for the box shape spongelayer fom treeid for polynomial n5 profile

This function calculates the sigma for the 2d box shape sponge layer from coord for polynomial n6. Sponge profile: $$\sigma(x) = \sigma_A*729*(L+x0-x)^2*(x-x0)^4)/(16*(L)^6$$ where, \sigma_A - sponge strength, L - thickness, x0 - start of sponge.

This function calculates the sigma for the box shape spongelayer fom treeid for polynomial n5 profile

This function returns the sigma for the 2d box shape spongelayer

This function returns the sigma for the spongelayer from treeids

This function calculates the sigma for the 2d box shape sponge layer from coord for polynomial n5. Sponge profile: $$\sigma(x) = \sigma_A*3125*(L+x0-x)*(x-x0)^4)/(256*(L)^5$$ where, \sigma_A - sponge strength, L - thickness, x0 - start of sponge.

This function calculates the sigma for the box shape spongelayer fom treeid for polynomial n5 profile

This function calculates the sigma for the 2d box shape sponge layer from coord for polynomial n6. Sponge profile: $$\sigma(x) = \sigma_A*729*(L+x0-x)^2*(x-x0)^4)/(16*(L)^6$$ where, \sigma_A - sponge strength, L - thickness, x0 - start of sponge.

This function calculates the sigma for the box shape spongelayer fom treeid for polynomial n5 profile

This function calculates the sigma for the spongelayer and fills up the res with the target state

This function calculates the sigma for the spongelayer and fills up the res with the target state

This function returns sigma for the box shape spongelayer for coord for exponential profile.

This function calculates the sigma for the box shape spongelayer fom treeid for exponential profile

This function calculates the sigma for the box shape sponge layer from coord for polynomial n5. Sponge profile: $$\sigma(x) = \sigma_A*3125*(L+x0-x)*(x-x0)^4)/(256*(L)^5$$ where, \sigma_A - sponge strength, L - thickness, x0 - start of sponge.

This function calculates the sigma for the box shape spongelayer fom treeid for polynomial n5 profile

This function calculates the sigma for the box shape sponge layer from coord for polynomial n6. Sponge profile: $$\sigma(x) = \sigma_A*729*(L+x0-x)^2*(x-x0)^4)/(16*(L)^6$$ where, \sigma_A - sponge strength, L - thickness, x0 - start of sponge.

This function calculates the sigma for the box shape spongelayer fom treeid for polynomial n5 profile

This function returns the sigma for the box shape spongelayer

This function returns the sigma for the spongelayer from treeids

This function calculates the sigma for the box shape sponge layer from coord for polynomial n5. Sponge profile: $$\sigma(x) = \sigma_A*3125*(L+x0-x)*(x-x0)^4)/(256*(L)^5$$ where, \sigma_A - sponge strength, L - thickness, x0 - start of sponge.

This function calculates the sigma for the box shape spongelayer fom treeid for polynomial n5 profile

This function calculates the sigma for the box shape sponge layer from coord for polynomial n6. Sponge profile: $$\sigma(x) = \sigma_A*729*(L+x0-x)^2*(x-x0)^4)/(16*(L)^6$$ where, \sigma_A - sponge strength, L - thickness, x0 - start of sponge.

This function calculates the sigma for the box shape spongelayer fom treeid for polynomial n5 profile

This function calculates the sigma for the spongelayer and fills up the res with the target state

This function calculates the sigma for the spongelayer and fills up the res with the target state

This function returns the sigma for the spongelayer computed from exponential function

This function returns the sigma for the exponential spongelayer from treeids

This function calculates the sigma for the spongeLayer from coord for the polynomial order n5. Sponge profile: $$\sigma(x) = \sigma_A*3125*(L+x0-x)*(x-x0)^4)/(256*(L)^5$$ where, \sigma_A - sponge strength, L - thickness, x0 - start of sponge.

This function calculates the sigma for the spongelayer using polynomial order 5 from treeids. Sponge profile: $$\sigma(x) = \sigma_A*3125*(L+x0-x)*(x-x0)^4)/(256*(L)^5$$ where, \sigma_A - sponge strength, L - thickness, x0 - start of sponge.

This function calculates the sigma for the spongeLayer from coord for the polynomial order n6. Sponge profile: $$\sigma(x) = \sigma_A*729*(L+x0-x)^2*(x-x0)^4)/(16*(L)^6$$ where, \sigma_A - sponge strength, L - thickness, x0 - start of sponge.

This function calculates the sigma for the spongeLayer from treeid for the polynomial order n6. Sponge profile: $$\sigma(x) = \sigma_A*729*(L+x0-x)^2*(x-x0)^4)/(16*(L)^6$$ where, \sigma_A - sponge strength, L - thickness, x0 - start of sponge.

This function returns the sigma for the planar shape spongelayer

This function returns the sigma for the spongelayer from treeids

This function calculates the sigma for the spongelayer and fills up the res with the target state

This function calculates the sigma for the spongelayer and fills up the res with the target state

This function returns the sigma for the radial viscosity spongelayer for 2D and 3D

This function returns the sigma for the radial viscosity spongelayer for 2D and 3D from treeIDs

This function calculates the sigma for the spongelayer radial from coord. Sponge profile: $$\sigma(x) = \sigma_A*3125*(L+x0-x)*(x-x0)^4)/(256*(L)^5$$ where, \sigma_A - sponge strength, L - thickness, x0 - start of sponge.

This function calculates the sigma for the radial spongelayer polynomial order 5 from treeids. Sponge profile: $$\sigma(x) = \sigma_A*3125*(L+x0-x)*(x-x0)^4)/(256*(L)^5$$ where, \sigma_A - sponge strength, L - thickness, x0 - start of sponge.

This function calculates the sigma for the spongelayer radial from coord for the polynomial order n6. Sponge profile: $$\sigma(x) = \sigma_A*729*(L+x0-x)^2*(x-x0)^4)/(16*(L)^6$$ where, \sigma_A - sponge strength, L - thickness, x0 - start of sponge.

This function calculates the sigma for the spongeLayer from treeid for the polynomial order n6. Sponge profile: $$\sigma(x) = \sigma_A*729*(L+x0-x)^2*(x-x0)^4)/(16*(L)^6$$ where, \sigma_A - sponge strength, L - thickness, x0 - start of sponge.

This function returns the sigma for the radial viscosity spongelayer for 2D and 3D

This function returns the sigma for the radial viscosity spongelayer for 2D and 3D from treeIDs

This function calculates the sigma for the radial viscosity spongelayer for 2D and 3D and fills up rest with target_state. This function is currectly used to define viscosity sponge in musubi.

This function calculates the sigma for the radial viscosity spongelayer for 2D and 3D from treeIDs and fills up rest with target_state. This function is currectly used to define viscosity sponge in musubi.

Convert a non-zero stencil direction {-1,1} to child coordinate {0,1}

Determine if the system is little or big endian

Abort the program with finalization of the environment

Dump abort criteria information to the specified outUnit.

Load the abortCriteria from a given configuration.

Define new abortCriteria.

Saves the abortCriteria to a given configuration.

This routine prepares the ground work for dumping the adapted mesh to disk. The new treeIDs which were created while adaptive refinement are sorted within the levelDescriptor elem type, and then passed to the dump_treelmesh routine for dumping.

A d d s

a n

d o w n w a r d

f a c e

d e p e n d e n c y

( c o a r s e -

f i n e )

t o

t h e

c o a r s e

f a c e

A d d s

a n

u p w a r d

f a c e

d e p e n d e n c y

( f i n e -

c o a r s e )

t o

t h e

f i n e

f a c e

Adds a new face to the face description.

Setup a new timer object, reset the values and give it a label for later identification

Allocate level descriptor and initilize its variables

append an entry to an allocatable array 1d with double precision If the array is too small, reallocate with double size

append an entry to an allocatable array 1d with double precision If the array is too small, reallocate with double size

Attaches another property to a given face (from left or right). If the face does not exist this routine will not do anything.

append an entry to an allocatable array 1d with single integer If the array is too small, reallocate with double size

append an entry to an allocatable array 1d with single integer at the end If the array is too small, reallocate with double size

append an entry to an allocatable array 1d with single integer If the array is too small, reallocate with double size

append an entry at the end of the integer list If the first entry is zero, write into that one

append an entry at the end of the integer list If the first entry is zero, write into that one Check, if the current entry already exists Count, how many elements there are in the list

append an entry to an allocatable array 1d with long integer If the array is too small, reallocate with double size

append an entry to an allocatable array 1d with single integer at the end If the array is too small, reallocate with double size

append an entry to an allocatable array 1d with long integer If the array is too small, reallocate with double size

append an entry to an allocatable array 1d with long integer If the array is too small, reallocate with double size

append an entry at the end of the integer list If the first entry is zero, write into that one

append an entry at the end of the integer list If the first entry is zero, write into that one Check, if the current entry already exists Count, how many elements there are in the list

append an entry to an allocatable array 1d with single precision If the array is too small, reallocate with double size

append an entry to an allocatable array 1d with single precision If the array is too small, reallocate with double size

Append nVals new timers to the timer collection provided in 'me'.

This routine loads coupling defintion from boundary condition table

Sets the source coordinate for the rotated unit cube

Sets the source coordinate for the rotated unit cube

Converts a bool to a string.

Converts an array of booleans to a string.

Read all the configuration options for load balancing from the configuration.

Return splitting positions based on the weights provided by each rank.

This function provides the coordinates of the element barycenters for a set of given element coordinates on the same refinement level.

The following function provides the coordinates of the barycenter for a given treeID in the complete mesh.

Get the boundary property position in the list of all properties in tree.

Create the boundary property for a restricted set of elements given by sublist (position of elements in tree, usually from a subtree).

This function checks for intersection of box and cube

Extracts all the faces which will be computed by current rank.

R o u t i n e

t o

g e t

f a c e

i n f o r m a t i o n

f o r

y o u r

w h o l e

m e s h .

S u b r o u t i n e

t o

b u i l d

c o m m u n i c a t i o n

b u f f e r s

f o r

t h e

f a c e s .

R o u t i n e

t o

g e n e r a t e

t h e

s e p a r a t e d

l i s t s

o f

f a c e s

f o r

S u b r o u t i n e

t o

b u i l d

c o m m u n i c a t i o n

b u f f e r s

f o r

t h e

f a c e s

t h e

S u b r o u t i n e

t o

b u i l d

c o m m u n i c a t i o n

b u f f e r s

f o r

t h e

f a c e s

t h e

Extracts all the faces which will be computed by current rank.

Building neighor array

Update the neighor arrays depending on what is given in the element stencil

Update the neighor arrays depending on what is given in the element stencil

This routine builds mapping from tree%treeID to given property data array like boundary_ID or qVal

Build the vertical dependencies of ghost elements

Evaluate the imbalance of all the processes by each rank.

Run over all 8 vertices for each element in the treeID list, calculate its coordinates and add its position to the map.

Run over all 8 vertices for each element in the treeID list, calculate its coordinates and add its position to the map.

This subroutine calculates the vertex coordinate for a given element depending on the treeID, the global tree, the q-Value and iVrtx

This subroutine calculates the surface area attached to each point

Check for neighboring elements to a given point.

Create subtree from the intersection of canonical shapes and inTree

Generate points using segments on canoND and add those points to a growing array of points if a point is found in subTree

interface to write out canonical shape(s) in lua format to a file

Write out a canonicalND shape in lua format

Write out an array of canonical shapes in lua format

check whether the current label is already given

This function delivers of TreeID, which child number it is from its parent

deallocate the stencil treeID neighbor arrays for each element This routine can only be called after build_horizontalDependencies

deallocate all dispensable dynamic data structures and arrays

C o l l e c t s

a l l

t h e

f a c e s

w h i c h

h a v e

a t

l e a s t

o n e

n e i g h b o r i n g

Load the color property from disk.

Write the color property to disk.

All to all exchange of a single integer.

Allocate tem_communication_type and its variables

Routine to build communication buffer using elemRanks. This routine can be used only if all elements need to be communicated but they need process-wise seperation. Uses nScalars to get position in the value array to communicate. For send buffer: elemRanks contains target ranks to send data to For recv buffer: elemRanks contains source ranks to recv data from

Write communication type data to nUnit (debugging routine)

Finalize the environment. This routine is called by tem_finalize which should be the very last action in a program.