Lines Matching refs:curAndLenPrice
1079 UInt32 curAndLenPrice = price + p->repLenEnc.prices[posState][repLen - 2]; in GetOptimum() local
1081 if (curAndLenPrice < opt->price) in GetOptimum()
1083 opt->price = curAndLenPrice; in GetOptimum()
1105 … UInt32 curAndLenPrice = normalMatchPrice + p->lenEnc.prices[posState][len - LZMA_MATCH_LEN_MIN]; in GetOptimum() local
1108 curAndLenPrice += p->distancesPrices[lenToPosState][distance]; in GetOptimum()
1113 … curAndLenPrice += p->alignPrices[distance & kAlignMask] + p->posSlotPrices[lenToPosState][slot]; in GetOptimum()
1116 if (curAndLenPrice < opt->price) in GetOptimum()
1118 opt->price = curAndLenPrice; in GetOptimum()
1308 UInt32 curAndLenPrice; in GetOptimum() local
1313 curAndLenPrice = nextRepMatchPrice + GetRepPrice(p, 0, lenTest2, state2, posStateNext); in GetOptimum()
1315 if (curAndLenPrice < opt->price) in GetOptimum()
1317 opt->price = curAndLenPrice; in GetOptimum()
1345 UInt32 curAndLenPrice = price + p->repLenEnc.prices[posState][lenTest - 2]; in GetOptimum() local
1347 if (curAndLenPrice < opt->price) in GetOptimum()
1349 opt->price = curAndLenPrice; in GetOptimum()
1387 UInt32 curAndLenPrice; in GetOptimum() local
1392 … curAndLenPrice = nextRepMatchPrice + GetRepPrice(p, 0, lenTest2, state2, posStateNext); in GetOptimum()
1394 if (curAndLenPrice < opt->price) in GetOptimum()
1396 opt->price = curAndLenPrice; in GetOptimum()
1432 …UInt32 curAndLenPrice = normalMatchPrice + p->lenEnc.prices[posState][lenTest - LZMA_MATCH_LEN_MIN… in GetOptimum() local
1436 curAndLenPrice += p->distancesPrices[lenToPosState][curBack]; in GetOptimum()
1438 … curAndLenPrice += p->posSlotPrices[lenToPosState][posSlot] + p->alignPrices[curBack & kAlignMask]; in GetOptimum()
1441 if (curAndLenPrice < opt->price) in GetOptimum()
1443 opt->price = curAndLenPrice; in GetOptimum()
1464 UInt32 curAndLenCharPrice = curAndLenPrice + in GetOptimum()
1477 UInt32 curAndLenPrice; in GetOptimum() local
1481 … curAndLenPrice = nextRepMatchPrice + GetRepPrice(p, 0, lenTest2, state2, posStateNext); in GetOptimum()
1483 if (curAndLenPrice < opt->price) in GetOptimum()
1485 opt->price = curAndLenPrice; in GetOptimum()