Home
last modified time | relevance | path

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

/dflybsd-src/sbin/hammer2/zlib/
H A Dhammer2_zlib_trees.c395 s->bl_desc.dyn_tree = s->bl_tree; in _tr_init()
421 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; in init_block()
684 if (tree == s->bl_tree) { in build_tree()
732 s->bl_tree[curlen].Freq += count; in scan_tree()
734 if (curlen != prevlen) s->bl_tree[curlen].Freq++; in scan_tree()
735 s->bl_tree[REP_3_6].Freq++; in scan_tree()
737 s->bl_tree[REPZ_3_10].Freq++; in scan_tree()
739 s->bl_tree[REPZ_11_138].Freq++; in scan_tree()
776 do { send_code(s, curlen, s->bl_tree); } while (--count != 0); in send_tree()
780 send_code(s, curlen, s->bl_tree); count--; in send_tree()
[all …]
H A Dhammer2_zlib_deflate.h188 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
/dflybsd-src/usr.sbin/makefs/hammer2/zlib/
H A Dhammer2_zlib_trees.c395 s->bl_desc.dyn_tree = s->bl_tree; in _tr_init()
421 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; in init_block()
684 if (tree == s->bl_tree) { in build_tree()
732 s->bl_tree[curlen].Freq += count; in scan_tree()
734 if (curlen != prevlen) s->bl_tree[curlen].Freq++; in scan_tree()
735 s->bl_tree[REP_3_6].Freq++; in scan_tree()
737 s->bl_tree[REPZ_3_10].Freq++; in scan_tree()
739 s->bl_tree[REPZ_11_138].Freq++; in scan_tree()
776 do { send_code(s, curlen, s->bl_tree); } while (--count != 0); in send_tree()
780 send_code(s, curlen, s->bl_tree); count--; in send_tree()
[all …]
H A Dhammer2_zlib_deflate.h188 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
/dflybsd-src/sys/vfs/hammer2/zlib/
H A Dhammer2_zlib_trees.c395 s->bl_desc.dyn_tree = s->bl_tree; in _tr_init()
421 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; in init_block()
684 if (tree == s->bl_tree) { in build_tree()
732 s->bl_tree[curlen].Freq += count; in scan_tree()
734 if (curlen != prevlen) s->bl_tree[curlen].Freq++; in scan_tree()
735 s->bl_tree[REP_3_6].Freq++; in scan_tree()
737 s->bl_tree[REPZ_3_10].Freq++; in scan_tree()
739 s->bl_tree[REPZ_11_138].Freq++; in scan_tree()
776 do { send_code(s, curlen, s->bl_tree); } while (--count != 0); in send_tree()
780 send_code(s, curlen, s->bl_tree); count--; in send_tree()
[all …]
H A Dhammer2_zlib_deflate.h188 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
/dflybsd-src/contrib/zlib-1.2/
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.c1151 ds->bl_desc.dyn_tree = ds->bl_tree;
/dflybsd-src/sys/net/
H A Dzlib.c453 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member
1180 ds->bl_desc.dyn_tree = ds->bl_tree; in deflateCopy()
2144 s->bl_desc.dyn_tree = s->bl_tree; in _tr_init()
2169 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0; in init_block()
2439 if (tree == s->bl_tree) { in build_tree()
2488 s->bl_tree[curlen].Freq += count; in scan_tree()
2490 if (curlen != prevlen) s->bl_tree[curlen].Freq++; in scan_tree()
2491 s->bl_tree[REP_3_6].Freq++; in scan_tree()
2493 s->bl_tree[REPZ_3_10].Freq++; in scan_tree()
2495 s->bl_tree[REPZ_11_138].Freq++; in scan_tree()
[all …]