| Index: source/libvpx/vp9/common/vp9_mvref_common.c
|
| diff --git a/source/libvpx/vp9/common/vp9_mvref_common.c b/source/libvpx/vp9/common/vp9_mvref_common.c
|
| index 51aa82411a9254d89b49574b7208e482f5ba0a28..561201ffe5ac538ff2a32c43a2fc8d56482bfa61 100644
|
| --- a/source/libvpx/vp9/common/vp9_mvref_common.c
|
| +++ b/source/libvpx/vp9/common/vp9_mvref_common.c
|
| @@ -17,8 +17,7 @@ static void find_mv_refs_idx(const VP9_COMMON *cm, const MACROBLOCKD *xd,
|
| const TileInfo *const tile,
|
| MODE_INFO *mi, MV_REFERENCE_FRAME ref_frame,
|
| int_mv *mv_ref_list,
|
| - int block, int mi_row, int mi_col,
|
| - find_mv_refs_sync sync, void *const data) {
|
| + int block, int mi_row, int mi_col) {
|
| const int *ref_sign_bias = cm->ref_frame_sign_bias;
|
| int i, refmv_count = 0;
|
| const POSITION *const mv_ref_search = mv_ref_blocks[mi->mbmi.sb_type];
|
| @@ -69,11 +68,6 @@ static void find_mv_refs_idx(const VP9_COMMON *cm, const MACROBLOCKD *xd,
|
| }
|
| }
|
|
|
| - // Synchronize here for frame parallel decode if sync function is provided.
|
| - if (sync != NULL) {
|
| - sync(data, mi_row);
|
| - }
|
| -
|
| // Check the last frame's mode and mv info.
|
| if (cm->use_prev_frame_mvs) {
|
| if (prev_frame_mvs->ref_frame[0] == ref_frame) {
|
| @@ -139,10 +133,9 @@ void vp9_find_mv_refs(const VP9_COMMON *cm, const MACROBLOCKD *xd,
|
| const TileInfo *const tile,
|
| MODE_INFO *mi, MV_REFERENCE_FRAME ref_frame,
|
| int_mv *mv_ref_list,
|
| - int mi_row, int mi_col,
|
| - find_mv_refs_sync sync, void *const data) {
|
| + int mi_row, int mi_col) {
|
| find_mv_refs_idx(cm, xd, tile, mi, ref_frame, mv_ref_list, -1,
|
| - mi_row, mi_col, sync, data);
|
| + mi_row, mi_col);
|
| }
|
|
|
| static void lower_mv_precision(MV *mv, int allow_hp) {
|
| @@ -156,22 +149,21 @@ static void lower_mv_precision(MV *mv, int allow_hp) {
|
| }
|
|
|
| void vp9_find_best_ref_mvs(MACROBLOCKD *xd, int allow_hp,
|
| - int_mv *mvlist, int_mv *nearest_mv,
|
| - int_mv *near_mv) {
|
| + int_mv *mvlist, int_mv *nearest, int_mv *near) {
|
| int i;
|
| // Make sure all the candidates are properly clamped etc
|
| for (i = 0; i < MAX_MV_REF_CANDIDATES; ++i) {
|
| lower_mv_precision(&mvlist[i].as_mv, allow_hp);
|
| clamp_mv2(&mvlist[i].as_mv, xd);
|
| }
|
| - *nearest_mv = mvlist[0];
|
| - *near_mv = mvlist[1];
|
| + *nearest = mvlist[0];
|
| + *near = mvlist[1];
|
| }
|
|
|
| void vp9_append_sub8x8_mvs_for_idx(VP9_COMMON *cm, MACROBLOCKD *xd,
|
| const TileInfo *const tile,
|
| int block, int ref, int mi_row, int mi_col,
|
| - int_mv *nearest_mv, int_mv *near_mv) {
|
| + int_mv *nearest, int_mv *near) {
|
| int_mv mv_list[MAX_MV_REF_CANDIDATES];
|
| MODE_INFO *const mi = xd->mi[0].src_mi;
|
| b_mode_info *bmi = mi->bmi;
|
| @@ -180,20 +172,20 @@ void vp9_append_sub8x8_mvs_for_idx(VP9_COMMON *cm, MACROBLOCKD *xd,
|
| assert(MAX_MV_REF_CANDIDATES == 2);
|
|
|
| find_mv_refs_idx(cm, xd, tile, mi, mi->mbmi.ref_frame[ref], mv_list, block,
|
| - mi_row, mi_col, NULL, NULL);
|
| + mi_row, mi_col);
|
|
|
| - near_mv->as_int = 0;
|
| + near->as_int = 0;
|
| switch (block) {
|
| case 0:
|
| - nearest_mv->as_int = mv_list[0].as_int;
|
| - near_mv->as_int = mv_list[1].as_int;
|
| + nearest->as_int = mv_list[0].as_int;
|
| + near->as_int = mv_list[1].as_int;
|
| break;
|
| case 1:
|
| case 2:
|
| - nearest_mv->as_int = bmi[0].as_mv[ref].as_int;
|
| + nearest->as_int = bmi[0].as_mv[ref].as_int;
|
| for (n = 0; n < MAX_MV_REF_CANDIDATES; ++n)
|
| - if (nearest_mv->as_int != mv_list[n].as_int) {
|
| - near_mv->as_int = mv_list[n].as_int;
|
| + if (nearest->as_int != mv_list[n].as_int) {
|
| + near->as_int = mv_list[n].as_int;
|
| break;
|
| }
|
| break;
|
| @@ -204,10 +196,10 @@ void vp9_append_sub8x8_mvs_for_idx(VP9_COMMON *cm, MACROBLOCKD *xd,
|
| candidates[2] = mv_list[0];
|
| candidates[3] = mv_list[1];
|
|
|
| - nearest_mv->as_int = bmi[2].as_mv[ref].as_int;
|
| + nearest->as_int = bmi[2].as_mv[ref].as_int;
|
| for (n = 0; n < 2 + MAX_MV_REF_CANDIDATES; ++n)
|
| - if (nearest_mv->as_int != candidates[n].as_int) {
|
| - near_mv->as_int = candidates[n].as_int;
|
| + if (nearest->as_int != candidates[n].as_int) {
|
| + near->as_int = candidates[n].as_int;
|
| break;
|
| }
|
| break;
|
|
|