Searched refs:dyn_dtree (Results 1 - 7 of 7) sorted by relevance

/freebsd-10.1-release/lib/libz/
H A Ddeflate.h196 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:internal_state
337 s->dyn_dtree[d_code(dist)].Freq++; \
H A Dtrees.c389 s->d_desc.dyn_tree = s->dyn_dtree;
416 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
808 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
858 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
985 (const ct_data *)s->dyn_dtree);
1029 s->dyn_dtree[d_code(dist)].Freq++;
1040 out_length += (ulg)s->dyn_dtree[dcode].Freq *
H A Ddeflate.c1062 ds->d_desc.dyn_tree = ds->dyn_dtree;
/freebsd-10.1-release/sys/cddl/contrib/opensolaris/uts/common/zmod/
H A Ddeflate.h193 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 Dtrees.c390 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, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
1041 s->dyn_dtree[d_code(dist)].Freq++;
1052 out_length += (ulg)s->dyn_dtree[dcode].Freq *
H A Ddeflate.c948 ds->d_desc.dyn_tree = ds->dyn_dtree;
/freebsd-10.1-release/sys/net/
H A Dzlib.c450 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member in struct:deflate_state
1192 ds->d_desc.dyn_tree = ds->dyn_dtree;
2156 s->d_desc.dyn_tree = s->dyn_dtree;
2183 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
2574 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
2624 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
2784 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
2823 s->dyn_dtree[d_code(dist)].Freq++;
2833 out_length += (ulg)s->dyn_dtree[dcode].Freq *

Completed in 81 milliseconds