Lines Matching refs:L_CODES
314 #define L_CODES (LITERALS+1+LENGTH_CODES) macro
323 #define HEAP_SIZE (2*L_CODES+1)
476 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
483 uch depth[2*L_CODES+1];
2060 local ct_data static_ltree[L_CODES+2];
2092 local const ct_data static_ltree[L_CODES+2] = {
2230 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
2401 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
2438 for (i = 0; i < L_CODES+2; i++) { in gen_trees_header()
2440 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); in gen_trees_header()
2513 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; in init_block()
2932 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()