Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\xz\xz_dec_lzma2.c Create Date:2022-07-28 07:08:41
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

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

Proto:static void lzma_len(struct xz_dec_lzma2 *s, struct lzma_len_dec *l, uint32_t pos_state)

Type:void

Parameter:

TypeParameterName
struct xz_dec_lzma2 *s
struct lzma_len_dec *l
uint32_tpos_state
625  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
626  probs = Probabilities for match lengths 2-9 [pos_state]
627  limit = LEN_LOW_SYMBOLS
628  * Length of a match. This is updated so that dict_repeat can * be called again to finish repeating the whole match. = Minimum length of a match is two bytes.
629  Else
630  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
631  probs = Probabilities for match lengths 10-17 [pos_state]
632  limit = LEN_MID_SYMBOLS
633  * Length of a match. This is updated so that dict_repeat can * be called again to finish repeating the whole match. = Minimum length of a match is two bytes. + LEN_LOW_SYMBOLS
634  Else
635  probs = Probabilities for match lengths 18-273
636  limit = LEN_HIGH_SYMBOLS
637  * Length of a match. This is updated so that dict_repeat can * be called again to finish repeating the whole match. = Minimum length of a match is two bytes. + LEN_LOW_SYMBOLS + LEN_MID_SYMBOLS
642  * Length of a match. This is updated so that dict_repeat can * be called again to finish repeating the whole match. += Decode a bittree starting from the most significant bit. - limit
Caller
NameDescribe
lzma_matchDecode a match. The distance will be stored in s->lzma.rep0.
lzma_rep_matchDecode a repeated match. The distance is one of the four most recently* seen matches. The distance will be stored in s->lzma.rep0.