Go to the source code of this file.
◆ _tr_tally_dist
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); \
}
unsigned s
Definition inflate.c:1555
uch _length_code[]
Definition trees.c:108
#define LITERALS
Definition deflate.h:35
#define d_code(dist)
Definition deflate.h:292
png_uint_32 length
Definition png.c:2247
int flush(__G__ rawbuf, size, unshrink) __GDEF uch *rawbuf
unsigned short ush
Definition unzip.h:402
unsigned char uch
Definition unzip.h:401
◆ _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); \
}
return c
Definition crypt.c:175
◆ BL_CODES
◆ BUSY_STATE
◆ Code
◆ COMMENT_STATE
◆ d_code
Value:
uch _dist_code[]
Definition trees.c:102
◆ 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.c:113
◆ max_insert_length
| #define max_insert_length max_lazy_match |
◆ MIN_LOOKAHEAD
◆ NAME_STATE
◆ NO_DUMMY_DECL
◆ put_byte
| #define put_byte |
( |
| s, |
|
|
| c ) |
Value:{
s->pending_buf[
s->pending++] = (
c);}
◆ 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