lib/zlib_deflate/deftree.c

107

static int base_dist[D_CODES];

lib/zlib_deflate/deftree.c

122

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

lib/zlib_deflate/deftree.c

209

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

lib/zlib_deflate/deftree.c

231

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

lib/zlib_deflate/deftree.c

280

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

lib/zlib_deflate/deftree.c

67

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

lib/zlib_deflate/deftree.c

716

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

lib/zlib_deflate/deftree.c

90

static ct_data static_dtree[D_CODES];

lib/zlib_deflate/deftree.c

932

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

lib/zlib_deflate/deftree.c

944

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

lib/zlib_deflate/deftree.c

993

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

lib/zlib_deflate/defutil.h

171

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