Go to the documentation of this file.
34 #define LENGTH_CODES 29
40 #define L_CODES (LITERALS + 1 + LENGTH_CODES)
49 #define HEAP_SIZE (2 * L_CODES + 1)
56 #define EXTRA_STATE 69
58 #define COMMENT_STATE 91
59 #define HCRC_STATE 103
60 #define BUSY_STATE 113
61 #define FINISH_STATE 666
182 #define max_insert_length max_lazy_match
275 #define put_byte(s, c) \
277 s->pending_buf[s->pending++] = (c); \
280 #define MIN_LOOKAHEAD (MAX_MATCH + MIN_MATCH + 1)
285 #define MAX_DIST(s) ((s)->w_size - MIN_LOOKAHEAD)
296 void _tr_stored_block
299 #define d_code(dist) \
300 ((dist) < 256 ? _dist_code[dist] : _dist_code[256 + ((dist) >> 7)])
309 #if defined(GEN_TREES_H) || !defined(STDC)
317 #define _tr_tally_lit(s, c, flush) \
320 s->d_buf[s->last_lit] = 0; \
321 s->l_buf[s->last_lit++] = cc; \
322 s->dyn_ltree[cc].Freq++; \
323 flush = (s->last_lit == s->lit_bufsize - 1); \
325 #define _tr_tally_dist(s, distance, length, flush) \
327 uch len = (length); \
328 ush dist = (distance); \
329 s->d_buf[s->last_lit] = dist; \
330 s->l_buf[s->last_lit++] = len; \
332 s->dyn_ltree[_length_code[len] + LITERALS + 1].Freq++; \
333 s->dyn_dtree[d_code(dist)].Freq++; \
334 flush = (s->last_lit == s->lit_bufsize - 1); \
337 #define _tr_tally_lit(s, c, flush) flush = _tr_tally(s, 0, c)
338 #define _tr_tally_dist(s, distance, length, flush) \
339 flush = _tr_tally(s, distance, length)
struct ct_data_s bl_tree[2 *BL_CODES+1]
struct static_tree_desc_s static_tree_desc
GLint GLint GLsizei GLsizei GLsizei depth
gz_header FAR * gz_headerp
void _tr_init OF((deflate_state *s))
struct ct_data_s dyn_ltree[HEAP_SIZE]
struct tree_desc_s d_desc
static_tree_desc * stat_desc
struct ct_data_s dyn_dtree[2 *D_CODES+1]
struct tree_desc_s bl_desc
struct tree_desc_s l_desc
struct internal_state deflate_state
struct tree_desc_s tree_desc
Page generated by Doxygen 1.8.17 for MRPT 1.9.9 Git: ad3a9d8ae Tue May 1 23:10:22 2018 -0700 at miƩ 12 jul 2023 10:03:34 CEST | |