Symbol: D_CODES
lib/libz/deflate.h
201
struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
lib/libz/trees.c
108
local int base_dist[D_CODES];
lib/libz/trees.c
1111
(ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
lib/libz/trees.c
133
{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
lib/libz/trees.c
340
for ( ; code < D_CODES; code++) {
lib/libz/trees.c
362
for (n = 0; n < D_CODES; n++) {
lib/libz/trees.c
401
for (i = 0; i < D_CODES; i++) {
lib/libz/trees.c
403
static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
lib/libz/trees.c
426
for (i = 0; i < D_CODES; i++) {
lib/libz/trees.c
428
SEPARATOR(i, D_CODES-1, 10));
lib/libz/trees.c
443
for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
lib/libz/trees.c
63
local const int extra_dbits[D_CODES] /* extra bits for each distance code */
lib/libz/trees.c
836
Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
lib/libz/trees.c
91
local ct_data static_dtree[D_CODES];
lib/libz/trees.c
929
Assert (code < D_CODES, "bad d_code");
lib/libz/trees.h
123
local const int base_dist[D_CODES] = {
lib/libz/trees.h
64
local const ct_data static_dtree[D_CODES] = {
sys/lib/libz/deflate.h
201
struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
sys/lib/libz/trees.c
108
local int base_dist[D_CODES];
sys/lib/libz/trees.c
1111
(ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
sys/lib/libz/trees.c
133
{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
sys/lib/libz/trees.c
340
for ( ; code < D_CODES; code++) {
sys/lib/libz/trees.c
362
for (n = 0; n < D_CODES; n++) {
sys/lib/libz/trees.c
401
for (i = 0; i < D_CODES; i++) {
sys/lib/libz/trees.c
403
static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
sys/lib/libz/trees.c
426
for (i = 0; i < D_CODES; i++) {
sys/lib/libz/trees.c
428
SEPARATOR(i, D_CODES-1, 10));
sys/lib/libz/trees.c
443
for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
sys/lib/libz/trees.c
63
local const int extra_dbits[D_CODES] /* extra bits for each distance code */
sys/lib/libz/trees.c
836
Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
sys/lib/libz/trees.c
91
local ct_data static_dtree[D_CODES];
sys/lib/libz/trees.c
929
Assert (code < D_CODES, "bad d_code");
sys/lib/libz/trees.h
123
local const int base_dist[D_CODES] = {
sys/lib/libz/trees.h
64
local const ct_data static_dtree[D_CODES] = {