340     int     max_code;            /* largest code with non zero frequency */  member
1980 local void gen_codes      OF((ct_data *tree, int max_code, ushf *bl_count));
1982 local void scan_tree      OF((deflate_state *s, ct_data *tree, int max_code));
1983 local void send_tree      OF((deflate_state *s, ct_data *tree, int max_code));
2260     int max_code   = desc->max_code;  local
2286         if (n > max_code) continue; /* not a leaf node */
2322             if (m > max_code) continue;
2342 local void gen_codes (tree, max_code, bl_count)  in gen_codes()  argument
2344     int max_code;              /* largest code with non zero frequency */
2363     Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
2365     for (n = 0;  n <= max_code; n++) {
2392     int max_code = -1; /* largest code with non zero frequency */  local
2403             s->heap[++(s->heap_len)] = max_code = n;
2416         node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
2422     desc->max_code = max_code;
2464     gen_codes ((ct_data *)tree, max_code, s->bl_count);
2471 local void scan_tree (s, tree, max_code)  in scan_tree()  argument
2474     int max_code;    /* and its largest code of non zero frequency */
2485     tree[max_code+1].Len = (ush)0xffff; /* guard */
2487     for (n = 0; n <= max_code; n++) {
2516 local void send_tree (s, tree, max_code)  in send_tree()  argument
2519     int max_code;       /* and its largest code of non zero frequency */
2532     for (n = 0; n <= max_code; n++) {
2573     scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
2574     scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
2782         send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,