HomeSort by relevance Sort by last modified time
    Searched refs:curMatch3 (Results 1 - 3 of 3) sorted by null

  /external/lzma/Java/SevenZip/Compression/LZ/
BinTree.java 154 int curMatch3 = _hash[kHash3Offset + hash3Value];
163 if (curMatch3 > matchMinPos)
164 if (_bufferBase[_bufferOffset + curMatch3] == _bufferBase[cur])
166 if (curMatch3 == curMatch2)
169 distances[offset++] = _pos - curMatch3 - 1;
170 curMatch2 = curMatch3;
  /external/lzma/CS/7zip/Compress/LZ/
LzBinTree.cs 154 UInt32 curMatch3 = _hash[kHash3Offset + hash3Value];
163 if (curMatch3 > matchMinPos)
164 if (_bufferBase[_bufferOffset + curMatch3] == _bufferBase[cur])
166 if (curMatch3 == curMatch2)
169 distances[offset++] = _pos - curMatch3 - 1;
170 curMatch2 = curMatch3;
  /external/lzma/C/
LzFindMt.c 579 UInt32 hash2Value, hash3Value, curMatch2, curMatch3;
586 curMatch3 = hash[kFix3HashSize + hash3Value];
603 if (curMatch3 >= matchMinPos && cur[(ptrdiff_t)curMatch3 - lzPos] == cur[0])
606 *distances++ = lzPos - curMatch3 - 1;
614 UInt32 hash2Value, hash3Value, hash4Value, curMatch2, curMatch3, curMatch4;
621 curMatch3 = hash[kFix3HashSize + hash3Value];
640 if (curMatch3 >= matchMinPos && cur[(ptrdiff_t)curMatch3 - lzPos] == cur[0])
642 distances[1] = lzPos - curMatch3 - 1;
    [all...]

Completed in 40 milliseconds