Home
last modified time | relevance | path

Searched refs:vp9_cost_zero (Results 1 – 6 of 6) sorted by relevance

/external/libvpx/libvpx/vp9/encoder/
Dvp9_cost.h26 #define vp9_cost_zero(prob) (vp9_prob_cost[prob]) macro
28 #define vp9_cost_one(prob) vp9_cost_zero(256 - (prob))
30 #define vp9_cost_bit(prob, bit) vp9_cost_zero((bit) ? 256 - (prob) : (prob))
34 return ct[0] * vp9_cost_zero(p) + ct[1] * vp9_cost_one(p); in cost_branch256()
Dvp9_segmentation.c76 int cost = c0123 * vp9_cost_zero(probs[0]) + c4567 * vp9_cost_one(probs[0]); in cost_segmap()
80 cost += c01 * vp9_cost_zero(probs[1]) + c23 * vp9_cost_one(probs[1]); in cost_segmap()
83 cost += segcounts[0] * vp9_cost_zero(probs[3]) + in cost_segmap()
86 cost += segcounts[2] * vp9_cost_zero(probs[4]) + in cost_segmap()
91 cost += c45 * vp9_cost_zero(probs[2]) + c67 * vp9_cost_one(probs[2]); in cost_segmap()
94 cost += segcounts[4] * vp9_cost_zero(probs[5]) + in cost_segmap()
97 cost += segcounts[6] * vp9_cost_zero(probs[6]) + in cost_segmap()
248 t_pred_cost += count0 * vp9_cost_zero(t_nopred_prob[i]) + in vp9_choose_segmap_coding_method()
Dvp9_encodemv.c79 sign_cost[0] = vp9_cost_zero(mvcomp->sign); in build_nmv_component_cost_table()
84 bits_cost[i][0] = vp9_cost_zero(mvcomp->bits[i]); in build_nmv_component_cost_table()
93 class0_hp_cost[0] = vp9_cost_zero(mvcomp->class0_hp); in build_nmv_component_cost_table()
95 hp_cost[0] = vp9_cost_zero(mvcomp->hp); in build_nmv_component_cost_table()
146 const int update = cost_branch256(ct, *cur_p) + vp9_cost_zero(upd_p) > in update_mv()
Dvp9_subexp.c122 const int upd_cost = vp9_cost_one(upd) - vp9_cost_zero(upd); in vp9_prob_diff_update_savings_search()
147 const int upd_cost = vp9_cost_one(upd) - vp9_cost_zero(upd); in vp9_prob_diff_update_savings_search_model()
Dvp9_bitstream.c571 savings += s - (int)(vp9_cost_zero(upd)); in update_coef_probs_common()
573 savings -= (int)(vp9_cost_zero(upd)); in update_coef_probs_common()
Dvp9_rdopt.c870 r_tx_size += vp9_cost_zero(tx_probs[m]); in choose_tx_size_from_rd()