Home
last modified time | relevance | path

Searched refs:lenLimit (Results 1 – 8 of 8) sorted by relevance

/external/lzma/C/
DLzFind.c265 UInt32 lenLimit = p->streamPos - p->pos; in MatchFinder_SetLimits() local
266 if (lenLimit > p->matchMaxLen) in MatchFinder_SetLimits()
267 lenLimit = p->matchMaxLen; in MatchFinder_SetLimits()
268 p->lenLimit = lenLimit; in MatchFinder_SetLimits()
324 static UInt32 * Hc_GetMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CL… in Hc_GetMatchesSpec() argument
340 while (++len != lenLimit) in Hc_GetMatchesSpec()
347 if (len == lenLimit) in Hc_GetMatchesSpec()
355 UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son, in GetMatchesSpec1() argument
376 if (++len != lenLimit && pb[len] == cur[len]) in GetMatchesSpec1()
377 while (++len != lenLimit) in GetMatchesSpec1()
[all …]
DLzFindMt.c236 Int32 NO_INLINE GetMatchesSpecN(UInt32 lenLimit, UInt32 pos, const Byte *cur, CLzRef *son, in GetMatchesSpecN() argument
264 if (++len != lenLimit && pb[len] == cur[len]) in GetMatchesSpecN()
265 while (++len != lenLimit) in GetMatchesSpecN()
272 if (len == lenLimit) in GetMatchesSpecN()
333 UInt32 lenLimit = p->matchMaxLen; in BtGetMatches() local
336 if (lenLimit >= p->hashNumAvail) in BtGetMatches()
337 lenLimit = p->hashNumAvail; in BtGetMatches()
339 UInt32 size2 = p->hashNumAvail - lenLimit + 1; in BtGetMatches()
350 UInt32 num = (UInt32)(GetMatchesSpec1(lenLimit, pos - p->hashBuf[p->hashBufPos++], in BtGetMatches()
362 …curPos = limit - GetMatchesSpecN(lenLimit, pos, p->buffer, p->son, cyclicBufferPos, p->cyclicBuffe… in BtGetMatches()
DLzFind.h19 UInt32 lenLimit; member
74 UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *buffer, CLzRef *…
/external/libgdx/gdx/src/com/badlogic/gdx/utils/compression/lz/
DBinTree.java93 int lenLimit; in GetMatches() local
95 lenLimit = _matchMaxLen; in GetMatches()
97 lenLimit = _streamPos - _pos; in GetMatches()
98 if (lenLimit < kMinMatchCheck) { in GetMatches()
172 while (++len != lenLimit) in GetMatches()
177 if (len == lenLimit) { in GetMatches()
202 int lenLimit; in Skip() local
204 lenLimit = _matchMaxLen; in Skip()
206 lenLimit = _streamPos - _pos; in Skip()
207 if (lenLimit < kMinMatchCheck) { in Skip()
[all …]
/external/lzma/Java/SevenZip/Compression/LZ/
DBinTree.java120 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 …]
/external/lzma/CS/7zip/Compress/LZ/
DLzBinTree.cs120 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 …]
/external/lzma/Java/Tukaani/src/org/tukaani/xz/lz/
DLZEncoder.java327 public int getMatchLen(int dist, int lenLimit) {
331 while (len < lenLimit && buf[readPos + len] == buf[backPos + len])
346 public int getMatchLen(int forward, int dist, int lenLimit) {
351 while (len < lenLimit && buf[curPos + len] == buf[backPos + len])
368 int lenLimit = Math.min(getAvail(), matchLenMax);
371 if (getMatchLen(matches.dist[i], lenLimit) != matches.len[i])
/external/lzma/Java/Tukaani/src/org/tukaani/xz/lzma/
DLZMAEncoderNormal.java403 int lenLimit = Math.min(niceLen, avail - 1);
404 int len = lz.getMatchLen(1, opts[optCur].reps[0], lenLimit);
430 int lenLimit = Math.min(avail, niceLen);
433 int len = lz.getMatchLen(opts[optCur].reps[rep], lenLimit);