/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/zlib-1.2.8/ |
H A D | trees.h | 64 local const ct_data static_dtree[D_CODES] = { 123 local const int base_dist[D_CODES] = {
|
H A D | trees.c | 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}; 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 D | deflate.h | 39 #define D_CODES 30 macro 196 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/zlib/ |
H A D | trees.h | 64 local const ct_data static_dtree[D_CODES] = { 123 local const int base_dist[D_CODES] = {
|
H A D | trees.c | 64 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 D | deflate.h | 39 #define D_CODES 30 macro 193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/zlib-1.2.3/ |
H A D | trees.h | 64 local const ct_data static_dtree[D_CODES] = { 123 local const int base_dist[D_CODES] = {
|
H A D | trees.c | 64 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 D | deflate.h | 39 #define D_CODES 30 macro 193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/transmission/zlib-1.2.3/ |
H A D | trees.h | 64 local const ct_data static_dtree[D_CODES] = { 123 local const int base_dist[D_CODES] = {
|
H A D | trees.c | 64 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 D | deflate.h | 39 #define D_CODES 30 macro 193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/zlib-1.2.7/ |
H A D | trees.h | 64 local const ct_data static_dtree[D_CODES] = { 123 local const int base_dist[D_CODES] = {
|
H A D | trees.c | 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}; 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 D | deflate.h | 39 #define D_CODES 30 macro 196 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zip30/ |
H A D | trees.c | 151 #define D_CODES 30 macro 161 local int near extra_dbits[D_CODES] /* extra bits for each distance code */ 239 local ct_data near dyn_dtree[2*D_CODES+1]; /* distance tree */ 248 local ct_data near static_dtree[D_CODES]; 270 {dyn_dtree, static_dtree, extra_dbits, 0, D_CODES, MAX_BITS, 0}; 307 local int near base_dist[D_CODES]; 525 for ( ; code < D_CODES; code++) { 547 for (n = 0; n < D_CODES; n++) { 565 for (n = 0; n < D_CODES; n++) dyn_dtree[n].Freq = 0; 985 Assert(lcodes <= L_CODES && dcodes <= D_CODES [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/lib/zlib_deflate/ |
H A D | defutil.h | 21 #define D_CODES 30 macro 169 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
|
H A D | deftree.c | 66 static const int extra_dbits[D_CODES] /* extra bits for each distance code */ 94 static ct_data static_dtree[D_CODES]; 111 static int base_dist[D_CODES]; 126 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS}; 263 for ( ; code < D_CODES; code++) { 285 for (n = 0; n < D_CODES; n++) { 334 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 770 Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, 986 (ush)d_code(dist) < (ush)D_CODES, "zlib_tr_tally: bad match"); 998 for (dcode = 0; dcode < D_CODES; dcod [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/src/router/busybox-1.x/archival/ |
H A D | gzip.c | 765 #define D_CODES 30 macro 778 static const uint8_t extra_dbits[D_CODES] ALIGN1 = { 880 ct_data dyn_dtree[2 * D_CODES + 1]; /* distance tree */ 890 ct_data static_dtree[D_CODES]; 929 int base_dist[D_CODES]; 1001 for (n = 0; n < D_CODES; n++) 1459 Assert(lcodes <= L_CODES && dcodes <= D_CODES 1494 && (ush) D_CODE(dist) < (ush) D_CODES, "ct_tally: bad match" 1518 for (dcode = 0; dcode < D_CODES; dcode++) { 1569 Assert(code < D_CODES, "ba [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/ppp-2.4.4/pppdump/ |
H A D | zlib.c | 164 #define D_CODES 30 macro 314 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ 1499 local int extra_dbits[D_CODES] /* extra bits for each distance code */ 1528 local ct_data static_dtree[D_CODES]; 1545 local int base_dist[D_CODES]; 1560 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS}; 1705 for ( ; code < D_CODES; code++) { 1727 for (n = 0; n < D_CODES; n++) { 1776 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 2202 Assert (lcodes <= L_CODES && dcodes <= D_CODES [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/src/router/ppp/pppdump/ |
H A D | zlib.c | 164 #define D_CODES 30 macro 314 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ 1499 local int extra_dbits[D_CODES] /* extra bits for each distance code */ 1528 local ct_data static_dtree[D_CODES]; 1545 local int base_dist[D_CODES]; 1560 {static_dtree, extra_dbits, 0, D_CODES, MAX_BITS}; 1705 for ( ; code < D_CODES; code++) { 1727 for (n = 0; n < D_CODES; n++) { 1776 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 2202 Assert (lcodes <= L_CODES && dcodes <= D_CODES [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/ppp-2.4.4/common/ |
H A D | zlib.c | 290 #define D_CODES 30 macro 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 [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/src/router/ppp/common/ |
H A D | zlib.c | 290 #define D_CODES 30 macro 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 [all...] |