Go to the source code of this file.
◆ _tr_tally_dist
#define _tr_tally_dist |
( |
| s, |
|
|
| distance, |
|
|
| length, |
|
|
| flush ) |
Value:
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); \
}
#define LITERALS
Definition deflate.h:33
#define d_code(dist)
Definition deflate.h:301
uch ZLIB_INTERNAL _length_code[]
Definition trees.h:102
unsigned short ush
Definition zutil.h:39
unsigned char uch
Definition zutil.h:37
◆ _tr_tally_lit
#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); \
}
◆ BL_CODES
◆ BUSY_STATE
◆ Code
◆ COMMENT_STATE
◆ d_code
Value:
uch ZLIB_INTERNAL _dist_code[]
Definition trees.h:73
◆ D_CODES
◆ Dad
◆ EXTRA_STATE
◆ FINISH_STATE
◆ Freq
◆ GZIP
◆ HCRC_STATE
◆ HEAP_SIZE
◆ INIT_STATE
◆ L_CODES
◆ Len
◆ LENGTH_CODES
◆ LITERALS
◆ MAX_BITS
◆ MAX_DIST
Value:
#define MIN_LOOKAHEAD
Definition deflate.h:278
◆ max_insert_length
#define max_insert_length max_lazy_match |
◆ MIN_LOOKAHEAD
◆ NAME_STATE
◆ put_byte
#define put_byte |
( |
| s, |
|
|
| c ) |
Value:{s->pending_buf[s->pending++] = (c);}
◆ WIN_INIT
◆ ct_data
◆ deflate_state
◆ IPos
◆ Pos
◆ Posf
◆ static_tree_desc
◆ tree_desc
◆ OF() [1/3]
◆ OF() [2/3]
◆ OF() [3/3]
◆ _dist_code
◆ _length_code