Home
last modified time | relevance | path

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

/external/u-boot/lib/zlib/
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];
Dtrees.h3 local const ct_data static_ltree[L_CODES+2] = {
Dtrees.c91 local ct_data static_ltree[L_CODES+2];
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()
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,
/external/python/cpython2/Modules/zlib/
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];
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};
299 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
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,
/external/v8/third_party/zlib/
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];
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};
299 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
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,
/external/zlib/
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];
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};
299 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
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,