Home
last modified time | relevance | path

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

/titanic_50/usr/src/uts/common/zmod/
H A Ddeflate.h192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
312 s->dyn_ltree[cc].Freq++; \
321 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
H A Dtrees.c387 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++;
1132 if (s->dyn_ltree[n].Freq != 0)
1136 if (s->dyn_ltree[n].Freq != 0)
H A Ddeflate.c947 ds->l_desc.dyn_tree = ds->dyn_ltree;
/titanic_50/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c474 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
611 s->dyn_ltree[cc].Freq++; \
620 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
1352 ds->l_desc.dyn_tree = ds->dyn_ltree;
2546 s->l_desc.dyn_tree = s->dyn_ltree;
2578 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
2582 s->dyn_ltree[END_BLOCK].Freq = 1;
3014 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
3071 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1);
3275 compress_block(s, (ct_data *)s->dyn_ltree,
[all …]
/titanic_50/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c313 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
1745 s->l_desc.dyn_tree = s->dyn_ltree;
1775 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
1779 s->dyn_ltree[END_BLOCK].Freq = 1;
2166 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
2214 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
2383 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
2412 s->dyn_ltree[lc].Freq++;
2421 s->dyn_ltree[length_code[lc]+LITERALS+1].Freq++;
2510 while (n < 7) bin_freq += s->dyn_ltree[n++].Freq;
[all …]