| /external/libgdx/gdx/src/com/badlogic/gdx/utils/compression/lz/ |
| BinTree.java | 93 int lenLimit;
95 lenLimit = _matchMaxLen;
97 lenLimit = _streamPos - _pos;
98 if (lenLimit < kMinMatchCheck) {
172 while (++len != lenLimit)
177 if (len == lenLimit) {
202 int lenLimit;
204 lenLimit = _matchMaxLen;
206 lenLimit = _streamPos - _pos;
207 if (lenLimit < kMinMatchCheck) {
[all...] |
| /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/lzma/C/ |
| LzFind.c | 265 UInt32 lenLimit = p->streamPos - p->pos;
266 if (lenLimit > p->matchMaxLen)
267 lenLimit = p->matchMaxLen;
268 p->lenLimit = lenLimit;
324 static UInt32 * Hc_GetMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son,
340 while (++len != lenLimit)
347 if (len == lenLimit)
355 UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son,
376 if (++len != lenLimit && pb[len] == cur[len])
[all...] |
| LzFind.h | 19 UInt32 lenLimit;
74 UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *buffer, CLzRef *son,
|
| LzFindMt.c | 236 Int32 NO_INLINE GetMatchesSpecN(UInt32 lenLimit, UInt32 pos, const Byte *cur, CLzRef *son,
264 if (++len != lenLimit && pb[len] == cur[len])
265 while (++len != lenLimit)
272 if (len == lenLimit)
333 UInt32 lenLimit = p->matchMaxLen;
336 if (lenLimit >= p->hashNumAvail)
337 lenLimit = p->hashNumAvail;
339 UInt32 size2 = p->hashNumAvail - lenLimit + 1;
350 UInt32 num = (UInt32)(GetMatchesSpec1(lenLimit, pos - p->hashBuf[p->hashBufPos++],
362 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...] |
| /external/lzma/Java/Tukaani/src/org/tukaani/xz/lz/ |
| 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) {
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) {
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]
[all...] |
| /external/lzma/Java/Tukaani/src/org/tukaani/xz/lzma/ |
| LZMAEncoderNormal.java | 403 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);
|
