Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:VP8BitCost (Results 1 - 8 of 8) sorted by null

/external/chromium_org/third_party/libwebp/enc/
cost.h	28 static WEBP_INLINE int VP8BitCost(int bit, uint8_t proba) {
frame.c	84 size += nb_events * VP8BitCost(1, proba->skip_proba_) 85 + (nb_mbs - nb_events) * VP8BitCost(0, proba->skip_proba_); 177 return nb * VP8BitCost(1, proba) + (total - nb) * VP8BitCost(0, proba); 195 + VP8BitCost(0, update_proba); 197 + VP8BitCost(1, update_proba) 200 size += VP8BitCost(use_new_p, update_proba); 247 p[0] * (VP8BitCost(0, probas[0]) + VP8BitCost(0, probas[1])) + 248 p[1] * (VP8BitCost(0, probas[0]) + VP8BitCost(1, probas[1]))     [all...]
cost.c	346 cost += VP8BitCost(bits & 1, probas[i]); 367 const int cost_base = VP8BitCost(1, p[1]); 369 table[0] = VP8BitCost(0, p[1]); 385 // by calling VP8BitCost(). 387 // note: these values include the fixed VP8BitCost(1, 145) mode selection cost.
quant.c	521 cost = VP8BitCost(0, last_proba); 588 cost += VP8BitCost(1, last_proba); 601 if (n < 15) cost += VP8BitCost(0, last_proba); 836 rd_best.score = 211; // '211' is the value of VP8BitCost(0, 145)     [all...]
/external/webp/src/enc/
cost.h	28 static WEBP_INLINE int VP8BitCost(int bit, uint8_t proba) {
frame.c	84 size += nb_events * VP8BitCost(1, proba->skip_proba_) 85 + (nb_mbs - nb_events) * VP8BitCost(0, proba->skip_proba_); 177 return nb * VP8BitCost(1, proba) + (total - nb) * VP8BitCost(0, proba); 195 + VP8BitCost(0, update_proba); 197 + VP8BitCost(1, update_proba) 200 size += VP8BitCost(use_new_p, update_proba); 247 p[0] * (VP8BitCost(0, probas[0]) + VP8BitCost(0, probas[1])) + 248 p[1] * (VP8BitCost(0, probas[0]) + VP8BitCost(1, probas[1]))     [all...]
cost.c	346 cost += VP8BitCost(bits & 1, probas[i]); 367 const int cost_base = VP8BitCost(1, p[1]); 369 table[0] = VP8BitCost(0, p[1]); 385 // by calling VP8BitCost(). 387 // note: these values include the fixed VP8BitCost(1, 145) mode selection cost.
quant.c	521 cost = VP8BitCost(0, last_proba); 588 cost += VP8BitCost(1, last_proba); 601 if (n < 15) cost += VP8BitCost(0, last_proba); 836 rd_best.score = 211; // '211' is the value of VP8BitCost(0, 145)     [all...]

Completed in 1251 milliseconds