Home
last modified time | relevance | path

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

/titanic_50/usr/src/uts/common/zmod/
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];
130 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
303 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
340 for (i = 0; i < L_CODES+2; i++) { in gen_trees_header()
342 static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5)); in gen_trees_header()
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,
/titanic_50/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c161 #define L_CODES (LITERALS+1+LENGTH_CODES) macro
170 #define HEAP_SIZE (2*L_CODES+1)
324 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
331 uch depth[2*L_CODES+1];
1521 local ct_data static_ltree[L_CODES+2];
1557 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
1724 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in ct_static_init()
1775 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
2202 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
/titanic_50/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c307 #define L_CODES (LITERALS+1+LENGTH_CODES) macro
316 #define HEAP_SIZE (2*L_CODES+1)
486 int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */
495 uch depth[2*L_CODES+1];
2305 local ct_data static_ltree[L_CODES+2];
2344 static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
2526 gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count); in tr_static_init()
2578 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
3056 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,