/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/cfe/cfe/zlib/ |
H A D | deflate.h | 180 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:internal_state 309 s->dyn_dtree[d_code(dist)].Freq++; \
|
H A D | trees.c | 391 s->d_desc.dyn_tree = s->dyn_dtree; 419 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 810 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); 860 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ 996 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 1040 s->dyn_dtree[d_code(dist)].Freq++; 1051 out_length += (ulg)s->dyn_dtree[dcode].Freq *
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/samba-3.5.8/lib/zlib/ |
H A D | deflate.h | 193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:internal_state 322 s->dyn_dtree[d_code(dist)].Freq++; \
|
H A D | trees.c | 390 s->d_desc.dyn_tree = s->dyn_dtree; 418 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 810 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); 860 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ 997 compress_block(s, s->dyn_ltree, s->dyn_dtree); 1041 s->dyn_dtree[d_code(dist)].Freq++; 1052 out_length += (ulg)s->dyn_dtree[dcode].Freq *
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/zlib/ |
H A D | deflate.h | 193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:internal_state 333 s->dyn_dtree[d_code(dist)].Freq++; \
|
H A D | trees.c | 394 s->d_desc.dyn_tree = s->dyn_dtree; 422 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 814 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); 864 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ 1001 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 1045 s->dyn_dtree[d_code(dist)].Freq++; 1056 out_length += (ulg)s->dyn_dtree[dcode].Freq *
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/samba-3.5.8/lib/zlib/ |
H A D | deflate.h | 193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:internal_state 322 s->dyn_dtree[d_code(dist)].Freq++; \
|
H A D | trees.c | 390 s->d_desc.dyn_tree = s->dyn_dtree; 418 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 810 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); 860 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ 997 compress_block(s, s->dyn_ltree, s->dyn_dtree); 1041 s->dyn_dtree[d_code(dist)].Freq++; 1052 out_length += (ulg)s->dyn_dtree[dcode].Freq *
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/zlib/ |
H A D | deflate.h | 193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:internal_state 333 s->dyn_dtree[d_code(dist)].Freq++; \
|
H A D | trees.c | 394 s->d_desc.dyn_tree = s->dyn_dtree; 422 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 814 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); 864 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ 1001 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 1045 s->dyn_dtree[d_code(dist)].Freq++; 1056 out_length += (ulg)s->dyn_dtree[dcode].Freq *
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/samba-3.5.8/lib/zlib/ |
H A D | deflate.h | 193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:internal_state 322 s->dyn_dtree[d_code(dist)].Freq++; \
|
H A D | trees.c | 390 s->d_desc.dyn_tree = s->dyn_dtree; 418 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 810 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); 860 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ 997 compress_block(s, s->dyn_ltree, s->dyn_dtree); 1041 s->dyn_dtree[d_code(dist)].Freq++; 1052 out_length += (ulg)s->dyn_dtree[dcode].Freq *
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/zlib/ |
H A D | deflate.h | 193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:internal_state 333 s->dyn_dtree[d_code(dist)].Freq++; \
|
H A D | trees.c | 394 s->d_desc.dyn_tree = s->dyn_dtree; 422 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 814 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); 864 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ 1001 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 1045 s->dyn_dtree[d_code(dist)].Freq++; 1056 out_length += (ulg)s->dyn_dtree[dcode].Freq *
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/lib/zlib_deflate/ |
H A D | deftree.c | 306 s->d_desc.dyn_tree = s->dyn_dtree; 334 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 732 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); 785 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ 949 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 989 s->dyn_dtree[d_code(dist)].Freq++; 999 out_length += (ulg)s->dyn_dtree[dcode].Freq *
|
H A D | defutil.h | 169 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:deflate_state
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/lib/zlib_deflate/ |
H A D | deftree.c | 306 s->d_desc.dyn_tree = s->dyn_dtree; 334 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 732 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); 785 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ 949 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 989 s->dyn_dtree[d_code(dist)].Freq++; 999 out_length += (ulg)s->dyn_dtree[dcode].Freq *
|
H A D | defutil.h | 169 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:deflate_state
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/busybox/archival/ |
H A D | gzip.c | 25 * 000000f4 b dyn_dtree 870 ct_data dyn_dtree[2 * D_CODES + 1]; /* distance tree */ member in struct:globals2 992 G2.dyn_dtree[n].Freq = 0; 1415 scan_tree(G2.dyn_dtree, G2.d_desc.max_code); 1464 send_tree((ct_data *) G2.dyn_dtree, dcodes - 1); /* send the distance tree */ 1488 G2.dyn_dtree[D_CODE(dist)].Freq++; 1509 out_length += G2.dyn_dtree[dcode].Freq * (5L + extra_dbits[dcode]); 1648 compress_block((ct_data *) G2.dyn_ltree, (ct_data *) G2.dyn_dtree); 2021 G2.d_desc.dyn_tree = G2.dyn_dtree;
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/busybox/archival/ |
H A D | gzip.c | 25 * 000000f4 b dyn_dtree 870 ct_data dyn_dtree[2 * D_CODES + 1]; /* distance tree */ member in struct:globals2 992 G2.dyn_dtree[n].Freq = 0; 1415 scan_tree(G2.dyn_dtree, G2.d_desc.max_code); 1464 send_tree((ct_data *) G2.dyn_dtree, dcodes - 1); /* send the distance tree */ 1488 G2.dyn_dtree[D_CODE(dist)].Freq++; 1509 out_length += G2.dyn_dtree[dcode].Freq * (5L + extra_dbits[dcode]); 1648 compress_block((ct_data *) G2.dyn_ltree, (ct_data *) G2.dyn_dtree); 2021 G2.d_desc.dyn_tree = G2.dyn_dtree;
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/busybox/archival/ |
H A D | gzip.c | 25 * 000000f4 b dyn_dtree 870 ct_data dyn_dtree[2 * D_CODES + 1]; /* distance tree */ member in struct:globals2 992 G2.dyn_dtree[n].Freq = 0; 1415 scan_tree(G2.dyn_dtree, G2.d_desc.max_code); 1464 send_tree((ct_data *) G2.dyn_dtree, dcodes - 1); /* send the distance tree */ 1488 G2.dyn_dtree[D_CODE(dist)].Freq++; 1509 out_length += G2.dyn_dtree[dcode].Freq * (5L + extra_dbits[dcode]); 1648 compress_block((ct_data *) G2.dyn_ltree, (ct_data *) G2.dyn_dtree); 2021 G2.d_desc.dyn_tree = G2.dyn_dtree;
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/pppd/pppdump/ |
H A D | zlib.c | 314 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:deflate_state 1748 s->d_desc.dyn_tree = s->dyn_dtree; 1776 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 2167 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); 2217 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ 2383 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 2422 s->dyn_dtree[d_code(dist)].Freq++; 2432 out_length += (ulg)s->dyn_dtree[dcode].Freq *
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/pppd/pppdump/ |
H A D | zlib.c | 314 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:deflate_state 1748 s->d_desc.dyn_tree = s->dyn_dtree; 1776 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 2167 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); 2217 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ 2383 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 2422 s->dyn_dtree[d_code(dist)].Freq++; 2432 out_length += (ulg)s->dyn_dtree[dcode].Freq *
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/pppd/pppdump/ |
H A D | zlib.c | 314 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:deflate_state 1748 s->d_desc.dyn_tree = s->dyn_dtree; 1776 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 2167 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); 2217 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ 2383 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 2422 s->dyn_dtree[d_code(dist)].Freq++; 2432 out_length += (ulg)s->dyn_dtree[dcode].Freq *
|
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/pppd/common/ |
H A D | zlib.c | 439 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:deflate_state 1181 ds->d_desc.dyn_tree = ds->dyn_dtree; 2147 s->d_desc.dyn_tree = s->dyn_dtree; 2174 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; 2565 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); 2615 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ 2775 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 2814 s->dyn_dtree[d_code(dist)].Freq++; 2824 out_length += (ulg)s->dyn_dtree[dcode].Freq *
|