Home
last modified time | relevance | path

Searched refs:max_code (Results 1 – 5 of 5) sorted by relevance

/illumos-gate/usr/src/contrib/zlib/
H A Dtrees.c491 int max_code = desc->max_code; local
553 if (m > max_code) continue;
572 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument
596 for (n = 0; n <= max_code; n++) {
647 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
653 desc->max_code = max_code;
703 local void scan_tree (s, tree, max_code) in scan_tree() argument
719 for (n = 0; n <= max_code; n++) {
748 local void send_tree (s, tree, max_code) in send_tree() argument
764 for (n = 0; n <= max_code; n++) {
[all …]
H A Ddeflate.h86 int max_code; /* largest code with non zero frequency */ member
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c1853 int max_code = desc->max_code; local
1915 if (m > max_code) continue;
1935 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument
1958 for (n = 0; n <= max_code; n++) {
2009 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
2015 desc->max_code = max_code;
2064 local void scan_tree (s, tree, max_code) in scan_tree() argument
2080 for (n = 0; n <= max_code; n++) {
2109 local void send_tree (s, tree, max_code) in send_tree() argument
2125 for (n = 0; n <= max_code; n++) {
[all …]
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c2659 int max_code = desc->max_code; local
2729 if (m > max_code) continue;
2752 gen_codes(tree, max_code, bl_count) in gen_codes() argument
2778 for (n = 0; n <= max_code; n++) {
2836 ++max_code : 0);
2842 desc->max_code = max_code;
2898 scan_tree(s, tree, max_code) in scan_tree() argument
2914 for (n = 0; n <= max_code; n++) {
2945 send_tree(s, tree, max_code) in send_tree() argument
2961 for (n = 0; n <= max_code; n++) {
[all …]
/illumos-gate/usr/src/contrib/ast/src/cmd/INIT/
H A Dratz.c1292 int max_code; /* largest code with non zero frequency */ member