Home
last modified time | relevance | path

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

/AliOS-Things-master/components/SDL2/src/image/external/zlib-1.2.11/
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++;
773 send_code(s, curlen, s->bl_tree); count--;
819 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
[all …]
A Ddeflate.h200 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
A Ddeflate.c1151 ds->bl_desc.dyn_tree = ds->bl_tree;
/AliOS-Things-master/components/py_engine/external/unzip/src/
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++;
781 send_code(s, curlen, s->bl_tree); count--;
827 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
[all …]
A Ddeflate.c979 ds->bl_desc.dyn_tree = ds->bl_tree;
/AliOS-Things-master/components/py_engine/external/unzip/internal/
A Ddeflate.h194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member

Completed in 26 milliseconds