2010-05-18 17:58:33 +02:00
|
|
|
/*
|
2010-09-09 14:16:39 +02:00
|
|
|
* Copyright (c) 2010 The WebM project authors. All Rights Reserved.
|
2010-05-18 17:58:33 +02:00
|
|
|
*
|
2010-06-18 18:39:21 +02:00
|
|
|
* Use of this source code is governed by a BSD-style license
|
2010-06-04 22:19:40 +02:00
|
|
|
* that can be found in the LICENSE file in the root of the source
|
|
|
|
* tree. An additional intellectual property rights grant can be found
|
2010-06-18 18:39:21 +02:00
|
|
|
* in the file PATENTS. All contributing project authors may
|
2010-06-04 22:19:40 +02:00
|
|
|
* be found in the AUTHORS file in the root of the source tree.
|
2010-05-18 17:58:33 +02:00
|
|
|
*/
|
|
|
|
|
2012-11-30 01:36:10 +01:00
|
|
|
#ifndef VP9_COMMON_VP9_ENTROPY_H_
|
|
|
|
#define VP9_COMMON_VP9_ENTROPY_H_
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-12-19 00:31:19 +01:00
|
|
|
#include "vpx/vpx_integer.h"
|
2012-11-28 19:41:40 +01:00
|
|
|
#include "vp9/common/vp9_treecoder.h"
|
|
|
|
#include "vp9/common/vp9_blockd.h"
|
|
|
|
#include "vp9/common/vp9_common.h"
|
2012-06-20 14:07:24 +02:00
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
/* Coefficient token alphabet */
|
|
|
|
|
2010-10-28 01:04:02 +02:00
|
|
|
#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 */
|
2010-11-16 19:51:43 +01:00
|
|
|
#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 */
|
2013-03-11 17:20:57 +01:00
|
|
|
#define DCT_VAL_CATEGORY6 10 /* 67+ Extra Bits 14+1 */
|
2010-10-28 01:04:02 +02:00
|
|
|
#define DCT_EOB_TOKEN 11 /* EOB Extra Bits 0+0 */
|
2013-03-13 19:03:17 +01:00
|
|
|
#define MAX_ENTROPY_TOKENS 12
|
|
|
|
#define ENTROPY_NODES 11
|
2012-10-16 22:52:39 +02:00
|
|
|
#define EOSB_TOKEN 127 /* Not signalled, encoder only */
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-11-16 17:31:32 +01:00
|
|
|
#define INTER_MODE_CONTEXTS 7
|
|
|
|
|
2012-10-31 22:40:53 +01:00
|
|
|
extern const vp9_tree_index vp9_coef_tree[];
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-05-17 15:40:25 +02:00
|
|
|
#define DCT_EOB_MODEL_TOKEN 3 /* EOB Extra Bits 0+0 */
|
|
|
|
extern const vp9_tree_index vp9_coefmodel_tree[];
|
|
|
|
|
2013-04-11 22:01:52 +02:00
|
|
|
extern struct vp9_token vp9_coef_encodings[MAX_ENTROPY_TOKENS];
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
typedef struct {
|
2012-10-31 22:40:53 +01:00
|
|
|
vp9_tree_p tree;
|
|
|
|
const vp9_prob *prob;
|
2013-04-19 20:14:33 +02:00
|
|
|
int len;
|
2012-07-14 00:21:29 +02:00
|
|
|
int base_val;
|
2013-04-19 20:14:33 +02:00
|
|
|
} vp9_extra_bit;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-04-19 20:14:33 +02:00
|
|
|
extern vp9_extra_bit vp9_extra_bits[12]; /* indexed by token value */
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
#define PROB_UPDATE_BASELINE_COST 7
|
|
|
|
|
|
|
|
#define MAX_PROB 255
|
32x32 transform for superblocks.
This adds Debargha's DCT/DWT hybrid and a regular 32x32 DCT, and adds
code all over the place to wrap that in the bitstream/encoder/decoder/RD.
Some implementation notes (these probably need careful review):
- token range is extended by 1 bit, since the value range out of this
transform is [-16384,16383].
- the coefficients coming out of the FDCT are manually scaled back by
1 bit, or else they won't fit in int16_t (they are 17 bits). Because
of this, the RD error scoring does not right-shift the MSE score by
two (unlike for 4x4/8x8/16x16).
- to compensate for this loss in precision, the quantizer is halved
also. This is currently a little hacky.
- FDCT and IDCT is double-only right now. Needs a fixed-point impl.
- There are no default probabilities for the 32x32 transform yet; I'm
simply using the 16x16 luma ones. A future commit will add newly
generated probabilities for all transforms.
- No ADST version. I don't think we'll add one for this level; if an
ADST is desired, transform-size selection can scale back to 16x16
or lower, and use an ADST at that level.
Additional notes specific to Debargha's DWT/DCT hybrid:
- coefficient scale is different for the top/left 16x16 (DCT-over-DWT)
block than for the rest (DWT pixel differences) of the block. Therefore,
RD error scoring isn't easily scalable between coefficient and pixel
domain. Thus, unfortunately, we need to compute the RD distortion in
the pixel domain until we figure out how to scale these appropriately.
Change-Id: I00386f20f35d7fabb19aba94c8162f8aee64ef2b
2012-12-07 23:45:05 +01:00
|
|
|
#define DCT_MAX_VALUE 16384
|
2010-05-18 17:58:33 +02:00
|
|
|
|
|
|
|
/* Coefficients are predicted via a 3-dimensional probability table. */
|
|
|
|
|
2013-02-15 21:09:05 +01:00
|
|
|
/* Outside dimension. 0 = Y with DC, 1 = UV */
|
2013-02-19 22:36:38 +01:00
|
|
|
#define BLOCK_TYPES 2
|
|
|
|
#define REF_TYPES 2 // intra=0, inter=1
|
32x32 transform for superblocks.
This adds Debargha's DCT/DWT hybrid and a regular 32x32 DCT, and adds
code all over the place to wrap that in the bitstream/encoder/decoder/RD.
Some implementation notes (these probably need careful review):
- token range is extended by 1 bit, since the value range out of this
transform is [-16384,16383].
- the coefficients coming out of the FDCT are manually scaled back by
1 bit, or else they won't fit in int16_t (they are 17 bits). Because
of this, the RD error scoring does not right-shift the MSE score by
two (unlike for 4x4/8x8/16x16).
- to compensate for this loss in precision, the quantizer is halved
also. This is currently a little hacky.
- FDCT and IDCT is double-only right now. Needs a fixed-point impl.
- There are no default probabilities for the 32x32 transform yet; I'm
simply using the 16x16 luma ones. A future commit will add newly
generated probabilities for all transforms.
- No ADST version. I don't think we'll add one for this level; if an
ADST is desired, transform-size selection can scale back to 16x16
or lower, and use an ADST at that level.
Additional notes specific to Debargha's DWT/DCT hybrid:
- coefficient scale is different for the top/left 16x16 (DCT-over-DWT)
block than for the rest (DWT pixel differences) of the block. Therefore,
RD error scoring isn't easily scalable between coefficient and pixel
domain. Thus, unfortunately, we need to compute the RD distortion in
the pixel domain until we figure out how to scale these appropriately.
Change-Id: I00386f20f35d7fabb19aba94c8162f8aee64ef2b
2012-12-07 23:45:05 +01:00
|
|
|
|
2013-02-19 19:12:00 +01:00
|
|
|
/* 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.
|
2010-05-18 17:58:33 +02:00
|
|
|
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). */
|
|
|
|
|
2010-10-28 01:04:02 +02:00
|
|
|
/*# define DC_TOKEN_CONTEXTS 3*/ /* 00, 0!0, !0!0 */
|
2013-02-19 19:12:00 +01:00
|
|
|
#define PREV_COEF_CONTEXTS 6
|
2012-03-21 23:22:21 +01:00
|
|
|
|
2013-04-26 20:13:26 +02:00
|
|
|
// Disables backward coef probs adaption
|
|
|
|
// #define DISABLE_COEF_ADAPT
|
|
|
|
|
2013-02-19 22:36:38 +01:00
|
|
|
typedef unsigned int vp9_coeff_count[REF_TYPES][COEF_BANDS][PREV_COEF_CONTEXTS]
|
2012-12-08 01:09:59 +01:00
|
|
|
[MAX_ENTROPY_TOKENS];
|
2013-02-19 22:36:38 +01:00
|
|
|
typedef unsigned int vp9_coeff_stats[REF_TYPES][COEF_BANDS][PREV_COEF_CONTEXTS]
|
2012-12-08 01:09:59 +01:00
|
|
|
[ENTROPY_NODES][2];
|
2013-02-19 22:36:38 +01:00
|
|
|
typedef vp9_prob vp9_coeff_probs[REF_TYPES][COEF_BANDS][PREV_COEF_CONTEXTS]
|
2012-12-08 01:09:59 +01:00
|
|
|
[ENTROPY_NODES];
|
|
|
|
|
2012-06-06 00:25:07 +02:00
|
|
|
#define SUBEXP_PARAM 4 /* Subexponential code parameter */
|
|
|
|
#define MODULUS_PARAM 13 /* Modulus parameter */
|
2012-03-21 23:22:21 +01:00
|
|
|
|
2012-10-31 01:53:32 +01:00
|
|
|
struct VP9Common;
|
|
|
|
void vp9_default_coef_probs(struct VP9Common *);
|
2012-12-18 19:49:10 +01:00
|
|
|
extern DECLARE_ALIGNED(16, const int, vp9_default_zig_zag1d_4x4[16]);
|
2012-06-25 21:26:09 +02:00
|
|
|
|
2012-12-18 19:49:10 +01:00
|
|
|
extern DECLARE_ALIGNED(16, const int, vp9_col_scan_4x4[16]);
|
|
|
|
extern DECLARE_ALIGNED(16, const int, vp9_row_scan_4x4[16]);
|
2012-06-25 21:26:09 +02:00
|
|
|
|
2012-10-31 01:12:12 +01:00
|
|
|
extern DECLARE_ALIGNED(64, const int, vp9_default_zig_zag1d_8x8[64]);
|
2013-03-25 20:30:00 +01:00
|
|
|
|
|
|
|
extern DECLARE_ALIGNED(16, const int, vp9_col_scan_8x8[64]);
|
|
|
|
extern DECLARE_ALIGNED(16, const int, vp9_row_scan_8x8[64]);
|
|
|
|
|
32x32 transform for superblocks.
This adds Debargha's DCT/DWT hybrid and a regular 32x32 DCT, and adds
code all over the place to wrap that in the bitstream/encoder/decoder/RD.
Some implementation notes (these probably need careful review):
- token range is extended by 1 bit, since the value range out of this
transform is [-16384,16383].
- the coefficients coming out of the FDCT are manually scaled back by
1 bit, or else they won't fit in int16_t (they are 17 bits). Because
of this, the RD error scoring does not right-shift the MSE score by
two (unlike for 4x4/8x8/16x16).
- to compensate for this loss in precision, the quantizer is halved
also. This is currently a little hacky.
- FDCT and IDCT is double-only right now. Needs a fixed-point impl.
- There are no default probabilities for the 32x32 transform yet; I'm
simply using the 16x16 luma ones. A future commit will add newly
generated probabilities for all transforms.
- No ADST version. I don't think we'll add one for this level; if an
ADST is desired, transform-size selection can scale back to 16x16
or lower, and use an ADST at that level.
Additional notes specific to Debargha's DWT/DCT hybrid:
- coefficient scale is different for the top/left 16x16 (DCT-over-DWT)
block than for the rest (DWT pixel differences) of the block. Therefore,
RD error scoring isn't easily scalable between coefficient and pixel
domain. Thus, unfortunately, we need to compute the RD distortion in
the pixel domain until we figure out how to scale these appropriately.
Change-Id: I00386f20f35d7fabb19aba94c8162f8aee64ef2b
2012-12-07 23:45:05 +01:00
|
|
|
extern DECLARE_ALIGNED(16, const int, vp9_default_zig_zag1d_16x16[256]);
|
2013-03-25 20:30:00 +01:00
|
|
|
|
|
|
|
extern DECLARE_ALIGNED(16, const int, vp9_col_scan_16x16[256]);
|
|
|
|
extern DECLARE_ALIGNED(16, const int, vp9_row_scan_16x16[256]);
|
|
|
|
|
32x32 transform for superblocks.
This adds Debargha's DCT/DWT hybrid and a regular 32x32 DCT, and adds
code all over the place to wrap that in the bitstream/encoder/decoder/RD.
Some implementation notes (these probably need careful review):
- token range is extended by 1 bit, since the value range out of this
transform is [-16384,16383].
- the coefficients coming out of the FDCT are manually scaled back by
1 bit, or else they won't fit in int16_t (they are 17 bits). Because
of this, the RD error scoring does not right-shift the MSE score by
two (unlike for 4x4/8x8/16x16).
- to compensate for this loss in precision, the quantizer is halved
also. This is currently a little hacky.
- FDCT and IDCT is double-only right now. Needs a fixed-point impl.
- There are no default probabilities for the 32x32 transform yet; I'm
simply using the 16x16 luma ones. A future commit will add newly
generated probabilities for all transforms.
- No ADST version. I don't think we'll add one for this level; if an
ADST is desired, transform-size selection can scale back to 16x16
or lower, and use an ADST at that level.
Additional notes specific to Debargha's DWT/DCT hybrid:
- coefficient scale is different for the top/left 16x16 (DCT-over-DWT)
block than for the rest (DWT pixel differences) of the block. Therefore,
RD error scoring isn't easily scalable between coefficient and pixel
domain. Thus, unfortunately, we need to compute the RD distortion in
the pixel domain until we figure out how to scale these appropriately.
Change-Id: I00386f20f35d7fabb19aba94c8162f8aee64ef2b
2012-12-07 23:45:05 +01:00
|
|
|
extern DECLARE_ALIGNED(16, const int, vp9_default_zig_zag1d_32x32[1024]);
|
|
|
|
|
2012-10-31 00:25:53 +01:00
|
|
|
void vp9_coef_tree_initialize(void);
|
2012-10-31 01:53:32 +01:00
|
|
|
void vp9_adapt_coef_probs(struct VP9Common *);
|
2012-08-03 02:03:14 +02:00
|
|
|
|
2013-04-10 06:28:27 +02:00
|
|
|
static INLINE void vp9_reset_sb_tokens_context(MACROBLOCKD* const xd,
|
|
|
|
BLOCK_SIZE_TYPE bsize) {
|
2013-03-04 23:12:17 +01:00
|
|
|
/* Clear entropy contexts */
|
2013-04-29 19:37:25 +02:00
|
|
|
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);
|
|
|
|
}
|
2013-03-04 23:12:17 +01:00
|
|
|
}
|
|
|
|
|
2013-03-25 20:28:24 +01:00
|
|
|
extern const int vp9_coef_bands8x8[64];
|
2013-02-19 19:12:00 +01:00
|
|
|
extern const int vp9_coef_bands4x4[16];
|
2013-05-09 19:47:58 +02:00
|
|
|
extern const uint8_t vp9_coefband_trans_8x8plus[22];
|
|
|
|
extern const uint8_t vp9_coefband_trans_4x4[22];
|
|
|
|
|
|
|
|
// 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
|
|
|
|
|
|
|
|
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];
|
2013-02-14 21:27:25 +01:00
|
|
|
}
|
2013-05-09 19:47:58 +02:00
|
|
|
|
2013-03-27 00:46:09 +01:00
|
|
|
extern int vp9_get_coef_context(const int *scan, const int *neighbors,
|
|
|
|
int nb_pad, uint8_t *token_cache, int c, int l);
|
|
|
|
const int *vp9_get_coef_neighbors_handle(const int *scan, int *pad);
|
2013-02-19 19:12:00 +01:00
|
|
|
|
Refinements on modelcoef expt to reduce storage
Uses more aggrerssive interpolation to reduce storage for the
model tables by almost more than half. Only 48 lists of probs are
stored (as opposed to 128 before), corresponding to ONE_NODE
probabilities of:
1,
3, 7, 11, ..., 115, 119,
127, 135, ..., 247, 255.
Besides, only 1 table is used as opposed to 2 before. So the overall
memory needed for the tables is just 48 * 8 = 384 bytes.
The table currently used is based on a new Pareto distribution with
heavier tail than a generalized Gaussian - which improves results on
derf by about 0.1% over a single table Generaized Gaussian.
Results overall on derfraw300 is -0.14%.
Change-Id: I19bd03559cbf5894a9f8594b8023dcc3e546f6bd
2013-05-20 22:54:39 +02:00
|
|
|
|
2013-05-22 16:28:29 +02:00
|
|
|
// 128 lists of probabilities are stored for the following ONE node probs:
|
|
|
|
// 1, 3, 5, 7, ..., 253, 255
|
Refinements on modelcoef expt to reduce storage
Uses more aggrerssive interpolation to reduce storage for the
model tables by almost more than half. Only 48 lists of probs are
stored (as opposed to 128 before), corresponding to ONE_NODE
probabilities of:
1,
3, 7, 11, ..., 115, 119,
127, 135, ..., 247, 255.
Besides, only 1 table is used as opposed to 2 before. So the overall
memory needed for the tables is just 48 * 8 = 384 bytes.
The table currently used is based on a new Pareto distribution with
heavier tail than a generalized Gaussian - which improves results on
derf by about 0.1% over a single table Generaized Gaussian.
Results overall on derfraw300 is -0.14%.
Change-Id: I19bd03559cbf5894a9f8594b8023dcc3e546f6bd
2013-05-20 22:54:39 +02:00
|
|
|
// In between probabilities are interpolated linearly
|
|
|
|
|
2013-05-22 16:28:29 +02:00
|
|
|
#define COEFPROB_MODELS 128
|
2013-03-13 19:03:17 +01:00
|
|
|
|
2013-05-17 15:40:25 +02:00
|
|
|
#define UNCONSTRAINED_NODES 3
|
|
|
|
#define MODEL_NODES (ENTROPY_NODES - UNCONSTRAINED_NODES)
|
|
|
|
#define PIVOT_NODE 2 // which node is pivot
|
2013-03-13 19:03:17 +01:00
|
|
|
|
|
|
|
typedef vp9_prob vp9_coeff_probs_model[REF_TYPES][COEF_BANDS]
|
2013-05-17 15:40:25 +02:00
|
|
|
[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];
|
|
|
|
extern void vp9_full_to_model_counts(
|
|
|
|
vp9_coeff_count_model *model_count, vp9_coeff_count *full_count);
|
|
|
|
|
2013-05-22 16:28:29 +02:00
|
|
|
void vp9_model_to_full_probs(const vp9_prob *model, vp9_prob *full);
|
2013-05-17 15:40:25 +02:00
|
|
|
|
|
|
|
void vp9_model_to_full_probs_sb(
|
|
|
|
vp9_prob model[COEF_BANDS][PREV_COEF_CONTEXTS][UNCONSTRAINED_NODES],
|
|
|
|
vp9_prob full[COEF_BANDS][PREV_COEF_CONTEXTS][ENTROPY_NODES]);
|
|
|
|
|
2013-03-13 19:03:17 +01:00
|
|
|
extern const vp9_prob vp9_modelcoefprobs[COEFPROB_MODELS][ENTROPY_NODES - 1];
|
|
|
|
|
2013-04-22 23:08:41 +02:00
|
|
|
static INLINE const int* get_scan_4x4(TX_TYPE tx_type) {
|
|
|
|
switch (tx_type) {
|
|
|
|
case ADST_DCT:
|
|
|
|
return vp9_row_scan_4x4;
|
|
|
|
case DCT_ADST:
|
|
|
|
return vp9_col_scan_4x4;
|
|
|
|
default:
|
|
|
|
return vp9_default_zig_zag1d_4x4;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static INLINE const int* get_scan_8x8(TX_TYPE tx_type) {
|
|
|
|
switch (tx_type) {
|
|
|
|
case ADST_DCT:
|
|
|
|
return vp9_row_scan_8x8;
|
|
|
|
case DCT_ADST:
|
|
|
|
return vp9_col_scan_8x8;
|
|
|
|
default:
|
|
|
|
return vp9_default_zig_zag1d_8x8;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static INLINE const int* get_scan_16x16(TX_TYPE tx_type) {
|
|
|
|
switch (tx_type) {
|
|
|
|
case ADST_DCT:
|
|
|
|
return vp9_row_scan_16x16;
|
|
|
|
case DCT_ADST:
|
|
|
|
return vp9_col_scan_16x16;
|
|
|
|
default:
|
|
|
|
return vp9_default_zig_zag1d_16x16;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-03-13 19:03:17 +01:00
|
|
|
#include "vp9/common/vp9_coefupdateprobs.h"
|
|
|
|
|
2012-12-19 00:31:19 +01:00
|
|
|
#endif // VP9_COMMON_VP9_ENTROPY_H_
|