Home
last modified time | relevance | path

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

/freebsd-12.1/sys/cddl/contrib/opensolaris/uts/common/zmod/
H A Ddeflate.h193 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
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-12.1/sys/contrib/zlib/
H A Ddeflate.h199 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
340 s->dyn_dtree[d_code(dist)].Freq++; \
H A Dtrees.c387 s->d_desc.dyn_tree = s->dyn_dtree;
414 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
806 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
856 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
989 (const ct_data *)s->dyn_dtree);
1033 s->dyn_dtree[d_code(dist)].Freq++;
1044 out_length += (ulg)s->dyn_dtree[dcode].Freq *
H A Ddeflate.c1150 ds->d_desc.dyn_tree = ds->dyn_dtree;
/freebsd-12.1/sys/libkern/
H A Dzlib.c450 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
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 *