OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:curMatch2
(Results
1 - 3
of
3
) sorted by null
/external/lzma/Java/SevenZip/Compression/LZ/
BinTree.java
153
int
curMatch2
= _hash[hash2Value];
157
if (
curMatch2
> matchMinPos)
158
if (_bufferBase[_bufferOffset +
curMatch2
] == _bufferBase[cur])
161
distances[offset++] = _pos -
curMatch2
- 1;
166
if (curMatch3 ==
curMatch2
)
170
curMatch2
= curMatch3;
172
if (offset != 0 &&
curMatch2
== curMatch)
/external/lzma/CS/7zip/Compress/LZ/
LzBinTree.cs
153
UInt32
curMatch2
= _hash[hash2Value];
157
if (
curMatch2
> matchMinPos)
158
if (_bufferBase[_bufferOffset +
curMatch2
] == _bufferBase[cur])
161
distances[offset++] = _pos -
curMatch2
- 1;
166
if (curMatch3 ==
curMatch2
)
170
curMatch2
= curMatch3;
172
if (offset != 0 &&
curMatch2
== curMatch)
/external/lzma/C/
LzFindMt.c
559
UInt32 hash2Value,
curMatch2
;
565
curMatch2
= hash[hash2Value];
568
if (
curMatch2
>= matchMinPos)
569
if (cur[(ptrdiff_t)
curMatch2
- lzPos] == cur[0])
572
*distances++ = lzPos -
curMatch2
- 1;
579
UInt32 hash2Value, hash3Value,
curMatch2
, curMatch3;
585
curMatch2
= hash[ hash2Value];
592
if (
curMatch2
>= matchMinPos && cur[(ptrdiff_t)
curMatch2
- lzPos] == cur[0])
594
distances[1] = lzPos -
curMatch2
- 1;
[
all
...]
Completed in 1247 milliseconds