Lines Matching refs:max_code
365 int max_code; /* largest code with non zero frequency */
2221 static void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
2223 static void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
2224 static void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
2598 int max_code = desc->max_code;
2624 if (n > max_code) continue; /* not a leaf node */
2660 if (m > max_code) continue;
2681 * int max_code; largest code with non zero frequency
2685 gen_codes(ct_data *tree, int max_code, ushf *bl_count)
2703 Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
2705 for (n = 0; n <= max_code; n++) {
2722 * also updated if stree is not null. The field max_code is set.
2731 int max_code = -1; /* largest code with non zero frequency */
2742 s->heap[++(s->heap_len)] = max_code = n;
2755 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
2761 desc->max_code = max_code;
2803 gen_codes ((ct_data *)tree, max_code, s->bl_count);
2811 * int max_code; and its largest code of non zero frequency
2814 scan_tree(deflate_state *s, ct_data *tree, int max_code)
2825 tree[max_code+1].Len = (ush)0xffff; /* guard */
2827 for (n = 0; n <= max_code; n++) {
2857 * int max_code; and its largest code of non zero frequency
2860 send_tree(deflate_state *s, ct_data *tree, int max_code)
2870 /* tree[max_code+1].Len = -1; */ /* guard already set */
2873 for (n = 0; n <= max_code; n++) {
2914 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
2915 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
3100 send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,