Searched refs:D_CODES (Results 1 - 14 of 14) sorted by relevance

/macosx-10.10/rsync-45/rsync/zlib/
H A Dtrees.h64 local const ct_data static_dtree[D_CODES] = {
123 local const int base_dist[D_CODES] = {
H A Dtrees.c64 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
97 local ct_data static_dtree[D_CODES];
114 local int base_dist[D_CODES];
133 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
284 for ( ; code < D_CODES; code++) {
306 for (n = 0; n < D_CODES; n++) {
345 fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n");
346 for (i = 0; i < D_CODES; i++) {
348 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
369 fprintf(header, "local const int base_dist[D_CODES]
[all...]
H A Ddeflate.h39 #define D_CODES 30 macro
193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
/macosx-10.10/sudo-73/src/zlib/
H A Dtrees.h64 local const ct_data static_dtree[D_CODES] = {
123 local const int base_dist[D_CODES] = {
H A Dtrees.c65 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};
282 for ( ; code < D_CODES; code++) {
304 for (n = 0; n < D_CODES; n++) {
343 fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n");
344 for (i = 0; i < D_CODES; i++) {
346 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
368 fprintf(header, "local const int base_dist[D_CODES]
[all...]
H A Ddeflate.h39 #define D_CODES 30 macro
196 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
/macosx-10.10/xnu-2782.1.97/libkern/zlib/
H A Dtrees.h91 local const ct_data static_dtree[D_CODES] = {
150 local const int base_dist[D_CODES] = {
H A Dtrees.c91 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
124 local ct_data static_dtree[D_CODES];
141 local int base_dist[D_CODES];
160 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
311 for ( ; code < D_CODES; code++) {
333 for (n = 0; n < D_CODES; n++) {
372 fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n");
373 for (i = 0; i < D_CODES; i++) {
375 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
396 fprintf(header, "local const int base_dist[D_CODES]
[all...]
H A Ddeflate.h66 #define D_CODES 30 macro
220 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
/macosx-10.10/zlib-55/zlib/
H A Dtrees.h64 local const ct_data static_dtree[D_CODES] = {
123 local const int base_dist[D_CODES] = {
H A Dtrees.c65 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
98 local ct_data static_dtree[D_CODES];
115 local int base_dist[D_CODES];
134 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
287 for ( ; code < D_CODES; code++) {
309 for (n = 0; n < D_CODES; n++) {
348 fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n");
349 for (i = 0; i < D_CODES; i++) {
351 static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
373 fprintf(header, "local const int base_dist[D_CODES]
[all...]
H A Ddeflate.h39 #define D_CODES 30 macro
193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
/macosx-10.10/ppp-786.1.1/Helpers/pppdump/
H A Dzlib.c186 #define D_CODES 30 macro
336 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
1521 local int extra_dbits[D_CODES] /* extra bits for each distance code */
1550 local ct_data static_dtree[D_CODES];
1567 local int base_dist[D_CODES];
1582 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS};
1727 for ( ; code < D_CODES; code++) {
1749 for (n = 0; n < D_CODES; n++) {
1798 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
2224 Assert (lcodes <= L_CODES && dcodes <= D_CODES
[all...]
/macosx-10.10/ksh-23/ksh/src/cmd/INIT/
H A Dratz.c1249 #define D_CODES 30 macro
1403 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */

Completed in 108 milliseconds