Home
last modified time | relevance | path

Searched refs:dcodes (Results 1 - 5 of 5) sorted by relevance

/third_party/node/deps/v8/third_party/zlib/
H A Dtrees.c147 local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes,
832 * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
834 local void send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees()
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 */
/third_party/libwebsockets/win32port/zlib/
H A Dtrees.c152 local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes,
840 * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
842 local void send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees()
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 */
/third_party/skia/third_party/externals/zlib/
H A Dtrees.c147 local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes,
832 * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
834 local void send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees()
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 */
/third_party/node/deps/zlib/
H A Dtrees.c829 * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
831 local void send_all_trees(deflate_state *s, int lcodes, int dcodes, in send_all_trees() argument
835 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
836 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()
840 send_bits(s, dcodes - 1, 5); in send_all_trees()
851 send_tree(s, (ct_data *)s->dyn_dtree, dcodes - 1); /* distance tree */ in send_all_trees()
/third_party/zlib/
H A Dtrees.c852 * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
854 local void send_all_trees(deflate_state *s, int lcodes, int dcodes, in send_all_trees() argument
859 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
860 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()
864 send_bits(s, dcodes - 1, 5); in send_all_trees()
875 send_tree(s, (ct_data *)s->dyn_dtree, dcodes - 1); /* distance tree */ in send_all_trees()

Completed in 10 milliseconds