Home
last modified time | relevance | path

Searched refs:L_CODES (Results 1 – 6 of 6) sorted by relevance

/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
Ddeflate.h36 #define L_CODES (LITERALS+1+LENGTH_CODES) macro
45 #define HEAP_SIZE (2*L_CODES+1)
206 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
213 uch depth[2*L_CODES+1];
Dtrees.h4 local const ct_data static_ltree[L_CODES+2] = {
Dfx_zlib_trees.c86 local ct_data static_ltree[L_CODES+2];
126 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
301 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
338 for (i = 0; i < L_CODES+2; i++) { in gen_trees_header()
340 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); in gen_trees_header()
415 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; in init_block()
843 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()
/external/zlib/src/
Ddeflate.h36 #define L_CODES (LITERALS+1+LENGTH_CODES) macro
45 #define HEAP_SIZE (2*L_CODES+1)
206 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
213 uch depth[2*L_CODES+1];
Dtrees.h3 local const ct_data static_ltree[L_CODES+2] = {
Dtrees.c86 local ct_data static_ltree[L_CODES+2];
126 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
301 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
338 for (i = 0; i < L_CODES+2; i++) { in gen_trees_header()
340 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); in gen_trees_header()
415 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
843 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,