Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

Name:LZ4HC_InsertAndGetWiderMatch

Proto:static inline __attribute__((__always_inline__)) int LZ4HC_InsertAndGetWiderMatch(LZ4HC_CCtx_internal *hc4, const BYTE *const ip, const BYTE *const iLowLimit, const BYTE *const iHighLimit, int longest, const BYTE **matchpos, const BYTE **startpos, const int maxNbAttempts)

Type:int

Parameter:

TypeParameterName
LZ4HC_CCtx_internal *hc4
const BYTE *constip
const BYTE *constiLowLimit
const BYTE *constiHighLimit
intlongest
const BYTE **matchpos
const BYTE **startpos
const intmaxNbAttempts
178  chainTable = chainTable
179  HashTable = hashTable
180  base = All index relative to this position
181  dictLimit = low that point, need extDict
182  lowPrefixPtr = base + dictLimit
183  lowLimit = If low that point, no more dict + 64 * KB > ip - base Then low that point, no more dict Else ip - base - 64 * KB - 1
186  dictBase = alternate base for extDict
188  nbAttempts = maxNbAttempts
189  delta = ip - iLowLimit
192  Update chains up to ip (excluded)
193  matchIndex = HashTable[LZ4HC_hashPtr(ip)]
195  When matchIndex >= lowLimit && nbAttempts cycle
197  nbAttempts--
198  If matchIndex >= dictLimit Then
199  matchPtr = base + matchIndex
201  If *(iLowLimit + longest) == *( matchPtr - delta + longest) Then
224  Else
225  matchPtr = dictBase + matchIndex
227  If LZ4_read32(matchPtr) == LZ4_read32(ip) Then
256  matchIndex -= aster (matchIndex)
259  Return longest
Caller
NameDescribe
LZ4HC_compress_generic