Searched refs:old_b (Results 1 – 2 of 2) sorted by relevance
| /external/libvpx/libvpx/vp9/encoder/ |
| D | vp9_subexp.c | 122 const int old_b = cost_branch256(ct, oldp); in vp9_prob_diff_update_savings_search() local
130 const int savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search()
144 int i, old_b, new_b, update_b, savings, bestsavings, step; in vp9_prob_diff_update_savings_search_model() local
149 for (i = UNCONSTRAINED_NODES, old_b = 0; i < ENTROPY_NODES; ++i) in vp9_prob_diff_update_savings_search_model()
150 old_b += cost_branch256(ct + 2 * i, oldplist[i]); in vp9_prob_diff_update_savings_search_model()
151 old_b += cost_branch256(ct + 2 * PIVOT_NODE, oldplist[PIVOT_NODE]); 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 | 74 unsigned int new_b = 0, old_b = 0; in update_mode() local
86 old_b += vp8_cost_branch(bct[i], Pcur[i]); in update_mode()
90 if (new_b + (n << 8) < old_b) in update_mode()
843 const int old_b = vp8_cost_branch(ct, oldp); in prob_update_savings() local
848 return old_b - new_b - update_b; in prob_update_savings()
|