1/* 2 * Copyright (c) 2014 The WebM project authors. All Rights Reserved. 3 * 4 * Use of this source code is governed by a BSD-style license 5 * that can be found in the LICENSE file in the root of the source 6 * tree. An additional intellectual property rights grant can be found 7 * in the file PATENTS. All contributing project authors may 8 * be found in the AUTHORS file in the root of the source tree. 9 */ 10 11#ifndef VP9_ENCODER_VP9_COST_H_ 12#define VP9_ENCODER_VP9_COST_H_ 13 14#include "vp9/common/vp9_prob.h" 15 16#ifdef __cplusplus 17extern "C" { 18#endif 19 20extern const unsigned int vp9_prob_cost[256]; 21 22#define vp9_cost_zero(prob) (vp9_prob_cost[prob]) 23 24#define vp9_cost_one(prob) vp9_cost_zero(vp9_complement(prob)) 25 26#define vp9_cost_bit(prob, bit) vp9_cost_zero((bit) ? vp9_complement(prob) \ 27 : (prob)) 28 29static INLINE unsigned int cost_branch256(const unsigned int ct[2], 30 vp9_prob p) { 31 return ct[0] * vp9_cost_zero(p) + ct[1] * vp9_cost_one(p); 32} 33 34static INLINE int treed_cost(vp9_tree tree, const vp9_prob *probs, 35 int bits, int len) { 36 int cost = 0; 37 vp9_tree_index i = 0; 38 39 do { 40 const int bit = (bits >> --len) & 1; 41 cost += vp9_cost_bit(probs[i >> 1], bit); 42 i = tree[i + bit]; 43 } while (len); 44 45 return cost; 46} 47 48void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree); 49void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree); 50 51#ifdef __cplusplus 52} // extern "C" 53#endif 54 55#endif // VP9_ENCODER_VP9_COST_H_ 56