Home
last modified time | relevance | path

Searched refs:mainLen (Results 1 – 3 of 3) sorted by relevance

/external/lzma/Java/Tukaani/src/org/tukaani/xz/lzma/
DLZMAEncoderFast.java84 int mainLen = 0; in getNextSymbol() local
88 mainLen = matches.len[matches.count - 1]; in getNextSymbol()
91 if (mainLen >= niceLen) { in getNextSymbol()
93 skip(mainLen - 1); in getNextSymbol()
94 return mainLen; in getNextSymbol()
98 && mainLen == matches.len[matches.count - 2] + 1) { in getNextSymbol()
103 mainLen = matches.len[matches.count - 1]; in getNextSymbol()
107 if (mainLen == MATCH_LEN_MIN && mainDist >= 0x80) in getNextSymbol()
108 mainLen = 1; in getNextSymbol()
112 if (bestRepLen + 1 >= mainLen in getNextSymbol()
[all …]
DLZMAEncoderNormal.java148 int mainLen = 0; in getNextSymbol() local
151 mainLen = matches.len[matches.count - 1]; in getNextSymbol()
155 if (mainLen >= niceLen) { in getNextSymbol()
157 skip(mainLen - 1); in getNextSymbol()
158 return mainLen; in getNextSymbol()
168 if (mainLen < MATCH_LEN_MIN && curByte != matchByte in getNextSymbol()
198 optEnd = Math.max(mainLen, repLens[repBest]); in getNextSymbol()
240 if (len <= mainLen) { in getNextSymbol()
/external/lzma/C/
DLzmaEnc.c944 UInt32 numAvail, mainLen, numPairs, repMaxIndex, i, posState, lenEnd, len, cur; in GetOptimum() local
961 mainLen = ReadMatchDistances(p, &numPairs); in GetOptimum()
964 mainLen = p->longestMatchLength; in GetOptimum()
1005 if (mainLen >= p->numFastBytes) in GetOptimum()
1008 MovePos(p, mainLen - 1); in GetOptimum()
1009 return mainLen; in GetOptimum()
1014 if (mainLen < 2 && curByte != matchByte && repLens[repMaxIndex] < 2) in GetOptimum()
1046 lenEnd = ((mainLen >= repLens[repMaxIndex]) ? mainLen : repLens[repMaxIndex]); in GetOptimum()
1088 if (len <= mainLen) in GetOptimum()
1504 UInt32 numAvail, mainLen, mainDist, numPairs, repIndex, repLen, i; in GetOptimumFast() local
[all …]