vp9_treewriter.h 3.27 KB
Newer Older
John Koleszar's avatar
John Koleszar committed
1
/*
2
 *  Copyright (c) 2010 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
13
#ifndef VP9_ENCODER_VP9_TREEWRITER_H_
#define VP9_ENCODER_VP9_TREEWRITER_H_
John Koleszar's avatar
John Koleszar committed
14
15
16
17

/* Trees map alphabets into huffman-like codes suitable for an arithmetic
   bit coder.  Timothy S Murphy  11 October 2004 */

18
#include "vp9/common/vp9_treecoder.h"
John Koleszar's avatar
John Koleszar committed
19

20
#include "vp9/encoder/vp9_boolhuff.h"       /* for now */
John Koleszar's avatar
John Koleszar committed
21

22
typedef BOOL_CODER vp9_writer;
John Koleszar's avatar
John Koleszar committed
23

24
25
26
#define vp9_write encode_bool
#define vp9_write_literal vp9_encode_value
#define vp9_write_bit(W, V) vp9_write(W, V, vp9_prob_half)
John Koleszar's avatar
John Koleszar committed
27
28
29

/* Approximate length of an encoded bool in 256ths of a bit at given prob */

30
31
#define vp9_cost_zero(x) (vp9_prob_cost[x])
#define vp9_cost_one(x) vp9_cost_zero(vp9_complement(x))
John Koleszar's avatar
John Koleszar committed
32

33
#define vp9_cost_bit(x, b) vp9_cost_zero((b) ? vp9_complement(x) : (x))
John Koleszar's avatar
John Koleszar committed
34
35
36
37
38
39

/* VP8BC version is scaled by 2^20 rather than 2^8; see bool_coder.h */


/* Both of these return bits, not scaled bits. */

40
41
static INLINE unsigned int cost_branch(const unsigned int ct[2],
                                       vp9_prob p) {
John Koleszar's avatar
John Koleszar committed
42
  /* Imitate existing calculation */
43
44
  return ((ct[0] * vp9_cost_zero(p))
          + (ct[1] * vp9_cost_one(p))) >> 8;
John Koleszar's avatar
John Koleszar committed
45
46
}

47
48
static INLINE unsigned int cost_branch256(const unsigned int ct[2],
                                          vp9_prob p) {
John Koleszar's avatar
John Koleszar committed
49
  /* Imitate existing calculation */
50
51
  return ((ct[0] * vp9_cost_zero(p))
          + (ct[1] * vp9_cost_one(p)));
52
53
}

John Koleszar's avatar
John Koleszar committed
54
55
56
/* Small functions to write explicit values and tokens, as well as
   estimate their lengths. */

57
58
59
60
61
62
static INLINE void treed_write(vp9_writer *const w,
                               vp9_tree t,
                               const vp9_prob *const p,
                               int v,
                               /* number of bits in v, assumed nonzero */
                               int n) {
63
  vp9_tree_index i = 0;
John Koleszar's avatar
John Koleszar committed
64
65
66

  do {
    const int b = (v >> --n) & 1;
67
    vp9_write(w, b, p[i >> 1]);
John Koleszar's avatar
John Koleszar committed
68
69
    i = t[i + b];
  } while (n);
John Koleszar's avatar
John Koleszar committed
70
}
71

72
73
74
75
static INLINE void write_token(vp9_writer *const w,
                               vp9_tree t,
                               const vp9_prob *const p,
                               vp9_token *const x) {
76
  treed_write(w, t, p, x->value, x->Len);
John Koleszar's avatar
John Koleszar committed
77
78
}

79
80
81
82
83
static INLINE int treed_cost(vp9_tree t,
                             const vp9_prob *const p,
                             int v,
                             /* number of bits in v, assumed nonzero */
                             int n) {
John Koleszar's avatar
John Koleszar committed
84
  int c = 0;
85
  vp9_tree_index i = 0;
John Koleszar's avatar
John Koleszar committed
86
87
88

  do {
    const int b = (v >> --n) & 1;
89
    c += vp9_cost_bit(p[i >> 1], b);
John Koleszar's avatar
John Koleszar committed
90
91
92
93
    i = t[i + b];
  } while (n);

  return c;
John Koleszar's avatar
John Koleszar committed
94
}
95

96
97
98
static INLINE int cost_token(vp9_tree t,
                             const vp9_prob *const p,
                             vp9_token *const x) {
99
  return treed_cost(t, p, x->value, x->Len);
John Koleszar's avatar
John Koleszar committed
100
101
102
103
}

/* Fill array of costs for all possible token values. */

104
void vp9_cost_tokens(int *Costs, const vp9_prob *, vp9_tree);
John Koleszar's avatar
John Koleszar committed
105

106
void vp9_cost_tokens_skip(int *c, const vp9_prob *p, vp9_tree t);
Christian Duvivier's avatar
Christian Duvivier committed
107

108
#endif  // VP9_ENCODER_VP9_TREEWRITER_H_