Searched refs:bestp (Results 1 – 2 of 2) sorted by relevance
120 vp9_prob oldp, vp9_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 vp9_prob *bestp, in vp9_prob_diff_update_savings_search_model() argument156 step = (*bestp > oldp[PIVOT_NODE] ? -1 : 1); in vp9_prob_diff_update_savings_search_model()158 for (newp = *bestp; newp != oldp[PIVOT_NODE]; newp += step) { in vp9_prob_diff_update_savings_search_model()174 *bestp = bestnewp; in vp9_prob_diff_update_savings_search_model()
26 vp9_prob oldp, vp9_prob *bestp,32 vp9_prob *bestp,