269428e35c
This is a pure-refactor in preparation to potentially raise the bit-cost resolution. Verified at good speed 0 and rt speed -6. Change-Id: I5347e6e8c28a9ad9dd0aae1d76a3d0f3c2335bb9
59 lines
1.6 KiB
C
59 lines
1.6 KiB
C
/*
|
|
* Copyright (c) 2014 The WebM project authors. All Rights Reserved.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license
|
|
* that can be found in the LICENSE file in the root of the source
|
|
* tree. An additional intellectual property rights grant can be found
|
|
* in the file PATENTS. All contributing project authors may
|
|
* be found in the AUTHORS file in the root of the source tree.
|
|
*/
|
|
|
|
#ifndef VP9_ENCODER_VP9_COST_H_
|
|
#define VP9_ENCODER_VP9_COST_H_
|
|
|
|
#include "vpx_dsp/prob.h"
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
extern const unsigned int vp9_prob_cost[256];
|
|
|
|
// The factor to scale from cost in bits to cost in vp9_prob_cost units.
|
|
#define VP9_PROB_COST_SHIFT 8
|
|
|
|
#define vp9_cost_zero(prob) (vp9_prob_cost[prob])
|
|
|
|
#define vp9_cost_one(prob) vp9_cost_zero(vpx_complement(prob))
|
|
|
|
#define vp9_cost_bit(prob, bit) vp9_cost_zero((bit) ? vpx_complement(prob) \
|
|
: (prob))
|
|
|
|
static INLINE unsigned int cost_branch256(const unsigned int ct[2],
|
|
vpx_prob p) {
|
|
return ct[0] * vp9_cost_zero(p) + ct[1] * vp9_cost_one(p);
|
|
}
|
|
|
|
static INLINE int treed_cost(vpx_tree tree, const vpx_prob *probs,
|
|
int bits, int len) {
|
|
int cost = 0;
|
|
vpx_tree_index i = 0;
|
|
|
|
do {
|
|
const int bit = (bits >> --len) & 1;
|
|
cost += vp9_cost_bit(probs[i >> 1], bit);
|
|
i = tree[i + bit];
|
|
} while (len);
|
|
|
|
return cost;
|
|
}
|
|
|
|
void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree);
|
|
void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree);
|
|
|
|
#ifdef __cplusplus
|
|
} // extern "C"
|
|
#endif
|
|
|
|
#endif // VP9_ENCODER_VP9_COST_H_
|