117 local ct_data static_ltree[L_CODES+2];
124 local ct_data static_dtree[D_CODES];
149     const ct_data *static_tree;  /* static tree or NULL */
163 {(const ct_data *)0, extra_blbits, 0,   BL_CODES, MAX_BL_BITS};
171 local void pqdownheap     OF((deflate_state *s, ct_data *tree, int k));
173 local void gen_codes      OF((ct_data *tree, int max_code, ushf *bl_count));
175 local void scan_tree      OF((deflate_state *s, ct_data *tree, int max_code));
176 local void send_tree      OF((deflate_state *s, ct_data *tree, int max_code));
180 local void compress_block OF((deflate_state *s, ct_data *ltree,
181                               ct_data *dtree));
333     gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);  in tr_static_init()
490 pqdownheap(deflate_state *s, ct_data *tree, int k)  in pqdownheap()
526     ct_data *tree        = desc->dyn_tree;  in gen_bitlen()
528     const ct_data *stree = desc->stat_desc->static_tree;  in gen_bitlen()
617 gen_codes(ct_data *tree, int max_code, ushf *bl_count)  in gen_codes()
661     ct_data *tree         = desc->dyn_tree;  in build_tree()
662     const ct_data *stree  = desc->stat_desc->static_tree;  in build_tree()
739     gen_codes ((ct_data *)tree, max_code, s->bl_count);  in build_tree()
750 scan_tree(deflate_state *s, ct_data *tree, int max_code)  in scan_tree()
802 send_tree( deflate_state *s, ct_data *tree, int max_code)  in send_tree()
862     scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);  in build_bl_tree()
863     scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);  in build_bl_tree()
913     send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */  in send_all_trees()
916     send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */  in send_all_trees()
1047         compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree);
1055         compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
1140 compress_block(deflate_state *s, ct_data *ltree, ct_data *dtree)