Dendro  5.01
Dendro in Greek language means tree. The Dendro library is a large scale (262K cores on ORNL's Titan) distributed memory adaptive octree framework. The main goal of Dendro is to perform large scale multiphysics simulations efficeiently in mordern supercomputers. Dendro consists of efficient parallel data structures and algorithms to perform variational ( finite element) methods and finite difference mthods on 2:1 balanced arbitary adaptive octrees which enables the users to perform simulations raning from black holes (binary black hole mergers) to blood flow in human body, where applications ranging from relativity, astrophysics to biomedical engineering.
Public Attributes | List of all members
internal_state Struct Reference
Collaboration diagram for internal_state:
Collaboration graph
[legend]

Public Attributes

z_streamp strm
 
int status
 
Bytef * pending_buf
 
ulg pending_buf_size
 
Bytef * pending_out
 
ulg pending
 
int wrap
 
gz_headerp gzhead
 
ulg gzindex
 
Byte method
 
int last_flush
 
uInt w_size
 
uInt w_bits
 
uInt w_mask
 
Bytef * window
 
ulg window_size
 
Posf * prev
 
Posf * head
 
uInt ins_h
 
uInt hash_size
 
uInt hash_bits
 
uInt hash_mask
 
uInt hash_shift
 
long block_start
 
uInt match_length
 
IPos prev_match
 
int match_available
 
uInt strstart
 
uInt match_start
 
uInt lookahead
 
uInt prev_length
 
uInt max_chain_length
 
uInt max_lazy_match
 
int level
 
int strategy
 
uInt good_match
 
int nice_match
 
struct ct_data_s dyn_ltree [HEAP_SIZE]
 
struct ct_data_s dyn_dtree [2 *D_CODES+1]
 
struct ct_data_s bl_tree [2 *BL_CODES+1]
 
struct tree_desc_s l_desc
 
struct tree_desc_s d_desc
 
struct tree_desc_s bl_desc
 
ush bl_count [MAX_BITS+1]
 
int heap [2 *L_CODES+1]
 
int heap_len
 
int heap_max
 
uch depth [2 *L_CODES+1]
 
uchf * l_buf
 
uInt lit_bufsize
 
uInt last_lit
 
ushf * d_buf
 
ulg opt_len
 
ulg static_len
 
uInt matches
 
uInt insert
 
ush bi_buf
 
int bi_valid
 
ulg high_water
 

The documentation for this struct was generated from the following file: