Home
last modified time | relevance | path

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

/illumos-gate/usr/src/contrib/zlib/
H A Dtrees.c384 s->l_desc.dyn_tree = s->dyn_ltree;
413 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
417 s->dyn_ltree[END_BLOCK].Freq = 1;
805 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
853 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
989 compress_block(s, (const ct_data *)s->dyn_ltree,
1025 s->dyn_ltree[lc].Freq++;
1034 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1115 if ((block_mask & 1) && (s->dyn_ltree[n].Freq != 0))
1119 if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
[all …]
H A Ddeflate.h196 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
324 s->dyn_ltree[cc].Freq++; \
334 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
H A Ddeflate.c1187 ds->l_desc.dyn_tree = ds->dyn_ltree;
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c472 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
609 s->dyn_ltree[cc].Freq++; \
618 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
1350 ds->l_desc.dyn_tree = ds->dyn_ltree;
2544 s->l_desc.dyn_tree = s->dyn_ltree;
2576 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
2580 s->dyn_ltree[END_BLOCK].Freq = 1;
3012 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
3069 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1);
3273 compress_block(s, (ct_data *)s->dyn_ltree,
[all …]
/illumos-gate/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 …]
/illumos-gate/usr/src/contrib/ast/src/cmd/INIT/
H A Dratz.c1402 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
1522 s->dyn_ltree[cc].Freq++; \
1531 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \