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));
491 int max_code = desc->max_code;
517 if (n > max_code) continue; /* not a leaf node */
553 if (m > max_code) continue;
572 local void gen_codes (tree, max_code, bl_count)
574 int max_code; /* largest code with non zero frequency */
594 Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
596 for (n = 0; n <= max_code; n++) {
613 * also updated if stree is not null. The field max_code is set.
623 int max_code = -1; /* largest code with non zero frequency */
634 s->heap[++(s->heap_len)] = max_code = n;
647 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
653 desc->max_code = max_code;
696 gen_codes ((ct_data *)tree, max_code, s->bl_count);
703 local void scan_tree (s, tree, max_code)
706 int max_code; /* and its largest code of non zero frequency */
717 tree[max_code+1].Len = (ush)0xffff; /* guard */
719 for (n = 0; n <= max_code; n++) {
748 local void send_tree (s, tree, max_code)
751 int max_code; /* and its largest code of non zero frequency */
761 /* tree[max_code+1].Len = -1; */ /* guard already set */
764 for (n = 0; n <= max_code; n++) {
805 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
806 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
986 send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,