Searched refs:bl_tree (Results 1 - 7 of 7) sorted by relevance

/freebsd-10.0-release/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++;
748 * bl_tree.
771 do { send_code(s, curlen, s->bl_tree); } whil
[all...]
H A Ddeflate.h197 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member in struct:internal_state
H A Ddeflate.c1063 ds->bl_desc.dyn_tree = ds->bl_tree;
/freebsd-10.0-release/sys/cddl/contrib/opensolaris/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++;
750 * bl_tree.
773 do { send_code(s, curlen, s->bl_tree); } whil
[all...]
H A Ddeflate.h194 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member in struct:internal_state
H A Ddeflate.c949 ds->bl_desc.dyn_tree = ds->bl_tree;
/freebsd-10.0-release/sys/net/
H A Dzlib.c451 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ member in struct:deflate_state
1193 ds->bl_desc.dyn_tree = ds->bl_tree;
2159 s->bl_desc.dyn_tree = s->bl_tree;
2184 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
2445 if (tree == s->bl_tree) {
2492 s->bl_tree[curlen].Freq += count;
2494 if (curlen != prevlen) s->bl_tree[curlen].Freq++;
2495 s->bl_tree[REP_3_6].Freq++;
2497 s->bl_tree[REPZ_3_10].Freq++;
2499 s->bl_tree[REPZ_11_13
[all...]

Completed in 98 milliseconds