#include "zutil.h"
Include dependency graph for deflate.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Classes | |
| struct | ct_data_s |
| struct | internal_state |
| struct | tree_desc_s |
Macros | |
| #define | _tr_tally_dist(s, distance, length, flush) |
| #define | _tr_tally_lit(s, c, flush) |
| #define | BL_CODES 19 |
| #define | BUSY_STATE 113 |
| #define | Code fc.code |
| #define | COMMENT_STATE 91 |
| #define | d_code(dist) ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)]) |
| #define | D_CODES 30 |
| #define | Dad dl.dad |
| #define | EXTRA_STATE 69 |
| #define | FINISH_STATE 666 |
| #define | Freq fc.freq |
| #define | GZIP |
| #define | HCRC_STATE 103 |
| #define | HEAP_SIZE (2*L_CODES+1) |
| #define | INIT_STATE 42 |
| #define | L_CODES (LITERALS+1+LENGTH_CODES) |
| #define | Len dl.len |
| #define | LENGTH_CODES 29 |
| #define | LITERALS 256 |
| #define | MAX_BITS 15 |
| #define | MAX_DIST(s) ((s)->w_size-MIN_LOOKAHEAD) |
| #define | max_insert_length max_lazy_match |
| #define | MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1) |
| #define | NAME_STATE 73 |
| #define | put_byte(s, c) {s->pending_buf[s->pending++] = (c);} |
Typedefs | |
| typedef struct ct_data_s | ct_data |
| typedef struct internal_state | deflate_state |
| typedef unsigned | IPos |
| typedef ush | Pos |
| typedef Pos FAR | Posf |
| typedef struct static_tree_desc_s | static_tree_desc |
| typedef struct tree_desc_s | tree_desc |
Functions | |
| void _tr_init | OF ((deflate_state *s)) |
| int _tr_tally | OF ((deflate_state *s, unsigned dist, unsigned lc)) |
| void _tr_flush_block | OF ((deflate_state *s, charf *buf, ulg stored_len, int eof)) |
Variables | |
| uch | _dist_code [] |
| uch | _length_code [] |
Macro Definition Documentation
| #define _tr_tally_dist | ( | s, | |
| distance, | |||
| length, | |||
| flush | |||
| ) |
Value:
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); \
}
| #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); \
}
| #define d_code | ( | dist | ) | ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)]) |
| #define L_CODES (LITERALS+1+LENGTH_CODES) |
| #define MAX_DIST | ( | s | ) | ((s)->w_size-MIN_LOOKAHEAD) |
| #define put_byte | ( | s, | |
| c | |||
| ) | {s->pending_buf[s->pending++] = (c);} |
Typedef Documentation
| typedef struct internal_state deflate_state |
| typedef struct static_tree_desc_s static_tree_desc |
| typedef struct tree_desc_s tree_desc |
Function Documentation
| void _tr_init OF | ( | (deflate_state *s) | ) |
| int _tr_tally OF | ( | (deflate_state *s, unsigned dist, unsigned lc) | ) |
| void _tr_flush_block OF | ( | (deflate_state *s, charf *buf, ulg stored_len, int eof) | ) |