Lines Matching defs:L_CODES
161 #define L_CODES (LITERALS+1+LENGTH_CODES)
170 #define HEAP_SIZE (2*L_CODES+1)
324 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
331 uch depth[2*L_CODES+1];
1521 local ct_data static_ltree[L_CODES+2];
1523 * need for the L_CODES extra codes used during heap construction. However
1557 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
1724 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
1775 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
2202 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,