sys/net/zlib.c

317 #define D_CODES   30
466     struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
2034 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
2067 local ct_data static_dtree[D_CODES];
2084 local int base_dist[D_CODES];
2153 local const ct_data static_dtree[D_CODES] = {
2212 local const int base_dist[D_CODES] = {
2233 {static_dtree, extra_dbits, 0,          D_CODES, MAX_BITS};
2382     for ( ; code < D_CODES; code++) {
2404     for (n = 0; n < D_CODES; n++) {
2443     fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n");
2444     for (i = 0; i < D_CODES; i++) {
2446 		static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
2467     fprintf(header, "local const int base_dist[D_CODES] = {\n");
2468     for (i = 0; i < D_CODES; i++) {
2470 		SEPARATOR(i, D_CODES-1, 10));
2514     for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;
2932     Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
3132                (ush)d_code(dist) < (ush)D_CODES,  "_tr_tally: bad match");
3145         for (dcode = 0; dcode < D_CODES; dcode++) {
3194             Assert (code < D_CODES, "bad d_code");