147 local void gen_codes      OF((ct_data *tree, int max_code, ushf *bl_count));
149 local void scan_tree      OF((deflate_state *s, ct_data *tree, int max_code));
150 local void send_tree      OF((deflate_state *s, ct_data *tree, int max_code));
499     int max_code         = desc->max_code;  local
525         if (n > max_code) continue; /* not a leaf node */
561             if (m > max_code) continue;
581 local void gen_codes (tree, max_code, bl_count)  in gen_codes()  argument
583     int max_code;              /* largest code with non zero frequency */
602     Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
604     for (n = 0;  n <= max_code; n++) {
631     int max_code = -1; /* largest code with non zero frequency */  local
642             s->heap[++(s->heap_len)] = max_code = n;
655         node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
661     desc->max_code = max_code;
704     gen_codes ((ct_data *)tree, max_code, s->bl_count);
711 local void scan_tree (s, tree, max_code)  in scan_tree()  argument
714     int max_code;    /* and its largest code of non zero frequency */
725     tree[max_code+1].Len = (ush)0xffff; /* guard */
727     for (n = 0; n <= max_code; n++) {
756 local void send_tree (s, tree, max_code)  in send_tree()  argument
759     int max_code;       /* and its largest code of non zero frequency */
772     for (n = 0; n <= max_code; n++) {
813     scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
814     scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
999         send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,