2016-02-23 19:08:26 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2010 The WebM project authors. All Rights Reserved.
|
|
|
|
*
|
|
|
|
* Use of this source code is governed by a BSD-style license
|
|
|
|
* that can be found in the LICENSE file in the root of the source
|
|
|
|
* tree. An additional intellectual property rights grant can be found
|
|
|
|
* in the file PATENTS. All contributing project authors may
|
|
|
|
* be found in the AUTHORS file in the root of the source tree.
|
|
|
|
*/
|
|
|
|
|
2019-09-11 15:51:47 +00:00
|
|
|
#ifndef VPX_VP9_ENCODER_VP9_MCOMP_H_
|
|
|
|
#define VPX_VP9_ENCODER_VP9_MCOMP_H_
|
2016-02-23 19:08:26 +00:00
|
|
|
|
|
|
|
#include "vp9/encoder/vp9_block.h"
|
|
|
|
#include "vpx_dsp/variance.h"
|
|
|
|
|
|
|
|
#ifdef __cplusplus
|
|
|
|
extern "C" {
|
|
|
|
#endif
|
|
|
|
|
|
|
|
// The maximum number of steps in a step search given the largest
|
|
|
|
// allowed initial step
|
|
|
|
#define MAX_MVSEARCH_STEPS 11
|
|
|
|
// Max full pel mv specified in the unit of full pixel
|
|
|
|
// Enable the use of motion vector in range [-1023, 1023].
|
|
|
|
#define MAX_FULL_PEL_VAL ((1 << (MAX_MVSEARCH_STEPS - 1)) - 1)
|
|
|
|
// Maximum size of the first step in full pel units
|
2016-09-26 18:31:51 +00:00
|
|
|
#define MAX_FIRST_STEP (1 << (MAX_MVSEARCH_STEPS - 1))
|
2016-02-23 19:08:26 +00:00
|
|
|
// Allowed motion vector pixel distance outside image border
|
|
|
|
// for Block_16x16
|
|
|
|
#define BORDER_MV_PIXELS_B16 (16 + VP9_INTERP_EXTEND)
|
|
|
|
|
|
|
|
typedef struct search_site_config {
|
|
|
|
// motion search sites
|
2016-09-26 18:31:51 +00:00
|
|
|
MV ss_mv[8 * MAX_MVSEARCH_STEPS]; // Motion vector
|
|
|
|
intptr_t ss_os[8 * MAX_MVSEARCH_STEPS]; // Offset
|
2016-02-23 19:08:26 +00:00
|
|
|
int searches_per_step;
|
|
|
|
int total_steps;
|
|
|
|
} search_site_config;
|
|
|
|
|
2019-09-11 15:51:47 +00:00
|
|
|
static INLINE const uint8_t *get_buf_from_mv(const struct buf_2d *buf,
|
|
|
|
const MV *mv) {
|
|
|
|
return &buf->buf[mv->row * buf->stride + mv->col];
|
|
|
|
}
|
|
|
|
|
2016-02-23 19:08:26 +00:00
|
|
|
void vp9_init_dsmotion_compensation(search_site_config *cfg, int stride);
|
2016-09-26 18:31:51 +00:00
|
|
|
void vp9_init3smotion_compensation(search_site_config *cfg, int stride);
|
2016-02-23 19:08:26 +00:00
|
|
|
|
2016-09-26 18:31:51 +00:00
|
|
|
void vp9_set_mv_search_range(MvLimits *mv_limits, const MV *mv);
|
|
|
|
int vp9_mv_bit_cost(const MV *mv, const MV *ref, const int *mvjcost,
|
|
|
|
int *mvcost[2], int weight);
|
2016-02-23 19:08:26 +00:00
|
|
|
|
|
|
|
// Utility to compute variance + MV rate cost for a given MV
|
2016-09-26 18:31:51 +00:00
|
|
|
int vp9_get_mvpred_var(const MACROBLOCK *x, const MV *best_mv,
|
|
|
|
const MV *center_mv, const vp9_variance_fn_ptr_t *vfp,
|
2016-02-23 19:08:26 +00:00
|
|
|
int use_mvcost);
|
2016-09-26 18:31:51 +00:00
|
|
|
int vp9_get_mvpred_av_var(const MACROBLOCK *x, const MV *best_mv,
|
|
|
|
const MV *center_mv, const uint8_t *second_pred,
|
|
|
|
const vp9_variance_fn_ptr_t *vfp, int use_mvcost);
|
2016-02-23 19:08:26 +00:00
|
|
|
|
|
|
|
struct VP9_COMP;
|
|
|
|
struct SPEED_FEATURES;
|
|
|
|
|
|
|
|
int vp9_init_search_range(int size);
|
|
|
|
|
2016-09-26 18:31:51 +00:00
|
|
|
int vp9_refining_search_sad(const struct macroblock *x, struct mv *ref_mv,
|
2019-09-11 15:51:47 +00:00
|
|
|
int error_per_bit, int search_range,
|
2016-02-23 19:08:26 +00:00
|
|
|
const struct vp9_variance_vtable *fn_ptr,
|
|
|
|
const struct mv *center_mv);
|
|
|
|
|
|
|
|
// Perform integral projection based motion estimation.
|
|
|
|
unsigned int vp9_int_pro_motion_estimation(const struct VP9_COMP *cpi,
|
2016-09-26 18:31:51 +00:00
|
|
|
MACROBLOCK *x, BLOCK_SIZE bsize,
|
2019-09-11 15:51:47 +00:00
|
|
|
int mi_row, int mi_col,
|
|
|
|
const MV *ref_mv);
|
2016-02-23 19:08:26 +00:00
|
|
|
|
2016-09-26 18:31:51 +00:00
|
|
|
typedef uint32_t(fractional_mv_step_fp)(
|
|
|
|
const MACROBLOCK *x, MV *bestmv, const MV *ref_mv, int allow_hp,
|
|
|
|
int error_per_bit, const vp9_variance_fn_ptr_t *vfp,
|
2016-02-23 19:08:26 +00:00
|
|
|
int forced_stop, // 0 - full, 1 - qtr only, 2 - half only
|
2016-09-26 18:31:51 +00:00
|
|
|
int iters_per_step, int *cost_list, int *mvjcost, int *mvcost[2],
|
|
|
|
uint32_t *distortion, uint32_t *sse1, const uint8_t *second_pred, int w,
|
2019-09-11 15:51:47 +00:00
|
|
|
int h, int use_accurate_subpel_search);
|
2016-02-23 19:08:26 +00:00
|
|
|
|
|
|
|
extern fractional_mv_step_fp vp9_find_best_sub_pixel_tree;
|
|
|
|
extern fractional_mv_step_fp vp9_find_best_sub_pixel_tree_pruned;
|
|
|
|
extern fractional_mv_step_fp vp9_find_best_sub_pixel_tree_pruned_more;
|
|
|
|
extern fractional_mv_step_fp vp9_find_best_sub_pixel_tree_pruned_evenmore;
|
2016-09-26 18:31:51 +00:00
|
|
|
extern fractional_mv_step_fp vp9_skip_sub_pixel_tree;
|
2019-01-17 20:16:34 +00:00
|
|
|
extern fractional_mv_step_fp vp9_return_max_sub_pixel_mv;
|
|
|
|
extern fractional_mv_step_fp vp9_return_min_sub_pixel_mv;
|
2016-02-23 19:08:26 +00:00
|
|
|
|
2016-09-26 18:31:51 +00:00
|
|
|
typedef int (*vp9_full_search_fn_t)(const MACROBLOCK *x, const MV *ref_mv,
|
|
|
|
int sad_per_bit, int distance,
|
2016-02-23 19:08:26 +00:00
|
|
|
const vp9_variance_fn_ptr_t *fn_ptr,
|
|
|
|
const MV *center_mv, MV *best_mv);
|
|
|
|
|
2016-09-26 18:31:51 +00:00
|
|
|
typedef int (*vp9_refining_search_fn_t)(const MACROBLOCK *x, MV *ref_mv,
|
|
|
|
int sad_per_bit, int distance,
|
2016-02-23 19:08:26 +00:00
|
|
|
const vp9_variance_fn_ptr_t *fn_ptr,
|
|
|
|
const MV *center_mv);
|
|
|
|
|
2016-09-26 18:31:51 +00:00
|
|
|
typedef int (*vp9_diamond_search_fn_t)(
|
|
|
|
const MACROBLOCK *x, const search_site_config *cfg, MV *ref_mv, MV *best_mv,
|
|
|
|
int search_param, int sad_per_bit, int *num00,
|
|
|
|
const vp9_variance_fn_ptr_t *fn_ptr, const MV *center_mv);
|
2016-02-23 19:08:26 +00:00
|
|
|
|
2016-09-26 18:31:51 +00:00
|
|
|
int vp9_refining_search_8p_c(const MACROBLOCK *x, MV *ref_mv, int error_per_bit,
|
2016-02-23 19:08:26 +00:00
|
|
|
int search_range,
|
|
|
|
const vp9_variance_fn_ptr_t *fn_ptr,
|
|
|
|
const MV *center_mv, const uint8_t *second_pred);
|
|
|
|
|
|
|
|
struct VP9_COMP;
|
|
|
|
|
2019-09-11 15:51:47 +00:00
|
|
|
// "mvp_full" is the MV search starting point;
|
|
|
|
// "ref_mv" is the context reference MV;
|
|
|
|
// "tmp_mv" is the searched best MV.
|
|
|
|
int vp9_full_pixel_search(const struct VP9_COMP *const cpi,
|
|
|
|
const MACROBLOCK *const x, BLOCK_SIZE bsize,
|
2019-01-17 20:16:34 +00:00
|
|
|
MV *mvp_full, int step_param, int search_method,
|
|
|
|
int error_per_bit, int *cost_list, const MV *ref_mv,
|
|
|
|
MV *tmp_mv, int var_max, int rd);
|
|
|
|
|
|
|
|
void vp9_set_subpel_mv_search_range(MvLimits *subpel_mv_limits,
|
|
|
|
const MvLimits *umv_window_limits,
|
|
|
|
const MV *ref_mv);
|
2016-02-23 19:08:26 +00:00
|
|
|
|
2019-09-11 15:51:47 +00:00
|
|
|
#if CONFIG_NON_GREEDY_MV
|
|
|
|
#define NB_MVS_NUM 4
|
|
|
|
struct TplDepStats;
|
|
|
|
double vp9_refining_search_sad_new(const MACROBLOCK *x, MV *best_full_mv,
|
|
|
|
int lambda, int search_range,
|
|
|
|
const vp9_variance_fn_ptr_t *fn_ptr,
|
|
|
|
const int_mv *nb_full_mvs, int full_mv_num);
|
|
|
|
|
|
|
|
double vp9_full_pixel_diamond_new(const struct VP9_COMP *cpi, MACROBLOCK *x,
|
|
|
|
MV *mvp_full, int step_param, int lambda,
|
|
|
|
int do_refine,
|
|
|
|
const vp9_variance_fn_ptr_t *fn_ptr,
|
|
|
|
const int_mv *nb_full_mvs, int full_mv_num,
|
|
|
|
MV *best_mv);
|
|
|
|
|
|
|
|
int64_t vp9_nb_mvs_inconsistency(const MV *mv, const int_mv *nb_mvs,
|
|
|
|
int mv_num);
|
|
|
|
static INLINE MV get_full_mv(const MV *mv) {
|
|
|
|
MV out_mv;
|
|
|
|
out_mv.row = mv->row >> 3;
|
|
|
|
out_mv.col = mv->col >> 3;
|
|
|
|
return out_mv;
|
|
|
|
}
|
|
|
|
struct TplDepFrame;
|
|
|
|
void vp9_prepare_nb_full_mvs(const struct TplDepFrame *tpl_frame, int mi_row,
|
|
|
|
int mi_col, int rf_idx, BLOCK_SIZE bsize,
|
|
|
|
int_mv *nb_full_mvs);
|
|
|
|
|
|
|
|
static INLINE BLOCK_SIZE get_square_block_size(BLOCK_SIZE bsize) {
|
|
|
|
BLOCK_SIZE square_bsize;
|
|
|
|
switch (bsize) {
|
|
|
|
case BLOCK_4X4:
|
|
|
|
case BLOCK_4X8:
|
|
|
|
case BLOCK_8X4: square_bsize = BLOCK_4X4; break;
|
|
|
|
case BLOCK_8X8:
|
|
|
|
case BLOCK_8X16:
|
|
|
|
case BLOCK_16X8: square_bsize = BLOCK_8X8; break;
|
|
|
|
case BLOCK_16X16:
|
|
|
|
case BLOCK_16X32:
|
|
|
|
case BLOCK_32X16: square_bsize = BLOCK_16X16; break;
|
|
|
|
case BLOCK_32X32:
|
|
|
|
case BLOCK_32X64:
|
|
|
|
case BLOCK_64X32:
|
|
|
|
case BLOCK_64X64: square_bsize = BLOCK_32X32; break;
|
|
|
|
default:
|
|
|
|
square_bsize = BLOCK_INVALID;
|
|
|
|
assert(0 && "ERROR: invalid block size");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return square_bsize;
|
|
|
|
}
|
|
|
|
#endif // CONFIG_NON_GREEDY_MV
|
2016-02-23 19:08:26 +00:00
|
|
|
#ifdef __cplusplus
|
|
|
|
} // extern "C"
|
|
|
|
#endif
|
|
|
|
|
2019-09-11 15:51:47 +00:00
|
|
|
#endif // VPX_VP9_ENCODER_VP9_MCOMP_H_
|