Lines Matching refs:max_code
214 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count)
233 Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
235 for (n = 0; n <= max_code; n++) {
559 int max_code = desc->max_code;
585 if (n > max_code) continue; /* not a leaf node */
621 if (m > max_code) continue;
642 * also updated if stree is not null. The field max_code is set.
650 int max_code = -1; /* largest code with non zero frequency */
661 s->heap[++(s->heap_len)] = max_code = n;
674 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
680 desc->max_code = max_code;
723 gen_codes ((ct_data *)tree, max_code, s->bl_count);
730 local void scan_tree(deflate_state *s, ct_data *tree, int max_code)
741 tree[max_code + 1].Len = (ush)0xffff; /* guard */
743 for (n = 0; n <= max_code; n++) {
772 local void send_tree(deflate_state *s, ct_data *tree, int max_code)
782 /* tree[max_code + 1].Len = -1; */ /* guard already set */
785 for (n = 0; n <= max_code; n++) {
825 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
826 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
1091 send_all_trees(s, s->l_desc.max_code + 1, s->d_desc.max_code + 1,