Lines Matching refs:D_CODES
65 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
93 local ct_data static_dtree[D_CODES];
110 local int base_dist[D_CODES];
129 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
280 for ( ; code < D_CODES; code++) { in tr_static_init()
302 for (n = 0; n < D_CODES; n++) { in tr_static_init()
342 for (i = 0; i < D_CODES; i++) { in gen_trees_header()
344 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5)); in gen_trees_header()
367 for (i = 0; i < D_CODES; i++) { in gen_trees_header()
369 SEPARATOR(i, D_CODES-1, 10)); in gen_trees_header()
414 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
841 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
1030 (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match");
1043 for (dcode = 0; dcode < D_CODES; dcode++) {
1092 Assert (code < D_CODES, "bad d_code");