| /dports/security/pgpin/pgp263in/src/ |
| H A D | ztrees.c | 304 local void send_all_trees OF((int lcodes, int dcodes, int blcodes));
847 local void send_all_trees(lcodes, dcodes, blcodes)
848 int lcodes, dcodes, blcodes; /* number of codes for each tree */
852 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
853 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
858 send_bits(blcodes-4, 4); /* not -3 as stated in appnote.txt */
859 for (rank = 0; rank < blcodes; rank++) {
|
| /dports/misc/broot/broot-1.7.0/cargo-crates/libz-sys-1.1.3/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/devel/cargo-c/cargo-c-0.9.6+cargo-0.58/cargo-crates/libz-sys-1.1.3/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/devel/sentry-cli/sentry-cli-1.71.0/cargo-crates/libz-sys-1.1.3/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/devel/git-absorb/git-absorb-0.6.6/cargo-crates/libz-sys-1.1.2/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/archivers/c-blosc2/c-blosc2-2.0.4/internal-complibs/zlib-ng-2.0.5/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/devel/git-delta/delta-0.9.2/cargo-crates/libz-sys-1.1.2/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/libz-sys-1.1.3/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/libz-sys-1.1.2/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/devel/tokei/tokei-12.1.2/cargo-crates/libz-sys-1.1.0/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
556 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
559 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
560 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
569 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
570 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/devel/gitui/gitui-0.10.1/cargo-crates/libz-sys-1.1.0/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
556 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) {
559 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
560 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes");
569 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */
570 for (rank = 0; rank < blcodes; rank++) {
|
| /dports/devel/grcov/grcov-0.8.2/cargo-crates/libz-sys-1.1.3/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/devel/cargo-generate/cargo-generate-0.9.0/cargo-crates/libz-sys-1.1.2/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/sysutils/onefetch/onefetch-2.10.2/cargo-crates/libz-sys-1.1.3/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/textproc/mdbook-linkcheck/mdbook-linkcheck-0.7.6/cargo-crates/libz-sys-1.1.3/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/devel/pijul/pijul-1.0.0.a55/cargo-crates/libz-sys-1.1.3/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/lang/rust/rustc-1.58.1-src/vendor/libz-sys/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/textproc/bat/bat-0.18.3/cargo-crates/libz-sys-1.1.3/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/sysutils/exa/exa-0.10.1/cargo-crates/libz-sys-1.1.2/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/www/newsboat/newsboat-2.22.1/cargo-crates/libz-sys-1.1.2/src/zlib-ng/ |
| H A D | trees.c | 75 static void send_all_trees (deflate_state *s, int lcodes, int dcodes, int blcodes);
559 static void send_all_trees(deflate_state *s, int lcodes, int dcodes, int blcodes) { in send_all_trees() argument
562 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
563 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, "too many codes"); in send_all_trees()
572 send_bits(s, blcodes-4, 4, bi_buf, bi_valid); /* not -3 as stated in appnote.txt */ in send_all_trees()
573 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|
| /dports/archivers/zip/zip30/ |
| H A D | trees.c | 436 local void send_all_trees OF((int lcodes, int dcodes, int blcodes));
979 local void send_all_trees(lcodes, dcodes, blcodes) in send_all_trees() argument
980 int lcodes, dcodes, blcodes; /* number of codes for each tree */ in send_all_trees()
984 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
985 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
991 send_bits(blcodes-4, 4); /* not -3 as stated in appnote.txt */
992 for (rank = 0; rank < blcodes; rank++) {
|
| /dports/archivers/libcabinet/libcabinet-0.30/ |
| H A D | trees.c | 146 int blcodes));
764 local void send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees() argument
766 int lcodes, dcodes, blcodes; /* number of codes for each tree */
770 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
771 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
776 send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
777 for (rank = 0; rank < blcodes; rank++) {
|
| /dports/lang/mono/mono-5.10.1.57/external/corefx/src/Native/Windows/clrcompression/zlib-intel/ |
| H A D | trees.c | 145 int blcodes));
763 local void send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees() argument
765 int lcodes, dcodes, blcodes; /* number of codes for each tree */
769 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
770 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
775 send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
776 for (rank = 0; rank < blcodes; rank++) {
|
| /dports/net/boinc-client/boinc-client_release-7.8-7.8.6/zip/zip/ |
| H A D | trees.c | 436 local void send_all_trees OF((int lcodes, int dcodes, int blcodes));
979 local void send_all_trees(lcodes, dcodes, blcodes) in send_all_trees() argument
980 int lcodes, dcodes, blcodes; /* number of codes for each tree */ in send_all_trees()
984 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
985 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
991 send_bits(blcodes-4, 4); /* not -3 as stated in appnote.txt */
992 for (rank = 0; rank < blcodes; rank++) {
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/lib/zlib_deflate/ |
| H A D | deftree.c | 141 int blcodes);
710 int blcodes /* number of codes for each tree */ in send_all_trees() argument
715 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
716 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()
721 send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */ in send_all_trees()
722 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()
|