Google Git
Sign in
aomedia / avm / refs/heads/experimental / . / av1 / common / mvref_common.c
blob: 7d97660dee5d6f3420a2a98cb352c545a0c6d87f [file] [log] [blame] [edit]
/*
* Copyright (c) 2016, Alliance for Open Media. All rights reserved
*
* This source code is subject to the terms of the BSD 2 Clause License and
* the Alliance for Open Media Patent License 1.0. If the BSD 2 Clause License
* was not distributed with this source code in the LICENSE file, you can
* obtain it at www.aomedia.org/license/software. If the Alliance for Open
* Media Patent License 1.0 was not distributed with this source code in the
* PATENTS file, you can obtain it at www.aomedia.org/license/patent.
*/
#include <stdlib.h>
#include "av1/common/mvref_common.h"
#include "av1/common/warped_motion.h"
#if CONFIG_EXT_REFMV
#include "aom_ports/system_state.h"
#define SCALE_BITS (16)
#define USE_FLOAT
#define EXTEND_CANDIDATE
#define ADD_AFFINE_MV
#define ADD_ROTZOOM_MV
#define ADD_ARITHMETIC_AVG
#define ADD_WEIGHTED_AVG
#endif // CONFIG_EXT_REFMV
// Although we assign 32 bit integers, all the values are strictly under 14
// bits.
static int div_mult[32] = { 0, 16384, 8192, 5461, 4096, 3276, 2730, 2340,
2048, 1820, 1638, 1489, 1365, 1260, 1170, 1092,
1024, 963, 910, 862, 819, 780, 744, 712,
682, 655, 630, 606, 585, 564, 546, 528 };
// TODO(jingning): Consider the use of lookup table for (num / den)
// altogether.
static void get_mv_projection(MV *output, MV ref, int num, int den) {
den = AOMMIN(den, MAX_FRAME_DISTANCE);
num = num > 0 ? AOMMIN(num, MAX_FRAME_DISTANCE)
: AOMMAX(num, -MAX_FRAME_DISTANCE);
const int mv_row =
ROUND_POWER_OF_TWO_SIGNED(ref.row * num * div_mult[den], 14);
const int mv_col =
ROUND_POWER_OF_TWO_SIGNED(ref.col * num * div_mult[den], 14);
const int clamp_max = MV_UPP - 1;
const int clamp_min = MV_LOW + 1;
output->row = (int16_t)clamp(mv_row, clamp_min, clamp_max);
output->col = (int16_t)clamp(mv_col, clamp_min, clamp_max);
}
void av1_copy_frame_mvs(const AV1_COMMON *const cm,
const MB_MODE_INFO *const mi, int mi_row, int mi_col,
int x_mis, int y_mis) {
const int frame_mvs_stride = ROUND_POWER_OF_TWO(cm->mi_cols, 1);
MV_REF *frame_mvs =
cm->cur_frame->mvs + (mi_row >> 1) * frame_mvs_stride + (mi_col >> 1);
x_mis = ROUND_POWER_OF_TWO(x_mis, 1);
y_mis = ROUND_POWER_OF_TWO(y_mis, 1);
int w, h;
for (h = 0; h < y_mis; h++) {
MV_REF *mv = frame_mvs;
for (w = 0; w < x_mis; w++) {
mv->ref_frame = NONE_FRAME;
mv->mv.as_int = 0;
for (int idx = 0; idx < 2; ++idx) {
MV_REFERENCE_FRAME ref_frame = mi->ref_frame[idx];
if (ref_frame > INTRA_FRAME) {
int8_t ref_idx = cm->ref_frame_side[ref_frame];
if (ref_idx) continue;
if ((abs(mi->mv[idx].as_mv.row) > REFMVS_LIMIT) ||
(abs(mi->mv[idx].as_mv.col) > REFMVS_LIMIT))
continue;
mv->ref_frame = ref_frame;
#if CONFIG_DERIVED_MV
if (mi->derived_mv_allowed && mi->use_derived_mv) {
mv->mv.as_mv = mi->derived_mv[idx];
} else {
mv->mv.as_int = mi->mv[idx].as_int;
}
#else
mv->mv.as_int = mi->mv[idx].as_int;
#endif // CONFIG_DERIVED_MV
}
}
mv++;
}
frame_mvs += frame_mvs_stride;
}
}
#if CONFIG_EXT_COMP_REFMV
#define PARTIALL_REF_MV_STACK_SIZE 1
#endif // CONFIG_EXT_COMP_REFMV
static void add_ref_mv_candidate(
const MB_MODE_INFO *const candidate, MV_REFERENCE_FRAME ref_frame,
REF_MV_INFO *ref_mv_info, const MV_REFERENCE_FRAME rf[2],
uint8_t *ref_match_count, uint8_t *newmv_count,
#if CONFIG_EXT_REFMV || CONFIG_ENHANCED_WARPED_MOTION
int mi_row, int mi_col, int candidate_row_offset, int candidate_col_offset,
#endif // CONFIG_EXT_REFMV || CONFIG_ENHANCED_WARPED_MOTION
#if CONFIG_EXT_COMP_REFMV
int_mv partial_ref_mv_stack[][PARTIALL_REF_MV_STACK_SIZE],
uint16_t partial_ref_mv_weight[][PARTIALL_REF_MV_STACK_SIZE],
#endif // CONFIG_EXT_COMP_REFMV
int_mv *gm_mv_candidates, const WarpedMotionParams *gm_params, int col,
uint16_t weight) {
if (!is_inter_block(candidate)) return;
assert(weight % 2 == 0);
int index, ref;
uint8_t *refmv_count = &ref_mv_info->ref_mv_count[ref_frame];
CANDIDATE_MV *ref_mv_stack = ref_mv_info->ref_mv_stack[ref_frame];
uint16_t *ref_mv_weight = ref_mv_info->ref_mv_weight[ref_frame];
#if CONFIG_EXT_REFMV || CONFIG_ENHANCED_WARPED_MOTION
LOCATION_INFO *location_stack = ref_mv_info->ref_mv_location_stack[ref_frame];
uint8_t *location_count = &ref_mv_info->ref_mv_location_count[ref_frame];
#endif // CONFIG_EXT_REFMV || CONFIG_ENHANCED_WARPED_MOTION
if (rf[1] == NONE_FRAME) {
// single reference frame
for (ref = 0; ref < 2; ++ref) {
if (candidate->ref_frame[ref] == rf[0]) {
const int is_gm_block =
is_global_mv_block(candidate, gm_params[rf[0]].wmtype);
const int_mv this_refmv = is_gm_block
? gm_mv_candidates[0]
: get_sub_block_mv(candidate, ref, col);
#if CONFIG_EXT_REFMV || CONFIG_ENHANCED_WARPED_MOTION
if (*location_count < MAX_REF_LOC_STACK_SIZE) {
// Record the location of the mv
const int candidate_mi_row = mi_row + candidate_row_offset;
const int candidate_mi_col = mi_col + candidate_col_offset;
// Here the superblock_mi_row and superblock_mi_col are the
// row_index/col_index of the upper/left edge of the superblock
const int32_t superblock_high = mi_size_high[candidate->sb_type];
const int32_t superblock_wide = mi_size_wide[candidate->sb_type];
const int32_t superblock_mi_row =
candidate_mi_row - candidate_mi_row % superblock_high;
const int32_t superblock_mi_col =
candidate_mi_col - candidate_mi_col % superblock_wide;
// Measured in 1/8 pixel ( The *4 at the end means (*8/2) )
const int32_t superblock_center_y =
((superblock_mi_row - mi_row) * MI_SIZE +
superblock_high * MI_SIZE / 2 - 1) *
8;
const int32_t superblock_center_x =
((superblock_mi_col - mi_col) * MI_SIZE +
superblock_wide * MI_SIZE / 2 - 1) *
8;
// Check whether the superblock location has been duplicated
int loc_index = 0;
for (loc_index = 0; loc_index < (*location_count); loc_index++) {
if (location_stack[loc_index].x == superblock_center_x &&
location_stack[loc_index].y == superblock_center_y) {
break;
}
}
if (loc_index == *location_count &&
loc_index < MAX_REF_LOC_STACK_SIZE) {
location_stack[*location_count].x = superblock_center_x;
location_stack[*location_count].y = superblock_center_y;
location_stack[*location_count].this_mv =
get_sub_block_mv(candidate, ref, col);
(*location_count)++;
}
}
#endif // CONFIG_EXT_REFMV || CONFIG_ENHANCED_WARPED_MOTION
for (index = 0; index < *refmv_count; ++index) {
if (ref_mv_stack[index].this_mv.as_int == this_refmv.as_int) {
ref_mv_weight[index] += weight;
break;
}
}
// Add a new item to the list.
if (index == *refmv_count && *refmv_count < MAX_REF_MV_STACK_SIZE) {
ref_mv_stack[index].this_mv = this_refmv;
ref_mv_weight[index] = weight;
++(*refmv_count);
}
if (have_newmv_in_inter_mode(candidate->mode)) ++*newmv_count;
++*ref_match_count;
}
}
} else {
// compound reference frame
if (candidate->ref_frame[0] == rf[0] && candidate->ref_frame[1] == rf[1]) {
int_mv this_refmv[2];
for (ref = 0; ref < 2; ++ref) {
if (is_global_mv_block(candidate, gm_params[rf[ref]].wmtype))
this_refmv[ref] = gm_mv_candidates[ref];
else
this_refmv[ref] = get_sub_block_mv(candidate, ref, col);
}
for (index = 0; index < *refmv_count; ++index) {
if ((ref_mv_stack[index].this_mv.as_int == this_refmv[0].as_int) &&
(ref_mv_stack[index].comp_mv.as_int == this_refmv[1].as_int)) {
ref_mv_weight[index] += weight;
break;
}
}
// Add a new item to the list.
if (index == *refmv_count && *refmv_count < MAX_REF_MV_STACK_SIZE) {
ref_mv_stack[index].this_mv = this_refmv[0];
ref_mv_stack[index].comp_mv = this_refmv[1];
ref_mv_weight[index] = weight;
++(*refmv_count);
}
if (have_newmv_in_inter_mode(candidate->mode)) ++*newmv_count;
++*ref_match_count;
}
#if CONFIG_EXT_COMP_REFMV
// Record MVs with partially matched reference frames
if (candidate->ref_frame[0] != rf[0] || candidate->ref_frame[1] != rf[1]) {
for (ref = 0; ref < 2; ++ref) {
const int cand_ref = candidate->ref_frame[ref];
if (cand_ref != rf[0] && cand_ref != rf[1]) continue;
int_mv this_mv;
if (is_global_mv_block(candidate, gm_params[cand_ref].wmtype)) {
this_mv = gm_mv_candidates[cand_ref == rf[1]];
} else {
this_mv = get_sub_block_mv(candidate, ref, col);
}
for (int i = 0; i < 2; ++i) {
if (cand_ref != rf[i]) continue;
for (int j = 0; j < PARTIALL_REF_MV_STACK_SIZE; ++j) {
if (partial_ref_mv_stack[i][j].as_int == this_mv.as_int ||
partial_ref_mv_weight[i][j] == 0) {
partial_ref_mv_stack[i][j] = this_mv;
partial_ref_mv_weight[i][j] += weight;
break;
}
}
}
}
}
#endif // CONFIG_EXT_COMP_REFMV
}
}
static void scan_row_mbmi(
const AV1_COMMON *cm, const MACROBLOCKD *xd, int mi_row, int mi_col,
MV_REFERENCE_FRAME ref_frame, REF_MV_INFO *ref_mv_info,
const MV_REFERENCE_FRAME rf[2], int row_offset, uint8_t *ref_match_count,
uint8_t *newmv_count,
#if CONFIG_EXT_COMP_REFMV
int_mv partial_ref_mv_stack[][PARTIALL_REF_MV_STACK_SIZE],
uint16_t partial_ref_mv_weight[][PARTIALL_REF_MV_STACK_SIZE],
#endif // CONFIG_EXT_COMP_REFMV
int_mv *gm_mv_candidates, int max_row_offset, int *processed_rows) {
int end_mi = AOMMIN(xd->n4_w, cm->mi_cols - mi_col);
end_mi = AOMMIN(end_mi, mi_size_wide[BLOCK_64X64]);
const int n8_w_8 = mi_size_wide[BLOCK_8X8];
const int n8_w_16 = mi_size_wide[BLOCK_16X16];
int i;
int col_offset = 0;
// TODO(jingning): Revisit this part after cb4x4 is stable.
if (abs(row_offset) > 1) {
col_offset = 1;
if ((mi_col & 0x01) && xd->n4_w < n8_w_8) --col_offset;
}
const int use_step_16 = (xd->n4_w >= 16);
MB_MODE_INFO **const candidate_mi0 = xd->mi + row_offset * xd->mi_stride;
(void)mi_row;
for (i = 0; i < end_mi;) {
#if CONFIG_EXT_RECUR_PARTITIONS
const int sb_mi_size = mi_size_wide[cm->seq_params.sb_size];
const int mask_row = mi_row & (sb_mi_size - 1);
const int mask_col = mi_col & (sb_mi_size - 1);
const int ref_mask_row = mask_row + row_offset;
const int ref_mask_col = mask_col + col_offset + i;
if (ref_mask_row >= 0) {
if (ref_mask_col >= sb_mi_size) break;
const int ref_offset =
ref_mask_row * xd->is_mi_coded_stride + ref_mask_col;
if (!xd->is_mi_coded[ref_offset]) break;
}
#endif // CONFIG_EXT_RECUR_PARTITIONS
const MB_MODE_INFO *const candidate = candidate_mi0[col_offset + i];
const int candidate_bsize = candidate->sb_type;
const int n4_w = mi_size_wide[candidate_bsize];
int len = AOMMIN(xd->n4_w, n4_w);
if (use_step_16)
len = AOMMAX(n8_w_16, len);
else if (abs(row_offset) > 1)
len = AOMMAX(len, n8_w_8);
uint16_t weight = 2;
if (xd->n4_w >= n8_w_8 && xd->n4_w <= n4_w) {
uint16_t inc = AOMMIN(-max_row_offset + row_offset + 1,
mi_size_high[candidate_bsize]);
// Obtain range used in weight calculation.
weight = AOMMAX(weight, inc);
// Update processed rows.
*processed_rows = inc - row_offset - 1;
}
add_ref_mv_candidate(
candidate, ref_frame, ref_mv_info, rf, ref_match_count, newmv_count,
#if CONFIG_EXT_REFMV || CONFIG_ENHANCED_WARPED_MOTION
xd->mi_row, xd->mi_col, row_offset, col_offset + i,
#endif // CONFIG_EXT_REFMV || CONFIG_ENHANCED_WARPED_MOTION
#if CONFIG_EXT_COMP_REFMV
partial_ref_mv_stack, partial_ref_mv_weight,
#endif // CONFIG_EXT_COMP_REFMV
gm_mv_candidates, cm->global_motion, col_offset + i, len * weight);
i += len;
}
}
static void scan_col_mbmi(
const AV1_COMMON *cm, const MACROBLOCKD *xd, int mi_row, int mi_col,
MV_REFERENCE_FRAME ref_frame, REF_MV_INFO *ref_mv_info,
const MV_REFERENCE_FRAME rf[2], int col_offset, uint8_t *ref_match_count,
uint8_t *newmv_count,
#if CONFIG_EXT_COMP_REFMV
int_mv partial_ref_mv_stack[][PARTIALL_REF_MV_STACK_SIZE],
uint16_t partial_ref_mv_weight[][PARTIALL_REF_MV_STACK_SIZE],
#endif // CONFIG_EXT_COMP_REFMV
int_mv *gm_mv_candidates, int max_col_offset, int *processed_cols) {
int end_mi = AOMMIN(xd->n4_h, cm->mi_rows - mi_row);
end_mi = AOMMIN(end_mi, mi_size_high[BLOCK_64X64]);
const int n8_h_8 = mi_size_high[BLOCK_8X8];
const int n8_h_16 = mi_size_high[BLOCK_16X16];
int i;
int row_offset = 0;
if (abs(col_offset) > 1) {
row_offset = 1;
if ((mi_row & 0x01) && xd->n4_h < n8_h_8) --row_offset;
}
const int use_step_16 = (xd->n4_h >= 16);
(void)mi_col;
for (i = 0; i < end_mi;) {
#if CONFIG_EXT_RECUR_PARTITIONS
const int sb_mi_size = mi_size_wide[cm->seq_params.sb_size];
const int mask_row = mi_row & (sb_mi_size - 1);
const int mask_col = mi_col & (sb_mi_size - 1);
const int ref_mask_row = mask_row + row_offset + i;
const int ref_mask_col = mask_col + col_offset;
if (ref_mask_col >= 0) {
if (ref_mask_row >= sb_mi_size) break;
const int ref_offset =
ref_mask_row * xd->is_mi_coded_stride + ref_mask_col;
if (!xd->is_mi_coded[ref_offset]) break;
}
#endif // CONFIG_EXT_RECUR_PARTITIONS
const MB_MODE_INFO *const candidate =
xd->mi[(row_offset + i) * xd->mi_stride + col_offset];
const int candidate_bsize = candidate->sb_type;
const int n4_h = mi_size_high[candidate_bsize];
int len = AOMMIN(xd->n4_h, n4_h);
if (use_step_16)
len = AOMMAX(n8_h_16, len);
else if (abs(col_offset) > 1)
len = AOMMAX(len, n8_h_8);
int weight = 2;
if (xd->n4_h >= n8_h_8 && xd->n4_h <= n4_h) {
int inc = AOMMIN(-max_col_offset + col_offset + 1,
mi_size_wide[candidate_bsize]);
// Obtain range used in weight calculation.
weight = AOMMAX(weight, inc);
// Update processed cols.
*processed_cols = inc - col_offset - 1;
}
add_ref_mv_candidate(
candidate, ref_frame, ref_mv_info, rf, ref_match_count, newmv_count,
#if CONFIG_EXT_REFMV || CONFIG_ENHANCED_WARPED_MOTION
xd->mi_row, xd->mi_col, row_offset + i, col_offset,
#endif // CONFIG_EXT_REFMV || CONFIG_ENHANCED_WARPED_MOTION
#if CONFIG_EXT_COMP_REFMV
partial_ref_mv_stack, partial_ref_mv_weight,
#endif // CONFIG_EXT_COMP_REFMV
gm_mv_candidates, cm->global_motion, col_offset, len * weight);
i += len;
}
}
static void scan_blk_mbmi(
const AV1_COMMON *cm, const MACROBLOCKD *xd, const int mi_row,
const int mi_col, MV_REFERENCE_FRAME ref_frame, REF_MV_INFO *ref_mv_info,
const MV_REFERENCE_FRAME rf[2], int row_offset, int col_offset,
uint8_t *ref_match_count, uint8_t *newmv_count,
#if CONFIG_EXT_COMP_REFMV
int_mv partial_ref_mv_stack[][PARTIALL_REF_MV_STACK_SIZE],
uint16_t partial_ref_mv_weight[][PARTIALL_REF_MV_STACK_SIZE],
#endif // CONFIG_EXT_COMP_REFMV
int_mv *gm_mv_candidates) {
const TileInfo *const tile = &xd->tile;
POSITION mi_pos;
mi_pos.row = row_offset;
mi_pos.col = col_offset;
if (is_inside(tile, mi_col, mi_row, &mi_pos)) {
const MB_MODE_INFO *const candidate =
xd->mi[mi_pos.row * xd->mi_stride + mi_pos.col];
const int len = mi_size_wide[BLOCK_8X8];
add_ref_mv_candidate(
candidate, ref_frame, ref_mv_info, rf, ref_match_count, newmv_count,
#if CONFIG_EXT_REFMV || CONFIG_ENHANCED_WARPED_MOTION
xd->mi_row, xd->mi_col, row_offset, col_offset,
#endif // CONFIG_EXT_REFMV || CONFIG_ENHANCED_WARPED_MOTION
#if CONFIG_EXT_COMP_REFMV
partial_ref_mv_stack, partial_ref_mv_weight,
#endif // CONFIG_EXT_COMP_REFMV
gm_mv_candidates, cm->global_motion, mi_pos.col, 2 * len);
} // Analyze a single 8x8 block motion information.
}
static int has_top_right(const AV1_COMMON *cm, const MACROBLOCKD *xd,
int mi_row, int mi_col, int bs) {
const int sb_mi_size = mi_size_wide[cm->seq_params.sb_size];
const int mask_row = mi_row & (sb_mi_size - 1);
const int mask_col = mi_col & (sb_mi_size - 1);
// TODO(yuec): check the purpose of this condition
if (bs > mi_size_wide[BLOCK_64X64]) return 0;
const int tr_mask_row = mask_row - 1;
const int tr_mask_col = mask_col + xd->n4_w;
int has_tr;
if (tr_mask_row < 0) {
// Later the tile boundary checker will figure out whether the top-right
// block is available.
has_tr = 1;
} else if (tr_mask_col >= sb_mi_size) {
has_tr = 0;
} else {
const int tr_offset = tr_mask_row * xd->is_mi_coded_stride + tr_mask_col;
has_tr = xd->is_mi_coded[tr_offset];
}
return has_tr;
}
static int check_sb_border(const int mi_row, const int mi_col,
const int row_offset, const int col_offset) {
const int sb_mi_size = mi_size_wide[BLOCK_64X64];
const int row = mi_row & (sb_mi_size - 1);
const int col = mi_col & (sb_mi_size - 1);
if (row + row_offset < 0 || row + row_offset >= sb_mi_size ||
col + col_offset < 0 || col + col_offset >= sb_mi_size)
return 0;
return 1;
}
static int add_tpl_ref_mv(
const AV1_COMMON *cm, const MACROBLOCKD *xd, int mi_row, int mi_col,
MV_REFERENCE_FRAME ref_frame, REF_MV_INFO *ref_mv_info, int blk_row,
int blk_col,
#if CONFIG_EXT_COMP_REFMV
int_mv partial_ref_mv_stack[][PARTIALL_REF_MV_STACK_SIZE],
uint16_t partial_ref_mv_weight[][PARTIALL_REF_MV_STACK_SIZE],
#endif // CONFIG_EXT_COMP_REFMV
int_mv *gm_mv_candidates, int16_t *mode_context) {
POSITION mi_pos;
mi_pos.row = (mi_row & 0x01) ? blk_row : blk_row + 1;
mi_pos.col = (mi_col & 0x01) ? blk_col : blk_col + 1;
if (!is_inside(&xd->tile, mi_col, mi_row, &mi_pos)) return 0;
uint8_t *refmv_count = &ref_mv_info->ref_mv_count[ref_frame];
CANDIDATE_MV *ref_mv_stack = ref_mv_info->ref_mv_stack[ref_frame];
uint16_t *ref_mv_weight = ref_mv_info->ref_mv_weight[ref_frame];
const TPL_MV_REF *prev_frame_mvs =
cm->tpl_mvs + ((mi_row + mi_pos.row) >> 1) * (cm->mi_stride >> 1) +
((mi_col + mi_pos.col) >> 1);
if (prev_frame_mvs->mfmv0.as_int == INVALID_MV) return 0;
MV_REFERENCE_FRAME rf[2];
av1_set_ref_frame(rf, ref_frame);
const uint16_t weight_unit = 1; // mi_size_wide[BLOCK_8X8];
const int cur_frame_index = cm->cur_frame->order_hint;
const RefCntBuffer *const buf_0 = get_ref_frame_buf(cm, rf[0]);
const int frame0_index = buf_0->order_hint;
const int cur_offset_0 = get_relative_dist(&cm->seq_params.order_hint_info,
cur_frame_index, frame0_index);
int idx;
int_mv this_refmv;
get_mv_projection(&this_refmv.as_mv, prev_frame_mvs->mfmv0.as_mv,
cur_offset_0, prev_frame_mvs->ref_frame_offset);
lower_mv_precision(&this_refmv.as_mv, cm->fr_mv_precision);
if (rf[1] == NONE_FRAME) {
if (blk_row == 0 && blk_col == 0) {
if (abs(this_refmv.as_mv.row - gm_mv_candidates[0].as_mv.row) >= 16 ||
abs(this_refmv.as_mv.col - gm_mv_candidates[0].as_mv.col) >= 16)
mode_context[ref_frame] |= (1 << GLOBALMV_OFFSET);
}
for (idx = 0; idx < *refmv_count; ++idx)
if (this_refmv.as_int == ref_mv_stack[idx].this_mv.as_int) break;
if (idx < *refmv_count) ref_mv_weight[idx] += 2 * weight_unit;
if (idx == *refmv_count && *refmv_count < MAX_REF_MV_STACK_SIZE) {
ref_mv_stack[idx].this_mv.as_int = this_refmv.as_int;
ref_mv_weight[idx] = 2 * weight_unit;
++(*refmv_count);
}
} else {
// Process compound inter mode
const RefCntBuffer *const buf_1 = get_ref_frame_buf(cm, rf[1]);
const int frame1_index = buf_1->order_hint;
const int cur_offset_1 = get_relative_dist(&cm->seq_params.order_hint_info,
cur_frame_index, frame1_index);
int_mv comp_refmv;
get_mv_projection(&comp_refmv.as_mv, prev_frame_mvs->mfmv0.as_mv,
cur_offset_1, prev_frame_mvs->ref_frame_offset);
lower_mv_precision(&comp_refmv.as_mv, cm->fr_mv_precision);
if (blk_row == 0 && blk_col == 0) {
if (abs(this_refmv.as_mv.row - gm_mv_candidates[0].as_mv.row) >= 16 ||
abs(this_refmv.as_mv.col - gm_mv_candidates[0].as_mv.col) >= 16 ||
abs(comp_refmv.as_mv.row - gm_mv_candidates[1].as_mv.row) >= 16 ||
abs(comp_refmv.as_mv.col - gm_mv_candidates[1].as_mv.col) >= 16)
mode_context[ref_frame] |= (1 << GLOBALMV_OFFSET);
}
#if CONFIG_EXT_COMP_REFMV
for (int i = 0; i < PARTIALL_REF_MV_STACK_SIZE; ++i) {
if (partial_ref_mv_stack[0][i].as_int == this_refmv.as_int ||
partial_ref_mv_weight[0][i] == 0) {
partial_ref_mv_stack[0][i] = this_refmv;
partial_ref_mv_weight[0][i] += 2 * weight_unit;
break;
}
}
for (int i = 0; i < PARTIALL_REF_MV_STACK_SIZE; ++i) {
if (partial_ref_mv_stack[1][i].as_int == comp_refmv.as_int ||
partial_ref_mv_weight[1][i] == 0) {
partial_ref_mv_stack[1][i] = comp_refmv;
partial_ref_mv_weight[1][i] += 2 * weight_unit;
break;
}
}
#endif // CONFIG_EXT_COMP_REFMV
for (idx = 0; idx < *refmv_count; ++idx) {
if (this_refmv.as_int == ref_mv_stack[idx].this_mv.as_int &&
comp_refmv.as_int == ref_mv_stack[idx].comp_mv.as_int)
break;
}
if (idx < *refmv_count) ref_mv_weight[idx] += 2 * weight_unit;
if (idx == *refmv_count && *refmv_count < MAX_REF_MV_STACK_SIZE) {
ref_mv_stack[idx].this_mv.as_int = this_refmv.as_int;
ref_mv_stack[idx].comp_mv.as_int = comp_refmv.as_int;
ref_mv_weight[idx] = 2 * weight_unit;
++(*refmv_count);
}
}
return 1;
}
static void process_compound_ref_mv_candidate(
const MB_MODE_INFO *const candidate, const AV1_COMMON *const cm,
const MV_REFERENCE_FRAME *const rf, int_mv ref_id[2][2],
int ref_id_count[2], int_mv ref_diff[2][2], int ref_diff_count[2]) {
for (int rf_idx = 0; rf_idx < 2; ++rf_idx) {
MV_REFERENCE_FRAME can_rf = candidate->ref_frame[rf_idx];
for (int cmp_idx = 0; cmp_idx < 2; ++cmp_idx) {
if (can_rf == rf[cmp_idx] && ref_id_count[cmp_idx] < 2) {
ref_id[cmp_idx][ref_id_count[cmp_idx]] = candidate->mv[rf_idx];
++ref_id_count[cmp_idx];
} else if (can_rf > INTRA_FRAME && ref_diff_count[cmp_idx] < 2) {
int_mv this_mv = candidate->mv[rf_idx];
if (cm->ref_frame_sign_bias[can_rf] !=
cm->ref_frame_sign_bias[rf[cmp_idx]]) {
this_mv.as_mv.row = -this_mv.as_mv.row;
this_mv.as_mv.col = -this_mv.as_mv.col;
}
ref_diff[cmp_idx][ref_diff_count[cmp_idx]] = this_mv;
++ref_diff_count[cmp_idx];
}
}
}
}
static void process_single_ref_mv_candidate(
const MB_MODE_INFO *const candidate, const AV1_COMMON *const cm,
MV_REFERENCE_FRAME ref_frame, uint8_t *const refmv_count,
CANDIDATE_MV ref_mv_stack[MAX_REF_MV_STACK_SIZE],
uint16_t ref_mv_weight[MAX_REF_MV_STACK_SIZE]) {
for (int rf_idx = 0; rf_idx < 2; ++rf_idx) {
if (candidate->ref_frame[rf_idx] > INTRA_FRAME) {
int_mv this_mv = candidate->mv[rf_idx];
if (cm->ref_frame_sign_bias[candidate->ref_frame[rf_idx]] !=
cm->ref_frame_sign_bias[ref_frame]) {
this_mv.as_mv.row = -this_mv.as_mv.row;
this_mv.as_mv.col = -this_mv.as_mv.col;
}
int stack_idx;
for (stack_idx = 0; stack_idx < *refmv_count; ++stack_idx) {
const int_mv stack_mv = ref_mv_stack[stack_idx].this_mv;
if (this_mv.as_int == stack_mv.as_int) break;
}
if (stack_idx == *refmv_count) {
ref_mv_stack[stack_idx].this_mv = this_mv;
// TODO(jingning): Set an arbitrary small number here. The weight
// doesn't matter as long as it is properly initialized.
ref_mv_weight[stack_idx] = 2;
++(*refmv_count);
}
}
}
}
#if CONFIG_DBSCAN_FEATURE
// To measure the similarity of two MVs (square dist)
static int calc_square_dist(const int_mv *const ma, const int_mv *const mb) {
return (ma->as_mv.row - mb->as_mv.row) * (ma->as_mv.row - mb->as_mv.row) +
(ma->as_mv.col - mb->as_mv.col) * (ma->as_mv.col - mb->as_mv.col);
}
static void mv_dbscan(CANDIDATE_MV ref_mv_stack[MAX_REF_MV_STACK_SIZE],
const int start, const int end, const int min_points,
const float dist_threshold, int *cluster_num,
int cluster_label[MAX_REF_MV_STACK_SIZE],
bool is_single_frame) {
// Clustering run in [start, end), start included but end excluded
const int mv_num = end - start;
float point_distances[MAX_REF_MV_STACK_SIZE][MAX_REF_MV_STACK_SIZE];
for (int i = 0; i < mv_num; i++) {
for (int j = i + 1; j < mv_num; j++) {
const int i_idx = i + start;
const int j_idx = j + start;
if (is_single_frame) {
point_distances[i][j] = point_distances[j][i] = calc_square_dist(
&(ref_mv_stack[i_idx].this_mv), &(ref_mv_stack[j_idx].this_mv));
} else {
float dist = calc_square_dist(&(ref_mv_stack[i_idx].this_mv),
&(ref_mv_stack[j_idx].this_mv)) +
calc_square_dist(&(ref_mv_stack[i_idx].comp_mv),
&(ref_mv_stack[j_idx].comp_mv));
point_distances[i][j] = point_distances[j][i] = dist / 2.0f;
}
}
point_distances[i][i] = 0;
}
int ele_count[MAX_REF_MV_STACK_SIZE];
bool neighborhood[MAX_REF_MV_STACK_SIZE][MAX_REF_MV_STACK_SIZE];
for (int i = 0; i < mv_num; i++) {
int i_idx = i + start;
// Initial: Every one is set as a noise point
ele_count[i] = 0;
cluster_label[i_idx] = -1;
// Check: Are there enough points (>= min_points) in the neighborhood of Pi
for (int j = 0; j < mv_num; j++) {
neighborhood[i][j] = false;
}
for (int j = 0; j < mv_num; j++) {
if (point_distances[i][j] <= dist_threshold) {
neighborhood[i][j] = true;
ele_count[i]++;
}
}
}
bool is_centriods[MAX_REF_MV_STACK_SIZE];
*cluster_num = 0;
for (int i = 0; i < mv_num; i++) {
is_centriods[i] = false;
if (ele_count[i] >= min_points) {
// This can be identified as a temporal cluster centriod
is_centriods[i] = true;
(*cluster_num)++;
}
}
bool should_stop = true;
while (1) {
should_stop = true;
for (int i = 0; i < mv_num; i++) {
if (is_centriods[i]) {
for (int j = 0; j < mv_num; j++) {
if (i != j && is_centriods[j] && neighborhood[i][j]) {
// Centroid j is also in Centriod i's neighborhood, so combine them
// Put all centroid j's element in centriod i's cluster
(*cluster_num)--;
is_centriods[j] = false;
for (int k = 0; k < mv_num; k++) {
if (neighborhood[j][k]) {
neighborhood[i][k] = true;
}
}
should_stop = false;
}
}
}
}
if (should_stop) {
break;
}
}
// Label
for (int i = 0; i < mv_num; i++) {
if (is_centriods[i]) {
int i_idx = i + start;
for (int j = 0; j < mv_num; j++) {
if (neighborhood[i][j]) {
int j_idx = j + start;
cluster_label[j_idx] = i_idx;
}
}
}
}
}
void merge_mv(CANDIDATE_MV ref_mv_stack[MAX_REF_MV_STACK_SIZE],
uint16_t ref_mv_weight[MAX_REF_MV_STACK_SIZE],
int cluster_label[MAX_REF_MV_STACK_SIZE], int start, int end,
int cluster_idx_to_merge, int *new_slot) {
// centriod
int64_t this_mv_row, this_mv_col, comp_mv_row, comp_mv_col, temp;
uint64_t total_weight = 0U;
this_mv_row = this_mv_col = comp_mv_row = comp_mv_col = temp = 0U;
int cluster_points = 0;
// Choose whether weighted average or arithmetic average
bool use_weighted_avg = true;
for (int j = start; j < end; j++) {
if (cluster_label[j] == cluster_idx_to_merge) {
if (use_weighted_avg) {
// Weighted Average
const int64_t weight = ref_mv_weight[j];
this_mv_row += ref_mv_stack[j].this_mv.as_mv.row * weight;
this_mv_col += ref_mv_stack[j].this_mv.as_mv.col * weight;
comp_mv_row += ref_mv_stack[j].comp_mv.as_mv.row * weight;
comp_mv_col += ref_mv_stack[j].comp_mv.as_mv.col * weight;
total_weight += ref_mv_weight[j];
cluster_points++;
} else {
// Arithmetic Average
this_mv_row += ref_mv_stack[j].this_mv.as_mv.row;
this_mv_col += ref_mv_stack[j].this_mv.as_mv.col;
comp_mv_row += ref_mv_stack[j].comp_mv.as_mv.row;
comp_mv_col += ref_mv_stack[j].comp_mv.as_mv.col;
cluster_points++;
}
}
}
if (use_weighted_avg) {
// Weighted Avg
this_mv_row = (this_mv_row + (total_weight >> 1)) / total_weight;
this_mv_col = (this_mv_col + (total_weight >> 1)) / total_weight;
comp_mv_row = (comp_mv_row + (total_weight >> 1)) / total_weight;
comp_mv_col = (comp_mv_col + (total_weight >> 1)) / total_weight;
} else {
// Arithmetic Avg
this_mv_row = (this_mv_row + (cluster_points >> 1)) / cluster_points;
this_mv_col = (this_mv_col + (cluster_points >> 1)) / cluster_points;
comp_mv_row = (comp_mv_row + (cluster_points >> 1)) / cluster_points;
comp_mv_col = (comp_mv_col + (cluster_points >> 1)) / cluster_points;
}
this_mv_row = clamp64(this_mv_row, INT16_MIN, INT16_MAX);
this_mv_col = clamp64(this_mv_col, INT16_MIN, INT16_MAX);
comp_mv_row = clamp64(comp_mv_row, INT16_MIN, INT16_MAX);
comp_mv_col = clamp64(comp_mv_col, INT16_MIN, INT16_MAX);
// De-Duplication
bool duplicated = false;
for (int j = start; j < end; j++) {
if (this_mv_row == ref_mv_stack[j].this_mv.as_mv.row &&
this_mv_col == ref_mv_stack[j].this_mv.as_mv.col) {
duplicated = true;
}
}
if (!duplicated && (*new_slot) < MAX_REF_MV_STACK_SIZE &&
cluster_points > 1) {
// ref_mv_weight[*new_slot] = (this_weight > UINT16_MAX) ? UINT16_MAX :
// this_weight; Give it a very small weight (smaller than all the others),
// so that it will not come to the front of the other existing MVs
ref_mv_weight[*new_slot] = 1U;
ref_mv_stack[*new_slot].this_mv.as_mv.row = this_mv_row;
ref_mv_stack[*new_slot].this_mv.as_mv.col = this_mv_col;
ref_mv_stack[*new_slot].comp_mv.as_mv.row = comp_mv_row;
ref_mv_stack[*new_slot].comp_mv.as_mv.col = comp_mv_col;
cluster_label[*new_slot] = cluster_idx_to_merge;
(*new_slot)++;
}
}
#endif
#if CONFIG_EXT_REFMV
#ifdef USE_FLOAT
static float calc_minor_value_float(float mat[3][3], int row1, int row2,
int col1, int col2) {
return mat[row1][col1] * mat[row2][col2] - mat[row1][col2] * mat[row2][col1];
}
static int calc_inverse_3X3_float(float XTX_3X3[3][3],
float inverse_XTX_3X3[3][3]) {
float minor_mat_3X3[3][3];
minor_mat_3X3[0][0] = calc_minor_value_float(XTX_3X3, 1, 2, 1, 2);
minor_mat_3X3[0][1] = calc_minor_value_float(XTX_3X3, 1, 2, 0, 2) * (-1);
minor_mat_3X3[0][2] = calc_minor_value_float(XTX_3X3, 1, 2, 0, 1);
minor_mat_3X3[1][0] = calc_minor_value_float(XTX_3X3, 0, 2, 1, 2) * (-1);
minor_mat_3X3[1][1] = calc_minor_value_float(XTX_3X3, 0, 2, 0, 2);
minor_mat_3X3[1][2] = calc_minor_value_float(XTX_3X3, 0, 2, 0, 1) * (-1);
minor_mat_3X3[2][0] = calc_minor_value_float(XTX_3X3, 0, 1, 1, 2);
minor_mat_3X3[2][1] = calc_minor_value_float(XTX_3X3, 0, 1, 0, 2) * (-1);
minor_mat_3X3[2][2] = calc_minor_value_float(XTX_3X3, 0, 1, 0, 1);
const float determinant = XTX_3X3[0][0] * minor_mat_3X3[0][0] +
XTX_3X3[0][1] * minor_mat_3X3[0][1] +
XTX_3X3[0][2] * minor_mat_3X3[0][2];
aom_clear_system_state();
if (determinant != 0) {
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
// Transpose and divided by determinant
// Since the division may lose precision, we first scale the value
inverse_XTX_3X3[i][j] = (minor_mat_3X3[j][i]) / (determinant);
}
}
return 1;
}
return 0;
}
static int calc_inverse_2X2_float(float XTX_2X2[2][2],
float inverse_XTX_2X2[2][2]) {
const float determinant =
XTX_2X2[0][0] * XTX_2X2[1][1] - XTX_2X2[0][1] * XTX_2X2[1][0];
if (determinant != 0) {
inverse_XTX_2X2[0][0] = XTX_2X2[1][1] / determinant;
inverse_XTX_2X2[1][1] = XTX_2X2[0][0] / determinant;
inverse_XTX_2X2[0][1] = -XTX_2X2[0][1] / determinant;
inverse_XTX_2X2[1][0] = -XTX_2X2[1][0] / determinant;
return 1;
}
return 0;
}
#else
static int64_t calc_minor_value(int64_t mat[3][3], int row1, int row2, int col1,
int col2) {
return mat[row1][col1] * mat[row2][col2] - mat[row1][col2] * mat[row2][col1];
}
static int calc_inverse_3X3_with_scaling(int64_t XTX_3X3[3][3],
int64_t inverse_XTX_3X3[3][3]) {
int64_t minor_mat_3X3[3][3];
minor_mat_3X3[0][0] = calc_minor_value(XTX_3X3, 1, 2, 1, 2);
minor_mat_3X3[0][1] = calc_minor_value(XTX_3X3, 1, 2, 0, 2) * (-1);
minor_mat_3X3[0][2] = calc_minor_value(XTX_3X3, 1, 2, 0, 1);
minor_mat_3X3[1][0] = calc_minor_value(XTX_3X3, 0, 2, 1, 2) * (-1);
minor_mat_3X3[1][1] = calc_minor_value(XTX_3X3, 0, 2, 0, 2);
minor_mat_3X3[1][2] = calc_minor_value(XTX_3X3, 0, 2, 0, 1) * (-1);
minor_mat_3X3[2][0] = calc_minor_value(XTX_3X3, 0, 1, 1, 2);
minor_mat_3X3[2][1] = calc_minor_value(XTX_3X3, 0, 1, 0, 2) * (-1);
minor_mat_3X3[2][2] = calc_minor_value(XTX_3X3, 0, 1, 0, 1);
const int64_t determinant = XTX_3X3[0][0] * minor_mat_3X3[0][0] +
XTX_3X3[0][1] * minor_mat_3X3[0][1] +
XTX_3X3[0][2] * minor_mat_3X3[0][2];
aom_clear_system_state();
if (determinant != 0) {
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
// Transpose and divided by determinant
// Since the division may lose precision, we first scale the value
inverse_XTX_3X3[i][j] =
(minor_mat_3X3[j][i] << SCALE_BITS) / (determinant);
}
}
return 1;
}
return 0;
}
static int calc_inverse_2X2_scaling(int64_t XTX_2X2[2][2],
int64_t inverse_XTX_2X2[2][2]) {
const int64_t determinant =
XTX_2X2[0][0] * XTX_2X2[1][1] - XTX_2X2[0][1] * XTX_2X2[1][0];
if (determinant != 0) {
inverse_XTX_2X2[0][0] = (XTX_2X2[1][1] << SCALE_BITS) / determinant;
inverse_XTX_2X2[1][1] = (XTX_2X2[0][0] << SCALE_BITS) / determinant;
inverse_XTX_2X2[0][1] = -(XTX_2X2[0][1] << SCALE_BITS) / determinant;
inverse_XTX_2X2[1][0] = -(XTX_2X2[1][0] << SCALE_BITS) / determinant;
return 1;
}
return 0;
}
#endif
/**
* |x'| |h11 h12 h13| |x|
* |y'| = |h21 h22 h23| X |y|
* |1 | |0 0 1 | |1|
*
* The above can be decoupled into two different estimation problem
*
* |x1 y1 1| |h11| |x1'|
* |x2 y2 1| X |h12| = |x2'|
* | ... | |h13| |...|
* |xn yn 1| |xn'|
*
*
* |x1 y1 1| |h21| |y1'|
* |x2 y2 1| X |h22| = |y2'|
* | ... | |h23| |...|
* |xn yn 1| |yn'|
*
*
* With n sources points (x1, y1), (x2, y2), ... (xn, yn),
* and calculated (based on MVs) n destination points
* (x1', y1'), ..., (xn', yn')
* Then we can use least squares method to estimate the 6 parameters
* Actually, with (x, y) as (0,0)
* to caculate (x', y'), we only need to get h13 and h23
* (h13, h23) is also the mvs we need
*
* y = X * beta
* The estimated beta= inverse(XTX) * XT * y (XT is the transpose of X)
***/
static int_mv calc_affine_mv(LOCATION_INFO *source_points,
LOCATION_INFO *destination_points,
int point_number, LOCATION_INFO my_point) {
int_mv ans_mv;
if (point_number == 0) {
ans_mv.as_int = INVALID_MV;
return ans_mv;
}
#ifdef USE_FLOAT
int64_t sum_x = 0;
int64_t sum_y = 0;
int64_t sum_xx = 0;
int64_t sum_xy = 0;
int64_t sum_yy = 0;
for (int i = 0; i < point_number; i++) {
sum_x += source_points[i].x;
sum_y += source_points[i].y;
sum_xx += source_points[i].x * source_points[i].x;
sum_xy += source_points[i].x * source_points[i].y;
sum_yy += source_points[i].y * source_points[i].y;
}
float XTX_3X3[3][3] = { { sum_xx, sum_xy, sum_x },
{ sum_xy, sum_yy, sum_y },
{ sum_x, sum_y, point_number } };
float inverse_XTX_3X3[3][3];
int ret = calc_inverse_3X3_float(XTX_3X3, inverse_XTX_3X3);
if (ret == 0) {
// Fail to Calc inverse
ans_mv.as_int = INVALID_MV;
return ans_mv;
}
aom_clear_system_state();
float mat[3][MAX_REF_LOC_STACK_SIZE];
for (int i = 0; i < 3; i++) {
for (int j = 0; j < point_number; j++) {
mat[i][j] = inverse_XTX_3X3[i][0] * source_points[j].x +
inverse_XTX_3X3[i][1] * source_points[j].y +
inverse_XTX_3X3[i][2];
}
}
float h11 = 0;
float h12 = 0;
float h13 = 0;
float h21 = 0;
float h22 = 0;
float h23 = 0;
for (int i = 0; i < point_number; i++) {
h11 += mat[0][i] * destination_points[i].x;
h12 += mat[1][i] * destination_points[i].x;
h13 += mat[2][i] * destination_points[i].x;
h21 += mat[0][i] * destination_points[i].y;
h22 += mat[1][i] * destination_points[i].y;
h23 += mat[2][i] * destination_points[i].y;
}
const float my_projected_x = (h11 * my_point.x + h12 * my_point.y + h13);
const float my_projected_y = (h21 * my_point.x + h22 * my_point.y + h23);
const int64_t mv_col = (int64_t)roundf(my_projected_x - my_point.x);
const int64_t mv_row = (int64_t)roundf(my_projected_y - my_point.y);
if (mv_col > INT16_MAX || mv_col < INT16_MIN || mv_row > INT16_MAX ||
mv_row < INT16_MIN) {
ans_mv.as_int = INVALID_MV;
} else {
ans_mv.as_mv.row = mv_row;
ans_mv.as_mv.col = mv_col;
}
return ans_mv;
#else
{
int64_t sum_x = 0;
int64_t sum_y = 0;
int64_t sum_xx = 0;
int64_t sum_xy = 0;
int64_t sum_yy = 0;
for (int i = 0; i < point_number; i++) {
sum_x += source_points[i].x;
sum_y += source_points[i].y;
sum_xx += source_points[i].x * source_points[i].x;
sum_xy += source_points[i].x * source_points[i].y;
sum_yy += source_points[i].y * source_points[i].y;
}
int64_t XTX_3X3[3][3] = { { sum_xx, sum_xy, sum_x },
{ sum_xy, sum_yy, sum_y },
{ sum_x, sum_y, point_number } };
int64_t inverse_XTX_3X3[3][3];
const int ret = calc_inverse_3X3_with_scaling(XTX_3X3, inverse_XTX_3X3);
if (ret == 0) {
// Fail to Calc inverse
ans_mv.as_int = INVALID_MV;
return ans_mv;
}
aom_clear_system_state();
int64_t mat[3][point_number];
for (int i = 0; i < 3; i++) {
for (int j = 0; j < point_number; j++) {
mat[i][j] = inverse_XTX_3X3[i][0] * source_points[j].x +
inverse_XTX_3X3[i][1] * source_points[j].y +
inverse_XTX_3X3[i][2];
}
}
int64_t h11 = 0;
int64_t h12 = 0;
int64_t h13 = 0;
int64_t h21 = 0;
int64_t h22 = 0;
int64_t h23 = 0;
for (int i = 0; i < point_number; i++) {
h11 += mat[0][i] * destination_points[i].x;
h12 += mat[1][i] * destination_points[i].x;
h13 += mat[2][i] * destination_points[i].x;
h21 += mat[0][i] * destination_points[i].y;
h22 += mat[1][i] * destination_points[i].y;
h23 += mat[2][i] * destination_points[i].y;
}
int64_t my_projected_x = (h11 * my_point.x + h12 * my_point.y + h13);
int64_t my_projected_y = (h21 * my_point.x + h22 * my_point.y + h23);
// Scale Back
my_projected_x = (my_projected_x >> SCALE_BITS);
my_projected_y = (my_projected_y >> SCALE_BITS);
const int64_t mv_col = my_projected_x - my_point.x;
const int64_t mv_row = my_projected_y - my_point.y;
if (mv_col > INT16_MAX || mv_col < INT16_MIN || mv_row > INT16_MAX ||
mv_row < INT16_MIN) {
ans_mv.as_int = INVALID_MV;
} else {
ans_mv.as_mv.row = mv_row;
ans_mv.as_mv.col = mv_col;
}
return ans_mv;
}
#endif
}
/**
* |x'| |h11 h12| |x|
* |y'| = |h21 h22| X |y|
*
* The above can be decoupled into two different estimation problem
*
* |x1 y1| |h11| |x1'|
* |x2 y2| X |h12| = |x2'|
* | ... | |...|
* |xn yn| |xn'|
*
*
* |x1 y1| |h21| |y1'|
* |x2 y2| X |h22| = |y2'|
* | ... | |...|
* |xn yn| |yn'|
*
* With n sources points (x1, y1), (x2, y2), ... (xn, yn),
* and calculated (based on MVs) n destination points
* (x1', y1'), ..., (xn', yn')
* Then we can use least squares method to estimate the 6 parameters
* Actually, with (x, y) as (0,0)
* to caculate (x', y'), we only need to get h13 and h23
* (h13, h23) is also the mvs we need
*
* y = X * beta
* The estimated beta= inverse(XTX) * XT * y (XT is the transpose of X)
***/
static int_mv calc_rotzoom_mv(LOCATION_INFO *source_points,
LOCATION_INFO *destination_points,
int point_number, LOCATION_INFO my_point) {
int_mv ans_mv;
if (point_number == 0) {
ans_mv.as_int = INVALID_MV;
return ans_mv;
}
#ifdef USE_FLOAT
{
int64_t sum_xx = 0;
int64_t sum_xy = 0;
int64_t sum_yy = 0;
for (int i = 0; i < point_number; i++) {
sum_xx += source_points[i].x * source_points[i].x;
sum_xy += source_points[i].x * source_points[i].y;
sum_yy += source_points[i].y * source_points[i].y;
}
float XTX_2X2[2][2] = { { sum_xx, sum_xy }, { sum_xy, sum_yy } };
float inverse_XTX_2X2[2][2];
const int ret = calc_inverse_2X2_float(XTX_2X2, inverse_XTX_2X2);
if (ret == 0) {
// Fail to Calc inverse
ans_mv.as_int = INVALID_MV;
return ans_mv;
}
aom_clear_system_state();
float mat[2][256];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < point_number; j++) {
mat[i][j] = inverse_XTX_2X2[i][0] * source_points[j].x +
inverse_XTX_2X2[i][1] * source_points[j].y;
}
}
float h11 = 0;
float h12 = 0;
float h21 = 0;
float h22 = 0;
for (int i = 0; i < point_number; i++) {
h11 += mat[0][i] * destination_points[i].x;
h12 += mat[1][i] * destination_points[i].x;
h21 += mat[0][i] * destination_points[i].y;
h22 += mat[1][i] * destination_points[i].y;
}
const float my_projected_x = (h11 * my_point.x + h12 * my_point.y);
const float my_projected_y = (h21 * my_point.x + h22 * my_point.y);
const int64_t mv_col = (int64_t)roundf(my_projected_x - my_point.x);
const int64_t mv_row = (int64_t)roundf(my_projected_y - my_point.y);
if (mv_col > INT16_MAX || mv_col < INT16_MIN || mv_row > INT16_MAX ||
mv_row < INT16_MIN) {
ans_mv.as_int = INVALID_MV;
} else {
ans_mv.as_mv.row = mv_row;
ans_mv.as_mv.col = mv_col;
}
return ans_mv;
}
#else
{
int64_t sum_xx = 0;
int64_t sum_xy = 0;
int64_t sum_yy = 0;
for (int i = 0; i < point_number; i++) {
sum_xx += source_points[i].x * source_points[i].x;
sum_xy += source_points[i].x * source_points[i].y;
sum_yy += source_points[i].y * source_points[i].y;
}
int64_t XTX_2X2[2][2] = { { sum_xx, sum_xy }, { sum_xy, sum_yy } };
int64_t inverse_XTX_2X2[2][2];
const int ret = calc_inverse_2X2_with_scaling(XTX_2X2, inverse_XTX_2X2);
if (ret == 0) {
// Fail to Calc inverse
ans_mv.as_int = INVALID_MV;
return ans_mv;
}
aom_clear_system_state();
int64_t mat[2][point_number];
for (int i = 0; i < 2; i++) {
for (int j = 0; j < point_number; j++) {
mat[i][j] = inverse_XTX_2X2[i][0] * source_points[j].x +
inverse_XTX_2X2[i][1] * source_points[j].y;
}
}
int64_t h11 = 0;
int64_t h12 = 0;
int64_t h21 = 0;
int64_t h22 = 0;
for (int i = 0; i < point_number; i++) {
h11 += mat[0][i] * destination_points[i].x;
h12 += mat[1][i] * destination_points[i].x;
h21 += mat[0][i] * destination_points[i].y;
h22 += mat[1][i] * destination_points[i].y;
}
int64_t my_projected_x = (h11 * my_point.x + h12 * my_point.y);
int64_t my_projected_y = (h21 * my_point.x + h22 * my_point.y);
// Scale Back
my_projected_x = (my_projected_x >> SCALE_BITS);
my_projected_y = (my_projected_y >> SCALE_BITS);
const int64_t mv_col = my_projected_x - my_point.x;
const int64_t mv_row = my_projected_y - my_point.y;
if (mv_col > INT16_MAX || mv_col < INT16_MIN || mv_row > INT16_MAX ||
mv_row < INT16_MIN) {
ans_mv.as_int = INVALID_MV;
} else {
ans_mv.as_mv.row = mv_row;
ans_mv.as_mv.col = mv_col;
}
return ans_mv;
}
#endif
}
static int_mv calc_weighted_mv(LOCATION_INFO *source_points,
LOCATION_INFO *destination_points,
int32_t point_number, LOCATION_INFO my_point) {
int_mv ans_mv;
ans_mv.as_int = INVALID_MV;
if (point_number == 0) {
return ans_mv;
}
int64_t col = 0, row = 0;
int64_t total_weight = 0;
for (int i = 0; i < point_number; i++) {
const int64_t x_dist = source_points[i].x - my_point.x;
const int64_t y_dist = source_points[i].y - my_point.y;
const int64_t dist = x_dist * x_dist + y_dist * y_dist;
const int64_t this_weight = 10000000 / dist;
total_weight += this_weight;
// We use the 1/dist as the weight (i.e. those MVs which are farther away
// from the current block have less effect on determining the averaged MV
// for the current block)
col += (destination_points[i].x - destination_points[i].x) * this_weight;
row += (destination_points[i].y - destination_points[i].y) * this_weight;
}
col = (col + (total_weight >> 1)) / total_weight;
row = (row + (total_weight >> 1)) / total_weight;
if (col > INT16_MAX || row > INT16_MAX || col < INT16_MIN ||
row < INT16_MIN) {
return ans_mv;
} else {
ans_mv.as_mv.col = col;
ans_mv.as_mv.row = row;
return ans_mv;
}
}
static int_mv calc_arithmetic_mv(LOCATION_INFO *source_points,
LOCATION_INFO *destination_points,
int32_t point_number) {
int_mv ans_mv;
ans_mv.as_int = INVALID_MV;
if (point_number == 0) {
return ans_mv;
}
int64_t col = 0, row = 0;
for (int i = 0; i < point_number; i++) {
col += (destination_points[i].x - source_points[i].x);
row += (destination_points[i].y - destination_points[i].y);
}
col = (col + (point_number >> 1)) / point_number;
row = (row + (point_number >> 1)) / point_number;
if (col > INT16_MAX || row > INT16_MAX || col < INT16_MIN ||
row < INT16_MIN) {
return ans_mv;
} else {
ans_mv.as_mv.col = col;
ans_mv.as_mv.row = row;
return ans_mv;
}
}
bool is_duplicated(int_mv mv_to_check,
CANDIDATE_MV ref_mv_stack[MAX_REF_MV_STACK_SIZE],
int mv_count) {
for (int i = 0; i < mv_count; i++) {
if (mv_to_check.as_int == ref_mv_stack[i].this_mv.as_int) {
return true;
}
}
return false;
}
#endif // CONFIG_EXT_REFMV
static void setup_ref_mv_list(const AV1_COMMON *cm, const MACROBLOCKD *xd,
MV_REFERENCE_FRAME ref_frame,
REF_MV_INFO *ref_mv_info, int_mv *mv_ref_list,
int_mv *gm_mv_candidates, int mi_row, int mi_col,
int16_t *mode_context) {
const int bs = AOMMAX(xd->n4_w, xd->n4_h);
const int has_tr = has_top_right(cm, xd, mi_row, mi_col, bs);
MV_REFERENCE_FRAME rf[2];
const TileInfo *const tile = &xd->tile;
int max_row_offset = 0, max_col_offset = 0;
const int row_adj = (xd->n4_h < mi_size_high[BLOCK_8X8]) && (mi_row & 0x01);
const int col_adj = (xd->n4_w < mi_size_wide[BLOCK_8X8]) && (mi_col & 0x01);
int processed_rows = 0;
int processed_cols = 0;
uint8_t *refmv_count = &ref_mv_info->ref_mv_count[ref_frame];
CANDIDATE_MV *ref_mv_stack = ref_mv_info->ref_mv_stack[ref_frame];
uint16_t *ref_mv_weight = ref_mv_info->ref_mv_weight[ref_frame];
av1_set_ref_frame(rf, ref_frame);
mode_context[ref_frame] = 0;
*refmv_count = 0;
// Find valid maximum row/col offset.
if (xd->up_available) {
max_row_offset = -(MVREF_ROW_COLS << 1) + row_adj;
if (xd->n4_h < mi_size_high[BLOCK_8X8])
max_row_offset = -(2 << 1) + row_adj;
max_row_offset = find_valid_row_offset(tile, mi_row, max_row_offset);
}
if (xd->left_available) {
max_col_offset = -(MVREF_ROW_COLS << 1) + col_adj;
if (xd->n4_w < mi_size_wide[BLOCK_8X8])
max_col_offset = -(2 << 1) + col_adj;
max_col_offset = find_valid_col_offset(tile, mi_col, max_col_offset);
}
uint8_t col_match_count = 0;
uint8_t row_match_count = 0;
uint8_t newmv_count = 0;
#if CONFIG_EXT_REFMV || CONFIG_ENHANCED_WARPED_MOTION
ref_mv_info->ref_mv_location_count[ref_frame] = 0;
#endif // CONFIG_EXT_REFMV || CONFIG_ENHANCED_WARPED_MOTION
#if CONFIG_EXT_COMP_REFMV
int_mv partial_ref_mv_stack[2][PARTIALL_REF_MV_STACK_SIZE];
uint16_t partial_ref_mv_weight[2][PARTIALL_REF_MV_STACK_SIZE];
av1_zero(partial_ref_mv_weight);
#endif // CONFIG_EXT_COMP_REFMV
// Scan the first above row mode info. row_offset = -1;
if (abs(max_row_offset) >= 1)
scan_row_mbmi(cm, xd, mi_row, mi_col, ref_frame, ref_mv_info, rf, -1,
&row_match_count, &newmv_count,
#if CONFIG_EXT_COMP_REFMV
partial_ref_mv_stack, partial_ref_mv_weight,
#endif // CONFIG_EXT_COMP_REFMV
gm_mv_candidates, max_row_offset, &processed_rows);
// Scan the first left column mode info. col_offset = -1;
if (abs(max_col_offset) >= 1)
scan_col_mbmi(cm, xd, mi_row, mi_col, ref_frame, ref_mv_info, rf, -1,
&col_match_count, &newmv_count,
#if CONFIG_EXT_COMP_REFMV
partial_ref_mv_stack, partial_ref_mv_weight,
#endif // CONFIG_EXT_COMP_REFMV
gm_mv_candidates, max_col_offset, &processed_cols);
// Check top-right boundary
if (has_tr) {
scan_blk_mbmi(cm, xd, mi_row, mi_col, ref_frame, ref_mv_info, rf, -1,
xd->n4_w, &row_match_count, &newmv_count,
#if CONFIG_EXT_COMP_REFMV
partial_ref_mv_stack, partial_ref_mv_weight,
#endif // CONFIG_EXT_COMP_REFMV
gm_mv_candidates);
}
const uint8_t nearest_match = (row_match_count > 0) + (col_match_count > 0);
#if CONFIG_DBSCAN_FEATURE
uint8_t nearest_refmv_count = *refmv_count;
#else
const uint8_t nearest_refmv_count = *refmv_count;
#endif
// TODO(yunqing): for comp_search, do it for all 3 cases.
for (int idx = 0; idx < nearest_refmv_count; ++idx)
ref_mv_weight[idx] += REF_CAT_LEVEL;
if (cm->allow_ref_frame_mvs) {
int is_available = 0;
const int voffset = AOMMAX(mi_size_high[BLOCK_8X8], xd->n4_h);
const int hoffset = AOMMAX(mi_size_wide[BLOCK_8X8], xd->n4_w);
const int blk_row_end = AOMMIN(xd->n4_h, mi_size_high[BLOCK_64X64]);
const int blk_col_end = AOMMIN(xd->n4_w, mi_size_wide[BLOCK_64X64]);
const int tpl_sample_pos[3][2] = {
{ voffset, -2 },
{ voffset, hoffset },
{ voffset - 2, hoffset },
};
const int allow_extension = (xd->n4_h >= mi_size_high[BLOCK_8X8]) &&
(xd->n4_h < mi_size_high[BLOCK_64X64]) &&
(xd->n4_w >= mi_size_wide[BLOCK_8X8]) &&
(xd->n4_w < mi_size_wide[BLOCK_64X64]);
const int step_h = (xd->n4_h >= mi_size_high[BLOCK_64X64])
? mi_size_high[BLOCK_16X16]
: mi_size_high[BLOCK_8X8];
const int step_w = (xd->n4_w >= mi_size_wide[BLOCK_64X64])
? mi_size_wide[BLOCK_16X16]
: mi_size_wide[BLOCK_8X8];
for (int blk_row = 0; blk_row < blk_row_end; blk_row += step_h) {
for (int blk_col = 0; blk_col < blk_col_end; blk_col += step_w) {
int ret = add_tpl_ref_mv(cm, xd, mi_row, mi_col, ref_frame, ref_mv_info,
blk_row, blk_col,
#if CONFIG_EXT_COMP_REFMV
partial_ref_mv_stack, partial_ref_mv_weight,
#endif // CONFIG_EXT_COMP_REFMV
gm_mv_candidates, mode_context);
if (blk_row == 0 && blk_col == 0) is_available = ret;
}
}
if (is_available == 0) mode_context[ref_frame] |= (1 << GLOBALMV_OFFSET);
for (int i = 0; i < 3 && allow_extension; ++i) {
const int blk_row = tpl_sample_pos[i][0];
const int blk_col = tpl_sample_pos[i][1];
if (!check_sb_border(mi_row, mi_col, blk_row, blk_col)) continue;
add_tpl_ref_mv(cm, xd, mi_row, mi_col, ref_frame, ref_mv_info, blk_row,
blk_col,
#if CONFIG_EXT_COMP_REFMV
partial_ref_mv_stack, partial_ref_mv_weight,
#endif // CONFIG_EXT_COMP_REFMV
gm_mv_candidates, mode_context);
}
}
uint8_t dummy_newmv_count = 0;
// Scan the second outer area.
scan_blk_mbmi(cm, xd, mi_row, mi_col, ref_frame, ref_mv_info, rf, -1, -1,
&row_match_count, &dummy_newmv_count,
#if CONFIG_EXT_COMP_REFMV
partial_ref_mv_stack, partial_ref_mv_weight,
#endif // CONFIG_EXT_COMP_REFMV
gm_mv_candidates);
for (int idx = 2; idx <= MVREF_ROW_COLS; ++idx) {
const int row_offset = -(idx << 1) + 1 + row_adj;
const int col_offset = -(idx << 1) + 1 + col_adj;
if (abs(row_offset) <= abs(max_row_offset) &&
abs(row_offset) > processed_rows)
scan_row_mbmi(cm, xd, mi_row, mi_col, ref_frame, ref_mv_info, rf,
row_offset, &row_match_count, &dummy_newmv_count,
#if CONFIG_EXT_COMP_REFMV
partial_ref_mv_stack, partial_ref_mv_weight,
#endif // CONFIG_EXT_COMP_REFMV
gm_mv_candidates, max_row_offset, &processed_rows);
if (abs(col_offset) <= abs(max_col_offset) &&
abs(col_offset) > processed_cols)
scan_col_mbmi(cm, xd, mi_row, mi_col, ref_frame, ref_mv_info, rf,
col_offset, &col_match_count, &dummy_newmv_count,
#if CONFIG_EXT_COMP_REFMV
partial_ref_mv_stack, partial_ref_mv_weight,
#endif // CONFIG_EXT_COMP_REFMV
gm_mv_candidates, max_col_offset, &processed_cols);
}
const uint8_t ref_match_count = (row_match_count > 0) + (col_match_count > 0);
switch (nearest_match) {
case 0:
mode_context[ref_frame] |= 0;
if (ref_match_count >= 1) mode_context[ref_frame] |= 1;
if (ref_match_count == 1)
mode_context[ref_frame] |= (1 << REFMV_OFFSET);
else if (ref_match_count >= 2)
mode_context[ref_frame] |= (2 << REFMV_OFFSET);
break;
case 1:
mode_context[ref_frame] |= (newmv_count > 0) ? 2 : 3;
if (ref_match_count == 1)
mode_context[ref_frame] |= (3 << REFMV_OFFSET);
else if (ref_match_count >= 2)
mode_context[ref_frame] |= (4 << REFMV_OFFSET);
break;
case 2:
default:
if (newmv_count >= 1)
mode_context[ref_frame] |= 4;
else
mode_context[ref_frame] |= 5;
mode_context[ref_frame] |= (5 << REFMV_OFFSET);
break;
}
#if CONFIG_DBSCAN_FEATURE
// Clustering for 2 Parts Seperately, with nearest_refmv_count as the
// borderline (because the following sorting is conducted in two parts)
{
// DBSCAN Parameters
const int min_points = 3;
const int dist_threshold = 1;
int cluster_num1 = 0;
int cluster_num2 = 0;
int cluster_label[MAX_REF_MV_STACK_SIZE];
for (int i = 0; i < (*refmv_count); i++) {
cluster_label[i] = -1;
}
int new_slot = (*refmv_count);
// If the spatial mvs can not even fill the MAX_MV_REF_CANDIDATES, we will
// not cluster them
if (nearest_refmv_count > MAX_MV_REF_CANDIDATES) {
mv_dbscan(ref_mv_stack, 0, nearest_refmv_count, min_points,
dist_threshold, &cluster_num1, cluster_label,
(rf[1] == NONE_FRAME));
// Merge MVs
for (int i = 0; i < nearest_refmv_count; i++) {
if (cluster_label[i] == i) {
// centriod update (no merge any more, only add new mvs)
merge_mv(ref_mv_stack, ref_mv_weight, cluster_label, 0,
nearest_refmv_count, i, &new_slot);
}
}
}
// If there are too few mv candidates remaining, do not cluster them
if ((*refmv_count) - nearest_refmv_count > 2) {
mv_dbscan(ref_mv_stack, nearest_refmv_count, (*refmv_count), min_points,
dist_threshold, &cluster_num2, cluster_label,
(rf[1] == NONE_FRAME));
// Merge MVs
for (int i = nearest_refmv_count; i < (*refmv_count); i++) {
if (cluster_label[i] == i) {
merge_mv(ref_mv_stack, ref_mv_weight, cluster_label,
nearest_refmv_count, (*refmv_count), i, &new_slot);
}
}
}
(*refmv_count) =
(new_slot < MAX_REF_MV_STACK_SIZE ? new_slot : MAX_REF_MV_STACK_SIZE);
// Shrink MV list
{
CANDIDATE_MV tmp[MAX_REF_MV_STACK_SIZE];
uint16_t tmp_weight[MAX_REF_MV_STACK_SIZE];
int count = 0;
uint8_t old_nearest_refmv_count = nearest_refmv_count;
for (int i = 0; i < old_nearest_refmv_count; i++) {
if (cluster_label[i] == -1 || cluster_label[i] == i) {
// Only keep outliers and cluster centriods
tmp[count].this_mv.as_int = ref_mv_stack[i].this_mv.as_int;
tmp[count].comp_mv.as_int = ref_mv_stack[i].comp_mv.as_int;
tmp_weight[count] = ref_mv_weight[i];
count++;
}
}
nearest_refmv_count = count;
for (int i = old_nearest_refmv_count; i < (*refmv_count); i++) {
if (cluster_label[i] == -1 || cluster_label[i] == i) {
// Only keep outliers and cluster centriods
tmp[count].this_mv.as_int = ref_mv_stack[i].this_mv.as_int;
tmp[count].comp_mv.as_int = ref_mv_stack[i].comp_mv.as_int;
tmp_weight[count] = ref_mv_weight[i];
count++;
}
}
(*refmv_count) = count;
for (int i = 0; i < count; i++) {
ref_mv_stack[i].this_mv.as_int = tmp[i].this_mv.as_int;
ref_mv_stack[i].comp_mv.as_int = tmp[i].comp_mv.as_int;
ref_mv_weight[i] = tmp_weight[i];
}
}
}
#endif
#if CONFIG_EXT_REFMV
if (rf[1] == NONE_FRAME) {
// Warp Transformation (Curently only consider for Single Frame Prediction)
// ref_location_stack
LOCATION_INFO *ref_location_stack =
ref_mv_info->ref_mv_location_stack[ref_frame];
LOCATION_INFO projected_points[MAX_REF_MV_STACK_SIZE];
const int location_count = ref_mv_info->ref_mv_location_count[ref_frame];
for (uint8_t i = 0; i < location_count; i++) {
projected_points[i].x =
ref_location_stack[i].x + ref_location_stack[i].this_mv.as_mv.col;
projected_points[i].y =
ref_location_stack[i].y + ref_location_stack[i].this_mv.as_mv.row;
}
LOCATION_INFO my_point;
int32_t my_w = xd->n4_w;
int32_t my_h = xd->n4_h;
// *4 means (*8/2), because it is measured in 1/8 pixels
// and we need the centriod of the current block
my_point.x = (my_w * MI_SIZE) * 4;
my_point.y = (my_h * MI_SIZE) * 4;
#ifdef ADD_AFFINE_MV
if ((*refmv_count) < MAX_REF_MV_STACK_SIZE) {
int_mv affine_mv = calc_affine_mv(ref_location_stack, projected_points,
location_count, my_point);
if (affine_mv.as_int != INVALID_MV &&
cm->fr_mv_precision != MV_SUBPEL_EIGHTH_PRECISION) {
const int shift = MV_SUBPEL_EIGHTH_PRECISION - cm->fr_mv_precision;
affine_mv.as_mv.row = (affine_mv.as_mv.row >> shift) << shift;
affine_mv.as_mv.col = (affine_mv.as_mv.col >> shift) << shift;
}
if (affine_mv.as_int != INVALID_MV &&
(!is_duplicated(affine_mv, ref_mv_stack, (*refmv_count)))) {
ref_mv_stack[(*refmv_count)].this_mv = affine_mv;
ref_mv_weight[(*refmv_count)] = 1;
(*refmv_count)++;
}
}
#endif
#ifdef ADD_ARITHMETIC_AVG
if ((*refmv_count) < MAX_REF_MV_STACK_SIZE) {
int_mv arithmetic_mv = calc_arithmetic_mv(
ref_location_stack, projected_points, location_count);
if (arithmetic_mv.as_int != INVALID_MV &&
cm->fr_mv_precision != MV_SUBPEL_EIGHTH_PRECISION) {
const int shift = MV_SUBPEL_EIGHTH_PRECISION - cm->fr_mv_precision;
arithmetic_mv.as_mv.row = (arithmetic_mv.as_mv.row >> shift) << shift;
arithmetic_mv.as_mv.col = (arithmetic_mv.as_mv.col >> shift) << shift;
}
if (arithmetic_mv.as_int != INVALID_MV &&
(!is_duplicated(arithmetic_mv, ref_mv_stack, (*refmv_count)))) {
ref_mv_stack[(*refmv_count)].this_mv = arithmetic_mv;
ref_mv_weight[(*refmv_count)] = 1;
(*refmv_count)++;
}
}
#endif
#ifdef ADD_WEIGHTED_AVG
if ((*refmv_count) < MAX_REF_MV_STACK_SIZE) {
int_mv weighted_avg_mv = calc_weighted_mv(
ref_location_stack, projected_points, location_count, my_point);
if (weighted_avg_mv.as_int != INVALID_MV &&
cm->fr_mv_precision != MV_SUBPEL_EIGHTH_PRECISION) {
const int shift = MV_SUBPEL_EIGHTH_PRECISION - cm->fr_mv_precision;
weighted_avg_mv.as_mv.row = (weighted_avg_mv.as_mv.row >> shift)
<< shift;
weighted_avg_mv.as_mv.col = (weighted_avg_mv.as_mv.col >> shift)
<< shift;
}
if (weighted_avg_mv.as_int != INVALID_MV &&
(!is_duplicated(weighted_avg_mv, ref_mv_stack, (*refmv_count)))) {
ref_mv_stack[(*refmv_count)].this_mv = weighted_avg_mv;
ref_mv_weight[(*refmv_count)] = 1;
(*refmv_count)++;
}
}
#endif
#ifdef ADD_ROTZOOM_MV
if ((*refmv_count) < MAX_REF_MV_STACK_SIZE) {
int_mv rotzoom_mv = calc_rotzoom_mv(ref_location_stack, projected_points,
location_count, my_point);
if (rotzoom_mv.as_int != INVALID_MV &&
cm->fr_mv_precision != MV_SUBPEL_EIGHTH_PRECISION) {
const int shift = MV_SUBPEL_EIGHTH_PRECISION - cm->fr_mv_precision;
rotzoom_mv.as_mv.row = (rotzoom_mv.as_mv.row >> shift) << shift;
rotzoom_mv.as_mv.col = (rotzoom_mv.as_mv.col >> shift) << shift;
}
if (rotzoom_mv.as_int != INVALID_MV &&
(!is_duplicated(rotzoom_mv, ref_mv_stack, (*refmv_count)))) {
ref_mv_stack[(*refmv_count)].this_mv = rotzoom_mv;
ref_mv_weight[(*refmv_count)] = 1;
(*refmv_count)++;
}
}
#endif
}
#endif // CONFIG_EXT_REFMV
// Rank the likelihood and assign nearest and near mvs.
int len = nearest_refmv_count;
while (len > 0) {
int nr_len = 0;
for (int idx = 1; idx < len; ++idx) {
if (ref_mv_weight[idx - 1] < ref_mv_weight[idx]) {
const CANDIDATE_MV tmp_mv = ref_mv_stack[idx - 1];
const uint16_t tmp_ref_mv_weight = ref_mv_weight[idx - 1];
ref_mv_stack[idx - 1] = ref_mv_stack[idx];
ref_mv_stack[idx] = tmp_mv;
ref_mv_weight[idx - 1] = ref_mv_weight[idx];
ref_mv_weight[idx] = tmp_ref_mv_weight;
nr_len = idx;
}
}
len = nr_len;
}
len = *refmv_count;
while (len > nearest_refmv_count) {
int nr_len = nearest_refmv_count;
for (int idx = nearest_refmv_count + 1; idx < len; ++idx) {
if (ref_mv_weight[idx - 1] < ref_mv_weight[idx]) {
const CANDIDATE_MV tmp_mv = ref_mv_stack[idx - 1];
const uint16_t tmp_ref_mv_weight = ref_mv_weight[idx - 1];
ref_mv_stack[idx - 1] = ref_mv_stack[idx];
ref_mv_stack[idx] = tmp_mv;
ref_mv_weight[idx - 1] = ref_mv_weight[idx];
ref_mv_weight[idx] = tmp_ref_mv_weight;
nr_len = idx;
}
}
len = nr_len;
}
#if CONFIG_EXT_COMP_REFMV
// Add partially matched ref MVs for compound modes.
if (rf[1] > INTRA_FRAME && *refmv_count < MAX_REF_MV_STACK_SIZE) {
int_mv buf[2][PARTIALL_REF_MV_STACK_SIZE];
int count[2] = { 0 };
const int max_num = 2;
for (int i = 0; i < 2; ++i) {
// Pick the top "max_num" MVs with the largest weight.
for (int j = 0; j < max_num; ++j) {
int best = -1, max_weight = 0;
for (int k = 0; k < PARTIALL_REF_MV_STACK_SIZE; ++k) {
if (partial_ref_mv_weight[i][k] > max_weight) {
max_weight = partial_ref_mv_weight[i][k];
best = k;
}
}
if (best < 0) break;
buf[i][j] = partial_ref_mv_stack[i][best];
partial_ref_mv_weight[i][best] = 0;
++count[i];
}
}
for (int i = 0; i < count[0] && *refmv_count < MAX_REF_MV_STACK_SIZE; ++i) {
for (int j = 0; j < count[1] && *refmv_count < MAX_REF_MV_STACK_SIZE;
++j) {
CANDIDATE_MV extra_cand;
extra_cand.this_mv = buf[0][i];
extra_cand.comp_mv = buf[1][j];
int existing = 0;
for (int k = 0; k < *refmv_count; ++k) {
if (ref_mv_stack[k].this_mv.as_int == extra_cand.this_mv.as_int &&
ref_mv_stack[k].comp_mv.as_int == extra_cand.comp_mv.as_int) {
existing = 1;
break;
}
}
if (!existing) {
ref_mv_stack[*refmv_count] = extra_cand;
ref_mv_weight[*refmv_count] = 1;
++(*refmv_count);
}
}
}
}
#endif // CONFIG_EXT_COMP_REFMV
#if CONFIG_REF_MV_BANK
// If open slots are available, fetch reference MVs from the ref mv banks.
if (*refmv_count < MAX_REF_MV_STACK_SIZE && ref_frame != INTRA_FRAME) {
const REF_MV_BANK *ref_mv_bank_left = xd->ref_mv_bank_left_pt
? xd->ref_mv_bank_left_pt
: &xd->ref_mv_bank_left;
const CANDIDATE_MV *queue_left =
ref_mv_bank_left->rmb_queue_buffer[ref_frame];
const int count_left = ref_mv_bank_left->rmb_queue_count[ref_frame];
const int start_idx_left = ref_mv_bank_left->rmb_queue_start_idx[ref_frame];
const int sb_col = xd->mi_col / cm->seq_params.mib_size;
const REF_MV_BANK *ref_mv_bank_above =
xd->ref_mv_bank_above_pt ? &xd->ref_mv_bank_above_pt[sb_col]
: &xd->ref_mv_bank_above[sb_col];
const int count_above = ref_mv_bank_above->rmb_queue_count[ref_frame];
const CANDIDATE_MV *queue_above =
ref_mv_bank_above->rmb_queue_buffer[ref_frame];
const int start_idx_above =
ref_mv_bank_above->rmb_queue_start_idx[ref_frame];
const int is_comp = rf[1] > INTRA_FRAME;
int idx_left = 0, idx_above = 0;
do {
for (; idx_left < count_left && *refmv_count < MAX_REF_MV_STACK_SIZE;
++idx_left) {
const int idx =
(start_idx_left + count_left - 1 - idx_left) % REF_MV_BANK_SIZE;
int existing = 0;
for (int j = 0; j < *refmv_count; ++j) {
if (ref_mv_stack[j].this_mv.as_int ==
queue_left[idx].this_mv.as_int &&
(!is_comp || ref_mv_stack[j].comp_mv.as_int ==
queue_left[idx].comp_mv.as_int)) {
existing = 1;
break;
}
}
if (existing) continue;
ref_mv_stack[*refmv_count] = queue_left[idx];
ref_mv_weight[*refmv_count] = 1;
++*refmv_count;
break;
}
for (; idx_above < count_above && *refmv_count < MAX_REF_MV_STACK_SIZE;
++idx_above) {
const int idx =
(start_idx_above + count_above - 1 - idx_above) % REF_MV_BANK_SIZE;
int existing = 0;
for (int j = 0; j < *refmv_count; ++j) {
if (ref_mv_stack[j].this_mv.as_int ==
queue_above[idx].this_mv.as_int &&
(!is_comp || ref_mv_stack[j].comp_mv.as_int ==
queue_above[idx].comp_mv.as_int)) {
existing = 1;
break;
}
}
if (existing) continue;
ref_mv_stack[*refmv_count] = queue_above[idx];
ref_mv_weight[*refmv_count] = 1;
++*refmv_count;
break;
}
if (idx_left >= count_left && idx_above >= count_above) break;
} while (*refmv_count < MAX_REF_MV_STACK_SIZE);
}
#endif // CONFIG_REF_MV_BANK
int mi_width = AOMMIN(mi_size_wide[BLOCK_64X64], xd->n4_w);
mi_width = AOMMIN(mi_width, cm->mi_cols - mi_col);
int mi_height = AOMMIN(mi_size_high[BLOCK_64X64], xd->n4_h);
mi_height = AOMMIN(mi_height, cm->mi_rows - mi_row);
const int mi_size = AOMMIN(mi_width, mi_height);
if (rf[1] > NONE_FRAME) {
// TODO(jingning, yunqing): Refactor and consolidate the compound and
// single reference frame modes. Reduce unnecessary redundancy.
if (*refmv_count < MAX_MV_REF_CANDIDATES) {
int_mv ref_id[2][2], ref_diff[2][2];
int ref_id_count[2] = { 0 }, ref_diff_count[2] = { 0 };
for (int idx = 0; abs(max_row_offset) >= 1 && idx < mi_size;) {
const MB_MODE_INFO *const candidate = xd->mi[-xd->mi_stride + idx];
process_compound_ref_mv_candidate(
candidate, cm, rf, ref_id, ref_id_count, ref_diff, ref_diff_count);
idx += mi_size_wide[candidate->sb_type];
}
for (int idx = 0; abs(max_col_offset) >= 1 && idx < mi_size;) {
const MB_MODE_INFO *const candidate = xd->mi[idx * xd->mi_stride - 1];
process_compound_ref_mv_candidate(
candidate, cm, rf, ref_id, ref_id_count, ref_diff, ref_diff_count);
idx += mi_size_high[candidate->sb_type];
}
// Build up the compound mv predictor
int_mv comp_list[MAX_MV_REF_CANDIDATES][2];
for (int idx = 0; idx < 2; ++idx) {
int comp_idx = 0;
for (int list_idx = 0;
list_idx < ref_id_count[idx] && comp_idx < MAX_MV_REF_CANDIDATES;
++list_idx, ++comp_idx)
comp_list[comp_idx][idx] = ref_id[idx][list_idx];
for (int list_idx = 0;
list_idx < ref_diff_count[idx] && comp_idx < MAX_MV_REF_CANDIDATES;
++list_idx, ++comp_idx)
comp_list[comp_idx][idx] = ref_diff[idx][list_idx];
for (; comp_idx < MAX_MV_REF_CANDIDATES; ++comp_idx)
comp_list[comp_idx][idx] = gm_mv_candidates[idx];
}
if (*refmv_count) {
assert(*refmv_count == 1);
if (comp_list[0][0].as_int == ref_mv_stack[0].this_mv.as_int &&
comp_list[0][1].as_int == ref_mv_stack[0].comp_mv.as_int) {
ref_mv_stack[*refmv_count].this_mv = comp_list[1][0];
ref_mv_stack[*refmv_count].comp_mv = comp_list[1][1];
} else {
ref_mv_stack[*refmv_count].this_mv = comp_list[0][0];
ref_mv_stack[*refmv_count].comp_mv = comp_list[0][1];
}
ref_mv_weight[*refmv_count] = 2;
++*refmv_count;
} else {
for (int idx = 0; idx < MAX_MV_REF_CANDIDATES; ++idx) {
ref_mv_stack[*refmv_count].this_mv = comp_list[idx][0];
ref_mv_stack[*refmv_count].comp_mv = comp_list[idx][1];
ref_mv_weight[*refmv_count] = 2;
++*refmv_count;
}
}
}
assert(*refmv_count >= 2);
for (int idx = 0; idx < *refmv_count; ++idx) {
clamp_mv_ref(&ref_mv_stack[idx].this_mv.as_mv, xd->n4_w << MI_SIZE_LOG2,
xd->n4_h << MI_SIZE_LOG2, xd);
clamp_mv_ref(&ref_mv_stack[idx].comp_mv.as_mv, xd->n4_w << MI_SIZE_LOG2,
xd->n4_h << MI_SIZE_LOG2, xd);
}
} else {
// Handle single reference frame extension
for (int idx = 0; abs(max_row_offset) >= 1 && idx < mi_size &&
*refmv_count < MAX_MV_REF_CANDIDATES;) {
const MB_MODE_INFO *const candidate = xd->mi[-xd->mi_stride + idx];
process_single_ref_mv_candidate(candidate, cm, ref_frame, refmv_count,
ref_mv_stack, ref_mv_weight);
idx += mi_size_wide[candidate->sb_type];
}
for (int idx = 0; abs(max_col_offset) >= 1 && idx < mi_size &&
*refmv_count < MAX_MV_REF_CANDIDATES;) {
const MB_MODE_INFO *const candidate = xd->mi[idx * xd->mi_stride - 1];
process_single_ref_mv_candidate(candidate, cm, ref_frame, refmv_count,
ref_mv_stack, ref_mv_weight);
idx += mi_size_high[candidate->sb_type];
}
for (int idx = 0; idx < *refmv_count; ++idx) {
clamp_mv_ref(&ref_mv_stack[idx].this_mv.as_mv, xd->n4_w << MI_SIZE_LOG2,
xd->n4_h << MI_SIZE_LOG2, xd);
}
if (mv_ref_list != NULL) {
for (int idx = *refmv_count; idx < MAX_MV_REF_CANDIDATES; ++idx)
mv_ref_list[idx].as_int = gm_mv_candidates[0].as_int;
for (int idx = 0; idx < AOMMIN(MAX_MV_REF_CANDIDATES, *refmv_count);
++idx) {
mv_ref_list[idx].as_int = ref_mv_stack[idx].this_mv.as_int;
}
}
#if CONFIG_NEW_INTER_MODES
// If there is extra space in the stack, copy the GLOBALMV vector into it.
// This also guarantees the existence of at least one vector to search.
if (*refmv_count < MAX_REF_MV_STACK_SIZE) {
int stack_idx;
for (stack_idx = 0; stack_idx < *refmv_count; ++stack_idx) {
const int_mv stack_mv = ref_mv_stack[stack_idx].this_mv;
if (gm_mv_candidates[0].as_int == stack_mv.as_int) break;
}
if (stack_idx == *refmv_count) {
ref_mv_stack[*refmv_count].this_mv.as_int = gm_mv_candidates[0].as_int;
ref_mv_stack[*refmv_count].comp_mv.as_int = gm_mv_candidates[1].as_int;
ref_mv_weight[*refmv_count] = REF_CAT_LEVEL;
(*refmv_count)++;
}
}
#endif // CONFIG_NEW_INTER_MODES
}
}
#if CONFIG_REF_MV_BANK
static INLINE void update_ref_mv_bank(const MB_MODE_INFO *const mbmi,
REF_MV_BANK *ref_mv_bank) {
const MV_REFERENCE_FRAME ref_frame = av1_ref_frame_type(mbmi->ref_frame);
CANDIDATE_MV *queue = ref_mv_bank->rmb_queue_buffer[ref_frame];
const int is_comp = has_second_ref(mbmi);
const int start_idx = ref_mv_bank->rmb_queue_start_idx[ref_frame];
const int count = ref_mv_bank->rmb_queue_count[ref_frame];
int found = -1;
// Check if current MV is already existing in the buffer.
for (int i = 0; i < count; ++i) {
const int idx = (start_idx + i) % REF_MV_BANK_SIZE;
if (mbmi->mv[0].as_int == queue[idx].this_mv.as_int &&
(!is_comp || mbmi->mv[1].as_int == queue[idx].comp_mv.as_int)) {
found = i;
break;
}
}
// If current MV is found in the buffer, move it to the end of the buffer.
if (found >= 0) {
const int idx = (start_idx + found) % REF_MV_BANK_SIZE;
const CANDIDATE_MV cand = queue[idx];
for (int i = found; i < count - 1; ++i) {
const int idx0 = (start_idx + i) % REF_MV_BANK_SIZE;
const int idx1 = (start_idx + i + 1) % REF_MV_BANK_SIZE;
queue[idx0] = queue[idx1];
}
const int tail = (start_idx + count - 1) % REF_MV_BANK_SIZE;
queue[tail] = cand;
return;
}
// If current MV is not found in the buffer, append it to the end of the
// buffer, and update the count/start_idx accordingly.
const int idx = (start_idx + count) % REF_MV_BANK_SIZE;
queue[idx].this_mv = mbmi->mv[0];
if (is_comp) queue[idx].comp_mv = mbmi->mv[1];
if (count < REF_MV_BANK_SIZE) {
++ref_mv_bank->rmb_queue_count[ref_frame];
} else {
++ref_mv_bank->rmb_queue_start_idx[ref_frame];
}
}
void av1_update_ref_mv_bank(MACROBLOCKD *const xd,
const MB_MODE_INFO *const mbmi, int mib_size) {
update_ref_mv_bank(mbmi, &xd->ref_mv_bank_left);
const int sb_col = (xd->mi_col / mib_size);
update_ref_mv_bank(mbmi, &xd->ref_mv_bank_above[sb_col]);
}
#endif // CONFIG_REF_MV_BANK
void av1_find_mv_refs(const AV1_COMMON *cm, const MACROBLOCKD *xd,
MB_MODE_INFO *mi, MV_REFERENCE_FRAME ref_frame,
REF_MV_INFO *ref_mv_info,
int_mv mv_ref_list[][MAX_MV_REF_CANDIDATES],
int_mv *global_mvs, int16_t *mode_context) {
const int mi_row = xd->mi_row;
const int mi_col = xd->mi_col;
int_mv gm_mv[2];
const BLOCK_SIZE bsize = mi->sb_type;
if (ref_frame == INTRA_FRAME) {
gm_mv[0].as_int = gm_mv[1].as_int = 0;
if (global_mvs != NULL && ref_frame < REF_FRAMES) {
global_mvs[ref_frame].as_int = INVALID_MV;
}
} else {
if (ref_frame < REF_FRAMES) {
gm_mv[0] =
gm_get_motion_vector(&cm->global_motion[ref_frame],
cm->fr_mv_precision, bsize, mi_col, mi_row);
gm_mv[1].as_int = 0;
if (global_mvs != NULL) global_mvs[ref_frame] = gm_mv[0];
} else {
MV_REFERENCE_FRAME rf[2];
av1_set_ref_frame(rf, ref_frame);
gm_mv[0] =
gm_get_motion_vector(&cm->global_motion[rf[0]], cm->fr_mv_precision,
bsize, mi_col, mi_row);
gm_mv[1] =
gm_get_motion_vector(&cm->global_motion[rf[1]], cm->fr_mv_precision,
bsize, mi_col, mi_row);
}
}
setup_ref_mv_list(cm, xd, ref_frame, ref_mv_info,
mv_ref_list ? mv_ref_list[ref_frame] : NULL, gm_mv, mi_row,
mi_col, mode_context);
}
void av1_find_best_ref_mvs(MvSubpelPrecision precision, int_mv *mvlist,
int_mv *nearest_mv, int_mv *near_mv) {
// Make sure all the candidates are properly clamped etc
for (int i = 0; i < MAX_MV_REF_CANDIDATES; ++i) {
lower_mv_precision(&mvlist[i].as_mv, precision);
}
*nearest_mv = mvlist[0];
*near_mv = mvlist[1];
}
void av1_setup_frame_buf_refs(AV1_COMMON *cm) {
cm->cur_frame->order_hint = cm->current_frame.order_hint;
cm->cur_frame->display_order_hint = cm->current_frame.display_order_hint;
MV_REFERENCE_FRAME ref_frame;
for (ref_frame = LAST_FRAME; ref_frame <= ALTREF_FRAME; ++ref_frame) {
const RefCntBuffer *const buf = get_ref_frame_buf(cm, ref_frame);
if (buf != NULL) {
cm->cur_frame->ref_order_hints[ref_frame - LAST_FRAME] = buf->order_hint;
cm->cur_frame->ref_display_order_hint[ref_frame - LAST_FRAME] =
buf->display_order_hint;
}
}
}
void av1_setup_frame_sign_bias(AV1_COMMON *cm) {
MV_REFERENCE_FRAME ref_frame;
for (ref_frame = LAST_FRAME; ref_frame <= ALTREF_FRAME; ++ref_frame) {
const RefCntBuffer *const buf = get_ref_frame_buf(cm, ref_frame);
if (cm->seq_params.order_hint_info.enable_order_hint && buf != NULL) {
const int ref_order_hint = buf->order_hint;
cm->ref_frame_sign_bias[ref_frame] =
(get_relative_dist(&cm->seq_params.order_hint_info, ref_order_hint,
(int)cm->current_frame.order_hint) <= 0)
? 0
: 1;
} else {
cm->ref_frame_sign_bias[ref_frame] = 0;
}
}
}
#define MAX_OFFSET_WIDTH 64
#define MAX_OFFSET_HEIGHT 0
static int get_block_position(AV1_COMMON *cm, int *mi_r, int *mi_c, int blk_row,
int blk_col, MV mv, int sign_bias) {
const int base_blk_row = (blk_row >> 3) << 3;
const int base_blk_col = (blk_col >> 3) << 3;
const int row_offset = (mv.row >= 0) ? (mv.row >> (4 + MI_SIZE_LOG2))
: -((-mv.row) >> (4 + MI_SIZE_LOG2));
const int col_offset = (mv.col >= 0) ? (mv.col >> (4 + MI_SIZE_LOG2))
: -((-mv.col) >> (4 + MI_SIZE_LOG2));
const int row =
(sign_bias == 1) ? blk_row - row_offset : blk_row + row_offset;
const int col =
(sign_bias == 1) ? blk_col - col_offset : blk_col + col_offset;
if (row < 0 || row >= (cm->mi_rows >> 1) || col < 0 ||
col >= (cm->mi_cols >> 1))
return 0;
if (row < base_blk_row - (MAX_OFFSET_HEIGHT >> 3) ||
row >= base_blk_row + 8 + (MAX_OFFSET_HEIGHT >> 3) ||
col < base_blk_col - (MAX_OFFSET_WIDTH >> 3) ||
col >= base_blk_col + 8 + (MAX_OFFSET_WIDTH >> 3))
return 0;
*mi_r = row;
*mi_c = col;
return 1;
}
// Note: motion_filed_projection finds motion vectors of current frame's
// reference frame, and projects them to current frame. To make it clear,
// let's call current frame's reference frame as start frame.
// Call Start frame's reference frames as reference frames.
// Call ref_offset as frame distances between start frame and its reference
// frames.
static int motion_field_projection(AV1_COMMON *cm,
MV_REFERENCE_FRAME start_frame, int dir) {
TPL_MV_REF *tpl_mvs_base = cm->tpl_mvs;
int ref_offset[REF_FRAMES] = { 0 };
const RefCntBuffer *const start_frame_buf =
get_ref_frame_buf(cm, start_frame);
if (start_frame_buf == NULL) return 0;
if (start_frame_buf->frame_type == KEY_FRAME ||
start_frame_buf->frame_type == INTRA_ONLY_FRAME)
return 0;
if (start_frame_buf->mi_rows != cm->mi_rows ||
start_frame_buf->mi_cols != cm->mi_cols)
return 0;
const int start_frame_order_hint = start_frame_buf->order_hint;
const unsigned int *const ref_order_hints =
&start_frame_buf->ref_order_hints[0];
const int cur_order_hint = cm->cur_frame->order_hint;
int start_to_current_frame_offset = get_relative_dist(
&cm->seq_params.order_hint_info, start_frame_order_hint, cur_order_hint);
for (MV_REFERENCE_FRAME rf = LAST_FRAME; rf <= INTER_REFS_PER_FRAME; ++rf) {
ref_offset[rf] = get_relative_dist(&cm->seq_params.order_hint_info,
start_frame_order_hint,
ref_order_hints[rf - LAST_FRAME]);
}
if (dir == 2) start_to_current_frame_offset = -start_to_current_frame_offset;
MV_REF *mv_ref_base = start_frame_buf->mvs;
const int mvs_rows = (cm->mi_rows + 1) >> 1;
const int mvs_cols = (cm->mi_cols + 1) >> 1;
for (int blk_row = 0; blk_row < mvs_rows; ++blk_row) {
for (int blk_col = 0; blk_col < mvs_cols; ++blk_col) {
MV_REF *mv_ref = &mv_ref_base[blk_row * mvs_cols + blk_col];
MV fwd_mv = mv_ref->mv.as_mv;
if (mv_ref->ref_frame > INTRA_FRAME) {
int_mv this_mv;
int mi_r, mi_c;
const int ref_frame_offset = ref_offset[mv_ref->ref_frame];
int pos_valid =
abs(ref_frame_offset) <= MAX_FRAME_DISTANCE &&
ref_frame_offset > 0 &&
abs(start_to_current_frame_offset) <= MAX_FRAME_DISTANCE;
if (pos_valid) {
get_mv_projection(&this_mv.as_mv, fwd_mv,
start_to_current_frame_offset, ref_frame_offset);
pos_valid = get_block_position(cm, &mi_r, &mi_c, blk_row, blk_col,
this_mv.as_mv, dir >> 1);
}
if (pos_valid) {
const int mi_offset = mi_r * (cm->mi_stride >> 1) + mi_c;
tpl_mvs_base[mi_offset].mfmv0.as_mv.row = fwd_mv.row;
tpl_mvs_base[mi_offset].mfmv0.as_mv.col = fwd_mv.col;
tpl_mvs_base[mi_offset].ref_frame_offset = ref_frame_offset;
}
}
}
}
return 1;
}
void av1_setup_motion_field(AV1_COMMON *cm) {
const OrderHintInfo *const order_hint_info = &cm->seq_params.order_hint_info;
memset(cm->ref_frame_side, 0, sizeof(cm->ref_frame_side));
if (!order_hint_info->enable_order_hint) return;
TPL_MV_REF *tpl_mvs_base = cm->tpl_mvs;
int size = ((cm->mi_rows + MAX_MIB_SIZE) >> 1) * (cm->mi_stride >> 1);
for (int idx = 0; idx < size; ++idx) {
tpl_mvs_base[idx].mfmv0.as_int = INVALID_MV;
tpl_mvs_base[idx].ref_frame_offset = 0;
}
const int cur_order_hint = cm->cur_frame->order_hint;
const RefCntBuffer *ref_buf[INTER_REFS_PER_FRAME];
int ref_order_hint[INTER_REFS_PER_FRAME];
for (int ref_frame = LAST_FRAME; ref_frame <= ALTREF_FRAME; ref_frame++) {
const int ref_idx = ref_frame - LAST_FRAME;
const RefCntBuffer *const buf = get_ref_frame_buf(cm, ref_frame);
int order_hint = 0;
if (buf != NULL) order_hint = buf->order_hint;
ref_buf[ref_idx] = buf;
ref_order_hint[ref_idx] = order_hint;
if (get_relative_dist(order_hint_info, order_hint, cur_order_hint) > 0)
cm->ref_frame_side[ref_frame] = 1;
else if (order_hint == cur_order_hint)
cm->ref_frame_side[ref_frame] = -1;
}
int ref_stamp = MFMV_STACK_SIZE - 1;
if (ref_buf[LAST_FRAME - LAST_FRAME] != NULL) {
const int alt_of_lst_order_hint =
ref_buf[LAST_FRAME - LAST_FRAME]
->ref_order_hints[ALTREF_FRAME - LAST_FRAME];
const int is_lst_overlay =
(alt_of_lst_order_hint == ref_order_hint[GOLDEN_FRAME - LAST_FRAME]);
if (!is_lst_overlay) motion_field_projection(cm, LAST_FRAME, 2);
--ref_stamp;
}
if (get_relative_dist(order_hint_info,
ref_order_hint[BWDREF_FRAME - LAST_FRAME],
cur_order_hint) > 0) {
if (motion_field_projection(cm, BWDREF_FRAME, 0)) --ref_stamp;
}
if (get_relative_dist(order_hint_info,
ref_order_hint[ALTREF2_FRAME - LAST_FRAME],
cur_order_hint) > 0) {
if (motion_field_projection(cm, ALTREF2_FRAME, 0)) --ref_stamp;
}
if (get_relative_dist(order_hint_info,
ref_order_hint[ALTREF_FRAME - LAST_FRAME],
cur_order_hint) > 0 &&
ref_stamp >= 0)
if (motion_field_projection(cm, ALTREF_FRAME, 0)) --ref_stamp;
if (ref_stamp >= 0) motion_field_projection(cm, LAST2_FRAME, 2);
}
static INLINE void record_samples(const MB_MODE_INFO *mbmi,
#if CONFIG_ENHANCED_WARPED_MOTION
int ref,
#endif // CONFIG_ENHANCED_WARPED_MOTION
int *pts, int *pts_inref, int row_offset,
int sign_r, int col_offset, int sign_c) {
int bw = block_size_wide[mbmi->sb_type];
int bh = block_size_high[mbmi->sb_type];
int x = col_offset * MI_SIZE + sign_c * AOMMAX(bw, MI_SIZE) / 2 - 1;
int y = row_offset * MI_SIZE + sign_r * AOMMAX(bh, MI_SIZE) / 2 - 1;
pts[0] = (x * 8);
pts[1] = (y * 8);
#if !CONFIG_ENHANCED_WARPED_MOTION
const int ref = 0;
#endif // CONFIG_ENHANCED_WARPED_MOTION
#if CONFIG_DERIVED_MV
if (mbmi->derived_mv_allowed && mbmi->use_derived_mv) {
pts_inref[0] = (x * 8) + mbmi->derived_mv[ref].col;
pts_inref[1] = (y * 8) + mbmi->derived_mv[ref].row;
} else {
pts_inref[0] = (x * 8) + mbmi->mv[ref].as_mv.col;
pts_inref[1] = (y * 8) + mbmi->mv[ref].as_mv.row;
}
#else
pts_inref[0] = (x * 8) + mbmi->mv[ref].as_mv.col;
pts_inref[1] = (y * 8) + mbmi->mv[ref].as_mv.row;
#endif // CONFIG_DERIVED_MV && CONFIG_DERIVED_MV_NOPD
}
// Select samples according to the motion vector difference.
uint8_t av1_selectSamples(MV *mv, int *pts, int *pts_inref, int len,
BLOCK_SIZE bsize) {
const int bw = block_size_wide[bsize];
const int bh = block_size_high[bsize];
const int thresh = clamp(AOMMAX(bw, bh), 16, 112);
int pts_mvd[SAMPLES_ARRAY_SIZE] = { 0 };
int i, j, k, l = len;
uint8_t ret = 0;
assert(len <= LEAST_SQUARES_SAMPLES_MAX);
// Obtain the motion vector difference.
for (i = 0; i < len; ++i) {
pts_mvd[i] = abs(pts_inref[2 * i] - pts[2 * i] - mv->col) +
abs(pts_inref[2 * i + 1] - pts[2 * i + 1] - mv->row);
if (pts_mvd[i] > thresh)
pts_mvd[i] = -1;
else
ret++;
}
// Keep at least 1 sample.
if (!ret) return 1;
i = 0;
j = l - 1;
for (k = 0; k < l - ret; k++) {
while (pts_mvd[i] != -1) i++;
while (pts_mvd[j] == -1) j--;
assert(i != j);
if (i > j) break;
// Replace the discarded samples;
pts_mvd[i] = pts_mvd[j];
pts[2 * i] = pts[2 * j];
pts[2 * i + 1] = pts[2 * j + 1];
pts_inref[2 * i] = pts_inref[2 * j];
pts_inref[2 * i + 1] = pts_inref[2 * j + 1];
i++;
j--;
}
return ret;
}
// Note: Samples returned are at 1/8-pel precision
// Sample are the neighbor block center point's coordinates relative to the
// left-top pixel of current block.
uint8_t av1_findSamples(const AV1_COMMON *cm, MACROBLOCKD *xd,
#if CONFIG_ENHANCED_WARPED_MOTION
const REF_MV_INFO *ref_mv_info,
#endif // CONFIG_ENHANCED_WARPED_MOTION
int *pts, int *pts_inref) {
const MB_MODE_INFO *const mbmi0 = xd->mi[0];
#if CONFIG_ENHANCED_WARPED_MOTION
const MV_REFERENCE_FRAME ref_frame_type =
av1_ref_frame_type(mbmi0->ref_frame);
const uint8_t n = AOMMIN(LEAST_SQUARES_SAMPLES_MAX,
ref_mv_info->ref_mv_location_count[ref_frame_type]);
const LOCATION_INFO *location_stack =
ref_mv_info->ref_mv_location_stack[ref_frame_type];
for (int i = 0; i < n; ++i) {
pts[0] = location_stack[i].x;
pts[1] = location_stack[i].y;
pts_inref[0] = pts[0] + location_stack[i].this_mv.as_mv.col;
pts_inref[1] = pts[1] + location_stack[i].this_mv.as_mv.row;
pts += 2;
pts_inref += 2;
}
return n;
#endif // CONFIG_ENHANCED_WARPED_MOTION
const int ref_frame = mbmi0->ref_frame[0];
const int up_available = xd->up_available;
const int left_available = xd->left_available;
int i, mi_step;
uint8_t np = 0;
int do_tl = 1;
int do_tr = 1;
const int mi_stride = xd->mi_stride;
const int mi_row = xd->mi_row;
const int mi_col = xd->mi_col;
// scan the nearest above rows
if (up_available) {
const int mi_row_offset = -1;
const MB_MODE_INFO *mbmi = xd->mi[mi_row_offset * mi_stride];
uint8_t n4_w = mi_size_wide[mbmi->sb_type];
if (xd->n4_w <= n4_w) {
// Handle "current block width <= above block width" case.
const int col_offset = -mi_col % n4_w;
if (col_offset < 0) do_tl = 0;
if (col_offset + n4_w > xd->n4_w) do_tr = 0;
#if CONFIG_ENHANCED_WARPED_MOTION
for (int ref = 0; ref < 1 + has_second_ref(mbmi); ++ref) {
if (mbmi->ref_frame[ref] == ref_frame) {
record_samples(mbmi, ref, pts, pts_inref, 0, -1, col_offset, 1);
pts += 2;
pts_inref += 2;
if (++np >= LEAST_SQUARES_SAMPLES_MAX) {
return LEAST_SQUARES_SAMPLES_MAX;
}
}
}
#else
if (mbmi->ref_frame[0] == ref_frame && mbmi->ref_frame[1] == NONE_FRAME) {
record_samples(mbmi, pts, pts_inref, 0, -1, col_offset, 1);
pts += 2;
pts_inref += 2;
if (++np >= LEAST_SQUARES_SAMPLES_MAX) return LEAST_SQUARES_SAMPLES_MAX;
}
#endif // CONFIG_ENHANCED_WARPED_MOTION
} else {
// Handle "current block width > above block width" case.
for (i = 0; i < AOMMIN(xd->n4_w, cm->mi_cols - mi_col); i += mi_step) {
mbmi = xd->mi[i + mi_row_offset * mi_stride];
n4_w = mi_size_wide[mbmi->sb_type];
mi_step = AOMMIN(xd->n4_w, n4_w);
#if CONFIG_ENHANCED_WARPED_MOTION
for (int ref = 0; ref < 1 + has_second_ref(mbmi); ++ref) {
if (mbmi->ref_frame[ref] == ref_frame) {
record_samples(mbmi, ref, pts, pts_inref, 0, -1, i, 1);
pts += 2;
pts_inref += 2;
if (++np >= LEAST_SQUARES_SAMPLES_MAX)
return LEAST_SQUARES_SAMPLES_MAX;
}
}
#else
if (mbmi->ref_frame[0] == ref_frame &&
mbmi->ref_frame[1] == NONE_FRAME) {
record_samples(mbmi, pts, pts_inref, 0, -1, i, 1);
pts += 2;
pts_inref += 2;
if (++np >= LEAST_SQUARES_SAMPLES_MAX) {
return LEAST_SQUARES_SAMPLES_MAX;
}
}
#endif // CONFIG_ENHANCED_WARPED_MOTION
}
}
}
assert(np <= LEAST_SQUARES_SAMPLES_MAX);
// scan the nearest left columns
if (left_available) {
const int mi_col_offset = -1;
const MB_MODE_INFO *mbmi = xd->mi[mi_col_offset];
uint8_t n4_h = mi_size_high[mbmi->sb_type];
if (xd->n4_h <= n4_h) {
// Handle "current block height <= above block height" case.
const int row_offset = -mi_row % n4_h;
if (row_offset < 0) do_tl = 0;
#if CONFIG_ENHANCED_WARPED_MOTION
for (int ref = 0; ref < 1 + has_second_ref(mbmi); ++ref) {
if (mbmi->ref_frame[ref] == ref_frame) {
record_samples(mbmi, ref, pts, pts_inref, row_offset, 1, 0, -1);
pts += 2;
pts_inref += 2;
if (++np >= LEAST_SQUARES_SAMPLES_MAX) {
return LEAST_SQUARES_SAMPLES_MAX;
}
}
}
#else
if (mbmi->ref_frame[0] == ref_frame && mbmi->ref_frame[1] == NONE_FRAME) {
record_samples(mbmi, pts, pts_inref, row_offset, 1, 0, -1);
pts += 2;
pts_inref += 2;
if (++np >= LEAST_SQUARES_SAMPLES_MAX) return LEAST_SQUARES_SAMPLES_MAX;
}
#endif // CONFIG_ENHANCED_WARPED_MOTION
} else {
// Handle "current block height > above block height" case.
for (i = 0; i < AOMMIN(xd->n4_h, cm->mi_rows - mi_row); i += mi_step) {
mbmi = xd->mi[mi_col_offset + i * mi_stride];
n4_h = mi_size_high[mbmi->sb_type];
mi_step = AOMMIN(xd->n4_h, n4_h);
#if CONFIG_ENHANCED_WARPED_MOTION
for (int ref = 0; ref < 1 + has_second_ref(mbmi); ++ref) {
if (mbmi->ref_frame[ref] == ref_frame) {
record_samples(mbmi, ref, pts, pts_inref, i, 1, 0, -1);
pts += 2;
pts_inref += 2;
if (++np >= LEAST_SQUARES_SAMPLES_MAX) {
return LEAST_SQUARES_SAMPLES_MAX;
}
}
}
#else
if (mbmi->ref_frame[0] == ref_frame &&
mbmi->ref_frame[1] == NONE_FRAME) {
record_samples(mbmi, pts, pts_inref, i, 1, 0, -1);
pts += 2;
pts_inref += 2;
if (++np >= LEAST_SQUARES_SAMPLES_MAX) {
return LEAST_SQUARES_SAMPLES_MAX;
}
}
#endif // CONFIG_ENHANCED_WARPED_MOTION
}
}
}
assert(np <= LEAST_SQUARES_SAMPLES_MAX);
// Top-left block
if (do_tl && left_available && up_available) {
const int mi_row_offset = -1;
const int mi_col_offset = -1;
MB_MODE_INFO *mbmi = xd->mi[mi_col_offset + mi_row_offset * mi_stride];
#if CONFIG_ENHANCED_WARPED_MOTION
for (int ref = 0; ref < 1 + has_second_ref(mbmi); ++ref) {
if (mbmi->ref_frame[ref] == ref_frame) {
record_samples(mbmi, ref, pts, pts_inref, 0, -1, 0, -1);
pts += 2;
pts_inref += 2;
if (++np >= LEAST_SQUARES_SAMPLES_MAX) return LEAST_SQUARES_SAMPLES_MAX;
}
}
#else
if (mbmi->ref_frame[0] == ref_frame && mbmi->ref_frame[1] == NONE_FRAME) {
record_samples(mbmi, pts, pts_inref, 0, -1, 0, -1);
pts += 2;
pts_inref += 2;
if (++np >= LEAST_SQUARES_SAMPLES_MAX) return LEAST_SQUARES_SAMPLES_MAX;
}
#endif // CONFIG_ENHANCED_WARPED_MOTION
}
assert(np <= LEAST_SQUARES_SAMPLES_MAX);
// Top-right block
if (do_tr &&
has_top_right(cm, xd, mi_row, mi_col, AOMMAX(xd->n4_w, xd->n4_h))) {
const POSITION trb_pos = { -1, xd->n4_w };
const TileInfo *const tile = &xd->tile;
if (is_inside(tile, mi_col, mi_row, &trb_pos)) {
const int mi_row_offset = -1;
const int mi_col_offset = xd->n4_w;
const MB_MODE_INFO *mbmi =
xd->mi[mi_col_offset + mi_row_offset * mi_stride];
#if CONFIG_ENHANCED_WARPED_MOTION
for (int ref = 0; ref < 1 + has_second_ref(mbmi); ++ref) {
if (mbmi->ref_frame[ref] == ref_frame) {
record_samples(mbmi, ref, pts, pts_inref, 0, -1, xd->n4_w, 1);
pts += 2;
pts_inref += 2;
if (++np >= LEAST_SQUARES_SAMPLES_MAX) {
return LEAST_SQUARES_SAMPLES_MAX;
}
}
}
#else
if (mbmi->ref_frame[0] == ref_frame && mbmi->ref_frame[1] == NONE_FRAME) {
record_samples(mbmi, pts, pts_inref, 0, -1, xd->n4_w, 1);
if (++np >= LEAST_SQUARES_SAMPLES_MAX) return LEAST_SQUARES_SAMPLES_MAX;
}
#endif // CONFIG_ENHANCED_WARPED_MOTION
}
}
assert(np <= LEAST_SQUARES_SAMPLES_MAX);
return np;
}
void av1_setup_skip_mode_allowed(AV1_COMMON *cm) {
const OrderHintInfo *const order_hint_info = &cm->seq_params.order_hint_info;
SkipModeInfo *const skip_mode_info = &cm->current_frame.skip_mode_info;
skip_mode_info->skip_mode_allowed = 0;
skip_mode_info->ref_frame_idx_0 = INVALID_IDX;
skip_mode_info->ref_frame_idx_1 = INVALID_IDX;
if (!order_hint_info->enable_order_hint || frame_is_intra_only(cm) ||
cm->current_frame.reference_mode == SINGLE_REFERENCE)
return;
const int cur_order_hint = cm->current_frame.order_hint;
int ref_order_hints[2] = { -1, INT_MAX };
int ref_idx[2] = { INVALID_IDX, INVALID_IDX };
// Identify the nearest forward and backward references.
for (int i = 0; i < INTER_REFS_PER_FRAME; ++i) {
const RefCntBuffer *const buf = get_ref_frame_buf(cm, LAST_FRAME + i);
if (buf == NULL) continue;
const int ref_order_hint = buf->order_hint;
if (get_relative_dist(order_hint_info, ref_order_hint, cur_order_hint) <
0) {
// Forward reference
if (ref_order_hints[0] == -1 ||
get_relative_dist(order_hint_info, ref_order_hint,
ref_order_hints[0]) > 0) {
ref_order_hints[0] = ref_order_hint;
ref_idx[0] = i;
}
} else if (get_relative_dist(order_hint_info, ref_order_hint,
cur_order_hint) > 0) {
// Backward reference
if (ref_order_hints[1] == INT_MAX ||
get_relative_dist(order_hint_info, ref_order_hint,
ref_order_hints[1]) < 0) {
ref_order_hints[1] = ref_order_hint;
ref_idx[1] = i;
}
}
}
if (ref_idx[0] != INVALID_IDX && ref_idx[1] != INVALID_IDX) {
// == Bi-directional prediction ==
skip_mode_info->skip_mode_allowed = 1;
skip_mode_info->ref_frame_idx_0 = AOMMIN(ref_idx[0], ref_idx[1]);
skip_mode_info->ref_frame_idx_1 = AOMMAX(ref_idx[0], ref_idx[1]);
} else if (ref_idx[0] != INVALID_IDX && ref_idx[1] == INVALID_IDX) {
// == Forward prediction only ==
// Identify the second nearest forward reference.
ref_order_hints[1] = -1;
for (int i = 0; i < INTER_REFS_PER_FRAME; ++i) {
const RefCntBuffer *const buf = get_ref_frame_buf(cm, LAST_FRAME + i);
if (buf == NULL) continue;
const int ref_order_hint = buf->order_hint;
if ((ref_order_hints[0] != -1 &&
get_relative_dist(order_hint_info, ref_order_hint,
ref_order_hints[0]) < 0) &&
(ref_order_hints[1] == -1 ||
get_relative_dist(order_hint_info, ref_order_hint,
ref_order_hints[1]) > 0)) {
// Second closest forward reference
ref_order_hints[1] = ref_order_hint;
ref_idx[1] = i;
}
}
if (ref_order_hints[1] != -1) {
skip_mode_info->skip_mode_allowed = 1;
skip_mode_info->ref_frame_idx_0 = AOMMIN(ref_idx[0], ref_idx[1]);
skip_mode_info->ref_frame_idx_1 = AOMMAX(ref_idx[0], ref_idx[1]);
}
}
}
typedef struct {
int map_idx; // frame map index
RefCntBuffer *buf; // frame buffer
int sort_idx; // index based on the offset to be used for sorting
} REF_FRAME_INFO;
// Compares the sort_idx fields. If they are equal, then compares the map_idx
// fields to break the tie. This ensures a stable sort.
static int compare_ref_frame_info(const void *arg_a, const void *arg_b) {
const REF_FRAME_INFO *info_a = (REF_FRAME_INFO *)arg_a;
const REF_FRAME_INFO *info_b = (REF_FRAME_INFO *)arg_b;
const int sort_idx_diff = info_a->sort_idx - info_b->sort_idx;
if (sort_idx_diff != 0) return sort_idx_diff;
return info_a->map_idx - info_b->map_idx;
}
static void set_ref_frame_info(int *remapped_ref_idx, int frame_idx,
REF_FRAME_INFO *ref_info) {
assert(frame_idx >= 0 && frame_idx < INTER_REFS_PER_FRAME);
remapped_ref_idx[frame_idx] = ref_info->map_idx;
}
void av1_set_frame_refs(AV1_COMMON *const cm, int *remapped_ref_idx,
int lst_map_idx, int gld_map_idx) {
int lst_frame_sort_idx = -1;
int gld_frame_sort_idx = -1;
assert(cm->seq_params.order_hint_info.enable_order_hint);
assert(cm->seq_params.order_hint_info.order_hint_bits_minus_1 >= 0);
const int cur_order_hint = (int)cm->current_frame.order_hint;
const int cur_frame_sort_idx =
1 << cm->seq_params.order_hint_info.order_hint_bits_minus_1;
REF_FRAME_INFO ref_frame_info[REF_FRAMES];
int ref_flag_list[INTER_REFS_PER_FRAME] = { 0, 0, 0, 0, 0, 0, 0 };
for (int i = 0; i < REF_FRAMES; ++i) {
const int map_idx = i;
ref_frame_info[i].map_idx = map_idx;
ref_frame_info[i].sort_idx = -1;
RefCntBuffer *const buf = cm->ref_frame_map[map_idx];
ref_frame_info[i].buf = buf;
if (buf == NULL) continue;
// If this assertion fails, there is a reference leak.
assert(buf->ref_count > 0);
const int offset = (int)buf->order_hint;
ref_frame_info[i].sort_idx =
(offset == -1) ? -1
: cur_frame_sort_idx +
get_relative_dist(&cm->seq_params.order_hint_info,
offset, cur_order_hint);
assert(ref_frame_info[i].sort_idx >= -1);
if (map_idx == lst_map_idx) lst_frame_sort_idx = ref_frame_info[i].sort_idx;
if (map_idx == gld_map_idx) gld_frame_sort_idx = ref_frame_info[i].sort_idx;
}
// Confirm both LAST_FRAME and GOLDEN_FRAME are valid forward reference
// frames.
if (lst_frame_sort_idx == -1 || lst_frame_sort_idx >= cur_frame_sort_idx) {
aom_internal_error(&cm->error, AOM_CODEC_CORRUPT_FRAME,
"Inter frame requests a look-ahead frame as LAST");
}
if (gld_frame_sort_idx == -1 || gld_frame_sort_idx >= cur_frame_sort_idx) {
aom_internal_error(&cm->error, AOM_CODEC_CORRUPT_FRAME,
"Inter frame requests a look-ahead frame as GOLDEN");
}
// Sort ref frames based on their frame_offset values.
qsort(ref_frame_info, REF_FRAMES, sizeof(REF_FRAME_INFO),
compare_ref_frame_info);
// Identify forward and backward reference frames.
// Forward reference: offset < order_hint
// Backward reference: offset >= order_hint
int fwd_start_idx = 0, fwd_end_idx = REF_FRAMES - 1;
for (int i = 0; i < REF_FRAMES; i++) {
if (ref_frame_info[i].sort_idx == -1) {
fwd_start_idx++;
continue;
}
if (ref_frame_info[i].sort_idx >= cur_frame_sort_idx) {
fwd_end_idx = i - 1;
break;
}
}
int bwd_start_idx = fwd_end_idx + 1;
int bwd_end_idx = REF_FRAMES - 1;
// === Backward Reference Frames ===
// == ALTREF_FRAME ==
if (bwd_start_idx <= bwd_end_idx) {
set_ref_frame_info(remapped_ref_idx, ALTREF_FRAME - LAST_FRAME,
&ref_frame_info[bwd_end_idx]);
ref_flag_list[ALTREF_FRAME - LAST_FRAME] = 1;
bwd_end_idx--;
}
// == BWDREF_FRAME ==
if (bwd_start_idx <= bwd_end_idx) {
set_ref_frame_info(remapped_ref_idx, BWDREF_FRAME - LAST_FRAME,
&ref_frame_info[bwd_start_idx]);
ref_flag_list[BWDREF_FRAME - LAST_FRAME] = 1;
bwd_start_idx++;
}
// == ALTREF2_FRAME ==
if (bwd_start_idx <= bwd_end_idx) {
set_ref_frame_info(remapped_ref_idx, ALTREF2_FRAME - LAST_FRAME,
&ref_frame_info[bwd_start_idx]);
ref_flag_list[ALTREF2_FRAME - LAST_FRAME] = 1;
}
// === Forward Reference Frames ===
for (int i = fwd_start_idx; i <= fwd_end_idx; ++i) {
// == LAST_FRAME ==
if (ref_frame_info[i].map_idx == lst_map_idx) {
set_ref_frame_info(remapped_ref_idx, LAST_FRAME - LAST_FRAME,
&ref_frame_info[i]);
ref_flag_list[LAST_FRAME - LAST_FRAME] = 1;
}
// == GOLDEN_FRAME ==
if (ref_frame_info[i].map_idx == gld_map_idx) {
set_ref_frame_info(remapped_ref_idx, GOLDEN_FRAME - LAST_FRAME,
&ref_frame_info[i]);
ref_flag_list[GOLDEN_FRAME - LAST_FRAME] = 1;
}
}
assert(ref_flag_list[LAST_FRAME - LAST_FRAME] == 1 &&
ref_flag_list[GOLDEN_FRAME - LAST_FRAME] == 1);
// == LAST2_FRAME ==
// == LAST3_FRAME ==
// == BWDREF_FRAME ==
// == ALTREF2_FRAME ==
// == ALTREF_FRAME ==
// Set up the reference frames in the anti-chronological order.
static const MV_REFERENCE_FRAME ref_frame_list[INTER_REFS_PER_FRAME - 2] = {
LAST2_FRAME, LAST3_FRAME, BWDREF_FRAME, ALTREF2_FRAME, ALTREF_FRAME
};
int ref_idx;
for (ref_idx = 0; ref_idx < (INTER_REFS_PER_FRAME - 2); ref_idx++) {
const MV_REFERENCE_FRAME ref_frame = ref_frame_list[ref_idx];
if (ref_flag_list[ref_frame - LAST_FRAME] == 1) continue;
while (fwd_start_idx <= fwd_end_idx &&
(ref_frame_info[fwd_end_idx].map_idx == lst_map_idx ||
ref_frame_info[fwd_end_idx].map_idx == gld_map_idx)) {
fwd_end_idx--;
}
if (fwd_start_idx > fwd_end_idx) break;
set_ref_frame_info(remapped_ref_idx, ref_frame - LAST_FRAME,
&ref_frame_info[fwd_end_idx]);
ref_flag_list[ref_frame - LAST_FRAME] = 1;
fwd_end_idx--;
}
// Assign all the remaining frame(s), if any, to the earliest reference
// frame.
for (; ref_idx < (INTER_REFS_PER_FRAME - 2); ref_idx++) {
const MV_REFERENCE_FRAME ref_frame = ref_frame_list[ref_idx];
if (ref_flag_list[ref_frame - LAST_FRAME] == 1) continue;
set_ref_frame_info(remapped_ref_idx, ref_frame - LAST_FRAME,
&ref_frame_info[fwd_start_idx]);
ref_flag_list[ref_frame - LAST_FRAME] = 1;
}
for (int i = 0; i < INTER_REFS_PER_FRAME; i++) {
assert(ref_flag_list[i] == 1);
}
}
#if CONFIG_FLEX_MVRES
#if ADJUST_DRL_FLEX_MVRES
void av1_get_mv_refs_adj(REF_MV_INFO *ref_mv_info, int ref_frame,
int is_compound, MvSubpelPrecision precision) {
CANDIDATE_MV *ref_mv_stack_orig = ref_mv_info->ref_mv_stack[ref_frame];
uint16_t *weight_orig = ref_mv_info->ref_mv_weight[ref_frame];
const uint8_t ref_mv_count_orig = ref_mv_info->ref_mv_count[ref_frame];
CANDIDATE_MV *ref_mv_stack_adj = ref_mv_info->ref_mv_stack_adj;
uint16_t *ref_mv_weight_adj = ref_mv_info->ref_mv_weight_adj;
uint8_t *ref_mv_count_adj = &ref_mv_info->ref_mv_count_adj;
*ref_mv_count_adj = 0;
for (int i = 0; i < ref_mv_count_orig; ++i) {
ref_mv_stack_adj[*ref_mv_count_adj] = ref_mv_stack_orig[i];
lower_mv_precision(&ref_mv_stack_adj[*ref_mv_count_adj].this_mv.as_mv,
precision);
if (is_compound) {
lower_mv_precision(&ref_mv_stack_adj[*ref_mv_count_adj].comp_mv.as_mv,
precision);
}
ref_mv_weight_adj[*ref_mv_count_adj] = weight_orig[i];
int k;
if (is_compound) {
for (k = 0; k < *ref_mv_count_adj; ++k) {
if (ref_mv_stack_adj[*ref_mv_count_adj].this_mv.as_int ==
ref_mv_stack_adj[k].this_mv.as_int &&
ref_mv_stack_adj[*ref_mv_count_adj].comp_mv.as_int ==
ref_mv_stack_adj[k].comp_mv.as_int)
break;
}
} else {
for (k = 0; k < *ref_mv_count_adj; ++k) {
if (ref_mv_stack_adj[*ref_mv_count_adj].this_mv.as_int ==
ref_mv_stack_adj[k].this_mv.as_int)
break;
}
}
if (k == *ref_mv_count_adj) {
++(*ref_mv_count_adj);
} else {
ref_mv_weight_adj[k] += ref_mv_weight_adj[*ref_mv_count_adj];
}
}
}
int av1_get_ref_mv_idx_adj(REF_MV_INFO *ref_mv_info, int ref_frame,
int is_compound, MvSubpelPrecision precision,
int ref_mv_idx_orig) {
CANDIDATE_MV *ref_mv_stack_orig = ref_mv_info->ref_mv_stack[ref_frame];
const uint8_t ref_mv_count_orig = ref_mv_info->ref_mv_count[ref_frame];
CANDIDATE_MV *ref_mv_stack_adj = ref_mv_info->ref_mv_stack_adj;
const uint8_t ref_mv_count_adj = ref_mv_info->ref_mv_count_adj;
assert(IMPLIES(ref_mv_count_orig > 0, ref_mv_idx_orig < ref_mv_count_orig));
if (ref_mv_count_orig == 0) return 0;
CANDIDATE_MV ref_mv = ref_mv_stack_orig[ref_mv_idx_orig];
lower_mv_precision(&ref_mv.this_mv.as_mv, precision);
if (is_compound) {
lower_mv_precision(&ref_mv.comp_mv.as_mv, precision);
}
for (int i = 0; i < ref_mv_count_adj; ++i) {
if (is_compound) {
if (ref_mv_stack_adj[i].this_mv.as_int == ref_mv.this_mv.as_int &&
ref_mv_stack_adj[i].comp_mv.as_int == ref_mv.comp_mv.as_int)
return i;
} else {
if (ref_mv_stack_adj[i].this_mv.as_int == ref_mv.this_mv.as_int) return i;
}
}
assert(0);
return -1;
}
#endif // ADJUST_DRL_FLEX_MVRES
#endif // CONFIG_FLEX_MVRES