d6
/
xz-analysis-mirror
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Remove some redundant code from LZMA encoder.

This commit is contained in:
Lasse Collin 2008-06-20 16:19:54 +03:00
parent 0809c46534
commit eaafc4367c
1 changed files with 1 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
src/liblzma/lzma/lzma_encoder.c
View File

@ -26,19 +26,6 @@
// Literal // // Literal //
///////////// /////////////
static inline void
literal_normal(lzma_range_encoder *rc, probability *subcoder, uint32_t symbol)
{
uint32_t context = 1;
uint32_t bit_count = 8; // Bits per byte
do {
const uint32_t bit = (symbol >> --bit_count) & 1;
rc_bit(rc, &subcoder[context], bit);
context = (context << 1) | bit;
} while (bit_count != 0);
}
static inline void static inline void
literal_matched(lzma_range_encoder *rc, probability *subcoder, literal_matched(lzma_range_encoder *rc, probability *subcoder,
uint32_t match_byte, uint32_t symbol) uint32_t match_byte, uint32_t symbol)
@ -81,7 +68,7 @@ literal(lzma_coder *coder)
if (is_literal_state(coder->state)) { if (is_literal_state(coder->state)) {
// Previous LZMA-symbol was a literal. Encode a normal // Previous LZMA-symbol was a literal. Encode a normal
// literal without a match byte. // literal without a match byte.
literal_normal(&coder->rc, subcoder, cur_byte); rc_bittree(&coder->rc, subcoder, 8, cur_byte);
} else { } else {
// Previous LZMA-symbol was a match. Use the last byte of // Previous LZMA-symbol was a match. Use the last byte of
// the match as a "match byte". That is, compare the bits // the match as a "match byte". That is, compare the bits