Lines Matching defs:max_code
142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
144 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
145 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
493 int max_code = desc->max_code;
519 if (n > max_code) continue; /* not a leaf node */
555 if (m > max_code) continue;
575 local void gen_codes (tree, max_code, bl_count)
577 int max_code; /* largest code with non zero frequency */
596 Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
598 for (n = 0; n <= max_code; n++) {
615 * also updated if stree is not null. The field max_code is set.
625 int max_code = -1; /* largest code with non zero frequency */
636 s->heap[++(s->heap_len)] = max_code = n;
649 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
655 desc->max_code = max_code;
698 gen_codes ((ct_data *)tree, max_code, s->bl_count);
705 local void scan_tree (s, tree, max_code)
708 int max_code; /* and its largest code of non zero frequency */
719 tree[max_code+1].Len = (ush)0xffff; /* guard */
721 for (n = 0; n <= max_code; n++) {
750 local void send_tree (s, tree, max_code)
753 int max_code; /* and its largest code of non zero frequency */
763 /* tree[max_code+1].Len = -1; */ /* guard already set */
766 for (n = 0; n <= max_code; n++) {
807 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
808 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
981 send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,