Go to the documentation of this file.
16 #if defined( INC_ALL )
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
180 # define max_insert_length max_lazy_match
279 #define put_byte(s, c) {s->pending_buf[s->pending++] = (c);}
282 #define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
287 #define MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD)
292 #define WIN_INIT MAX_MATCH
305 #define d_code(dist) \
306 ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
315 #if defined(GEN_TREES_H) || !defined(STDC)
319 extern const uch _length_code[];
320 extern const uch _dist_code[];
323 # define _tr_tally_lit(s, c, flush) \
325 s->d_buf[s->last_lit] = 0; \
326 s->l_buf[s->last_lit++] = cc; \
327 s->dyn_ltree[cc].Freq++; \
328 flush = (s->last_lit == s->lit_bufsize-1); \
330 # define _tr_tally_dist(s, distance, length, flush) \
331 { uch len = (length); \
332 ush dist = (distance); \
333 s->d_buf[s->last_lit] = dist; \
334 s->l_buf[s->last_lit++] = len; \
336 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
337 s->dyn_dtree[d_code(dist)].Freq++; \
338 flush = (s->last_lit == s->lit_bufsize-1); \
341 # define _tr_tally_lit(s, c, flush) flush = _tr_tally(s, 0, c)
342 # define _tr_tally_dist(s, distance, length, flush) \
343 flush = _tr_tally(s, distance, length)