lib/zlib/trees.c

91 local ct_data static_ltree[L_CODES+2];
98 local ct_data static_dtree[D_CODES];
123     const ct_data *static_tree;  /* static tree or NULL */
137 {(const ct_data *)0, extra_blbits, 0,   BL_CODES, MAX_BL_BITS};
145 local void pqdownheap     OF((deflate_state *s, ct_data *tree, int k));
147 local void gen_codes      OF((ct_data *tree, int max_code, ushf *bl_count));
149 local void scan_tree      OF((deflate_state *s, ct_data *tree, int max_code));
150 local void send_tree      OF((deflate_state *s, ct_data *tree, int max_code));
154 local void compress_block OF((deflate_state *s, ct_data *ltree,
155                               ct_data *dtree));
306     gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);  in tr_static_init()
461     ct_data *tree;  /* the tree to restore */
498     ct_data *tree        = desc->dyn_tree;
500     const ct_data *stree = desc->stat_desc->static_tree;
582     ct_data *tree;             /* the tree to decorate */  in gen_codes()
627     ct_data *tree         = desc->dyn_tree;
628     const ct_data *stree  = desc->stat_desc->static_tree;
704     gen_codes ((ct_data *)tree, max_code, s->bl_count);
713     ct_data *tree;   /* the tree to be scanned */
758     ct_data *tree; /* the tree to be scanned */
813     scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
814     scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
861     send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
864     send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
993         compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree);
1001         compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
1078     ct_data *ltree; /* literal tree */
1079     ct_data *dtree; /* distance tree */