Home | History | Annotate | Download | only in common 
      1 /*
      2  *  Copyright (c) 2010 The WebM project authors. All Rights Reserved.
      3  *
      4  *  Use of this source code is governed by a BSD-style license
      5  *  that can be found in the LICENSE file in the root of the source
      6  *  tree. An additional intellectual property rights grant can be found
      7  *  in the file PATENTS.  All contributing project authors may
      8  *  be found in the AUTHORS file in the root of the source tree.
      9  */
     10 
     11 
     12 #ifndef VP9_COMMON_VP9_FINDNEARMV_H_
     13 #define VP9_COMMON_VP9_FINDNEARMV_H_
     14 
     15 #include "vp9/common/vp9_mv.h"
     16 #include "vp9/common/vp9_blockd.h"
     17 #include "vp9/common/vp9_treecoder.h"
     18 #include "vp9/common/vp9_onyxc_int.h"
     19 
     20 #define LEFT_TOP_MARGIN     ((VP9BORDERINPIXELS - VP9_INTERP_EXTEND) << 3)
     21 #define RIGHT_BOTTOM_MARGIN ((VP9BORDERINPIXELS - VP9_INTERP_EXTEND) << 3)
     22 
     23 // check a list of motion vectors by sad score using a number rows of pixels
     24 // above and a number cols of pixels in the left to select the one with best
     25 // score to use as ref motion vector
     26 void vp9_find_best_ref_mvs(MACROBLOCKD *xd,
     27                            int_mv *mvlist,
     28                            int_mv *nearest,
     29                            int_mv *near);
     30 
     31 // TODO(jingning): this mv clamping function should be block size dependent.
     32 static void clamp_mv2(MV *mv, const MACROBLOCKD *xd) {
     33   clamp_mv(mv, xd->mb_to_left_edge - LEFT_TOP_MARGIN,
     34                xd->mb_to_right_edge + RIGHT_BOTTOM_MARGIN,
     35                xd->mb_to_top_edge - LEFT_TOP_MARGIN,
     36                xd->mb_to_bottom_edge + RIGHT_BOTTOM_MARGIN);
     37 }
     38 
     39 void vp9_append_sub8x8_mvs_for_idx(VP9_COMMON *cm,
     40                                    MACROBLOCKD *xd,
     41                                    int_mv *dst_nearest,
     42                                    int_mv *dst_near,
     43                                    int block_idx, int ref_idx,
     44                                    int mi_row, int mi_col);
     45 
     46 static MB_PREDICTION_MODE left_block_mode(const MODE_INFO *cur_mb,
     47                                           const MODE_INFO *left_mb, int b) {
     48   // FIXME(rbultje, jingning): temporary hack because jenkins doesn't
     49   // understand this condition. This will go away soon.
     50   const MODE_INFO *mi = cur_mb;
     51 
     52   if (b == 0 || b == 2) {
     53     /* On L edge, get from MB to left of us */
     54     mi = left_mb;
     55     if (!mi)
     56       return DC_PRED;
     57 
     58     if (mi->mbmi.ref_frame[0] != INTRA_FRAME) {
     59       return DC_PRED;
     60     } else if (mi->mbmi.sb_type < BLOCK_8X8) {
     61       return ((mi->bmi + 1 + b)->as_mode);
     62     } else {
     63       return mi->mbmi.mode;
     64     }
     65   }
     66   assert(b == 1 || b == 3);
     67   return (mi->bmi + b - 1)->as_mode;
     68 }
     69 
     70 static MB_PREDICTION_MODE above_block_mode(const MODE_INFO *cur_mb,
     71                                            const MODE_INFO *above_mb, int b) {
     72   const MODE_INFO *mi = cur_mb;
     73 
     74   if (!(b >> 1)) {
     75     /* On top edge, get from MB above us */
     76     mi = above_mb;
     77     if (!mi)
     78       return DC_PRED;
     79 
     80     if (mi->mbmi.ref_frame[0] != INTRA_FRAME) {
     81       return DC_PRED;
     82     } else if (mi->mbmi.sb_type < BLOCK_8X8) {
     83       return ((mi->bmi + 2 + b)->as_mode);
     84     } else {
     85       return mi->mbmi.mode;
     86     }
     87   }
     88 
     89   return (mi->bmi + b - 2)->as_mode;
     90 }
     91 
     92 #endif  // VP9_COMMON_VP9_FINDNEARMV_H_
     93