988     UInt32 lenTest;  in GetOptimum()  local
997     for (lenTest = 2; lenTest < numAvail && data[lenTest] == data2[lenTest]; lenTest++);  in GetOptimum()
998     repLens[i] = lenTest;  in GetOptimum()
999     if (lenTest > repLens[repMaxIndex])  in GetOptimum()
1332       UInt32 lenTest;  in GetOptimum()  local
1338       for (lenTest = 2; lenTest < numAvail && data[lenTest] == data2[lenTest]; lenTest++);  in GetOptimum()
1339       while (lenEnd < cur + lenTest)  in GetOptimum()
1341       lenTestTemp = lenTest;  in GetOptimum()
1345         UInt32 curAndLenPrice = price + p->repLenEnc.prices[posState][lenTest - 2];  in GetOptimum()
1346         COptimal *opt = &p->opt[cur + lenTest];  in GetOptimum()
1355       while (--lenTest >= 2);  in GetOptimum()
1356       lenTest = lenTestTemp;  in GetOptimum()
1359         startLen = lenTest + 1;  in GetOptimum()
1363           UInt32 lenTest2 = lenTest + 1;  in GetOptimum()
1369           lenTest2 -= lenTest + 1;  in GetOptimum()
1373             UInt32 posStateNext = (position + lenTest) & p->pbMask;  in GetOptimum()
1375                 price + p->repLenEnc.prices[posState][lenTest - 2] +  in GetOptimum()
1377                 LitEnc_GetPriceMatched(LIT_PROBS(position + lenTest, data[lenTest - 1]),  in GetOptimum()
1378                     data[lenTest], data2[lenTest], p->ProbPrices);  in GetOptimum()
1380             posStateNext = (position + lenTest + 1) & p->pbMask;  in GetOptimum()
1389               UInt32 offset = cur + lenTest + 1 + lenTest2;  in GetOptimum()
1397                 opt->posPrev = cur + lenTest + 1;  in GetOptimum()
1421       UInt32 lenTest;  in GetOptimum()  local
1430       for (lenTest = /*2*/ startLen; ; lenTest++)  in GetOptimum()
1432 …UInt32 curAndLenPrice = normalMatchPrice + p->lenEnc.prices[posState][lenTest - LZMA_MATCH_LEN_MIN…  in GetOptimum()
1433         UInt32 lenToPosState = GetLenToPosState(lenTest);  in GetOptimum()
1440         opt = &p->opt[cur + lenTest];  in GetOptimum()
1449         if (/*_maxMode && */lenTest == matches[offs])  in GetOptimum()
1453           UInt32 lenTest2 = lenTest + 1;  in GetOptimum()
1459           lenTest2 -= lenTest + 1;  in GetOptimum()
1463             UInt32 posStateNext = (position + lenTest) & p->pbMask;  in GetOptimum()
1466                 LitEnc_GetPriceMatched(LIT_PROBS(position + lenTest, data[lenTest - 1]),  in GetOptimum()
1467                     data[lenTest], data2[lenTest], p->ProbPrices);  in GetOptimum()
1476               UInt32 offset = cur + lenTest + 1 + lenTest2;  in GetOptimum()
1486                 opt->posPrev = cur + lenTest + 1;  in GetOptimum()