|
enum | {
SEQ_NORMALIZE
, SEQ_IS_MATCH
, seq_8 =(SEQ_LITERAL)
, seq_8 =(SEQ_LITERAL)
,
SEQ_LITERAL_WRITE
, SEQ_IS_REP
, seq_len =(SEQ_MATCH_LEN)
, seq_6 =(SEQ_DIST_SLOT)
,
SEQ_DIST_MODEL
, SEQ_DIRECT
, seq_4 =(SEQ_ALIGN)
, SEQ_EOPM
,
SEQ_IS_REP0
, SEQ_SHORTREP
, SEQ_IS_REP0_LONG
, SEQ_IS_REP1
,
SEQ_IS_REP2
, seq_len =(SEQ_MATCH_LEN)
, SEQ_COPY
} |
| Position where to continue the decoder loop. More...
|
|
enum | {
SEQ_NORMALIZE
, SEQ_IS_MATCH
, seq_8 =(SEQ_LITERAL)
, seq_8 =(SEQ_LITERAL)
,
SEQ_LITERAL_WRITE
, SEQ_IS_REP
, seq_len =(SEQ_MATCH_LEN)
, seq_6 =(SEQ_DIST_SLOT)
,
SEQ_DIST_MODEL
, SEQ_DIRECT
, seq_4 =(SEQ_ALIGN)
, SEQ_EOPM
,
SEQ_IS_REP0
, SEQ_SHORTREP
, SEQ_IS_REP0_LONG
, SEQ_IS_REP1
,
SEQ_IS_REP2
, seq_len =(SEQ_MATCH_LEN)
, SEQ_COPY
} |
| Position where to continue the decoder loop. More...
|
|
enum | {
SEQ_NORMALIZE
, SEQ_IS_MATCH
, SEQ_LITERAL
, SEQ_LITERAL_MATCHED
,
SEQ_LITERAL_WRITE
, SEQ_IS_REP
, SEQ_MATCH_LEN_CHOICE
, SEQ_MATCH_LEN_CHOICE2
,
SEQ_MATCH_LEN_BITTREE
, SEQ_DIST_SLOT
, SEQ_DIST_MODEL
, SEQ_DIRECT
,
SEQ_ALIGN
, SEQ_EOPM
, SEQ_IS_REP0
, SEQ_SHORTREP
,
SEQ_IS_REP0_LONG
, SEQ_IS_REP1
, SEQ_IS_REP2
, SEQ_REP_LEN_CHOICE
,
SEQ_REP_LEN_CHOICE2
, SEQ_REP_LEN_BITTREE
, SEQ_COPY
} |
| Position where to continue the decoder loop. More...
|
|
◆ anonymous enum
Position where to continue the decoder loop.
Enumerator |
---|
SEQ_NORMALIZE | |
SEQ_IS_MATCH | |
seq_8 | |
seq_8 | |
SEQ_LITERAL_WRITE | |
SEQ_IS_REP | |
seq_len | |
seq_6 | |
SEQ_DIST_MODEL | |
SEQ_DIRECT | |
seq_4 | |
SEQ_EOPM | |
SEQ_IS_REP0 | |
SEQ_SHORTREP | |
SEQ_IS_REP0_LONG | |
SEQ_IS_REP1 | |
SEQ_IS_REP2 | |
seq_len | |
SEQ_COPY | |
◆ anonymous enum
Position where to continue the decoder loop.
Enumerator |
---|
SEQ_NORMALIZE | |
SEQ_IS_MATCH | |
seq_8 | |
seq_8 | |
SEQ_LITERAL_WRITE | |
SEQ_IS_REP | |
seq_len | |
seq_6 | |
SEQ_DIST_MODEL | |
SEQ_DIRECT | |
seq_4 | |
SEQ_EOPM | |
SEQ_IS_REP0 | |
SEQ_SHORTREP | |
SEQ_IS_REP0_LONG | |
SEQ_IS_REP1 | |
SEQ_IS_REP2 | |
seq_len | |
SEQ_COPY | |
◆ anonymous enum
Position where to continue the decoder loop.
Enumerator |
---|
SEQ_NORMALIZE | |
SEQ_IS_MATCH | |
SEQ_LITERAL | |
SEQ_LITERAL_MATCHED | |
SEQ_LITERAL_WRITE | |
SEQ_IS_REP | |
SEQ_MATCH_LEN_CHOICE | |
SEQ_MATCH_LEN_CHOICE2 | |
SEQ_MATCH_LEN_BITTREE | |
SEQ_DIST_SLOT | |
SEQ_DIST_MODEL | |
SEQ_DIRECT | |
SEQ_ALIGN | |
SEQ_EOPM | |
SEQ_IS_REP0 | |
SEQ_SHORTREP | |
SEQ_IS_REP0_LONG | |
SEQ_IS_REP1 | |
SEQ_IS_REP2 | |
SEQ_REP_LEN_CHOICE | |
SEQ_REP_LEN_CHOICE2 | |
SEQ_REP_LEN_BITTREE | |
SEQ_COPY | |
◆ allow_eopm
True if end of payload marker (EOPM) is allowed even when uncompressed_size is known; false if EOPM must not be present. This is ignored if uncompressed_size == LZMA_VLI_UNKNOWN.
◆ dist_slot
Probability tree for the highest two bits of the match distance. There is a separate probability tree for match lengths of 2 (i.e. MATCH_LEN_MIN), 3, 4, and [5, 273].
◆ is_match
If 1, it's a match. Otherwise it's a single 8-bit literal.
◆ is_rep
If 1, it's a repeated match. The distance is one of rep0 .. rep3.
◆ is_rep0
If 0, distance of a repeated match is rep0. Otherwise check is_rep1.
◆ is_rep0_long
If 1, the repeated match has length of one byte. Otherwise the length is decoded from rep_len_decoder.
◆ is_rep1
If 0, distance of a repeated match is rep1. Otherwise check is_rep2.
◆ is_rep2
If 0, distance of a repeated match is rep2. Otherwise it is rep3.
◆ len
If decoding a literal: match byte. If decoding a match: length of the match.
◆ limit
Used as a loop termination condition on bittree decoders and direct bits decoder.
◆ literal
Literals; see comments in lzma_common.h.
◆ literal_context_bits
uint32_t literal_context_bits |
◆ literal_mask
◆ literal_pos_mask
uint32_t literal_pos_mask |
◆ match_len_decoder
Length of a normal match.
◆ offset
Matched literal decoder: 0x100 or 0 to help avoiding branches. Bittree reverse decoders: Offset of the next bit: 1 << offset
◆ pos_align
Probability tree for the lowest four bits of a match distance that is equal to or greater than 128.
◆ pos_mask
◆ pos_special
Probability trees for additional bits for match distance when the distance is in the range [4, 127].
◆ probs
Base of the current probability tree.
◆ rc
◆ rep0
Distance of the latest match.
◆ rep1
Distance of second latest match.
◆ rep2
Distance of third latest match.
◆ rep3
Distance of fourth latest match.
◆ rep_len_decoder
Length of a repeated match.
◆ [] [1/3]
Position where to continue the decoder loop.
◆ [] [2/3]
Position where to continue the decoder loop.
◆ [] [3/3]
Position where to continue the decoder loop.
◆ state
◆ symbol
Symbol being decoded. This is also used as an index variable in bittree decoders: probs[symbol]
◆ uncompressed_size
Uncompressed size as bytes, or LZMA_VLI_UNKNOWN if end of payload marker is expected.
The documentation for this struct was generated from the following files:
- C:/Pereira/Dua/source forge files my love/tar_dll/val/xcx_xz/xz-5.4.0/xz-5.4.0/src/liblzma/lzma/lzma_decoder.c
- C:/Pereira/Dua/source forge files my love/tar_dll/val/xcx_xz/xz-5.4.1/xz-5.4.1/src/liblzma/lzma/lzma_decoder.c
- C:/Pereira/Dua/source forge files my love/tar_dll/val/xcx_xz/xz-5.6.2/xz-5.6.2/src/liblzma/lzma/lzma_decoder.c