Home
last modified time | relevance | path

Searched refs:bl_tree (Results 1 - 15 of 15) sorted by relevance

/third_party/node/deps/v8/third_party/zlib/
H A Dtrees.c390 s->bl_desc.dyn_tree = s->bl_tree;
415 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
677 if (tree == s->bl_tree) {
724 s->bl_tree[curlen].Freq += count;
726 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
727 s->bl_tree[REP_3_6].Freq++;
729 s->bl_tree[REPZ_3_10].Freq++;
731 s->bl_tree[REPZ_11_138].Freq++;
746 * bl_tree.
769 do { send_code(s, curlen, s->bl_tree); } whil
[all...]
H A Ddeflate.h200 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
H A Ddeflate.c1203 ds->bl_desc.dyn_tree = ds->bl_tree;
/third_party/node/deps/zlib/
H A Dtrees.c445 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; in init_block()
464 s->bl_desc.dyn_tree = s->bl_tree; in _tr_init()
684 if (tree == s->bl_tree) { in build_tree()
727 s->bl_tree[curlen].Freq += count; in scan_tree()
729 if (curlen != prevlen) s->bl_tree[curlen].Freq++; in scan_tree()
730 s->bl_tree[REP_3_6].Freq++; in scan_tree()
732 s->bl_tree[REPZ_3_10].Freq++; in scan_tree()
734 s->bl_tree[REPZ_11_138].Freq++; in scan_tree()
749 * bl_tree.
768 do { send_code(s, curlen, s->bl_tree); } whil in send_tree()
[all...]
H A Ddeflate.h204 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
H A Ddeflate.c1379 ds->bl_desc.dyn_tree = ds->bl_tree; in deflateCopy()
/third_party/libwebsockets/win32port/zlib/
H A Dtrees.c397 s->bl_desc.dyn_tree = s->bl_tree;
423 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
685 if (tree == s->bl_tree) {
732 s->bl_tree[curlen].Freq += count;
734 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
735 s->bl_tree[REP_3_6].Freq++;
737 s->bl_tree[REPZ_3_10].Freq++;
739 s->bl_tree[REPZ_11_138].Freq++;
754 * bl_tree.
777 do { send_code(s, curlen, s->bl_tree); } whil
[all...]
H A Ddeflate.h194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
H A Ddeflate.c1025 ds->bl_desc.dyn_tree = ds->bl_tree;
/third_party/skia/third_party/externals/zlib/
H A Dtrees.c390 s->bl_desc.dyn_tree = s->bl_tree;
415 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
677 if (tree == s->bl_tree) {
724 s->bl_tree[curlen].Freq += count;
726 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
727 s->bl_tree[REP_3_6].Freq++;
729 s->bl_tree[REPZ_3_10].Freq++;
731 s->bl_tree[REPZ_11_138].Freq++;
746 * bl_tree.
769 do { send_code(s, curlen, s->bl_tree); } whil
[all...]
H A Ddeflate.h200 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
H A Ddeflate.c1195 ds->bl_desc.dyn_tree = ds->bl_tree;
/third_party/zlib/
H A Dtrees.c462 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; in init_block()
481 s->bl_desc.dyn_tree = s->bl_tree; in _tr_init()
704 if (tree == s->bl_tree) { in build_tree()
748 s->bl_tree[curlen].Freq += count; in scan_tree()
750 if (curlen != prevlen) s->bl_tree[curlen].Freq++; in scan_tree()
751 s->bl_tree[REP_3_6].Freq++; in scan_tree()
753 s->bl_tree[REPZ_3_10].Freq++; in scan_tree()
755 s->bl_tree[REPZ_11_138].Freq++; in scan_tree()
770 * bl_tree.
790 do { send_code(s, curlen, s->bl_tree); } whil in send_tree()
[all...]
H A Ddeflate.h204 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
H A Ddeflate.c1340 ds->bl_desc.dyn_tree = ds->bl_tree; in deflateCopy()

Completed in 24 milliseconds