Home
last modified time | relevance | path

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

/illumos-gate/usr/src/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++) {
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c1579 int blcodes));
2195 local void send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees() argument
2197 int lcodes, dcodes, blcodes; /* number of codes for each tree */
2201 Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
2202 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
2207 send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
2208 for (rank = 0; rank < blcodes; rank++) {
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c2365 int blcodes));
3046 send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees() argument
3048 int lcodes, dcodes, blcodes; /* number of codes for each tree */
3052 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4,
3054 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
3059 send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
3060 for (rank = 0; rank < blcodes; rank++) {