Home
last modified time | relevance | path

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

/illumos-gate/usr/src/contrib/zlib/
H A Dtrees.h64 local const ct_data static_dtree[D_CODES] = {
123 local const int base_dist[D_CODES] = {
H A Dtrees.c65 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
93 local ct_data static_dtree[D_CODES];
110 local int base_dist[D_CODES];
129 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
280 for ( ; code < D_CODES; code++) { in tr_static_init()
302 for (n = 0; n < D_CODES; n++) { in tr_static_init()
342 for (i = 0; i < D_CODES; i++) { in gen_trees_header()
344 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); in gen_trees_header()
367 for (i = 0; i < D_CODES; i++) { in gen_trees_header()
369 SEPARATOR(i, D_CODES-1, 10)); in gen_trees_header()
[all …]
H A Ddeflate.h37 #define D_CODES 30 macro
197 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
/illumos-gate/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 …]
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c308 #define D_CODES 30 macro
473 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
2274 local const int extra_dbits[D_CODES] = {
2311 local ct_data static_dtree[D_CODES];
2330 local int base_dist[D_CODES];
2345 static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
2504 for (; code < D_CODES; code++) { in tr_static_init()
2527 for (n = 0; n < D_CODES; n++) { in tr_static_init()
2577 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
3054 Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
[all …]
/illumos-gate/usr/src/contrib/ast/src/cmd/INIT/
H A Dratz.c1249 #define D_CODES 30 macro
1403 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */