Lines Matching defs:max_code
135 static void gen_codes (ct_data *tree, int max_code, ush *bl_count);
137 static void scan_tree (deflate_state *s, ct_data *tree, int max_code);
138 static void send_tree (deflate_state *s, ct_data *tree, int max_code);
359 int max_code = desc->max_code;
385 if (n > max_code) continue; /* not a leaf node */
421 if (m > max_code) continue;
443 int max_code, /* largest code with non zero frequency */
463 Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
465 for (n = 0; n <= max_code; n++) {
482 * also updated if stree is not null. The field max_code is set.
493 int max_code = -1; /* largest code with non zero frequency */
504 s->heap[++(s->heap_len)] = max_code = n;
517 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
523 desc->max_code = max_code;
565 gen_codes ((ct_data *)tree, max_code, s->bl_count);
575 int max_code /* and its largest code of non zero frequency */
587 tree[max_code+1].Len = (ush)0xffff; /* guard */
589 for (n = 0; n <= max_code; n++) {
621 int max_code /* and its largest code of non zero frequency */
632 /* tree[max_code+1].Len = -1; */ /* guard already set */
635 for (n = 0; n <= max_code; n++) {
677 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
678 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
893 send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,