/netgear-WNDR4500-V1.0.1.40_1.0.68/ap/gpl/timemachine/zlib-1.2.3/ |
H A D | deflate.h | 192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:internal_state 312 s->dyn_ltree[cc].Freq++; \ 321 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
|
H A D | trees.c | 387 s->l_desc.dyn_tree = s->dyn_ltree; 417 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; 421 s->dyn_ltree[END_BLOCK].Freq = 1; 809 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); 857 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */ 997 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 1031 s->dyn_ltree[lc].Freq++; 1040 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++; 1124 * IN assertion: the fields Freq of dyn_ltree are set. 1132 if (s->dyn_ltree[ [all...] |
H A D | deflate.c | 941 ds->l_desc.dyn_tree = ds->dyn_ltree;
|
/netgear-WNDR4500-V1.0.1.40_1.0.68/ap/gpl/minidlna/zlib-1.2.3/ |
H A D | deflate.h | 192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:internal_state 312 s->dyn_ltree[cc].Freq++; \ 321 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
|
H A D | trees.c | 387 s->l_desc.dyn_tree = s->dyn_ltree; 417 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; 421 s->dyn_ltree[END_BLOCK].Freq = 1; 809 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); 857 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */ 997 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 1031 s->dyn_ltree[lc].Freq++; 1040 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++; 1124 * IN assertion: the fields Freq of dyn_ltree are set. 1132 if (s->dyn_ltree[ [all...] |
H A D | deflate.c | 941 ds->l_desc.dyn_tree = ds->dyn_ltree;
|
/netgear-WNDR4500-V1.0.1.40_1.0.68/src/linux/linux-2.6/lib/zlib_deflate/ |
H A D | deftree.c | 303 s->l_desc.dyn_tree = s->dyn_ltree; 333 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; 337 s->dyn_ltree[END_BLOCK].Freq = 1; 731 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); 782 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */ 949 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 979 s->dyn_ltree[lc].Freq++; 988 s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++; 1069 * IN assertion: the fields freq of dyn_ltree are set and the total of all 1079 while (n < 7) bin_freq += s->dyn_ltree[ [all...] |
H A D | defutil.h | 168 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:deflate_state
|
/netgear-WNDR4500-V1.0.1.40_1.0.68/src/router/busybox-1.x/archival/ |
H A D | gzip.c | 32 * 000008f4 b dyn_ltree 879 ct_data dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:globals2 1000 G2.dyn_ltree[n].Freq = 0; 1006 G2.dyn_ltree[END_BLOCK].Freq = 1; 1424 scan_tree(G2.dyn_ltree, G2.l_desc.max_code); 1471 send_tree((ct_data *) G2.dyn_ltree, lcodes - 1); /* send the literal tree */ 1488 G2.dyn_ltree[lc].Freq++; 1497 G2.dyn_ltree[G2.length_code[lc] + LITERALS + 1].Freq++; 1658 compress_block((ct_data *) G2.dyn_ltree, (ct_data *) G2.dyn_dtree); 2048 G2.l_desc.dyn_tree = G2.dyn_ltree; [all...] |
/netgear-WNDR4500-V1.0.1.40_1.0.68/ap/gpl/ppp-2.4.4/pppdump/ |
H A D | zlib.c | 313 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:deflate_state 1745 s->l_desc.dyn_tree = s->dyn_ltree; 1775 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; 1779 s->dyn_ltree[END_BLOCK].Freq = 1; 2166 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); 2214 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */ 2383 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 2412 s->dyn_ltree[lc].Freq++; 2421 s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++; 2501 * IN assertion: the fields freq of dyn_ltree ar [all...] |
/netgear-WNDR4500-V1.0.1.40_1.0.68/ap/gpl/ppp-2.4.4/common/ |
H A D | zlib.c | 438 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:deflate_state 1180 ds->l_desc.dyn_tree = ds->dyn_ltree; 2144 s->l_desc.dyn_tree = s->dyn_ltree; 2173 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; 2177 s->dyn_ltree[END_BLOCK].Freq = 1; 2564 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); 2612 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */ 2775 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree); 2804 s->dyn_ltree[lc].Freq++; 2813 s->dyn_ltree[length_cod [all...] |