Home
last modified time | relevance | path

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

/titanic_41/usr/src/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++) {
/titanic_41/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++) {
/titanic_41/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c2367 int blcodes));
3048 send_all_trees(s, lcodes, dcodes, blcodes) in send_all_trees() argument
3050 int lcodes, dcodes, blcodes; /* number of codes for each tree */
3054 Assert(lcodes >= 257 && dcodes >= 1 && blcodes >= 4,
3056 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
3061 send_bits(s, blcodes-4, 4); /* not -3 as stated in appnote.txt */
3062 for (rank = 0; rank < blcodes; rank++) {