Lines Matching refs:ct_data
318 } FAR ct_data;
328 ct_data *dyn_tree; /* the dynamic tree */
437 /* Didn't use ct_data typedef below to supress compiler warning */
1917 local ct_data static_ltree[L_CODES+2];
1924 local ct_data static_dtree[D_CODES];
1945 ct_data *static_tree; /* static tree or NULL */
1959 {(ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
1967 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
1969 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
1971 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
1972 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
1976 local void compress_block OF((deflate_state *s, ct_data *ltree,
1977 ct_data *dtree));
2124 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
2213 ct_data *tree; /* the tree to restore */
2250 ct_data *tree = desc->dyn_tree;
2252 ct_data *stree = desc->stat_desc->static_tree;
2334 ct_data *tree; /* the tree to decorate */
2379 ct_data *tree = desc->dyn_tree;
2380 ct_data *stree = desc->stat_desc->static_tree;
2455 gen_codes ((ct_data *)tree, max_code, s->bl_count);
2464 ct_data *tree; /* the tree to be scanned */
2509 ct_data *tree; /* the tree to be scanned */
2564 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
2565 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
2612 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
2615 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
2769 compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree);
2775 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
2845 ct_data *ltree; /* literal tree */
2846 ct_data *dtree; /* distance tree */