bin/gzip/trees.c

204     int     max_code;            /* largest code with non zero frequency */
297 local void gen_codes      OF((ct_data near *tree, int max_code));
299 local void scan_tree      OF((ct_data near *tree, int max_code));
300 local void send_tree      OF((ct_data near *tree, int max_code));
489     int max_code        = desc->max_code;
513         if (n > max_code) continue; /* not a leaf node */
549             if (m > max_code) continue;
568 local void gen_codes (tree, max_code)
570     int max_code;              /* largest code with non zero frequency */
588     Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
590     for (n = 0;  n <= max_code; n++) {
607  *     also updated if stree is not null. The field max_code is set.
616     int max_code = -1; /* largest code with non zero frequency */
627             heap[++heap_len] = max_code = n;
640         int new = heap[++heap_len] = (max_code < 2 ? ++max_code : 0);
646     desc->max_code = max_code;
687     gen_codes ((ct_data near *)tree, max_code);
696 local void scan_tree (tree, max_code)
698     int max_code;       /* and its largest code of non zero frequency */
709     tree[max_code+1].Len = (ush)0xffff; /* guard */
711     for (n = 0; n <= max_code; n++) {
740 local void send_tree (tree, max_code)
742     int max_code;       /* and its largest code of non zero frequency */
752     /* tree[max_code+1].Len = -1; */  /* guard already set */
755     for (n = 0; n <= max_code; n++) {
795     scan_tree((ct_data near *)dyn_ltree, l_desc.max_code);
796     scan_tree((ct_data near *)dyn_dtree, d_desc.max_code);
936         send_all_trees(l_desc.max_code+1, d_desc.max_code+1, max_blindex+1);