Searched refs:max_code (Results 1 – 11 of 11) sorted by relevance
/dragonfly/contrib/zlib-1.2/ |
H A D | trees.c | 491 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 D | deflate.h | 88 int max_code; /* largest code with non zero frequency */ member
|
/dragonfly/sys/vfs/hammer2/zlib/ |
H A D | hammer2_zlib_trees.c | 496 int max_code = desc->max_code; in gen_bitlen() local 558 if (m > max_code) continue; in gen_bitlen() 580 gen_codes (ct_data *tree, int max_code, ushf *bl_count) in gen_codes() argument 603 for (n = 0; n <= max_code; n++) { in gen_codes() 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() 725 tree[max_code+1].Len = (ush)0xffff; /* guard */ in scan_tree() 727 for (n = 0; n <= max_code; n++) { in scan_tree() 771 for (n = 0; n <= max_code; n++) { in send_tree() [all …]
|
H A D | hammer2_zlib_deflate.h | 77 int max_code; /* largest code with non zero frequency */ member
|
/dragonfly/usr.sbin/makefs/hammer2/zlib/ |
H A D | hammer2_zlib_trees.c | 496 int max_code = desc->max_code; in gen_bitlen() local 558 if (m > max_code) continue; in gen_bitlen() 580 gen_codes (ct_data *tree, int max_code, ushf *bl_count) in gen_codes() argument 603 for (n = 0; n <= max_code; n++) { in gen_codes() 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() 725 tree[max_code+1].Len = (ush)0xffff; /* guard */ in scan_tree() 727 for (n = 0; n <= max_code; n++) { in scan_tree() 771 for (n = 0; n <= max_code; n++) { in send_tree() [all …]
|
H A D | hammer2_zlib_deflate.h | 77 int max_code; /* largest code with non zero frequency */ member
|
/dragonfly/sbin/hammer2/zlib/ |
H A D | hammer2_zlib_trees.c | 496 int max_code = desc->max_code; in gen_bitlen() local 558 if (m > max_code) continue; in gen_bitlen() 580 gen_codes (ct_data *tree, int max_code, ushf *bl_count) in gen_codes() argument 603 for (n = 0; n <= max_code; n++) { in gen_codes() 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() 725 tree[max_code+1].Len = (ush)0xffff; /* guard */ in scan_tree() 727 for (n = 0; n <= max_code; n++) { in scan_tree() 771 for (n = 0; n <= max_code; n++) { in send_tree() [all …]
|
H A D | hammer2_zlib_deflate.h | 77 int max_code; /* largest code with non zero frequency */ member
|
/dragonfly/sys/net/ |
H A D | zlib.c | 2249 int max_code = desc->max_code; in gen_bitlen() local 2311 if (m > max_code) continue; in gen_bitlen() 2337 gen_codes(ct_data *tree, int max_code, ushf *bl_count) in gen_codes() argument 2357 for (n = 0; n <= max_code; n++) { in gen_codes() 2397 s->heap[++(s->heap_len)] = max_code = n; in build_tree() 2410 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); in build_tree() 2416 desc->max_code = max_code; in build_tree() 2481 tree[max_code+1].Len = (ush)0xffff; /* guard */ in scan_tree() 2483 for (n = 0; n <= max_code; n++) { in scan_tree() 2530 for (n = 0; n <= max_code; n++) { in send_tree() [all …]
|
/dragonfly/usr.sbin/ppp/ |
H A D | fsm.h | 106 u_short max_code; member
|
H A D | fsm.c | 150 fp->max_code = maxcode; in fsm_Init() 1065 if (lh.code < fp->min_code || lh.code > fp->max_code || in fsm_Input()
|