143   UInt32 price;  member
658   UInt32 price = 0;  in LitEnc_GetPrice()  local
662     price += GET_PRICEa(probs[symbol >> 8], (symbol >> 7) & 1);  in LitEnc_GetPrice()
666   return price;  in LitEnc_GetPrice()
671   UInt32 price = 0;  in LitEnc_GetPriceMatched()  local
677     price += GET_PRICEa(probs[offs + (matchByte & offs) + (symbol >> 8)], (symbol >> 7) & 1);  in LitEnc_GetPriceMatched()
682   return price;  in LitEnc_GetPriceMatched()
715   UInt32 price = 0;  in RcTree_GetPrice()  local
719     price += GET_PRICEa(probs[symbol >> 1], symbol & 1);  in RcTree_GetPrice()
722   return price;  in RcTree_GetPrice()
727   UInt32 price = 0;  in RcTree_ReverseGetPrice()  local
734     price += GET_PRICEa(probs[m], bit);  in RcTree_ReverseGetPrice()
737   return price;  in RcTree_ReverseGetPrice()
885   UInt32 price;  in GetPureRepPrice()  local
888     price = GET_PRICE_0(p->isRepG0[state]);  in GetPureRepPrice()
889     price += GET_PRICE_1(p->isRep0Long[state][posState]);  in GetPureRepPrice()
893     price = GET_PRICE_1(p->isRepG0[state]);  in GetPureRepPrice()
895       price += GET_PRICE_0(p->isRepG1[state]);  in GetPureRepPrice()
898       price += GET_PRICE_1(p->isRepG1[state]);  in GetPureRepPrice()
899       price += GET_PRICE(p->isRepG2[state], repIndex - 2);  in GetPureRepPrice()
902   return price;  in GetPureRepPrice()
1033     p->opt[1].price = GET_PRICE_0(p->isMatch[p->state][posState]) +  in GetOptimum()
1047     if (shortRepPrice < p->opt[1].price)  in GetOptimum()
1049       p->opt[1].price = shortRepPrice;  in GetOptimum()
1067     p->opt[len--].price = kInfinityPrice;  in GetOptimum()
1073     UInt32 price;  in GetOptimum()  local
1076     price = repMatchPrice + GetPureRepPrice(p, i, p->state, posState);  in GetOptimum()
1079       UInt32 curAndLenPrice = price + p->repLenEnc.prices[posState][repLen - 2];  in GetOptimum()
1081       if (curAndLenPrice < opt->price)  in GetOptimum()
1083         opt->price = curAndLenPrice;  in GetOptimum()
1116       if (curAndLenPrice < opt->price)  in GetOptimum()
1118         opt->price = curAndLenPrice;  in GetOptimum()
1140       printf("\nprice[%4X] = %d", position - cur + i, p->opt[i].price);  in GetOptimum()
1235     curPrice = curOpt->price;  in GetOptimum()
1254     if (curAnd1Price < nextOpt->price)  in GetOptimum()
1256       nextOpt->price = curAnd1Price;  in GetOptimum()
1268       if (shortRepPrice <= nextOpt->price)  in GetOptimum()
1270         nextOpt->price = shortRepPrice;  in GetOptimum()
1312             p->opt[++lenEnd].price = kInfinityPrice;  in GetOptimum()
1315           if (curAndLenPrice < opt->price)  in GetOptimum()
1317             opt->price = curAndLenPrice;  in GetOptimum()
1334       UInt32 price;  in GetOptimum()  local
1340         p->opt[++lenEnd].price = kInfinityPrice;  in GetOptimum()
1342       price = repMatchPrice + GetPureRepPrice(p, repIndex, state, posState);  in GetOptimum()
1345         UInt32 curAndLenPrice = price + p->repLenEnc.prices[posState][lenTest - 2];  in GetOptimum()
1347         if (curAndLenPrice < opt->price)  in GetOptimum()
1349           opt->price = curAndLenPrice;  in GetOptimum()
1375                 price + p->repLenEnc.prices[posState][lenTest - 2] +  in GetOptimum()
1391                 p->opt[++lenEnd].price = kInfinityPrice;  in GetOptimum()
1394               if (curAndLenPrice < opt->price)  in GetOptimum()
1396                 opt->price = curAndLenPrice;  in GetOptimum()
1423         p->opt[++lenEnd].price = kInfinityPrice;  in GetOptimum()
1441         if (curAndLenPrice < opt->price)  in GetOptimum()
1443           opt->price = curAndLenPrice;  in GetOptimum()
1480                 p->opt[++lenEnd].price = kInfinityPrice;  in GetOptimum()
1483               if (curAndLenPrice < opt->price)  in GetOptimum()
1485                 opt->price = curAndLenPrice;  in GetOptimum()