156   UInt32 price;  member
648   UInt32 price = 0;  in LitEnc_GetPrice()  local
652     price += GET_PRICEa(probs[symbol >> 8], (symbol >> 7) & 1);  in LitEnc_GetPrice()
656   return price;  in LitEnc_GetPrice()
661   UInt32 price = 0;  in LitEnc_GetPriceMatched()  local
667     price += GET_PRICEa(probs[offs + (matchByte & offs) + (symbol >> 8)], (symbol >> 7) & 1);  in LitEnc_GetPriceMatched()
672   return price;  in LitEnc_GetPriceMatched()
705   UInt32 price = 0;  in RcTree_GetPrice()  local
709     price += GET_PRICEa(probs[symbol >> 1], symbol & 1);  in RcTree_GetPrice()
712   return price;  in RcTree_GetPrice()
717   UInt32 price = 0;  in RcTree_ReverseGetPrice()  local
724     price += GET_PRICEa(probs[m], bit);  in RcTree_ReverseGetPrice()
727   return price;  in RcTree_ReverseGetPrice()
878   UInt32 price;  in GetPureRepPrice()  local
881     price = GET_PRICE_0(p->isRepG0[state]);  in GetPureRepPrice()
882     price += GET_PRICE_1(p->isRep0Long[state][posState]);  in GetPureRepPrice()
886     price = GET_PRICE_1(p->isRepG0[state]);  in GetPureRepPrice()
888       price += GET_PRICE_0(p->isRepG1[state]);  in GetPureRepPrice()
891       price += GET_PRICE_1(p->isRepG1[state]);  in GetPureRepPrice()
892       price += GET_PRICE(p->isRepG2[state], repIndex - 2);  in GetPureRepPrice()
895   return price;  in GetPureRepPrice()
1026     p->opt[1].price = GET_PRICE_0(p->isMatch[p->state][posState]) +  in GetOptimum()
1040     if (shortRepPrice < p->opt[1].price)  in GetOptimum()
1042       p->opt[1].price = shortRepPrice;  in GetOptimum()
1060     p->opt[len--].price = kInfinityPrice;  in GetOptimum()
1066     UInt32 price;  in GetOptimum()  local
1069     price = repMatchPrice + GetPureRepPrice(p, i, p->state, posState);  in GetOptimum()
1072       UInt32 curAndLenPrice = price + p->repLenEnc.prices[posState][repLen - 2];  in GetOptimum()
1074       if (curAndLenPrice < opt->price)  in GetOptimum()
1076         opt->price = curAndLenPrice;  in GetOptimum()
1109       if (curAndLenPrice < opt->price)  in GetOptimum()
1111         opt->price = curAndLenPrice;  in GetOptimum()
1133       printf("\nprice[%4X] = %d", position - cur + i, p->opt[i].price);  in GetOptimum()
1228     curPrice = curOpt->price;  in GetOptimum()
1247     if (curAnd1Price < nextOpt->price)  in GetOptimum()
1249       nextOpt->price = curAnd1Price;  in GetOptimum()
1261       if (shortRepPrice <= nextOpt->price)  in GetOptimum()
1263         nextOpt->price = shortRepPrice;  in GetOptimum()
1305             p->opt[++lenEnd].price = kInfinityPrice;  in GetOptimum()
1308           if (curAndLenPrice < opt->price)  in GetOptimum()
1310             opt->price = curAndLenPrice;  in GetOptimum()
1327       UInt32 price;  in GetOptimum()  local
1333         p->opt[++lenEnd].price = kInfinityPrice;  in GetOptimum()
1335       price = repMatchPrice + GetPureRepPrice(p, repIndex, state, posState);  in GetOptimum()
1338         UInt32 curAndLenPrice = price + p->repLenEnc.prices[posState][lenTest - 2];  in GetOptimum()
1340         if (curAndLenPrice < opt->price)  in GetOptimum()
1342           opt->price = curAndLenPrice;  in GetOptimum()
1368                 price + p->repLenEnc.prices[posState][lenTest - 2] +  in GetOptimum()
1384                 p->opt[++lenEnd].price = kInfinityPrice;  in GetOptimum()
1387               if (curAndLenPrice < opt->price)  in GetOptimum()
1389                 opt->price = curAndLenPrice;  in GetOptimum()
1416         p->opt[++lenEnd].price = kInfinityPrice;  in GetOptimum()
1434         if (curAndLenPrice < opt->price)  in GetOptimum()
1436           opt->price = curAndLenPrice;  in GetOptimum()
1473                 p->opt[++lenEnd].price = kInfinityPrice;  in GetOptimum()
1476               if (curAndLenPrice < opt->price)  in GetOptimum()
1478                 opt->price = curAndLenPrice;  in GetOptimum()