| /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
| fx_zlib_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 */
[all...] |
| 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++; \
|
| fx_zlib_deflate.c | [all...] |
| /external/qemu/distrib/zlib-1.2.8/ |
| 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 */
[all...] |
| 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++; \
|
| deflate.c | [all...] |
| /external/zlib/src/ |
| 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 */
[all...] |
| 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++; \
|
| deflate.c | [all...] |
| /external/chromium_org/third_party/zlib/ |
| deflate.h | 197 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member in struct:internal_state
328 s->dyn_ltree[cc].Freq++; \
337 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
|
| trees.c | 391 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 */
[all...] |
| deflate.c | [all...] |
