Define RDCOST only once
[libvpx.git] / vp8 / encoder / mcomp.h
blob5efcec296a1b9fd69c1e6db2d4138920b0ab0205
1 /*
2 * Copyright (c) 2010 The WebM project authors. All Rights Reserved.
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 */
12 #ifndef __INC_MCOMP_H
13 #define __INC_MCOMP_H
15 #include "block.h"
16 #include "variance.h"
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
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+3)) - 8) // Max full pel mv specified in 1/8 pel units
26 #define MAX_FIRST_STEP (1 << (MAX_MVSEARCH_STEPS-1)) // Maximum size of the first step in full pel units
28 extern void print_mode_context(void);
29 extern int vp8_mv_bit_cost(MV *mv, 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);
34 extern int vp8_hex_search
36 MACROBLOCK *x,
37 BLOCK *b,
38 BLOCKD *d,
39 MV *ref_mv,
40 MV *best_mv,
41 int search_param,
42 int error_per_bit,
43 int *num00,
44 const vp8_variance_fn_ptr_t *vf,
45 int *mvsadcost[2],
46 int *mvcost[2],
47 MV *center_mv
50 typedef int (fractional_mv_step_fp)
51 (MACROBLOCK *x, BLOCK *b, BLOCKD *d, MV *bestmv, MV *ref_mv,
52 int error_per_bit, const vp8_variance_fn_ptr_t *vfp, int *mvcost[2]);
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;
58 #define prototype_full_search_sad(sym)\
59 int (sym)\
61 MACROBLOCK *x, \
62 BLOCK *b, \
63 BLOCKD *d, \
64 MV *ref_mv, \
65 int error_per_bit, \
66 int distance, \
67 vp8_variance_fn_ptr_t *fn_ptr, \
68 int *mvcost[2], \
69 MV *center_mv \
72 #define prototype_diamond_search_sad(sym)\
73 int (sym)\
75 MACROBLOCK *x, \
76 BLOCK *b, \
77 BLOCKD *d, \
78 MV *ref_mv, \
79 MV *best_mv, \
80 int search_param, \
81 int error_per_bit, \
82 int *num00, \
83 vp8_variance_fn_ptr_t *fn_ptr, \
84 int *mvcost[2], \
85 MV *center_mv \
88 #if ARCH_X86 || ARCH_X86_64
89 #include "x86/mcomp_x86.h"
90 #endif
92 typedef prototype_full_search_sad(*vp8_full_search_fn_t);
93 extern prototype_full_search_sad(vp8_full_search_sad);
94 extern prototype_full_search_sad(vp8_full_search_sadx3);
95 extern prototype_full_search_sad(vp8_full_search_sadx8);
97 typedef prototype_diamond_search_sad(*vp8_diamond_search_fn_t);
98 extern prototype_diamond_search_sad(vp8_diamond_search_sad);
99 extern prototype_diamond_search_sad(vp8_diamond_search_sadx4);
101 #ifndef vp8_search_full_search
102 #define vp8_search_full_search vp8_full_search_sad
103 #endif
104 extern prototype_full_search_sad(vp8_search_full_search);
106 #ifndef vp8_search_diamond_search
107 #define vp8_search_diamond_search vp8_diamond_search_sad
108 #endif
109 extern prototype_diamond_search_sad(vp8_search_diamond_search);
111 typedef struct
113 prototype_full_search_sad(*full_search);
114 prototype_diamond_search_sad(*diamond_search);
115 } vp8_search_rtcd_vtable_t;
117 #if CONFIG_RUNTIME_CPU_DETECT
118 #define SEARCH_INVOKE(ctx,fn) (ctx)->fn
119 #else
120 #define SEARCH_INVOKE(ctx,fn) vp8_search_##fn
121 #endif
123 #endif