Searched refs:old_b (Results 1 – 3 of 3) 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()
145 int i, old_b, new_b, update_b, savings, bestsavings, step; in vp9_prob_diff_update_savings_search_model() local
150 for (i = UNCONSTRAINED_NODES, old_b = 0; i < ENTROPY_NODES; ++i) in vp9_prob_diff_update_savings_search_model()
151 old_b += cost_branch256(ct + 2 * i, oldplist[i]); in vp9_prob_diff_update_savings_search_model()
152 old_b += cost_branch256(ct + 2 * PIVOT_NODE, oldplist[PIVOT_NODE]); in vp9_prob_diff_update_savings_search_model()
169 savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search_model()
187 savings = old_b - new_b - update_b; in vp9_prob_diff_update_savings_search_model()
|
| /external/c-ares/ |
| D | ares_llist.c | 70 struct list_node old_b = *head_b; in ares__swap_lists() local
82 *head_a = old_b; in ares__swap_lists()
83 old_b.next->prev = head_a; in ares__swap_lists()
84 old_b.prev->next = head_a; in ares__swap_lists()
|
| /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()
845 const int old_b = vp8_cost_branch(ct, oldp); in prob_update_savings() local
850 return old_b - new_b - update_b; in prob_update_savings()
|