Home
last modified time | relevance | path

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

/third_party/node/deps/zlib/
H A Ddeflate.h40 #define L_CODES (LITERALS+1+LENGTH_CODES) macro
49 #define HEAP_SIZE (2*L_CODES+1)
213 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
220 uch depth[2*L_CODES+1];
H A Dtrees.h3 local const ct_data static_ltree[L_CODES+2] = {
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
132 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
360 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
395 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n"); in gen_trees_header()
396 for (i = 0; i < L_CODES+2; i++) { in gen_trees_header()
398 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); in gen_trees_header()
443 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; in init_block()
836 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()
/third_party/node/deps/v8/third_party/zlib/
H A Ddeflate.h36 #define L_CODES (LITERALS+1+LENGTH_CODES) macro
45 #define HEAP_SIZE (2*L_CODES+1)
209 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
216 uch depth[2*L_CODES+1];
H A Dtrees.h3 local const ct_data static_ltree[L_CODES+2] = {
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};
299 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
335 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n"); in gen_trees_header()
336 for (i = 0; i < L_CODES+2; i++) { in gen_trees_header()
338 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); in gen_trees_header()
413 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
841 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
/third_party/libwebsockets/win32port/zlib/
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.h3 local const ct_data static_ltree[L_CODES+2] = {
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); in tr_static_init()
342 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n"); in gen_trees_header()
343 for (i = 0; i < L_CODES+2; i++) { in gen_trees_header()
345 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); in gen_trees_header()
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,
/third_party/skia/third_party/externals/zlib/
H A Ddeflate.h36 #define L_CODES (LITERALS+1+LENGTH_CODES) macro
45 #define HEAP_SIZE (2*L_CODES+1)
209 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
216 uch depth[2*L_CODES+1];
H A Dtrees.h3 local const ct_data static_ltree[L_CODES+2] = {
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};
299 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
335 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n"); in gen_trees_header()
336 for (i = 0; i < L_CODES+2; i++) { in gen_trees_header()
338 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); in gen_trees_header()
413 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
841 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
/third_party/zlib/
H A Ddeflate.h40 #define L_CODES (LITERALS+1+LENGTH_CODES) macro
49 #define HEAP_SIZE (2*L_CODES+1)
213 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
220 uch depth[2*L_CODES+1];
H A Dtrees.h3 local const ct_data static_ltree[L_CODES+2] = {
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
132 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
375 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
411 fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n"); in gen_trees_header()
412 for (i = 0; i < L_CODES+2; i++) { in gen_trees_header()
414 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); in gen_trees_header()
460 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; in init_block()
860 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, in send_all_trees()

Completed in 17 milliseconds