generic-library/vpx
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Inlinging get_next_chkpts macro in vp9_mcomp.c.

Browse Source 
Change-Id: I38ca35dccfb9051d08b026d75ba2f3a35adb0259
This commit is contained in:
Dmitry Kovalev 2014-02-03 11:05:19 -08:00
parent cabfd505a4
commit ae1c298733
1 changed files with 4 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
vp9/encoder/vp9_mcomp.c
View File

@ -466,7 +466,6 @@ int vp9_find_best_sub_pixel_comp_tree(const MACROBLOCK *x,
#undef PRE
#undef DIST
#undef CHECK_BETTER
#undef SP
static INLINE int check_bounds(const MACROBLOCK *x, int row, int col,
int range) {
@ -496,11 +495,6 @@ static INLINE int check_point(const MACROBLOCK *x, const MV *mv) {
}\
}
#define get_next_chkpts(list, i, n) \
list[0] = ((i) == 0 ? (n) - 1 : (i) - 1); \
list[1] = (i); \
list[2] = ((i) == (n) - 1 ? 0 : (i) + 1);
#define MAX_PATTERN_SCALES 11
#define MAX_PATTERN_CANDIDATES 8 // max number of canddiates per scale
#define PATTERN_CANDIDATES_REF 3 // number of refinement candidates
@ -644,7 +638,10 @@ static int vp9_pattern_search(const MACROBLOCK *x,
do {
int next_chkpts_indices[PATTERN_CANDIDATES_REF];
best_site = -1;
get_next_chkpts(next_chkpts_indices, k, num_candidates[s]);
next_chkpts_indices[0] = (k == 0) ? num_candidates[s] - 1 : k - 1;
next_chkpts_indices[1] = k;
next_chkpts_indices[2] = (k == num_candidates[s] - 1) ? 0 : k + 1;
if (check_bounds(x, br, bc, 1 << s)) {
for (i = 0; i < PATTERN_CANDIDATES_REF; i++) {
this_mv.row = br + candidates[s][next_chkpts_indices[i]].row;