Lines Matching defs:max_code
263 int max_code; /* largest code with non zero frequency */
431 local void gen_codes OF((ct_data near *tree, int max_code));
433 local void scan_tree OF((ct_data near *tree, int max_code));
434 local void send_tree OF((ct_data near *tree, int max_code));
645 int max_code = desc->max_code;
669 if (n > max_code) continue; /* not a leaf node */
705 if (m > max_code) continue;
724 local void gen_codes (tree, max_code)
726 int max_code; /* largest code with non zero frequency */
744 Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
746 for (n = 0; n <= max_code; n++) {
763 * also updated if stree is not null. The field max_code is set.
772 int max_code = -1; /* largest code with non zero frequency */
783 heap[++heap_len] = max_code = n;
796 int new = heap[++heap_len] = (max_code < 2 ? ++max_code : 0);
802 desc->max_code = max_code;
843 gen_codes ((ct_data near *)tree, max_code);
852 local void scan_tree (tree, max_code)
854 int max_code; /* and its largest code of non zero frequency */
865 tree[max_code+1].Len = (ush)-1; /* guard */
867 for (n = 0; n <= max_code; n++) {
896 local void send_tree (tree, max_code)
898 int max_code; /* and its largest code of non zero frequency */
908 /* tree[max_code+1].Len = -1; */ /* guard already set */
911 for (n = 0; n <= max_code; n++) {
951 scan_tree((ct_data near *)dyn_ltree, l_desc.max_code);
952 scan_tree((ct_data near *)dyn_dtree, d_desc.max_code);
1107 send_all_trees(l_desc.max_code+1, d_desc.max_code+1, max_blindex+1);