Home
last modified time | relevance | path

Searched refs:blcodes (Results 1 – 3 of 3) sorted by relevance

/external/opencv3/3rdparty/zlib/
Dtrees.c148 int blcodes));
836 local void send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees() argument
838 int lcodes, dcodes, blcodes; /* number of codes for each tree */
842 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
843 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
848 send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
849 for (rank = 0; rank < blcodes; rank++) {
/external/zlib/src/
Dtrees.c148 int blcodes));
836 local void send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees() argument
838 int lcodes, dcodes, blcodes; /* number of codes for each tree */
842 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
843 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
848 send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
849 for (rank = 0; rank < blcodes; rank++) {
/external/pdfium/third_party/zlib_v128/
Dtrees.c148 int blcodes));
838 int lcodes, int dcodes, int blcodes) /* number of codes for each tree */ in send_all_trees() argument
842 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); in send_all_trees()
843 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()
848 send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */ in send_all_trees()
849 for (rank = 0; rank < blcodes; rank++) { in send_all_trees()