Home
last modified time | relevance | path

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

/titanic_50/usr/src/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;
/titanic_50/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c475 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
621 s->dyn_dtree[d_code(dist)].Freq++; \
1353 ds->d_desc.dyn_tree = ds->dyn_dtree;
2549 s->d_desc.dyn_tree = s->dyn_dtree;
2579 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
3015 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
3077 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1);
3276 (ct_data *)s->dyn_dtree);
3324 s->dyn_dtree[d_code(dist)].Freq++;
3335 out_length += (ulg)s->dyn_dtree[dcode].Freq *
/titanic_50/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 *