MPI-AMRVAC  2.2
The MPI - Adaptive Mesh Refinement - Versatile Advection Code
Functions/Subroutines
forest.t File Reference

Go to the source code of this file.

Functions/Subroutines

subroutine init_forest_root
 build root forest More...
 
subroutine init_tree_leaf (tree, igD, level, igrid, ipe, active)
 
subroutine coarsen_tree_leaf (igrid, ipe, child_igrid, child_ipe, active)
 
subroutine refine_tree_leaf (child_igrid, child_ipe, igrid, ipe, active)
 
subroutine change_ipe_tree_leaf (recv_igrid, recv_ipe, send_igrid, send_ipe)
 
subroutine add_to_linked_list (level, tree)
 
subroutine delete_from_linked_list (level, tree)
 
subroutine write_forest (file_handle)
 
recursive subroutine write_node (tree)
 
subroutine read_forest (file_handle)
 
recursive subroutine read_node (tree, igD, level)
 

Function/Subroutine Documentation

◆ add_to_linked_list()

subroutine add_to_linked_list ( integer, intent(in)  level,
type(tree_node_ptr tree 
)

Definition at line 236 of file forest.t.

◆ change_ipe_tree_leaf()

subroutine change_ipe_tree_leaf ( integer, intent(in)  recv_igrid,
integer, intent(in)  recv_ipe,
integer, intent(in)  send_igrid,
integer, intent(in)  send_ipe 
)

Definition at line 218 of file forest.t.

◆ coarsen_tree_leaf()

subroutine coarsen_tree_leaf ( integer, intent(in)  igrid,
integer, intent(in)  ipe,
integer, dimension(2^d&), intent(in)  child_igrid,
integer, dimension(2^d&), intent(in)  child_ipe,
logical, intent(out)  active 
)

Definition at line 83 of file forest.t.

Here is the call graph for this function:

◆ delete_from_linked_list()

subroutine delete_from_linked_list ( integer, intent(in)  level,
type(tree_node_ptr tree 
)

Definition at line 256 of file forest.t.

◆ init_forest_root()

subroutine init_forest_root ( )

build root forest

Definition at line 3 of file forest.t.

Here is the call graph for this function:

◆ init_tree_leaf()

subroutine init_tree_leaf ( type(tree_node_ptr tree,
integer, intent(in)  ig,
integer, intent(in)  D,
integer, intent(in)  level,
integer, intent(in)  igrid,
integer, intent(in)  ipe,
logical, intent(in)  active 
)

Definition at line 50 of file forest.t.

Here is the call graph for this function:

◆ read_forest()

subroutine read_forest ( integer, intent(in)  file_handle)

Definition at line 318 of file forest.t.

Here is the call graph for this function:

◆ read_node()

recursive subroutine read_forest::read_node ( type(tree_node_ptr tree,
integer, intent(in)  ig,
integer, intent(in)  D,
integer, intent(in)  level 
)

Definition at line 356 of file forest.t.

Here is the call graph for this function:

◆ refine_tree_leaf()

subroutine refine_tree_leaf ( integer, dimension(2^d&), intent(in)  child_igrid,
integer, dimension(2^d&), intent(in)  child_ipe,
integer, intent(in)  igrid,
integer, intent(in)  ipe,
logical, intent(out)  active 
)

Definition at line 151 of file forest.t.

Here is the call graph for this function:

◆ write_forest()

subroutine write_forest ( integer, intent(in)  file_handle)

Definition at line 283 of file forest.t.

Here is the call graph for this function:

◆ write_node()

recursive subroutine write_forest::write_node ( type(tree_node_ptr tree)

Definition at line 299 of file forest.t.