vp8/encoder/mcomp.h

   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 __INC_MCOMP_H
  13 #define __INC_MCOMP_H
  14
  15 #include "block.h"
  16 #include "variance.h"
  17
  18 #ifdef ENTROPY_STATS
  19 extern void init_mv_ref_counts();
  20 extern void accum_mv_refs(MB_PREDICTION_MODE, const int near_mv_ref_cts[4]);
  21 #endif
  22
  23
  24 #define MAX_MVSEARCH_STEPS 8                                    // The maximum number of steps in a step search given the largest allowed initial step
  25 #define MAX_FULL_PEL_VAL ((1 << (MAX_MVSEARCH_STEPS)) - 1)      // Max full pel mv specified in 1 pel units
  26 #define MAX_FIRST_STEP (1 << (MAX_MVSEARCH_STEPS-1))            // Maximum size of the first step in full pel units
  27
  28 extern void print_mode_context(void);
  29 extern int vp8_mv_bit_cost(int_mv *mv, int_mv *ref, int *mvcost[2], int Weight);
  30 extern void vp8_init_dsmotion_compensation(MACROBLOCK *x, int stride);
  31 extern void vp8_init3smotion_compensation(MACROBLOCK *x,  int stride);
  32
  33
  34 extern int vp8_hex_search
  35 (
  36     MACROBLOCK *x,
  37     BLOCK *b,
  38     BLOCKD *d,
  39     int_mv *ref_mv,
  40     int_mv *best_mv,
  41     int search_param,
  42     int error_per_bit,
  43     const vp8_variance_fn_ptr_t *vf,
  44     int *mvsadcost[2],
  45     int *mvcost[2],
  46     int_mv *center_mv
  47 );
  48
  49 typedef int (fractional_mv_step_fp)
  50     (MACROBLOCK *x, BLOCK *b, BLOCKD *d, int_mv *bestmv, int_mv *ref_mv,
  51      int error_per_bit, const vp8_variance_fn_ptr_t *vfp, int *mvcost[2],
  52      int *distortion, unsigned int *sse);
  53 extern fractional_mv_step_fp vp8_find_best_sub_pixel_step_iteratively;
  54 extern fractional_mv_step_fp vp8_find_best_sub_pixel_step;
  55 extern fractional_mv_step_fp vp8_find_best_half_pixel_step;
  56 extern fractional_mv_step_fp vp8_skip_fractional_mv_step;
  57
  58 #define prototype_full_search_sad(sym)\
  59     int (sym)\
  60     (\
  61      MACROBLOCK *x, \
  62      BLOCK *b, \
  63      BLOCKD *d, \
  64      int_mv *ref_mv, \
  65      int sad_per_bit, \
  66      int distance, \
  67      vp8_variance_fn_ptr_t *fn_ptr, \
  68      int *mvcost[2], \
  69      int_mv *center_mv \
  70     )
  71
  72 #define prototype_refining_search_sad(sym)\
  73     int (sym)\
  74     (\
  75      MACROBLOCK *x, \
  76      BLOCK *b, \
  77      BLOCKD *d, \
  78      int_mv *ref_mv, \
  79      int sad_per_bit, \
  80      int distance, \
  81      vp8_variance_fn_ptr_t *fn_ptr, \
  82      int *mvcost[2], \
  83      int_mv *center_mv \
  84     )
  85
  86 #define prototype_diamond_search_sad(sym)\
  87     int (sym)\
  88     (\
  89      MACROBLOCK *x, \
  90      BLOCK *b, \
  91      BLOCKD *d, \
  92      int_mv *ref_mv, \
  93      int_mv *best_mv, \
  94      int search_param, \
  95      int sad_per_bit, \
  96      int *num00, \
  97      vp8_variance_fn_ptr_t *fn_ptr, \
  98      int *mvcost[2], \
  99      int_mv *center_mv \
 100     )
 101
 102 #if ARCH_X86 || ARCH_X86_64
 103 #include "x86/mcomp_x86.h"
 104 #endif
 105
 106 typedef prototype_full_search_sad(*vp8_full_search_fn_t);
 107 extern prototype_full_search_sad(vp8_full_search_sad);
 108 extern prototype_full_search_sad(vp8_full_search_sadx3);
 109 extern prototype_full_search_sad(vp8_full_search_sadx8);
 110
 111 typedef prototype_refining_search_sad(*vp8_refining_search_fn_t);
 112 extern prototype_refining_search_sad(vp8_refining_search_sad);
 113 extern prototype_refining_search_sad(vp8_refining_search_sadx4);
 114
 115 typedef prototype_diamond_search_sad(*vp8_diamond_search_fn_t);
 116 extern prototype_diamond_search_sad(vp8_diamond_search_sad);
 117 extern prototype_diamond_search_sad(vp8_diamond_search_sadx4);
 118
 119 #ifndef vp8_search_full_search
 120 #define vp8_search_full_search vp8_full_search_sad
 121 #endif
 122 extern prototype_full_search_sad(vp8_search_full_search);
 123
 124 #ifndef vp8_search_refining_search
 125 #define vp8_search_refining_search vp8_refining_search_sad
 126 #endif
 127 extern prototype_refining_search_sad(vp8_search_refining_search);
 128
 129 #ifndef vp8_search_diamond_search
 130 #define vp8_search_diamond_search vp8_diamond_search_sad
 131 #endif
 132 extern prototype_diamond_search_sad(vp8_search_diamond_search);
 133
 134 typedef struct
 135 {
 136     prototype_full_search_sad(*full_search);
 137     prototype_refining_search_sad(*refining_search);
 138     prototype_diamond_search_sad(*diamond_search);
 139 } vp8_search_rtcd_vtable_t;
 140
 141 #if CONFIG_RUNTIME_CPU_DETECT
 142 #define SEARCH_INVOKE(ctx,fn) (ctx)->fn
 143 #else
 144 #define SEARCH_INVOKE(ctx,fn) vp8_search_##fn
 145 #endif
 146
 147 #endif