L_CODES
local ct_data static_ltree[L_CODES+2];
{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
#define HEAP_SIZE (2*L_CODES+1)
gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
uch depth[2*L_CODES+1];
local ct_data static_ltree[L_CODES+2];
static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
#define HEAP_SIZE (2*L_CODES+1)
int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
uch depth[2*L_CODES+1];