Lines Matching defs:max_code
329 int max_code; /* largest code with non zero frequency */
1969 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
1971 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
1972 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
2251 int max_code = desc->max_code;
2277 if (n > max_code) continue; /* not a leaf node */
2313 if (m > max_code) continue;
2333 local void gen_codes (tree, max_code, bl_count)
2335 int max_code; /* largest code with non zero frequency */
2354 Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
2356 for (n = 0; n <= max_code; n++) {
2373 * also updated if stree is not null. The field max_code is set.
2383 int max_code = -1; /* largest code with non zero frequency */
2394 s->heap[++(s->heap_len)] = max_code = n;
2407 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
2413 desc->max_code = max_code;
2455 gen_codes ((ct_data *)tree, max_code, s->bl_count);
2462 local void scan_tree (s, tree, max_code)
2465 int max_code; /* and its largest code of non zero frequency */
2476 tree[max_code+1].Len = (ush)0xffff; /* guard */
2478 for (n = 0; n <= max_code; n++) {
2507 local void send_tree (s, tree, max_code)
2510 int max_code; /* and its largest code of non zero frequency */
2520 /* tree[max_code+1].Len = -1; */ /* guard already set */
2523 for (n = 0; n <= max_code; n++) {
2564 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
2565 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
2773 send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,