Lines Matching refs:max_code
148 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
150 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
151 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
500 int max_code = desc->max_code; local
526 if (n > max_code) continue; /* not a leaf node */
562 if (m > max_code) continue;
582 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument
584 int max_code; /* largest code with non zero frequency */
603 Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
605 for (n = 0; n <= max_code; n++) {
632 int max_code = -1; /* largest code with non zero frequency */ local
643 s->heap[++(s->heap_len)] = max_code = n;
656 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
662 desc->max_code = max_code;
705 gen_codes ((ct_data *)tree, max_code, s->bl_count);
712 local void scan_tree (s, tree, max_code) in scan_tree() argument
715 int max_code; /* and its largest code of non zero frequency */
726 tree[max_code+1].Len = (ush)0xffff; /* guard */
728 for (n = 0; n <= max_code; n++) {
757 local void send_tree (s, tree, max_code) in send_tree() argument
760 int max_code; /* and its largest code of non zero frequency */
773 for (n = 0; n <= max_code; n++) {
814 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
815 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
1000 send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,