Searched refs:old_b (Results 1 – 2 of 2) sorted by relevance
| /external/libvpx/libvpx/vp9/encoder/ |
| D | vp9_subexp.c | 118 const int old_b = cost_branch256(ct, oldp); in vp9_prob_diff_update_savings_search() local
124 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search()
128 const int savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search()
143 int i, old_b, new_b, update_b, savings, bestsavings; in vp9_prob_diff_update_savings_search_model() local
151 old_b = cost_branch256(ct + 2 * PIVOT_NODE, oldp); in vp9_prob_diff_update_savings_search_model()
153 old_b += cost_branch256(ct + 2 * i, oldplist[i - UNCONSTRAINED_NODES]); in vp9_prob_diff_update_savings_search_model()
160 if (old_b > upd_cost + (MIN_DELP_BITS << VP9_PROB_COST_SHIFT)) { in vp9_prob_diff_update_savings_search_model()
168 savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search_model()
|
| /external/libvpx/libvpx/vp8/encoder/ |
| D | bitstream.c | 53 unsigned int new_b = 0, old_b = 0; in update_mode() local
61 old_b += vp8_cost_branch(bct[i], Pcur[i]); in update_mode()
64 if (new_b + (n << 8) < old_b) { in update_mode()
670 const int old_b = vp8_cost_branch(ct, oldp); in prob_update_savings() local
674 return old_b - new_b - update_b; in prob_update_savings()
|