Go to the source code of this file.
Definition at line 83 of file deflate.h.
Class Members |
ct_data * |
dyn_tree |
|
int |
max_code |
|
static_tree_desc * |
stat_desc |
|
Definition at line 97 of file deflate.h.
Class Members |
ush |
bi_buf |
|
int |
bi_valid |
|
ush |
bl_count[15+1] |
|
struct tree_desc_s |
bl_desc |
|
struct ct_data_s |
bl_tree[2 *19+1] |
|
long |
block_start |
|
ushf * |
d_buf |
|
struct tree_desc_s |
d_desc |
|
uch |
depth[2 *(256+1+29)+1] |
|
struct ct_data_s |
dyn_dtree[2 *30+1] |
|
struct ct_data_s |
dyn_ltree[(2 *(256+1+29)+1)] |
|
uInt |
good_match |
|
gz_headerp |
gzhead |
|
uInt |
gzindex |
|
uInt |
hash_bits |
|
uInt |
hash_mask |
|
uInt |
hash_shift |
|
uInt |
hash_size |
|
Posf * |
head |
|
int |
heap[2 *(256+1+29)+1] |
|
int |
heap_len |
|
int |
heap_max |
|
ulg |
high_water |
|
uInt |
ins_h |
|
uInt |
insert |
|
uchf * |
l_buf |
|
struct tree_desc_s |
l_desc |
|
int |
last_flush |
|
uInt |
last_lit |
|
int |
level |
|
uInt |
lit_bufsize |
|
uInt |
lookahead |
|
int |
match_available |
|
uInt |
match_length |
|
uInt |
match_start |
|
uInt |
matches |
|
uInt |
max_chain_length |
|
uInt |
max_lazy_match |
|
Byte |
method |
|
int |
nice_match |
|
ulg |
opt_len |
|
uInt |
pending |
|
Bytef * |
pending_buf |
|
ulg |
pending_buf_size |
|
Bytef * |
pending_out |
|
Posf * |
prev |
|
uInt |
prev_length |
|
IPos |
prev_match |
|
ulg |
static_len |
|
int |
status |
|
int |
strategy |
|
z_streamp |
strm |
|
uInt |
strstart |
|
uInt |
w_bits |
|
uInt |
w_mask |
|
uInt |
w_size |
|
Bytef * |
window |
|
ulg |
window_size |
|
int |
wrap |
|
#define _tr_tally_dist |
( |
|
s, |
|
|
|
distance, |
|
|
|
length, |
|
|
|
flush |
|
) |
| |
Value: ush dist = (distance); \
s->d_buf[s->last_lit] = dist; \
s->l_buf[s->last_lit++] = len; \
dist--; \
s->dyn_dtree[
d_code(dist)].Freq++; \
flush = (s->last_lit == s->lit_bufsize-1); \
}
Definition at line 330 of file deflate.h.
#define _tr_tally_lit |
( |
|
s, |
|
|
|
c, |
|
|
|
flush |
|
) |
| |
Value: s->d_buf[s->last_lit] = 0; \
s->l_buf[s->last_lit++] = cc; \
s->dyn_ltree[cc].Freq++; \
flush = (s->last_lit == s->lit_bufsize-1); \
}
Definition at line 323 of file deflate.h.
#define max_insert_length max_lazy_match |
#define put_byte |
( |
|
s, |
|
|
|
c |
|
) |
| {s->pending_buf[s->pending++] = (c);} |
void _tr_stored_block |
( |
| ) |
|