vp9_prob.h 2.59 KB
Newer Older
John Koleszar's avatar
John Koleszar committed
1
/*
2
 *  Copyright (c) 2013 The WebM project authors. All Rights Reserved.
John Koleszar's avatar
John Koleszar committed
3
 *
4
 *  Use of this source code is governed by a BSD-style license
5 6
 *  that can be found in the LICENSE file in the root of the source
 *  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.
John Koleszar's avatar
John Koleszar committed
9 10
 */

11 12
#ifndef VP9_COMMON_VP9_PROB_H_
#define VP9_COMMON_VP9_PROB_H_
John Koleszar's avatar
John Koleszar committed
13

14
#include "./vpx_config.h"
15 16

#include "vpx_ports/mem.h"
17
#include "vpx/vpx_integer.h"
18

Dmitry Kovalev's avatar
Dmitry Kovalev committed
19
#include "vp9/common/vp9_common.h"
20

21 22 23 24
#ifdef __cplusplus
extern "C" {
#endif

25
typedef uint8_t vp9_prob;
John Koleszar's avatar
John Koleszar committed
26

27 28
#define MAX_PROB 255

29
#define vp9_prob_half ((vp9_prob) 128)
John Koleszar's avatar
John Koleszar committed
30

31
typedef int8_t vp9_tree_index;
John Koleszar's avatar
John Koleszar committed
32

33 34
#define TREE_SIZE(leaf_count) (2 * (leaf_count) - 2)

35
#define vp9_complement(x) (255 - x)
John Koleszar's avatar
John Koleszar committed
36 37

/* We build coding trees compactly in arrays.
38
   Each node of the tree is a pair of vp9_tree_indices.
John Koleszar's avatar
John Koleszar committed
39 40 41 42 43
   Array index often references a corresponding probability table.
   Index <= 0 means done encoding/decoding and value = -Index,
   Index > 0 means need another bit, specification at index.
   Nonnegative indices are always even;  processing begins at node 0. */

Dmitry Kovalev's avatar
Dmitry Kovalev committed
44
typedef const vp9_tree_index vp9_tree[];
John Koleszar's avatar
John Koleszar committed
45

46
static INLINE vp9_prob clip_prob(int p) {
47
  return (p > 255) ? 255 : (p < 1) ? 1 : p;
48 49
}

50 51 52
static INLINE vp9_prob get_prob(int num, int den) {
  return (den == 0) ? 128u : clip_prob(((int64_t)num * 256 + (den >> 1)) / den);
}
53

54
static INLINE vp9_prob get_binary_prob(int n0, int n1) {
55 56 57
  return get_prob(n0, n0 + n1);
}

58
/* This function assumes prob1 and prob2 are already within [1,255] range. */
59
static INLINE vp9_prob weighted_prob(int prob1, int prob2, int factor) {
Dmitry Kovalev's avatar
Dmitry Kovalev committed
60
  return ROUND_POWER_OF_TWO(prob1 * (256 - factor) + prob2 * factor, 8);
61
}
John Koleszar's avatar
John Koleszar committed
62

63
static INLINE vp9_prob merge_probs(vp9_prob pre_prob,
64 65 66
                                   const unsigned int ct[2],
                                   unsigned int count_sat,
                                   unsigned int max_update_factor) {
67
  const vp9_prob prob = get_binary_prob(ct[0], ct[1]);
68 69 70 71 72
  const unsigned int count = MIN(ct[0] + ct[1], count_sat);
  const unsigned int factor = max_update_factor * count / count_sat;
  return weighted_prob(pre_prob, prob, factor);
}

73 74 75
void vp9_tree_merge_probs(const vp9_tree_index *tree, const vp9_prob *pre_probs,
                          const unsigned int *counts, unsigned int count_sat,
                          unsigned int max_update_factor, vp9_prob *probs);
76 77


78
DECLARE_ALIGNED(16, extern const uint8_t, vp9_norm[256]);
79

80 81 82 83
#ifdef __cplusplus
}  // extern "C"
#endif

84
#endif  // VP9_COMMON_VP9_PROB_H_