Home
last modified time | relevance | path

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

/external/zlib/src/
Dtrees.c386 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++;
1132 if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
1136 if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
[all …]
Ddeflate.h195 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
327 s->dyn_ltree[cc].Freq++; \
336 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
Ddeflate.c1061 ds->l_desc.dyn_tree = ds->dyn_ltree;
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
Dfx_zlib_trees.c386 s->l_desc.dyn_tree = s->dyn_ltree; in _tr_init()
415 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0; in init_block()
419 s->dyn_ltree[END_BLOCK].Freq = 1; in init_block()
807 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); in build_bl_tree()
855 send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */ in send_all_trees()
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++;
1132 if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
1136 if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
[all …]
Ddeflate.h195 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ member
327 s->dyn_ltree[cc].Freq++; \
336 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
Dfx_zlib_deflate.c1060 ds->l_desc.dyn_tree = ds->dyn_ltree; in deflateCopy()
/external/chromium-trace/trace-viewer/tracing/third_party/jszip/
Djszip.min.js13 …ce_match=0,this.dyn_ltree=new C.Buf16(2*fb),this.dyn_dtree=new C.Buf16(2*(2*db+1)),this.bl_tree=ne…
14 …dyn_ltree[2*b]=0;for(b=0;R>b;b++)a.dyn_dtree[2*b]=0;for(b=0;S>b;b++)a.bl_tree[2*b]=0;a.dyn_ltree[2…