Lines Matching refs:ct_data
86 local ct_data static_ltree[L_CODES+2];
93 local ct_data static_dtree[D_CODES];
118 const ct_data *static_tree; /* static tree or NULL */
138 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
202 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) {
360 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
395 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
401 fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n");
507 local void pqdownheap(deflate_state *s, ct_data *tree, int k) {
539 ct_data *tree = desc->dyn_tree;
541 const ct_data *stree = desc->stat_desc->static_tree;
626 ct_data *tree = desc->dyn_tree;
627 const ct_data *stree = desc->stat_desc->static_tree;
703 gen_codes ((ct_data *)tree, max_code, s->bl_count);
710 local void scan_tree(deflate_state *s, ct_data *tree, int max_code) {
751 local void send_tree(deflate_state *s, ct_data *tree, int max_code) {
802 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
803 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
848 send_tree(s, (ct_data *)s->dyn_ltree, lcodes - 1); /* literal tree */
851 send_tree(s, (ct_data *)s->dyn_dtree, dcodes - 1); /* distance tree */
898 local void compress_block(deflate_state *s, const ct_data *ltree,
899 const ct_data *dtree) {
1059 compress_block(s, (const ct_data *)static_ltree,
1060 (const ct_data *)static_dtree);
1068 compress_block(s, (const ct_data *)s->dyn_ltree,
1069 (const ct_data *)s->dyn_dtree);