2014-01-24 10:37:15 +00:00
|
|
|
/*****************************************************************************
|
|
|
|
* This file is part of Kvazaar HEVC encoder.
|
2014-02-21 13:00:20 +00:00
|
|
|
*
|
2021-10-07 08:32:59 +00:00
|
|
|
* Copyright (c) 2021, Tampere University, ITU/ISO/IEC, project contributors
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without modification,
|
|
|
|
* are permitted provided that the following conditions are met:
|
|
|
|
*
|
|
|
|
* * Redistributions of source code must retain the above copyright notice, this
|
|
|
|
* list of conditions and the following disclaimer.
|
|
|
|
*
|
|
|
|
* * Redistributions in binary form must reproduce the above copyright notice, this
|
|
|
|
* list of conditions and the following disclaimer in the documentation and/or
|
|
|
|
* other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* * Neither the name of the Tampere University or ITU/ISO/IEC nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived from
|
|
|
|
* this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
|
|
|
|
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
|
|
* INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION HOWEVER CAUSED AND ON
|
|
|
|
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
* INCLUDING NEGLIGENCE OR OTHERWISE ARISING IN ANY WAY OUT OF THE USE OF THIS
|
2014-01-24 10:37:15 +00:00
|
|
|
****************************************************************************/
|
|
|
|
|
2013-09-18 09:16:03 +00:00
|
|
|
#include "inter.h"
|
|
|
|
|
2013-04-24 07:35:27 +00:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
2016-08-10 11:03:25 +00:00
|
|
|
#include <limits.h>
|
2013-09-18 09:16:03 +00:00
|
|
|
|
2016-04-01 14:14:23 +00:00
|
|
|
#include "encoder.h"
|
|
|
|
#include "imagelist.h"
|
2015-04-30 15:50:56 +00:00
|
|
|
#include "strategies/generic/picture-generic.h"
|
2016-04-01 14:14:23 +00:00
|
|
|
#include "strategies/strategies-ipol.h"
|
2016-08-09 13:16:33 +00:00
|
|
|
#include "videoframe.h"
|
2018-04-18 12:25:44 +00:00
|
|
|
#include "strategies/strategies-picture.h"
|
2016-04-01 14:14:23 +00:00
|
|
|
|
2013-04-24 07:35:27 +00:00
|
|
|
|
2017-02-22 05:37:20 +00:00
|
|
|
typedef struct {
|
|
|
|
const cu_info_t *a[2];
|
|
|
|
const cu_info_t *b[3];
|
|
|
|
const cu_info_t *c3;
|
|
|
|
const cu_info_t *h;
|
|
|
|
} merge_candidates_t;
|
|
|
|
|
|
|
|
|
2020-04-04 19:14:10 +00:00
|
|
|
static void inter_recon_frac_luma(const encoder_state_t * const state,
|
|
|
|
const kvz_picture * const ref,
|
|
|
|
int32_t xpos,
|
|
|
|
int32_t ypos,
|
|
|
|
int32_t block_width,
|
|
|
|
int32_t block_height,
|
|
|
|
const int16_t mv_param[2],
|
|
|
|
yuv_t *out,
|
|
|
|
unsigned out_stride)
|
2015-07-28 17:00:16 +00:00
|
|
|
{
|
|
|
|
int mv_frac_x = (mv_param[0] & 3);
|
|
|
|
int mv_frac_y = (mv_param[1] & 3);
|
|
|
|
|
2021-03-02 17:48:57 +00:00
|
|
|
// Space for extrapolated pixels and the part from the picture.
|
2021-03-06 23:27:55 +00:00
|
|
|
// Some extra for AVX2.
|
2021-03-02 17:48:57 +00:00
|
|
|
// The extrapolation function will set the pointers and stride.
|
2021-03-06 23:27:55 +00:00
|
|
|
kvz_pixel ext_buffer[KVZ_IPOL_MAX_INPUT_SIZE_LUMA_SIMD];
|
2021-03-02 17:48:57 +00:00
|
|
|
kvz_pixel *ext = NULL;
|
|
|
|
kvz_pixel *ext_origin = NULL;
|
|
|
|
int ext_s = 0;
|
|
|
|
kvz_epol_args epol_args = {
|
|
|
|
.src = ref->y,
|
|
|
|
.src_w = ref->width,
|
|
|
|
.src_h = ref->height,
|
|
|
|
.src_s = ref->stride,
|
|
|
|
.blk_x = state->tile->offset_x + xpos + (mv_param[0] >> 2),
|
|
|
|
.blk_y = state->tile->offset_y + ypos + (mv_param[1] >> 2),
|
|
|
|
.blk_w = block_width,
|
|
|
|
.blk_h = block_height,
|
|
|
|
.pad_l = KVZ_LUMA_FILTER_OFFSET,
|
|
|
|
.pad_r = KVZ_EXT_PADDING_LUMA - KVZ_LUMA_FILTER_OFFSET,
|
|
|
|
.pad_t = KVZ_LUMA_FILTER_OFFSET,
|
2021-03-08 14:05:34 +00:00
|
|
|
.pad_b = KVZ_EXT_PADDING_LUMA - KVZ_LUMA_FILTER_OFFSET,
|
|
|
|
.pad_b_simd = 1 // One row for AVX2
|
2021-03-02 17:48:57 +00:00
|
|
|
};
|
2015-07-28 17:00:16 +00:00
|
|
|
|
2021-03-05 16:50:00 +00:00
|
|
|
// Initialize separately. Gets rid of warning
|
|
|
|
// about using nonstandard extension.
|
|
|
|
epol_args.buf = ext_buffer;
|
|
|
|
epol_args.ext = &ext;
|
|
|
|
epol_args.ext_origin = &ext_origin;
|
|
|
|
epol_args.ext_s = &ext_s;
|
|
|
|
|
2021-03-02 17:48:57 +00:00
|
|
|
kvz_get_extended_block(&epol_args);
|
2016-04-06 16:55:42 +00:00
|
|
|
kvz_sample_quarterpel_luma(state->encoder_control,
|
2021-03-02 17:48:57 +00:00
|
|
|
ext_origin,
|
|
|
|
ext_s,
|
|
|
|
block_width,
|
|
|
|
block_height,
|
2021-11-15 19:48:43 +00:00
|
|
|
out->y,
|
|
|
|
out_stride,
|
2021-03-02 17:48:57 +00:00
|
|
|
mv_frac_x,
|
|
|
|
mv_frac_y,
|
|
|
|
mv_param);
|
2015-07-28 17:00:16 +00:00
|
|
|
}
|
|
|
|
|
2021-03-06 17:46:36 +00:00
|
|
|
static void inter_recon_frac_luma_hi(const encoder_state_t *const state,
|
2021-03-02 17:48:57 +00:00
|
|
|
const kvz_picture *const ref,
|
|
|
|
int32_t xpos,
|
|
|
|
int32_t ypos,
|
|
|
|
int32_t block_width,
|
|
|
|
int32_t block_height,
|
|
|
|
const int16_t mv_param[2],
|
2021-11-20 22:32:01 +00:00
|
|
|
yuv_im_t *out,
|
2021-11-15 19:48:43 +00:00
|
|
|
const unsigned out_stride)
|
2015-08-04 13:14:40 +00:00
|
|
|
{
|
|
|
|
int mv_frac_x = (mv_param[0] & 3);
|
|
|
|
int mv_frac_y = (mv_param[1] & 3);
|
|
|
|
|
2021-03-02 17:48:57 +00:00
|
|
|
// Space for extrapolated pixels and the part from the picture.
|
2021-03-06 23:27:55 +00:00
|
|
|
// Some extra for AVX2.
|
2021-03-02 17:48:57 +00:00
|
|
|
// The extrapolation function will set the pointers and stride.
|
2021-03-06 23:27:55 +00:00
|
|
|
kvz_pixel ext_buffer[KVZ_IPOL_MAX_INPUT_SIZE_LUMA_SIMD];
|
2021-03-02 17:48:57 +00:00
|
|
|
kvz_pixel *ext = NULL;
|
|
|
|
kvz_pixel *ext_origin = NULL;
|
|
|
|
int ext_s = 0;
|
|
|
|
kvz_epol_args epol_args = {
|
|
|
|
.src = ref->y,
|
|
|
|
.src_w = ref->width,
|
|
|
|
.src_h = ref->height,
|
|
|
|
.src_s = ref->stride,
|
|
|
|
.blk_x = state->tile->offset_x + xpos + (mv_param[0] >> 2),
|
|
|
|
.blk_y = state->tile->offset_y + ypos + (mv_param[1] >> 2),
|
|
|
|
.blk_w = block_width,
|
|
|
|
.blk_h = block_height,
|
|
|
|
.pad_l = KVZ_LUMA_FILTER_OFFSET,
|
|
|
|
.pad_r = KVZ_EXT_PADDING_LUMA - KVZ_LUMA_FILTER_OFFSET,
|
|
|
|
.pad_t = KVZ_LUMA_FILTER_OFFSET,
|
2021-03-08 14:05:34 +00:00
|
|
|
.pad_b = KVZ_EXT_PADDING_LUMA - KVZ_LUMA_FILTER_OFFSET,
|
|
|
|
.pad_b_simd = 1 // One row for AVX2
|
2021-03-02 17:48:57 +00:00
|
|
|
};
|
2015-08-04 13:14:40 +00:00
|
|
|
|
2021-03-05 16:50:00 +00:00
|
|
|
// Initialize separately. Gets rid of warning
|
|
|
|
// about using nonstandard extension.
|
|
|
|
epol_args.buf = ext_buffer;
|
|
|
|
epol_args.ext = &ext;
|
|
|
|
epol_args.ext_origin = &ext_origin;
|
|
|
|
epol_args.ext_s = &ext_s;
|
|
|
|
|
2021-03-02 17:48:57 +00:00
|
|
|
kvz_get_extended_block(&epol_args);
|
2021-03-06 17:46:36 +00:00
|
|
|
kvz_sample_quarterpel_luma_hi(state->encoder_control,
|
2021-03-02 17:48:57 +00:00
|
|
|
ext_origin,
|
|
|
|
ext_s,
|
|
|
|
block_width,
|
|
|
|
block_height,
|
2021-11-15 19:48:43 +00:00
|
|
|
out->y,
|
|
|
|
out_stride,
|
2021-03-02 17:48:57 +00:00
|
|
|
mv_frac_x,
|
|
|
|
mv_frac_y,
|
|
|
|
mv_param);
|
2015-08-04 13:14:40 +00:00
|
|
|
}
|
|
|
|
|
2021-03-02 17:48:57 +00:00
|
|
|
static void inter_recon_frac_chroma(const encoder_state_t *const state,
|
|
|
|
const kvz_picture *const ref,
|
2021-11-15 19:48:43 +00:00
|
|
|
int32_t pu_x,
|
|
|
|
int32_t pu_y,
|
|
|
|
int32_t pu_w,
|
|
|
|
int32_t pu_h,
|
2021-03-02 17:48:57 +00:00
|
|
|
const int16_t mv_param[2],
|
2021-11-15 19:48:43 +00:00
|
|
|
yuv_t *out,
|
|
|
|
const unsigned out_stride)
|
2015-07-28 17:00:16 +00:00
|
|
|
{
|
|
|
|
int mv_frac_x = (mv_param[0] & 7);
|
|
|
|
int mv_frac_y = (mv_param[1] & 7);
|
|
|
|
|
2021-11-15 19:48:43 +00:00
|
|
|
// Take into account chroma subsampling
|
|
|
|
unsigned pb_w = pu_w / 2;
|
|
|
|
unsigned pb_h = pu_h / 2;
|
|
|
|
|
2021-03-02 17:48:57 +00:00
|
|
|
// Space for extrapolated pixels and the part from the picture.
|
2021-03-06 23:27:55 +00:00
|
|
|
// Some extra for AVX2.
|
2021-03-02 17:48:57 +00:00
|
|
|
// The extrapolation function will set the pointers and stride.
|
2021-03-06 23:27:55 +00:00
|
|
|
kvz_pixel ext_buffer[KVZ_IPOL_MAX_INPUT_SIZE_CHROMA_SIMD];
|
2021-03-02 17:48:57 +00:00
|
|
|
kvz_pixel *ext = NULL;
|
|
|
|
kvz_pixel *ext_origin = NULL;
|
|
|
|
int ext_s = 0;
|
2015-07-28 17:00:16 +00:00
|
|
|
|
2021-03-02 17:48:57 +00:00
|
|
|
// Chroma U
|
|
|
|
// Divisions by 2 due to 4:2:0 chroma subsampling
|
|
|
|
kvz_epol_args epol_args = {
|
|
|
|
.src = ref->u,
|
|
|
|
.src_w = ref->width / 2,
|
|
|
|
.src_h = ref->height / 2,
|
|
|
|
.src_s = ref->stride / 2,
|
2021-11-15 19:48:43 +00:00
|
|
|
.blk_x = (state->tile->offset_x + pu_x) / 2 + (mv_param[0] >> 3),
|
|
|
|
.blk_y = (state->tile->offset_y + pu_y) / 2 + (mv_param[1] >> 3),
|
|
|
|
.blk_w = pb_w,
|
|
|
|
.blk_h = pb_h,
|
2021-03-02 17:48:57 +00:00
|
|
|
.pad_l = KVZ_CHROMA_FILTER_OFFSET,
|
|
|
|
.pad_r = KVZ_EXT_PADDING_CHROMA - KVZ_CHROMA_FILTER_OFFSET,
|
|
|
|
.pad_t = KVZ_CHROMA_FILTER_OFFSET,
|
2021-03-08 14:05:34 +00:00
|
|
|
.pad_b = KVZ_EXT_PADDING_CHROMA - KVZ_CHROMA_FILTER_OFFSET,
|
|
|
|
.pad_b_simd = 3 // Three rows for AVX2
|
2021-03-02 17:48:57 +00:00
|
|
|
};
|
2015-07-28 17:00:16 +00:00
|
|
|
|
2021-03-05 16:50:00 +00:00
|
|
|
// Initialize separately. Gets rid of warning
|
|
|
|
// about using nonstandard extension.
|
|
|
|
epol_args.buf = ext_buffer;
|
|
|
|
epol_args.ext = &ext;
|
|
|
|
epol_args.ext_origin = &ext_origin;
|
|
|
|
epol_args.ext_s = &ext_s;
|
|
|
|
|
2021-03-02 17:48:57 +00:00
|
|
|
kvz_get_extended_block(&epol_args);
|
|
|
|
kvz_sample_octpel_chroma(state->encoder_control,
|
|
|
|
ext_origin,
|
|
|
|
ext_s,
|
2021-11-15 19:48:43 +00:00
|
|
|
pb_w,
|
|
|
|
pb_h,
|
|
|
|
out->u,
|
|
|
|
out_stride,
|
2021-03-02 17:48:57 +00:00
|
|
|
mv_frac_x,
|
|
|
|
mv_frac_y,
|
|
|
|
mv_param);
|
2015-07-28 17:00:16 +00:00
|
|
|
|
2021-03-02 17:48:57 +00:00
|
|
|
// Chroma V
|
|
|
|
epol_args.src = ref->v;
|
|
|
|
kvz_get_extended_block(&epol_args);
|
|
|
|
kvz_sample_octpel_chroma(state->encoder_control,
|
|
|
|
ext_origin,
|
|
|
|
ext_s,
|
2021-11-15 19:48:43 +00:00
|
|
|
pb_w,
|
|
|
|
pb_h,
|
|
|
|
out->v,
|
|
|
|
out_stride,
|
2021-03-02 17:48:57 +00:00
|
|
|
mv_frac_x,
|
|
|
|
mv_frac_y,
|
|
|
|
mv_param);
|
2015-07-28 17:00:16 +00:00
|
|
|
}
|
|
|
|
|
2021-03-06 17:46:36 +00:00
|
|
|
static void inter_recon_frac_chroma_hi(const encoder_state_t *const state,
|
2021-03-02 17:48:57 +00:00
|
|
|
const kvz_picture *const ref,
|
2021-11-15 19:48:43 +00:00
|
|
|
int32_t pu_x,
|
|
|
|
int32_t pu_y,
|
|
|
|
int32_t pu_w,
|
|
|
|
int32_t pu_h,
|
2021-03-02 17:48:57 +00:00
|
|
|
const int16_t mv_param[2],
|
2021-11-20 22:32:01 +00:00
|
|
|
yuv_im_t *out,
|
2021-11-15 19:48:43 +00:00
|
|
|
const unsigned out_stride)
|
2015-08-04 13:14:40 +00:00
|
|
|
{
|
|
|
|
int mv_frac_x = (mv_param[0] & 7);
|
|
|
|
int mv_frac_y = (mv_param[1] & 7);
|
|
|
|
|
2021-11-15 19:48:43 +00:00
|
|
|
// Take into account chroma subsampling
|
|
|
|
unsigned pb_w = pu_w / 2;
|
|
|
|
unsigned pb_h = pu_h / 2;
|
|
|
|
|
2021-03-02 17:48:57 +00:00
|
|
|
// Space for extrapolated pixels and the part from the picture.
|
2021-03-06 23:27:55 +00:00
|
|
|
// Some extra for AVX2.
|
2021-03-02 17:48:57 +00:00
|
|
|
// The extrapolation function will set the pointers and stride.
|
2021-03-06 23:27:55 +00:00
|
|
|
kvz_pixel ext_buffer[KVZ_IPOL_MAX_INPUT_SIZE_CHROMA_SIMD];
|
2021-03-02 17:48:57 +00:00
|
|
|
kvz_pixel *ext = NULL;
|
|
|
|
kvz_pixel *ext_origin = NULL;
|
|
|
|
int ext_s = 0;
|
2015-08-04 13:14:40 +00:00
|
|
|
|
2021-03-02 17:48:57 +00:00
|
|
|
// Chroma U
|
|
|
|
// Divisions by 2 due to 4:2:0 chroma subsampling
|
|
|
|
kvz_epol_args epol_args = {
|
|
|
|
.src = ref->u,
|
|
|
|
.src_w = ref->width / 2,
|
|
|
|
.src_h = ref->height / 2,
|
|
|
|
.src_s = ref->stride / 2,
|
2021-11-15 19:48:43 +00:00
|
|
|
.blk_x = (state->tile->offset_x + pu_x) / 2 + (mv_param[0] >> 3),
|
|
|
|
.blk_y = (state->tile->offset_y + pu_y) / 2 + (mv_param[1] >> 3),
|
|
|
|
.blk_w = pb_w,
|
|
|
|
.blk_h = pb_h,
|
2021-03-02 17:48:57 +00:00
|
|
|
.pad_l = KVZ_CHROMA_FILTER_OFFSET,
|
|
|
|
.pad_r = KVZ_EXT_PADDING_CHROMA - KVZ_CHROMA_FILTER_OFFSET,
|
|
|
|
.pad_t = KVZ_CHROMA_FILTER_OFFSET,
|
2021-03-08 14:05:34 +00:00
|
|
|
.pad_b = KVZ_EXT_PADDING_CHROMA - KVZ_CHROMA_FILTER_OFFSET,
|
|
|
|
.pad_b_simd = 3 // Three rows for AVX2
|
2021-03-02 17:48:57 +00:00
|
|
|
};
|
2015-08-04 13:14:40 +00:00
|
|
|
|
2021-03-05 16:50:00 +00:00
|
|
|
// Initialize separately. Gets rid of warning
|
|
|
|
// about using nonstandard extension.
|
|
|
|
epol_args.buf = ext_buffer;
|
|
|
|
epol_args.ext = &ext;
|
|
|
|
epol_args.ext_origin = &ext_origin;
|
|
|
|
epol_args.ext_s = &ext_s;
|
|
|
|
|
2021-03-02 17:48:57 +00:00
|
|
|
kvz_get_extended_block(&epol_args);
|
2021-03-06 17:46:36 +00:00
|
|
|
kvz_sample_octpel_chroma_hi(state->encoder_control,
|
2021-03-02 17:48:57 +00:00
|
|
|
ext_origin,
|
|
|
|
ext_s,
|
2021-11-15 19:48:43 +00:00
|
|
|
pb_w,
|
|
|
|
pb_h,
|
|
|
|
out->u,
|
|
|
|
out_stride,
|
2021-03-02 17:48:57 +00:00
|
|
|
mv_frac_x,
|
|
|
|
mv_frac_y,
|
|
|
|
mv_param);
|
2015-08-04 13:14:40 +00:00
|
|
|
|
2021-03-02 17:48:57 +00:00
|
|
|
// Chroma V
|
|
|
|
epol_args.src = ref->v;
|
|
|
|
kvz_get_extended_block(&epol_args);
|
2021-03-06 17:46:36 +00:00
|
|
|
kvz_sample_octpel_chroma_hi(state->encoder_control,
|
2021-03-02 17:48:57 +00:00
|
|
|
ext_origin,
|
|
|
|
ext_s,
|
2021-11-15 19:48:43 +00:00
|
|
|
pb_w,
|
|
|
|
pb_h,
|
|
|
|
out->v,
|
|
|
|
out_stride,
|
2021-03-02 17:48:57 +00:00
|
|
|
mv_frac_x,
|
|
|
|
mv_frac_y,
|
|
|
|
mv_param);
|
2015-08-04 13:14:40 +00:00
|
|
|
}
|
|
|
|
|
2016-08-24 14:39:37 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* \brief Copy from frame with extended border.
|
|
|
|
*
|
|
|
|
* \param ref_buf pointer to the start of ref buffer
|
|
|
|
* \param ref_stride stride of ref buffer
|
|
|
|
* \param ref_width width of frame
|
|
|
|
* \param ref_height height of frame
|
|
|
|
* \param rec_buf pointer to the start of pu in rec buffer
|
|
|
|
* \param rec_stride stride of rec buffer
|
|
|
|
* \param width width of copied block
|
|
|
|
* \param height height of copied block
|
|
|
|
* \param mv_in_frame coordinates of copied block in frame coordinates
|
|
|
|
*/
|
|
|
|
static void inter_cp_with_ext_border(const kvz_pixel *ref_buf, int ref_stride,
|
|
|
|
int ref_width, int ref_height,
|
|
|
|
kvz_pixel *rec_buf, int rec_stride,
|
|
|
|
int width, int height,
|
|
|
|
const vector2d_t *mv_in_frame)
|
|
|
|
{
|
|
|
|
for (int y = mv_in_frame->y; y < mv_in_frame->y + height; ++y) {
|
|
|
|
for (int x = mv_in_frame->x; x < mv_in_frame->x + width; ++x) {
|
|
|
|
vector2d_t in_frame = {
|
|
|
|
CLIP(0, ref_width - 1, x),
|
|
|
|
CLIP(0, ref_height - 1, y),
|
|
|
|
};
|
|
|
|
vector2d_t in_pu = {
|
|
|
|
x - mv_in_frame->x,
|
|
|
|
y - mv_in_frame->y,
|
|
|
|
};
|
|
|
|
int pu_index = in_pu.y * rec_stride + in_pu.x;
|
|
|
|
int frame_index = in_frame.y * ref_stride + in_frame.x;
|
|
|
|
rec_buf[pu_index] = ref_buf[frame_index];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2013-09-19 12:08:30 +00:00
|
|
|
/**
|
2018-01-17 11:09:47 +00:00
|
|
|
* \brief Reconstruct an inter PU using uniprediction.
|
2016-05-23 02:17:35 +00:00
|
|
|
*
|
2019-09-02 14:09:07 +00:00
|
|
|
* \param state encoder state
|
|
|
|
* \param ref picture to copy the data from
|
2020-04-04 19:14:10 +00:00
|
|
|
* \param pu_x PU x position
|
|
|
|
* \param pu_y PU y position
|
2019-09-02 14:09:07 +00:00
|
|
|
* \param width PU width
|
|
|
|
* \param height PU height
|
|
|
|
* \param mv_param motion vector
|
2021-11-21 00:11:50 +00:00
|
|
|
* \param yuv_px destination buffer for pixel precision
|
|
|
|
* \param yuv_im destination buffer for high-precision, or NULL if not needed
|
2019-09-02 14:09:07 +00:00
|
|
|
* \param predict_luma Enable or disable luma prediction for this call.
|
|
|
|
* \param predict_chroma Enable or disable chroma prediction for this call.
|
2013-09-12 15:50:11 +00:00
|
|
|
*/
|
2020-04-04 19:14:10 +00:00
|
|
|
static unsigned inter_recon_unipred(const encoder_state_t * const state,
|
|
|
|
const kvz_picture * const ref,
|
|
|
|
int32_t pu_x,
|
|
|
|
int32_t pu_y,
|
|
|
|
int32_t pu_w,
|
|
|
|
int32_t pu_h,
|
|
|
|
int32_t out_stride_luma,
|
|
|
|
const int16_t mv_param[2],
|
|
|
|
yuv_t *yuv_px,
|
2021-11-20 22:32:01 +00:00
|
|
|
yuv_im_t *yuv_im,
|
2020-04-04 19:14:10 +00:00
|
|
|
bool predict_luma,
|
|
|
|
bool predict_chroma)
|
2013-09-12 15:50:11 +00:00
|
|
|
{
|
2020-04-04 19:14:10 +00:00
|
|
|
const vector2d_t int_mv = { mv_param[0] >> 2, mv_param[1] >> 2 };
|
|
|
|
const vector2d_t int_mv_in_frame = {
|
|
|
|
int_mv.x + pu_x + state->tile->offset_x,
|
|
|
|
int_mv.y + pu_y + state->tile->offset_y
|
2016-08-24 14:39:37 +00:00
|
|
|
};
|
|
|
|
|
2020-04-04 19:14:10 +00:00
|
|
|
const bool int_mv_outside_frame = int_mv_in_frame.x < 0 ||
|
|
|
|
int_mv_in_frame.y < 0 ||
|
|
|
|
int_mv_in_frame.x + pu_w > ref->width ||
|
|
|
|
int_mv_in_frame.y + pu_h > ref->height;
|
2016-08-24 14:39:37 +00:00
|
|
|
|
|
|
|
// With 420, odd coordinates need interpolation.
|
2020-04-04 19:14:10 +00:00
|
|
|
const bool fractional_chroma = (int_mv.x & 1) || (int_mv.y & 1);
|
|
|
|
const bool fractional_luma = (mv_param[0] & 3) || (mv_param[1] & 3);
|
2016-08-24 14:39:37 +00:00
|
|
|
|
|
|
|
// Generate prediction for luma.
|
2019-09-02 14:09:07 +00:00
|
|
|
if (predict_luma) {
|
|
|
|
if (fractional_luma) {
|
|
|
|
// With a fractional MV, do interpolation.
|
2021-11-20 22:32:01 +00:00
|
|
|
if (state->encoder_control->cfg.bipred && yuv_im) {
|
2021-03-06 17:46:36 +00:00
|
|
|
inter_recon_frac_luma_hi(state, ref,
|
2020-04-04 19:14:10 +00:00
|
|
|
pu_x, pu_y,
|
|
|
|
pu_w, pu_h,
|
2021-11-20 22:32:01 +00:00
|
|
|
mv_param, yuv_im, out_stride_luma);
|
2019-09-02 14:09:07 +00:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
inter_recon_frac_luma(state, ref,
|
2020-04-04 19:14:10 +00:00
|
|
|
pu_x, pu_y,
|
|
|
|
pu_w, pu_h,
|
|
|
|
mv_param, yuv_px, out_stride_luma);
|
2019-09-02 14:09:07 +00:00
|
|
|
}
|
2016-08-24 14:39:37 +00:00
|
|
|
}
|
2019-09-02 14:09:07 +00:00
|
|
|
else {
|
|
|
|
// With an integer MV, copy pixels directly from the reference.
|
2020-04-04 19:14:10 +00:00
|
|
|
if (int_mv_outside_frame) {
|
2019-09-02 14:09:07 +00:00
|
|
|
inter_cp_with_ext_border(ref->y, ref->width,
|
|
|
|
ref->width, ref->height,
|
2020-04-04 19:14:10 +00:00
|
|
|
yuv_px->y, out_stride_luma,
|
|
|
|
pu_w, pu_h,
|
|
|
|
&int_mv_in_frame);
|
2019-09-02 14:09:07 +00:00
|
|
|
}
|
|
|
|
else {
|
2020-04-04 19:14:10 +00:00
|
|
|
const int frame_mv_index = int_mv_in_frame.y * ref->width + int_mv_in_frame.x;
|
2019-09-02 14:09:07 +00:00
|
|
|
kvz_pixels_blit(&ref->y[frame_mv_index],
|
2020-04-04 19:14:10 +00:00
|
|
|
yuv_px->y,
|
|
|
|
pu_w, pu_h,
|
|
|
|
ref->width, out_stride_luma);
|
2019-09-02 14:09:07 +00:00
|
|
|
}
|
2015-08-04 13:14:40 +00:00
|
|
|
}
|
2015-07-28 17:00:16 +00:00
|
|
|
}
|
2014-05-14 01:42:02 +00:00
|
|
|
|
2019-09-02 14:09:07 +00:00
|
|
|
if (!predict_chroma) {
|
2020-04-04 19:14:10 +00:00
|
|
|
return fractional_luma;
|
2016-08-25 13:05:46 +00:00
|
|
|
}
|
|
|
|
|
2020-04-04 19:14:10 +00:00
|
|
|
const unsigned out_stride_c = out_stride_luma / 2;
|
|
|
|
|
2016-08-24 14:39:37 +00:00
|
|
|
// Generate prediction for chroma.
|
|
|
|
if (fractional_luma || fractional_chroma) {
|
|
|
|
// With a fractional MV, do interpolation.
|
2021-11-20 22:32:01 +00:00
|
|
|
if (state->encoder_control->cfg.bipred && yuv_im) {
|
2021-03-06 17:46:36 +00:00
|
|
|
inter_recon_frac_chroma_hi(state, ref,
|
2020-04-04 19:14:10 +00:00
|
|
|
pu_x, pu_y,
|
|
|
|
pu_w, pu_h,
|
2021-11-20 22:32:01 +00:00
|
|
|
mv_param, yuv_im, out_stride_c);
|
2016-08-24 14:39:37 +00:00
|
|
|
} else {
|
|
|
|
inter_recon_frac_chroma(state, ref,
|
2020-04-04 19:14:10 +00:00
|
|
|
pu_x, pu_y,
|
|
|
|
pu_w, pu_h,
|
|
|
|
mv_param, yuv_px, out_stride_c);
|
2014-05-14 01:42:02 +00:00
|
|
|
}
|
2016-08-24 14:39:37 +00:00
|
|
|
} else {
|
|
|
|
// With an integer MV, copy pixels directly from the reference.
|
2020-04-04 19:14:10 +00:00
|
|
|
const vector2d_t int_mv_in_frame_c = { int_mv_in_frame.x / 2, int_mv_in_frame.y / 2 };
|
2016-08-24 14:39:37 +00:00
|
|
|
|
2020-04-04 19:14:10 +00:00
|
|
|
if (int_mv_outside_frame) {
|
2016-08-24 14:39:37 +00:00
|
|
|
inter_cp_with_ext_border(ref->u, ref->width / 2,
|
|
|
|
ref->width / 2, ref->height / 2,
|
2020-04-04 19:14:10 +00:00
|
|
|
yuv_px->u, out_stride_c,
|
|
|
|
pu_w / 2, pu_h / 2,
|
|
|
|
&int_mv_in_frame_c);
|
2016-08-24 14:39:37 +00:00
|
|
|
inter_cp_with_ext_border(ref->v, ref->width / 2,
|
|
|
|
ref->width / 2, ref->height / 2,
|
2020-04-04 19:14:10 +00:00
|
|
|
yuv_px->v, out_stride_c,
|
|
|
|
pu_w / 2, pu_h / 2,
|
|
|
|
&int_mv_in_frame_c);
|
2016-08-24 14:39:37 +00:00
|
|
|
} else {
|
2020-04-04 19:14:10 +00:00
|
|
|
const int frame_mv_index = int_mv_in_frame_c.y * ref->width / 2 + int_mv_in_frame_c.x;
|
2016-08-24 14:39:37 +00:00
|
|
|
|
|
|
|
kvz_pixels_blit(&ref->u[frame_mv_index],
|
2020-04-04 19:14:10 +00:00
|
|
|
yuv_px->u,
|
|
|
|
pu_w / 2, pu_h / 2,
|
|
|
|
ref->width / 2, out_stride_c);
|
2016-08-24 14:39:37 +00:00
|
|
|
kvz_pixels_blit(&ref->v[frame_mv_index],
|
2020-04-04 19:14:10 +00:00
|
|
|
yuv_px->v,
|
|
|
|
pu_w / 2, pu_h / 2,
|
|
|
|
ref->width / 2, out_stride_c);
|
2013-09-12 15:50:11 +00:00
|
|
|
}
|
|
|
|
}
|
2020-04-04 19:14:10 +00:00
|
|
|
|
|
|
|
return fractional_luma | ((fractional_luma || fractional_chroma) << 1);
|
2013-09-16 13:37:24 +00:00
|
|
|
}
|
2015-04-21 09:05:21 +00:00
|
|
|
/**
|
2018-01-17 11:09:47 +00:00
|
|
|
* \brief Reconstruct bi-pred inter PU
|
2016-05-23 02:17:35 +00:00
|
|
|
*
|
2019-09-02 14:09:07 +00:00
|
|
|
* \param state encoder state
|
|
|
|
* \param ref1 reference picture to copy the data from
|
|
|
|
* \param ref2 other reference picture to copy the data from
|
2020-04-04 19:14:10 +00:00
|
|
|
* \param pu_x PU x position
|
|
|
|
* \param pu_y PU y position
|
2019-09-02 14:09:07 +00:00
|
|
|
* \param width PU width
|
|
|
|
* \param height PU height
|
|
|
|
* \param mv_param motion vectors
|
|
|
|
* \param lcu destination lcu
|
|
|
|
* \param predict_luma Enable or disable luma prediction for this call.
|
|
|
|
* \param predict_chroma Enable or disable chroma prediction for this call.
|
2016-05-23 02:17:35 +00:00
|
|
|
*/
|
2020-04-04 19:14:10 +00:00
|
|
|
void kvz_inter_recon_bipred(const encoder_state_t *const state,
|
|
|
|
const kvz_picture *ref1,
|
|
|
|
const kvz_picture *ref2,
|
|
|
|
int32_t pu_x,
|
|
|
|
int32_t pu_y,
|
|
|
|
int32_t pu_w,
|
|
|
|
int32_t pu_h,
|
|
|
|
int16_t mv_param[2][2],
|
|
|
|
lcu_t *lcu,
|
|
|
|
bool predict_luma,
|
|
|
|
bool predict_chroma)
|
2015-11-04 08:32:20 +00:00
|
|
|
{
|
2020-04-04 19:14:10 +00:00
|
|
|
// Allocate maximum size arrays for interpolated and copied samples
|
|
|
|
ALIGNED(64) kvz_pixel px_buf_L0[LCU_LUMA_SIZE + 2 * LCU_CHROMA_SIZE];
|
|
|
|
ALIGNED(64) kvz_pixel px_buf_L1[LCU_LUMA_SIZE + 2 * LCU_CHROMA_SIZE];
|
2021-11-20 22:45:15 +00:00
|
|
|
ALIGNED(64) kvz_pixel_im im_buf_L0[LCU_LUMA_SIZE + 2 * LCU_CHROMA_SIZE];
|
|
|
|
ALIGNED(64) kvz_pixel_im im_buf_L1[LCU_LUMA_SIZE + 2 * LCU_CHROMA_SIZE];
|
2020-04-04 19:14:10 +00:00
|
|
|
|
|
|
|
yuv_t px_L0;
|
|
|
|
px_L0.size = pu_w * pu_h;
|
|
|
|
px_L0.y = &px_buf_L0[0];
|
|
|
|
px_L0.u = &px_buf_L0[LCU_LUMA_SIZE];
|
|
|
|
px_L0.v = &px_buf_L0[LCU_LUMA_SIZE + LCU_CHROMA_SIZE];
|
|
|
|
|
|
|
|
yuv_t px_L1;
|
|
|
|
px_L1.size = pu_w * pu_h;
|
|
|
|
px_L1.y = &px_buf_L1[0];
|
|
|
|
px_L1.u = &px_buf_L1[LCU_LUMA_SIZE];
|
|
|
|
px_L1.v = &px_buf_L1[LCU_LUMA_SIZE + LCU_CHROMA_SIZE];
|
|
|
|
|
2021-11-20 22:45:15 +00:00
|
|
|
yuv_im_t im_L0;
|
|
|
|
im_L0.size = pu_w * pu_h;
|
|
|
|
im_L0.y = &im_buf_L0[0];
|
|
|
|
im_L0.u = &im_buf_L0[LCU_LUMA_SIZE];
|
|
|
|
im_L0.v = &im_buf_L0[LCU_LUMA_SIZE + LCU_CHROMA_SIZE];
|
2020-04-04 19:14:10 +00:00
|
|
|
|
2021-11-20 22:45:15 +00:00
|
|
|
yuv_im_t im_L1;
|
|
|
|
im_L1.size = pu_w * pu_h;
|
|
|
|
im_L1.y = &im_buf_L1[0];
|
|
|
|
im_L1.u = &im_buf_L1[LCU_LUMA_SIZE];
|
|
|
|
im_L1.v = &im_buf_L1[LCU_LUMA_SIZE + LCU_CHROMA_SIZE];
|
2020-04-04 19:14:10 +00:00
|
|
|
|
|
|
|
// Sample blocks from both reference picture lists.
|
|
|
|
// Flags state if the outputs were written to high-precision / interpolated sample buffers.
|
2021-11-20 22:45:15 +00:00
|
|
|
unsigned im_flags_L0 = inter_recon_unipred(state, ref1, pu_x, pu_y, pu_w, pu_h, pu_w, mv_param[0],
|
|
|
|
&px_L0, &im_L0, predict_luma, predict_chroma);
|
|
|
|
unsigned im_flags_L1 = inter_recon_unipred(state, ref2, pu_x, pu_y, pu_w, pu_h, pu_w, mv_param[1],
|
|
|
|
&px_L1, &im_L1, predict_luma, predict_chroma);
|
2015-04-23 11:39:41 +00:00
|
|
|
|
|
|
|
// After reconstruction, merge the predictors by taking an average of each pixel
|
2021-11-20 22:45:15 +00:00
|
|
|
kvz_bipred_average(lcu, &px_L0, &px_L1, &im_L0, &im_L1,
|
2020-04-05 12:39:35 +00:00
|
|
|
pu_x, pu_y, pu_w, pu_h,
|
2021-11-20 22:45:15 +00:00
|
|
|
im_flags_L0, im_flags_L1,
|
2020-04-05 12:39:35 +00:00
|
|
|
predict_luma, predict_chroma);
|
2015-04-21 09:05:21 +00:00
|
|
|
}
|
|
|
|
|
2018-01-17 11:09:47 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Reconstruct a single CU.
|
|
|
|
*
|
|
|
|
* The CU may consist of multiple PUs, each of which can use either
|
|
|
|
* uniprediction or biprediction.
|
|
|
|
*
|
|
|
|
* \param state encoder state
|
|
|
|
* \param lcu containing LCU
|
|
|
|
* \param x x-coordinate of the CU in pixels
|
|
|
|
* \param y y-coordinate of the CU in pixels
|
|
|
|
* \param width CU width
|
2019-09-02 14:09:07 +00:00
|
|
|
* \param predict_luma Enable or disable luma prediction for this call.
|
|
|
|
* \param predict_chroma Enable or disable chroma prediction for this call.
|
2018-01-17 11:09:47 +00:00
|
|
|
*/
|
|
|
|
void kvz_inter_recon_cu(const encoder_state_t * const state,
|
|
|
|
lcu_t *lcu,
|
|
|
|
int32_t x,
|
|
|
|
int32_t y,
|
2019-09-02 14:09:07 +00:00
|
|
|
int32_t width,
|
|
|
|
bool predict_luma,
|
|
|
|
bool predict_chroma)
|
2018-01-17 11:09:47 +00:00
|
|
|
{
|
|
|
|
cu_info_t *cu = LCU_GET_CU_AT_PX(lcu, SUB_SCU(x), SUB_SCU(y));
|
|
|
|
const int num_pu = kvz_part_mode_num_parts[cu->part_size];
|
|
|
|
for (int i = 0; i < num_pu; ++i) {
|
2019-09-02 15:46:06 +00:00
|
|
|
kvz_inter_pred_pu(state, lcu, x, y, width, predict_luma, predict_chroma, i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Predict a single PU.
|
|
|
|
*
|
|
|
|
* The PU may use either uniprediction or biprediction.
|
|
|
|
*
|
|
|
|
* \param state encoder state
|
|
|
|
* \param lcu containing LCU
|
|
|
|
* \param x x-coordinate of the CU in pixels
|
|
|
|
* \param y y-coordinate of the CU in pixels
|
|
|
|
* \param width CU width
|
|
|
|
* \param predict_luma Enable or disable luma prediction for this call.
|
|
|
|
* \param predict_chroma Enable or disable chroma prediction for this call.
|
|
|
|
* \param i_pu Index of the PU. Always zero for 2Nx2N. Used for SMP+AMP.
|
|
|
|
*/
|
|
|
|
void kvz_inter_pred_pu(const encoder_state_t * const state,
|
|
|
|
lcu_t *lcu,
|
|
|
|
int32_t x,
|
|
|
|
int32_t y,
|
|
|
|
int32_t width,
|
|
|
|
bool predict_luma,
|
|
|
|
bool predict_chroma,
|
|
|
|
int i_pu)
|
|
|
|
|
|
|
|
{
|
|
|
|
cu_info_t *cu = LCU_GET_CU_AT_PX(lcu, SUB_SCU(x), SUB_SCU(y));
|
|
|
|
const int pu_x = PU_GET_X(cu->part_size, width, x, i_pu);
|
|
|
|
const int pu_y = PU_GET_Y(cu->part_size, width, y, i_pu);
|
|
|
|
const int pu_w = PU_GET_W(cu->part_size, width, i_pu);
|
|
|
|
const int pu_h = PU_GET_H(cu->part_size, width, i_pu);
|
|
|
|
cu_info_t *pu = LCU_GET_CU_AT_PX(lcu, SUB_SCU(pu_x), SUB_SCU(pu_y));
|
|
|
|
|
|
|
|
if (pu->inter.mv_dir == 3) {
|
|
|
|
const kvz_picture *const refs[2] = {
|
|
|
|
state->frame->ref->images[
|
|
|
|
state->frame->ref_LX[0][
|
|
|
|
pu->inter.mv_ref[0]]],
|
|
|
|
state->frame->ref->images[
|
|
|
|
state->frame->ref_LX[1][
|
|
|
|
pu->inter.mv_ref[1]]],
|
|
|
|
};
|
|
|
|
kvz_inter_recon_bipred(state,
|
|
|
|
refs[0], refs[1],
|
|
|
|
pu_x, pu_y,
|
|
|
|
pu_w, pu_h,
|
|
|
|
pu->inter.mv,
|
|
|
|
lcu,
|
|
|
|
predict_luma, predict_chroma);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
const int mv_idx = pu->inter.mv_dir - 1;
|
|
|
|
const kvz_picture *const ref =
|
|
|
|
state->frame->ref->images[
|
|
|
|
state->frame->ref_LX[mv_idx][
|
|
|
|
pu->inter.mv_ref[mv_idx]]];
|
|
|
|
|
2020-04-04 19:14:10 +00:00
|
|
|
const unsigned offset_luma = SUB_SCU(pu_y) * LCU_WIDTH + SUB_SCU(pu_x);
|
|
|
|
const unsigned offset_chroma = SUB_SCU(pu_y) / 2 * LCU_WIDTH_C + SUB_SCU(pu_x) / 2;
|
|
|
|
yuv_t lcu_adapter;
|
|
|
|
lcu_adapter.size = pu_w * pu_h;
|
|
|
|
lcu_adapter.y = lcu->rec.y + offset_luma,
|
|
|
|
lcu_adapter.u = lcu->rec.u + offset_chroma,
|
|
|
|
lcu_adapter.v = lcu->rec.v + offset_chroma,
|
|
|
|
|
2019-09-02 15:46:06 +00:00
|
|
|
inter_recon_unipred(state,
|
|
|
|
ref,
|
|
|
|
pu_x, pu_y,
|
|
|
|
pu_w, pu_h,
|
2020-04-04 19:14:10 +00:00
|
|
|
LCU_WIDTH,
|
2019-09-02 15:46:06 +00:00
|
|
|
pu->inter.mv[mv_idx],
|
2020-04-04 19:14:10 +00:00
|
|
|
&lcu_adapter,
|
2019-09-02 15:46:06 +00:00
|
|
|
NULL,
|
|
|
|
predict_luma, predict_chroma);
|
2018-01-17 11:09:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-04-23 11:39:41 +00:00
|
|
|
/**
|
2016-05-23 02:17:35 +00:00
|
|
|
* \brief Clear unused L0/L1 motion vectors and reference
|
2015-04-23 11:39:41 +00:00
|
|
|
* \param cu coding unit to clear
|
|
|
|
*/
|
2016-05-23 02:17:35 +00:00
|
|
|
static void inter_clear_cu_unused(cu_info_t* cu)
|
|
|
|
{
|
2015-08-31 10:01:24 +00:00
|
|
|
for (unsigned i = 0; i < 2; ++i) {
|
|
|
|
if (cu->inter.mv_dir & (1 << i)) continue;
|
|
|
|
|
|
|
|
cu->inter.mv[i][0] = 0;
|
|
|
|
cu->inter.mv[i][1] = 0;
|
|
|
|
cu->inter.mv_ref[i] = 255;
|
2015-04-23 09:18:33 +00:00
|
|
|
}
|
|
|
|
}
|
2015-04-21 09:05:21 +00:00
|
|
|
|
2013-09-19 12:08:30 +00:00
|
|
|
/**
|
2016-05-10 00:47:20 +00:00
|
|
|
* \brief Check whether a0 mv cand block is coded before the current block.
|
|
|
|
* \param x x-coordinate of the current block (in pixels)
|
|
|
|
* \param y y-coordinate of the current block (in pixels)
|
|
|
|
* \param width width of the current block (in pixels)
|
|
|
|
* \param height height of the current block (in pixels)
|
|
|
|
* \return True, if the a0 mv candidate block is coded before the
|
|
|
|
* current block. Otherwise false.
|
|
|
|
*/
|
|
|
|
static bool is_a0_cand_coded(int x, int y, int width, int height)
|
|
|
|
{
|
|
|
|
int size = MIN(width & ~(width - 1), height & ~(height - 1));
|
|
|
|
|
|
|
|
if (height != size) {
|
|
|
|
// For SMP and AMP blocks the situation is equivalent to a square block
|
|
|
|
// at the lower left corner of the PU.
|
|
|
|
y = y + height - size;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (size < LCU_WIDTH) {
|
|
|
|
const int parent_size = 2 * size;
|
|
|
|
const int cu_index = (x % parent_size != 0) + 2 * (y % parent_size != 0);
|
|
|
|
switch (cu_index) {
|
|
|
|
case 0:
|
|
|
|
// A0 is in the CU directly left of the parent CU so it has been
|
|
|
|
// coded already.
|
|
|
|
// +---+---+
|
|
|
|
// | X | |
|
|
|
|
// |---+---+
|
|
|
|
// A0 | | |
|
|
|
|
// +---+---+
|
|
|
|
return true;
|
|
|
|
|
|
|
|
case 1:
|
|
|
|
// A0 is in the CU that will be coded after the current CU.
|
|
|
|
// +---+---+
|
|
|
|
// | | X |
|
|
|
|
// |---+---+
|
|
|
|
// |A0 | |
|
|
|
|
// +---+---+
|
|
|
|
return false;
|
|
|
|
|
|
|
|
case 2:
|
|
|
|
// +---+---+
|
|
|
|
// | | |
|
|
|
|
// |---+---+
|
|
|
|
// | X | |
|
|
|
|
// +---+---+
|
|
|
|
// A0
|
|
|
|
|
|
|
|
// Move to the parent block.
|
|
|
|
y -= size;
|
|
|
|
size = parent_size;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 3:
|
|
|
|
// A0 is in the CU directly down of the parent CU so is has not
|
|
|
|
// been coded yet.
|
|
|
|
// +---+---+
|
|
|
|
// | | |
|
|
|
|
// |---+---+
|
|
|
|
// | | X |
|
|
|
|
// +---+---+
|
|
|
|
// A0
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// For 64x64 blocks A0 candidate is located outside the LCU.
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* \brief Check whether b0 mv cand block is coded before the current block.
|
|
|
|
* \param x x-coordinate of the current block (in pixels)
|
|
|
|
* \param y y-coordinate of the current block (in pixels)
|
|
|
|
* \param width width of the current block (in pixels)
|
|
|
|
* \param height height of the current block (in pixels)
|
|
|
|
* \return True, if the b0 mv candidate block is coded before the
|
|
|
|
* current block. Otherwise false.
|
2013-09-19 12:08:30 +00:00
|
|
|
*/
|
2016-05-10 00:47:20 +00:00
|
|
|
static bool is_b0_cand_coded(int x, int y, int width, int height)
|
|
|
|
{
|
|
|
|
int size = MIN(width & ~(width - 1), height & ~(height - 1));
|
|
|
|
|
|
|
|
if (width != size) {
|
|
|
|
// For SMP and AMP blocks the situation is equivalent to a square block
|
|
|
|
// at the upper right corner of the PU.
|
|
|
|
x = x + width - size;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (size < LCU_WIDTH) {
|
|
|
|
const int parent_size = 2 * size;
|
|
|
|
const int cu_index = (x % parent_size != 0) + 2 * (y % parent_size != 0);
|
|
|
|
switch (cu_index) {
|
|
|
|
case 0:
|
|
|
|
// B0 is in the CU directly above the parent CU so it has been
|
|
|
|
// coded already.
|
|
|
|
// B0
|
|
|
|
// +---+---+
|
|
|
|
// | X | |
|
|
|
|
// |---+---+
|
|
|
|
// | | |
|
|
|
|
// +---+---+
|
|
|
|
return true;
|
|
|
|
|
|
|
|
case 1:
|
|
|
|
// B0
|
|
|
|
// +---+---+
|
|
|
|
// | | X |
|
|
|
|
// |---+---+
|
|
|
|
// | | |
|
|
|
|
// +---+---+
|
|
|
|
|
|
|
|
// Move to the parent block.
|
|
|
|
x -= size;
|
|
|
|
size = parent_size;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 2:
|
|
|
|
// +---+---+
|
|
|
|
// | |B0 |
|
|
|
|
// |---+---+
|
|
|
|
// | X | |
|
|
|
|
// +---+---+
|
|
|
|
return true;
|
|
|
|
|
|
|
|
case 3:
|
|
|
|
// B0 is in the CU directly right of the parent CU so is has not
|
|
|
|
// been coded yet.
|
|
|
|
// +---+---+
|
|
|
|
// | | | B0
|
|
|
|
// |---+---+
|
|
|
|
// | | X |
|
|
|
|
// +---+---+
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// The LCU to the right and up of the current LCU has been coded already.
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2016-06-14 05:49:35 +00:00
|
|
|
|
|
|
|
/**
|
2017-02-22 05:37:20 +00:00
|
|
|
* \brief Get merge candidates for current block
|
|
|
|
*
|
2017-06-26 12:31:57 +00:00
|
|
|
* \param state encoder control state to use
|
2017-02-22 05:37:20 +00:00
|
|
|
* \param x block x position in SCU
|
|
|
|
* \param y block y position in SCU
|
|
|
|
* \param width current block width
|
|
|
|
* \param height current block height
|
2017-06-26 12:31:57 +00:00
|
|
|
* \param ref_list which reference list, L0 is 1 and L1 is 2
|
|
|
|
* \param ref_idx index in the reference list
|
2017-02-22 05:37:20 +00:00
|
|
|
* \param cand_out will be filled with C3 and H candidates
|
|
|
|
*/
|
|
|
|
static void get_temporal_merge_candidates(const encoder_state_t * const state,
|
|
|
|
int32_t x,
|
|
|
|
int32_t y,
|
|
|
|
int32_t width,
|
|
|
|
int32_t height,
|
|
|
|
uint8_t ref_list,
|
|
|
|
uint8_t ref_idx,
|
|
|
|
merge_candidates_t *cand_out)
|
|
|
|
{
|
2016-06-14 05:49:35 +00:00
|
|
|
/*
|
|
|
|
Predictor block locations
|
|
|
|
_________
|
|
|
|
|CurrentPU|
|
|
|
|
| |C0|__ |
|
|
|
|
| |C3| |
|
|
|
|
|_________|_
|
2016-06-16 08:41:38 +00:00
|
|
|
|H|
|
2016-06-14 05:49:35 +00:00
|
|
|
*/
|
|
|
|
|
2017-02-22 05:37:20 +00:00
|
|
|
cand_out->c3 = cand_out->h = NULL;
|
2016-06-16 08:41:38 +00:00
|
|
|
|
2017-01-04 08:59:12 +00:00
|
|
|
// Find temporal reference
|
2016-08-10 11:03:25 +00:00
|
|
|
if (state->frame->ref->used_size) {
|
2017-06-26 12:31:57 +00:00
|
|
|
uint32_t colocated_ref;
|
2016-06-14 05:49:35 +00:00
|
|
|
|
2017-01-04 08:59:12 +00:00
|
|
|
// Select L0/L1 ref_idx reference
|
2017-06-26 12:31:57 +00:00
|
|
|
if (state->frame->ref_LX_size[ref_list-1] > ref_idx) {
|
|
|
|
colocated_ref = state->frame->ref_LX[ref_list - 1][ref_idx];
|
|
|
|
} else {
|
|
|
|
// not found
|
|
|
|
return;
|
2016-06-14 05:49:35 +00:00
|
|
|
}
|
|
|
|
|
2016-12-22 11:00:31 +00:00
|
|
|
cu_array_t *ref_cu_array = state->frame->ref->cu_arrays[colocated_ref];
|
2016-06-27 07:11:02 +00:00
|
|
|
int cu_per_width = ref_cu_array->width / SCU_WIDTH;
|
2016-06-14 05:49:35 +00:00
|
|
|
|
|
|
|
uint32_t xColBr = x + width;
|
|
|
|
uint32_t yColBr = y + height;
|
|
|
|
|
|
|
|
// H must be available
|
2016-06-16 08:41:38 +00:00
|
|
|
if (xColBr < state->encoder_control->in.width &&
|
|
|
|
yColBr < state->encoder_control->in.height) {
|
2016-06-14 05:49:35 +00:00
|
|
|
int32_t H_offset = -1;
|
|
|
|
|
2016-06-17 07:44:20 +00:00
|
|
|
// Y inside the current CTU / LCU
|
|
|
|
if (yColBr % LCU_WIDTH != 0) {
|
2016-06-27 07:11:02 +00:00
|
|
|
H_offset = ((xColBr >> 4) << 4) / SCU_WIDTH +
|
|
|
|
(((yColBr >> 4) << 4) / SCU_WIDTH) * cu_per_width;
|
2016-06-14 05:49:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (H_offset >= 0) {
|
|
|
|
// Only use when it's inter block
|
|
|
|
if (ref_cu_array->data[H_offset].type == CU_INTER) {
|
2017-02-22 05:37:20 +00:00
|
|
|
cand_out->h = &ref_cu_array->data[H_offset];
|
2016-06-14 05:49:35 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
uint32_t xColCtr = x + (width / 2);
|
|
|
|
uint32_t yColCtr = y + (height / 2);
|
|
|
|
|
|
|
|
// C3 must be inside the LCU, in the center position of current CU
|
2016-06-16 08:41:38 +00:00
|
|
|
if (xColCtr < state->encoder_control->in.width && yColCtr < state->encoder_control->in.height) {
|
2016-06-27 07:11:02 +00:00
|
|
|
uint32_t C3_offset = ((xColCtr >> 4) << 4) / SCU_WIDTH + ((((yColCtr >> 4) << 4) / SCU_WIDTH) * cu_per_width);
|
2016-06-14 05:49:35 +00:00
|
|
|
if (ref_cu_array->data[C3_offset].type == CU_INTER) {
|
2017-02-22 05:37:20 +00:00
|
|
|
cand_out->c3 = &ref_cu_array->data[C3_offset];
|
2016-06-14 05:49:35 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-05-10 00:47:20 +00:00
|
|
|
/**
|
|
|
|
* \brief Get merge candidates for current block.
|
|
|
|
*
|
|
|
|
* The output parameters b0, b1, b2, a0, a1 are pointed to the
|
|
|
|
* corresponding cu_info_t struct in lcu->cu, or set to NULL, if the
|
|
|
|
* candidate is not available.
|
|
|
|
*
|
|
|
|
* \param x block x position in pixels
|
|
|
|
* \param y block y position in pixels
|
|
|
|
* \param width block width in pixels
|
|
|
|
* \param height block height in pixels
|
|
|
|
* \param picture_width tile width in pixels
|
|
|
|
* \param picture_height tile height in pixels
|
|
|
|
* \param lcu current LCU
|
2017-02-22 05:37:20 +00:00
|
|
|
* \param cand_out will be filled with A and B candidates
|
2016-05-10 00:47:20 +00:00
|
|
|
*/
|
|
|
|
static void get_spatial_merge_candidates(int32_t x,
|
|
|
|
int32_t y,
|
|
|
|
int32_t width,
|
|
|
|
int32_t height,
|
|
|
|
int32_t picture_width,
|
|
|
|
int32_t picture_height,
|
2017-02-22 05:37:20 +00:00
|
|
|
lcu_t *lcu,
|
|
|
|
merge_candidates_t *cand_out)
|
2013-09-16 13:37:24 +00:00
|
|
|
{
|
|
|
|
/*
|
|
|
|
Predictor block locations
|
2013-09-18 07:15:05 +00:00
|
|
|
____ _______
|
2013-09-16 13:37:24 +00:00
|
|
|
|B2|______|B1|B0|
|
|
|
|
| |
|
|
|
|
| Cur CU |
|
|
|
|
__| |
|
|
|
|
|A1|_________|
|
|
|
|
|A0|
|
2014-02-21 13:00:20 +00:00
|
|
|
*/
|
2016-01-12 11:27:58 +00:00
|
|
|
int32_t x_local = SUB_SCU(x); //!< coordinates from top-left of this LCU
|
|
|
|
int32_t y_local = SUB_SCU(y);
|
2013-09-19 12:08:30 +00:00
|
|
|
// A0 and A1 availability testing
|
2014-03-03 14:08:35 +00:00
|
|
|
if (x != 0) {
|
2017-02-22 05:37:20 +00:00
|
|
|
cu_info_t *a1 = LCU_GET_CU_AT_PX(lcu, x_local - 1, y_local + height - 1);
|
|
|
|
// Do not check a1->coded because the block above is always coded before
|
2015-11-02 08:26:02 +00:00
|
|
|
// the current one and the flag is not set when searching an SMP block.
|
2017-02-22 05:37:20 +00:00
|
|
|
if (a1->type == CU_INTER) {
|
|
|
|
inter_clear_cu_unused(a1);
|
|
|
|
cand_out->a[1] = a1;
|
2015-11-02 08:26:02 +00:00
|
|
|
}
|
2013-09-16 13:37:24 +00:00
|
|
|
|
2016-01-12 11:27:58 +00:00
|
|
|
if (y_local + height < LCU_WIDTH && y + height < picture_height) {
|
2017-02-22 05:37:20 +00:00
|
|
|
cu_info_t *a0 = LCU_GET_CU_AT_PX(lcu, x_local - 1, y_local + height);
|
|
|
|
if (a0->type == CU_INTER && is_a0_cand_coded(x, y, width, height)) {
|
|
|
|
inter_clear_cu_unused(a0);
|
|
|
|
cand_out->a[0] = a0;
|
2015-11-02 08:26:02 +00:00
|
|
|
}
|
2013-09-16 13:37:24 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-09-19 12:08:30 +00:00
|
|
|
// B0, B1 and B2 availability testing
|
2014-03-03 14:08:35 +00:00
|
|
|
if (y != 0) {
|
2017-02-22 05:37:20 +00:00
|
|
|
cu_info_t *b0 = NULL;
|
2016-05-10 00:47:20 +00:00
|
|
|
if (x + width < picture_width) {
|
2016-01-12 11:27:58 +00:00
|
|
|
if (x_local + width < LCU_WIDTH) {
|
2017-02-22 05:37:20 +00:00
|
|
|
b0 = LCU_GET_CU_AT_PX(lcu, x_local + width, y_local - 1);
|
2016-01-12 11:27:58 +00:00
|
|
|
} else if (y_local == 0) {
|
2016-05-10 00:47:20 +00:00
|
|
|
// Special case, top-right CU
|
2017-02-22 05:37:20 +00:00
|
|
|
b0 = LCU_GET_TOP_RIGHT_CU(lcu);
|
2016-05-10 00:47:20 +00:00
|
|
|
}
|
2013-10-02 12:10:40 +00:00
|
|
|
}
|
2017-02-22 05:37:20 +00:00
|
|
|
if (b0 && b0->type == CU_INTER && is_b0_cand_coded(x, y, width, height)) {
|
|
|
|
inter_clear_cu_unused(b0);
|
|
|
|
cand_out->b[0] = b0;
|
2015-11-02 08:26:02 +00:00
|
|
|
}
|
2014-03-06 16:14:01 +00:00
|
|
|
|
2017-02-22 05:37:20 +00:00
|
|
|
cu_info_t *b1 = LCU_GET_CU_AT_PX(lcu, x_local + width - 1, y_local - 1);
|
|
|
|
// Do not check b1->coded because the block to the left is always coded
|
2015-11-02 08:26:02 +00:00
|
|
|
// before the current one and the flag is not set when searching an SMP
|
|
|
|
// block.
|
2017-02-22 05:37:20 +00:00
|
|
|
if (b1->type == CU_INTER) {
|
|
|
|
inter_clear_cu_unused(b1);
|
|
|
|
cand_out->b[1] = b1;
|
2015-11-02 08:26:02 +00:00
|
|
|
}
|
2013-09-16 13:37:24 +00:00
|
|
|
|
2014-03-04 13:32:15 +00:00
|
|
|
if (x != 0) {
|
2017-02-22 05:37:20 +00:00
|
|
|
cu_info_t *b2 = LCU_GET_CU_AT_PX(lcu, x_local - 1, y_local - 1);
|
|
|
|
// Do not check b2->coded because the block above and to the left is
|
2015-11-02 08:26:02 +00:00
|
|
|
// always coded before the current one.
|
2017-02-22 05:37:20 +00:00
|
|
|
if (b2->type == CU_INTER) {
|
|
|
|
inter_clear_cu_unused(b2);
|
|
|
|
cand_out->b[2] = b2;
|
2015-11-02 08:26:02 +00:00
|
|
|
}
|
2013-09-16 13:37:24 +00:00
|
|
|
}
|
|
|
|
}
|
2013-10-11 08:59:10 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2016-05-17 01:25:45 +00:00
|
|
|
* \brief Get merge candidates for current block.
|
|
|
|
*
|
|
|
|
* The output parameters b0, b1, b2, a0, a1 are pointed to the
|
|
|
|
* corresponding cu_info_t struct in lcu->cu, or set to NULL, if the
|
|
|
|
* candidate is not available.
|
|
|
|
*
|
2015-12-16 12:53:18 +00:00
|
|
|
* \param cua cu information
|
2016-05-17 01:25:45 +00:00
|
|
|
* \param x block x position in pixels
|
|
|
|
* \param y block y position in pixels
|
|
|
|
* \param width block width in pixels
|
|
|
|
* \param height block height in pixels
|
|
|
|
* \param picture_width tile width in pixels
|
|
|
|
* \param picture_height tile height in pixels
|
2017-02-22 05:37:20 +00:00
|
|
|
* \param cand_out will be filled with A and B candidates
|
2013-10-11 08:59:10 +00:00
|
|
|
*/
|
2015-12-16 12:53:18 +00:00
|
|
|
static void get_spatial_merge_candidates_cua(const cu_array_t *cua,
|
|
|
|
int32_t x,
|
2016-05-17 01:25:45 +00:00
|
|
|
int32_t y,
|
|
|
|
int32_t width,
|
|
|
|
int32_t height,
|
|
|
|
int32_t picture_width,
|
|
|
|
int32_t picture_height,
|
2017-02-22 05:37:20 +00:00
|
|
|
merge_candidates_t *cand_out)
|
2016-05-17 01:25:45 +00:00
|
|
|
{
|
|
|
|
/*
|
|
|
|
Predictor block locations
|
|
|
|
____ _______
|
|
|
|
|B2|______|B1|B0|
|
|
|
|
| |
|
|
|
|
| Cur CU |
|
|
|
|
__| |
|
|
|
|
|A1|_________|
|
|
|
|
|A0|
|
|
|
|
*/
|
2015-12-16 12:53:18 +00:00
|
|
|
int32_t x_local = SUB_SCU(x); //!< coordinates from top-left of this LCU
|
|
|
|
int32_t y_local = SUB_SCU(y);
|
2016-05-17 01:25:45 +00:00
|
|
|
// A0 and A1 availability testing
|
|
|
|
if (x != 0) {
|
2017-02-22 05:37:20 +00:00
|
|
|
const cu_info_t *a1 = kvz_cu_array_at_const(cua, x - 1, y + height - 1);
|
2015-12-16 12:53:18 +00:00
|
|
|
// The block above is always coded before the current one.
|
2017-02-22 05:37:20 +00:00
|
|
|
if (a1->type == CU_INTER) {
|
|
|
|
cand_out->a[1] = a1;
|
2016-05-17 01:25:45 +00:00
|
|
|
}
|
|
|
|
|
2015-12-16 12:53:18 +00:00
|
|
|
if (y_local + height < LCU_WIDTH && y + height < picture_height) {
|
2017-02-22 05:37:20 +00:00
|
|
|
const cu_info_t *a0 = kvz_cu_array_at_const(cua, x - 1, y + height);
|
|
|
|
if (a0->type == CU_INTER && is_a0_cand_coded(x, y, width, height)) {
|
|
|
|
cand_out->a[0] = a0;
|
2016-05-17 01:25:45 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// B0, B1 and B2 availability testing
|
|
|
|
if (y != 0) {
|
2015-12-16 12:53:18 +00:00
|
|
|
if (x + width < picture_width && (x_local + width < LCU_WIDTH || y_local == 0)) {
|
2017-02-22 05:37:20 +00:00
|
|
|
const cu_info_t *b0 = kvz_cu_array_at_const(cua, x + width, y - 1);
|
|
|
|
if (b0->type == CU_INTER && is_b0_cand_coded(x, y, width, height)) {
|
|
|
|
cand_out->b[0] = b0;
|
2016-05-17 01:25:45 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-02-22 05:37:20 +00:00
|
|
|
const cu_info_t *b1 = kvz_cu_array_at_const(cua, x + width - 1, y - 1);
|
2015-12-16 12:53:18 +00:00
|
|
|
// The block to the left is always coded before the current one.
|
2017-02-22 05:37:20 +00:00
|
|
|
if (b1->type == CU_INTER) {
|
|
|
|
cand_out->b[1] = b1;
|
2016-05-17 01:25:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (x != 0) {
|
2017-02-22 05:37:20 +00:00
|
|
|
const cu_info_t *b2 = kvz_cu_array_at_const(cua, x - 1, y - 1);
|
2015-12-16 12:53:18 +00:00
|
|
|
// The block above and to the left is always coded before the current
|
|
|
|
// one.
|
2017-02-22 05:37:20 +00:00
|
|
|
if (b2->type == CU_INTER) {
|
|
|
|
cand_out->b[2] = b2;
|
2016-05-17 01:25:45 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-02-21 16:11:53 +00:00
|
|
|
static INLINE int16_t get_scaled_mv(int16_t mv, int scale)
|
|
|
|
{
|
|
|
|
int32_t scaled = scale * mv;
|
|
|
|
return CLIP(-32768, 32767, (scaled + 127 + (scaled < 0)) >> 8);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void apply_mv_scaling_pocs(int32_t current_poc,
|
|
|
|
int32_t current_ref_poc,
|
|
|
|
int32_t neighbor_poc,
|
|
|
|
int32_t neighbor_ref_poc,
|
|
|
|
int16_t mv_cand[2])
|
|
|
|
{
|
|
|
|
int32_t diff_current = current_poc - current_ref_poc;
|
|
|
|
int32_t diff_neighbor = neighbor_poc - neighbor_ref_poc;
|
|
|
|
|
|
|
|
if (diff_current == diff_neighbor) return;
|
|
|
|
|
|
|
|
diff_current = CLIP(-128, 127, diff_current);
|
|
|
|
diff_neighbor = CLIP(-128, 127, diff_neighbor);
|
|
|
|
|
|
|
|
int scale = CLIP(-4096, 4095,
|
|
|
|
(diff_current * ((0x4000 + (abs(diff_neighbor) >> 1)) / diff_neighbor) + 32) >> 6);
|
|
|
|
|
|
|
|
mv_cand[0] = get_scaled_mv(mv_cand[0], scale);
|
|
|
|
mv_cand[1] = get_scaled_mv(mv_cand[1], scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static INLINE void apply_mv_scaling(const encoder_state_t *state,
|
|
|
|
const cu_info_t *current_cu,
|
|
|
|
const cu_info_t *neighbor_cu,
|
|
|
|
int8_t current_reflist,
|
|
|
|
int8_t neighbor_reflist,
|
|
|
|
int16_t mv_cand[2])
|
|
|
|
{
|
|
|
|
apply_mv_scaling_pocs(state->frame->poc,
|
2017-06-26 12:31:57 +00:00
|
|
|
state->frame->ref->pocs[
|
|
|
|
state->frame->ref_LX[current_reflist][
|
|
|
|
current_cu->inter.mv_ref[current_reflist]]],
|
2017-02-21 16:11:53 +00:00
|
|
|
state->frame->poc,
|
2017-06-26 12:31:57 +00:00
|
|
|
state->frame->ref->pocs[
|
2017-07-07 10:58:19 +00:00
|
|
|
state->frame->ref_LX[neighbor_reflist][
|
2017-06-26 12:31:57 +00:00
|
|
|
neighbor_cu->inter.mv_ref[neighbor_reflist]]],
|
2017-02-21 16:11:53 +00:00
|
|
|
mv_cand);
|
|
|
|
}
|
|
|
|
|
2017-02-21 17:08:10 +00:00
|
|
|
/**
|
|
|
|
* \brief Try to add a temporal MVP or merge candidate.
|
|
|
|
*
|
|
|
|
* \param state encoder state
|
|
|
|
* \param current_ref index of the picture referenced by the current CU
|
|
|
|
* \param colocated colocated CU
|
|
|
|
* \param reflist either 0 (for L0) or 1 (for L1)
|
|
|
|
* \param[out] mv_out Returns the motion vector
|
|
|
|
*
|
|
|
|
* \return Whether a temporal candidate was added or not.
|
|
|
|
*/
|
|
|
|
static bool add_temporal_candidate(const encoder_state_t *state,
|
|
|
|
uint8_t current_ref,
|
|
|
|
const cu_info_t *colocated,
|
|
|
|
int32_t reflist,
|
2017-08-09 08:33:28 +00:00
|
|
|
int16_t mv_out[2])
|
2017-02-21 17:08:10 +00:00
|
|
|
{
|
|
|
|
if (!colocated) return false;
|
|
|
|
|
2017-06-26 12:31:57 +00:00
|
|
|
int colocated_ref;
|
|
|
|
if (state->frame->ref_LX_size[0] > 0) {
|
|
|
|
// get the first reference from L0 if it exists
|
|
|
|
colocated_ref = state->frame->ref_LX[0][0];
|
|
|
|
} else {
|
|
|
|
// otherwise no candidate added
|
|
|
|
return false;
|
2017-02-21 17:08:10 +00:00
|
|
|
}
|
|
|
|
|
2017-10-25 09:17:17 +00:00
|
|
|
// When there are reference pictures from the future (POC > current POC)
|
|
|
|
// in L0 or L1, the primary list for the colocated PU is the inverse of
|
|
|
|
// collocated_from_l0_flag. Otherwise it is equal to reflist.
|
|
|
|
//
|
2018-01-31 11:50:57 +00:00
|
|
|
// Kvazaar always sets collocated_from_l0_flag so the list is L1 when
|
|
|
|
// there are future references.
|
|
|
|
int col_list = reflist;
|
|
|
|
for (int i = 0; i < state->frame->ref->used_size; i++) {
|
|
|
|
if (state->frame->ref->pocs[i] > state->frame->poc) {
|
|
|
|
col_list = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2017-10-25 09:17:17 +00:00
|
|
|
|
|
|
|
if ((colocated->inter.mv_dir & (col_list + 1)) == 0) {
|
|
|
|
// Use the other list if the colocated PU does not have a MV for the
|
|
|
|
// primary list.
|
|
|
|
col_list = 1 - col_list;
|
|
|
|
}
|
2017-02-21 17:08:10 +00:00
|
|
|
|
2017-10-25 09:17:17 +00:00
|
|
|
mv_out[0] = colocated->inter.mv[col_list][0];
|
|
|
|
mv_out[1] = colocated->inter.mv[col_list][1];
|
2017-02-21 17:08:10 +00:00
|
|
|
apply_mv_scaling_pocs(
|
|
|
|
state->frame->poc,
|
|
|
|
state->frame->ref->pocs[current_ref],
|
|
|
|
state->frame->ref->pocs[colocated_ref],
|
2017-08-21 13:34:57 +00:00
|
|
|
state->frame->ref->images[colocated_ref]->ref_pocs[
|
|
|
|
state->frame->ref->ref_LXs[colocated_ref]
|
2017-10-25 09:17:17 +00:00
|
|
|
[col_list][colocated->inter.mv_ref[col_list]]],
|
2017-02-21 17:08:10 +00:00
|
|
|
mv_out
|
|
|
|
);
|
2017-09-07 10:43:53 +00:00
|
|
|
|
2017-02-21 17:08:10 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2017-02-22 05:32:51 +00:00
|
|
|
static INLINE bool add_mvp_candidate(const encoder_state_t *state,
|
|
|
|
const cu_info_t *cur_cu,
|
|
|
|
const cu_info_t *cand,
|
|
|
|
int8_t reflist,
|
|
|
|
bool scaling,
|
|
|
|
int16_t mv_cand_out[2])
|
|
|
|
{
|
|
|
|
if (!cand) return false;
|
|
|
|
|
2017-06-20 13:31:04 +00:00
|
|
|
assert(cand->inter.mv_dir != 0);
|
2017-02-22 05:32:51 +00:00
|
|
|
|
2018-01-31 11:50:57 +00:00
|
|
|
for (int i = 0; i < 2; i++) {
|
|
|
|
const int cand_list = i == 0 ? reflist : !reflist;
|
|
|
|
|
|
|
|
if ((cand->inter.mv_dir & (1 << cand_list)) == 0) continue;
|
2017-02-22 05:32:51 +00:00
|
|
|
|
2018-01-31 11:50:57 +00:00
|
|
|
if (scaling) {
|
|
|
|
mv_cand_out[0] = cand->inter.mv[cand_list][0];
|
|
|
|
mv_cand_out[1] = cand->inter.mv[cand_list][1];
|
|
|
|
apply_mv_scaling(state, cur_cu, cand, reflist, cand_list, mv_cand_out);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (cand->inter.mv_dir & (1 << cand_list) &&
|
|
|
|
state->frame->ref_LX[cand_list][cand->inter.mv_ref[cand_list]] ==
|
|
|
|
state->frame->ref_LX[reflist][cur_cu->inter.mv_ref[reflist]])
|
|
|
|
{
|
|
|
|
mv_cand_out[0] = cand->inter.mv[cand_list][0];
|
|
|
|
mv_cand_out[1] = cand->inter.mv[cand_list][1];
|
|
|
|
return true;
|
|
|
|
}
|
2017-02-22 05:32:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2016-05-17 01:25:45 +00:00
|
|
|
/**
|
2017-01-02 10:04:05 +00:00
|
|
|
* \brief Pick two mv candidates from the spatial and temporal candidates.
|
2016-05-17 01:25:45 +00:00
|
|
|
*/
|
2017-01-02 10:04:05 +00:00
|
|
|
static void get_mv_cand_from_candidates(const encoder_state_t * const state,
|
2017-02-22 05:37:20 +00:00
|
|
|
int32_t x,
|
|
|
|
int32_t y,
|
|
|
|
int32_t width,
|
|
|
|
int32_t height,
|
|
|
|
const merge_candidates_t *merge_cand,
|
|
|
|
const cu_info_t *cur_cu,
|
|
|
|
int8_t reflist,
|
|
|
|
int16_t mv_cand[2][2])
|
2014-02-21 13:00:20 +00:00
|
|
|
{
|
2017-02-22 05:37:20 +00:00
|
|
|
const cu_info_t *const *a = merge_cand->a;
|
|
|
|
const cu_info_t *const *b = merge_cand->b;
|
|
|
|
const cu_info_t *c3 = merge_cand->c3;
|
|
|
|
const cu_info_t *h = merge_cand->h;
|
|
|
|
|
2013-10-11 08:59:10 +00:00
|
|
|
uint8_t candidates = 0;
|
2014-02-14 13:50:30 +00:00
|
|
|
uint8_t b_candidates = 0;
|
2013-10-11 08:59:10 +00:00
|
|
|
|
2017-02-22 05:32:51 +00:00
|
|
|
// Left predictors without scaling
|
2017-02-22 05:37:20 +00:00
|
|
|
for (int i = 0; i < 2; i++) {
|
|
|
|
if (add_mvp_candidate(state, cur_cu, a[i], reflist, false, mv_cand[candidates])) {
|
|
|
|
candidates++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2013-09-16 13:37:24 +00:00
|
|
|
|
2017-02-22 05:32:51 +00:00
|
|
|
// Left predictors with scaling
|
2017-02-22 05:37:20 +00:00
|
|
|
if (candidates == 0) {
|
|
|
|
for (int i = 0; i < 2; i++) {
|
|
|
|
if (add_mvp_candidate(state, cur_cu, a[i], reflist, true, mv_cand[candidates])) {
|
|
|
|
candidates++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2014-02-14 13:50:30 +00:00
|
|
|
}
|
|
|
|
|
2017-02-22 05:32:51 +00:00
|
|
|
// Top predictors without scaling
|
2017-02-22 05:37:20 +00:00
|
|
|
for (int i = 0; i < 3; i++) {
|
|
|
|
if (add_mvp_candidate(state, cur_cu, b[i], reflist, false, mv_cand[candidates])) {
|
|
|
|
b_candidates++;
|
|
|
|
break;
|
|
|
|
}
|
2014-02-14 13:50:30 +00:00
|
|
|
}
|
2017-02-22 05:32:51 +00:00
|
|
|
|
2014-02-14 13:50:30 +00:00
|
|
|
candidates += b_candidates;
|
|
|
|
|
2017-02-22 05:32:51 +00:00
|
|
|
// When a1 or a0 is available, we dont check for secondary B candidates.
|
2017-02-22 05:37:20 +00:00
|
|
|
if (a[0] || a[1]) {
|
2014-02-18 15:27:45 +00:00
|
|
|
b_candidates = 1;
|
2017-02-22 05:32:51 +00:00
|
|
|
} else if (candidates != 2) {
|
2014-02-18 15:27:45 +00:00
|
|
|
b_candidates = 0;
|
|
|
|
}
|
2014-02-17 15:39:40 +00:00
|
|
|
|
2017-02-21 16:11:53 +00:00
|
|
|
if (!b_candidates) {
|
|
|
|
// Top predictors with scaling
|
2017-02-22 05:37:20 +00:00
|
|
|
for (int i = 0; i < 3; i++) {
|
|
|
|
if (add_mvp_candidate(state, cur_cu, b[i], reflist, true, mv_cand[candidates])) {
|
|
|
|
candidates++;
|
|
|
|
break;
|
|
|
|
}
|
2014-02-14 13:50:30 +00:00
|
|
|
}
|
2013-09-16 13:37:24 +00:00
|
|
|
}
|
|
|
|
|
2013-09-19 12:08:30 +00:00
|
|
|
// Remove identical candidate
|
2016-12-15 10:13:14 +00:00
|
|
|
if (candidates == 2 && mv_cand[0][0] == mv_cand[1][0] && mv_cand[0][1] == mv_cand[1][1]) {
|
2013-09-18 07:15:05 +00:00
|
|
|
candidates = 1;
|
|
|
|
}
|
|
|
|
|
2017-02-21 14:56:01 +00:00
|
|
|
// Use Temporal Motion Vector Prediction when enabled.
|
|
|
|
// TMVP required at least two sequential P/B-frames.
|
|
|
|
bool can_use_tmvp =
|
|
|
|
state->encoder_control->cfg.tmvp_enable &&
|
|
|
|
state->frame->poc > 1 &&
|
|
|
|
state->frame->ref->used_size &&
|
|
|
|
candidates < AMVP_MAX_NUM_CANDS &&
|
|
|
|
(h != NULL || c3 != NULL);
|
|
|
|
|
2017-02-21 17:08:10 +00:00
|
|
|
if (can_use_tmvp && add_temporal_candidate(state,
|
2017-06-26 12:31:57 +00:00
|
|
|
state->frame->ref_LX[reflist][cur_cu->inter.mv_ref[reflist]],
|
2017-02-21 17:08:10 +00:00
|
|
|
(h != NULL) ? h : c3,
|
|
|
|
reflist,
|
2017-10-25 09:17:17 +00:00
|
|
|
mv_cand[candidates]))
|
|
|
|
{
|
2017-02-21 17:08:10 +00:00
|
|
|
candidates++;
|
|
|
|
}
|
2013-09-16 13:37:24 +00:00
|
|
|
|
2013-09-19 12:08:30 +00:00
|
|
|
// Fill with (0,0)
|
2013-10-11 13:12:04 +00:00
|
|
|
while (candidates < AMVP_MAX_NUM_CANDS) {
|
2013-09-16 13:37:24 +00:00
|
|
|
mv_cand[candidates][0] = 0;
|
|
|
|
mv_cand[candidates][1] = 0;
|
|
|
|
candidates++;
|
|
|
|
}
|
2013-09-19 12:08:30 +00:00
|
|
|
}
|
2013-10-11 13:12:04 +00:00
|
|
|
|
2016-05-17 01:25:45 +00:00
|
|
|
/**
|
|
|
|
* \brief Get MV prediction for current block.
|
|
|
|
*
|
|
|
|
* \param state encoder state
|
|
|
|
* \param x block x position in pixels
|
|
|
|
* \param y block y position in pixels
|
|
|
|
* \param width block width in pixels
|
|
|
|
* \param height block height in pixels
|
|
|
|
* \param mv_cand Return the motion vector candidates.
|
|
|
|
* \param cur_cu current CU
|
|
|
|
* \param lcu current LCU
|
|
|
|
* \param reflist reflist index (either 0 or 1)
|
|
|
|
*/
|
|
|
|
void kvz_inter_get_mv_cand(const encoder_state_t * const state,
|
|
|
|
int32_t x,
|
|
|
|
int32_t y,
|
|
|
|
int32_t width,
|
|
|
|
int32_t height,
|
|
|
|
int16_t mv_cand[2][2],
|
|
|
|
cu_info_t* cur_cu,
|
|
|
|
lcu_t *lcu,
|
|
|
|
int8_t reflist)
|
|
|
|
{
|
2017-02-22 05:37:20 +00:00
|
|
|
merge_candidates_t merge_cand = { {0, 0}, {0, 0, 0}, 0, 0 };
|
|
|
|
|
2016-05-17 01:25:45 +00:00
|
|
|
get_spatial_merge_candidates(x, y, width, height,
|
2017-02-22 05:37:20 +00:00
|
|
|
state->tile->frame->width,
|
|
|
|
state->tile->frame->height,
|
|
|
|
lcu,
|
|
|
|
&merge_cand);
|
|
|
|
get_temporal_merge_candidates(state, x, y, width, height, 1, 0, &merge_cand);
|
|
|
|
get_mv_cand_from_candidates(state, x, y, width, height, &merge_cand, cur_cu, reflist, mv_cand);
|
2016-05-17 01:25:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* \brief Get MV prediction for current block using state->tile->frame->cu_array.
|
|
|
|
*
|
|
|
|
* \param state encoder state
|
|
|
|
* \param x block x position in pixels
|
|
|
|
* \param y block y position in pixels
|
|
|
|
* \param width block width in pixels
|
|
|
|
* \param height block height in pixels
|
|
|
|
* \param mv_cand Return the motion vector candidates.
|
|
|
|
* \param cur_cu current CU
|
|
|
|
* \param reflist reflist index (either 0 or 1)
|
|
|
|
*/
|
|
|
|
void kvz_inter_get_mv_cand_cua(const encoder_state_t * const state,
|
|
|
|
int32_t x,
|
|
|
|
int32_t y,
|
|
|
|
int32_t width,
|
|
|
|
int32_t height,
|
|
|
|
int16_t mv_cand[2][2],
|
|
|
|
const cu_info_t* cur_cu,
|
|
|
|
int8_t reflist)
|
|
|
|
{
|
2017-02-22 05:37:20 +00:00
|
|
|
merge_candidates_t merge_cand = { {0, 0}, {0, 0, 0}, 0, 0 };
|
|
|
|
|
2016-05-17 01:25:45 +00:00
|
|
|
const cu_array_t *cua = state->tile->frame->cu_array;
|
2015-12-16 12:53:18 +00:00
|
|
|
get_spatial_merge_candidates_cua(cua,
|
|
|
|
x, y, width, height,
|
2016-05-17 01:25:45 +00:00
|
|
|
state->tile->frame->width, state->tile->frame->height,
|
2017-02-22 05:37:20 +00:00
|
|
|
&merge_cand);
|
|
|
|
get_temporal_merge_candidates(state, x, y, width, height, 1, 0, &merge_cand);
|
|
|
|
get_mv_cand_from_candidates(state, x, y, width, height, &merge_cand, cur_cu, reflist, mv_cand);
|
2016-05-17 01:25:45 +00:00
|
|
|
}
|
|
|
|
|
2017-02-21 17:50:52 +00:00
|
|
|
static bool is_duplicate_candidate(const cu_info_t* cu1, const cu_info_t* cu2)
|
|
|
|
{
|
|
|
|
if (!cu2) return false;
|
|
|
|
if (cu1->inter.mv_dir != cu2->inter.mv_dir) return false;
|
|
|
|
|
|
|
|
for (int reflist = 0; reflist < 2; reflist++) {
|
|
|
|
if (cu1->inter.mv_dir & (1 << reflist)) {
|
|
|
|
if (cu1->inter.mv[reflist][0] != cu2->inter.mv[reflist][0] ||
|
|
|
|
cu1->inter.mv[reflist][1] != cu2->inter.mv[reflist][1] ||
|
|
|
|
cu1->inter.mv_ref[reflist] != cu2->inter.mv_ref[reflist]) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
static bool add_merge_candidate(const cu_info_t *cand,
|
|
|
|
const cu_info_t *possible_duplicate1,
|
|
|
|
const cu_info_t *possible_duplicate2,
|
2019-02-12 07:21:03 +00:00
|
|
|
inter_merge_cand_t *merge_cand_out,
|
|
|
|
uint8_t candidates,
|
|
|
|
uint8_t max_num_cands)
|
2017-02-21 17:50:52 +00:00
|
|
|
{
|
|
|
|
if (!cand ||
|
|
|
|
is_duplicate_candidate(cand, possible_duplicate1) ||
|
2019-02-12 07:21:03 +00:00
|
|
|
is_duplicate_candidate(cand, possible_duplicate2) ||
|
|
|
|
candidates >= max_num_cands) {
|
2017-02-21 17:50:52 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
merge_cand_out->mv[0][0] = cand->inter.mv[0][0];
|
|
|
|
merge_cand_out->mv[0][1] = cand->inter.mv[0][1];
|
|
|
|
merge_cand_out->mv[1][0] = cand->inter.mv[1][0];
|
|
|
|
merge_cand_out->mv[1][1] = cand->inter.mv[1][1];
|
2017-06-26 12:31:57 +00:00
|
|
|
merge_cand_out->ref[0] = cand->inter.mv_ref[0]; // L0/L1 references
|
2017-02-21 17:50:52 +00:00
|
|
|
merge_cand_out->ref[1] = cand->inter.mv_ref[1];
|
|
|
|
merge_cand_out->dir = cand->inter.mv_dir;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2013-10-11 13:12:04 +00:00
|
|
|
/**
|
|
|
|
* \brief Get merge predictions for current block
|
2015-10-12 11:44:03 +00:00
|
|
|
* \param state the encoder state
|
|
|
|
* \param x block x position in SCU
|
|
|
|
* \param y block y position in SCU
|
|
|
|
* \param width block width
|
|
|
|
* \param height block height
|
|
|
|
* \param use_a1 true, if candidate a1 can be used
|
|
|
|
* \param use_b1 true, if candidate b1 can be used
|
|
|
|
* \param mv_cand Returns the merge candidates.
|
|
|
|
* \param lcu lcu containing the block
|
|
|
|
* \return number of merge candidates
|
2013-10-11 13:12:04 +00:00
|
|
|
*/
|
2015-10-12 11:44:03 +00:00
|
|
|
uint8_t kvz_inter_get_merge_cand(const encoder_state_t * const state,
|
|
|
|
int32_t x, int32_t y,
|
|
|
|
int32_t width, int32_t height,
|
|
|
|
bool use_a1, bool use_b1,
|
|
|
|
inter_merge_cand_t mv_cand[MRG_MAX_NUM_CANDS],
|
2017-10-25 09:17:17 +00:00
|
|
|
lcu_t *lcu)
|
2014-02-21 13:00:20 +00:00
|
|
|
{
|
2013-10-11 13:12:04 +00:00
|
|
|
uint8_t candidates = 0;
|
2014-02-14 13:50:30 +00:00
|
|
|
int8_t zero_idx = 0;
|
2017-02-22 05:37:20 +00:00
|
|
|
|
|
|
|
merge_candidates_t merge_cand = { {0, 0}, {0, 0, 0}, 0, 0 };
|
2019-02-12 09:24:10 +00:00
|
|
|
const uint8_t max_num_cands = state->encoder_control->cfg.max_merge;
|
2016-05-10 00:47:20 +00:00
|
|
|
get_spatial_merge_candidates(x, y, width, height,
|
2017-02-21 17:50:52 +00:00
|
|
|
state->tile->frame->width,
|
|
|
|
state->tile->frame->height,
|
2017-02-22 05:37:20 +00:00
|
|
|
lcu,
|
|
|
|
&merge_cand);
|
|
|
|
|
|
|
|
const cu_info_t **a = merge_cand.a;
|
|
|
|
const cu_info_t **b = merge_cand.b;
|
2014-02-21 13:00:20 +00:00
|
|
|
|
2017-02-22 05:37:20 +00:00
|
|
|
if (!use_a1) a[1] = NULL;
|
|
|
|
if (!use_b1) b[1] = NULL;
|
2013-10-11 13:12:04 +00:00
|
|
|
|
2019-02-12 07:21:03 +00:00
|
|
|
if (add_merge_candidate(a[1], NULL, NULL, &mv_cand[candidates], candidates, max_num_cands)) candidates++;
|
|
|
|
if (add_merge_candidate(b[1], a[1], NULL, &mv_cand[candidates], candidates, max_num_cands)) candidates++;
|
|
|
|
if (add_merge_candidate(b[0], b[1], NULL, &mv_cand[candidates], candidates, max_num_cands)) candidates++;
|
|
|
|
if (add_merge_candidate(a[0], a[1], NULL, &mv_cand[candidates], candidates, max_num_cands)) candidates++;
|
2017-02-21 17:50:52 +00:00
|
|
|
if (candidates < 4 &&
|
2019-02-12 07:21:03 +00:00
|
|
|
add_merge_candidate(b[2], a[1], b[1], &mv_cand[candidates], candidates, max_num_cands)) candidates++;
|
2016-12-22 11:00:31 +00:00
|
|
|
|
2017-02-21 17:08:10 +00:00
|
|
|
bool can_use_tmvp =
|
|
|
|
state->encoder_control->cfg.tmvp_enable &&
|
2019-02-12 07:21:03 +00:00
|
|
|
candidates < max_num_cands &&
|
2017-02-21 17:08:10 +00:00
|
|
|
state->frame->ref->used_size;
|
2017-01-02 10:07:21 +00:00
|
|
|
|
2017-02-21 17:08:10 +00:00
|
|
|
if (can_use_tmvp) {
|
|
|
|
mv_cand[candidates].dir = 0;
|
|
|
|
|
|
|
|
const int max_reflist = (state->frame->slicetype == KVZ_SLICE_B ? 1 : 0);
|
|
|
|
for (int reflist = 0; reflist <= max_reflist; reflist++) {
|
|
|
|
// Fetch temporal candidates for the current CU
|
2017-02-22 05:37:20 +00:00
|
|
|
get_temporal_merge_candidates(state, x, y, width, height, 1, 0, &merge_cand);
|
2017-02-21 17:08:10 +00:00
|
|
|
// TODO: enable L1 TMVP candidate
|
2017-02-22 05:37:20 +00:00
|
|
|
// get_temporal_merge_candidates(state, x, y, width, height, 2, 0, &merge_cand);
|
|
|
|
|
|
|
|
const cu_info_t *temporal_cand =
|
|
|
|
(merge_cand.h != NULL) ? merge_cand.h : merge_cand.c3;
|
2017-02-21 17:08:10 +00:00
|
|
|
|
|
|
|
if (add_temporal_candidate(state,
|
2017-10-25 09:17:17 +00:00
|
|
|
// Reference index 0 is always used for
|
|
|
|
// the temporal merge candidate.
|
|
|
|
state->frame->ref_LX[reflist][0],
|
2017-02-22 05:37:20 +00:00
|
|
|
temporal_cand,
|
2017-02-21 17:08:10 +00:00
|
|
|
reflist,
|
2017-08-09 08:33:28 +00:00
|
|
|
mv_cand[candidates].mv[reflist])) {
|
|
|
|
mv_cand[candidates].ref[reflist] = 0;
|
2017-02-21 17:08:10 +00:00
|
|
|
mv_cand[candidates].dir |= (1 << reflist);
|
2016-08-10 08:58:15 +00:00
|
|
|
}
|
2016-06-14 05:57:44 +00:00
|
|
|
}
|
2017-02-21 17:08:10 +00:00
|
|
|
|
|
|
|
if (mv_cand[candidates].dir != 0) candidates++;
|
2013-10-11 13:12:04 +00:00
|
|
|
}
|
|
|
|
|
2019-02-12 07:21:03 +00:00
|
|
|
if (candidates < max_num_cands && state->frame->slicetype == KVZ_SLICE_B) {
|
2015-03-18 08:03:06 +00:00
|
|
|
#define NUM_PRIORITY_LIST 12;
|
|
|
|
static const uint8_t priorityList0[] = { 0, 1, 0, 2, 1, 2, 0, 3, 1, 3, 2, 3 };
|
|
|
|
static const uint8_t priorityList1[] = { 1, 0, 2, 0, 2, 1, 3, 0, 3, 1, 3, 2 };
|
|
|
|
uint8_t cutoff = candidates;
|
2019-02-12 07:21:03 +00:00
|
|
|
for (int32_t idx = 0; idx<cutoff*(cutoff - 1) && candidates != max_num_cands; idx++) {
|
2015-03-18 08:03:06 +00:00
|
|
|
uint8_t i = priorityList0[idx];
|
|
|
|
uint8_t j = priorityList1[idx];
|
2015-03-20 08:33:05 +00:00
|
|
|
if (i >= candidates || j >= candidates) break;
|
2015-03-18 08:03:06 +00:00
|
|
|
|
|
|
|
// Find one L0 and L1 candidate according to the priority list
|
|
|
|
if ((mv_cand[i].dir & 0x1) && (mv_cand[j].dir & 0x2)) {
|
|
|
|
mv_cand[candidates].dir = 3;
|
|
|
|
|
|
|
|
// get Mv from cand[i] and cand[j]
|
2016-12-22 11:00:31 +00:00
|
|
|
mv_cand[candidates].mv[0][0] = mv_cand[i].mv[0][0];
|
|
|
|
mv_cand[candidates].mv[0][1] = mv_cand[i].mv[0][1];
|
|
|
|
mv_cand[candidates].mv[1][0] = mv_cand[j].mv[1][0];
|
|
|
|
mv_cand[candidates].mv[1][1] = mv_cand[j].mv[1][1];
|
|
|
|
mv_cand[candidates].ref[0] = mv_cand[i].ref[0];
|
|
|
|
mv_cand[candidates].ref[1] = mv_cand[j].ref[1];
|
2015-03-18 08:03:06 +00:00
|
|
|
|
2017-06-26 12:31:57 +00:00
|
|
|
if (state->frame->ref_LX[0][mv_cand[i].ref[0]] ==
|
|
|
|
state->frame->ref_LX[1][mv_cand[j].ref[1]]
|
|
|
|
&&
|
|
|
|
mv_cand[i].mv[0][0] == mv_cand[j].mv[1][0] &&
|
|
|
|
mv_cand[i].mv[0][1] == mv_cand[j].mv[1][1]) {
|
2015-03-18 08:03:06 +00:00
|
|
|
// Not a candidate
|
|
|
|
} else {
|
|
|
|
candidates++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-08-10 00:46:23 +00:00
|
|
|
int num_ref = state->frame->ref->used_size;
|
2015-03-20 08:33:05 +00:00
|
|
|
|
2019-02-12 07:21:03 +00:00
|
|
|
if (candidates < max_num_cands && state->frame->slicetype == KVZ_SLICE_B) {
|
2015-03-20 08:33:05 +00:00
|
|
|
int j;
|
|
|
|
int ref_negative = 0;
|
|
|
|
int ref_positive = 0;
|
2016-08-10 00:46:23 +00:00
|
|
|
for (j = 0; j < state->frame->ref->used_size; j++) {
|
|
|
|
if (state->frame->ref->pocs[j] < state->frame->poc) {
|
2015-03-20 08:33:05 +00:00
|
|
|
ref_negative++;
|
|
|
|
} else {
|
|
|
|
ref_positive++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
num_ref = MIN(ref_negative, ref_positive);
|
|
|
|
}
|
2017-02-21 17:50:52 +00:00
|
|
|
|
2013-11-05 10:49:39 +00:00
|
|
|
// Add (0,0) prediction
|
2019-02-12 07:21:03 +00:00
|
|
|
while (candidates != max_num_cands) {
|
2015-03-18 08:03:06 +00:00
|
|
|
mv_cand[candidates].mv[0][0] = 0;
|
|
|
|
mv_cand[candidates].mv[0][1] = 0;
|
2017-02-21 17:50:52 +00:00
|
|
|
mv_cand[candidates].ref[0] = (zero_idx >= num_ref - 1) ? 0 : zero_idx;
|
2015-03-30 11:40:29 +00:00
|
|
|
mv_cand[candidates].ref[1] = mv_cand[candidates].ref[0];
|
2015-03-18 08:03:06 +00:00
|
|
|
mv_cand[candidates].dir = 1;
|
2016-08-10 00:46:23 +00:00
|
|
|
if (state->frame->slicetype == KVZ_SLICE_B) {
|
2015-03-18 08:03:06 +00:00
|
|
|
mv_cand[candidates].mv[1][0] = 0;
|
|
|
|
mv_cand[candidates].mv[1][1] = 0;
|
|
|
|
mv_cand[candidates].dir = 3;
|
|
|
|
}
|
2014-02-14 13:50:30 +00:00
|
|
|
zero_idx++;
|
2013-10-11 13:12:04 +00:00
|
|
|
candidates++;
|
|
|
|
}
|
2013-11-05 10:49:39 +00:00
|
|
|
|
2013-10-11 13:12:04 +00:00
|
|
|
return candidates;
|
|
|
|
}
|