Home
last modified time | relevance | path

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

/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
Ddeflate.h196 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
337 s->dyn_dtree[d_code(dist)].Freq++; \
Dfx_zlib_trees.c389 s->d_desc.dyn_tree = s->dyn_dtree; in _tr_init()
416 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0; in init_block()
808 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code); in build_bl_tree()
858 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */ in send_all_trees()
985 (const ct_data *)s->dyn_dtree);
1029 s->dyn_dtree[d_code(dist)].Freq++;
1040 out_length += (ulg)s->dyn_dtree[dcode].Freq *
Dfx_zlib_deflate.c1061 ds->d_desc.dyn_tree = ds->dyn_dtree; in deflateCopy()
/external/zlib/src/
Ddeflate.h196 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ member
337 s->dyn_dtree[d_code(dist)].Freq++; \
Dtrees.c389 s->d_desc.dyn_tree = s->dyn_dtree;
416 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
808 scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
858 send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
985 (const ct_data *)s->dyn_dtree);
1029 s->dyn_dtree[d_code(dist)].Freq++;
1040 out_length += (ulg)s->dyn_dtree[dcode].Freq *
Ddeflate.c1062 ds->d_desc.dyn_tree = ds->dyn_dtree;
/external/chromium-trace/trace-viewer/tracing/third_party/jszip/
Djszip.min.js13 …=new C.Buf16(2*fb),this.dyn_dtree=new C.Buf16(2*(2*db+1)),this.bl_tree=new C.Buf16(2*(2*eb+1)),f(t…
14 …dyn_dtree[2*b]=0;for(b=0;S>b;b++)a.bl_tree[2*b]=0;a.dyn_ltree[2*X]=1,a.opt_len=a.static_len=0,a.la…