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