Home
last modified time | relevance | path

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

/titanic_53/usr/src/boot/lib/libz/
H A 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 …]
H A Ddeflate.h197 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
H A Ddeflate.c1063 ds->bl_desc.dyn_tree = ds->bl_tree;
/titanic_53/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++;
769 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
773 send_code(s, curlen, s->bl_tree); count--;
[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;
/titanic_53/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c315 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
1751 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++;
2130 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
[all …]
/titanic_53/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c477 struct ct_data_s bl_tree[2*BL_CODES+1]; member
1354 ds->bl_desc.dyn_tree = ds->bl_tree;
2552 s->bl_desc.dyn_tree = s->bl_tree;
2580 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
2870 if (tree == s->bl_tree) {
2921 s->bl_tree[curlen].Freq += count;
2923 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
2924 s->bl_tree[REP_3_6].Freq++;
2926 s->bl_tree[REPZ_3_10].Freq++;
2928 s->bl_tree[REPZ_11_138].Freq++;
[all …]
/titanic_53/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