83 static ct_data static_ltree[L_CODES+2];
90 static ct_data static_dtree[D_CODES];
111     const ct_data *static_tree;  /* static tree or NULL */
125 {(const ct_data *)0, extra_blbits, 0,   BL_CODES, MAX_BL_BITS};
133 static void pqdownheap     (deflate_state *s, ct_data *tree, int k);
135 static void gen_codes      (ct_data *tree, int max_code, ush *bl_count);
137 static void scan_tree      (deflate_state *s, ct_data *tree, int max_code);
138 static void send_tree      (deflate_state *s, ct_data *tree, int max_code);
142 static void compress_block (deflate_state *s, ct_data *ltree,
143                            ct_data *dtree);
228     gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);  in tr_static_init()
319 	ct_data *tree,  /* the tree to restore */  in pqdownheap()
358     ct_data *tree        = desc->dyn_tree;  in gen_bitlen()
360     const ct_data *stree = desc->stat_desc->static_tree;  in gen_bitlen()
442 	ct_data *tree,             /* the tree to decorate */  in gen_codes()
489     ct_data *tree         = desc->dyn_tree;  in build_tree()
490     const ct_data *stree  = desc->stat_desc->static_tree;  in build_tree()
565     gen_codes ((ct_data *)tree, max_code, s->bl_count);  in build_tree()
574 	ct_data *tree,   /* the tree to be scanned */  in scan_tree()
620 	ct_data *tree, /* the tree to be scanned */  in send_tree()
677     scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);  in build_bl_tree()
678     scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);  in build_bl_tree()
728     send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */  in send_all_trees()
731     send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */  in send_all_trees()
889         compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree);
895         compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
966 	ct_data *ltree, /* literal tree */
967 	ct_data *dtree  /* distance tree */