michael@0: /*
michael@0:  *  Copyright (c) 2010 The WebM project authors. All Rights Reserved.
michael@0:  *
michael@0:  *  Use of this source code is governed by a BSD-style license
michael@0:  *  that can be found in the LICENSE file in the root of the source
michael@0:  *  tree. An additional intellectual property rights grant can be found
michael@0:  *  in the file PATENTS.  All contributing project authors may
michael@0:  *  be found in the AUTHORS file in the root of the source tree.
michael@0:  */
michael@0: 
michael@0: 
michael@0: #ifndef VP9_COMMON_VP9_FINDNEARMV_H_
michael@0: #define VP9_COMMON_VP9_FINDNEARMV_H_
michael@0: 
michael@0: #include "vp9/common/vp9_mv.h"
michael@0: #include "vp9/common/vp9_blockd.h"
michael@0: #include "vp9/common/vp9_treecoder.h"
michael@0: #include "vp9/common/vp9_onyxc_int.h"
michael@0: 
michael@0: #define LEFT_TOP_MARGIN     ((VP9BORDERINPIXELS - VP9_INTERP_EXTEND) << 3)
michael@0: #define RIGHT_BOTTOM_MARGIN ((VP9BORDERINPIXELS - VP9_INTERP_EXTEND) << 3)
michael@0: 
michael@0: // check a list of motion vectors by sad score using a number rows of pixels
michael@0: // above and a number cols of pixels in the left to select the one with best
michael@0: // score to use as ref motion vector
michael@0: void vp9_find_best_ref_mvs(MACROBLOCKD *xd, int allow_hp,
michael@0:                            int_mv *mvlist, int_mv *nearest, int_mv *near);
michael@0: 
michael@0: // TODO(jingning): this mv clamping function should be block size dependent.
michael@0: static void clamp_mv2(MV *mv, const MACROBLOCKD *xd) {
michael@0:   clamp_mv(mv, xd->mb_to_left_edge - LEFT_TOP_MARGIN,
michael@0:                xd->mb_to_right_edge + RIGHT_BOTTOM_MARGIN,
michael@0:                xd->mb_to_top_edge - LEFT_TOP_MARGIN,
michael@0:                xd->mb_to_bottom_edge + RIGHT_BOTTOM_MARGIN);
michael@0: }
michael@0: 
michael@0: void vp9_append_sub8x8_mvs_for_idx(VP9_COMMON *cm, MACROBLOCKD *xd,
michael@0:                                    const TileInfo *const tile,
michael@0:                                    int_mv *dst_nearest,
michael@0:                                    int_mv *dst_near,
michael@0:                                    int block_idx, int ref_idx,
michael@0:                                    int mi_row, int mi_col);
michael@0: 
michael@0: static MB_PREDICTION_MODE left_block_mode(const MODE_INFO *cur_mi,
michael@0:                                           const MODE_INFO *left_mi, int b) {
michael@0:   if (b == 0 || b == 2) {
michael@0:     if (!left_mi || is_inter_block(&left_mi->mbmi))
michael@0:       return DC_PRED;
michael@0: 
michael@0:     return left_mi->mbmi.sb_type < BLOCK_8X8 ? left_mi->bmi[b + 1].as_mode
michael@0:                                              : left_mi->mbmi.mode;
michael@0:   } else {
michael@0:     assert(b == 1 || b == 3);
michael@0:     return cur_mi->bmi[b - 1].as_mode;
michael@0:   }
michael@0: }
michael@0: 
michael@0: static MB_PREDICTION_MODE above_block_mode(const MODE_INFO *cur_mi,
michael@0:                                            const MODE_INFO *above_mi, int b) {
michael@0:   if (b == 0 || b == 1) {
michael@0:     if (!above_mi || is_inter_block(&above_mi->mbmi))
michael@0:       return DC_PRED;
michael@0: 
michael@0:     return above_mi->mbmi.sb_type < BLOCK_8X8 ? above_mi->bmi[b + 2].as_mode
michael@0:                                               : above_mi->mbmi.mode;
michael@0:   } else {
michael@0:     assert(b == 2 || b == 3);
michael@0:     return cur_mi->bmi[b - 2].as_mode;
michael@0:   }
michael@0: }
michael@0: 
michael@0: #endif  // VP9_COMMON_VP9_FINDNEARMV_H_