Lines Matching refs:max_code
204 int max_code; /* largest code with non zero frequency */ member
1573 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count));
1575 local void scan_tree OF((deflate_state *s, ct_data *tree, int max_code));
1576 local void send_tree OF((deflate_state *s, ct_data *tree, int max_code));
1853 int max_code = desc->max_code; local
1879 if (n > max_code) continue; /* not a leaf node */
1915 if (m > max_code) continue;
1935 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument
1937 int max_code; /* largest code with non zero frequency */
1956 Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
1958 for (n = 0; n <= max_code; n++) {
1985 int max_code = -1; /* largest code with non zero frequency */ local
1996 s->heap[++(s->heap_len)] = max_code = n;
2009 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
2015 desc->max_code = max_code;
2057 gen_codes ((ct_data *)tree, max_code, s->bl_count);
2064 local void scan_tree (s, tree, max_code) in scan_tree() argument
2067 int max_code; /* and its largest code of non zero frequency */
2078 tree[max_code+1].Len = (ush)0xffff; /* guard */
2080 for (n = 0; n <= max_code; n++) {
2109 local void send_tree (s, tree, max_code) in send_tree() argument
2112 int max_code; /* and its largest code of non zero frequency */
2125 for (n = 0; n <= max_code; n++) {
2166 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
2167 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
2381 send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,