Lines Matching defs:ct_data
193 } FAR ct_data;
203 ct_data *dyn_tree; /* the dynamic tree */
312 /* Didn't use ct_data typedef below to supress compiler warning */
1521 local ct_data static_ltree[L_CODES+2];
1528 local ct_data static_dtree[D_CODES];
1549 ct_data *static_tree; /* static tree or NULL */
1563 {(ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
1571 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k));
1573 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
1575 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
1576 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
1580 local void compress_block OF((deflate_state *s, ct_data *ltree,
1581 ct_data *dtree));
1724 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
1815 ct_data *tree; /* the tree to restore */
1852 ct_data *tree = desc->dyn_tree;
1854 ct_data *stree = desc->stat_desc->static_tree;
1936 ct_data *tree; /* the tree to decorate */
1981 ct_data *tree = desc->dyn_tree;
1982 ct_data *stree = desc->stat_desc->static_tree;
2057 gen_codes ((ct_data *)tree, max_code, s->bl_count);
2066 ct_data *tree; /* the tree to be scanned */
2111 ct_data *tree; /* the tree to be scanned */
2166 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
2167 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
2214 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
2217 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
2377 compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree);
2383 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
2453 ct_data *ltree; /* literal tree */
2454 ct_data *dtree; /* distance tree */