Home
last modified time | relevance | path

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

/titanic_50/usr/src/uts/common/zmod/
H A Dtrees.c64 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
97 local ct_data static_dtree[D_CODES];
114 local int base_dist[D_CODES];
133 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
284 for ( ; code < D_CODES; code++) { in tr_static_init()
306 for (n = 0; n < D_CODES; n++) { in tr_static_init()
346 for (i = 0; i < D_CODES; i++) { in gen_trees_header()
348 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); in gen_trees_header()
370 for (i = 0; i < D_CODES; i++) { in gen_trees_header()
372 SEPARATOR(i, D_CODES-1, 10)); in gen_trees_header()
[all …]
H A Ddeflate.h39 #define D_CODES 30 macro
193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
/titanic_50/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c164 #define D_CODES 30 macro
314 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
1499 local int extra_dbits[D_CODES] /* extra bits for each distance code */
1528 local ct_data static_dtree[D_CODES];
1545 local int base_dist[D_CODES];
1560 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
1705 for ( ; code < D_CODES; code++) { in ct_static_init()
1727 for (n = 0; n < D_CODES; n++) { in ct_static_init()
1776 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
2202 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
[all …]
/titanic_50/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c310 #define D_CODES 30 macro
475 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
2276 local const int extra_dbits[D_CODES] = {
2313 local ct_data static_dtree[D_CODES];
2332 local int base_dist[D_CODES];
2347 static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
2506 for (; code < D_CODES; code++) { in tr_static_init()
2529 for (n = 0; n < D_CODES; n++) { in tr_static_init()
2579 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
3056 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
[all …]