Searched defs:lenLimit (Results 1 - 4 of 4) sorted by relevance
/external/lzma/C/ |
H A D | LzFind.h | 19 UInt32 lenLimit;
member in struct:_CMatchFinder 79 UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *buffer, CLzRef *son,
|
H A D | LzFind.c | 287 UInt32 lenLimit = p->streamPos - p->pos;
local 288 if (lenLimit > p->matchMaxLen)
289 lenLimit = p->matchMaxLen;
290 p->lenLimit = lenLimit;
357 static UInt32 * Hc_GetMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son,
argument 373 while (++len != lenLimit)
380 if (len == lenLimit)
388 UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son,
argument 409 if (++len != lenLimit 443 SkipMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, UInt32 _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 cutValue) argument [all...] |
H A D | LzFindMt.c | 236 static Int32 NO_INLINE GetMatchesSpecN(UInt32 lenLimit, UInt32 pos, const Byte *cur, CLzRef *son,
argument 264 if (++len != lenLimit && pb[len] == cur[len])
265 while (++len != lenLimit)
272 if (len == lenLimit)
337 UInt32 lenLimit = p->matchMaxLen;
local 340 if (lenLimit >= p->hashNumAvail)
341 lenLimit = p->hashNumAvail;
343 UInt32 size2 = p->hashNumAvail - lenLimit + 1;
355 UInt32 num = (UInt32)(GetMatchesSpec1(lenLimit, pos - p->hashBuf[p->hashBufPos++],
367 curPos = limit - GetMatchesSpecN(lenLimit, po [all...] |
/external/lzma/Java/Tukaani/src/org/tukaani/xz/lz/ |
H A D | LZEncoder.java | 323 * @param lenLimit don't test for a match longer than this 325 * @return length of the match; it is in the range [0, lenLimit] 327 public int getMatchLen(int dist, int lenLimit) { argument 331 while (len < lenLimit && buf[readPos + len] == buf[backPos + len]) 342 * @param lenLimit don't test for a match longer than this 344 * @return length of the match; it is in the range [0, lenLimit] 346 public int getMatchLen(int forward, int dist, int lenLimit) { argument 351 while (len < lenLimit && buf[curPos + len] == buf[backPos + len]) 368 int lenLimit = Math.min(getAvail(), matchLenMax); 371 if (getMatchLen(matches.dist[i], lenLimit) ! [all...] |
Completed in 143 milliseconds