D_CODES           193 other-licenses/zlib/deflate.h     struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
D_CODES            64 other-licenses/zlib/trees.c local const int extra_dbits[D_CODES] /* extra bits for each distance code */
D_CODES            97 other-licenses/zlib/trees.c local ct_data static_dtree[D_CODES];
D_CODES           114 other-licenses/zlib/trees.c local int base_dist[D_CODES];
D_CODES           133 other-licenses/zlib/trees.c {static_dtree, extra_dbits, 0,          D_CODES, MAX_BITS};
D_CODES           284 other-licenses/zlib/trees.c     for ( ; code < D_CODES; code++) {
D_CODES           306 other-licenses/zlib/trees.c     for (n = 0; n < D_CODES; n++) {
D_CODES           346 other-licenses/zlib/trees.c     for (i = 0; i < D_CODES; i++) {
D_CODES           348 other-licenses/zlib/trees.c                 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
D_CODES           370 other-licenses/zlib/trees.c     for (i = 0; i < D_CODES; i++) {
D_CODES           372 other-licenses/zlib/trees.c                 SEPARATOR(i, D_CODES-1, 10));
D_CODES           418 other-licenses/zlib/trees.c     for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;
D_CODES           845 other-licenses/zlib/trees.c     Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
D_CODES          1038 other-licenses/zlib/trees.c                (ush)d_code(dist) < (ush)D_CODES,  "_tr_tally: bad match");
D_CODES          1051 other-licenses/zlib/trees.c         for (dcode = 0; dcode < D_CODES; dcode++) {
D_CODES          1100 other-licenses/zlib/trees.c             Assert (code < D_CODES, "bad d_code");
D_CODES            64 other-licenses/zlib/trees.h local const ct_data static_dtree[D_CODES] = {
D_CODES           123 other-licenses/zlib/trees.h local const int base_dist[D_CODES] = {