Searched refs:lenLimit (Results 1 – 7 of 7) sorted by relevance
| /third_party/lzma/C/ |
| D | LzFindOpt.c | 217 UInt32 * Z7_FASTCALL GetMatchesSpecN_2(const Byte *lenLimit, size_t pos, const Byte *cur, CLzRef *s…
223 UInt32 * Z7_FASTCALL GetMatchesSpecN_2(const Byte *lenLimit, size_t pos, const Byte *cur, CLzRef *s… in GetMatchesSpecN_2() argument
244 lenLimit++; in GetMatchesSpecN_2()
293 if (++len != lenLimit && len[diff] == len[0]) in GetMatchesSpecN_2()
294 while (++len != lenLimit) in GetMatchesSpecN_2()
306 if (len == lenLimit) in GetMatchesSpecN_2()
321 if (hash == size || *hash != delta || lenLimit[diff] != lenLimit[0] || d >= limit) in GetMatchesSpecN_2()
328 *d++ = (UInt32)(lenLimit - cur); in GetMatchesSpecN_2()
331 lenLimit++; in GetMatchesSpecN_2()
351 if (hash == size || *hash != delta || lenLimit[diff] != lenLimit[0] || d >= limit) in GetMatchesSpecN_2()
|
| D | LzFind.c | 524 p->lenLimit = mm; in MatchFinder_SetLimits()
873 static UInt32 * Hc_GetMatchesSpec(size_t lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CL… in Hc_GetMatchesSpec() argument
906 const Byte *lim = cur + lenLimit; in Hc_GetMatchesSpec()
955 UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, in GetMatchesSpec1() argument
982 if (++len != lenLimit && pb[len] == cur[len]) in GetMatchesSpec1()
983 while (++len != lenLimit) in GetMatchesSpec1()
991 if (len == lenLimit) in GetMatchesSpec1()
1025 static void SkipMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *… in SkipMatchesSpec() argument
1049 while (++len != lenLimit) in SkipMatchesSpec()
1053 if (len == lenLimit) in SkipMatchesSpec()
[all …]
|
| D | LzFind.h | 19 UInt32 lenLimit; member
117 UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *buffer, CLzRef *…
|
| D | LzFindMt.c | 563 UInt32 * Z7_FASTCALL GetMatchesSpecN_2(const Byte *lenLimit, size_t pos, const Byte *cur, CLzRef *s…
648 UInt32 lenLimit = p->matchMaxLen; in BtGetMatches() local
649 if (lenLimit >= p->hashNumAvail) in BtGetMatches()
650 lenLimit = p->hashNumAvail; in BtGetMatches()
652 UInt32 size2 = p->hashNumAvail - lenLimit + 1; in BtGetMatches()
672 UInt32 num = (UInt32)(GetMatchesSpec1(lenLimit, pos - p->hashBuf[p->hashBufPos++], in BtGetMatches()
687 p->buffer + lenLimit - 1, in BtGetMatches()
|
| /third_party/lzma/Java/SevenZip/Compression/LZ/ |
| D | BinTree.java | 120 int lenLimit; in GetMatches() local
122 lenLimit = _matchMaxLen; in GetMatches()
125 lenLimit = _streamPos - _pos; in GetMatches()
126 if (lenLimit < kMinMatchCheck) in GetMatches()
218 while(++len != lenLimit) in GetMatches()
225 if (len == lenLimit) in GetMatches()
256 int lenLimit; in Skip() local
258 lenLimit = _matchMaxLen; in Skip()
261 lenLimit = _streamPos - _pos; in Skip()
262 if (lenLimit < kMinMatchCheck) in Skip()
[all …]
|
| /third_party/lzma/CS/7zip/Compress/LZ/ |
| D | LzBinTree.cs | 120 UInt32 lenLimit; in GetMatches()
122 lenLimit = _matchMaxLen; in GetMatches()
125 lenLimit = _streamPos - _pos; in GetMatches()
126 if (lenLimit < kMinMatchCheck) in GetMatches()
218 while(++len != lenLimit) in GetMatches()
225 if (len == lenLimit) in GetMatches()
256 UInt32 lenLimit; in Skip()
258 lenLimit = _matchMaxLen; in Skip()
261 lenLimit = _streamPos - _pos; in Skip()
262 if (lenLimit < kMinMatchCheck) in Skip()
[all …]
|
| /third_party/lzma/Asm/x86/ |
| D | LzFindOpt.asm | 69 lenLimit equ r8 define
78 lenLimit equ REG_ABI_PARAM_2 define
171 ; we want cur in (rcx). So we change the cur and lenLimit variables
172 sub lenLimit, cur
177 sub t0, lenLimit
236 mov len0, lenLimit
352 ; while (++len != lenLimit) (len[diff] != len[0]) ;
385 add len, lenLimit
428 ; if (hash == size || *hash != delta || lenLimit[diff] != lenLimit[0] || d >= limit)
|