Lines Matching refs:newp
110 static int prob_diff_update_cost(vp9_prob newp, vp9_prob oldp) {
111 int delp = remap_prob(newp, oldp);
152 void vp9_write_prob_diff_update(vp9_writer *w, vp9_prob newp, vp9_prob oldp) {
153 const int delp = remap_prob(newp, oldp);
168 vp9_prob newp, bestnewp = oldp;
171 for (newp = *bestp; newp != oldp; newp += step) {
172 const int new_b = cost_branch256(ct, newp);
173 const int update_b = prob_diff_update_cost(newp, oldp) + vp9_cost_upd256;
177 bestnewp = newp;
190 int newp;
203 for (newp = *bestp; newp != oldp[PIVOT_NODE]; newp += step) {
204 if (newp < 1 || newp > 255)
206 newplist[PIVOT_NODE] = newp;
211 update_b = prob_diff_update_cost(newp, oldp[PIVOT_NODE]) +
216 bestnewp = newp;
226 vp9_prob newp = get_binary_prob(ct[0], ct[1]);
227 const int savings = vp9_prob_diff_update_savings_search(ct, *oldp, &newp,
229 assert(newp >= 1);
232 vp9_write_prob_diff_update(w, newp, *oldp);
233 *oldp = newp;