Searched refs:bestp (Results 1 – 2 of 2) sorted by relevance
120 vpx_prob oldp, vpx_prob *bestp, in vp9_prob_diff_update_savings_search() argument125 const int step = *bestp > oldp ? -1 : 1; in vp9_prob_diff_update_savings_search()127 for (newp = *bestp; newp != oldp; newp += step) { in vp9_prob_diff_update_savings_search()136 *bestp = bestnewp; in vp9_prob_diff_update_savings_search()142 vpx_prob *bestp, in vp9_prob_diff_update_savings_search_model() argument157 if (*bestp > oldp[PIVOT_NODE]) { 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()177 for (newp = *bestp; newp < oldp[PIVOT_NODE]; newp += step) { in vp9_prob_diff_update_savings_search_model()195 *bestp = bestnewp; in vp9_prob_diff_update_savings_search_model()
30 vpx_prob oldp, vpx_prob *bestp,36 vpx_prob *bestp,