vp9_entropy.h 9.37 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_treecoder.h"
#include "vp9/common/vp9_blockd.h"
#include "vp9/common/vp9_common.h"
18

John Koleszar's avatar
John Koleszar committed
19
20
/* Coefficient token alphabet */

21
22
23
24
25
26
27
#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 DCT_VAL_CATEGORY1       5       /* 5-6       Extra Bits 1+1 */
#define DCT_VAL_CATEGORY2       6       /* 7-10      Extra Bits 2+1 */
28
29
30
#define DCT_VAL_CATEGORY3       7       /* 11-18     Extra Bits 3+1 */
#define DCT_VAL_CATEGORY4       8       /* 19-34     Extra Bits 4+1 */
#define DCT_VAL_CATEGORY5       9       /* 35-66     Extra Bits 5+1 */
31
#define DCT_VAL_CATEGORY6       10      /* 67+       Extra Bits 14+1 */
32
#define DCT_EOB_TOKEN           11      /* EOB       Extra Bits 0+0 */
33
34
#define MAX_ENTROPY_TOKENS      12
#define ENTROPY_NODES           11
35
#define EOSB_TOKEN              127     /* Not signalled, encoder only */
John Koleszar's avatar
John Koleszar committed
36

37
38
#define INTER_MODE_CONTEXTS     7

39
extern const vp9_tree_index vp9_coef_tree[];
John Koleszar's avatar
John Koleszar committed
40

41
42
43
#define DCT_EOB_MODEL_TOKEN     3      /* EOB       Extra Bits 0+0 */
extern const vp9_tree_index vp9_coefmodel_tree[];

44
extern struct vp9_token vp9_coef_encodings[MAX_ENTROPY_TOKENS];
John Koleszar's avatar
John Koleszar committed
45

John Koleszar's avatar
John Koleszar committed
46
typedef struct {
47
48
  vp9_tree_p tree;
  const vp9_prob *prob;
49
  int len;
John Koleszar's avatar
John Koleszar committed
50
  int base_val;
51
} vp9_extra_bit;
John Koleszar's avatar
John Koleszar committed
52

53
extern vp9_extra_bit vp9_extra_bits[12];    /* indexed by token value */
John Koleszar's avatar
John Koleszar committed
54
55

#define MAX_PROB                255
56
#define DCT_MAX_VALUE           16384
John Koleszar's avatar
John Koleszar committed
57
58
59

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

60
/* Outside dimension.  0 = Y with DC, 1 = UV */
61
62
#define BLOCK_TYPES 2
#define REF_TYPES 2  // intra=0, inter=1
63

64
65
66
67
68
69
70
71
72
73
/* 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
74
75
76
77
78
79
80
81
82
   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). */

83
/*# define DC_TOKEN_CONTEXTS        3*/ /* 00, 0!0, !0!0 */
84
#define PREV_COEF_CONTEXTS          6
85

86
// #define ENTROPY_STATS
87

88
typedef unsigned int vp9_coeff_count[REF_TYPES][COEF_BANDS][PREV_COEF_CONTEXTS]
89
                                    [MAX_ENTROPY_TOKENS];
90
typedef unsigned int vp9_coeff_stats[REF_TYPES][COEF_BANDS][PREV_COEF_CONTEXTS]
91
                                    [ENTROPY_NODES][2];
92
typedef vp9_prob vp9_coeff_probs[REF_TYPES][COEF_BANDS][PREV_COEF_CONTEXTS]
93
94
                                [ENTROPY_NODES];

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

98
99
struct VP9Common;
void vp9_default_coef_probs(struct VP9Common *);
100
extern DECLARE_ALIGNED(16, const int16_t, vp9_default_scan_4x4[16]);
Jingning Han's avatar
Jingning Han committed
101

102
103
extern DECLARE_ALIGNED(16, const int16_t, vp9_col_scan_4x4[16]);
extern DECLARE_ALIGNED(16, const int16_t, vp9_row_scan_4x4[16]);
Jingning Han's avatar
Jingning Han committed
104

105
extern DECLARE_ALIGNED(64, const int16_t, vp9_default_scan_8x8[64]);
106

107
108
extern DECLARE_ALIGNED(16, const int16_t, vp9_col_scan_8x8[64]);
extern DECLARE_ALIGNED(16, const int16_t, vp9_row_scan_8x8[64]);
109

110
extern DECLARE_ALIGNED(16, const int16_t, vp9_default_scan_16x16[256]);
111

112
113
extern DECLARE_ALIGNED(16, const int16_t, vp9_col_scan_16x16[256]);
extern DECLARE_ALIGNED(16, const int16_t, vp9_row_scan_16x16[256]);
114

115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
extern DECLARE_ALIGNED(16, const int16_t, vp9_default_scan_32x32[1024]);

extern DECLARE_ALIGNED(16, int16_t, vp9_default_iscan_4x4[16]);

extern DECLARE_ALIGNED(16, int16_t, vp9_col_iscan_4x4[16]);
extern DECLARE_ALIGNED(16, int16_t, vp9_row_iscan_4x4[16]);

extern DECLARE_ALIGNED(64, int16_t, vp9_default_iscan_8x8[64]);

extern DECLARE_ALIGNED(16, int16_t, vp9_col_iscan_8x8[64]);
extern DECLARE_ALIGNED(16, int16_t, vp9_row_iscan_8x8[64]);

extern DECLARE_ALIGNED(16, int16_t, vp9_default_iscan_16x16[256]);

extern DECLARE_ALIGNED(16, int16_t, vp9_col_iscan_16x16[256]);
extern DECLARE_ALIGNED(16, int16_t, vp9_row_iscan_16x16[256]);

extern DECLARE_ALIGNED(16, int16_t, vp9_default_iscan_32x32[1024]);
133

134
void vp9_coef_tree_initialize(void);
135
void vp9_adapt_coef_probs(struct VP9Common *);
Daniel Kang's avatar
Daniel Kang committed
136

137
138
static INLINE void vp9_reset_sb_tokens_context(MACROBLOCKD* const xd,
                                               BLOCK_SIZE_TYPE bsize) {
139
  /* Clear entropy contexts */
140
141
142
143
144
145
146
147
148
  const int bw = 1 << b_width_log2(bsize);
  const int bh = 1 << b_height_log2(bsize);
  int i;
  for (i = 0; i < MAX_MB_PLANE; i++) {
    vpx_memset(xd->plane[i].above_context, 0,
               sizeof(ENTROPY_CONTEXT) * bw >> xd->plane[i].subsampling_x);
    vpx_memset(xd->plane[i].left_context, 0,
               sizeof(ENTROPY_CONTEXT) * bh >> xd->plane[i].subsampling_y);
  }
149
150
}

Paul Wilkins's avatar
Paul Wilkins committed
151
152
153
154
155
156
// This is the index in the scan order beyond which all coefficients for
// 8x8 transform and above are in the top band.
// For 4x4 blocks the index is less but to keep things common the lookup
// table for 4x4 is padded out to this index.
#define MAXBAND_INDEX 21

Paul Wilkins's avatar
Paul Wilkins committed
157
158
159
160
extern const uint8_t vp9_coefband_trans_8x8plus[MAXBAND_INDEX + 1];
extern const uint8_t vp9_coefband_trans_4x4[MAXBAND_INDEX + 1];


Paul Wilkins's avatar
Paul Wilkins committed
161
162
163
static int get_coef_band(const uint8_t * band_translate, int coef_index) {
  return (coef_index > MAXBAND_INDEX)
    ? (COEF_BANDS-1) : band_translate[coef_index];
164
}
Paul Wilkins's avatar
Paul Wilkins committed
165

166
#define MAX_NEIGHBORS 2
167
168
169
170
171
static INLINE int get_coef_context(const int16_t *neighbors,
                                   uint8_t *token_cache,
                                   int c) {
  return (1 + token_cache[neighbors[MAX_NEIGHBORS * c + 0]] +
          token_cache[neighbors[MAX_NEIGHBORS * c + 1]]) >> 1;
172
173
}

174
const int16_t *vp9_get_coef_neighbors_handle(const int16_t *scan);
175

176

177
178
// 128 lists of probabilities are stored for the following ONE node probs:
// 1, 3, 5, 7, ..., 253, 255
179
180
// In between probabilities are interpolated linearly

181
#define COEFPROB_MODELS             128
182

183
#define UNCONSTRAINED_NODES         3
184

185
#define PIVOT_NODE                  2   // which node is pivot
186
187

typedef vp9_prob vp9_coeff_probs_model[REF_TYPES][COEF_BANDS]
188
189
190
191
192
193
194
195
196
197
                                      [PREV_COEF_CONTEXTS]
                                      [UNCONSTRAINED_NODES];

typedef unsigned int vp9_coeff_count_model[REF_TYPES][COEF_BANDS]
                                          [PREV_COEF_CONTEXTS]
                                          [UNCONSTRAINED_NODES + 1];
typedef unsigned int vp9_coeff_stats_model[REF_TYPES][COEF_BANDS]
                                          [PREV_COEF_CONTEXTS]
                                          [UNCONSTRAINED_NODES][2];

198
void vp9_model_to_full_probs(const vp9_prob *model, vp9_prob *full);
199

200
static INLINE const int16_t* get_scan_4x4(TX_TYPE tx_type) {
201
202
203
204
205
206
  switch (tx_type) {
    case ADST_DCT:
      return vp9_row_scan_4x4;
    case DCT_ADST:
      return vp9_col_scan_4x4;
    default:
Paul Wilkins's avatar
Paul Wilkins committed
207
      return vp9_default_scan_4x4;
208
209
210
  }
}

211
212
213
214
215
216
217
218
219
220
221
222
static INLINE const int16_t* get_iscan_4x4(TX_TYPE tx_type) {
  switch (tx_type) {
    case ADST_DCT:
      return vp9_row_iscan_4x4;
    case DCT_ADST:
      return vp9_col_iscan_4x4;
    default:
      return vp9_default_iscan_4x4;
  }
}

static INLINE const int16_t* get_scan_8x8(TX_TYPE tx_type) {
223
224
225
226
227
228
  switch (tx_type) {
    case ADST_DCT:
      return vp9_row_scan_8x8;
    case DCT_ADST:
      return vp9_col_scan_8x8;
    default:
Paul Wilkins's avatar
Paul Wilkins committed
229
      return vp9_default_scan_8x8;
230
231
232
  }
}

233
234
235
236
237
238
239
240
241
242
243
244
static INLINE const int16_t* get_iscan_8x8(TX_TYPE tx_type) {
  switch (tx_type) {
    case ADST_DCT:
      return vp9_row_iscan_8x8;
    case DCT_ADST:
      return vp9_col_iscan_8x8;
    default:
      return vp9_default_iscan_8x8;
  }
}

static INLINE const int16_t* get_scan_16x16(TX_TYPE tx_type) {
245
246
247
248
249
250
  switch (tx_type) {
    case ADST_DCT:
      return vp9_row_scan_16x16;
    case DCT_ADST:
      return vp9_col_scan_16x16;
    default:
Paul Wilkins's avatar
Paul Wilkins committed
251
      return vp9_default_scan_16x16;
252
253
254
  }
}

255
256
257
258
259
260
261
262
263
264
265
static INLINE const int16_t* get_iscan_16x16(TX_TYPE tx_type) {
  switch (tx_type) {
    case ADST_DCT:
      return vp9_row_iscan_16x16;
    case DCT_ADST:
      return vp9_col_iscan_16x16;
    default:
      return vp9_default_iscan_16x16;
  }
}

266
enum { VP9_COEF_UPDATE_PROB = 252 };
267

268
#endif  // VP9_COMMON_VP9_ENTROPY_H_