mcomp.c 88.7 KB
Newer Older
Jingning Han's avatar
Jingning Han committed
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
/*
 *  Copyright (c) 2010 The WebM project authors. All Rights Reserved.
 *
 *  Use of this source code is governed by a BSD-style license
 *  that can be found in the LICENSE file in the root of the source
 *  tree. An additional intellectual property rights grant can be found
 *  in the file PATENTS.  All contributing project authors may
 *  be found in the AUTHORS file in the root of the source tree.
 */

#include <limits.h>
#include <math.h>
#include <stdio.h>

#include "./vpx_config.h"
#include "./vpx_dsp_rtcd.h"

Yaowu Xu's avatar
Yaowu Xu committed
18
19
20
#include "aom_dsp/vpx_dsp_common.h"
#include "aom_mem/vpx_mem.h"
#include "aom_ports/mem.h"
Jingning Han's avatar
Jingning Han committed
21

Yaowu Xu's avatar
Yaowu Xu committed
22
23
#include "av1/common/common.h"
#include "av1/common/reconinter.h"
Jingning Han's avatar
Jingning Han committed
24

Yaowu Xu's avatar
Yaowu Xu committed
25
26
#include "av1/encoder/encoder.h"
#include "av1/encoder/mcomp.h"
Jingning Han's avatar
Jingning Han committed
27
28
29
30
31
32
33
34
35
36
37
38
39
40

// #define NEW_DIAMOND_SEARCH

static INLINE const uint8_t *get_buf_from_mv(const struct buf_2d *buf,
                                             const MV *mv) {
  return &buf->buf[mv->row * buf->stride + mv->col];
}

void vp10_set_mv_search_range(MACROBLOCK *x, const MV *mv) {
  int col_min = (mv->col >> 3) - MAX_FULL_PEL_VAL + (mv->col & 7 ? 1 : 0);
  int row_min = (mv->row >> 3) - MAX_FULL_PEL_VAL + (mv->row & 7 ? 1 : 0);
  int col_max = (mv->col >> 3) + MAX_FULL_PEL_VAL;
  int row_max = (mv->row >> 3) + MAX_FULL_PEL_VAL;

41
42
43
44
  col_min = VPXMAX(col_min, (MV_LOW >> 3) + 1);
  row_min = VPXMAX(row_min, (MV_LOW >> 3) + 1);
  col_max = VPXMIN(col_max, (MV_UPP >> 3) - 1);
  row_max = VPXMIN(row_max, (MV_UPP >> 3) - 1);
Jingning Han's avatar
Jingning Han committed
45
46
47

  // Get intersection of UMV window and valid MV window to reduce # of checks
  // in diamond search.
clang-format's avatar
clang-format committed
48
49
50
51
  if (x->mv_col_min < col_min) x->mv_col_min = col_min;
  if (x->mv_col_max > col_max) x->mv_col_max = col_max;
  if (x->mv_row_min < row_min) x->mv_row_min = row_min;
  if (x->mv_row_max > row_max) x->mv_row_max = row_max;
Jingning Han's avatar
Jingning Han committed
52
53
54
55
56
}

int vp10_init_search_range(int size) {
  int sr = 0;
  // Minimum search size no matter what the passed in value.
57
  size = VPXMAX(16, size);
Jingning Han's avatar
Jingning Han committed
58

clang-format's avatar
clang-format committed
59
  while ((size << sr) < MAX_FULL_PEL_VAL) sr++;
Jingning Han's avatar
Jingning Han committed
60

61
  sr = VPXMIN(sr, MAX_MVSEARCH_STEPS - 2);
Jingning Han's avatar
Jingning Han committed
62
63
64
  return sr;
}

clang-format's avatar
clang-format committed
65
66
67
68
static INLINE int mv_cost(const MV *mv, const int *joint_cost,
                          int *const comp_cost[2]) {
  return joint_cost[vp10_get_mv_joint(mv)] + comp_cost[0][mv->row] +
         comp_cost[1][mv->col];
Jingning Han's avatar
Jingning Han committed
69
70
}

clang-format's avatar
clang-format committed
71
72
73
int vp10_mv_bit_cost(const MV *mv, const MV *ref, const int *mvjcost,
                     int *mvcost[2], int weight) {
  const MV diff = { mv->row - ref->row, mv->col - ref->col };
Jingning Han's avatar
Jingning Han committed
74
75
76
  return ROUND_POWER_OF_TWO(mv_cost(&diff, mvjcost, mvcost) * weight, 7);
}

77
#define PIXEL_TRANSFORM_ERROR_SCALE 4
clang-format's avatar
clang-format committed
78
79
static int mv_err_cost(const MV *mv, const MV *ref, const int *mvjcost,
                       int *mvcost[2], int error_per_bit) {
Jingning Han's avatar
Jingning Han committed
80
  if (mvcost) {
clang-format's avatar
clang-format committed
81
    const MV diff = { mv->row - ref->row, mv->col - ref->col };
82
83
84
85
86
87
    // This product sits at a 32-bit ceiling right now and any additional
    // accuracy in either bit cost or error cost will cause it to overflow.
    return ROUND_POWER_OF_TWO(
        (unsigned)mv_cost(&diff, mvjcost, mvcost) * error_per_bit,
        RDDIV_BITS + VP9_PROB_COST_SHIFT - RD_EPB_SHIFT +
            PIXEL_TRANSFORM_ERROR_SCALE);
Jingning Han's avatar
Jingning Han committed
88
89
90
91
92
  }
  return 0;
}

static int mvsad_err_cost(const MACROBLOCK *x, const MV *mv, const MV *ref,
93
                          int sad_per_bit) {
clang-format's avatar
clang-format committed
94
95
  const MV diff = { mv->row - ref->row, mv->col - ref->col };
  return ROUND_POWER_OF_TWO(
96
97
      (unsigned)mv_cost(&diff, x->nmvjointsadcost, x->nmvsadcost) * sad_per_bit,
      VP9_PROB_COST_SHIFT);
Jingning Han's avatar
Jingning Han committed
98
99
100
101
102
103
104
105
106
107
}

void vp10_init_dsmotion_compensation(search_site_config *cfg, int stride) {
  int len, ss_count = 1;

  cfg->ss[0].mv.col = cfg->ss[0].mv.row = 0;
  cfg->ss[0].offset = 0;

  for (len = MAX_FIRST_STEP; len > 0; len /= 2) {
    // Generate offsets for 4 search sites per step.
clang-format's avatar
clang-format committed
108
    const MV ss_mvs[] = { { -len, 0 }, { len, 0 }, { 0, -len }, { 0, len } };
Jingning Han's avatar
Jingning Han committed
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
    int i;
    for (i = 0; i < 4; ++i) {
      search_site *const ss = &cfg->ss[ss_count++];
      ss->mv = ss_mvs[i];
      ss->offset = ss->mv.row * stride + ss->mv.col;
    }
  }

  cfg->ss_count = ss_count;
  cfg->searches_per_step = 4;
}

void vp10_init3smotion_compensation(search_site_config *cfg, int stride) {
  int len, ss_count = 1;

  cfg->ss[0].mv.col = cfg->ss[0].mv.row = 0;
  cfg->ss[0].offset = 0;

  for (len = MAX_FIRST_STEP; len > 0; len /= 2) {
    // Generate offsets for 8 search sites per step.
clang-format's avatar
clang-format committed
129
130
131
    const MV ss_mvs[8] = { { -len, 0 },   { len, 0 },     { 0, -len },
                           { 0, len },    { -len, -len }, { -len, len },
                           { len, -len }, { len, len } };
Jingning Han's avatar
Jingning Han committed
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
    int i;
    for (i = 0; i < 8; ++i) {
      search_site *const ss = &cfg->ss[ss_count++];
      ss->mv = ss_mvs[i];
      ss->offset = ss->mv.row * stride + ss->mv.col;
    }
  }

  cfg->ss_count = ss_count;
  cfg->searches_per_step = 8;
}

/*
 * To avoid the penalty for crossing cache-line read, preload the reference
 * area in a small buffer, which is aligned to make sure there won't be crossing
 * cache-line read while reading from this buffer. This reduced the cpu
 * cycles spent on reading ref data in sub-pixel filter functions.
 * TODO: Currently, since sub-pixel search range here is -3 ~ 3, copy 22 rows x
 * 32 cols area that is enough for 16x16 macroblock. Later, for SPLITMV, we
 * could reduce the area.
 */

154
155
156
157
158
159
160
161
162
/* Estimated (square) error cost of a motion vector (r,c). The 14 scale comes
 * from the same math as in mv_err_cost(). */
#define MVC(r, c)                                                 \
  (mvcost                                                         \
       ? ((unsigned)(mvjcost[((r) != rr) * 2 + ((c) != rc)] +     \
                     mvcost[0][((r)-rr)] + mvcost[1][((c)-rc)]) * \
              error_per_bit +                                     \
          8192) >>                                                \
             14                                                   \
clang-format's avatar
clang-format committed
163
       : 0)
Jingning Han's avatar
Jingning Han committed
164
165

// convert motion vector component to offset for sv[a]f calc
clang-format's avatar
clang-format committed
166
static INLINE int sp(int x) { return x & 7; }
Jingning Han's avatar
Jingning Han committed
167
168
169
170
171
172

static INLINE const uint8_t *pre(const uint8_t *buf, int stride, int r, int c) {
  return &buf[(r >> 3) * stride + (c >> 3)];
}

/* checks if (r, c) has better score than previous best */
clang-format's avatar
clang-format committed
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
#define CHECK_BETTER(v, r, c)                                                \
  if (c >= minc && c <= maxc && r >= minr && r <= maxr) {                    \
    if (second_pred == NULL)                                                 \
      thismse = vfp->svf(pre(y, y_stride, r, c), y_stride, sp(c), sp(r), z,  \
                         src_stride, &sse);                                  \
    else                                                                     \
      thismse = vfp->svaf(pre(y, y_stride, r, c), y_stride, sp(c), sp(r), z, \
                          src_stride, &sse, second_pred);                    \
    if ((v = MVC(r, c) + thismse) < besterr) {                               \
      besterr = v;                                                           \
      br = r;                                                                \
      bc = c;                                                                \
      *distortion = thismse;                                                 \
      *sse1 = sse;                                                           \
    }                                                                        \
  } else {                                                                   \
    v = INT_MAX;                                                             \
Jingning Han's avatar
Jingning Han committed
190
191
  }

clang-format's avatar
clang-format committed
192
193
194
195
196
197
198
199
200
201
202
203
204
205
#define FIRST_LEVEL_CHECKS                                       \
  {                                                              \
    unsigned int left, right, up, down, diag;                    \
    CHECK_BETTER(left, tr, tc - hstep);                          \
    CHECK_BETTER(right, tr, tc + hstep);                         \
    CHECK_BETTER(up, tr - hstep, tc);                            \
    CHECK_BETTER(down, tr + hstep, tc);                          \
    whichdir = (left < right ? 0 : 1) + (up < down ? 0 : 2);     \
    switch (whichdir) {                                          \
      case 0: CHECK_BETTER(diag, tr - hstep, tc - hstep); break; \
      case 1: CHECK_BETTER(diag, tr - hstep, tc + hstep); break; \
      case 2: CHECK_BETTER(diag, tr + hstep, tc - hstep); break; \
      case 3: CHECK_BETTER(diag, tr + hstep, tc + hstep); break; \
    }                                                            \
Jingning Han's avatar
Jingning Han committed
206
207
  }

clang-format's avatar
clang-format committed
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
#define SECOND_LEVEL_CHECKS                                       \
  {                                                               \
    int kr, kc;                                                   \
    unsigned int second;                                          \
    if (tr != br && tc != bc) {                                   \
      kr = br - tr;                                               \
      kc = bc - tc;                                               \
      CHECK_BETTER(second, tr + kr, tc + 2 * kc);                 \
      CHECK_BETTER(second, tr + 2 * kr, tc + kc);                 \
    } else if (tr == br && tc != bc) {                            \
      kc = bc - tc;                                               \
      CHECK_BETTER(second, tr + hstep, tc + 2 * kc);              \
      CHECK_BETTER(second, tr - hstep, tc + 2 * kc);              \
      switch (whichdir) {                                         \
        case 0:                                                   \
        case 1: CHECK_BETTER(second, tr + hstep, tc + kc); break; \
        case 2:                                                   \
        case 3: CHECK_BETTER(second, tr - hstep, tc + kc); break; \
      }                                                           \
    } else if (tr != br && tc == bc) {                            \
      kr = br - tr;                                               \
      CHECK_BETTER(second, tr + 2 * kr, tc + hstep);              \
      CHECK_BETTER(second, tr + 2 * kr, tc - hstep);              \
      switch (whichdir) {                                         \
        case 0:                                                   \
        case 2: CHECK_BETTER(second, tr + kr, tc + hstep); break; \
        case 1:                                                   \
        case 3: CHECK_BETTER(second, tr + kr, tc - hstep); break; \
      }                                                           \
    }                                                             \
Jingning Han's avatar
Jingning Han committed
238
239
  }

240
241
242
// TODO(yunqingwang): SECOND_LEVEL_CHECKS_BEST was a rewrote of
// SECOND_LEVEL_CHECKS, and SECOND_LEVEL_CHECKS should be rewritten
// later in the same way.
clang-format's avatar
clang-format committed
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
#define SECOND_LEVEL_CHECKS_BEST                \
  {                                             \
    unsigned int second;                        \
    int br0 = br;                               \
    int bc0 = bc;                               \
    assert(tr == br || tc == bc);               \
    if (tr == br && tc != bc) {                 \
      kc = bc - tc;                             \
    } else if (tr != br && tc == bc) {          \
      kr = br - tr;                             \
    }                                           \
    CHECK_BETTER(second, br0 + kr, bc0);        \
    CHECK_BETTER(second, br0, bc0 + kc);        \
    if (br0 != br || bc0 != bc) {               \
      CHECK_BETTER(second, br0 + kr, bc0 + kc); \
    }                                           \
259
260
  }

clang-format's avatar
clang-format committed
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
#define SETUP_SUBPEL_SEARCH                                         \
  const uint8_t *const z = x->plane[0].src.buf;                     \
  const int src_stride = x->plane[0].src.stride;                    \
  const MACROBLOCKD *xd = &x->e_mbd;                                \
  unsigned int besterr = INT_MAX;                                   \
  unsigned int sse;                                                 \
  unsigned int whichdir;                                            \
  int thismse;                                                      \
  const unsigned int halfiters = iters_per_step;                    \
  const unsigned int quarteriters = iters_per_step;                 \
  const unsigned int eighthiters = iters_per_step;                  \
  const int y_stride = xd->plane[0].pre[0].stride;                  \
  const int offset = bestmv->row * y_stride + bestmv->col;          \
  const uint8_t *const y = xd->plane[0].pre[0].buf;                 \
                                                                    \
  int rr = ref_mv->row;                                             \
  int rc = ref_mv->col;                                             \
  int br = bestmv->row * 8;                                         \
  int bc = bestmv->col * 8;                                         \
  int hstep = 4;                                                    \
  const int minc = VPXMAX(x->mv_col_min * 8, ref_mv->col - MV_MAX); \
  const int maxc = VPXMIN(x->mv_col_max * 8, ref_mv->col + MV_MAX); \
  const int minr = VPXMAX(x->mv_row_min * 8, ref_mv->row - MV_MAX); \
  const int maxr = VPXMIN(x->mv_row_max * 8, ref_mv->row + MV_MAX); \
  int tr = br;                                                      \
  int tc = bc;                                                      \
                                                                    \
  bestmv->row *= 8;                                                 \
Jingning Han's avatar
Jingning Han committed
289
290
  bestmv->col *= 8;

clang-format's avatar
clang-format committed
291
292
293
294
295
296
static unsigned int setup_center_error(
    const MACROBLOCKD *xd, const MV *bestmv, const MV *ref_mv,
    int error_per_bit, const vpx_variance_fn_ptr_t *vfp,
    const uint8_t *const src, const int src_stride, const uint8_t *const y,
    int y_stride, const uint8_t *second_pred, int w, int h, int offset,
    int *mvjcost, int *mvcost[2], unsigned int *sse1, int *distortion) {
Jingning Han's avatar
Jingning Han committed
297
  unsigned int besterr;
298
#if CONFIG_VPX_HIGHBITDEPTH
Jingning Han's avatar
Jingning Han committed
299
300
301
302
303
  if (second_pred != NULL) {
    if (xd->cur_buf->flags & YV12_FLAG_HIGHBITDEPTH) {
      DECLARE_ALIGNED(16, uint16_t, comp_pred16[64 * 64]);
      vpx_highbd_comp_avg_pred(comp_pred16, second_pred, w, h, y + offset,
                               y_stride);
clang-format's avatar
clang-format committed
304
305
      besterr =
          vfp->vf(CONVERT_TO_BYTEPTR(comp_pred16), w, src, src_stride, sse1);
Jingning Han's avatar
Jingning Han committed
306
307
308
309
310
311
312
313
314
315
316
    } else {
      DECLARE_ALIGNED(16, uint8_t, comp_pred[64 * 64]);
      vpx_comp_avg_pred(comp_pred, second_pred, w, h, y + offset, y_stride);
      besterr = vfp->vf(comp_pred, w, src, src_stride, sse1);
    }
  } else {
    besterr = vfp->vf(y + offset, y_stride, src, src_stride, sse1);
  }
  *distortion = besterr;
  besterr += mv_err_cost(bestmv, ref_mv, mvjcost, mvcost, error_per_bit);
#else
clang-format's avatar
clang-format committed
317
  (void)xd;
Jingning Han's avatar
Jingning Han committed
318
319
320
321
322
323
324
325
326
  if (second_pred != NULL) {
    DECLARE_ALIGNED(16, uint8_t, comp_pred[64 * 64]);
    vpx_comp_avg_pred(comp_pred, second_pred, w, h, y + offset, y_stride);
    besterr = vfp->vf(comp_pred, w, src, src_stride, sse1);
  } else {
    besterr = vfp->vf(y + offset, y_stride, src, src_stride, sse1);
  }
  *distortion = besterr;
  besterr += mv_err_cost(bestmv, ref_mv, mvjcost, mvcost, error_per_bit);
327
#endif  // CONFIG_VPX_HIGHBITDEPTH
Jingning Han's avatar
Jingning Han committed
328
329
330
331
332
333
334
335
  return besterr;
}

static INLINE int divide_and_round(const int n, const int d) {
  return ((n < 0) ^ (d < 0)) ? ((n - d / 2) / d) : ((n + d / 2) / d);
}

static INLINE int is_cost_list_wellbehaved(int *cost_list) {
clang-format's avatar
clang-format committed
336
337
  return cost_list[0] < cost_list[1] && cost_list[0] < cost_list[2] &&
         cost_list[0] < cost_list[3] && cost_list[0] < cost_list[4];
Jingning Han's avatar
Jingning Han committed
338
339
340
341
342
343
344
345
346
347
}

// Returns surface minima estimate at given precision in 1/2^n bits.
// Assume a model for the cost surface: S = A(x - x0)^2 + B(y - y0)^2 + C
// For a given set of costs S0, S1, S2, S3, S4 at points
// (y, x) = (0, 0), (0, -1), (1, 0), (0, 1) and (-1, 0) respectively,
// the solution for the location of the minima (x0, y0) is given by:
// x0 = 1/2 (S1 - S3)/(S1 + S3 - 2*S0),
// y0 = 1/2 (S4 - S2)/(S4 + S2 - 2*S0).
// The code below is an integerized version of that.
clang-format's avatar
clang-format committed
348
static void get_cost_surf_min(int *cost_list, int *ir, int *ic, int bits) {
Jingning Han's avatar
Jingning Han committed
349
350
351
352
353
354
355
  *ic = divide_and_round((cost_list[1] - cost_list[3]) * (1 << (bits - 1)),
                         (cost_list[1] - 2 * cost_list[0] + cost_list[3]));
  *ir = divide_and_round((cost_list[4] - cost_list[2]) * (1 << (bits - 1)),
                         (cost_list[4] - 2 * cost_list[0] + cost_list[2]));
}

int vp10_find_best_sub_pixel_tree_pruned_evenmore(
clang-format's avatar
clang-format committed
356
357
358
359
360
    const MACROBLOCK *x, MV *bestmv, const MV *ref_mv, int allow_hp,
    int error_per_bit, const vpx_variance_fn_ptr_t *vfp, int forced_stop,
    int iters_per_step, int *cost_list, int *mvjcost, int *mvcost[2],
    int *distortion, unsigned int *sse1, const uint8_t *second_pred, int w,
    int h) {
Jingning Han's avatar
Jingning Han committed
361
  SETUP_SUBPEL_SEARCH;
clang-format's avatar
clang-format committed
362
363
364
365
366
367
368
369
370
371
372
373
  besterr = setup_center_error(xd, bestmv, ref_mv, error_per_bit, vfp, z,
                               src_stride, y, y_stride, second_pred, w, h,
                               offset, mvjcost, mvcost, sse1, distortion);
  (void)halfiters;
  (void)quarteriters;
  (void)eighthiters;
  (void)whichdir;
  (void)allow_hp;
  (void)forced_stop;
  (void)hstep;

  if (cost_list && cost_list[0] != INT_MAX && cost_list[1] != INT_MAX &&
Jingning Han's avatar
Jingning Han committed
374
      cost_list[2] != INT_MAX && cost_list[3] != INT_MAX &&
clang-format's avatar
clang-format committed
375
      cost_list[4] != INT_MAX && is_cost_list_wellbehaved(cost_list)) {
Jingning Han's avatar
Jingning Han committed
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
    int ir, ic;
    unsigned int minpt;
    get_cost_surf_min(cost_list, &ir, &ic, 2);
    if (ir != 0 || ic != 0) {
      CHECK_BETTER(minpt, tr + 2 * ir, tc + 2 * ic);
    }
  } else {
    FIRST_LEVEL_CHECKS;
    if (halfiters > 1) {
      SECOND_LEVEL_CHECKS;
    }

    tr = br;
    tc = bc;

    // Each subsequent iteration checks at least one point in common with
    // the last iteration could be 2 ( if diag selected) 1/4 pel
    // Note forced_stop: 0 - full, 1 - qtr only, 2 - half only
    if (forced_stop != 2) {
      hstep >>= 1;
      FIRST_LEVEL_CHECKS;
      if (quarteriters > 1) {
        SECOND_LEVEL_CHECKS;
      }
    }
  }

  tr = br;
  tc = bc;

  if (allow_hp && vp10_use_mv_hp(ref_mv) && forced_stop == 0) {
    hstep >>= 1;
    FIRST_LEVEL_CHECKS;
    if (eighthiters > 1) {
      SECOND_LEVEL_CHECKS;
    }
  }

  bestmv->row = br;
  bestmv->col = bc;

  if ((abs(bestmv->col - ref_mv->col) > (MAX_FULL_PEL_VAL << 3)) ||
      (abs(bestmv->row - ref_mv->row) > (MAX_FULL_PEL_VAL << 3)))
    return INT_MAX;

  return besterr;
}

clang-format's avatar
clang-format committed
424
425
426
427
428
429
int vp10_find_best_sub_pixel_tree_pruned_more(
    const MACROBLOCK *x, MV *bestmv, const MV *ref_mv, int allow_hp,
    int error_per_bit, const vpx_variance_fn_ptr_t *vfp, int forced_stop,
    int iters_per_step, int *cost_list, int *mvjcost, int *mvcost[2],
    int *distortion, unsigned int *sse1, const uint8_t *second_pred, int w,
    int h) {
Jingning Han's avatar
Jingning Han committed
430
  SETUP_SUBPEL_SEARCH;
clang-format's avatar
clang-format committed
431
432
433
434
  besterr = setup_center_error(xd, bestmv, ref_mv, error_per_bit, vfp, z,
                               src_stride, y, y_stride, second_pred, w, h,
                               offset, mvjcost, mvcost, sse1, distortion);
  if (cost_list && cost_list[0] != INT_MAX && cost_list[1] != INT_MAX &&
Jingning Han's avatar
Jingning Han committed
435
      cost_list[2] != INT_MAX && cost_list[3] != INT_MAX &&
clang-format's avatar
clang-format committed
436
      cost_list[4] != INT_MAX && is_cost_list_wellbehaved(cost_list)) {
Jingning Han's avatar
Jingning Han committed
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
    unsigned int minpt;
    int ir, ic;
    get_cost_surf_min(cost_list, &ir, &ic, 1);
    if (ir != 0 || ic != 0) {
      CHECK_BETTER(minpt, tr + ir * hstep, tc + ic * hstep);
    }
  } else {
    FIRST_LEVEL_CHECKS;
    if (halfiters > 1) {
      SECOND_LEVEL_CHECKS;
    }
  }

  // Each subsequent iteration checks at least one point in common with
  // the last iteration could be 2 ( if diag selected) 1/4 pel

  // Note forced_stop: 0 - full, 1 - qtr only, 2 - half only
  if (forced_stop != 2) {
    tr = br;
    tc = bc;
    hstep >>= 1;
    FIRST_LEVEL_CHECKS;
    if (quarteriters > 1) {
      SECOND_LEVEL_CHECKS;
    }
  }

  if (allow_hp && vp10_use_mv_hp(ref_mv) && forced_stop == 0) {
    tr = br;
    tc = bc;
    hstep >>= 1;
    FIRST_LEVEL_CHECKS;
    if (eighthiters > 1) {
      SECOND_LEVEL_CHECKS;
    }
  }
  // These lines insure static analysis doesn't warn that
  // tr and tc aren't used after the above point.
clang-format's avatar
clang-format committed
475
476
  (void)tr;
  (void)tc;
Jingning Han's avatar
Jingning Han committed
477
478
479
480
481
482
483
484
485
486
487

  bestmv->row = br;
  bestmv->col = bc;

  if ((abs(bestmv->col - ref_mv->col) > (MAX_FULL_PEL_VAL << 3)) ||
      (abs(bestmv->row - ref_mv->row) > (MAX_FULL_PEL_VAL << 3)))
    return INT_MAX;

  return besterr;
}

clang-format's avatar
clang-format committed
488
489
490
491
492
493
int vp10_find_best_sub_pixel_tree_pruned(
    const MACROBLOCK *x, MV *bestmv, const MV *ref_mv, int allow_hp,
    int error_per_bit, const vpx_variance_fn_ptr_t *vfp, int forced_stop,
    int iters_per_step, int *cost_list, int *mvjcost, int *mvcost[2],
    int *distortion, unsigned int *sse1, const uint8_t *second_pred, int w,
    int h) {
Jingning Han's avatar
Jingning Han committed
494
  SETUP_SUBPEL_SEARCH;
clang-format's avatar
clang-format committed
495
496
497
498
  besterr = setup_center_error(xd, bestmv, ref_mv, error_per_bit, vfp, z,
                               src_stride, y, y_stride, second_pred, w, h,
                               offset, mvjcost, mvcost, sse1, distortion);
  if (cost_list && cost_list[0] != INT_MAX && cost_list[1] != INT_MAX &&
Jingning Han's avatar
Jingning Han committed
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
      cost_list[2] != INT_MAX && cost_list[3] != INT_MAX &&
      cost_list[4] != INT_MAX) {
    unsigned int left, right, up, down, diag;
    whichdir = (cost_list[1] < cost_list[3] ? 0 : 1) +
               (cost_list[2] < cost_list[4] ? 0 : 2);
    switch (whichdir) {
      case 0:
        CHECK_BETTER(left, tr, tc - hstep);
        CHECK_BETTER(down, tr + hstep, tc);
        CHECK_BETTER(diag, tr + hstep, tc - hstep);
        break;
      case 1:
        CHECK_BETTER(right, tr, tc + hstep);
        CHECK_BETTER(down, tr + hstep, tc);
        CHECK_BETTER(diag, tr + hstep, tc + hstep);
        break;
      case 2:
        CHECK_BETTER(left, tr, tc - hstep);
        CHECK_BETTER(up, tr - hstep, tc);
        CHECK_BETTER(diag, tr - hstep, tc - hstep);
        break;
      case 3:
        CHECK_BETTER(right, tr, tc + hstep);
        CHECK_BETTER(up, tr - hstep, tc);
        CHECK_BETTER(diag, tr - hstep, tc + hstep);
        break;
    }
  } else {
    FIRST_LEVEL_CHECKS;
    if (halfiters > 1) {
      SECOND_LEVEL_CHECKS;
    }
  }

  tr = br;
  tc = bc;

  // Each subsequent iteration checks at least one point in common with
  // the last iteration could be 2 ( if diag selected) 1/4 pel

  // Note forced_stop: 0 - full, 1 - qtr only, 2 - half only
  if (forced_stop != 2) {
    hstep >>= 1;
    FIRST_LEVEL_CHECKS;
    if (quarteriters > 1) {
      SECOND_LEVEL_CHECKS;
    }
    tr = br;
    tc = bc;
  }

  if (allow_hp && vp10_use_mv_hp(ref_mv) && forced_stop == 0) {
    hstep >>= 1;
    FIRST_LEVEL_CHECKS;
    if (eighthiters > 1) {
      SECOND_LEVEL_CHECKS;
    }
    tr = br;
    tc = bc;
  }
  // These lines insure static analysis doesn't warn that
  // tr and tc aren't used after the above point.
clang-format's avatar
clang-format committed
561
562
  (void)tr;
  (void)tc;
Jingning Han's avatar
Jingning Han committed
563
564
565
566
567
568
569
570
571
572
573
574

  bestmv->row = br;
  bestmv->col = bc;

  if ((abs(bestmv->col - ref_mv->col) > (MAX_FULL_PEL_VAL << 3)) ||
      (abs(bestmv->row - ref_mv->row) > (MAX_FULL_PEL_VAL << 3)))
    return INT_MAX;

  return besterr;
}

static const MV search_step_table[12] = {
clang-format's avatar
clang-format committed
575
576
577
  // left, right, up, down
  { 0, -4 }, { 0, 4 }, { -4, 0 }, { 4, 0 }, { 0, -2 }, { 0, 2 },
  { -2, 0 }, { 2, 0 }, { 0, -1 }, { 0, 1 }, { -1, 0 }, { 1, 0 }
Jingning Han's avatar
Jingning Han committed
578
579
};

clang-format's avatar
clang-format committed
580
581
582
583
584
585
586
587
int vp10_find_best_sub_pixel_tree(const MACROBLOCK *x, MV *bestmv,
                                  const MV *ref_mv, int allow_hp,
                                  int error_per_bit,
                                  const vpx_variance_fn_ptr_t *vfp,
                                  int forced_stop, int iters_per_step,
                                  int *cost_list, int *mvjcost, int *mvcost[2],
                                  int *distortion, unsigned int *sse1,
                                  const uint8_t *second_pred, int w, int h) {
Jingning Han's avatar
Jingning Han committed
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
  const uint8_t *const z = x->plane[0].src.buf;
  const uint8_t *const src_address = z;
  const int src_stride = x->plane[0].src.stride;
  const MACROBLOCKD *xd = &x->e_mbd;
  unsigned int besterr = INT_MAX;
  unsigned int sse;
  int thismse;
  const int y_stride = xd->plane[0].pre[0].stride;
  const int offset = bestmv->row * y_stride + bestmv->col;
  const uint8_t *const y = xd->plane[0].pre[0].buf;

  int rr = ref_mv->row;
  int rc = ref_mv->col;
  int br = bestmv->row * 8;
  int bc = bestmv->col * 8;
  int hstep = 4;
  int iter, round = 3 - forced_stop;
605
606
607
608
  const int minc = VPXMAX(x->mv_col_min * 8, ref_mv->col - MV_MAX);
  const int maxc = VPXMIN(x->mv_col_max * 8, ref_mv->col + MV_MAX);
  const int minr = VPXMAX(x->mv_row_min * 8, ref_mv->row - MV_MAX);
  const int maxr = VPXMIN(x->mv_row_max * 8, ref_mv->row + MV_MAX);
Jingning Han's avatar
Jingning Han committed
609
610
611
612
613
  int tr = br;
  int tc = bc;
  const MV *search_step = search_step_table;
  int idx, best_idx = -1;
  unsigned int cost_array[5];
614
  int kr, kc;
Jingning Han's avatar
Jingning Han committed
615
616

  if (!(allow_hp && vp10_use_mv_hp(ref_mv)))
clang-format's avatar
clang-format committed
617
    if (round == 3) round = 2;
Jingning Han's avatar
Jingning Han committed
618
619
620
621

  bestmv->row *= 8;
  bestmv->col *= 8;

clang-format's avatar
clang-format committed
622
623
624
  besterr = setup_center_error(xd, bestmv, ref_mv, error_per_bit, vfp, z,
                               src_stride, y, y_stride, second_pred, w, h,
                               offset, mvjcost, mvcost, sse1, distortion);
Jingning Han's avatar
Jingning Han committed
625

clang-format's avatar
clang-format committed
626
  (void)cost_list;  // to silence compiler warning
Jingning Han's avatar
Jingning Han committed
627
628
629
630
631
632
633
634
635
636
637
638

  for (iter = 0; iter < round; ++iter) {
    // Check vertical and horizontal sub-pixel positions.
    for (idx = 0; idx < 4; ++idx) {
      tr = br + search_step[idx].row;
      tc = bc + search_step[idx].col;
      if (tc >= minc && tc <= maxc && tr >= minr && tr <= maxr) {
        const uint8_t *const pre_address = y + (tr >> 3) * y_stride + (tc >> 3);
        MV this_mv;
        this_mv.row = tr;
        this_mv.col = tc;
        if (second_pred == NULL)
clang-format's avatar
clang-format committed
639
640
          thismse = vfp->svf(pre_address, y_stride, sp(tc), sp(tr), src_address,
                             src_stride, &sse);
Jingning Han's avatar
Jingning Han committed
641
642
643
        else
          thismse = vfp->svaf(pre_address, y_stride, sp(tc), sp(tr),
                              src_address, src_stride, &sse, second_pred);
clang-format's avatar
clang-format committed
644
645
        cost_array[idx] = thismse + mv_err_cost(&this_mv, ref_mv, mvjcost,
                                                mvcost, error_per_bit);
Jingning Han's avatar
Jingning Han committed
646
647
648
649
650
651
652
653
654
655
656
657
658

        if (cost_array[idx] < besterr) {
          best_idx = idx;
          besterr = cost_array[idx];
          *distortion = thismse;
          *sse1 = sse;
        }
      } else {
        cost_array[idx] = INT_MAX;
      }
    }

    // Check diagonal sub-pixel position
659
660
661
662
663
    kc = (cost_array[0] <= cost_array[1] ? -hstep : hstep);
    kr = (cost_array[2] <= cost_array[3] ? -hstep : hstep);

    tc = bc + kc;
    tr = br + kr;
Jingning Han's avatar
Jingning Han committed
664
665
    if (tc >= minc && tc <= maxc && tr >= minr && tr <= maxr) {
      const uint8_t *const pre_address = y + (tr >> 3) * y_stride + (tc >> 3);
clang-format's avatar
clang-format committed
666
      MV this_mv = { tr, tc };
Jingning Han's avatar
Jingning Han committed
667
      if (second_pred == NULL)
clang-format's avatar
clang-format committed
668
669
        thismse = vfp->svf(pre_address, y_stride, sp(tc), sp(tr), src_address,
                           src_stride, &sse);
Jingning Han's avatar
Jingning Han committed
670
      else
clang-format's avatar
clang-format committed
671
672
673
674
        thismse = vfp->svaf(pre_address, y_stride, sp(tc), sp(tr), src_address,
                            src_stride, &sse, second_pred);
      cost_array[4] = thismse + mv_err_cost(&this_mv, ref_mv, mvjcost, mvcost,
                                            error_per_bit);
Jingning Han's avatar
Jingning Han committed
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693

      if (cost_array[4] < besterr) {
        best_idx = 4;
        besterr = cost_array[4];
        *distortion = thismse;
        *sse1 = sse;
      }
    } else {
      cost_array[idx] = INT_MAX;
    }

    if (best_idx < 4 && best_idx >= 0) {
      br += search_step[best_idx].row;
      bc += search_step[best_idx].col;
    } else if (best_idx == 4) {
      br = tr;
      bc = tc;
    }

clang-format's avatar
clang-format committed
694
    if (iters_per_step > 1 && best_idx != -1) SECOND_LEVEL_CHECKS_BEST;
Jingning Han's avatar
Jingning Han committed
695
696
697
698
699
700
701
702
703
704
705
706
707
708

    tr = br;
    tc = bc;

    search_step += 4;
    hstep >>= 1;
    best_idx = -1;
  }

  // Each subsequent iteration checks at least one point in common with
  // the last iteration could be 2 ( if diag selected) 1/4 pel

  // These lines insure static analysis doesn't warn that
  // tr and tc aren't used after the above point.
clang-format's avatar
clang-format committed
709
710
  (void)tr;
  (void)tc;
Jingning Han's avatar
Jingning Han committed
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727

  bestmv->row = br;
  bestmv->col = bc;

  if ((abs(bestmv->col - ref_mv->col) > (MAX_FULL_PEL_VAL << 3)) ||
      (abs(bestmv->row - ref_mv->row) > (MAX_FULL_PEL_VAL << 3)))
    return INT_MAX;

  return besterr;
}

#undef MVC
#undef PRE
#undef CHECK_BETTER

static INLINE int check_bounds(const MACROBLOCK *x, int row, int col,
                               int range) {
clang-format's avatar
clang-format committed
728
729
  return ((row - range) >= x->mv_row_min) & ((row + range) <= x->mv_row_max) &
         ((col - range) >= x->mv_col_min) & ((col + range) <= x->mv_col_max);
Jingning Han's avatar
Jingning Han committed
730
731
732
733
734
735
736
}

static INLINE int is_mv_in(const MACROBLOCK *x, const MV *mv) {
  return (mv->col >= x->mv_col_min) && (mv->col <= x->mv_col_max) &&
         (mv->row >= x->mv_row_min) && (mv->row <= x->mv_row_max);
}

clang-format's avatar
clang-format committed
737
738
739
740
741
742
743
744
745
746
#define CHECK_BETTER                                                      \
  {                                                                       \
    if (thissad < bestsad) {                                              \
      if (use_mvcost)                                                     \
        thissad += mvsad_err_cost(x, &this_mv, &fcenter_mv, sad_per_bit); \
      if (thissad < bestsad) {                                            \
        bestsad = thissad;                                                \
        best_site = i;                                                    \
      }                                                                   \
    }                                                                     \
Jingning Han's avatar
Jingning Han committed
747
748
  }

clang-format's avatar
clang-format committed
749
750
751
#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
Jingning Han's avatar
Jingning Han committed
752
753

// Calculate and return a sad+mvcost list around an integer best pel.
clang-format's avatar
clang-format committed
754
static INLINE void calc_int_cost_list(const MACROBLOCK *x, const MV *ref_mv,
Jingning Han's avatar
Jingning Han committed
755
                                      int sadpb,
Yaowu Xu's avatar
Yaowu Xu committed
756
                                      const vpx_variance_fn_ptr_t *fn_ptr,
clang-format's avatar
clang-format committed
757
758
                                      const MV *best_mv, int *cost_list) {
  static const MV neighbors[4] = { { 0, -1 }, { 1, 0 }, { 0, 1 }, { -1, 0 } };
Jingning Han's avatar
Jingning Han committed
759
760
  const struct buf_2d *const what = &x->plane[0].src;
  const struct buf_2d *const in_what = &x->e_mbd.plane[0].pre[0];
clang-format's avatar
clang-format committed
761
  const MV fcenter_mv = { ref_mv->row >> 3, ref_mv->col >> 3 };
Jingning Han's avatar
Jingning Han committed
762
763
764
765
766
767
768
769
  int br = best_mv->row;
  int bc = best_mv->col;
  MV this_mv;
  int i;
  unsigned int sse;

  this_mv.row = br;
  this_mv.col = bc;
clang-format's avatar
clang-format committed
770
771
772
  cost_list[0] =
      fn_ptr->vf(what->buf, what->stride, get_buf_from_mv(in_what, &this_mv),
                 in_what->stride, &sse) +
Jingning Han's avatar
Jingning Han committed
773
774
775
      mvsad_err_cost(x, &this_mv, &fcenter_mv, sadpb);
  if (check_bounds(x, br, bc, 1)) {
    for (i = 0; i < 4; i++) {
clang-format's avatar
clang-format committed
776
      const MV this_mv = { br + neighbors[i].row, bc + neighbors[i].col };
Jingning Han's avatar
Jingning Han committed
777
778
779
      cost_list[i + 1] = fn_ptr->vf(what->buf, what->stride,
                                    get_buf_from_mv(in_what, &this_mv),
                                    in_what->stride, &sse) +
clang-format's avatar
clang-format committed
780
781
                         mv_err_cost(&this_mv, &fcenter_mv, x->nmvjointcost,
                                     x->mvcost, x->errorperbit);
Jingning Han's avatar
Jingning Han committed
782
783
784
    }
  } else {
    for (i = 0; i < 4; i++) {
clang-format's avatar
clang-format committed
785
      const MV this_mv = { br + neighbors[i].row, bc + neighbors[i].col };
Jingning Han's avatar
Jingning Han committed
786
787
788
789
790
791
      if (!is_mv_in(x, &this_mv))
        cost_list[i + 1] = INT_MAX;
      else
        cost_list[i + 1] = fn_ptr->vf(what->buf, what->stride,
                                      get_buf_from_mv(in_what, &this_mv),
                                      in_what->stride, &sse) +
clang-format's avatar
clang-format committed
792
793
                           mv_err_cost(&this_mv, &fcenter_mv, x->nmvjointcost,
                                       x->mvcost, x->errorperbit);
Jingning Han's avatar
Jingning Han committed
794
795
796
797
798
799
800
801
802
    }
  }
}

// Generic pattern search function that searches over multiple scales.
// Each scale can have a different number of candidates and shape of
// candidates as indicated in the num_candidates and candidates arrays
// passed into this function
//
clang-format's avatar
clang-format committed
803
804
805
806
807
808
static int vp10_pattern_search(
    const MACROBLOCK *x, MV *ref_mv, int search_param, int sad_per_bit,
    int do_init_search, int *cost_list, const vpx_variance_fn_ptr_t *vfp,
    int use_mvcost, const MV *center_mv, MV *best_mv,
    const int num_candidates[MAX_PATTERN_SCALES],
    const MV candidates[MAX_PATTERN_SCALES][MAX_PATTERN_CANDIDATES]) {
Jingning Han's avatar
Jingning Han committed
809
810
811
812
813
814
815
816
817
818
819
  const MACROBLOCKD *const xd = &x->e_mbd;
  static const int search_param_to_steps[MAX_MVSEARCH_STEPS] = {
    10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
  };
  int i, s, t;
  const struct buf_2d *const what = &x->plane[0].src;
  const struct buf_2d *const in_what = &xd->plane[0].pre[0];
  int br, bc;
  int bestsad = INT_MAX;
  int thissad;
  int k = -1;
clang-format's avatar
clang-format committed
820
  const MV fcenter_mv = { center_mv->row >> 3, center_mv->col >> 3 };
Jingning Han's avatar
Jingning Han committed
821
822
823
824
825
826
827
  int best_init_s = search_param_to_steps[search_param];
  // adjust ref_mv to make sure it is within MV range
  clamp_mv(ref_mv, x->mv_col_min, x->mv_col_max, x->mv_row_min, x->mv_row_max);
  br = ref_mv->row;
  bc = ref_mv->col;

  // Work out the start point for the search
clang-format's avatar
clang-format committed
828
829
830
  bestsad = vfp->sdf(what->buf, what->stride, get_buf_from_mv(in_what, ref_mv),
                     in_what->stride) +
            mvsad_err_cost(x, ref_mv, &fcenter_mv, sad_per_bit);
Jingning Han's avatar
Jingning Han committed
831
832
833
834
835
836
837
838
839
840
841

  // Search all possible scales upto the search param around the center point
  // pick the scale of the point that is best as the starting scale of
  // further steps around it.
  if (do_init_search) {
    s = best_init_s;
    best_init_s = -1;
    for (t = 0; t <= s; ++t) {
      int best_site = -1;
      if (check_bounds(x, br, bc, 1 << t)) {
        for (i = 0; i < num_candidates[t]; i++) {
clang-format's avatar
clang-format committed
842
843
844
845
846
          const MV this_mv = { br + candidates[t][i].row,
                               bc + candidates[t][i].col };
          thissad =
              vfp->sdf(what->buf, what->stride,
                       get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
847
848
849
850
          CHECK_BETTER
        }
      } else {
        for (i = 0; i < num_candidates[t]; i++) {
clang-format's avatar
clang-format committed
851
852
853
854
855
856
          const MV this_mv = { br + candidates[t][i].row,
                               bc + candidates[t][i].col };
          if (!is_mv_in(x, &this_mv)) continue;
          thissad =
              vfp->sdf(what->buf, what->stride,
                       get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
          CHECK_BETTER
        }
      }
      if (best_site == -1) {
        continue;
      } else {
        best_init_s = t;
        k = best_site;
      }
    }
    if (best_init_s != -1) {
      br += candidates[best_init_s][k].row;
      bc += candidates[best_init_s][k].col;
    }
  }

  // If the center point is still the best, just skip this and move to
  // the refinement step.
  if (best_init_s != -1) {
    int best_site = -1;
    s = best_init_s;

    do {
      // No need to search all 6 points the 1st time if initial search was used
      if (!do_init_search || s != best_init_s) {
        if (check_bounds(x, br, bc, 1 << s)) {
          for (i = 0; i < num_candidates[s]; i++) {
clang-format's avatar
clang-format committed
884
885
886
887
888
            const MV this_mv = { br + candidates[s][i].row,
                                 bc + candidates[s][i].col };
            thissad =
                vfp->sdf(what->buf, what->stride,
                         get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
889
890
891
892
            CHECK_BETTER
          }
        } else {
          for (i = 0; i < num_candidates[s]; i++) {
clang-format's avatar
clang-format committed
893
894
895
896
897
898
            const MV this_mv = { br + candidates[s][i].row,
                                 bc + candidates[s][i].col };
            if (!is_mv_in(x, &this_mv)) continue;
            thissad =
                vfp->sdf(what->buf, what->stride,
                         get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
            CHECK_BETTER
          }
        }

        if (best_site == -1) {
          continue;
        } else {
          br += candidates[s][best_site].row;
          bc += candidates[s][best_site].col;
          k = best_site;
        }
      }

      do {
        int next_chkpts_indices[PATTERN_CANDIDATES_REF];
        best_site = -1;
        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++) {
clang-format's avatar
clang-format committed
921
922
923
924
925
926
927
            const MV this_mv = {
              br + candidates[s][next_chkpts_indices[i]].row,
              bc + candidates[s][next_chkpts_indices[i]].col
            };
            thissad =
                vfp->sdf(what->buf, what->stride,
                         get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
928
929
930
931
            CHECK_BETTER
          }
        } else {
          for (i = 0; i < PATTERN_CANDIDATES_REF; i++) {
clang-format's avatar
clang-format committed
932
933
934
935
936
937
938
939
            const MV this_mv = {
              br + candidates[s][next_chkpts_indices[i]].row,
              bc + candidates[s][next_chkpts_indices[i]].col
            };
            if (!is_mv_in(x, &this_mv)) continue;
            thissad =
                vfp->sdf(what->buf, what->stride,
                         get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
            CHECK_BETTER
          }
        }

        if (best_site != -1) {
          k = next_chkpts_indices[best_site];
          br += candidates[s][k].row;
          bc += candidates[s][k].col;
        }
      } while (best_site != -1);
    } while (s--);
  }

  // Returns the one-away integer pel sad values around the best as follows:
  // cost_list[0]: cost at the best integer pel
  // cost_list[1]: cost at delta {0, -1} (left)   from the best integer pel
  // cost_list[2]: cost at delta { 1, 0} (bottom) from the best integer pel
  // cost_list[3]: cost at delta { 0, 1} (right)  from the best integer pel
  // cost_list[4]: cost at delta {-1, 0} (top)    from the best integer pel
  if (cost_list) {
    const MV best_mv = { br, bc };
    calc_int_cost_list(x, &fcenter_mv, sad_per_bit, vfp, &best_mv, cost_list);
  }
  best_mv->row = br;
  best_mv->col = bc;
  return bestsad;
}

// A specialized function where the smallest scale search candidates
// are 4 1-away neighbors, and cost_list is non-null
// TODO(debargha): Merge this function with the one above. Also remove
// use_mvcost option since it is always 1, to save unnecessary branches.
clang-format's avatar
clang-format committed
972
973
974
975
976
977
static int vp10_pattern_search_sad(
    const MACROBLOCK *x, MV *ref_mv, int search_param, int sad_per_bit,
    int do_init_search, int *cost_list, const vpx_variance_fn_ptr_t *vfp,
    int use_mvcost, const MV *center_mv, MV *best_mv,
    const int num_candidates[MAX_PATTERN_SCALES],
    const MV candidates[MAX_PATTERN_SCALES][MAX_PATTERN_CANDIDATES]) {
Jingning Han's avatar
Jingning Han committed
978
979
980
981
982
983
984
985
986
987
988
  const MACROBLOCKD *const xd = &x->e_mbd;
  static const int search_param_to_steps[MAX_MVSEARCH_STEPS] = {
    10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0,
  };
  int i, s, t;
  const struct buf_2d *const what = &x->plane[0].src;
  const struct buf_2d *const in_what = &xd->plane[0].pre[0];
  int br, bc;
  int bestsad = INT_MAX;
  int thissad;
  int k = -1;
clang-format's avatar
clang-format committed
989
  const MV fcenter_mv = { center_mv->row >> 3, center_mv->col >> 3 };
Jingning Han's avatar
Jingning Han committed
990
991
992
993
994
995
996
997
998
999
1000
  int best_init_s = search_param_to_steps[search_param];
  // adjust ref_mv to make sure it is within MV range
  clamp_mv(ref_mv, x->mv_col_min, x->mv_col_max, x->mv_row_min, x->mv_row_max);
  br = ref_mv->row;
  bc = ref_mv->col;
  if (cost_list != NULL) {
    cost_list[0] = cost_list[1] = cost_list[2] = cost_list[3] = cost_list[4] =
        INT_MAX;
  }

  // Work out the start point for the search
clang-format's avatar
clang-format committed
1001
1002
1003
  bestsad = vfp->sdf(what->buf, what->stride, get_buf_from_mv(in_what, ref_mv),
                     in_what->stride) +
            mvsad_err_cost(x, ref_mv, &fcenter_mv, sad_per_bit);
Jingning Han's avatar
Jingning Han committed
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014

  // Search all possible scales upto the search param around the center point
  // pick the scale of the point that is best as the starting scale of
  // further steps around it.
  if (do_init_search) {
    s = best_init_s;
    best_init_s = -1;
    for (t = 0; t <= s; ++t) {
      int best_site = -1;
      if (check_bounds(x, br, bc, 1 << t)) {
        for (i = 0; i < num_candidates[t]; i++) {
clang-format's avatar
clang-format committed
1015
1016
1017
1018
1019
          const MV this_mv = { br + candidates[t][i].row,
                               bc + candidates[t][i].col };
          thissad =
              vfp->sdf(what->buf, what->stride,
                       get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
1020
1021
1022
1023
          CHECK_BETTER
        }
      } else {
        for (i = 0; i < num_candidates[t]; i++) {
clang-format's avatar
clang-format committed
1024
1025
1026
1027
1028
1029
          const MV this_mv = { br + candidates[t][i].row,
                               bc + candidates[t][i].col };
          if (!is_mv_in(x, &this_mv)) continue;
          thissad =
              vfp->sdf(what->buf, what->stride,
                       get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
          CHECK_BETTER
        }
      }
      if (best_site == -1) {
        continue;
      } else {
        best_init_s = t;
        k = best_site;
      }
    }
    if (best_init_s != -1) {
      br += candidates[best_init_s][k].row;
      bc += candidates[best_init_s][k].col;
    }
  }

  // If the center point is still the best, just skip this and move to
  // the refinement step.
  if (best_init_s != -1) {
    int do_sad = (num_candidates[0] == 4 && cost_list != NULL);
    int best_site = -1;
    s = best_init_s;

    for (; s >= do_sad; s--) {
      if (!do_init_search || s != best_init_s) {
        if (check_bounds(x, br, bc, 1 << s)) {
          for (i = 0; i < num_candidates[s]; i++) {
clang-format's avatar
clang-format committed
1057
1058
1059
1060
1061
            const MV this_mv = { br + candidates[s][i].row,
                                 bc + candidates[s][i].col };
            thissad =
                vfp->sdf(what->buf, what->stride,
                         get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
1062
1063
1064
1065
            CHECK_BETTER
          }
        } else {
          for (i = 0; i < num_candidates[s]; i++) {
clang-format's avatar
clang-format committed
1066
1067
1068
1069
1070
1071
            const MV this_mv = { br + candidates[s][i].row,
                                 bc + candidates[s][i].col };
            if (!is_mv_in(x, &this_mv)) continue;
            thissad =
                vfp->sdf(what->buf, what->stride,
                         get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
            CHECK_BETTER
          }
        }

        if (best_site == -1) {
          continue;
        } else {
          br += candidates[s][best_site].row;
          bc += candidates[s][best_site].col;
          k = best_site;
        }
      }

      do {
        int next_chkpts_indices[PATTERN_CANDIDATES_REF];
        best_site = -1;
        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++) {
clang-format's avatar
clang-format committed
1094
1095
1096
1097
1098
1099
1100
            const MV this_mv = {
              br + candidates[s][next_chkpts_indices[i]].row,
              bc + candidates[s][next_chkpts_indices[i]].col
            };
            thissad =
                vfp->sdf(what->buf, what->stride,
                         get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
1101
1102
1103
1104
            CHECK_BETTER
          }
        } else {
          for (i = 0; i < PATTERN_CANDIDATES_REF; i++) {
clang-format's avatar
clang-format committed
1105
1106
1107
1108
1109
1110
1111
1112
            const MV this_mv = {
              br + candidates[s][next_chkpts_indices[i]].row,
              bc + candidates[s][next_chkpts_indices[i]].col
            };
            if (!is_mv_in(x, &this_mv)) continue;
            thissad =
                vfp->sdf(what->buf, what->stride,
                         get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
            CHECK_BETTER
          }
        }

        if (best_site != -1) {
          k = next_chkpts_indices[best_site];
          br += candidates[s][k].row;
          bc += candidates[s][k].col;
        }
      } while (best_site != -1);
    }

    // Note: If we enter the if below, then cost_list must be non-NULL.
    if (s == 0) {
      cost_list[0] = bestsad;
      if (!do_init_search || s != best_init_s) {
        if (check_bounds(x, br, bc, 1 << s)) {
          for (i = 0; i < num_candidates[s]; i++) {
clang-format's avatar
clang-format committed
1131
1132
1133
1134
1135
            const MV this_mv = { br + candidates[s][i].row,
                                 bc + candidates[s][i].col };
            cost_list[i + 1] = thissad =
                vfp->sdf(what->buf, what->stride,
                         get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
1136
1137
1138
1139
            CHECK_BETTER
          }
        } else {
          for (i = 0; i < num_candidates[s]; i++) {
clang-format's avatar
clang-format committed
1140
1141
1142
1143
1144
1145
            const MV this_mv = { br + candidates[s][i].row,
                                 bc + candidates[s][i].col };
            if (!is_mv_in(x, &this_mv)) continue;
            cost_list[i + 1] = thissad =
                vfp->sdf(what->buf, what->stride,
                         get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
            CHECK_BETTER
          }
        }

        if (best_site != -1) {
          br += candidates[s][best_site].row;
          bc += candidates[s][best_site].col;
          k = best_site;
        }
      }
      while (best_site != -1) {
        int next_chkpts_indices[PATTERN_CANDIDATES_REF];
        best_site = -1;
        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;
        cost_list[1] = cost_list[2] = cost_list[3] = cost_list[4] = INT_MAX;
        cost_list[((k + 2) % 4) + 1] = cost_list[0];
        cost_list[0] = bestsad;

        if (check_bounds(x, br, bc, 1 << s)) {
          for (i = 0; i < PATTERN_CANDIDATES_REF; i++) {
clang-format's avatar
clang-format committed
1168
1169
1170
1171
1172
1173
1174
            const MV this_mv = {
              br + candidates[s][next_chkpts_indices[i]].row,
              bc + candidates[s][next_chkpts_indices[i]].col
            };
            cost_list[next_chkpts_indices[i] + 1] = thissad =
                vfp->sdf(what->buf, what->stride,
                         get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
1175
1176
1177
1178
            CHECK_BETTER
          }
        } else {
          for (i = 0; i < PATTERN_CANDIDATES_REF; i++) {
clang-format's avatar
clang-format committed
1179
1180
1181
1182
            const MV this_mv = {
              br + candidates[s][next_chkpts_indices[i]].row,
              bc + candidates[s][next_chkpts_indices[i]].col
            };
Jingning Han's avatar
Jingning Han committed
1183
1184
1185
1186
            if (!is_mv_in(x, &this_mv)) {
              cost_list[next_chkpts_indices[i] + 1] = INT_MAX;
              continue;
            }
clang-format's avatar
clang-format committed
1187
1188
1189
            cost_list[next_chkpts_indices[i] + 1] = thissad =
                vfp->sdf(what->buf, what->stride,
                         get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
            CHECK_BETTER
          }
        }

        if (best_site != -1) {
          k = next_chkpts_indices[best_site];
          br += candidates[s][k].row;
          bc += candidates[s][k].col;
        }
      }
    }
  }

  // Returns the one-away integer pel sad values around the best as follows:
  // cost_list[0]: sad at the best integer pel
  // cost_list[1]: sad at delta {0, -1} (left)   from the best integer pel
  // cost_list[2]: sad at delta { 1, 0} (bottom) from the best integer pel
  // cost_list[3]: sad at delta { 0, 1} (right)  from the best integer pel
  // cost_list[4]: sad at delta {-1, 0} (top)    from the best integer pel
  if (cost_list) {
clang-format's avatar
clang-format committed
1210
    static const MV neighbors[4] = { { 0, -1 }, { 1, 0 }, { 0, 1 }, { -1, 0 } };
Jingning Han's avatar
Jingning Han committed
1211
1212
1213
1214
    if (cost_list[0] == INT_MAX) {
      cost_list[0] = bestsad;
      if (check_bounds(x, br, bc, 1)) {
        for (i = 0; i < 4; i++) {
clang-format's avatar
clang-format committed
1215
1216
1217
1218
          const MV this_mv = { br + neighbors[i].row, bc + neighbors[i].col };
          cost_list[i + 1] =
              vfp->sdf(what->buf, what->stride,
                       get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
1219
1220
1221
        }
      } else {
        for (i = 0; i < 4; i++) {
clang-format's avatar
clang-format committed
1222
          const MV this_mv = { br + neighbors[i].row, bc + neighbors[i].col };
Jingning Han's avatar
Jingning Han committed
1223
1224
1225
          if (!is_mv_in(x, &this_mv))
            cost_list[i + 1] = INT_MAX;
          else
clang-format's avatar
clang-format committed
1226
1227
1228
            cost_list[i + 1] =
                vfp->sdf(what->buf, what->stride,
                         get_buf_from_mv(in_what, &this_mv), in_what->stride);
Jingning Han's avatar
Jingning Han committed
1229
1230
1231
1232
1233
        }
      }
    } else {
      if (use_mvcost) {
        for (i = 0; i < 4; i++) {
clang-format's avatar
clang-format committed
1234
          const MV this_mv = { br + neighbors[i].row, bc + neighbors[i].col };
Jingning Han's avatar
Jingning Han committed
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
          if (cost_list[i + 1] != INT_MAX) {
            cost_list[i + 1] +=
                mvsad_err_cost(x, &this_mv, &fcenter_mv, sad_per_bit);
          }
        }
      }
    }
  }
  best_mv->row = br;
  best_mv->col = bc;
  return bestsad;
}

clang-format's avatar
clang-format committed
1248
1249
1250
int vp10_get_mvpred_var(const MACROBLOCK *x, const MV *best_mv,
                        const MV *center_mv, const vpx_variance_fn_ptr_t *vfp,
                        int use_mvcost) {
Jingning Han's avatar
Jingning Han committed
1251
1252
1253
  const MACROBLOCKD *const xd = &x->e_mbd;
  const struct buf_2d *const what = &x->plane[0].src;
  const struct buf_2d *const in_what = &xd->plane[0].pre[0];
clang-format's avatar
clang-format committed
1254
  const MV mv = { best_mv->row * 8, best_mv->col * 8 };
Jingning Han's avatar
Jingning Han committed
1255
1256
  unsigned int unused;

clang-format's avatar
clang-format committed
1257
1258
1259
1260
1261
  return vfp->vf(what->buf, what->stride, get_buf_from_mv(in_what, best_mv),
                 in_what->stride, &unused) +
         (use_mvcost ? mv_err_cost(&mv, center_mv, x->nmvjointcost, x->mvcost,
                                   x->errorperbit)
                     : 0);
Jingning Han's avatar
Jingning Han committed
1262
1263
}

clang-format's avatar
clang-format committed
1264
1265
1266
int vp10_get_mvpred_av_var(const MACROBLOCK *x, const MV *best_mv,
                           const MV *center_mv, const uint8_t *second_pred,
                           const vpx_variance_fn_ptr_t *vfp, int use_mvcost) {
Jingning Han's avatar
Jingning Han committed
1267
1268
1269
  const MACROBLOCKD *const xd = &x->e_mbd;
  const struct buf_2d *const what = &x->plane[0].src;
  const struct buf_2d *const in_what = &xd->plane[0].pre[0];
clang-format's avatar
clang-format committed
1270
  const MV mv = { best_mv->row * 8, best_mv->col * 8 };
Jingning Han's avatar
Jingning Han committed
1271
1272
1273
1274
  unsigned int unused;

  return vfp->svaf(get_buf_from_mv(in_what, best_mv), in_what->stride, 0, 0,
                   what->buf, what->stride, &unused, second_pred) +
clang-format's avatar
clang-format committed
1275
1276
1277
         (use_mvcost ? mv_err_cost(&mv, center_mv, x->nmvjointcost, x->mvcost,
                                   x->errorperbit)
                     : 0);
Jingning Han's avatar
Jingning Han committed
1278
1279
}

clang-format's avatar
clang-format committed
1280
1281
1282
1283
int vp10_hex_search(const MACROBLOCK *x, MV *ref_mv, int search_param,
                    int sad_per_bit, int do_init_search, int *cost_list,
                    const vpx_variance_fn_ptr_t *vfp, int use_mvcost,
                    const MV *center_mv, MV *best_mv) {
Jingning Han's avatar
Jingning Han committed
1284
1285
  // First scale has 8-closest points, the rest have 6 points in hex shape
  // at increasing scales
clang-format's avatar
clang-format committed
1286
1287
  static const int hex_num_candidates[MAX_PATTERN_SCALES] = { 8, 6, 6, 6, 6, 6,
                                                              6, 6, 6, 6, 6 };
Jingning Han's avatar
Jingning Han committed
1288
1289
  // Note that the largest candidate step at each scale is 2^scale
  static const MV hex_candidates[MAX_PATTERN_SCALES][MAX_PATTERN_CANDIDATES] = {
clang-format's avatar
clang-format committed
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
    { { -1, -1 },
      { 0, -1 },
      { 1, -1 },
      { 1, 0 },
      { 1, 1 },
      { 0, 1 },
      { -1, 1 },
      { -1, 0 } },
    { { -1, -2 }, { 1, -2 }, { 2, 0 }, { 1, 2 }, { -1, 2 }, { -2, 0 } },
    { { -2, -4 }, { 2, -4 }, { 4, 0 }, { 2, 4 }, { -2, 4 }, { -4, 0 } },
    { { -4, -8 }, { 4, -8 }, { 8, 0 }, { 4, 8 }, { -4, 8 }, { -8, 0 } },
    { { -8, -16 }, { 8, -16 }, { 16, 0 }, { 8, 16 }, { -8, 16 }, { -16, 0 } },
    { { -16, -32 },
      { 16, -32 },
      { 32, 0 },
      { 16, 32 },
      { -16, 32 },
      { -32, 0 } },
    { { -32, -64 },
      { 32, -64 },
      { 64, 0 },
      { 32, 64 },
      { -32, 64 },
      { -64, 0 } },
    { { -64, -128 },
      { 64, -128 },
      { 128, 0 },
      { 64, 128 },
      { -64, 128 },
      { -128, 0 } },
    { { -128, -256 },
      { 128, -256 },
      { 256, 0 },
      { 128, 256 },
      { -128, 256 },
      { -256, 0 } },
    { { -256, -512 },
      { 256, -512 },
      { 512, 0 },
      { 256, 512 },
      { -256, 512 },
      { -512, 0 } },
    { { -512, -1024 },
      { 512, -1024 },
      { 1024, 0 },
      { 512, 1024 },
      { -512, 1024 },
      { -1024, 0 } },
Jingning Han's avatar
Jingning Han committed
1338
  };
clang-format's avatar
clang-format committed
1339
1340
1341
  return vp10_pattern_search(
      x, ref_mv, search_param, sad_per_bit, do_init_search, cost_list, vfp,
      use_mvcost, center_mv, best_mv, hex_num_candidates, hex_candidates);
Jingning Han's avatar
Jingning Han committed
1342
1343
}

clang-format's avatar
clang-format committed
1344
1345
1346
1347
int vp10_bigdia_search(const MACROBLOCK *x, MV *ref_mv, int search_param,
                       int sad_per_bit, int do_init_search, int *cost_list,
                       const vpx_variance_fn_ptr_t *vfp, int use_mvcost,
                       const MV *center_mv, MV *best_mv) {
Jingning Han's avatar
Jingning Han committed
1348
1349
1350
1351
1352
1353
  // First scale has 4-closest points, the rest have 8 points in diamond
  // shape at increasing scales
  static const int bigdia_num_candidates[MAX_PATTERN_SCALES] = {
    4, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
  };
  // Note that the largest candidate step at each scale is 2^scale
clang-format's avatar
clang-format committed
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
  static const MV
      bigdia_candidates[MAX_PATTERN_SCALES][MAX_PATTERN_CANDIDATES] = {
        { { 0, -1 }, { 1, 0 }, { 0, 1 }, { -1, 0 } },
        { { -1, -1 },
          { 0, -2 },
          { 1, -1 },
          { 2, 0 },
          { 1, 1 },
          { 0, 2 },
          { -1, 1 },
          { -2, 0 } },
        { { -2, -2 },
          { 0, -4 },
          { 2, -2 },
          { 4, 0 },
          { 2, 2 },
          { 0, 4 },
          { -2, 2 },
          { -4, 0 } },
        { { -4, -4 },
          { 0, -8 },
          { 4, -4 },
          { 8, 0 },
          { 4, 4 },
          { 0, 8 },
          { -4, 4 },
          { -8, 0 } },
        { { -8, -8 },
          { 0, -16 },
          { 8, -8 },
          { 16, 0 },
          { 8, 8 },
          { 0, 16 },
          { -8, 8 },
          { -16, 0 } },
        { { -16, -16 },
          { 0, -32 },
          { 16, -16 },
          { 32, 0 },
          { 16, 16 },
          { 0, 32 },
          { -16, 16 },
          { -32, 0 } },
        { { -32, -32 },
          { 0, -64 },
          { 32, -32 },
          { 64, 0 },
          { 32, 32 },
          { 0, 64 },
          { -32, 32 },
          { -64, 0 } },
        { { -64, -64 },
          { 0, -128 },
          { 64, -64 },
          { 128, 0 },
          { 64, 64 },
          { 0, 128 },
          { -64, 64 },
          { -128, 0 } },
        { { -128, -128 },
          { 0, -256 },
          { 128, -128 },
          { 256, 0 },
          { 128, 128 },
          { 0, 256 },
          { -128, 128 },
          { -256, 0 } },
        { { -256, -256 },
          { 0, -512 },
          { 256, -256 },
          { 512, 0 },
          { 256, 256 },
          { 0, 512 },
          { -256, 256 },
          { -512, 0 } },
        { { -512, -512 },
          { 0, -1024 },
          { 512, -512 },
          { 1024, 0 },
          { 512, 512 },
          { 0, 1024 },
          { -512, 512 },
          { -1024, 0 } },
      };
  return vp10_pattern_search_sad(
      x, ref_mv, search_param, sad_per_bit, do_init_search, cost_list, vfp,
      use_mvcost, center_mv, best_mv, bigdia_num_candidates, bigdia_candidates);
Jingning Han's avatar
Jingning Han committed
1441
1442
}

clang-format's avatar
clang-format committed
1443
1444
1445
1446
int vp10_square_search(const MACROBLOCK *x, MV *ref_mv, int search_param,
                       int sad_per_bit, int do_init_search, int *cost_list,
                       const vpx_variance_fn_ptr_t *vfp, int use_mvcost,
                       const MV *center_mv, MV *best_mv) {
Jingning Han's avatar
Jingning Han committed
1447
1448
1449
1450
1451
  // All scales have 8 closest points in square shape
  static const int square_num_candidates[MAX_PATTERN_SCALES] = {
    8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
  };
  // Note that the largest candidate step at each scale is 2^scale
clang-format's avatar
clang-format committed
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
  static const MV
      square_candidates[MAX_PATTERN_SCALES][MAX_PATTERN_CANDIDATES] = {
        { { -1, -1 },
          { 0, -1 },
          { 1, -1 },
          { 1, 0 },
          { 1, 1 },
          { 0, 1 },
          { -1, 1 },
          { -1, 0 } },
        { { -2, -2 },
          { 0, -2 },
          { 2, -2 },
          { 2, 0 },
          { 2, 2 },
          { 0, 2 },
          { -2, 2 },
          { -2, 0 } },
        { { -4, -4 },
          { 0, -4 },
          { 4, -4 },
          { 4, 0 },
          { 4, 4 },
          { 0, 4 },
          { -4, 4 },
          { -4, 0 } },
        { { -8, -8 },
          { 0, -8 },
          { 8, -8 },
          { 8, 0 },
          { 8, 8 },
          { 0, 8 },
          { -8, 8 },
          { -8, 0 } },
        { { -16, -16 },
          { 0, -16 },
          { 16, -16 },
          { 16, 0 },
          { 16, 16 },
          { 0, 16 },
          { -16, 16 },
          { -16, 0 } },
        { { -32, -32 },
          { 0, -32 },
          { 32, -32 },
          { 32, 0 },
          { 32, 32 },
          { 0, 32 },
          { -32, 32 },
          { -32, 0 } },
        { { -64, -64 },
          { 0, -64 },
          { 64, -64 },
          { 64, 0 },
          { 64, 64 },
          { 0, 64 },
          { -64, 64 },
          { -64, 0 } },
        { { -128, -128 },
          { 0, -128 },
          { 128, -128 },
          { 128, 0 },
          { 128, 128 },
          { 0, 128 },
          { -128, 128 },
          { -128, 0 } },
        { { -256, -256 },
          { 0, -256 },
          { 256, -256 },
          { 256, 0 },
          { 256, 256 },
          { 0, 256 },
          { -256, 256 },
          { -256, 0 } },
        { { -512, -512 },
          { 0, -512 },
          { 512, -512 },
          { 512, 0 },
          { 512, 512 },
          { 0, 512 },
          { -512, 512 },
          { -512, 0 } },
        { { -1024, -1024 },
          { 0, -1024 },
          { 1024, -1024 },
          { 1024, 0 },
          { 1024, 1024 },
          { 0, 1024 },
          { -1024, 1024 },
          { -1024, 0 } },
      };
  return vp10_pattern_search(
      x, ref_mv, search_param, sad_per_bit, do_init_search, cost_list, vfp,
      use_mvcost, center_mv, best_mv, square_num_candidates, square_candidates);
Jingning Han's avatar
Jingning Han committed
1546
1547
}

clang-format's avatar
clang-format committed
1548
1549
1550
1551
1552
int vp10_fast_hex_search(const MACROBLOCK *x, MV *ref_mv, int search_param,
                         int sad_per_bit,
                         int do_init_search,  // must be zero for fast_hex
                         int *cost_list, const vpx_variance_fn_ptr_t *vfp,
                         int use_mvcost, const MV *center_mv, MV *best_mv) {
1553
1554
1555
  return vp10_hex_search(
      x, ref_mv, VPXMAX(MAX_MVSEARCH_STEPS - 2, search_param), sad_per_bit,
      do_init_search, cost_list, vfp, use_mvcost, center_mv, best_mv);
Jingning Han's avatar
Jingning Han committed
1556
1557
}

clang-format's avatar
clang-format committed
1558
1559
1560
1561
int vp10_fast_dia_search(const MACROBLOCK *x, MV *ref_mv, int search_param,
                         int sad_per_bit, int do_init_search, int *cost_list,
                         const vpx_variance_fn_ptr_t *vfp, int use_mvcost,
                         const MV *center_mv, MV *best_mv) {
1562
1563
1564
  return vp10_bigdia_search(
      x, ref_mv, VPXMAX(MAX_MVSEARCH_STEPS - 2, search_param), sad_per_bit,
      do_init_search, cost_list, vfp, use_mvcost, center_mv, best_mv);
Jingning Han's avatar
Jingning Han committed
1565
1566
1567
1568
}

#undef CHECK_BETTER

1569
1570
// Exhuastive motion search around a given centre position with a given
// step size.
clang-format's avatar
clang-format committed
1571
static int exhuastive_mesh_search(const MACROBLOCK *x, MV *ref_mv, MV *best_mv,
1572
                                  int range, int step, int sad_per_bit,
Yaowu Xu's avatar
Yaowu Xu committed
1573
                                  const vpx_variance_fn_ptr_t *fn_ptr,
1574
                                  const MV *center_mv) {
Jingning Han's avatar
Jingning Han committed
1575
1576
1577
  const MACROBLOCKD *const xd = &x->e_mbd;
  const struct buf_2d *const what = &x->plane[0].src;
  const struct buf_2d *const in_what = &xd->plane[0].pre[0];
clang-format's avatar
clang-format committed
1578
  MV fcenter_mv = { center_mv->row, center_mv->col };
Jingning Han's avatar
Jingning Han committed
1579
1580
1581
  unsigned int best_sad = INT_MAX;
  int r, c, i;
  int start_col, end_col, start_row, end_row;
1582
  int col_step = (step > 1) ? step : 4;
Jingning Han's avatar
Jingning Han committed
1583

1584
  assert(step >= 1);
Jingning Han's avatar
Jingning Han committed
1585

clang-format's avatar
clang-format committed
1586
1587
  clamp_mv(&fcenter_mv, x->mv_col_min, x->mv_col_max, x->mv_row_min,
           x->mv_row_max);
1588
  *best_mv = fcenter_mv;
clang-format's avatar
clang-format committed
1589
1590
1591
1592
  best_sad =
      fn_ptr->sdf(what->buf,