Searched refs:L_CODES (Results 1 - 3 of 3) sorted by relevance

/barrelfish-master/lib/zlib/
H A Dtrees.h3 local const ct_data static_ltree[L_CODES+2] = {
H A Ddeflate.h36 #define L_CODES (LITERALS+1+LENGTH_CODES) macro
45 #define HEAP_SIZE (2*L_CODES+1)
203 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
210 uch depth[2*L_CODES+1];
H A Dtrees.c90 local ct_data static_ltree[L_CODES+2];
92 * need for the L_CODES extra codes used during heap construction. However
130 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
303 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
339 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
340 for (i = 0; i < L_CODES+2; i++) {
342 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
417 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
845 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,

Completed in 24 milliseconds