ct_data
struct ct_data *ct = NULL; /* client handle */
ct = (struct ct_data *)mem_alloc(sizeof (*ct));
mem_free(ct, sizeof (struct ct_data));
struct ct_data *ct = (struct ct_data *) cl->cl_private;
struct ct_data *ct;
ct = (struct ct_data *) cl->cl_private;
struct ct_data *ct;
ct = (struct ct_data *)cl->cl_private;
struct ct_data *ct;
ct = (struct ct_data *)cl->cl_private;
struct ct_data *ct = (struct ct_data *) cl->cl_private;
ct = (struct ct_data *) cl->cl_private;
mem_free(ct, sizeof(struct ct_data));
struct ct_data *ct = (struct ct_data *)ctp;
struct ct_data *ct = (struct ct_data *)ctp;
ct_data *dyn_tree; /* the dynamic tree */
compress_block(deflate_state *s, const ct_data *ltree, const ct_data *dtree)
const ct_data *static_tree; /* static tree or NULL */
{(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
local void pqdownheap (deflate_state *s, ct_data *tree, int k);
local void gen_codes (ct_data *tree, int max_code, ushf *bl_count);
local void scan_tree (deflate_state *s, ct_data *tree, int max_code);
local void send_tree (deflate_state *s, ct_data *tree, int max_code);
local void compress_block (deflate_state *s, const ct_data *ltree,
const ct_data *dtree);
gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
pqdownheap(deflate_state *s, ct_data *tree, int k) /* the tree to restore, node to move down */
ct_data *tree = desc->dyn_tree;
const ct_data *stree = desc->stat_desc->static_tree;
gen_codes (ct_data *tree, int max_code, ushf *bl_count)
ct_data *tree = desc->dyn_tree;
const ct_data *stree = desc->stat_desc->static_tree;
gen_codes ((ct_data *)tree, max_code, s->bl_count);
scan_tree (deflate_state *s, ct_data *tree, int max_code)
send_tree (deflate_state *s, ct_data *tree, int max_code) /* same as above */
scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
local ct_data static_ltree[L_CODES+2];
send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
local ct_data static_dtree[D_CODES];
compress_block(s, (const ct_data *)static_ltree,
(const ct_data *)static_dtree);
compress_block(s, (const ct_data *)s->dyn_ltree,
(const ct_data *)s->dyn_dtree);
local const ct_data static_ltree[L_CODES+2] = {
local const ct_data static_dtree[D_CODES] = {
local ct_data static_ltree[L_CODES+2];
local ct_data static_dtree[D_CODES];
ct_data *static_tree; /* static tree or NULL */
local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
local void compress_block OF((deflate_state *s, ct_data *ltree,
ct_data *dtree));
gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
pqdownheap(deflate_state *s, ct_data *tree, int k)
ct_data *tree = desc->dyn_tree;
ct_data *stree = desc->stat_desc->static_tree;
gen_codes(ct_data *tree, int max_code, ushf *bl_count)
ct_data *tree = desc->dyn_tree;
ct_data *stree = desc->stat_desc->static_tree;
gen_codes ((ct_data *)tree, max_code, s->bl_count);
scan_tree (deflate_state *s, ct_data *tree, int max_code)
send_tree(deflate_state *s, ct_data *tree, int max_code)
scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree);
compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
compress_block(deflate_state *s, ct_data *ltree, ct_data *dtree)
ct_data *dyn_tree; /* the dynamic tree */
*ptr = (void *)PHYS_TO_DMAP(ct->ct_data);
uint64_t ct_data;
ct_data *dyn_tree; /* the dynamic tree */
compress_block(deflate_state *s, const ct_data *ltree, const ct_data *dtree)
const ct_data *static_tree; /* static tree or NULL */
{(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
local void pqdownheap (deflate_state *s, ct_data *tree, int k);
local void gen_codes (ct_data *tree, int max_code, ushf *bl_count);
local void scan_tree (deflate_state *s, ct_data *tree, int max_code);
local void send_tree (deflate_state *s, ct_data *tree, int max_code);
local void compress_block (deflate_state *s, const ct_data *ltree,
const ct_data *dtree);
gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
pqdownheap(deflate_state *s, ct_data *tree, int k) /* the tree to restore, node to move down */
ct_data *tree = desc->dyn_tree;
const ct_data *stree = desc->stat_desc->static_tree;
gen_codes (ct_data *tree, int max_code, ushf *bl_count)
ct_data *tree = desc->dyn_tree;
const ct_data *stree = desc->stat_desc->static_tree;
gen_codes ((ct_data *)tree, max_code, s->bl_count);
scan_tree (deflate_state *s, ct_data *tree, int max_code)
send_tree (deflate_state *s, ct_data *tree, int max_code) /* same as above */
scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
local ct_data static_ltree[L_CODES+2];
send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
local ct_data static_dtree[D_CODES];
compress_block(s, (const ct_data *)static_ltree,
(const ct_data *)static_dtree);
compress_block(s, (const ct_data *)s->dyn_ltree,
(const ct_data *)s->dyn_dtree);
local const ct_data static_ltree[L_CODES+2] = {
local const ct_data static_dtree[D_CODES] = {
ct_data *dyn_tree; /* the dynamic tree */
compress_block(deflate_state *s, const ct_data *ltree, const ct_data *dtree)
const ct_data *static_tree; /* static tree or NULL */
{(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
local void pqdownheap (deflate_state *s, ct_data *tree, int k);
local void gen_codes (ct_data *tree, int max_code, ushf *bl_count);
local void scan_tree (deflate_state *s, ct_data *tree, int max_code);
local void send_tree (deflate_state *s, ct_data *tree, int max_code);
local void compress_block (deflate_state *s, const ct_data *ltree,
const ct_data *dtree);
gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
pqdownheap(deflate_state *s, ct_data *tree, int k) /* the tree to restore, node to move down */
ct_data *tree = desc->dyn_tree;
const ct_data *stree = desc->stat_desc->static_tree;
gen_codes (ct_data *tree, int max_code, ushf *bl_count)
ct_data *tree = desc->dyn_tree;
const ct_data *stree = desc->stat_desc->static_tree;
gen_codes ((ct_data *)tree, max_code, s->bl_count);
scan_tree (deflate_state *s, ct_data *tree, int max_code)
send_tree (deflate_state *s, ct_data *tree, int max_code) /* same as above */
scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
local ct_data static_ltree[L_CODES+2];
send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
local ct_data static_dtree[D_CODES];
compress_block(s, (const ct_data *)static_ltree,
(const ct_data *)static_dtree);
compress_block(s, (const ct_data *)s->dyn_ltree,
(const ct_data *)s->dyn_dtree);
local const ct_data static_ltree[L_CODES+2] = {
local const ct_data static_dtree[D_CODES] = {