Searched refs:PIVOT_NODE (Results 1 – 5 of 5) sorted by relevance
152 old_b += cost_branch256(ct + 2 * PIVOT_NODE, oldplist[PIVOT_NODE]); in vp9_prob_diff_update_savings_search_model()155 bestnewp = oldp[PIVOT_NODE]; in vp9_prob_diff_update_savings_search_model()157 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()162 newplist[PIVOT_NODE] = newp; in vp9_prob_diff_update_savings_search_model()166 new_b += cost_branch256(ct + 2 * PIVOT_NODE, newplist[PIVOT_NODE]); in vp9_prob_diff_update_savings_search_model()167 update_b = prob_diff_update_cost(newp, oldp[PIVOT_NODE]) + in vp9_prob_diff_update_savings_search_model()
155 vp9_pareto8_full[p->context_tree[PIVOT_NODE] - 1], in pack_mb_tokens()537 if (t == PIVOT_NODE) in update_coef_probs_common()575 if (t == PIVOT_NODE) in update_coef_probs_common()623 if (t == PIVOT_NODE) in update_coef_probs_common()
134 #define PIVOT_NODE 2 // which node is pivot macro
719 extend_to_full_distribution(&full[UNCONSTRAINED_NODES], model[PIVOT_NODE]); in vp9_model_to_full_probs()
136 prob = vp9_pareto8_full[prob[PIVOT_NODE] - 1]; in decode_coefs()