lzma_rep_match

Name:Decode a repeated match. The distance is one of the four most recently* seen matches. The distance will be stored in s->lzma.rep0.

Proto:static void lzma_rep_match(struct xz_dec_lzma2 *s, uint32_t pos_state)

Type:void

Parameter:

Type	Parameter	Name
struct xz_dec_lzma2 *	s
uint32_t	pos_state

692

If Not Decode one bit. In some versions, this function has been splitted in three* functions so that the compiler is supposed to be able to more easily avoid* an extra branch. In this particular version of the LZMA decoder, this Then

693

If Not Decode one bit. In some versions, this function has been splitted in three* functions so that the compiler is supposed to be able to more easily avoid* an extra branch. In this particular version of the LZMA decoder, this Then

695

Indicate that the latest symbol was a short match.

696

* Length of a match. This is updated so that dict_repeat can * be called again to finish repeating the whole match. = 1

697

Return

699

Else

700

If Not Decode one bit. In some versions, this function has been splitted in three* functions so that the compiler is supposed to be able to more easily avoid* an extra branch. In this particular version of the LZMA decoder, this Then

701

tmp = rep1

702

Else

703

If Not Decode one bit. In some versions, this function has been splitted in three* functions so that the compiler is supposed to be able to more easily avoid* an extra branch. In this particular version of the LZMA decoder, this Then

704

tmp = rep2

705

Else

706

tmp = rep3

707

710

713

rep1 = Distances of latest four matches

714

Distances of latest four matches = tmp

717

Indicate that the latest state was a long repeated match.

718

Decode the length of the match into s->lzma.len.

**Caller**
Name	Describe
lzma_main	LZMA decoder core

Source code conversion tool public plug-in interface	X
Support c/c++/esqlc/java Oracle/Informix/Mysql Plug-in can realize: logical Report Code generation and batch code conversion