345 } FAR ct_data;  typedef
355     ct_data *dyn_tree;           /* the dynamic tree */
2060 local ct_data static_ltree[L_CODES+2];
2067 local ct_data static_dtree[D_CODES];
2092 local const ct_data static_ltree[L_CODES+2] = {
2153 local const ct_data static_dtree[D_CODES] = {
2222     const ct_data *static_tree;  /* static tree or NULL */
2236 {(const ct_data *)0, extra_blbits, 0,   BL_CODES, MAX_BL_BITS};
2244 local void pqdownheap(deflate_state *s, ct_data *tree, int k);
2246 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count);
2248 local void scan_tree(deflate_state *s, ct_data *tree, int max_code);
2249 local void send_tree(deflate_state *s, ct_data *tree, int max_code);
2253 local void compress_block(deflate_state *s, const ct_data *ltree,
2254                               const ct_data *dtree);
2401     gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);  in tr_static_init()
2552 	ct_data *tree,	/* the tree to restore */  in pqdownheap()
2588     ct_data *tree        = desc->dyn_tree;  in gen_bitlen()
2590     const ct_data *stree = desc->stat_desc->static_tree;  in gen_bitlen()
2671 local void gen_codes (ct_data *tree,	/* the tree to decorate */  in gen_codes()
2715     ct_data *tree         = desc->dyn_tree;  in build_tree()
2716     const ct_data *stree  = desc->stat_desc->static_tree;  in build_tree()
2791     gen_codes ((ct_data *)tree, max_code, s->bl_count);  in build_tree()
2799 	ct_data *tree,	/* the tree to be scanned */  in scan_tree()
2843 	ct_data *tree,	/* the tree to be scanned */  in send_tree()
2897     scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);  in build_bl_tree()
2898     scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);  in build_bl_tree()
2944     send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */  in send_all_trees()
2947     send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */  in send_all_trees()
3083         compress_block(s, (const ct_data *)static_ltree, (const ct_data *)static_dtree);  in _tr_flush_block()
3091         compress_block(s, (const ct_data *)s->dyn_ltree, (const ct_data *)s->dyn_dtree);  in _tr_flush_block()
3168 	const ct_data *ltree,	/* literal tree */  in _tr_flush_block()
3169 	const ct_data *dtree)	/* distance tree */  in _tr_flush_block()