函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\xz\xz_dec_lzma2.c Create Date:2022-07-27 08:06:37
Last Modify:2020-03-12 14:18:49 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称：Decode the length of the match into s->lzma.len.

函数原型：static void lzma_len(struct xz_dec_lzma2 *s, struct lzma_len_dec *l, uint32_t pos_state)

返回类型：void

参数：

类型参数名称
struct xz_dec_lzma2 *s
struct lzma_len_dec *l
uint32_tpos_state
625  如果非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则
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  否则
630  如果非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则
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  否则
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
调用者
名称描述
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.