vp9_entropy.h 6.82 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
#ifndef VP9_COMMON_VP9_ENTROPY_H_
#define VP9_COMMON_VP9_ENTROPY_H_
John Koleszar's avatar
John Koleszar committed
13

14
#include "vpx/vpx_integer.h"
15

16
17
#include "vp9/common/vp9_blockd.h"
#include "vp9/common/vp9_common.h"
18
#include "vp9/common/vp9_scan.h"
Jim Bankoski's avatar
Jim Bankoski committed
19
#include "vp9/common/vp9_entropymode.h"
20

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

25
26
#define DIFF_UPDATE_PROB 252

27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
// Coefficient token alphabet
#define ZERO_TOKEN      0   // 0     Extra Bits 0+0
#define ONE_TOKEN       1   // 1     Extra Bits 0+1
#define TWO_TOKEN       2   // 2     Extra Bits 0+1
#define THREE_TOKEN     3   // 3     Extra Bits 0+1
#define FOUR_TOKEN      4   // 4     Extra Bits 0+1
#define CATEGORY1_TOKEN 5   // 5-6   Extra Bits 1+1
#define CATEGORY2_TOKEN 6   // 7-10  Extra Bits 2+1
#define CATEGORY3_TOKEN 7   // 11-18 Extra Bits 3+1
#define CATEGORY4_TOKEN 8   // 19-34 Extra Bits 4+1
#define CATEGORY5_TOKEN 9   // 35-66 Extra Bits 5+1
#define CATEGORY6_TOKEN 10  // 67+   Extra Bits 14+1
#define EOB_TOKEN       11  // EOB   Extra Bits 0+0

#define ENTROPY_TOKENS 12

#define ENTROPY_NODES 11

45
DECLARE_ALIGNED(16, extern const uint8_t, vp9_pt_energy_class[ENTROPY_TOKENS]);
46
47

#define EOB_MODEL_TOKEN 3
48
49
extern const vp9_tree_index vp9_coefmodel_tree[];

John Koleszar's avatar
John Koleszar committed
50
typedef struct {
51
  const vp9_tree_index *tree;
52
  const vp9_prob *prob;
53
  int len;
John Koleszar's avatar
John Koleszar committed
54
  int base_val;
55
} vp9_extra_bit;
John Koleszar's avatar
John Koleszar committed
56

57
// indexed by token value
58
extern const vp9_extra_bit vp9_extra_bits[ENTROPY_TOKENS];
John Koleszar's avatar
John Koleszar committed
59

60
#define DCT_MAX_VALUE           16384
John Koleszar's avatar
John Koleszar committed
61
62
63

/* Coefficients are predicted via a 3-dimensional probability table. */

64
#define REF_TYPES 2  // intra=0, inter=1
65

66
67
68
69
70
71
72
73
74
75
/* Middle dimension reflects the coefficient position within the transform. */
#define COEF_BANDS 6

/* Inside dimension is measure of nearby complexity, that reflects the energy
   of nearby coefficients are nonzero.  For the first coefficient (DC, unless
   block type is 0), we look at the (already encoded) blocks above and to the
   left of the current block.  The context index is then the number (0,1,or 2)
   of these blocks having nonzero coefficients.
   After decoding a coefficient, the measure is determined by the size of the
   most recently decoded coefficient.
John Koleszar's avatar
John Koleszar committed
76
77
78
79
80
81
82
83
84
   Note that the intuitive meaning of this measure changes as coefficients
   are decoded, e.g., prior to the first token, a zero means that my neighbors
   are empty while, after the first token, because of the use of end-of-block,
   a zero means we just decoded a zero and hence guarantees that a non-zero
   coefficient will appear later in this block.  However, this shift
   in meaning is perfectly OK because our context depends also on the
   coefficient band (and since zigzag positions 0, 1, and 2 are in
   distinct bands). */

85
86
#define COEFF_CONTEXTS 6
#define BAND_COEFF_CONTEXTS(band) ((band) == 0 ? 3 : COEFF_CONTEXTS)
87

88
// #define ENTROPY_STATS
89

90
typedef unsigned int vp9_coeff_count[REF_TYPES][COEF_BANDS][COEFF_CONTEXTS]
91
                                    [ENTROPY_TOKENS];
92
typedef unsigned int vp9_coeff_stats[REF_TYPES][COEF_BANDS][COEFF_CONTEXTS]
93
94
                                    [ENTROPY_NODES][2];

95
96
#define SUBEXP_PARAM                4   /* Subexponential code parameter */
#define MODULUS_PARAM               13  /* Modulus parameter */
97

98
struct VP9Common;
99
100
void vp9_default_coef_probs(struct VP9Common *cm);
void vp9_adapt_coef_probs(struct VP9Common *cm);
Daniel Kang's avatar
Daniel Kang committed
101

102
static INLINE void reset_skip_context(MACROBLOCKD *xd, BLOCK_SIZE bsize) {
103
104
  int i;
  for (i = 0; i < MAX_MB_PLANE; i++) {
105
    struct macroblockd_plane *const pd = &xd->plane[i];
106
    const BLOCK_SIZE plane_bsize = get_plane_block_size(bsize, pd);
107
108
109
110
    vpx_memset(pd->above_context, 0, sizeof(ENTROPY_CONTEXT) *
                   num_4x4_blocks_wide_lookup[plane_bsize]);
    vpx_memset(pd->left_context, 0, sizeof(ENTROPY_CONTEXT) *
                   num_4x4_blocks_high_lookup[plane_bsize]);
111
  }
112
113
}

Paul Wilkins's avatar
Paul Wilkins committed
114
115
// This is the index in the scan order beyond which all coefficients for
// 8x8 transform and above are in the top band.
116
// This macro is currently unused but may be used by certain implementations
Paul Wilkins's avatar
Paul Wilkins committed
117
118
#define MAXBAND_INDEX 21

119
120
DECLARE_ALIGNED(16, extern const uint8_t, vp9_coefband_trans_8x8plus[1024]);
DECLARE_ALIGNED(16, extern const uint8_t, vp9_coefband_trans_4x4[16]);
121

122
static INLINE const uint8_t *get_band_translate(TX_SIZE tx_size) {
123
124
125
  return tx_size == TX_4X4 ? vp9_coefband_trans_4x4
                           : vp9_coefband_trans_8x8plus;
}
Paul Wilkins's avatar
Paul Wilkins committed
126

127
128
// 128 lists of probabilities are stored for the following ONE node probs:
// 1, 3, 5, 7, ..., 253, 255
129
130
// In between probabilities are interpolated linearly

131
#define COEFF_PROB_MODELS 256
132

133
#define UNCONSTRAINED_NODES         3
134

135
#define PIVOT_NODE                  2   // which node is pivot
136

Jim Bankoski's avatar
Jim Bankoski committed
137
#define MODEL_NODES (ENTROPY_NODES - UNCONSTRAINED_NODES)
138
extern const vp9_prob vp9_pareto8_full[COEFF_PROB_MODELS][MODEL_NODES];
Jim Bankoski's avatar
Jim Bankoski committed
139

140
typedef vp9_prob vp9_coeff_probs_model[REF_TYPES][COEF_BANDS]
141
                                      [COEFF_CONTEXTS][UNCONSTRAINED_NODES];
142
143

typedef unsigned int vp9_coeff_count_model[REF_TYPES][COEF_BANDS]
144
                                          [COEFF_CONTEXTS]
145
146
                                          [UNCONSTRAINED_NODES + 1];

147
void vp9_model_to_full_probs(const vp9_prob *model, vp9_prob *full);
148

149
150
static INLINE int get_entropy_context(TX_SIZE tx_size, const ENTROPY_CONTEXT *a,
                                      const ENTROPY_CONTEXT *l) {
151
  ENTROPY_CONTEXT above_ec = 0, left_ec = 0;
152

153
154
155
156
157
158
  switch (tx_size) {
    case TX_4X4:
      above_ec = a[0] != 0;
      left_ec = l[0] != 0;
      break;
    case TX_8X8:
159
160
      above_ec = !!*(const uint16_t *)a;
      left_ec  = !!*(const uint16_t *)l;
161
162
      break;
    case TX_16X16:
163
164
      above_ec = !!*(const uint32_t *)a;
      left_ec  = !!*(const uint32_t *)l;
165
166
      break;
    case TX_32X32:
167
168
      above_ec = !!*(const uint64_t *)a;
      left_ec  = !!*(const uint64_t *)l;
169
170
      break;
    default:
James Zern's avatar
James Zern committed
171
      assert(0 && "Invalid transform size.");
172
173
174
175
176
  }

  return combine_entropy_contexts(above_ec, left_ec);
}

177
178
static const INLINE scan_order *get_scan(const MACROBLOCKD *xd, TX_SIZE tx_size,
                                         PLANE_TYPE type, int block_idx) {
179
180
181
  const MODE_INFO *const mi = xd->mi_8x8[0];
  const MB_MODE_INFO *const mbmi = &mi->mbmi;

182
  if (is_inter_block(mbmi) || type != PLANE_TYPE_Y || xd->lossless) {
183
    return &vp9_default_scan_orders[tx_size];
184
185
186
  } else {
    const MB_PREDICTION_MODE mode =
        mbmi->sb_type < BLOCK_8X8 ? mi->bmi[block_idx].as_mode : mbmi->mode;
187
    return &vp9_scan_orders[tx_size][mode2txfm_map[mode]];
188
189
190
  }
}

191
192
193
194
#ifdef __cplusplus
}  // extern "C"
#endif

195
#endif  // VP9_COMMON_VP9_ENTROPY_H_