Lines Matching defs:L_CODES
148 #define L_CODES (LITERALS+1+LENGTH_CODES)
235 #define HEAP_SIZE (2*L_CODES+1)
241 local ct_data near static_ltree[L_CODES+2];
243 * need for the L_CODES extra codes used during heap construction. However
267 {dyn_ltree, static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS, 0};
285 local int near heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
292 local uch near depth[2*L_CODES+1];
544 gen_codes((ct_data near *)static_ltree, L_CODES+1);
564 for (n = 0; n < L_CODES; n++) dyn_ltree[n].Freq = 0;
985 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,