Lines Matching full:price
181 UInt32 price; member
688 UInt32 price = 0; in LitEnc_GetPrice() local
692 price += GET_PRICEa(probs[symbol >> 8], (symbol >> 7) & 1); in LitEnc_GetPrice()
696 return price; in LitEnc_GetPrice()
701 UInt32 price = 0; in LitEnc_GetPriceMatched() local
707 price += GET_PRICEa(probs[offs + (matchByte & offs) + (symbol >> 8)], (symbol >> 7) & 1); in LitEnc_GetPriceMatched()
712 return price; in LitEnc_GetPriceMatched()
745 UInt32 price = 0; in RcTree_GetPrice() local
749 price += GET_PRICEa(probs[symbol >> 1], symbol & 1); in RcTree_GetPrice()
752 return price; in RcTree_GetPrice()
757 UInt32 price = 0; in RcTree_ReverseGetPrice() local
764 price += GET_PRICEa(probs[m], bit); in RcTree_ReverseGetPrice()
767 return price; in RcTree_ReverseGetPrice()
920 UInt32 price; in GetPureRepPrice() local
923 price = GET_PRICE_0(p->isRepG0[state]); in GetPureRepPrice()
924 price += GET_PRICE_1(p->isRep0Long[state][posState]); in GetPureRepPrice()
928 price = GET_PRICE_1(p->isRepG0[state]); in GetPureRepPrice()
930 price += GET_PRICE_0(p->isRepG1[state]); in GetPureRepPrice()
933 price += GET_PRICE_1(p->isRepG1[state]); in GetPureRepPrice()
934 price += GET_PRICE(p->isRepG2[state], repIndex - 2); in GetPureRepPrice()
937 return price; in GetPureRepPrice()
1073 p->opt[1].price = GET_PRICE_0(p->isMatch[p->state][posState]) + in GetOptimum()
1087 if (shortRepPrice < p->opt[1].price) in GetOptimum()
1089 p->opt[1].price = shortRepPrice; in GetOptimum()
1107 p->opt[len--].price = kInfinityPrice; in GetOptimum()
1113 UInt32 price; in GetOptimum() local
1116 price = repMatchPrice + GetPureRepPrice(p, i, p->state, posState); in GetOptimum()
1119 UInt32 curAndLenPrice = price + p->repLenEnc.prices[posState][repLen - 2]; in GetOptimum()
1121 if (curAndLenPrice < opt->price) in GetOptimum()
1123 opt->price = curAndLenPrice; in GetOptimum()
1156 if (curAndLenPrice < opt->price) in GetOptimum()
1158 opt->price = curAndLenPrice; in GetOptimum()
1180 printf("\nprice[%4X] = %u", position - cur + i, p->opt[i].price); in GetOptimum()
1278 curPrice = curOpt->price; in GetOptimum()
1297 if (curAnd1Price < nextOpt->price) in GetOptimum()
1299 nextOpt->price = curAnd1Price; in GetOptimum()
1311 if (shortRepPrice <= nextOpt->price) in GetOptimum()
1313 nextOpt->price = shortRepPrice; in GetOptimum()
1355 p->opt[++lenEnd].price = kInfinityPrice; in GetOptimum()
1358 if (curAndLenPrice < opt->price) in GetOptimum()
1360 opt->price = curAndLenPrice; in GetOptimum()
1377 UInt32 price; in GetOptimum() local
1383 p->opt[++lenEnd].price = kInfinityPrice; in GetOptimum()
1385 price = repMatchPrice + GetPureRepPrice(p, repIndex, state, posState); in GetOptimum()
1388 UInt32 curAndLenPrice = price + p->repLenEnc.prices[posState][lenTest - 2]; in GetOptimum()
1390 if (curAndLenPrice < opt->price) in GetOptimum()
1392 opt->price = curAndLenPrice; in GetOptimum()
1418 price + p->repLenEnc.prices[posState][lenTest - 2] + in GetOptimum()
1434 p->opt[++lenEnd].price = kInfinityPrice; in GetOptimum()
1437 if (curAndLenPrice < opt->price) in GetOptimum()
1439 opt->price = curAndLenPrice; in GetOptimum()
1466 p->opt[++lenEnd].price = kInfinityPrice; in GetOptimum()
1485 if (curAndLenPrice < opt->price) in GetOptimum()
1487 opt->price = curAndLenPrice; in GetOptimum()
1525 p->opt[++lenEnd].price = kInfinityPrice; in GetOptimum()
1528 if (curAndLenPrice2 < opt->price) in GetOptimum()
1530 opt->price = curAndLenPrice2; in GetOptimum()