D_CODES           326 net/zlib.c         struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
D_CODES          1512 net/zlib.c     local const int extra_dbits[D_CODES] /* extra bits for each distance code */
D_CODES          1541 net/zlib.c     local ct_data static_dtree[D_CODES];
D_CODES          1558 net/zlib.c     local int base_dist[D_CODES];
D_CODES          1573 net/zlib.c     {static_dtree, extra_dbits, 0,          D_CODES, MAX_BITS};
D_CODES          1717 net/zlib.c         for ( ; code < D_CODES; code++) {
D_CODES          1739 net/zlib.c         for (n = 0; n < D_CODES; n++) {
D_CODES          1788 net/zlib.c         for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;
D_CODES          2214 net/zlib.c         Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
D_CODES          2431 net/zlib.c                    (ush)d_code(dist) < (ush)D_CODES,  "ct_tally: bad match");
D_CODES          2443 net/zlib.c             for (dcode = 0; dcode < D_CODES; dcode++) {
D_CODES          2491 net/zlib.c                 Assert (code < D_CODES, "bad d_code");