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

/external/chromium_org/third_party/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)
208 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
215 uch depth[2*L_CODES+1];
H A Dtrees.c91 local ct_data static_ltree[L_CODES+2];
93 * need for the L_CODES extra codes used during heap construction. However
131 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
306 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
342 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
343 for (i = 0; i < L_CODES+2; i++) {
345 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
421 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
849 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
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)
206 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
213 uch depth[2*L_CODES+1];
H A Dfx_zlib_trees.c86 local ct_data static_ltree[L_CODES+2];
88 * need for the L_CODES extra codes used during heap construction. However
126 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
301 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
337 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
338 for (i = 0; i < L_CODES+2; i++) {
340 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
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,
/external/qemu/distrib/zlib-1.2.8/
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)
206 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
213 uch depth[2*L_CODES+1];
H A Dtrees.c86 local ct_data static_ltree[L_CODES+2];
88 * need for the L_CODES extra codes used during heap construction. However
126 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
301 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
337 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
338 for (i = 0; i < L_CODES+2; i++) {
340 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
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,
/external/zlib/src/
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)
206 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
213 uch depth[2*L_CODES+1];
H A Dtrees.c86 local ct_data static_ltree[L_CODES+2];
88 * need for the L_CODES extra codes used during heap construction. However
126 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
301 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
337 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
338 for (i = 0; i < L_CODES+2; i++) {
340 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
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,

Completed in 128 milliseconds