Searched refs:dyn_ltree (Results 1 - 7 of 7) sorted by relevance
| /freebsd-9.3-release/lib/libz/ |
| H A D | trees.c | 386 s->l_desc.dyn_tree = s->dyn_ltree;
415 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
419 s->dyn_ltree[END_BLOCK].Freq = 1;
807 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
855 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
984 compress_block(s, (const ct_data *)s->dyn_ltree,
1019 s->dyn_ltree[lc].Freq++;
1028 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1118 * IN assertion: the fields Freq of dyn_ltree are set.
1132 if ((black_mask & 1) && (s->dyn_ltree[
[all...] |
| H A D | deflate.h | 195 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:internal_state
327 s->dyn_ltree[cc].Freq++; \
336 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
|
| H A D | deflate.c | 1061 ds->l_desc.dyn_tree = ds->dyn_ltree;
|
| /freebsd-9.3-release/sys/cddl/contrib/opensolaris/uts/common/zmod/ |
| 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 | 947 ds->l_desc.dyn_tree = ds->dyn_ltree;
|
| /freebsd-9.3-release/sys/net/ |
| H A D | zlib.c | 442 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:deflate_state
1184 ds->l_desc.dyn_tree = ds->dyn_ltree;
2146 s->l_desc.dyn_tree = s->dyn_ltree;
2175 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
2179 s->dyn_ltree[END_BLOCK].Freq = 1;
2566 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
2614 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
2777 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
2806 s->dyn_ltree[lc].Freq++;
2815 s->dyn_ltree[length_cod
[all...] |
Completed in 84 milliseconds