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_BLOCKD_H_
|
|
|
|
#define VP9_COMMON_VP9_BLOCKD_H_
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-12-23 16:20:10 +01:00
|
|
|
#include "./vpx_config.h"
|
2013-07-10 21:29:43 +02:00
|
|
|
|
|
|
|
#include "vpx_ports/mem.h"
|
2010-05-18 17:58:33 +02:00
|
|
|
#include "vpx_scale/yv12config.h"
|
2013-07-10 21:29:43 +02:00
|
|
|
|
|
|
|
#include "vp9/common/vp9_common.h"
|
|
|
|
#include "vp9/common/vp9_common_data.h"
|
|
|
|
#include "vp9/common/vp9_enums.h"
|
2013-10-04 03:55:21 +02:00
|
|
|
#include "vp9/common/vp9_filter.h"
|
2012-11-28 19:41:40 +01:00
|
|
|
#include "vp9/common/vp9_mv.h"
|
2013-08-09 23:07:09 +02:00
|
|
|
#include "vp9/common/vp9_scale.h"
|
2013-07-10 21:29:43 +02:00
|
|
|
#include "vp9/common/vp9_seg_common.h"
|
2012-11-28 19:41:40 +01:00
|
|
|
#include "vp9/common/vp9_treecoder.h"
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-06-03 19:39:40 +02:00
|
|
|
#define BLOCK_SIZE_GROUPS 4
|
2012-03-19 19:02:04 +01:00
|
|
|
#define MBSKIP_CONTEXTS 3
|
|
|
|
|
2010-10-28 01:04:02 +02:00
|
|
|
/* Segment Feature Masks */
|
2013-04-19 16:40:36 +02:00
|
|
|
#define MAX_MV_REF_CANDIDATES 2
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-06-06 22:44:34 +02:00
|
|
|
#define INTRA_INTER_CONTEXTS 4
|
|
|
|
#define COMP_INTER_CONTEXTS 5
|
|
|
|
#define REF_CONTEXTS 5
|
|
|
|
|
2013-02-20 20:36:31 +01:00
|
|
|
typedef enum {
|
2012-10-15 00:29:56 +02:00
|
|
|
PLANE_TYPE_Y_WITH_DC,
|
2013-02-15 21:09:05 +01:00
|
|
|
PLANE_TYPE_UV,
|
2012-10-15 00:29:56 +02:00
|
|
|
} PLANE_TYPE;
|
2011-02-23 22:37:08 +01:00
|
|
|
|
2010-08-31 16:49:57 +02:00
|
|
|
typedef char ENTROPY_CONTEXT;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-04-23 19:12:18 +02:00
|
|
|
typedef char PARTITION_CONTEXT;
|
|
|
|
|
2013-04-17 00:30:28 +02:00
|
|
|
static INLINE int combine_entropy_contexts(ENTROPY_CONTEXT a,
|
|
|
|
ENTROPY_CONTEXT b) {
|
|
|
|
return (a != 0) + (b != 0);
|
|
|
|
}
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
typedef enum {
|
|
|
|
KEY_FRAME = 0,
|
2013-06-03 19:39:40 +02:00
|
|
|
INTER_FRAME = 1,
|
2013-10-19 02:44:19 +02:00
|
|
|
FRAME_TYPES,
|
2010-05-18 17:58:33 +02:00
|
|
|
} FRAME_TYPE;
|
|
|
|
|
2013-02-27 20:17:38 +01:00
|
|
|
typedef enum {
|
2013-05-09 20:37:51 +02:00
|
|
|
DC_PRED, // Average of above and left pixels
|
|
|
|
V_PRED, // Vertical
|
|
|
|
H_PRED, // Horizontal
|
|
|
|
D45_PRED, // Directional 45 deg = round(arctan(1/1) * 180/pi)
|
|
|
|
D135_PRED, // Directional 135 deg = 180 - 45
|
|
|
|
D117_PRED, // Directional 117 deg = 180 - 63
|
|
|
|
D153_PRED, // Directional 153 deg = 180 - 27
|
2013-08-24 02:33:48 +02:00
|
|
|
D207_PRED, // Directional 207 deg = 180 + 27
|
2013-05-09 20:37:51 +02:00
|
|
|
D63_PRED, // Directional 63 deg = round(arctan(2/1) * 180/pi)
|
|
|
|
TM_PRED, // True-motion
|
2012-07-14 00:21:29 +02:00
|
|
|
NEARESTMV,
|
|
|
|
NEARMV,
|
|
|
|
ZEROMV,
|
|
|
|
NEWMV,
|
|
|
|
MB_MODE_COUNT
|
2010-05-18 17:58:33 +02:00
|
|
|
} MB_PREDICTION_MODE;
|
|
|
|
|
2013-04-24 21:14:58 +02:00
|
|
|
static INLINE int is_inter_mode(MB_PREDICTION_MODE mode) {
|
2013-05-30 21:49:38 +02:00
|
|
|
return mode >= NEARESTMV && mode <= NEWMV;
|
2013-04-24 21:14:58 +02:00
|
|
|
}
|
|
|
|
|
2013-08-23 03:40:34 +02:00
|
|
|
#define INTRA_MODES (TM_PRED + 1)
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-08-23 03:40:34 +02:00
|
|
|
#define INTER_MODES (1 + NEWMV - NEARESTMV)
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-11-05 20:58:57 +01:00
|
|
|
#define INTER_OFFSET(mode) ((mode) - NEARESTMV)
|
|
|
|
|
2013-07-18 02:07:32 +02:00
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
/* For keyframes, intra block modes are predicted by the (already decoded)
|
|
|
|
modes for the Y blocks to the left and above us; for interframes, there
|
|
|
|
is a single probability table. */
|
|
|
|
|
2013-10-03 02:05:31 +02:00
|
|
|
typedef struct {
|
2013-07-03 01:51:57 +02:00
|
|
|
MB_PREDICTION_MODE as_mode;
|
2013-02-09 04:46:36 +01:00
|
|
|
int_mv as_mv[2]; // first, second inter predictor motion vectors
|
2013-10-03 02:05:31 +02:00
|
|
|
} b_mode_info;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
typedef enum {
|
2012-11-07 15:50:25 +01:00
|
|
|
NONE = -1,
|
2012-07-14 00:21:29 +02:00
|
|
|
INTRA_FRAME = 0,
|
|
|
|
LAST_FRAME = 1,
|
|
|
|
GOLDEN_FRAME = 2,
|
|
|
|
ALTREF_FRAME = 3,
|
|
|
|
MAX_REF_FRAMES = 4
|
2010-05-18 17:58:33 +02:00
|
|
|
} MV_REFERENCE_FRAME;
|
|
|
|
|
2013-08-26 20:33:16 +02:00
|
|
|
static INLINE int b_width_log2(BLOCK_SIZE sb_type) {
|
2013-07-10 16:19:09 +02:00
|
|
|
return b_width_log2_lookup[sb_type];
|
2013-04-10 06:28:27 +02:00
|
|
|
}
|
2013-08-26 20:33:16 +02:00
|
|
|
static INLINE int b_height_log2(BLOCK_SIZE sb_type) {
|
2013-07-10 16:19:09 +02:00
|
|
|
return b_height_log2_lookup[sb_type];
|
2013-04-10 06:28:27 +02:00
|
|
|
}
|
2013-01-06 03:20:25 +01:00
|
|
|
|
2013-08-26 20:33:16 +02:00
|
|
|
static INLINE int mi_width_log2(BLOCK_SIZE sb_type) {
|
2013-07-10 16:26:08 +02:00
|
|
|
return mi_width_log2_lookup[sb_type];
|
2013-04-11 21:12:11 +02:00
|
|
|
}
|
|
|
|
|
2013-08-26 20:33:16 +02:00
|
|
|
static INLINE int mi_height_log2(BLOCK_SIZE sb_type) {
|
2013-07-10 16:26:08 +02:00
|
|
|
return mi_height_log2_lookup[sb_type];
|
2013-04-11 21:12:11 +02:00
|
|
|
}
|
|
|
|
|
2013-08-13 18:47:40 +02:00
|
|
|
// This structure now relates to 8x8 block regions.
|
2012-07-14 00:21:29 +02:00
|
|
|
typedef struct {
|
|
|
|
MB_PREDICTION_MODE mode, uv_mode;
|
2013-06-06 22:44:34 +02:00
|
|
|
MV_REFERENCE_FRAME ref_frame[2];
|
2013-08-28 04:47:53 +02:00
|
|
|
TX_SIZE tx_size;
|
2013-08-13 18:47:40 +02:00
|
|
|
int_mv mv[2]; // for each reference frame used
|
2012-12-04 18:21:05 +01:00
|
|
|
int_mv ref_mvs[MAX_REF_FRAMES][MAX_MV_REF_CANDIDATES];
|
2013-09-20 15:08:53 +02:00
|
|
|
int_mv best_mv[2];
|
2012-08-24 16:44:01 +02:00
|
|
|
|
2013-08-13 18:47:40 +02:00
|
|
|
uint8_t mode_context[MAX_REF_FRAMES];
|
2012-11-12 16:09:25 +01:00
|
|
|
|
2013-08-13 18:47:40 +02:00
|
|
|
unsigned char skip_coeff; // 0=need to decode coeffs, 1=no coefficients
|
|
|
|
unsigned char segment_id; // Segment id for this block.
|
2012-07-14 00:21:29 +02:00
|
|
|
|
2013-08-07 23:45:37 +02:00
|
|
|
// Flags used for prediction status of various bit-stream signals
|
2012-07-14 00:21:29 +02:00
|
|
|
unsigned char seg_id_predicted;
|
|
|
|
|
2013-10-24 02:45:52 +02:00
|
|
|
INTERPOLATION_TYPE interp_filter;
|
2012-06-26 01:23:58 +02:00
|
|
|
|
2013-08-26 20:33:16 +02:00
|
|
|
BLOCK_SIZE sb_type;
|
2010-05-18 17:58:33 +02:00
|
|
|
} MB_MODE_INFO;
|
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
typedef struct {
|
|
|
|
MB_MODE_INFO mbmi;
|
2013-10-03 02:05:31 +02:00
|
|
|
b_mode_info bmi[4];
|
2010-05-18 17:58:33 +02:00
|
|
|
} MODE_INFO;
|
|
|
|
|
2013-08-20 03:39:34 +02:00
|
|
|
static INLINE int is_inter_block(const MB_MODE_INFO *mbmi) {
|
2013-08-03 01:25:33 +02:00
|
|
|
return mbmi->ref_frame[0] > INTRA_FRAME;
|
|
|
|
}
|
|
|
|
|
2013-08-20 03:39:34 +02:00
|
|
|
static INLINE int has_second_ref(const MB_MODE_INFO *mbmi) {
|
|
|
|
return mbmi->ref_frame[1] > INTRA_FRAME;
|
|
|
|
}
|
|
|
|
|
2013-06-22 00:34:29 +02:00
|
|
|
enum mv_precision {
|
|
|
|
MV_PRECISION_Q3,
|
|
|
|
MV_PRECISION_Q4
|
|
|
|
};
|
|
|
|
|
2013-05-16 02:55:08 +02:00
|
|
|
#if CONFIG_ALPHA
|
|
|
|
enum { MAX_MB_PLANE = 4 };
|
|
|
|
#else
|
2013-04-02 23:50:40 +02:00
|
|
|
enum { MAX_MB_PLANE = 3 };
|
2013-05-16 02:55:08 +02:00
|
|
|
#endif
|
2013-04-02 23:50:40 +02:00
|
|
|
|
2013-04-20 00:52:17 +02:00
|
|
|
struct buf_2d {
|
|
|
|
uint8_t *buf;
|
|
|
|
int stride;
|
|
|
|
};
|
|
|
|
|
2013-04-23 17:26:10 +02:00
|
|
|
struct macroblockd_plane {
|
2013-04-02 23:50:40 +02:00
|
|
|
DECLARE_ALIGNED(16, int16_t, qcoeff[64 * 64]);
|
|
|
|
DECLARE_ALIGNED(16, int16_t, dqcoeff[64 * 64]);
|
2013-04-04 21:03:27 +02:00
|
|
|
DECLARE_ALIGNED(16, uint16_t, eobs[256]);
|
2013-04-06 00:54:59 +02:00
|
|
|
PLANE_TYPE plane_type;
|
|
|
|
int subsampling_x;
|
|
|
|
int subsampling_y;
|
2013-04-20 00:52:17 +02:00
|
|
|
struct buf_2d dst;
|
|
|
|
struct buf_2d pre[2];
|
2013-04-24 23:48:17 +02:00
|
|
|
int16_t *dequant;
|
2013-04-29 19:37:25 +02:00
|
|
|
ENTROPY_CONTEXT *above_context;
|
|
|
|
ENTROPY_CONTEXT *left_context;
|
2013-04-02 23:50:40 +02:00
|
|
|
};
|
|
|
|
|
2013-08-10 01:40:05 +02:00
|
|
|
#define BLOCK_OFFSET(x, i) ((x) + (i) * 16)
|
2013-04-02 23:50:40 +02:00
|
|
|
|
2012-10-28 18:38:23 +01:00
|
|
|
typedef struct macroblockd {
|
2013-04-23 17:26:10 +02:00
|
|
|
struct macroblockd_plane plane[MAX_MB_PLANE];
|
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-09 02:49:44 +01:00
|
|
|
struct scale_factors scale_factor[2];
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-09-11 19:45:44 +02:00
|
|
|
MODE_INFO *last_mi;
|
2012-07-14 00:21:29 +02:00
|
|
|
int mode_info_stride;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-09-11 19:45:44 +02:00
|
|
|
// A NULL indicates that the 8x8 is not part of the image
|
|
|
|
MODE_INFO **mi_8x8;
|
|
|
|
MODE_INFO **prev_mi_8x8;
|
2013-10-23 00:22:59 +02:00
|
|
|
MODE_INFO *mi_stream;
|
2013-09-11 19:45:44 +02:00
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
int up_available;
|
|
|
|
int left_available;
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
/* Distance of MB away from frame edges */
|
|
|
|
int mb_to_left_edge;
|
|
|
|
int mb_to_right_edge;
|
|
|
|
int mb_to_top_edge;
|
|
|
|
int mb_to_bottom_edge;
|
|
|
|
|
2013-02-12 00:58:22 +01:00
|
|
|
int lossless;
|
2012-11-25 04:33:58 +01:00
|
|
|
/* Inverse transform function pointers. */
|
2013-10-12 03:27:12 +02:00
|
|
|
void (*itxm_add)(const int16_t *input, uint8_t *dest, int stride, int eob);
|
2012-11-25 04:33:58 +01:00
|
|
|
|
Convert subpixel filters to use convolve framework
Update the code to call the new convolution functions to do subpixel
prediction rather than the existing functions. Remove the old C and
assembly code, since it is unused. This causes a 50% performance
reduction on the decoder, but that will be resolved when the asm for
the new functions is available.
There is no consensus for whether 6-tap or 2-tap predictors will be
supported in the final codec, so these filters are implemented in
terms of the 8-tap code, so that quality testing of these modes
can continue. Implementing the lower complexity algorithms is a
simple exercise, should it be necessary.
This code produces slightly better results in the EIGHTTAP_SMOOTH
case, since the filter is now applied in only one direction when
the subpel motion is only in one direction. Like the previous code,
the filtering is skipped entirely on full-pel MVs. This combination
seems to give the best quality gains, but this may be indicative of a
bug in the encoder's filter selection, since the encoder could
achieve the result of skipping the filtering on full-pel by selecting
one of the other filters. This should be revisited.
Quality gains on derf positive on almost all clips. The only clip
that seemed to be hurt at all datarates was football
(-0.115% PSNR average, -0.587% min). Overall averages 0.375% PSNR,
0.347% SSIM.
Change-Id: I7d469716091b1d89b4b08adde5863999319d69ff
2013-01-29 01:59:03 +01:00
|
|
|
struct subpix_fn_table subpix;
|
2012-11-25 04:33:58 +01:00
|
|
|
|
2012-07-14 00:21:29 +02:00
|
|
|
int corrupted;
|
2010-12-16 16:46:31 +01:00
|
|
|
|
2013-07-11 17:18:34 +02:00
|
|
|
unsigned char sb_index; // index of 32x32 block inside the 64x64 block
|
|
|
|
unsigned char mb_index; // index of 16x16 block inside the 32x32 block
|
|
|
|
unsigned char b_index; // index of 8x8 block inside the 16x16 block
|
|
|
|
unsigned char ab_index; // index of 4x4 block inside the 8x8 block
|
|
|
|
|
2012-06-25 21:26:09 +02:00
|
|
|
int q_index;
|
2013-10-24 19:11:07 +02:00
|
|
|
|
2013-10-24 19:43:05 +02:00
|
|
|
/* Y,U,V,(A) */
|
|
|
|
ENTROPY_CONTEXT *above_context[MAX_MB_PLANE];
|
|
|
|
ENTROPY_CONTEXT left_context[MAX_MB_PLANE][16];
|
|
|
|
|
2013-10-24 19:11:07 +02:00
|
|
|
PARTITION_CONTEXT *above_seg_context;
|
|
|
|
PARTITION_CONTEXT left_seg_context[8];
|
2010-05-18 17:58:33 +02:00
|
|
|
} MACROBLOCKD;
|
|
|
|
|
2013-04-23 19:12:18 +02:00
|
|
|
|
|
|
|
|
2013-08-26 20:33:16 +02:00
|
|
|
static BLOCK_SIZE get_subsize(BLOCK_SIZE bsize, PARTITION_TYPE partition) {
|
|
|
|
const BLOCK_SIZE subsize = subsize_lookup[partition][bsize];
|
2013-08-10 02:47:32 +02:00
|
|
|
assert(subsize < BLOCK_SIZES);
|
2013-05-01 18:43:59 +02:00
|
|
|
return subsize;
|
|
|
|
}
|
|
|
|
|
2013-06-26 03:15:42 +02:00
|
|
|
extern const TX_TYPE mode2txfm_map[MB_MODE_COUNT];
|
2012-08-02 18:07:33 +02:00
|
|
|
|
2013-07-24 21:55:45 +02:00
|
|
|
static INLINE TX_TYPE get_tx_type_4x4(PLANE_TYPE plane_type,
|
|
|
|
const MACROBLOCKD *xd, int ib) {
|
2013-10-10 21:11:44 +02:00
|
|
|
const MODE_INFO *const mi = xd->mi_8x8[0];
|
2013-07-24 21:55:45 +02:00
|
|
|
const MB_MODE_INFO *const mbmi = &mi->mbmi;
|
|
|
|
|
|
|
|
if (plane_type != PLANE_TYPE_Y_WITH_DC ||
|
|
|
|
xd->lossless ||
|
2013-08-03 01:25:33 +02:00
|
|
|
is_inter_block(mbmi))
|
2013-02-12 06:14:46 +01:00
|
|
|
return DCT_DCT;
|
2013-06-25 02:56:06 +02:00
|
|
|
|
2013-08-02 20:45:21 +02:00
|
|
|
return mode2txfm_map[mbmi->sb_type < BLOCK_8X8 ?
|
2013-07-03 01:51:57 +02:00
|
|
|
mi->bmi[ib].as_mode : mbmi->mode];
|
2012-10-16 01:41:41 +02:00
|
|
|
}
|
|
|
|
|
2013-07-24 21:55:45 +02:00
|
|
|
static INLINE TX_TYPE get_tx_type_8x8(PLANE_TYPE plane_type,
|
|
|
|
const MACROBLOCKD *xd) {
|
|
|
|
return plane_type == PLANE_TYPE_Y_WITH_DC ?
|
2013-10-10 21:11:44 +02:00
|
|
|
mode2txfm_map[xd->mi_8x8[0]->mbmi.mode] : DCT_DCT;
|
2012-08-02 18:07:33 +02:00
|
|
|
}
|
2012-09-21 23:20:15 +02:00
|
|
|
|
2013-07-24 21:55:45 +02:00
|
|
|
static INLINE TX_TYPE get_tx_type_16x16(PLANE_TYPE plane_type,
|
|
|
|
const MACROBLOCKD *xd) {
|
|
|
|
return plane_type == PLANE_TYPE_Y_WITH_DC ?
|
2013-10-10 21:11:44 +02:00
|
|
|
mode2txfm_map[xd->mi_8x8[0]->mbmi.mode] : DCT_DCT;
|
2012-10-16 01:41:41 +02:00
|
|
|
}
|
|
|
|
|
2013-07-02 02:28:08 +02:00
|
|
|
static void setup_block_dptrs(MACROBLOCKD *xd, int ss_x, int ss_y) {
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < MAX_MB_PLANE; i++) {
|
|
|
|
xd->plane[i].plane_type = i ? PLANE_TYPE_UV : PLANE_TYPE_Y_WITH_DC;
|
|
|
|
xd->plane[i].subsampling_x = i ? ss_x : 0;
|
|
|
|
xd->plane[i].subsampling_y = i ? ss_y : 0;
|
|
|
|
}
|
|
|
|
#if CONFIG_ALPHA
|
|
|
|
// TODO(jkoleszar): Using the Y w/h for now
|
2013-07-09 01:01:01 +02:00
|
|
|
xd->plane[3].subsampling_x = 0;
|
|
|
|
xd->plane[3].subsampling_y = 0;
|
2013-07-02 02:28:08 +02:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2010-05-18 17:58:33 +02:00
|
|
|
|
2013-07-11 01:51:07 +02:00
|
|
|
static INLINE TX_SIZE get_uv_tx_size(const MB_MODE_INFO *mbmi) {
|
2013-08-28 04:47:53 +02:00
|
|
|
return MIN(mbmi->tx_size, max_uv_txsize_lookup[mbmi->sb_type]);
|
2013-02-20 19:16:24 +01:00
|
|
|
}
|
2013-03-26 23:23:30 +01:00
|
|
|
|
2013-08-26 20:33:16 +02:00
|
|
|
static BLOCK_SIZE get_plane_block_size(BLOCK_SIZE bsize,
|
|
|
|
const struct macroblockd_plane *pd) {
|
|
|
|
BLOCK_SIZE bs = ss_size_lookup[bsize][pd->subsampling_x][pd->subsampling_y];
|
2013-08-10 02:47:32 +02:00
|
|
|
assert(bs < BLOCK_SIZES);
|
2013-08-08 00:33:17 +02:00
|
|
|
return bs;
|
|
|
|
}
|
|
|
|
|
2013-08-26 20:33:16 +02:00
|
|
|
static INLINE int plane_block_width(BLOCK_SIZE bsize,
|
2013-05-31 21:30:32 +02:00
|
|
|
const struct macroblockd_plane* plane) {
|
|
|
|
return 4 << (b_width_log2(bsize) - plane->subsampling_x);
|
|
|
|
}
|
|
|
|
|
2013-08-26 20:33:16 +02:00
|
|
|
static INLINE int plane_block_height(BLOCK_SIZE bsize,
|
2013-05-31 21:30:32 +02:00
|
|
|
const struct macroblockd_plane* plane) {
|
|
|
|
return 4 << (b_height_log2(bsize) - plane->subsampling_y);
|
|
|
|
}
|
|
|
|
|
2013-04-09 19:15:10 +02:00
|
|
|
typedef void (*foreach_transformed_block_visitor)(int plane, int block,
|
2013-08-26 20:33:16 +02:00
|
|
|
BLOCK_SIZE plane_bsize,
|
2013-08-16 02:03:03 +02:00
|
|
|
TX_SIZE tx_size,
|
2013-04-09 19:15:10 +02:00
|
|
|
void *arg);
|
2013-06-06 06:14:14 +02:00
|
|
|
|
2013-04-09 19:15:10 +02:00
|
|
|
static INLINE void foreach_transformed_block_in_plane(
|
2013-08-26 20:33:16 +02:00
|
|
|
const MACROBLOCKD *const xd, BLOCK_SIZE bsize, int plane,
|
2013-05-01 01:13:20 +02:00
|
|
|
foreach_transformed_block_visitor visit, void *arg) {
|
2013-08-14 20:39:31 +02:00
|
|
|
const struct macroblockd_plane *const pd = &xd->plane[plane];
|
2013-10-10 21:11:44 +02:00
|
|
|
const MB_MODE_INFO* mbmi = &xd->mi_8x8[0]->mbmi;
|
2013-04-09 19:15:10 +02:00
|
|
|
// block and transform sizes, in number of 4x4 blocks log 2 ("*_b")
|
|
|
|
// 4x4=0, 8x8=2, 16x16=4, 32x32=6, 64x64=8
|
2013-05-07 23:44:12 +02:00
|
|
|
// transform size varies per plane, look it up in a common way.
|
2013-06-10 15:48:58 +02:00
|
|
|
const TX_SIZE tx_size = plane ? get_uv_tx_size(mbmi)
|
2013-08-28 04:47:53 +02:00
|
|
|
: mbmi->tx_size;
|
2013-08-26 20:33:16 +02:00
|
|
|
const BLOCK_SIZE plane_bsize = get_plane_block_size(bsize, pd);
|
2013-08-22 02:16:02 +02:00
|
|
|
const int num_4x4_w = num_4x4_blocks_wide_lookup[plane_bsize];
|
|
|
|
const int num_4x4_h = num_4x4_blocks_high_lookup[plane_bsize];
|
2013-08-20 00:47:24 +02:00
|
|
|
const int step = 1 << (tx_size << 1);
|
2013-04-09 19:15:10 +02:00
|
|
|
int i;
|
|
|
|
|
2013-06-06 15:07:09 +02:00
|
|
|
// If mb_to_right_edge is < 0 we are in a situation in which
|
|
|
|
// the current block size extends into the UMV and we won't
|
|
|
|
// visit the sub blocks that are wholly within the UMV.
|
|
|
|
if (xd->mb_to_right_edge < 0 || xd->mb_to_bottom_edge < 0) {
|
|
|
|
int r, c;
|
2013-08-14 20:39:31 +02:00
|
|
|
|
2013-08-22 02:16:02 +02:00
|
|
|
int max_blocks_wide = num_4x4_w;
|
|
|
|
int max_blocks_high = num_4x4_h;
|
2013-06-06 15:07:09 +02:00
|
|
|
|
|
|
|
// xd->mb_to_right_edge is in units of pixels * 8. This converts
|
|
|
|
// it to 4x4 block sizes.
|
|
|
|
if (xd->mb_to_right_edge < 0)
|
2013-08-14 20:39:31 +02:00
|
|
|
max_blocks_wide += (xd->mb_to_right_edge >> (5 + pd->subsampling_x));
|
2013-06-06 15:07:09 +02:00
|
|
|
|
|
|
|
if (xd->mb_to_bottom_edge < 0)
|
2013-08-14 20:39:31 +02:00
|
|
|
max_blocks_high += (xd->mb_to_bottom_edge >> (5 + pd->subsampling_y));
|
2013-06-06 15:07:09 +02:00
|
|
|
|
|
|
|
i = 0;
|
|
|
|
// Unlike the normal case - in here we have to keep track of the
|
|
|
|
// row and column of the blocks we use so that we know if we are in
|
2013-07-30 19:16:03 +02:00
|
|
|
// the unrestricted motion border.
|
2013-08-22 02:16:02 +02:00
|
|
|
for (r = 0; r < num_4x4_h; r += (1 << tx_size)) {
|
|
|
|
for (c = 0; c < num_4x4_w; c += (1 << tx_size)) {
|
2013-06-06 15:07:09 +02:00
|
|
|
if (r < max_blocks_high && c < max_blocks_wide)
|
2013-08-20 00:47:24 +02:00
|
|
|
visit(plane, i, plane_bsize, tx_size, arg);
|
2013-06-06 15:07:09 +02:00
|
|
|
i += step;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
2013-08-22 02:16:02 +02:00
|
|
|
for (i = 0; i < num_4x4_w * num_4x4_h; i += step)
|
2013-08-20 00:47:24 +02:00
|
|
|
visit(plane, i, plane_bsize, tx_size, arg);
|
2013-04-09 19:15:10 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static INLINE void foreach_transformed_block(
|
2013-08-26 20:33:16 +02:00
|
|
|
const MACROBLOCKD* const xd, BLOCK_SIZE bsize,
|
2013-04-09 19:15:10 +02:00
|
|
|
foreach_transformed_block_visitor visit, void *arg) {
|
|
|
|
int plane;
|
|
|
|
|
2013-08-14 20:39:31 +02:00
|
|
|
for (plane = 0; plane < MAX_MB_PLANE; plane++)
|
|
|
|
foreach_transformed_block_in_plane(xd, bsize, plane, visit, arg);
|
2013-04-09 19:15:10 +02:00
|
|
|
}
|
2013-04-02 23:50:40 +02:00
|
|
|
|
2013-04-11 20:14:31 +02:00
|
|
|
static INLINE void foreach_transformed_block_uv(
|
2013-08-26 20:33:16 +02:00
|
|
|
const MACROBLOCKD* const xd, BLOCK_SIZE bsize,
|
2013-04-11 20:14:31 +02:00
|
|
|
foreach_transformed_block_visitor visit, void *arg) {
|
|
|
|
int plane;
|
|
|
|
|
2013-08-14 20:39:31 +02:00
|
|
|
for (plane = 1; plane < MAX_MB_PLANE; plane++)
|
|
|
|
foreach_transformed_block_in_plane(xd, bsize, plane, visit, arg);
|
2013-04-11 20:14:31 +02:00
|
|
|
}
|
|
|
|
|
2013-08-26 20:33:16 +02:00
|
|
|
static int raster_block_offset(BLOCK_SIZE plane_bsize,
|
2013-08-19 22:20:21 +02:00
|
|
|
int raster_block, int stride) {
|
|
|
|
const int bw = b_width_log2(plane_bsize);
|
|
|
|
const int y = 4 * (raster_block >> bw);
|
|
|
|
const int x = 4 * (raster_block & ((1 << bw) - 1));
|
2013-04-23 17:26:10 +02:00
|
|
|
return y * stride + x;
|
|
|
|
}
|
2013-08-26 20:33:16 +02:00
|
|
|
static int16_t* raster_block_offset_int16(BLOCK_SIZE plane_bsize,
|
2013-08-19 22:20:21 +02:00
|
|
|
int raster_block, int16_t *base) {
|
|
|
|
const int stride = 4 << b_width_log2(plane_bsize);
|
|
|
|
return base + raster_block_offset(plane_bsize, raster_block, stride);
|
2013-04-24 01:22:47 +02:00
|
|
|
}
|
2013-08-26 20:33:16 +02:00
|
|
|
static uint8_t* raster_block_offset_uint8(BLOCK_SIZE plane_bsize,
|
2013-08-19 22:20:21 +02:00
|
|
|
int raster_block, uint8_t *base,
|
|
|
|
int stride) {
|
|
|
|
return base + raster_block_offset(plane_bsize, raster_block, stride);
|
2013-04-23 17:26:10 +02:00
|
|
|
}
|
make buid_inter_predictors block size agnostic (luma)
This commit converts the luma versions of vp9_build_inter_predictors_sb
to use a common function. Update the convolution functions to support
block sizes larger than 16x16, and add a foreach_predicted_block walker.
Next step will be to calculate the UV motion vector and implement SBUV,
then fold in vp9_build_inter16x16_predictors_mb and SPLITMV.
At the 16x16, 32x32, and 64x64 levels implemented in this commit, each
plane is predicted with only a single call to vp9_build_inter_predictor.
This is not yet called for SPLITMV. If the notion of SPLITMV/I8X8/I4X4
goes away, then the prediction block walker can go away, since we'll
always predict the whole bsize in a single step. Implemented using a
block walker at this stage for SPLITMV, as a 4x4 "prediction block size"
within the BLOCK_SIZE_MB16X16 macroblock. It would also support other
rectangular sizes too, if the blocks smaller than 16x16 remain
implemented as a SPLITMV-like thing. Just using 4x4 for now.
There's also a potential to combine with the foreach_transformed_block
walker if the logic for calculating the size of the subsampled
transform is made more straightforward, perhaps as a consequence of
supporing smaller macroblocks than 16x16. Will watch what happens there.
Change-Id: Iddd9973398542216601b630c628b9b7fdee33fe2
2013-04-13 02:19:57 +02:00
|
|
|
|
2013-08-26 20:33:16 +02:00
|
|
|
static int txfrm_block_to_raster_block(BLOCK_SIZE plane_bsize,
|
2013-08-19 22:20:21 +02:00
|
|
|
TX_SIZE tx_size, int block) {
|
|
|
|
const int bwl = b_width_log2(plane_bsize);
|
2013-08-15 20:44:57 +02:00
|
|
|
const int tx_cols_log2 = bwl - tx_size;
|
2013-07-12 20:37:43 +02:00
|
|
|
const int tx_cols = 1 << tx_cols_log2;
|
2013-08-16 02:03:03 +02:00
|
|
|
const int raster_mb = block >> (tx_size << 1);
|
2013-08-15 20:44:57 +02:00
|
|
|
const int x = (raster_mb & (tx_cols - 1)) << tx_size;
|
2013-08-19 22:20:21 +02:00
|
|
|
const int y = (raster_mb >> tx_cols_log2) << tx_size;
|
2013-04-30 18:54:51 +02:00
|
|
|
return x + (y << bwl);
|
|
|
|
}
|
|
|
|
|
2013-08-26 20:33:16 +02:00
|
|
|
static void txfrm_block_to_raster_xy(BLOCK_SIZE plane_bsize,
|
2013-08-19 22:20:21 +02:00
|
|
|
TX_SIZE tx_size, int block,
|
2013-04-30 18:54:51 +02:00
|
|
|
int *x, int *y) {
|
2013-08-19 22:20:21 +02:00
|
|
|
const int bwl = b_width_log2(plane_bsize);
|
2013-08-15 20:44:57 +02:00
|
|
|
const int tx_cols_log2 = bwl - tx_size;
|
2013-07-12 20:37:43 +02:00
|
|
|
const int tx_cols = 1 << tx_cols_log2;
|
2013-08-16 02:03:03 +02:00
|
|
|
const int raster_mb = block >> (tx_size << 1);
|
2013-08-15 20:44:57 +02:00
|
|
|
*x = (raster_mb & (tx_cols - 1)) << tx_size;
|
2013-08-21 20:55:04 +02:00
|
|
|
*y = (raster_mb >> tx_cols_log2) << tx_size;
|
2013-04-30 18:54:51 +02:00
|
|
|
}
|
2013-06-06 15:07:09 +02:00
|
|
|
|
2013-10-31 22:34:21 +01:00
|
|
|
static void extend_for_intra(MACROBLOCKD *xd, BLOCK_SIZE plane_bsize,
|
2013-08-15 20:44:57 +02:00
|
|
|
int plane, int block, TX_SIZE tx_size) {
|
|
|
|
struct macroblockd_plane *const pd = &xd->plane[plane];
|
|
|
|
uint8_t *const buf = pd->dst.buf;
|
|
|
|
const int stride = pd->dst.stride;
|
2013-08-19 22:20:21 +02:00
|
|
|
|
2013-06-06 15:07:09 +02:00
|
|
|
int x, y;
|
2013-08-19 22:20:21 +02:00
|
|
|
txfrm_block_to_raster_xy(plane_bsize, tx_size, block, &x, &y);
|
2013-06-06 15:07:09 +02:00
|
|
|
x = x * 4 - 1;
|
|
|
|
y = y * 4 - 1;
|
|
|
|
// Copy a pixel into the umv if we are in a situation where the block size
|
|
|
|
// extends into the UMV.
|
|
|
|
// TODO(JBB): Should be able to do the full extend in place so we don't have
|
|
|
|
// to do this multiple times.
|
|
|
|
if (xd->mb_to_right_edge < 0) {
|
2013-08-19 22:20:21 +02:00
|
|
|
const int bw = 4 << b_width_log2(plane_bsize);
|
2013-08-15 20:44:57 +02:00
|
|
|
const int umv_border_start = bw + (xd->mb_to_right_edge >>
|
|
|
|
(3 + pd->subsampling_x));
|
2013-06-06 15:07:09 +02:00
|
|
|
|
|
|
|
if (x + bw > umv_border_start)
|
2013-08-15 20:44:57 +02:00
|
|
|
vpx_memset(&buf[y * stride + umv_border_start],
|
|
|
|
buf[y * stride + umv_border_start - 1], bw);
|
2013-06-06 15:07:09 +02:00
|
|
|
}
|
2013-08-15 20:44:57 +02:00
|
|
|
|
2013-06-06 15:07:09 +02:00
|
|
|
if (xd->mb_to_bottom_edge < 0) {
|
2013-10-23 21:33:11 +02:00
|
|
|
if (xd->left_available || x >= 0) {
|
|
|
|
const int bh = 4 << b_height_log2(plane_bsize);
|
|
|
|
const int umv_border_start =
|
|
|
|
bh + (xd->mb_to_bottom_edge >> (3 + pd->subsampling_y));
|
|
|
|
|
|
|
|
if (y + bh > umv_border_start) {
|
|
|
|
const uint8_t c = buf[(umv_border_start - 1) * stride + x];
|
|
|
|
uint8_t *d = &buf[umv_border_start * stride + x];
|
|
|
|
int i;
|
|
|
|
for (i = 0; i < bh; ++i, d += stride)
|
|
|
|
*d = c;
|
|
|
|
}
|
|
|
|
}
|
2013-06-06 15:07:09 +02:00
|
|
|
}
|
|
|
|
}
|
2013-10-31 22:34:21 +01:00
|
|
|
static void set_contexts_on_border(const MACROBLOCKD *xd,
|
2013-08-21 20:55:04 +02:00
|
|
|
struct macroblockd_plane *pd,
|
2013-08-26 20:33:16 +02:00
|
|
|
BLOCK_SIZE plane_bsize,
|
2013-08-21 20:55:04 +02:00
|
|
|
int tx_size_in_blocks, int has_eob,
|
|
|
|
int aoff, int loff,
|
2013-08-03 00:52:26 +02:00
|
|
|
ENTROPY_CONTEXT *A, ENTROPY_CONTEXT *L) {
|
2013-08-20 00:47:24 +02:00
|
|
|
int mi_blocks_wide = num_4x4_blocks_wide_lookup[plane_bsize];
|
|
|
|
int mi_blocks_high = num_4x4_blocks_high_lookup[plane_bsize];
|
2013-06-06 15:07:09 +02:00
|
|
|
int above_contexts = tx_size_in_blocks;
|
|
|
|
int left_contexts = tx_size_in_blocks;
|
|
|
|
int pt;
|
|
|
|
|
|
|
|
// xd->mb_to_right_edge is in units of pixels * 8. This converts
|
|
|
|
// it to 4x4 block sizes.
|
2013-08-03 00:52:26 +02:00
|
|
|
if (xd->mb_to_right_edge < 0)
|
|
|
|
mi_blocks_wide += (xd->mb_to_right_edge >> (5 + pd->subsampling_x));
|
2013-06-06 15:07:09 +02:00
|
|
|
|
2013-08-14 20:39:31 +02:00
|
|
|
if (xd->mb_to_bottom_edge < 0)
|
|
|
|
mi_blocks_high += (xd->mb_to_bottom_edge >> (5 + pd->subsampling_y));
|
|
|
|
|
2013-06-06 15:07:09 +02:00
|
|
|
// this code attempts to avoid copying into contexts that are outside
|
|
|
|
// our border. Any blocks that do are set to 0...
|
|
|
|
if (above_contexts + aoff > mi_blocks_wide)
|
|
|
|
above_contexts = mi_blocks_wide - aoff;
|
|
|
|
|
2013-08-03 00:52:26 +02:00
|
|
|
if (left_contexts + loff > mi_blocks_high)
|
2013-06-06 15:07:09 +02:00
|
|
|
left_contexts = mi_blocks_high - loff;
|
|
|
|
|
|
|
|
for (pt = 0; pt < above_contexts; pt++)
|
2013-08-21 20:55:04 +02:00
|
|
|
A[pt] = has_eob;
|
2013-08-03 00:52:26 +02:00
|
|
|
for (pt = above_contexts; pt < tx_size_in_blocks; pt++)
|
2013-06-06 15:07:09 +02:00
|
|
|
A[pt] = 0;
|
|
|
|
for (pt = 0; pt < left_contexts; pt++)
|
2013-08-21 20:55:04 +02:00
|
|
|
L[pt] = has_eob;
|
2013-08-03 00:52:26 +02:00
|
|
|
for (pt = left_contexts; pt < tx_size_in_blocks; pt++)
|
2013-06-06 15:07:09 +02:00
|
|
|
L[pt] = 0;
|
|
|
|
}
|
|
|
|
|
2013-10-31 22:34:21 +01:00
|
|
|
static void set_contexts(const MACROBLOCKD *xd, struct macroblockd_plane *pd,
|
2013-08-26 20:33:16 +02:00
|
|
|
BLOCK_SIZE plane_bsize, TX_SIZE tx_size,
|
2013-08-21 20:55:04 +02:00
|
|
|
int has_eob, int aoff, int loff) {
|
|
|
|
ENTROPY_CONTEXT *const A = pd->above_context + aoff;
|
|
|
|
ENTROPY_CONTEXT *const L = pd->left_context + loff;
|
|
|
|
const int tx_size_in_blocks = 1 << tx_size;
|
|
|
|
|
|
|
|
if (xd->mb_to_right_edge < 0 || xd->mb_to_bottom_edge < 0) {
|
|
|
|
set_contexts_on_border(xd, pd, plane_bsize, tx_size_in_blocks, has_eob,
|
|
|
|
aoff, loff, A, L);
|
|
|
|
} else {
|
|
|
|
vpx_memset(A, has_eob, sizeof(ENTROPY_CONTEXT) * tx_size_in_blocks);
|
|
|
|
vpx_memset(L, has_eob, sizeof(ENTROPY_CONTEXT) * tx_size_in_blocks);
|
|
|
|
}
|
|
|
|
}
|
2013-06-06 15:07:09 +02:00
|
|
|
|
2013-10-07 11:45:16 +02:00
|
|
|
static int get_tx_eob(const struct segmentation *seg, int segment_id,
|
2013-08-27 23:17:53 +02:00
|
|
|
TX_SIZE tx_size) {
|
|
|
|
const int eob_max = 16 << (tx_size << 1);
|
|
|
|
return vp9_segfeature_active(seg, segment_id, SEG_LVL_SKIP) ? 0 : eob_max;
|
|
|
|
}
|
|
|
|
|
2012-12-19 00:31:19 +01:00
|
|
|
#endif // VP9_COMMON_VP9_BLOCKD_H_
|