root/xz
1
0
Fork 0
mirror of https://git.tukaani.org/xz.git synced 2025-12-11 16:08:45 +00:00
Code Issues Releases Wiki Activity

liblzma: Remove unwanted semicolons

Browse Source 
These didn't affect control flow.
This commit is contained in:
Lasse Collin 2025-11-26 13:50:57 +02:00
parent 524f6a7384
commit 723cee44d0
No known key found for this signature in database
GPG Key ID: 38EE757D69184620
3 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/liblzma/common/vli_decoder.c
View File

@ -38,7 +38,7 @@ lzma_vli_decode(lzma_vli *restrict vli, size_t *vli_pos,
// Validate the arguments. // Validate the arguments.
if (*vli_pos >= LZMA_VLI_BYTES_MAX if (*vli_pos >= LZMA_VLI_BYTES_MAX
|| (*vli >> (*vli_pos * 7)) != 0) || (*vli >> (*vli_pos * 7)) != 0)
return LZMA_PROG_ERROR;; return LZMA_PROG_ERROR;
if (*in_pos >= in_size) if (*in_pos >= in_size)
return LZMA_BUF_ERROR; return LZMA_BUF_ERROR;

4
src/liblzma/lzma/lzma_common.h
View File

@ -88,14 +88,14 @@ typedef enum {
#define update_literal_normal(state) \ #define update_literal_normal(state) \
state = ((state) <= STATE_SHORTREP_LIT_LIT \ state = ((state) <= STATE_SHORTREP_LIT_LIT \
? STATE_LIT_LIT \ ? STATE_LIT_LIT \
: (state) - 3); : (state) - 3)
/// Like update_literal(state) but when it is already known that /// Like update_literal(state) but when it is already known that
/// is_literal_state(state) is false. /// is_literal_state(state) is false.
#define update_literal_matched(state) \ #define update_literal_matched(state) \
state = ((state) <= STATE_LIT_SHORTREP \ state = ((state) <= STATE_LIT_SHORTREP \
? (state) - 3 \ ? (state) - 3 \
: (state) - 6); : (state) - 6)
/// Indicate that the latest state was a match. /// Indicate that the latest state was a match.
#define update_match(state) \ #define update_match(state) \

6
src/liblzma/rangecoder/range_decoder.h
View File

@ -246,14 +246,14 @@ do { \
#define rc_bit(prob, action0, action1) \ #define rc_bit(prob, action0, action1) \
rc_bit_last(prob, \ rc_bit_last(prob, \
symbol <<= 1; action0, \ symbol <<= 1; action0, \
symbol = (symbol << 1) + 1; action1); symbol = (symbol << 1) + 1; action1)
#define rc_bit_safe(prob, action0, action1, seq) \ #define rc_bit_safe(prob, action0, action1, seq) \
rc_bit_last_safe(prob, \ rc_bit_last_safe(prob, \
symbol <<= 1; action0, \ symbol <<= 1; action0, \
symbol = (symbol << 1) + 1; action1, \ symbol = (symbol << 1) + 1; action1, \
seq); seq)
// Unroll fixed-sized bittree decoding. // Unroll fixed-sized bittree decoding.
// //
@ -327,7 +327,7 @@ do { \
#define rc_bit_add_if_1(probs, dest, value_to_add_if_1) \ #define rc_bit_add_if_1(probs, dest, value_to_add_if_1) \
rc_bit(probs[symbol], \ rc_bit(probs[symbol], \
, \ , \
dest += value_to_add_if_1); dest += value_to_add_if_1)
// Matched literal // Matched literal