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
19extern void init_mv_ref_counts();
20extern 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+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
27
28extern void print_mode_context(void);
29extern int vp8_mv_bit_cost(MV *mv, MV *ref, int *mvcost[2], int Weight);
30extern void vp8_init_dsmotion_compensation(MACROBLOCK *x, int stride);
31extern void vp8_init3smotion_compensation(MACROBLOCK *x,  int stride);
32
33
34extern int vp8_hex_search
35(
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
48);
49
50typedef 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]);
53extern fractional_mv_step_fp vp8_find_best_sub_pixel_step_iteratively;
54extern fractional_mv_step_fp vp8_find_best_sub_pixel_step;
55extern fractional_mv_step_fp vp8_find_best_half_pixel_step;
56extern 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     MV *ref_mv, \
65     int error_per_bit, \
66     int distance, \
67     vp8_variance_fn_ptr_t *fn_ptr, \
68     int *mvcost[2], \
69     int *mvsadcost[2], \
70     MV *center_mv \
71    )
72
73#define prototype_diamond_search_sad(sym)\
74    int (sym)\
75    (\
76     MACROBLOCK *x, \
77     BLOCK *b, \
78     BLOCKD *d, \
79     MV *ref_mv, \
80     MV *best_mv, \
81     int search_param, \
82     int error_per_bit, \
83     int *num00, \
84     vp8_variance_fn_ptr_t *fn_ptr, \
85     int *mvsadcost[2], \
86     int *mvcost[2], \
87     MV *center_mv \
88    )
89
90#if ARCH_X86 || ARCH_X86_64
91#include "x86/mcomp_x86.h"
92#endif
93
94typedef prototype_full_search_sad(*vp8_full_search_fn_t);
95extern prototype_full_search_sad(vp8_full_search_sad);
96extern prototype_full_search_sad(vp8_full_search_sadx3);
97extern prototype_full_search_sad(vp8_full_search_sadx8);
98
99typedef prototype_diamond_search_sad(*vp8_diamond_search_fn_t);
100extern prototype_diamond_search_sad(vp8_diamond_search_sad);
101extern prototype_diamond_search_sad(vp8_diamond_search_sadx4);
102
103#ifndef vp8_search_full_search
104#define vp8_search_full_search vp8_full_search_sad
105#endif
106extern prototype_full_search_sad(vp8_search_full_search);
107
108#ifndef vp8_search_diamond_search
109#define vp8_search_diamond_search vp8_diamond_search_sad
110#endif
111extern prototype_diamond_search_sad(vp8_search_diamond_search);
112
113typedef struct
114{
115    prototype_full_search_sad(*full_search);
116    prototype_diamond_search_sad(*diamond_search);
117} vp8_search_rtcd_vtable_t;
118
119#if CONFIG_RUNTIME_CPU_DETECT
120#define SEARCH_INVOKE(ctx,fn) (ctx)->fn
121#else
122#define SEARCH_INVOKE(ctx,fn) vp8_search_##fn
123#endif
124
125#endif
126