Home
last modified time | relevance | path

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

/external/zlib/src/
Dtrees.c392 s->bl_desc.dyn_tree = s->bl_tree;
417 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
679 if (tree == s->bl_tree) {
726 s->bl_tree[curlen].Freq += count;
728 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
729 s->bl_tree[REP_3_6].Freq++;
731 s->bl_tree[REPZ_3_10].Freq++;
733 s->bl_tree[REPZ_11_138].Freq++;
771 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
775 send_code(s, curlen, s->bl_tree); count--;
[all …]
Ddeflate.h197 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
Ddeflate.c1063 ds->bl_desc.dyn_tree = ds->bl_tree;
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
Dfx_zlib_trees.c392 s->bl_desc.dyn_tree = s->bl_tree; in _tr_init()
417 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; in init_block()
679 if (tree == s->bl_tree) { in build_tree()
726 s->bl_tree[curlen].Freq += count; in scan_tree()
728 if (curlen != prevlen) s->bl_tree[curlen].Freq++; in scan_tree()
729 s->bl_tree[REP_3_6].Freq++; in scan_tree()
731 s->bl_tree[REPZ_3_10].Freq++; in scan_tree()
733 s->bl_tree[REPZ_11_138].Freq++; in scan_tree()
771 do { send_code(s, curlen, s->bl_tree); } while (--count != 0); in send_tree()
775 send_code(s, curlen, s->bl_tree); count--; in send_tree()
[all …]
Ddeflate.h197 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
Dfx_zlib_deflate.c1062 ds->bl_desc.dyn_tree = ds->bl_tree; in deflateCopy()
/external/chromium-trace/trace-viewer/tracing/third_party/jszip/
Djszip.min.js13 …dtree=new C.Buf16(2*(2*db+1)),this.bl_tree=new C.Buf16(2*(2*eb+1)),f(this.dyn_ltree),f(this.dyn_dt…
14 …bl_tree[2*b]=0;a.dyn_ltree[2*X]=1,a.opt_len=a.static_len=0,a.last_lit=a.matches=0}function o(a){a.…