common/dist/zlib/deflate.h

205

struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */

common/dist/zlib/trees.c

1115

(ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");

common/dist/zlib/trees.c

112

local int base_dist[D_CODES];

common/dist/zlib/trees.c

137

{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};

common/dist/zlib/trees.c

344

for ( ; code < D_CODES; code++) {

common/dist/zlib/trees.c

366

for (n = 0; n < D_CODES; n++) {

common/dist/zlib/trees.c

405

for (i = 0; i < D_CODES; i++) {

common/dist/zlib/trees.c

407

static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));

common/dist/zlib/trees.c

430

for (i = 0; i < D_CODES; i++) {

common/dist/zlib/trees.c

432

SEPARATOR(i, D_CODES-1, 10));

common/dist/zlib/trees.c

447

for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;

common/dist/zlib/trees.c

67

local const int extra_dbits[D_CODES] /* extra bits for each distance code */

common/dist/zlib/trees.c

840

Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,

common/dist/zlib/trees.c

933

Assert (code < D_CODES, "bad d_code");

common/dist/zlib/trees.c

95

local ct_data static_dtree[D_CODES];

common/dist/zlib/trees.h

123

local const int base_dist[D_CODES] = {

common/dist/zlib/trees.h

64

local const ct_data static_dtree[D_CODES] = {

sys/net/zlib.c

2034

local const int extra_dbits[D_CODES] /* extra bits for each distance code */

sys/net/zlib.c

2067

local ct_data static_dtree[D_CODES];

sys/net/zlib.c

2084

local int base_dist[D_CODES];

sys/net/zlib.c

2153

local const ct_data static_dtree[D_CODES] = {

sys/net/zlib.c

2212

local const int base_dist[D_CODES] = {

sys/net/zlib.c

2233

{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};

sys/net/zlib.c

2382

for ( ; code < D_CODES; code++) {

sys/net/zlib.c

2404

for (n = 0; n < D_CODES; n++) {

sys/net/zlib.c

2444

for (i = 0; i < D_CODES; i++) {

sys/net/zlib.c

2446

static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));

sys/net/zlib.c

2468

for (i = 0; i < D_CODES; i++) {

sys/net/zlib.c

2470

SEPARATOR(i, D_CODES-1, 10));

sys/net/zlib.c

2514

for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;

sys/net/zlib.c

2932

Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,

sys/net/zlib.c

3132

(ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");

sys/net/zlib.c

3145

for (dcode = 0; dcode < D_CODES; dcode++) {

sys/net/zlib.c

3194

Assert (code < D_CODES, "bad d_code");

sys/net/zlib.c

466

struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */