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

/external/chromium/third_party/zlib/
H A Ddeflate.h192 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 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++;
1124 * IN assertion: the fields Freq of dyn_ltree are set.
1132 if (s->dyn_ltree[
[all...]
H A Ddeflate.c941 ds->l_desc.dyn_tree = ds->dyn_ltree;
/external/qemu/distrib/zlib-1.2.3/
H A Ddeflate.h192 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 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++;
1124 * IN assertion: the fields Freq of dyn_ltree are set.
1132 if (s->dyn_ltree[
[all...]
H A Ddeflate.c941 ds->l_desc.dyn_tree = ds->dyn_ltree;
/external/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 68 milliseconds