203 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) {  in gen_codes()  argument
221     Tracev((stderr,"\ngen_codes: max_code %d ", max_code));  in gen_codes()
223     for (n = 0;  n <= max_code; n++) {  in gen_codes()
542     int max_code         = desc->max_code;  in gen_bitlen()  local
568         if (n > max_code) continue; /* not a leaf node */  in gen_bitlen()
604             if (m > max_code) continue;  in gen_bitlen()
632     int max_code = -1; /* largest code with non zero frequency */  in build_tree()  local
643             s->heap[++(s->heap_len)] = max_code = n;  in build_tree()
656         node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);  in build_tree()
662     desc->max_code = max_code;  in build_tree()
705     gen_codes ((ct_data *)tree, max_code, s->bl_count);  in build_tree()
712 local void scan_tree(deflate_state *s, ct_data *tree, int max_code) {  in scan_tree()  argument
722     tree[max_code + 1].Len = (ush)0xffff; /* guard */  in scan_tree()
724     for (n = 0; n <= max_code; n++) {  in scan_tree()
753 local void send_tree(deflate_state *s, ct_data *tree, int max_code) {  in send_tree()  argument
765     for (n = 0; n <= max_code; n++) {  in send_tree()
804     scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);  in build_bl_tree()
805     scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);  in build_bl_tree()
1067         send_all_trees(s, s->l_desc.max_code + 1, s->d_desc.max_code + 1,