Lines Matching refs:max_code
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));
522 int max_code = desc->max_code;
548 if (n > max_code) continue; /* not a leaf node */
584 if (m > max_code) continue;
604 local void gen_codes (tree, max_code, bl_count)
606 int max_code; /* largest code with non zero frequency */
625 Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
627 for (n = 0; n <= max_code; n++) {
644 * also updated if stree is not null. The field max_code is set.
654 int max_code = -1; /* largest code with non zero frequency */
665 s->heap[++(s->heap_len)] = max_code = n;
678 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
684 desc->max_code = max_code;
727 gen_codes ((ct_data *)tree, max_code, s->bl_count);
734 local void scan_tree (s, tree, max_code)
737 int max_code; /* and its largest code of non zero frequency */
748 tree[max_code+1].Len = (ush)0xffff; /* guard */
750 for (n = 0; n <= max_code; n++) {
779 local void send_tree (s, tree, max_code)
782 int max_code; /* and its largest code of non zero frequency */
792 /* tree[max_code+1].Len = -1; */ /* guard already set */
795 for (n = 0; n <= max_code; n++) {
836 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
837 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
1022 send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,