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:38
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:Decode a bittree starting from the least significant bit.

Proto:static __always_inline void rc_bittree_reverse(struct rc_dec *rc, uint16_t *probs, uint32_t *dest, uint32_t limit)

Type:void

Parameter:

TypeParameterName
struct rc_dec *rc
uint16_t *probs
uint32_t *dest
uint32_tlimit
539  symbol = 1
540  i = 0
542  Do
543  If 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
544  symbol = (symbol << 1) + 1
545  dest += 1 << i
546  Else
547  symbol <<= 1
549  When ++i < limit cycle
Caller
NameDescribe
lzma_matchDecode a match. The distance will be stored in s->lzma.rep0.