Lines Matching refs:D_CODES
290 #define D_CODES 30
439 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
1896 local int extra_dbits[D_CODES] /* extra bits for each distance code */
1924 local ct_data static_dtree[D_CODES];
1941 local int base_dist[D_CODES];
1956 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
2105 for ( ; code < D_CODES; code++) {
2127 for (n = 0; n < D_CODES; n++) {
2174 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
2600 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
2811 (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
2823 for (dcode = 0; dcode < D_CODES; dcode++) {
2871 Assert (code < D_CODES, "bad d_code");