Searched refs:lenTest2 (Results 1 – 6 of 6) sorted by relevance
| /external/chromium_org/third_party/lzma_sdk/ |
| D | LzmaEnc.c | 1271 UInt32 lenTest2; in GetOptimum() local
1278 lenTest2 = temp - 1; in GetOptimum()
1279 if (lenTest2 >= 2) in GetOptimum()
1290 UInt32 offset = cur + 1 + lenTest2; in GetOptimum()
1293 curAndLenPrice = nextRepMatchPrice + GetRepPrice(p, 0, lenTest2, state2, posStateNext); in GetOptimum()
1343 UInt32 lenTest2 = lenTest + 1; in GetOptimum() local
1344 UInt32 limit = lenTest2 + p->numFastBytes; in GetOptimum()
1348 for (; lenTest2 < limit && data[lenTest2] == data2[lenTest2]; lenTest2++); in GetOptimum()
1349 lenTest2 -= lenTest + 1; in GetOptimum()
1350 if (lenTest2 >= 2) in GetOptimum()
[all …]
|
| /external/lzma/C/ |
| D | LzmaEnc.c | 1271 UInt32 lenTest2; in GetOptimum() local
1278 lenTest2 = temp - 1; in GetOptimum()
1279 if (lenTest2 >= 2) in GetOptimum()
1290 UInt32 offset = cur + 1 + lenTest2; in GetOptimum()
1293 curAndLenPrice = nextRepMatchPrice + GetRepPrice(p, 0, lenTest2, state2, posStateNext); in GetOptimum()
1343 UInt32 lenTest2 = lenTest + 1; in GetOptimum() local
1344 UInt32 limit = lenTest2 + p->numFastBytes; in GetOptimum()
1348 for (; lenTest2 < limit && data[lenTest2] == data2[lenTest2]; lenTest2++); in GetOptimum()
1349 lenTest2 -= lenTest + 1; in GetOptimum()
1350 if (lenTest2 >= 2) in GetOptimum()
[all …]
|
| /external/chromium_org/third_party/ots/third_party/lzma_sdk/ |
| D | LzmaEnc.c | 1272 UInt32 lenTest2; in GetOptimum() local
1279 lenTest2 = temp - 1; in GetOptimum()
1280 if (lenTest2 >= 2) in GetOptimum()
1291 UInt32 offset = cur + 1 + lenTest2; in GetOptimum()
1294 curAndLenPrice = nextRepMatchPrice + GetRepPrice(p, 0, lenTest2, state2, posStateNext); in GetOptimum()
1344 UInt32 lenTest2 = lenTest + 1; in GetOptimum() local
1345 UInt32 limit = lenTest2 + p->numFastBytes; in GetOptimum()
1349 for (; lenTest2 < limit && data[lenTest2] == data2[lenTest2]; lenTest2++); in GetOptimum()
1350 lenTest2 -= lenTest + 1; in GetOptimum()
1351 if (lenTest2 >= 2) in GetOptimum()
[all …]
|
| /external/lzma/Java/SevenZip/Compression/LZMA/ |
| D | Encoder.java | 851 int lenTest2 = _matchFinder.GetMatchLen(0, reps[0], t); in GetOptimum() local
852 if (lenTest2 >= 2) in GetOptimum()
861 int offset = cur + 1 + lenTest2; in GetOptimum()
865 0, lenTest2, state2, posStateNext); in GetOptimum()
911 int lenTest2 = _matchFinder.GetMatchLen(lenTest, reps[repIndex], t); in GetOptimum() local
912 if (lenTest2 >= 2) in GetOptimum()
931 int offset = lenTest + 1 + lenTest2; in GetOptimum()
934 int curAndLenPrice = nextRepMatchPrice + GetRepPrice(0, lenTest2, state2, posStateNext); in GetOptimum()
986 int lenTest2 = _matchFinder.GetMatchLen(lenTest, curBack, t); in GetOptimum() local
987 if (lenTest2 >= 2) in GetOptimum()
[all …]
|
| /external/lzma/CS/7zip/Compress/LZMA/ |
| D | LzmaEncoder.cs | 851 UInt32 lenTest2 = _matchFinder.GetMatchLen(0, reps[0], t); in GetOptimum()
852 if (lenTest2 >= 2) in GetOptimum()
861 UInt32 offset = cur + 1 + lenTest2; in GetOptimum()
865 0, lenTest2, state2, posStateNext); in GetOptimum()
911 UInt32 lenTest2 = _matchFinder.GetMatchLen((Int32)lenTest, reps[repIndex], t); in GetOptimum()
912 if (lenTest2 >= 2) in GetOptimum()
931 UInt32 offset = lenTest + 1 + lenTest2; in GetOptimum()
934 UInt32 curAndLenPrice = nextRepMatchPrice + GetRepPrice(0, lenTest2, state2, posStateNext); in GetOptimum()
986 UInt32 lenTest2 = _matchFinder.GetMatchLen((Int32)lenTest, curBack, t); in GetOptimum()
987 if (lenTest2 >= 2) in GetOptimum()
[all …]
|
| /external/chromium_org/third_party/brotli/src/ |
| D | ots-lzma.patch | 4176 + UInt32 lenTest2;
4183 + lenTest2 = temp - 1;
4184 + if (lenTest2 >= 2)
4191 + /* for (; lenTest2 >= 2; lenTest2--) */
4195 + UInt32 offset = cur + 1 + lenTest2;
4198 + curAndLenPrice = nextRepMatchPrice + GetRepPrice(p, 0, lenTest2, state2, posStateNext);
4248 + UInt32 lenTest2 = lenTest + 1;
4249 + UInt32 limit = lenTest2 + p->numFastBytes;
4253 + for (; lenTest2 < limit && data[lenTest2] == data2[lenTest2]; lenTest2++);
4254 + lenTest2 -= lenTest + 1;
[all …]
|