Searched refs:dyn_ltree (Results 1 - 8 of 8) sorted by relevance

/haiku-fatelf/src/libs/pdflib/libs/flate/
H A Ddeflate.h182 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:internal_state
302 s->dyn_ltree[cc].Freq++; \
311 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
H A Dtrees.c389 s->l_desc.dyn_tree = s->dyn_ltree;
419 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
423 s->dyn_ltree[END_BLOCK].Freq = 1;
810 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
858 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++;
1123 * IN assertion: the fields freq of dyn_ltree are set and the total of all
1132 while (n < 7) bin_freq += s->dyn_ltree[
[all...]
H A Ddeflate.c653 ds->l_desc.dyn_tree = ds->dyn_ltree;
/haiku-fatelf/src/bin/zip/
H A Dtrees.c232 local ct_data near dyn_ltree[HEAP_SIZE]; /* literal and length tree */ variable
261 {dyn_ltree, static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS, 0};
555 for (n = 0; n < L_CODES; n++) dyn_ltree[n].Freq = 0;
559 dyn_ltree[END_BLOCK].Freq = 1;
942 scan_tree((ct_data near *)dyn_ltree, l_desc.max_code);
989 send_tree((ct_data near *)dyn_ltree, lcodes-1); /* send the literal tree */
1093 compress_block((ct_data near *)dyn_ltree, (ct_data near *)dyn_dtree);
1135 dyn_ltree[lc].Freq++;
1143 dyn_ltree[length_code[lc]+LITERALS+1].Freq++;
1246 * IN assertion: the fields freq of dyn_ltree ar
[all...]
/haiku-fatelf/src/bin/gzip/
H A Dtrees.c179 local ct_data near dyn_ltree[HEAP_SIZE]; /* literal and length tree */ variable
208 {dyn_ltree, static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS, 0};
412 for (n = 0; n < L_CODES; n++) dyn_ltree[n].Freq = 0;
416 dyn_ltree[END_BLOCK].Freq = 1;
795 scan_tree((ct_data near *)dyn_ltree, l_desc.max_code);
841 send_tree((ct_data near *)dyn_ltree, lcodes-1); /* send the literal tree */
937 compress_block((ct_data near *)dyn_ltree, (ct_data near *)dyn_dtree);
965 dyn_ltree[lc].Freq++;
973 dyn_ltree[length_code[lc]+LITERALS+1].Freq++;
1060 * IN assertion: the fields freq of dyn_ltree ar
[all...]
/haiku-fatelf/src/libs/zlib/
H A Ddeflate.h192 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:internal_state
323 s->dyn_ltree[cc].Freq++; \
332 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
H A Dtrees.c391 s->l_desc.dyn_tree = s->dyn_ltree;
421 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
425 s->dyn_ltree[END_BLOCK].Freq = 1;
813 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
861 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
1001 compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
1035 s->dyn_ltree[lc].Freq++;
1044 s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
1135 * IN assertion: the fields Freq of dyn_ltree are set.
1149 if ((black_mask & 1) && (s->dyn_ltree[
[all...]
H A Ddeflate.c977 ds->l_desc.dyn_tree = ds->dyn_ltree;

Completed in 113 milliseconds