Lines Matching refs:max_code
866 int max_code; /* largest code with non zero frequency */
962 static void gen_codes(ct_data * tree, int max_code);
964 static void scan_tree(ct_data * tree, int max_code);
965 static void send_tree(ct_data * tree, int max_code);
1067 int max_code = desc->max_code;
1095 if (n > max_code)
1137 if (m > max_code)
1158 static void gen_codes(ct_data * tree, int max_code)
1176 Tracev((stderr, "\ngen_codes: max_code %d ", max_code));
1178 for (n = 0; n <= max_code; n++) {
1200 * also updated if stree is not null. The field max_code is set.
1222 int max_code = -1; /* largest code with non zero frequency */
1234 G2.heap[++G2.heap_len] = max_code = n;
1247 int new = G2.heap[++G2.heap_len] = (max_code < 2 ? ++max_code : 0);
1256 desc->max_code = max_code;
1298 gen_codes((ct_data *) tree, max_code);
1308 static void scan_tree(ct_data * tree, int max_code)
1322 tree[max_code + 1].Len = 0xffff; /* guard */
1324 for (n = 0; n <= max_code; n++) {
1361 static void send_tree(ct_data * tree, int max_code)
1371 /* tree[max_code+1].Len = -1; *//* guard already set */
1375 for (n = 0; n <= max_code; n++) {
1424 scan_tree(G2.dyn_ltree, G2.l_desc.max_code);
1425 scan_tree(G2.dyn_dtree, G2.d_desc.max_code);
1656 send_all_trees(G2.l_desc.max_code + 1, G2.d_desc.max_code + 1,
2054 //G2.l_desc.max_code = 0;
2062 //G2.d_desc.max_code = 0;
2070 //G2.bl_desc.max_code = 0;