#include <deflate.h>
int internal_state::status |
Bytef* internal_state::pending_buf |
ulg internal_state::pending_buf_size |
Bytef* internal_state::pending_out |
uInt internal_state::pending |
uInt internal_state::gzindex |
Byte internal_state::method |
int internal_state::last_flush |
uInt internal_state::w_size |
uInt internal_state::w_bits |
uInt internal_state::w_mask |
Bytef* internal_state::window |
ulg internal_state::window_size |
Posf* internal_state::prev |
Posf* internal_state::head |
uInt internal_state::ins_h |
uInt internal_state::hash_size |
uInt internal_state::hash_bits |
uInt internal_state::hash_mask |
uInt internal_state::hash_shift |
long internal_state::block_start |
uInt internal_state::match_length |
IPos internal_state::prev_match |
int internal_state::match_available |
uInt internal_state::strstart |
uInt internal_state::match_start |
uInt internal_state::lookahead |
uInt internal_state::prev_length |
uInt internal_state::max_chain_length |
uInt internal_state::max_lazy_match |
int internal_state::level |
int internal_state::strategy |
uInt internal_state::good_match |
int internal_state::nice_match |
struct ct_data_s internal_state::dyn_ltree[(2 *(256+1+29)+1)] |
struct ct_data_s internal_state::dyn_dtree[2 *30+1] |
struct ct_data_s internal_state::bl_tree[2 *19+1] |
ush internal_state::bl_count[15+1] |
int internal_state::heap[2 *(256+1+29)+1] |
int internal_state::heap_len |
int internal_state::heap_max |
uch internal_state::depth[2 *(256+1+29)+1] |
uchf* internal_state::l_buf |
uInt internal_state::lit_bufsize |
uInt internal_state::last_lit |
ushf* internal_state::d_buf |
ulg internal_state::opt_len |
ulg internal_state::static_len |
uInt internal_state::matches |
uInt internal_state::insert |
ush internal_state::bi_buf |
int internal_state::bi_valid |
ulg internal_state::high_water |
int internal_state::dummy |
The documentation for this struct was generated from the following files: