cfitsio  3390
Data Fields
internal_state Struct Reference

#include <zlib.h>

Collaboration diagram for internal_state:
Collaboration graph
[legend]

Data Fields

z_streamp strm
 
int status
 
Bytefpending_buf
 
ulg pending_buf_size
 
Bytefpending_out
 
uInt pending
 
int wrap
 
gz_headerp gzhead
 
uInt gzindex
 
Byte method
 
int last_flush
 
uInt w_size
 
uInt w_bits
 
uInt w_mask
 
Bytefwindow
 
ulg window_size
 
Posfprev
 
Posfhead
 
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]
 
uchfl_buf
 
uInt lit_bufsize
 
uInt last_lit
 
ushfd_buf
 
ulg opt_len
 
ulg static_len
 
uInt matches
 
int last_eob_len
 
ush bi_buf
 
int bi_valid
 
ulg high_water
 
int dummy
 

Field Documentation

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

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