Home
last modified time | relevance | path

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

/illumos-gate/usr/src/contrib/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++;
773 send_code(s, curlen, s->bl_tree); count--;
819 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
[all …]
H A Ddeflate.h198 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
H A Ddeflate.c1189 ds->bl_desc.dyn_tree = ds->bl_tree;
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c1751 s->bl_desc.dyn_tree = s->bl_tree;
1777 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
2038 if (tree == s->bl_tree) {
2085 s->bl_tree[curlen].Freq += count;
2087 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
2088 s->bl_tree[REP_3_6].Freq++;
2090 s->bl_tree[REPZ_3_10].Freq++;
2092 s->bl_tree[REPZ_11_138].Freq++;
2134 send_code(s, curlen, s->bl_tree); count--;
2180 if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
[all …]
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c475 struct ct_data_s bl_tree[2*BL_CODES+1]; member
1352 ds->bl_desc.dyn_tree = ds->bl_tree;
2550 s->bl_desc.dyn_tree = s->bl_tree;
2868 if (tree == s->bl_tree) {
2919 s->bl_tree[curlen].Freq += count;
2922 s->bl_tree[REP_3_6].Freq++;
2924 s->bl_tree[REPZ_3_10].Freq++;
2926 s->bl_tree[REPZ_11_138].Freq++;
2974 send_code(s, REP_3_6, s->bl_tree);
2978 send_code(s, REPZ_3_10, s->bl_tree);
[all …]
/illumos-gate/usr/src/contrib/ast/src/cmd/INIT/
H A Dratz.c1404 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member