Home
last modified time | relevance | path

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

/illumos-gate/usr/src/contrib/zlib/
H A Ddeflate.h197 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
335 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 */
990 (const ct_data *)s->dyn_dtree);
1035 s->dyn_dtree[d_code(dist)].Freq++;
H A Ddeflate.c1188 ds->d_desc.dyn_tree = ds->dyn_dtree;
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c473 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
619 s->dyn_dtree[d_code(dist)].Freq++; \
1351 ds->d_desc.dyn_tree = ds->dyn_dtree;
2547 s->d_desc.dyn_tree = s->dyn_dtree;
2577 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
3013 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
3075 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1);
3274 (ct_data *)s->dyn_dtree);
3322 s->dyn_dtree[d_code(dist)].Freq++;
3333 out_length += (ulg)s->dyn_dtree[dcode].Freq *
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c314 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
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 *
/illumos-gate/usr/src/contrib/ast/src/cmd/INIT/
H A Dratz.c1403 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
1532 s->dyn_dtree[d_code(dist)].Freq++; \