Searched refs:lenLimit (Results 1 - 7 of 7) sorted by relevance
| /third_party/lzma/C/ |
| H A D | LzFindOpt.c | 45 UInt32 * Z7_FASTCALL GetMatchesSpecN_1(const Byte *lenLimit, size_t pos, const Byte *cur, CLzRef *son,
58 lenLimit++;
92 if (++len != lenLimit && len[diff] == len[0])
93 while (++len != lenLimit)
105 if (len == lenLimit)
120 if (hash == size || *hash != delta || lenLimit[diff] != lenLimit[0] || d >= limit)
129 lenLimit++;
149 if (hash == size || *hash != delta || lenLimit[diff] != lenLimit[
223 GetMatchesSpecN_2(const Byte *lenLimit, size_t pos, const Byte *cur, CLzRef *son, UInt32 _cutValue, UInt32 *d, size_t _maxLen, const UInt32 *hash, const UInt32 *limit, const UInt32 *size, size_t _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 *posRes) GetMatchesSpecN_2() argument
[all...] |
| H A D | LzFind.c | 513 // the limitation for (p->lenLimit) update
in MatchFinder_SetLimits()
524 p->lenLimit = mm;
in MatchFinder_SetLimits()
870 (lenLimit > maxLen)
873 static UInt32 * Hc_GetMatchesSpec(size_t lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son,
in Hc_GetMatchesSpec() argument
890 while (++len != lenLimit)
in Hc_GetMatchesSpec()
898 if (len == lenLimit)
in Hc_GetMatchesSpec()
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()
1025 SkipMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, size_t _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 cutValue) SkipMatchesSpec() argument
[all...] |
| H A D | LzFind.h | 19 UInt32 lenLimit;
member
117 UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *buffer, CLzRef *son,
|
| H A D | LzFindMt.c | 563 UInt32 * Z7_FASTCALL GetMatchesSpecN_2(const Byte *lenLimit, size_t pos, const Byte *cur, CLzRef *son,
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/ |
| H A D | BinTree.java | 120 int 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 int lenLimit;
in Skip()
258 lenLimit = _matchMaxLen;
in Skip()
261 lenLimit = _streamPos - _pos;
in Skip()
262 if (lenLimit < kMinMatchChec in Skip()
[all...] |
| /third_party/lzma/CS/7zip/Compress/LZ/ |
| H A 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 < kMinMatchChec in Skip()
[all...] |
| /third_party/lzma/Asm/x86/ |
| H A 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[
[all...] |
Completed in 7 milliseconds