D_CODES            66 lib/zlib_deflate/deftree.c static const int extra_dbits[D_CODES] /* extra bits for each distance code */
D_CODES            94 lib/zlib_deflate/deftree.c static ct_data static_dtree[D_CODES];
D_CODES           111 lib/zlib_deflate/deftree.c static int base_dist[D_CODES];
D_CODES           126 lib/zlib_deflate/deftree.c {static_dtree, extra_dbits, 0,          D_CODES, MAX_BITS};
D_CODES           263 lib/zlib_deflate/deftree.c     for ( ; code < D_CODES; code++) {
D_CODES           285 lib/zlib_deflate/deftree.c     for (n = 0; n < D_CODES; n++) {
D_CODES           334 lib/zlib_deflate/deftree.c     for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;
D_CODES           770 lib/zlib_deflate/deftree.c     Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
D_CODES           986 lib/zlib_deflate/deftree.c                (ush)d_code(dist) < (ush)D_CODES,  "zlib_tr_tally: bad match");
D_CODES           998 lib/zlib_deflate/deftree.c         for (dcode = 0; dcode < D_CODES; dcode++) {
D_CODES          1047 lib/zlib_deflate/deftree.c             Assert (code < D_CODES, "bad d_code");
D_CODES           169 lib/zlib_deflate/defutil.h     struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */