Home
last modified time | relevance | path

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

/netbsd-src/external/gpl3/gdb/dist/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.h200 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
H A Ddeflate.c1191 ds->bl_desc.dyn_tree = ds->bl_tree;
/netbsd-src/external/cddl/osnet/dist/uts/common/zmod/
H A Dtrees.c393 s->bl_desc.dyn_tree = s->bl_tree;
419 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
681 if (tree == s->bl_tree) {
728 s->bl_tree[curlen].Freq += count;
730 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
731 s->bl_tree[REP_3_6].Freq++;
733 s->bl_tree[REPZ_3_10].Freq++;
735 s->bl_tree[REPZ_11_138].Freq++;
773 do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
777 send_code(s, curlen, s->bl_tree); count--;
[all …]
H A Ddeflate.h194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
H A Ddeflate.c949 ds->bl_desc.dyn_tree = ds->bl_tree;
/netbsd-src/external/gpl3/binutils/dist/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.h200 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
H A Ddeflate.c1191 ds->bl_desc.dyn_tree = ds->bl_tree;
/netbsd-src/external/gpl3/binutils.old/dist/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.h200 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
H A Ddeflate.c1191 ds->bl_desc.dyn_tree = ds->bl_tree;
/netbsd-src/sys/net/
H A Dzlib.c467 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
1261 ds->bl_desc.dyn_tree = ds->bl_tree;
2490 s->bl_desc.dyn_tree = s->bl_tree; in _tr_init()
2515 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; in init_block()
2772 if (tree == s->bl_tree) { in build_tree()
2818 s->bl_tree[curlen].Freq += count; in scan_tree()
2820 if (curlen != prevlen) s->bl_tree[curlen].Freq++; in scan_tree()
2821 s->bl_tree[REP_3_6].Freq++; in scan_tree()
2823 s->bl_tree[REPZ_3_10].Freq++; in scan_tree()
2825 s->bl_tree[REPZ_11_138].Freq++; in scan_tree()
[all …]