Home
last modified time | relevance | path

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

/freebsd-12.1/sys/cddl/contrib/opensolaris/uts/common/zmod/
H A Dtrees.c152 int blcodes));
838 local void send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees() argument
840 int lcodes, dcodes, blcodes; /* number of codes for each tree */
844 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
845 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
850 send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
851 for (rank = 0; rank < blcodes; rank++) {
/freebsd-12.1/sys/contrib/zlib/
H A Dtrees.c148 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++) {
/freebsd-12.1/sys/libkern/
H A Dzlib.c1986 int blcodes));
2602 local void send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees() argument
2604 int lcodes, dcodes, blcodes; /* number of codes for each tree */
2608 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
2609 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
2614 send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
2615 for (rank = 0; rank < blcodes; rank++) {