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 "vpx_dsp/prob.h" 15 #include "vpx/vpx_integer.h" 16 17 #ifdef __cplusplus 18 extern "C" { 19 #endif 20 21 extern const uint16_t vp9_prob_cost[256]; 22 23 // The factor to scale from cost in bits to cost in vp9_prob_cost units. 24 #define VP9_PROB_COST_SHIFT 9 25 26 #define vp9_cost_zero(prob) (vp9_prob_cost[prob]) 27 28 #define vp9_cost_one(prob) vp9_cost_zero(256 - (prob)) 29 30 #define vp9_cost_bit(prob, bit) vp9_cost_zero((bit) ? 256 - (prob) : (prob)) 31 32 static INLINE unsigned int cost_branch256(const unsigned int ct[2], 33 vpx_prob p) { 34 return ct[0] * vp9_cost_zero(p) + ct[1] * vp9_cost_one(p); 35 } 36 37 static INLINE int treed_cost(vpx_tree tree, const vpx_prob *probs, int bits, 38 int len) { 39 int cost = 0; 40 vpx_tree_index i = 0; 41 42 do { 43 const int bit = (bits >> --len) & 1; 44 cost += vp9_cost_bit(probs[i >> 1], bit); 45 i = tree[i + bit]; 46 } while (len); 47 48 return cost; 49 } 50 51 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree); 52 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree); 53 54 #ifdef __cplusplus 55 } // extern "C" 56 #endif 57 58 #endif // VP9_ENCODER_VP9_COST_H_ 59
