Searched refs:dyn_ltree (Results 1 - 8 of 8) sorted by relevance
/illumos-gate/usr/src/boot/lib/libz/ |
H A D | trees.c | 386 s->l_desc.dyn_tree = s->dyn_ltree; 415 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; 419 s->dyn_ltree[END_BLOCK].Freq = 1; 807 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); 855 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */ 984 compress_block(s, (const ct_data *)s->dyn_ltree, 1019 s->dyn_ltree[lc].Freq++; 1028 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++; 1118 * IN assertion: the fields Freq of dyn_ltree are set. 1132 if ((black_mask & 1) && (s->dyn_ltree[ [all...] |
H A D | deflate.h | 195 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:internal_state 327 s->dyn_ltree[cc].Freq++; \ 336 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
|
H A D | deflate.c | 1061 ds->l_desc.dyn_tree = ds->dyn_ltree;
|
/illumos-gate/usr/src/uts/common/zmod/ |
H A D | deflate.h | 192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:internal_state 312 s->dyn_ltree[cc].Freq++; \ 321 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
|
H A D | trees.c | 387 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++; 1124 * IN assertion: the fields Freq of dyn_ltree are set. 1132 if (s->dyn_ltree[ [all...] |
H A D | deflate.c | 947 ds->l_desc.dyn_tree = ds->dyn_ltree;
|
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/ |
H A D | zlib.c | 313 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:deflate_state 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++; 2501 * IN assertion: the fields freq of dyn_ltree ar [all...] |
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/ |
H A D | zlib.c | 474 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:deflate_state 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...] |
Completed in 73 milliseconds