Searched refs:blcodes (Results 1 – 6 of 6) sorted by relevance
| /external/rust/crates/libz-sys/src/zlib-ng/ |
| 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()
|
| /external/rust/crates/libz-sys/src/zlib/ |
| D | trees.c | 148 int blcodes));
834 local void send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees() argument
836 int lcodes, dcodes, blcodes; /* number of codes for each tree */
840 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
841 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
846 send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
847 for (rank = 0; rank < blcodes; rank++) {
|
| /external/angle/third_party/zlib/ |
| D | trees.c | 148 int blcodes));
834 local void send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees() argument
836 int lcodes, dcodes, blcodes; /* number of codes for each tree */
840 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
841 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
846 send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
847 for (rank = 0; rank < blcodes; rank++) {
|
| /external/zlib/ |
| D | trees.c | 148 int blcodes));
834 local void send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees() argument
836 int lcodes, dcodes, blcodes; /* number of codes for each tree */
840 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
841 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
846 send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
847 for (rank = 0; rank < blcodes; rank++) {
|
| /external/libwebsockets/win32port/zlib/ |
| D | trees.c | 153 int blcodes));
842 local void send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees() argument
844 int lcodes, dcodes, blcodes; /* number of codes for each tree */
848 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
849 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
854 send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
855 for (rank = 0; rank < blcodes; rank++) {
|
| /external/python/cpython2/Modules/zlib/ |
| D | trees.c | 148 int blcodes));
834 local void send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees() argument
836 int lcodes, dcodes, blcodes; /* number of codes for each tree */
840 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
841 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
846 send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
847 for (rank = 0; rank < blcodes; rank++) {
|