Home
last modified time | relevance | path

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

/external/python/cpython2/Modules/zlib/
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++;
769 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
773 send_code(s, curlen, s->bl_tree); count--;
[all …]
Ddeflate.h200 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
Ddeflate.c1151 ds->bl_desc.dyn_tree = ds->bl_tree;
/external/u-boot/lib/zlib/
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++;
777 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
781 send_code(s, curlen, s->bl_tree); count--;
[all …]
Ddeflate.h194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
Ddeflate.c977 ds->bl_desc.dyn_tree = ds->bl_tree;
/external/zlib/src/
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++;
769 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
773 send_code(s, curlen, s->bl_tree); count--;
[all …]
Ddeflate.h200 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
Ddeflate.c1151 ds->bl_desc.dyn_tree = ds->bl_tree;