Searched refs:BL_CODES (Results 1 – 5 of 5) sorted by relevance
/illumos-gate/usr/src/contrib/zlib/ |
H A D | deflate.h | 40 #define BL_CODES 19 macro 198 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
|
H A D | trees.c | 68 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */ 71 local const uch bl_order[BL_CODES] 132 {(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; 415 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; 818 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { 841 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
|
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/ |
H A D | zlib.c | 167 #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,
|
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/ |
H A D | zlib.c | 311 #define BL_CODES 19 macro 475 struct ct_data_s bl_tree[2*BL_CODES+1]; 2279 local const int extra_blbits[BL_CODES] = { 2282 local const uch bl_order[BL_CODES] = { 2348 (const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS}; 2578 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; 3028 for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) { 3054 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
|
/illumos-gate/usr/src/contrib/ast/src/cmd/INIT/ |
H A D | ratz.c | 1252 #define BL_CODES 19 macro 1404 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
|