139 static void gen_codes      (ct_data *tree, int max_code, ush *bl_count);
141 static void scan_tree      (deflate_state *s, ct_data *tree, int max_code);
142 static void send_tree      (deflate_state *s, ct_data *tree, int max_code);
413     int max_code         = desc->max_code;  in gen_bitlen()  local
439         if (n > max_code) continue; /* not a leaf node */  in gen_bitlen()
475             if (m > max_code) continue;  in gen_bitlen()
497 	int max_code,              /* largest code with non zero frequency */  in gen_codes()  argument
517     Tracev((stderr,"\ngen_codes: max_code %d ", max_code));  in gen_codes()
519     for (n = 0;  n <= max_code; n++) {  in gen_codes()
547     int max_code = -1; /* largest code with non zero frequency */  in build_tree()  local
558             s->heap[++(s->heap_len)] = max_code = n;  in build_tree()
571         node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);  in build_tree()
577     desc->max_code = max_code;  in build_tree()
619     gen_codes ((ct_data *)tree, max_code, s->bl_count);  in build_tree()
629 	int max_code     /* and its largest code of non zero frequency */  in scan_tree()  argument
641     tree[max_code+1].Len = (ush)0xffff; /* guard */  in scan_tree()
643     for (n = 0; n <= max_code; n++) {  in scan_tree()
675 	int max_code   /* and its largest code of non zero frequency */  in send_tree()  argument
689     for (n = 0; n <= max_code; n++) {  in send_tree()
731     scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);  in build_bl_tree()
732     scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);  in build_bl_tree()
947         send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,