D_CODES
local int extra_dbits[D_CODES] /* extra bits for each distance code */
local ct_data static_dtree[D_CODES];
local int base_dist[D_CODES];
{static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
for ( ; code < D_CODES; code++) {
for (n = 0; n < D_CODES; n++) {
for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
(ush)d_code(dist) < (ush)D_CODES, "ct_tally: bad match");
for (dcode = 0; dcode < D_CODES; dcode++) {
Assert (code < D_CODES, "bad d_code");
struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
local const int extra_dbits[D_CODES] = {
local ct_data static_dtree[D_CODES];
local int base_dist[D_CODES];
static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
for (; code < D_CODES; code++) {
for (n = 0; n < D_CODES; n++) {
for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
Assert(lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
(ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
for (dcode = 0; dcode < D_CODES; dcode++) {
Assert(code < D_CODES, "bad d_code");
struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */