Home
last modified time | relevance | path

Searched refs:BL_CODES (Results 1 – 4 of 4) sorted by relevance

/titanic_44/usr/src/uts/common/zmod/
H A Ddeflate.h42 #define BL_CODES 19 macro
194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
H A Dtrees.c67 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
70 local const uch bl_order[BL_CODES]
136 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
419 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
822 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {
845 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
/titanic_44/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c167 #define BL_CODES 19 macro
315 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
1502 local int extra_blbits[BL_CODES]/* extra bits for each bit length code */
1505 local uch bl_order[BL_CODES]
1563 {(ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
1777 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
2179 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {
2202 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
/titanic_44/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c313 #define BL_CODES 19 macro
477 struct ct_data_s bl_tree[2*BL_CODES+1];
2281 local const int extra_blbits[BL_CODES] = {
2284 local const uch bl_order[BL_CODES] = {
2350 (const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
2580 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
3030 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {
3056 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,