146 local void gen_codes      OF((ct_data *tree, int max_code, ushf *bl_count));
148 local void scan_tree      OF((deflate_state *s, ct_data *tree, int max_code));
149 local void send_tree      OF((deflate_state *s, ct_data *tree, int max_code));
495     int max_code         = desc->max_code;  local
521         if (n > max_code) continue; /* not a leaf node */
557             if (m > max_code) continue;
577 local void gen_codes (tree, max_code, bl_count)  in gen_codes()  argument
579     int max_code;              /* largest code with non zero frequency */
598     Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
600     for (n = 0;  n <= max_code; n++) {
627     int max_code = -1; /* largest code with non zero frequency */  local
638             s->heap[++(s->heap_len)] = max_code = n;
651         node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
657     desc->max_code = max_code;
700     gen_codes ((ct_data *)tree, max_code, s->bl_count);
707 local void scan_tree (s, tree, max_code)  in scan_tree()  argument
710     int max_code;    /* and its largest code of non zero frequency */
721     tree[max_code+1].Len = (ush)0xffff; /* guard */
723     for (n = 0; n <= max_code; n++) {
752 local void send_tree (s, tree, max_code)  in send_tree()  argument
755     int max_code;       /* and its largest code of non zero frequency */
768     for (n = 0; n <= max_code; n++) {
809     scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
810     scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
995         send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,