Searched refs:lenEnd (Results 1 – 6 of 6) sorted by relevance
| /external/lzma/Java/SevenZip/Compression/LZMA/ |
| D | Encoder.java | 625 int lenEnd = ((lenMain >= repLens[repMaxIndex]) ? lenMain : repLens[repMaxIndex]); in GetOptimum() local
627 if (lenEnd < 2) in GetOptimum()
640 int len = lenEnd; in GetOptimum()
700 if (cur == lenEnd) in GetOptimum()
862 while (lenEnd < offset) in GetOptimum()
863 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()
889 while (lenEnd < cur + lenTest) in GetOptimum()
890 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()
932 while (lenEnd < cur + offset) in GetOptimum()
933 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()
[all …]
|
| /external/lzma/CS/7zip/Compress/LZMA/ |
| D | LzmaEncoder.cs | 625 UInt32 lenEnd = ((lenMain >= repLens[repMaxIndex]) ? lenMain : repLens[repMaxIndex]); in GetOptimum()
627 if(lenEnd < 2) in GetOptimum()
640 UInt32 len = lenEnd; in GetOptimum()
700 if (cur == lenEnd) in GetOptimum()
862 while (lenEnd < offset) in GetOptimum()
863 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()
889 while (lenEnd < cur + lenTest) in GetOptimum()
890 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()
932 while(lenEnd < cur + offset) in GetOptimum()
933 _optimum[++lenEnd].Price = kIfinityPrice; in GetOptimum()
[all …]
|
| /external/chromium_org/third_party/lzma_sdk/ |
| D | LzmaEnc.c | 931 UInt32 numAvail, mainLen, numPairs, repMaxIndex, i, posState, lenEnd, len, cur; in GetOptimum() local
1033 lenEnd = ((mainLen >= repLens[repMaxIndex]) ? mainLen : repLens[repMaxIndex]); in GetOptimum()
1035 if (lenEnd < 2) in GetOptimum()
1045 len = lenEnd; in GetOptimum()
1119 for (i = cur; i <= lenEnd; i++) in GetOptimum()
1135 if (cur == lenEnd) in GetOptimum()
1291 while (lenEnd < offset) in GetOptimum()
1292 p->opt[++lenEnd].price = kInfinityPrice; in GetOptimum()
1319 while (lenEnd < cur + lenTest) in GetOptimum()
1320 p->opt[++lenEnd].price = kInfinityPrice; in GetOptimum()
[all …]
|
| /external/lzma/C/ |
| D | LzmaEnc.c | 931 UInt32 numAvail, mainLen, numPairs, repMaxIndex, i, posState, lenEnd, len, cur; in GetOptimum() local
1033 lenEnd = ((mainLen >= repLens[repMaxIndex]) ? mainLen : repLens[repMaxIndex]); in GetOptimum()
1035 if (lenEnd < 2) in GetOptimum()
1045 len = lenEnd; in GetOptimum()
1119 for (i = cur; i <= lenEnd; i++) in GetOptimum()
1135 if (cur == lenEnd) in GetOptimum()
1291 while (lenEnd < offset) in GetOptimum()
1292 p->opt[++lenEnd].price = kInfinityPrice; in GetOptimum()
1319 while (lenEnd < cur + lenTest) in GetOptimum()
1320 p->opt[++lenEnd].price = kInfinityPrice; in GetOptimum()
[all …]
|
| /external/chromium_org/third_party/ots/third_party/lzma_sdk/ |
| D | LzmaEnc.c | 932 UInt32 numAvail, mainLen, numPairs, repMaxIndex, i, posState, lenEnd, len, cur; in GetOptimum() local
1034 lenEnd = ((mainLen >= repLens[repMaxIndex]) ? mainLen : repLens[repMaxIndex]); in GetOptimum()
1036 if (lenEnd < 2) in GetOptimum()
1046 len = lenEnd; in GetOptimum()
1120 for (i = cur; i <= lenEnd; i++) in GetOptimum()
1136 if (cur == lenEnd) in GetOptimum()
1292 while (lenEnd < offset) in GetOptimum()
1293 p->opt[++lenEnd].price = kInfinityPrice; in GetOptimum()
1320 while (lenEnd < cur + lenTest) in GetOptimum()
1321 p->opt[++lenEnd].price = kInfinityPrice; in GetOptimum()
[all …]
|
| /external/chromium_org/third_party/brotli/src/ |
| D | ots-lzma.patch | 3836 + UInt32 numAvail, mainLen, numPairs, repMaxIndex, i, posState, lenEnd, len, cur;
3938 + lenEnd = ((mainLen >= repLens[repMaxIndex]) ? mainLen : repLens[repMaxIndex]);
3940 + if (lenEnd < 2)
3950 + len = lenEnd;
4024 + for (i = cur; i <= lenEnd; i++)
4040 + if (cur == lenEnd)
4196 + while (lenEnd < offset)
4197 + p->opt[++lenEnd].price = kInfinityPrice;
4224 + while (lenEnd < cur + lenTest)
4225 + p->opt[++lenEnd].price = kInfinityPrice;
[all …]
|