| /external/webp/src/dsp/ |
| cost_mips_dsp_r2.c | 29 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0;
38 return VP8BitCost(0, p0);
88 cost += VP8BitCost(0, last_p0);
|
| cost.c | 331 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0;
334 return VP8BitCost(0, p0);
351 cost += VP8BitCost(0, last_p0);
|
| cost_mips32.c | 29 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0;
38 return VP8BitCost(0, p0);
93 cost += VP8BitCost(0, last_p0);
|
| cost_sse2.c | 56 int cost = (ctx0 == 0) ? VP8BitCost(1, p0) : 0;
59 return VP8BitCost(0, p0);
99 cost += VP8BitCost(0, last_p0);
|
| /external/opencv3/3rdparty/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 | 45 static WEBP_INLINE int VP8BitCost(int bit, uint8_t proba) {
|
| frame.c | 119 size += nb_events * VP8BitCost(1, proba->skip_proba_)
120 + (nb_mbs - nb_events) * VP8BitCost(0, proba->skip_proba_);
135 return nb * VP8BitCost(1, proba) + (total - nb) * VP8BitCost(0, proba);
158 + VP8BitCost(0, update_proba);
160 + VP8BitCost(1, update_proba)
163 size += VP8BitCost(use_new_p, update_proba);
210 p[0] * (VP8BitCost(0, probas[0]) + VP8BitCost(0, probas[1])) +
211 p[1] * (VP8BitCost(0, probas[0]) + VP8BitCost(1, probas[1]))
[all...] |
| cost.c | 49 cost += VP8BitCost(bits & 1, probas[i]);
71 const int cost0 = (ctx > 0) ? VP8BitCost(1, p[0]) : 0;
72 const int cost_base = VP8BitCost(1, p[1]) + cost0;
74 table[0] = VP8BitCost(0, p[1]) + cost0;
96 // by calling VP8BitCost().
98 // note: these values include the fixed VP8BitCost(1, 145) mode selection cost.
|
| token.c | 263 size += VP8BitCost(bit, token & 0xffu);
265 size += VP8BitCost(bit, probas[token & 0x3fffu]);
|
| quant.c | 607 cost = VP8BitCost(0, last_proba);
612 const score_t rate = (ctx0 == 0) ? VP8BitCost(1, last_proba) : 0;
656 (n < 15) ? VP8BitCost(0, probas[band][ctx][0]) : 0;
[all...] |
