Go to the source code of this file.
|
#define | GZIP |
|
#define | LENGTH_CODES 29 |
|
#define | LITERALS 256 |
|
#define | L_CODES (LITERALS+1+LENGTH_CODES) |
|
#define | D_CODES 30 |
|
#define | BL_CODES 19 |
|
#define | HEAP_SIZE (2*L_CODES+1) |
|
#define | MAX_BITS 15 |
|
#define | INIT_STATE 42 |
|
#define | EXTRA_STATE 69 |
|
#define | NAME_STATE 73 |
|
#define | COMMENT_STATE 91 |
|
#define | HCRC_STATE 103 |
|
#define | BUSY_STATE 113 |
|
#define | FINISH_STATE 666 |
|
#define | Freq fc.freq |
|
#define | Code fc.code |
|
#define | Dad dl.dad |
|
#define | Len dl.len |
|
#define | max_insert_length max_lazy_match |
|
#define | put_byte(s, c) {s->pending_buf[s->pending++] = (c);} |
|
#define | MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) |
|
#define | MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD) |
|
#define | WIN_INIT MAX_MATCH |
|
#define | d_code(dist) ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)]) |
|
#define | _tr_tally_lit(s, c, flush) |
|
#define | _tr_tally_dist(s, distance, length, flush) |
|
|
void ZLIB_INTERNAL _tr_init | OF ((deflate_state *s)) |
|
int ZLIB_INTERNAL _tr_tally | OF ((deflate_state *s, unsigned dist, unsigned lc)) |
|
void ZLIB_INTERNAL _tr_flush_block | OF ((deflate_state *s, charf *buf, ulg stored_len, int last)) |
|
|
uch ZLIB_INTERNAL | _length_code [] |
|
uch ZLIB_INTERNAL | _dist_code [] |
|
◆ _tr_tally_dist
#define _tr_tally_dist |
( |
|
s, |
|
|
|
distance, |
|
|
|
length, |
|
|
|
flush |
|
) |
| |
Value:{ uch len = (length); \
ush dist = (distance); \
s->d_buf[s->last_lit] = dist; \
s->l_buf[s->last_lit++] = len; \
dist--; \
s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
s->dyn_dtree[d_code(dist)].Freq++; \
flush = (s->last_lit == s->lit_bufsize-1); \
}
◆ _tr_tally_lit
#define _tr_tally_lit |
( |
|
s, |
|
|
|
c, |
|
|
|
flush |
|
) |
| |
Value:{ uch cc = (c); \
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); \
}