Home
last modified time | relevance | path

Searched refs:dcodes (Results 1 – 6 of 6) sorted by relevance

/external/rust/crates/libz-sys/src/zlib-ng/
Dtrees.c75 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()
571 send_bits(s, dcodes-1, 5, bi_buf, bi_valid); in send_all_trees()
586 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ in send_all_trees()
/external/rust/crates/libz-sys/src/zlib/
Dtrees.c147 local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes,
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,
845 send_bits(s, dcodes-1, 5);
856 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
/external/angle/third_party/zlib/
Dtrees.c147 local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes,
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,
845 send_bits(s, dcodes-1, 5);
856 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
/external/zlib/
Dtrees.c147 local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes,
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,
845 send_bits(s, dcodes-1, 5);
856 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
/external/libwebsockets/win32port/zlib/
Dtrees.c152 local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes,
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,
853 send_bits(s, dcodes-1, 5);
864 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
/external/python/cpython2/Modules/zlib/
Dtrees.c147 local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes,
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,
845 send_bits(s, dcodes-1, 5);
856 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */