Lines Matching refs:newp
76 static int prob_diff_update_cost(vp9_prob newp, vp9_prob oldp) {
77 int delp = remap_prob(newp, oldp);
109 void vp9_write_prob_diff_update(vp9_writer *w, vp9_prob newp, vp9_prob oldp) {
110 const int delp = remap_prob(newp, oldp);
125 vp9_prob newp, bestnewp = oldp;
128 for (newp = *bestp; newp != oldp; newp += step) {
129 const int new_b = cost_branch256(ct, newp);
130 const int update_b = prob_diff_update_cost(newp, oldp) + vp9_cost_upd256;
134 bestnewp = newp;
146 int newp;
159 for (newp = *bestp; newp != oldp[PIVOT_NODE]; newp += step) {
160 if (newp < 1 || newp > 255)
162 newplist[PIVOT_NODE] = newp;
167 update_b = prob_diff_update_cost(newp, oldp[PIVOT_NODE]) +
172 bestnewp = newp;
182 vp9_prob newp = get_binary_prob(ct[0], ct[1]);
183 const int savings = vp9_prob_diff_update_savings_search(ct, *oldp, &newp,
185 assert(newp >= 1);
188 vp9_write_prob_diff_update(w, newp, *oldp);
189 *oldp = newp;