Lines Matching refs:oldp

79 static int prob_diff_update_cost(vpx_prob newp, vpx_prob oldp) {  in prob_diff_update_cost()  argument
80 int delp = remap_prob(newp, oldp); in prob_diff_update_cost()
112 void vp9_write_prob_diff_update(vpx_writer *w, vpx_prob newp, vpx_prob oldp) { in vp9_write_prob_diff_update() argument
113 const int delp = remap_prob(newp, oldp); in vp9_write_prob_diff_update()
117 int vp9_prob_diff_update_savings_search(const unsigned int *ct, vpx_prob oldp, in vp9_prob_diff_update_savings_search() argument
119 const int old_b = cost_branch256(ct, oldp); in vp9_prob_diff_update_savings_search()
121 vpx_prob newp, bestnewp = oldp; in vp9_prob_diff_update_savings_search()
122 const int step = *bestp > oldp ? -1 : 1; in vp9_prob_diff_update_savings_search()
126 for (newp = *bestp; newp != oldp; newp += step) { in vp9_prob_diff_update_savings_search()
128 const int update_b = prob_diff_update_cost(newp, oldp) + upd_cost; in vp9_prob_diff_update_savings_search()
141 const vpx_prob oldp, in vp9_prob_diff_update_savings_search_model() argument
146 const int step_sign = *bestp > oldp ? -1 : 1; in vp9_prob_diff_update_savings_search_model()
151 oldplist = vp9_pareto8_full[oldp - 1]; in vp9_prob_diff_update_savings_search_model()
152 old_b = cost_branch256(ct + 2 * PIVOT_NODE, oldp); in vp9_prob_diff_update_savings_search_model()
157 bestnewp = oldp; in vp9_prob_diff_update_savings_search_model()
162 for (newp = *bestp; (newp - oldp) * step_sign < 0; newp += step) { in vp9_prob_diff_update_savings_search_model()
168 update_b = prob_diff_update_cost(newp, oldp) + upd_cost; in vp9_prob_diff_update_savings_search_model()
181 void vp9_cond_prob_diff_update(vpx_writer *w, vpx_prob *oldp, in vp9_cond_prob_diff_update() argument
186 vp9_prob_diff_update_savings_search(ct, *oldp, &newp, upd); in vp9_cond_prob_diff_update()
190 vp9_write_prob_diff_update(w, newp, *oldp); in vp9_cond_prob_diff_update()
191 *oldp = newp; in vp9_cond_prob_diff_update()