Lines Matching refs:ct_data
90 local ct_data static_ltree[L_CODES+2];
97 local ct_data static_dtree[D_CODES];
122 const ct_data *static_tree; /* static tree or NULL */
136 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
144 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
146 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
148 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
149 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
153 local void compress_block OF((deflate_state *s, ct_data *ltree,
154 ct_data *dtree));
303 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
339 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
345 fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n");
457 ct_data *tree; /* the tree to restore */
494 ct_data *tree = desc->dyn_tree;
496 const ct_data *stree = desc->stat_desc->static_tree;
578 ct_data *tree; /* the tree to decorate */
623 ct_data *tree = desc->dyn_tree;
624 const ct_data *stree = desc->stat_desc->static_tree;
700 gen_codes ((ct_data *)tree, max_code, s->bl_count);
709 ct_data *tree; /* the tree to be scanned */
754 ct_data *tree; /* the tree to be scanned */
809 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
810 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
857 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
860 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
989 compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree);
997 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
1074 ct_data *ltree; /* literal tree */
1075 ct_data *dtree; /* distance tree */