Searched refs:L_CODES (Results 1 – 2 of 2) sorted by relevance
20 #define L_CODES (LITERALS+1+LENGTH_CODES) macro29 #define HEAP_SIZE (2*L_CODES+1)181 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */188 uch depth[2*L_CODES+1];
83 static ct_data static_ltree[L_CODES+2];119 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};228 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()279 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; in init_block()716 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()
