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
|
|
|
*/
|
|
|
|
|
2013-06-15 00:11:18 +02:00
|
|
|
#include "vpx_mem/vpx_mem.h"
|
|
|
|
#include "vpx_ports/mem.h"
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-11-27 22:59:17 +01:00
|
|
|
#include "vp9/common/vp9_blockd.h"
|
2013-04-09 19:15:10 +02:00
|
|
|
#include "vp9/common/vp9_common.h"
|
2012-11-27 22:59:17 +01:00
|
|
|
#include "vp9/common/vp9_seg_common.h"
|
2011-10-05 12:26:00 +02:00
|
|
|
|
2013-07-25 23:13:44 +02:00
|
|
|
#include "vp9/decoder/vp9_dboolhuff.h"
|
2013-06-15 00:11:18 +02:00
|
|
|
#include "vp9/decoder/vp9_detokenize.h"
|
|
|
|
#include "vp9/decoder/vp9_onyxd_int.h"
|
2013-07-25 23:13:44 +02:00
|
|
|
#include "vp9/decoder/vp9_treereader.h"
|
2013-06-15 00:11:18 +02:00
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
#define EOB_CONTEXT_NODE 0
|
|
|
|
#define ZERO_CONTEXT_NODE 1
|
|
|
|
#define ONE_CONTEXT_NODE 2
|
|
|
|
#define LOW_VAL_CONTEXT_NODE 3
|
|
|
|
#define TWO_CONTEXT_NODE 4
|
|
|
|
#define THREE_CONTEXT_NODE 5
|
|
|
|
#define HIGH_LOW_CONTEXT_NODE 6
|
|
|
|
#define CAT_ONE_CONTEXT_NODE 7
|
|
|
|
#define CAT_THREEFOUR_CONTEXT_NODE 8
|
|
|
|
#define CAT_THREE_CONTEXT_NODE 9
|
|
|
|
#define CAT_FIVE_CONTEXT_NODE 10
|
|
|
|
|
2011-07-25 23:11:24 +02:00
|
|
|
#define CAT1_MIN_VAL 5
|
|
|
|
#define CAT2_MIN_VAL 7
|
|
|
|
#define CAT3_MIN_VAL 11
|
|
|
|
#define CAT4_MIN_VAL 19
|
|
|
|
#define CAT5_MIN_VAL 35
|
|
|
|
#define CAT6_MIN_VAL 67
|
|
|
|
#define CAT1_PROB0 159
|
|
|
|
#define CAT2_PROB0 145
|
|
|
|
#define CAT2_PROB1 165
|
|
|
|
|
|
|
|
#define CAT3_PROB0 140
|
|
|
|
#define CAT3_PROB1 148
|
|
|
|
#define CAT3_PROB2 173
|
|
|
|
|
|
|
|
#define CAT4_PROB0 135
|
|
|
|
#define CAT4_PROB1 140
|
|
|
|
#define CAT4_PROB2 155
|
|
|
|
#define CAT4_PROB3 176
|
|
|
|
|
|
|
|
#define CAT5_PROB0 130
|
|
|
|
#define CAT5_PROB1 134
|
|
|
|
#define CAT5_PROB2 141
|
|
|
|
#define CAT5_PROB3 157
|
|
|
|
#define CAT5_PROB4 180
|
|
|
|
|
2012-12-19 00:31:19 +01:00
|
|
|
static const vp9_prob cat6_prob[15] = {
|
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
|
|
|
254, 254, 254, 252, 249, 243, 230, 196, 177, 153, 140, 133, 130, 129, 0
|
|
|
|
};
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-05-23 12:08:00 +02:00
|
|
|
DECLARE_ALIGNED(16, extern const uint8_t,
|
|
|
|
vp9_pt_energy_class[MAX_ENTROPY_TOKENS]);
|
2013-05-17 15:40:25 +02:00
|
|
|
#define INCREMENT_COUNT(token) \
|
|
|
|
do { \
|
|
|
|
coef_counts[type][ref][band][pt] \
|
|
|
|
[token >= TWO_TOKEN ? \
|
|
|
|
(token == DCT_EOB_TOKEN ? DCT_EOB_MODEL_TOKEN : TWO_TOKEN) : \
|
|
|
|
token]++; \
|
2013-05-23 12:08:00 +02:00
|
|
|
token_cache[scan[c]] = vp9_pt_energy_class[token]; \
|
2013-05-17 15:40:25 +02:00
|
|
|
} while (0)
|
2012-11-17 19:35:47 +01:00
|
|
|
|
2013-03-27 22:03:56 +01:00
|
|
|
#define WRITE_COEF_CONTINUE(val, token) \
|
|
|
|
{ \
|
2013-04-30 02:38:25 +02:00
|
|
|
qcoeff_ptr[scan[c]] = vp9_read_and_apply_sign(r, val) * \
|
2013-07-29 23:35:55 +02:00
|
|
|
dq[c > 0] / (1 + (tx_size == TX_32X32)); \
|
2013-03-27 22:03:56 +01:00
|
|
|
INCREMENT_COUNT(token); \
|
|
|
|
c++; \
|
|
|
|
continue; \
|
2013-02-20 19:16:24 +01:00
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-08-03 02:03:14 +02:00
|
|
|
#define ADJUST_COEF(prob, bits_count) \
|
|
|
|
do { \
|
2013-04-17 00:49:10 +02:00
|
|
|
if (vp9_read(r, prob)) \
|
2013-03-27 22:03:56 +01:00
|
|
|
val += 1 << bits_count; \
|
2012-07-14 00:21:29 +02:00
|
|
|
} while (0);
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-07-24 02:02:08 +02:00
|
|
|
static int decode_coefs(VP9_COMMON *cm, const MACROBLOCKD *xd,
|
2013-04-17 00:49:10 +02:00
|
|
|
vp9_reader *r, int block_idx,
|
2013-03-06 00:18:06 +01:00
|
|
|
PLANE_TYPE type, int seg_eob, int16_t *qcoeff_ptr,
|
2013-07-29 23:35:55 +02:00
|
|
|
TX_SIZE tx_size, const int16_t *dq,
|
2013-04-29 19:37:25 +02:00
|
|
|
ENTROPY_CONTEXT *A, ENTROPY_CONTEXT *L) {
|
2013-07-24 02:02:08 +02:00
|
|
|
FRAME_CONTEXT *const fc = &cm->fc;
|
|
|
|
FRAME_COUNTS *const counts = &cm->counts;
|
2013-09-11 19:45:44 +02:00
|
|
|
const int ref = is_inter_block(&xd->this_mi->mbmi);
|
2013-08-27 23:17:53 +02:00
|
|
|
int band, c = 0;
|
2013-07-25 23:13:44 +02:00
|
|
|
vp9_prob (*coef_probs)[PREV_COEF_CONTEXTS][UNCONSTRAINED_NODES] =
|
2013-07-29 23:35:55 +02:00
|
|
|
fc->coef_probs[tx_size][type][ref];
|
2013-05-17 15:40:25 +02:00
|
|
|
vp9_prob coef_probs_full[COEF_BANDS][PREV_COEF_CONTEXTS][ENTROPY_NODES];
|
2013-07-25 23:13:44 +02:00
|
|
|
uint8_t load_map[COEF_BANDS][PREV_COEF_CONTEXTS] = { { 0 } };
|
2012-12-08 01:09:59 +01:00
|
|
|
vp9_prob *prob;
|
2013-07-29 23:35:55 +02:00
|
|
|
vp9_coeff_count_model *coef_counts = counts->coef[tx_size];
|
2013-07-01 20:36:07 +02:00
|
|
|
const int16_t *scan, *nb;
|
2013-08-08 23:52:39 +02:00
|
|
|
const uint8_t *band_translate;
|
2013-08-27 23:17:53 +02:00
|
|
|
uint8_t token_cache[1024];
|
|
|
|
int pt = get_entropy_context(xd, tx_size, type, block_idx, A, L,
|
|
|
|
&scan, &band_translate);
|
2013-07-01 19:40:00 +02:00
|
|
|
nb = vp9_get_coef_neighbors_handle(scan);
|
2013-03-27 00:46:09 +01:00
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
while (1) {
|
|
|
|
int val;
|
|
|
|
const uint8_t *cat6 = cat6_prob;
|
2013-02-23 02:27:34 +01:00
|
|
|
if (c >= seg_eob)
|
|
|
|
break;
|
2013-03-28 18:42:23 +01:00
|
|
|
if (c)
|
2013-07-01 19:40:00 +02:00
|
|
|
pt = get_coef_context(nb, token_cache, c);
|
2013-05-09 19:47:58 +02:00
|
|
|
band = get_coef_band(band_translate, c);
|
2013-05-17 15:40:25 +02:00
|
|
|
prob = coef_probs[band][pt];
|
2013-07-29 23:35:55 +02:00
|
|
|
counts->eob_branch[tx_size][type][ref][band][pt]++;
|
2013-04-22 19:58:49 +02:00
|
|
|
if (!vp9_read(r, prob[EOB_CONTEXT_NODE]))
|
|
|
|
break;
|
2013-03-28 18:42:23 +01:00
|
|
|
|
2012-08-03 02:03:14 +02:00
|
|
|
SKIP_START:
|
2013-02-23 02:27:34 +01:00
|
|
|
if (c >= seg_eob)
|
|
|
|
break;
|
2013-03-28 18:42:23 +01:00
|
|
|
if (c)
|
2013-07-01 19:40:00 +02:00
|
|
|
pt = get_coef_context(nb, token_cache, c);
|
2013-05-09 19:47:58 +02:00
|
|
|
band = get_coef_band(band_translate, c);
|
2013-05-17 15:40:25 +02:00
|
|
|
prob = coef_probs[band][pt];
|
2013-05-09 19:47:58 +02:00
|
|
|
|
2013-04-17 00:49:10 +02:00
|
|
|
if (!vp9_read(r, prob[ZERO_CONTEXT_NODE])) {
|
2012-11-17 19:35:47 +01:00
|
|
|
INCREMENT_COUNT(ZERO_TOKEN);
|
2012-07-14 00:21:29 +02:00
|
|
|
++c;
|
|
|
|
goto SKIP_START;
|
2013-05-08 19:04:14 +02:00
|
|
|
}
|
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
// ONE_CONTEXT_NODE_0_
|
2013-04-17 00:49:10 +02:00
|
|
|
if (!vp9_read(r, prob[ONE_CONTEXT_NODE])) {
|
2012-11-17 20:07:23 +01:00
|
|
|
WRITE_COEF_CONTINUE(1, ONE_TOKEN);
|
2012-07-14 00:21:29 +02:00
|
|
|
}
|
2013-05-17 15:40:25 +02:00
|
|
|
// Load full probabilities if not already loaded
|
|
|
|
if (!load_map[band][pt]) {
|
2013-05-22 16:28:29 +02:00
|
|
|
vp9_model_to_full_probs(coef_probs[band][pt],
|
2013-05-17 15:40:25 +02:00
|
|
|
coef_probs_full[band][pt]);
|
|
|
|
load_map[band][pt] = 1;
|
|
|
|
}
|
|
|
|
prob = coef_probs_full[band][pt];
|
2012-07-14 00:21:29 +02:00
|
|
|
// LOW_VAL_CONTEXT_NODE_0_
|
2013-04-17 00:49:10 +02:00
|
|
|
if (!vp9_read(r, prob[LOW_VAL_CONTEXT_NODE])) {
|
|
|
|
if (!vp9_read(r, prob[TWO_CONTEXT_NODE])) {
|
2012-11-17 19:35:47 +01:00
|
|
|
WRITE_COEF_CONTINUE(2, TWO_TOKEN);
|
2012-07-14 00:21:29 +02:00
|
|
|
}
|
2013-04-17 00:49:10 +02:00
|
|
|
if (!vp9_read(r, prob[THREE_CONTEXT_NODE])) {
|
2012-11-17 19:35:47 +01:00
|
|
|
WRITE_COEF_CONTINUE(3, THREE_TOKEN);
|
2012-07-14 00:21:29 +02:00
|
|
|
}
|
2012-11-17 19:35:47 +01:00
|
|
|
WRITE_COEF_CONTINUE(4, FOUR_TOKEN);
|
2012-07-14 00:21:29 +02:00
|
|
|
}
|
|
|
|
// HIGH_LOW_CONTEXT_NODE_0_
|
2013-04-17 00:49:10 +02:00
|
|
|
if (!vp9_read(r, prob[HIGH_LOW_CONTEXT_NODE])) {
|
|
|
|
if (!vp9_read(r, prob[CAT_ONE_CONTEXT_NODE])) {
|
2012-07-14 00:21:29 +02:00
|
|
|
val = CAT1_MIN_VAL;
|
|
|
|
ADJUST_COEF(CAT1_PROB0, 0);
|
2012-11-17 19:35:47 +01:00
|
|
|
WRITE_COEF_CONTINUE(val, DCT_VAL_CATEGORY1);
|
2012-07-14 00:21:29 +02:00
|
|
|
}
|
|
|
|
val = CAT2_MIN_VAL;
|
|
|
|
ADJUST_COEF(CAT2_PROB1, 1);
|
|
|
|
ADJUST_COEF(CAT2_PROB0, 0);
|
2012-11-17 19:35:47 +01:00
|
|
|
WRITE_COEF_CONTINUE(val, DCT_VAL_CATEGORY2);
|
2012-07-10 18:36:56 +02:00
|
|
|
}
|
2012-07-14 00:21:29 +02:00
|
|
|
// CAT_THREEFOUR_CONTEXT_NODE_0_
|
2013-04-17 00:49:10 +02:00
|
|
|
if (!vp9_read(r, prob[CAT_THREEFOUR_CONTEXT_NODE])) {
|
|
|
|
if (!vp9_read(r, prob[CAT_THREE_CONTEXT_NODE])) {
|
2012-07-14 00:21:29 +02:00
|
|
|
val = CAT3_MIN_VAL;
|
|
|
|
ADJUST_COEF(CAT3_PROB2, 2);
|
|
|
|
ADJUST_COEF(CAT3_PROB1, 1);
|
|
|
|
ADJUST_COEF(CAT3_PROB0, 0);
|
2012-11-17 19:35:47 +01:00
|
|
|
WRITE_COEF_CONTINUE(val, DCT_VAL_CATEGORY3);
|
2012-07-14 00:21:29 +02:00
|
|
|
}
|
|
|
|
val = CAT4_MIN_VAL;
|
|
|
|
ADJUST_COEF(CAT4_PROB3, 3);
|
|
|
|
ADJUST_COEF(CAT4_PROB2, 2);
|
|
|
|
ADJUST_COEF(CAT4_PROB1, 1);
|
|
|
|
ADJUST_COEF(CAT4_PROB0, 0);
|
2012-11-17 19:35:47 +01:00
|
|
|
WRITE_COEF_CONTINUE(val, DCT_VAL_CATEGORY4);
|
2012-07-14 00:21:29 +02:00
|
|
|
}
|
|
|
|
// CAT_FIVE_CONTEXT_NODE_0_:
|
2013-04-17 00:49:10 +02:00
|
|
|
if (!vp9_read(r, prob[CAT_FIVE_CONTEXT_NODE])) {
|
2012-07-14 00:21:29 +02:00
|
|
|
val = CAT5_MIN_VAL;
|
|
|
|
ADJUST_COEF(CAT5_PROB4, 4);
|
|
|
|
ADJUST_COEF(CAT5_PROB3, 3);
|
|
|
|
ADJUST_COEF(CAT5_PROB2, 2);
|
|
|
|
ADJUST_COEF(CAT5_PROB1, 1);
|
|
|
|
ADJUST_COEF(CAT5_PROB0, 0);
|
2012-11-17 19:35:47 +01:00
|
|
|
WRITE_COEF_CONTINUE(val, DCT_VAL_CATEGORY5);
|
2012-07-14 00:21:29 +02:00
|
|
|
}
|
|
|
|
val = 0;
|
|
|
|
while (*cat6) {
|
2013-04-17 00:49:10 +02:00
|
|
|
val = (val << 1) | vp9_read(r, *cat6++);
|
2012-07-14 00:21:29 +02:00
|
|
|
}
|
|
|
|
val += CAT6_MIN_VAL;
|
2012-11-17 19:35:47 +01:00
|
|
|
WRITE_COEF_CONTINUE(val, DCT_VAL_CATEGORY6);
|
2012-07-14 00:21:29 +02:00
|
|
|
}
|
2012-06-25 21:26:09 +02:00
|
|
|
|
2013-04-22 19:58:49 +02:00
|
|
|
if (c < seg_eob)
|
2013-05-17 15:40:25 +02:00
|
|
|
coef_counts[type][ref][band][pt][DCT_EOB_MODEL_TOKEN]++;
|
2012-11-17 19:18:41 +01:00
|
|
|
|
2013-04-29 19:37:25 +02:00
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
return c;
|
2012-07-10 18:36:56 +02:00
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-04-09 19:15:10 +02:00
|
|
|
struct decode_block_args {
|
|
|
|
VP9D_COMP *pbi;
|
2013-04-17 00:49:10 +02:00
|
|
|
vp9_reader *r;
|
2013-04-09 19:15:10 +02:00
|
|
|
int *eobtotal;
|
|
|
|
};
|
2013-06-15 00:11:18 +02:00
|
|
|
|
2013-08-26 20:33:16 +02:00
|
|
|
static void decode_block(int plane, int block, BLOCK_SIZE plane_bsize,
|
2013-08-16 02:03:03 +02:00
|
|
|
TX_SIZE tx_size, void *argv) {
|
2013-04-09 19:15:10 +02:00
|
|
|
const struct decode_block_args* const arg = argv;
|
2013-04-06 00:54:59 +02:00
|
|
|
|
|
|
|
// find the maximum eob for this transform size, adjusted by segment
|
2013-06-15 00:11:18 +02:00
|
|
|
MACROBLOCKD *xd = &arg->pbi->mb;
|
2013-08-14 20:20:33 +02:00
|
|
|
struct segmentation *seg = &arg->pbi->common.seg;
|
2013-06-15 00:11:18 +02:00
|
|
|
struct macroblockd_plane* pd = &xd->plane[plane];
|
2013-09-11 19:45:44 +02:00
|
|
|
const int segment_id = xd->this_mi->mbmi.segment_id;
|
2013-08-27 23:17:53 +02:00
|
|
|
const int seg_eob = get_tx_eob(seg, segment_id, tx_size);
|
2013-08-21 20:55:04 +02:00
|
|
|
int aoff, loff, eob;
|
|
|
|
|
|
|
|
txfrm_block_to_raster_xy(plane_bsize, tx_size, block, &aoff, &loff);
|
|
|
|
|
|
|
|
eob = decode_coefs(&arg->pbi->common, xd, arg->r, block,
|
|
|
|
pd->plane_type, seg_eob, BLOCK_OFFSET(pd->qcoeff, block),
|
|
|
|
tx_size, pd->dequant,
|
|
|
|
pd->above_context + aoff, pd->left_context + loff);
|
|
|
|
|
|
|
|
set_contexts(xd, pd, plane_bsize, tx_size, eob > 0, aoff, loff);
|
2013-04-06 00:54:59 +02:00
|
|
|
|
2013-06-15 00:11:18 +02:00
|
|
|
pd->eobs[block] = eob;
|
|
|
|
*arg->eobtotal += eob;
|
2013-03-04 23:12:17 +01:00
|
|
|
}
|
|
|
|
|
2013-08-26 20:33:16 +02:00
|
|
|
int vp9_decode_tokens(VP9D_COMP *pbi, vp9_reader *r, BLOCK_SIZE bsize) {
|
2013-04-09 19:15:10 +02:00
|
|
|
int eobtotal = 0;
|
2013-06-15 00:11:18 +02:00
|
|
|
struct decode_block_args args = {pbi, r, &eobtotal};
|
|
|
|
foreach_transformed_block(&pbi->mb, bsize, decode_block, &args);
|
2013-04-09 19:15:10 +02:00
|
|
|
return eobtotal;
|
2012-07-11 02:23:38 +02:00
|
|
|
}
|