342     int     max_code;            /* largest code with non zero frequency */  member
1962 local void gen_codes      OF((ct_data *tree, int max_code, ushf *bl_count));
1964 local void scan_tree      OF((deflate_state *s, ct_data *tree, int max_code));
1965 local void send_tree      OF((deflate_state *s, ct_data *tree, int max_code));
2249     int max_code   = desc->max_code;  in gen_bitlen()  local
2275         if (n > max_code) continue; /* not a leaf node */  in gen_bitlen()
2311             if (m > max_code) continue;  in gen_bitlen()
2337 gen_codes(ct_data *tree, int max_code, ushf *bl_count)  in gen_codes()  argument
2355     Tracev((stderr,"\ngen_codes: max_code %d ", max_code));  in gen_codes()
2357     for (n = 0;  n <= max_code; n++) {  in gen_codes()
2386     int max_code = -1; /* largest code with non zero frequency */  in build_tree()  local
2397             s->heap[++(s->heap_len)] = max_code = n;  in build_tree()
2410         node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);  in build_tree()
2416     desc->max_code = max_code;  in build_tree()
2458     gen_codes ((ct_data *)tree, max_code, s->bl_count);  in build_tree()
2470 scan_tree (deflate_state *s, ct_data *tree, int max_code)  in scan_tree()  argument
2481     tree[max_code+1].Len = (ush)0xffff; /* guard */  in scan_tree()
2483     for (n = 0; n <= max_code; n++) {  in scan_tree()
2517 send_tree(deflate_state *s, ct_data *tree, int max_code)  in send_tree()  argument
2530     for (n = 0; n <= max_code; n++) {  in send_tree()
2571     scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);  in build_bl_tree()
2572     scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);  in build_bl_tree()
2786         send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,