Searched refs:bestp (Results 1 – 2 of 2) sorted by relevance
121 vp9_prob oldp, vp9_prob *bestp, in vp9_prob_diff_update_savings_search() argument126 const int step = *bestp > oldp ? -1 : 1; in vp9_prob_diff_update_savings_search()128 for (newp = *bestp; newp != oldp; newp += step) { in vp9_prob_diff_update_savings_search()137 *bestp = bestnewp; in vp9_prob_diff_update_savings_search()143 vp9_prob *bestp, in vp9_prob_diff_update_savings_search_model() argument157 step = (*bestp > oldp[PIVOT_NODE] ? -1 : 1); in vp9_prob_diff_update_savings_search_model()159 for (newp = *bestp; newp != oldp[PIVOT_NODE]; newp += step) { in vp9_prob_diff_update_savings_search_model()175 *bestp = bestnewp; in vp9_prob_diff_update_savings_search_model()
29 vp9_prob oldp, vp9_prob *bestp,35 vp9_prob *bestp,