BL_CODES
struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
{(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
local const uch bl_order[BL_CODES]
for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {
Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
local int extra_blbits[BL_CODES]/* extra bits for each bit length code */
local uch bl_order[BL_CODES]
{NULL, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {
Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
{(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
local const uch bl_order[BL_CODES]
for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {
Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */
{(const ct_data *)0, extra_blbits, 0, BL_CODES, MAX_BL_BITS};
for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
local const uch bl_order[BL_CODES]
for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {
Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,