/external/lzma/Java/SevenZip/Compression/LZ/ |
BinTree.java | 120 int lenLimit;
122 lenLimit = _matchMaxLen;
125 lenLimit = _streamPos - _pos;
126 if (lenLimit < kMinMatchCheck)
218 while(++len != lenLimit)
225 if (len == lenLimit)
256 int lenLimit;
258 lenLimit = _matchMaxLen;
261 lenLimit = _streamPos - _pos;
262 if (lenLimit < kMinMatchCheck) [all...] |
/external/chromium_org/third_party/lzma_sdk/ |
LzFind.c | 263 UInt32 lenLimit = p->streamPos - p->pos; 264 if (lenLimit > p->matchMaxLen) 265 lenLimit = p->matchMaxLen; 266 p->lenLimit = lenLimit; 322 static UInt32 * Hc_GetMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, 338 while (++len != lenLimit) 345 if (len == lenLimit) 353 UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, 374 if (++len != lenLimit && pb[len] == cur[len] [all...] |
LzFind.h | 21 UInt32 lenLimit; 76 UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *buffer, CLzRef *son,
|
/external/chromium_org/third_party/ots/third_party/lzma_sdk/ |
LzFind.c | 264 UInt32 lenLimit = p->streamPos - p->pos; 265 if (lenLimit > p->matchMaxLen) 266 lenLimit = p->matchMaxLen; 267 p->lenLimit = lenLimit; 323 static UInt32 * Hc_GetMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, 339 while (++len != lenLimit) 346 if (len == lenLimit) 354 UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, 375 if (++len != lenLimit && pb[len] == cur[len] [all...] |
LzFind.h | 22 UInt32 lenLimit; 77 UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *buffer, CLzRef *son,
|
/external/lzma/C/ |
LzFind.c | 263 UInt32 lenLimit = p->streamPos - p->pos;
264 if (lenLimit > p->matchMaxLen)
265 lenLimit = p->matchMaxLen;
266 p->lenLimit = lenLimit;
322 static UInt32 * Hc_GetMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son,
338 while (++len != lenLimit)
345 if (len == lenLimit)
353 UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son,
374 if (++len != lenLimit && pb[len] == cur[len]) [all...] |
LzFind.h | 21 UInt32 lenLimit;
76 UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *buffer, CLzRef *son,
|
LzFindMt.c | 234 Int32 NO_INLINE GetMatchesSpecN(UInt32 lenLimit, UInt32 pos, const Byte *cur, CLzRef *son,
262 if (++len != lenLimit && pb[len] == cur[len])
263 while (++len != lenLimit)
270 if (len == lenLimit)
331 UInt32 lenLimit = p->matchMaxLen;
334 if (lenLimit >= p->hashNumAvail)
335 lenLimit = p->hashNumAvail;
337 UInt32 size2 = p->hashNumAvail - lenLimit + 1;
348 UInt32 num = (UInt32)(GetMatchesSpec1(lenLimit, pos - p->hashBuf[p->hashBufPos++],
360 curPos = limit - GetMatchesSpecN(lenLimit, pos, p->buffer, p->son, cyclicBufferPos, p->cyclicBufferSize, p->cutValue, [all...] |
/external/lzma/CS/7zip/Compress/LZ/ |
LzBinTree.cs | 120 UInt32 lenLimit;
122 lenLimit = _matchMaxLen;
125 lenLimit = _streamPos - _pos;
126 if (lenLimit < kMinMatchCheck)
218 while(++len != lenLimit)
225 if (len == lenLimit)
256 UInt32 lenLimit;
258 lenLimit = _matchMaxLen;
261 lenLimit = _streamPos - _pos;
262 if (lenLimit < kMinMatchCheck) [all...] |