Searched refs:max_code (Results 1 – 6 of 6) sorted by relevance
221 for (n = 0; n <= max_code; n++) { in gen_codes()540 int max_code = desc->max_code; in gen_bitlen() local602 if (m > max_code) continue; in gen_bitlen()641 s->heap[++(s->heap_len)] = max_code = n; in build_tree()654 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); in build_tree()660 desc->max_code = max_code; in build_tree()703 gen_codes ((ct_data *)tree, max_code, s->bl_count); in build_tree()720 tree[max_code + 1].Len = (ush)0xffff; /* guard */ in scan_tree()722 for (n = 0; n <= max_code; n++) { in scan_tree()763 for (n = 0; n <= max_code; n++) { in send_tree()[all …]
90 int max_code; /* largest code with non zero frequency */ member
222 for (n = 0; n <= max_code; n++) { in gen_codes()540 int max_code = desc->max_code; in gen_bitlen() local602 if (m > max_code) continue; in gen_bitlen()641 s->heap[++(s->heap_len)] = max_code = n; in build_tree()654 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); in build_tree()660 desc->max_code = max_code; in build_tree()703 gen_codes ((ct_data *)tree, max_code, s->bl_count); in build_tree()720 tree[max_code + 1].Len = (ush)0xffff; /* guard */ in scan_tree()722 for (n = 0; n <= max_code; n++) { in scan_tree()763 for (n = 0; n <= max_code; n++) { in send_tree()[all …]
92 int max_code; /* largest code with non zero frequency */ member