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.
14 #include "vpx_mem/vpx_mem.h"
15 #include "vpx_config.h"
19 #include "vp8/common/findnearmv.h"
21 #ifdef VP8_ENTROPY_STATS
22 static int mv_ref_ct [31] [4] [2];
23 static int mv_mode_cts [4] [2];
26 int vp8_mv_bit_cost(int_mv *mv, int_mv *ref, int *mvcost[2], int Weight)
28 /* MV costing is based on the distribution of vectors in the previous
29 * frame and as such will tend to over state the cost of vectors. In
30 * addition coding a new vector can have a knock on effect on the cost
31 * of subsequent vectors and the quality of prediction from NEAR and
32 * NEAREST for subsequent blocks. The "Weight" parameter allows, to a
33 * limited extent, for some account to be taken of these factors.
35 return ((mvcost[0][(mv->as_mv.row - ref->as_mv.row) >> 1] + mvcost[1][(mv->as_mv.col - ref->as_mv.col) >> 1]) * Weight) >> 7;
38 static int mv_err_cost(int_mv *mv, int_mv *ref, int *mvcost[2], int error_per_bit)
40 /* Ignore mv costing if mvcost is NULL */
42 return ((mvcost[0][(mv->as_mv.row - ref->as_mv.row) >> 1] +
43 mvcost[1][(mv->as_mv.col - ref->as_mv.col) >> 1])
44 * error_per_bit + 128) >> 8;
48 static int mvsad_err_cost(int_mv *mv, int_mv *ref, int *mvsadcost[2], int error_per_bit)
50 /* Calculate sad error cost on full pixel basis. */
51 /* Ignore mv costing if mvsadcost is NULL */
53 return ((mvsadcost[0][(mv->as_mv.row - ref->as_mv.row)] +
54 mvsadcost[1][(mv->as_mv.col - ref->as_mv.col)])
55 * error_per_bit + 128) >> 8;
59 void vp8_init_dsmotion_compensation(MACROBLOCK *x, int stride)
62 int search_site_count = 0;
65 /* Generate offsets for 4 search sites per step. */
67 x->ss[search_site_count].mv.col = 0;
68 x->ss[search_site_count].mv.row = 0;
69 x->ss[search_site_count].offset = 0;
75 /* Compute offsets for search sites. */
76 x->ss[search_site_count].mv.col = 0;
77 x->ss[search_site_count].mv.row = -Len;
78 x->ss[search_site_count].offset = -Len * stride;
81 /* Compute offsets for search sites. */
82 x->ss[search_site_count].mv.col = 0;
83 x->ss[search_site_count].mv.row = Len;
84 x->ss[search_site_count].offset = Len * stride;
87 /* Compute offsets for search sites. */
88 x->ss[search_site_count].mv.col = -Len;
89 x->ss[search_site_count].mv.row = 0;
90 x->ss[search_site_count].offset = -Len;
93 /* Compute offsets for search sites. */
94 x->ss[search_site_count].mv.col = Len;
95 x->ss[search_site_count].mv.row = 0;
96 x->ss[search_site_count].offset = Len;
103 x->ss_count = search_site_count;
104 x->searches_per_step = 4;
107 void vp8_init3smotion_compensation(MACROBLOCK *x, int stride)
110 int search_site_count = 0;
112 /* Generate offsets for 8 search sites per step. */
113 Len = MAX_FIRST_STEP;
114 x->ss[search_site_count].mv.col = 0;
115 x->ss[search_site_count].mv.row = 0;
116 x->ss[search_site_count].offset = 0;
122 /* Compute offsets for search sites. */
123 x->ss[search_site_count].mv.col = 0;
124 x->ss[search_site_count].mv.row = -Len;
125 x->ss[search_site_count].offset = -Len * stride;
128 /* Compute offsets for search sites. */
129 x->ss[search_site_count].mv.col = 0;
130 x->ss[search_site_count].mv.row = Len;
131 x->ss[search_site_count].offset = Len * stride;
134 /* Compute offsets for search sites. */
135 x->ss[search_site_count].mv.col = -Len;
136 x->ss[search_site_count].mv.row = 0;
137 x->ss[search_site_count].offset = -Len;
140 /* Compute offsets for search sites. */
141 x->ss[search_site_count].mv.col = Len;
142 x->ss[search_site_count].mv.row = 0;
143 x->ss[search_site_count].offset = Len;
146 /* Compute offsets for search sites. */
147 x->ss[search_site_count].mv.col = -Len;
148 x->ss[search_site_count].mv.row = -Len;
149 x->ss[search_site_count].offset = -Len * stride - Len;
152 /* Compute offsets for search sites. */
153 x->ss[search_site_count].mv.col = Len;
154 x->ss[search_site_count].mv.row = -Len;
155 x->ss[search_site_count].offset = -Len * stride + Len;
158 /* Compute offsets for search sites. */
159 x->ss[search_site_count].mv.col = -Len;
160 x->ss[search_site_count].mv.row = Len;
161 x->ss[search_site_count].offset = Len * stride - Len;
164 /* Compute offsets for search sites. */
165 x->ss[search_site_count].mv.col = Len;
166 x->ss[search_site_count].mv.row = Len;
167 x->ss[search_site_count].offset = Len * stride + Len;
175 x->ss_count = search_site_count;
176 x->searches_per_step = 8;
180 * To avoid the penalty for crossing cache-line read, preload the reference
181 * area in a small buffer, which is aligned to make sure there won't be crossing
182 * cache-line read while reading from this buffer. This reduced the cpu
183 * cycles spent on reading ref data in sub-pixel filter functions.
184 * TODO: Currently, since sub-pixel search range here is -3 ~ 3, copy 22 rows x
185 * 32 cols area that is enough for 16x16 macroblock. Later, for SPLITMV, we
186 * could reduce the area.
189 /* estimated cost of a motion vector (r,c) */
190 #define MVC(r,c) (mvcost ? ((mvcost[0][(r)-rr] + mvcost[1][(c) - rc]) * error_per_bit + 128 )>>8 : 0)
191 /* pointer to predictor base of a motionvector */
192 #define PRE(r,c) (y + (((r)>>2) * y_stride + ((c)>>2) -(offset)))
193 /* convert motion vector component to offset for svf calc */
194 #define SP(x) (((x)&3)<<1)
195 /* returns subpixel variance error function. */
196 #define DIST(r,c) vfp->svf( PRE(r,c), y_stride, SP(c),SP(r), z,b->src_stride,&sse)
197 #define IFMVCV(r,c,s,e) if ( c >= minc && c <= maxc && r >= minr && r <= maxr) s else e;
198 /* returns distortion + motion vector cost */
199 #define ERR(r,c) (MVC(r,c)+DIST(r,c))
200 /* checks if (r,c) has better score than previous best */
201 #define CHECK_BETTER(v,r,c) IFMVCV(r,c,{thismse = DIST(r,c); if((v = (MVC(r,c)+thismse)) < besterr) { besterr = v; br=r; bc=c; *distortion = thismse; *sse1 = sse; }}, v=UINT_MAX;)
203 int vp8_find_best_sub_pixel_step_iteratively(MACROBLOCK *x, BLOCK *b, BLOCKD *d,
204 int_mv *bestmv, int_mv *ref_mv,
206 const vp8_variance_fn_ptr_t *vfp,
207 int *mvcost[2], int *distortion,
210 unsigned char *z = (*(b->base_src) + b->src);
212 int rr = ref_mv->as_mv.row >> 1, rc = ref_mv->as_mv.col >> 1;
213 int br = bestmv->as_mv.row * 4, bc = bestmv->as_mv.col * 4;
214 int tr = br, tc = bc;
215 unsigned int besterr;
216 unsigned int left, right, up, down, diag;
218 unsigned int whichdir;
219 unsigned int halfiters = 4;
220 unsigned int quarteriters = 4;
223 int minc = MAX(x->mv_col_min * 4,
224 (ref_mv->as_mv.col >> 1) - ((1 << mvlong_width) - 1));
225 int maxc = MIN(x->mv_col_max * 4,
226 (ref_mv->as_mv.col >> 1) + ((1 << mvlong_width) - 1));
227 int minr = MAX(x->mv_row_min * 4,
228 (ref_mv->as_mv.row >> 1) - ((1 << mvlong_width) - 1));
229 int maxr = MIN(x->mv_row_max * 4,
230 (ref_mv->as_mv.row >> 1) + ((1 << mvlong_width) - 1));
234 int pre_stride = x->e_mbd.pre.y_stride;
235 unsigned char *base_pre = x->e_mbd.pre.y_buffer;
238 #if ARCH_X86 || ARCH_X86_64
239 MACROBLOCKD *xd = &x->e_mbd;
240 unsigned char *y_0 = base_pre + d->offset + (bestmv->as_mv.row) * pre_stride + bestmv->as_mv.col;
242 int buf_r1, buf_r2, buf_c1;
244 /* Clamping to avoid out-of-range data access */
245 buf_r1 = ((bestmv->as_mv.row - 3) < x->mv_row_min)?(bestmv->as_mv.row - x->mv_row_min):3;
246 buf_r2 = ((bestmv->as_mv.row + 3) > x->mv_row_max)?(x->mv_row_max - bestmv->as_mv.row):3;
247 buf_c1 = ((bestmv->as_mv.col - 3) < x->mv_col_min)?(bestmv->as_mv.col - x->mv_col_min):3;
250 /* Copy to intermediate buffer before searching. */
251 vfp->copymem(y_0 - buf_c1 - pre_stride*buf_r1, pre_stride, xd->y_buf, y_stride, 16+buf_r1+buf_r2);
252 y = xd->y_buf + y_stride*buf_r1 +buf_c1;
254 unsigned char *y = base_pre + d->offset + (bestmv->as_mv.row) * pre_stride + bestmv->as_mv.col;
255 y_stride = pre_stride;
258 offset = (bestmv->as_mv.row) * y_stride + bestmv->as_mv.col;
261 bestmv->as_mv.row *= 8;
262 bestmv->as_mv.col *= 8;
264 /* calculate central point error */
265 besterr = vfp->vf(y, y_stride, z, b->src_stride, sse1);
266 *distortion = besterr;
267 besterr += mv_err_cost(bestmv, ref_mv, mvcost, error_per_bit);
269 /* TODO: Each subsequent iteration checks at least one point in common
270 * with the last iteration could be 2 ( if diag selected)
275 CHECK_BETTER(left, tr, tc - 2);
276 CHECK_BETTER(right, tr, tc + 2);
277 CHECK_BETTER(up, tr - 2, tc);
278 CHECK_BETTER(down, tr + 2, tc);
280 whichdir = (left < right ? 0 : 1) + (up < down ? 0 : 2);
285 CHECK_BETTER(diag, tr - 2, tc - 2);
288 CHECK_BETTER(diag, tr - 2, tc + 2);
291 CHECK_BETTER(diag, tr + 2, tc - 2);
294 CHECK_BETTER(diag, tr + 2, tc + 2);
298 /* no reason to check the same one again. */
299 if (tr == br && tc == bc)
306 /* TODO: Each subsequent iteration checks at least one point in common
307 * with the last iteration could be 2 ( if diag selected)
311 while (--quarteriters)
313 CHECK_BETTER(left, tr, tc - 1);
314 CHECK_BETTER(right, tr, tc + 1);
315 CHECK_BETTER(up, tr - 1, tc);
316 CHECK_BETTER(down, tr + 1, tc);
318 whichdir = (left < right ? 0 : 1) + (up < down ? 0 : 2);
323 CHECK_BETTER(diag, tr - 1, tc - 1);
326 CHECK_BETTER(diag, tr - 1, tc + 1);
329 CHECK_BETTER(diag, tr + 1, tc - 1);
332 CHECK_BETTER(diag, tr + 1, tc + 1);
336 /* no reason to check the same one again. */
337 if (tr == br && tc == bc)
344 bestmv->as_mv.row = br * 2;
345 bestmv->as_mv.col = bc * 2;
347 if ((abs(bestmv->as_mv.col - ref_mv->as_mv.col) > (MAX_FULL_PEL_VAL<<3)) ||
348 (abs(bestmv->as_mv.row - ref_mv->as_mv.row) > (MAX_FULL_PEL_VAL<<3)))
361 int vp8_find_best_sub_pixel_step(MACROBLOCK *x, BLOCK *b, BLOCKD *d,
362 int_mv *bestmv, int_mv *ref_mv,
364 const vp8_variance_fn_ptr_t *vfp,
365 int *mvcost[2], int *distortion,
368 int bestmse = INT_MAX;
371 unsigned char *z = (*(b->base_src) + b->src);
372 int left, right, up, down, diag;
377 int pre_stride = x->e_mbd.pre.y_stride;
378 unsigned char *base_pre = x->e_mbd.pre.y_buffer;
380 #if ARCH_X86 || ARCH_X86_64
381 MACROBLOCKD *xd = &x->e_mbd;
382 unsigned char *y_0 = base_pre + d->offset + (bestmv->as_mv.row) * pre_stride + bestmv->as_mv.col;
386 /* Copy 18 rows x 32 cols area to intermediate buffer before searching. */
387 vfp->copymem(y_0 - 1 - pre_stride, pre_stride, xd->y_buf, y_stride, 18);
388 y = xd->y_buf + y_stride + 1;
390 unsigned char *y = base_pre + d->offset + (bestmv->as_mv.row) * pre_stride + bestmv->as_mv.col;
391 y_stride = pre_stride;
395 bestmv->as_mv.row <<= 3;
396 bestmv->as_mv.col <<= 3;
399 /* calculate central point error */
400 bestmse = vfp->vf(y, y_stride, z, b->src_stride, sse1);
401 *distortion = bestmse;
402 bestmse += mv_err_cost(bestmv, ref_mv, mvcost, error_per_bit);
404 /* go left then right and check error */
405 this_mv.as_mv.row = startmv.as_mv.row;
406 this_mv.as_mv.col = ((startmv.as_mv.col - 8) | 4);
407 thismse = vfp->svf_halfpix_h(y - 1, y_stride, z, b->src_stride, &sse);
408 left = thismse + mv_err_cost(&this_mv, ref_mv, mvcost, error_per_bit);
414 *distortion = thismse;
418 this_mv.as_mv.col += 8;
419 thismse = vfp->svf_halfpix_h(y, y_stride, z, b->src_stride, &sse);
420 right = thismse + mv_err_cost(&this_mv, ref_mv, mvcost, error_per_bit);
426 *distortion = thismse;
430 /* go up then down and check error */
431 this_mv.as_mv.col = startmv.as_mv.col;
432 this_mv.as_mv.row = ((startmv.as_mv.row - 8) | 4);
433 thismse = vfp->svf_halfpix_v(y - y_stride, y_stride, z, b->src_stride, &sse);
434 up = thismse + mv_err_cost(&this_mv, ref_mv, mvcost, error_per_bit);
440 *distortion = thismse;
444 this_mv.as_mv.row += 8;
445 thismse = vfp->svf_halfpix_v(y, y_stride, z, b->src_stride, &sse);
446 down = thismse + mv_err_cost(&this_mv, ref_mv, mvcost, error_per_bit);
452 *distortion = thismse;
457 /* now check 1 more diagonal */
458 whichdir = (left < right ? 0 : 1) + (up < down ? 0 : 2);
464 this_mv.as_mv.col = (this_mv.as_mv.col - 8) | 4;
465 this_mv.as_mv.row = (this_mv.as_mv.row - 8) | 4;
466 thismse = vfp->svf_halfpix_hv(y - 1 - y_stride, y_stride, z, b->src_stride, &sse);
469 this_mv.as_mv.col += 4;
470 this_mv.as_mv.row = (this_mv.as_mv.row - 8) | 4;
471 thismse = vfp->svf_halfpix_hv(y - y_stride, y_stride, z, b->src_stride, &sse);
474 this_mv.as_mv.col = (this_mv.as_mv.col - 8) | 4;
475 this_mv.as_mv.row += 4;
476 thismse = vfp->svf_halfpix_hv(y - 1, y_stride, z, b->src_stride, &sse);
480 this_mv.as_mv.col += 4;
481 this_mv.as_mv.row += 4;
482 thismse = vfp->svf_halfpix_hv(y, y_stride, z, b->src_stride, &sse);
486 diag = thismse + mv_err_cost(&this_mv, ref_mv, mvcost, error_per_bit);
492 *distortion = thismse;
497 /* time to check quarter pels. */
498 if (bestmv->as_mv.row < startmv.as_mv.row)
501 if (bestmv->as_mv.col < startmv.as_mv.col)
508 /* go left then right and check error */
509 this_mv.as_mv.row = startmv.as_mv.row;
511 if (startmv.as_mv.col & 7)
513 this_mv.as_mv.col = startmv.as_mv.col - 2;
514 thismse = vfp->svf(y, y_stride, this_mv.as_mv.col & 7, this_mv.as_mv.row & 7, z, b->src_stride, &sse);
518 this_mv.as_mv.col = (startmv.as_mv.col - 8) | 6;
519 thismse = vfp->svf(y - 1, y_stride, 6, this_mv.as_mv.row & 7, z, b->src_stride, &sse);
522 left = thismse + mv_err_cost(&this_mv, ref_mv, mvcost, error_per_bit);
528 *distortion = thismse;
532 this_mv.as_mv.col += 4;
533 thismse = vfp->svf(y, y_stride, this_mv.as_mv.col & 7, this_mv.as_mv.row & 7, z, b->src_stride, &sse);
534 right = thismse + mv_err_cost(&this_mv, ref_mv, mvcost, error_per_bit);
540 *distortion = thismse;
544 /* go up then down and check error */
545 this_mv.as_mv.col = startmv.as_mv.col;
547 if (startmv.as_mv.row & 7)
549 this_mv.as_mv.row = startmv.as_mv.row - 2;
550 thismse = vfp->svf(y, y_stride, this_mv.as_mv.col & 7, this_mv.as_mv.row & 7, z, b->src_stride, &sse);
554 this_mv.as_mv.row = (startmv.as_mv.row - 8) | 6;
555 thismse = vfp->svf(y - y_stride, y_stride, this_mv.as_mv.col & 7, 6, z, b->src_stride, &sse);
558 up = thismse + mv_err_cost(&this_mv, ref_mv, mvcost, error_per_bit);
564 *distortion = thismse;
568 this_mv.as_mv.row += 4;
569 thismse = vfp->svf(y, y_stride, this_mv.as_mv.col & 7, this_mv.as_mv.row & 7, z, b->src_stride, &sse);
570 down = thismse + mv_err_cost(&this_mv, ref_mv, mvcost, error_per_bit);
576 *distortion = thismse;
581 /* now check 1 more diagonal */
582 whichdir = (left < right ? 0 : 1) + (up < down ? 0 : 2);
590 if (startmv.as_mv.row & 7)
592 this_mv.as_mv.row -= 2;
594 if (startmv.as_mv.col & 7)
596 this_mv.as_mv.col -= 2;
597 thismse = vfp->svf(y, y_stride, this_mv.as_mv.col & 7, this_mv.as_mv.row & 7, z, b->src_stride, &sse);
601 this_mv.as_mv.col = (startmv.as_mv.col - 8) | 6;
602 thismse = vfp->svf(y - 1, y_stride, 6, this_mv.as_mv.row & 7, z, b->src_stride, &sse);;
607 this_mv.as_mv.row = (startmv.as_mv.row - 8) | 6;
609 if (startmv.as_mv.col & 7)
611 this_mv.as_mv.col -= 2;
612 thismse = vfp->svf(y - y_stride, y_stride, this_mv.as_mv.col & 7, 6, z, b->src_stride, &sse);
616 this_mv.as_mv.col = (startmv.as_mv.col - 8) | 6;
617 thismse = vfp->svf(y - y_stride - 1, y_stride, 6, 6, z, b->src_stride, &sse);
623 this_mv.as_mv.col += 2;
625 if (startmv.as_mv.row & 7)
627 this_mv.as_mv.row -= 2;
628 thismse = vfp->svf(y, y_stride, this_mv.as_mv.col & 7, this_mv.as_mv.row & 7, z, b->src_stride, &sse);
632 this_mv.as_mv.row = (startmv.as_mv.row - 8) | 6;
633 thismse = vfp->svf(y - y_stride, y_stride, this_mv.as_mv.col & 7, 6, z, b->src_stride, &sse);
638 this_mv.as_mv.row += 2;
640 if (startmv.as_mv.col & 7)
642 this_mv.as_mv.col -= 2;
643 thismse = vfp->svf(y, y_stride, this_mv.as_mv.col & 7, this_mv.as_mv.row & 7, z, b->src_stride, &sse);
647 this_mv.as_mv.col = (startmv.as_mv.col - 8) | 6;
648 thismse = vfp->svf(y - 1, y_stride, 6, this_mv.as_mv.row & 7, z, b->src_stride, &sse);
653 this_mv.as_mv.col += 2;
654 this_mv.as_mv.row += 2;
655 thismse = vfp->svf(y, y_stride, this_mv.as_mv.col & 7, this_mv.as_mv.row & 7, z, b->src_stride, &sse);
659 diag = thismse + mv_err_cost(&this_mv, ref_mv, mvcost, error_per_bit);
665 *distortion = thismse;
672 int vp8_find_best_half_pixel_step(MACROBLOCK *x, BLOCK *b, BLOCKD *d,
673 int_mv *bestmv, int_mv *ref_mv,
675 const vp8_variance_fn_ptr_t *vfp,
676 int *mvcost[2], int *distortion,
679 int bestmse = INT_MAX;
682 unsigned char *z = (*(b->base_src) + b->src);
683 int left, right, up, down, diag;
688 int pre_stride = x->e_mbd.pre.y_stride;
689 unsigned char *base_pre = x->e_mbd.pre.y_buffer;
691 #if ARCH_X86 || ARCH_X86_64
692 MACROBLOCKD *xd = &x->e_mbd;
693 unsigned char *y_0 = base_pre + d->offset + (bestmv->as_mv.row) * pre_stride + bestmv->as_mv.col;
697 /* Copy 18 rows x 32 cols area to intermediate buffer before searching. */
698 vfp->copymem(y_0 - 1 - pre_stride, pre_stride, xd->y_buf, y_stride, 18);
699 y = xd->y_buf + y_stride + 1;
701 unsigned char *y = base_pre + d->offset + (bestmv->as_mv.row) * pre_stride + bestmv->as_mv.col;
702 y_stride = pre_stride;
706 bestmv->as_mv.row *= 8;
707 bestmv->as_mv.col *= 8;
710 /* calculate central point error */
711 bestmse = vfp->vf(y, y_stride, z, b->src_stride, sse1);
712 *distortion = bestmse;
713 bestmse += mv_err_cost(bestmv, ref_mv, mvcost, error_per_bit);
715 /* go left then right and check error */
716 this_mv.as_mv.row = startmv.as_mv.row;
717 this_mv.as_mv.col = ((startmv.as_mv.col - 8) | 4);
718 thismse = vfp->svf_halfpix_h(y - 1, y_stride, z, b->src_stride, &sse);
719 left = thismse + mv_err_cost(&this_mv, ref_mv, mvcost, error_per_bit);
725 *distortion = thismse;
729 this_mv.as_mv.col += 8;
730 thismse = vfp->svf_halfpix_h(y, y_stride, z, b->src_stride, &sse);
731 right = thismse + mv_err_cost(&this_mv, ref_mv, mvcost, error_per_bit);
737 *distortion = thismse;
741 /* go up then down and check error */
742 this_mv.as_mv.col = startmv.as_mv.col;
743 this_mv.as_mv.row = ((startmv.as_mv.row - 8) | 4);
744 thismse = vfp->svf_halfpix_v(y - y_stride, y_stride, z, b->src_stride, &sse);
745 up = thismse + mv_err_cost(&this_mv, ref_mv, mvcost, error_per_bit);
751 *distortion = thismse;
755 this_mv.as_mv.row += 8;
756 thismse = vfp->svf_halfpix_v(y, y_stride, z, b->src_stride, &sse);
757 down = thismse + mv_err_cost(&this_mv, ref_mv, mvcost, error_per_bit);
763 *distortion = thismse;
767 /* now check 1 more diagonal - */
768 whichdir = (left < right ? 0 : 1) + (up < down ? 0 : 2);
774 this_mv.as_mv.col = (this_mv.as_mv.col - 8) | 4;
775 this_mv.as_mv.row = (this_mv.as_mv.row - 8) | 4;
776 thismse = vfp->svf_halfpix_hv(y - 1 - y_stride, y_stride, z, b->src_stride, &sse);
779 this_mv.as_mv.col += 4;
780 this_mv.as_mv.row = (this_mv.as_mv.row - 8) | 4;
781 thismse = vfp->svf_halfpix_hv(y - y_stride, y_stride, z, b->src_stride, &sse);
784 this_mv.as_mv.col = (this_mv.as_mv.col - 8) | 4;
785 this_mv.as_mv.row += 4;
786 thismse = vfp->svf_halfpix_hv(y - 1, y_stride, z, b->src_stride, &sse);
790 this_mv.as_mv.col += 4;
791 this_mv.as_mv.row += 4;
792 thismse = vfp->svf_halfpix_hv(y, y_stride, z, b->src_stride, &sse);
796 diag = thismse + mv_err_cost(&this_mv, ref_mv, mvcost, error_per_bit);
802 *distortion = thismse;
809 #define CHECK_BOUNDS(range) \
812 all_in &= ((br-range) >= x->mv_row_min);\
813 all_in &= ((br+range) <= x->mv_row_max);\
814 all_in &= ((bc-range) >= x->mv_col_min);\
815 all_in &= ((bc+range) <= x->mv_col_max);\
818 #define CHECK_POINT \
820 if (this_mv.as_mv.col < x->mv_col_min) continue;\
821 if (this_mv.as_mv.col > x->mv_col_max) continue;\
822 if (this_mv.as_mv.row < x->mv_row_min) continue;\
823 if (this_mv.as_mv.row > x->mv_row_max) continue;\
826 #define CHECK_BETTER \
828 if (thissad < bestsad)\
830 thissad += mvsad_err_cost(&this_mv, &fcenter_mv, mvsadcost, sad_per_bit);\
831 if (thissad < bestsad)\
839 static const MV next_chkpts[6][3] =
841 {{ -2, 0}, { -1, -2}, {1, -2}},
842 {{ -1, -2}, {1, -2}, {2, 0}},
843 {{1, -2}, {2, 0}, {1, 2}},
844 {{2, 0}, {1, 2}, { -1, 2}},
845 {{1, 2}, { -1, 2}, { -2, 0}},
846 {{ -1, 2}, { -2, 0}, { -1, -2}}
858 const vp8_variance_fn_ptr_t *vfp,
864 MV hex[6] = { { -1, -2}, {1, -2}, {2, 0}, {1, 2}, { -1, 2}, { -2, 0} } ;
865 MV neighbors[4] = {{0, -1}, { -1, 0}, {1, 0}, {0, 1}} ;
868 unsigned char *what = (*(b->base_src) + b->src);
869 int what_stride = b->src_stride;
870 int pre_stride = x->e_mbd.pre.y_stride;
871 unsigned char *base_pre = x->e_mbd.pre.y_buffer;
873 int in_what_stride = pre_stride;
876 unsigned int bestsad;
877 unsigned int thissad;
878 unsigned char *base_offset;
879 unsigned char *this_offset;
887 fcenter_mv.as_mv.row = center_mv->as_mv.row >> 3;
888 fcenter_mv.as_mv.col = center_mv->as_mv.col >> 3;
890 /* adjust ref_mv to make sure it is within MV range */
891 vp8_clamp_mv(ref_mv, x->mv_col_min, x->mv_col_max, x->mv_row_min, x->mv_row_max);
892 br = ref_mv->as_mv.row;
893 bc = ref_mv->as_mv.col;
895 /* Work out the start point for the search */
896 base_offset = (unsigned char *)(base_pre + d->offset);
897 this_offset = base_offset + (br * (pre_stride)) + bc;
898 this_mv.as_mv.row = br;
899 this_mv.as_mv.col = bc;
900 bestsad = vfp->sdf(what, what_stride, this_offset, in_what_stride, UINT_MAX)
901 + mvsad_err_cost(&this_mv, &fcenter_mv, mvsadcost, sad_per_bit);
903 #if CONFIG_MULTI_RES_ENCODING
904 /* Lower search range based on prediction info */
905 if (search_param >= 6) goto cal_neighbors;
906 else if (search_param >= 5) hex_range = 4;
907 else if (search_param >= 4) hex_range = 6;
908 else if (search_param >= 3) hex_range = 15;
909 else if (search_param >= 2) hex_range = 31;
910 else if (search_param >= 1) hex_range = 63;
920 for (i = 0; i < 6; i++)
922 this_mv.as_mv.row = br + hex[i].row;
923 this_mv.as_mv.col = bc + hex[i].col;
924 this_offset = base_offset + (this_mv.as_mv.row * in_what_stride) + this_mv.as_mv.col;
925 thissad = vfp->sdf(what, what_stride, this_offset, in_what_stride, bestsad);
930 for (i = 0; i < 6; i++)
932 this_mv.as_mv.row = br + hex[i].row;
933 this_mv.as_mv.col = bc + hex[i].col;
935 this_offset = base_offset + (this_mv.as_mv.row * in_what_stride) + this_mv.as_mv.col;
936 thissad = vfp->sdf(what, what_stride, this_offset, in_what_stride, bestsad);
945 br += hex[best_site].row;
946 bc += hex[best_site].col;
950 for (j = 1; j < hex_range; j++)
957 for (i = 0; i < 3; i++)
959 this_mv.as_mv.row = br + next_chkpts[k][i].row;
960 this_mv.as_mv.col = bc + next_chkpts[k][i].col;
961 this_offset = base_offset + (this_mv.as_mv.row * (in_what_stride)) + this_mv.as_mv.col;
962 thissad = vfp->sdf(what, what_stride, this_offset, in_what_stride, bestsad);
967 for (i = 0; i < 3; i++)
969 this_mv.as_mv.row = br + next_chkpts[k][i].row;
970 this_mv.as_mv.col = bc + next_chkpts[k][i].col;
972 this_offset = base_offset + (this_mv.as_mv.row * (in_what_stride)) + this_mv.as_mv.col;
973 thissad = vfp->sdf(what, what_stride, this_offset, in_what_stride, bestsad);
982 br += next_chkpts[k][best_site].row;
983 bc += next_chkpts[k][best_site].col;
985 if (k >= 12) k -= 12;
986 else if (k >= 6) k -= 6;
990 /* check 4 1-away neighbors */
992 for (j = 0; j < dia_range; j++)
999 for (i = 0; i < 4; i++)
1001 this_mv.as_mv.row = br + neighbors[i].row;
1002 this_mv.as_mv.col = bc + neighbors[i].col;
1003 this_offset = base_offset + (this_mv.as_mv.row * (in_what_stride)) + this_mv.as_mv.col;
1004 thissad = vfp->sdf(what, what_stride, this_offset, in_what_stride, bestsad);
1009 for (i = 0; i < 4; i++)
1011 this_mv.as_mv.row = br + neighbors[i].row;
1012 this_mv.as_mv.col = bc + neighbors[i].col;
1014 this_offset = base_offset + (this_mv.as_mv.row * (in_what_stride)) + this_mv.as_mv.col;
1015 thissad = vfp->sdf(what, what_stride, this_offset, in_what_stride, bestsad);
1020 if (best_site == -1)
1024 br += neighbors[best_site].row;
1025 bc += neighbors[best_site].col;
1029 best_mv->as_mv.row = br;
1030 best_mv->as_mv.col = bc;
1038 int vp8_diamond_search_sad_c
1048 vp8_variance_fn_ptr_t *fn_ptr,
1055 unsigned char *what = (*(b->base_src) + b->src);
1056 int what_stride = b->src_stride;
1057 unsigned char *in_what;
1058 int pre_stride = x->e_mbd.pre.y_stride;
1059 unsigned char *base_pre = x->e_mbd.pre.y_buffer;
1060 int in_what_stride = pre_stride;
1061 unsigned char *best_address;
1066 unsigned int bestsad;
1067 unsigned int thissad;
1073 int this_row_offset;
1074 int this_col_offset;
1077 unsigned char *check_here;
1082 mvsadcost[0] = x->mvsadcost[0];
1083 mvsadcost[1] = x->mvsadcost[1];
1084 fcenter_mv.as_mv.row = center_mv->as_mv.row >> 3;
1085 fcenter_mv.as_mv.col = center_mv->as_mv.col >> 3;
1087 vp8_clamp_mv(ref_mv, x->mv_col_min, x->mv_col_max, x->mv_row_min, x->mv_row_max);
1088 ref_row = ref_mv->as_mv.row;
1089 ref_col = ref_mv->as_mv.col;
1091 best_mv->as_mv.row = ref_row;
1092 best_mv->as_mv.col = ref_col;
1094 /* Work out the start point for the search */
1095 in_what = (unsigned char *)(base_pre + d->offset + (ref_row * pre_stride) + ref_col);
1096 best_address = in_what;
1098 /* Check the starting position */
1099 bestsad = fn_ptr->sdf(what, what_stride, in_what, in_what_stride, UINT_MAX)
1100 + mvsad_err_cost(best_mv, &fcenter_mv, mvsadcost, sad_per_bit);
1102 /* search_param determines the length of the initial step and hence
1103 * the number of iterations 0 = initial step (MAX_FIRST_STEP) pel :
1104 * 1 = (MAX_FIRST_STEP/2) pel, 2 = (MAX_FIRST_STEP/4) pel... etc.
1106 ss = &x->ss[search_param * x->searches_per_step];
1107 tot_steps = (x->ss_count / x->searches_per_step) - search_param;
1111 for (step = 0; step < tot_steps ; step++)
1113 for (j = 0 ; j < x->searches_per_step ; j++)
1115 /* Trap illegal vectors */
1116 this_row_offset = best_mv->as_mv.row + ss[i].mv.row;
1117 this_col_offset = best_mv->as_mv.col + ss[i].mv.col;
1119 if ((this_col_offset > x->mv_col_min) && (this_col_offset < x->mv_col_max) &&
1120 (this_row_offset > x->mv_row_min) && (this_row_offset < x->mv_row_max))
1123 check_here = ss[i].offset + best_address;
1124 thissad = fn_ptr->sdf(what, what_stride, check_here, in_what_stride, bestsad);
1126 if (thissad < bestsad)
1128 this_mv.as_mv.row = this_row_offset;
1129 this_mv.as_mv.col = this_col_offset;
1130 thissad += mvsad_err_cost(&this_mv, &fcenter_mv,
1131 mvsadcost, sad_per_bit);
1133 if (thissad < bestsad)
1144 if (best_site != last_site)
1146 best_mv->as_mv.row += ss[best_site].mv.row;
1147 best_mv->as_mv.col += ss[best_site].mv.col;
1148 best_address += ss[best_site].offset;
1149 last_site = best_site;
1151 else if (best_address == in_what)
1155 this_mv.as_mv.row = best_mv->as_mv.row << 3;
1156 this_mv.as_mv.col = best_mv->as_mv.col << 3;
1158 return fn_ptr->vf(what, what_stride, best_address, in_what_stride, &thissad)
1159 + mv_err_cost(&this_mv, center_mv, mvcost, x->errorperbit);
1162 int vp8_diamond_search_sadx4
1172 vp8_variance_fn_ptr_t *fn_ptr,
1179 unsigned char *what = (*(b->base_src) + b->src);
1180 int what_stride = b->src_stride;
1181 unsigned char *in_what;
1182 int pre_stride = x->e_mbd.pre.y_stride;
1183 unsigned char *base_pre = x->e_mbd.pre.y_buffer;
1184 int in_what_stride = pre_stride;
1185 unsigned char *best_address;
1190 unsigned int bestsad;
1191 unsigned int thissad;
1197 int this_row_offset;
1198 int this_col_offset;
1201 unsigned char *check_here;
1206 mvsadcost[0] = x->mvsadcost[0];
1207 mvsadcost[1] = x->mvsadcost[1];
1208 fcenter_mv.as_mv.row = center_mv->as_mv.row >> 3;
1209 fcenter_mv.as_mv.col = center_mv->as_mv.col >> 3;
1211 vp8_clamp_mv(ref_mv, x->mv_col_min, x->mv_col_max, x->mv_row_min, x->mv_row_max);
1212 ref_row = ref_mv->as_mv.row;
1213 ref_col = ref_mv->as_mv.col;
1215 best_mv->as_mv.row = ref_row;
1216 best_mv->as_mv.col = ref_col;
1218 /* Work out the start point for the search */
1219 in_what = (unsigned char *)(base_pre + d->offset + (ref_row * pre_stride) + ref_col);
1220 best_address = in_what;
1222 /* Check the starting position */
1223 bestsad = fn_ptr->sdf(what, what_stride, in_what, in_what_stride, UINT_MAX)
1224 + mvsad_err_cost(best_mv, &fcenter_mv, mvsadcost, sad_per_bit);
1226 /* search_param determines the length of the initial step and hence the
1227 * number of iterations 0 = initial step (MAX_FIRST_STEP) pel : 1 =
1228 * (MAX_FIRST_STEP/2) pel, 2 = (MAX_FIRST_STEP/4) pel... etc.
1230 ss = &x->ss[search_param * x->searches_per_step];
1231 tot_steps = (x->ss_count / x->searches_per_step) - search_param;
1235 for (step = 0; step < tot_steps ; step++)
1239 /* To know if all neighbor points are within the bounds, 4 bounds
1240 * checking are enough instead of checking 4 bounds for each
1243 all_in &= ((best_mv->as_mv.row + ss[i].mv.row)> x->mv_row_min);
1244 all_in &= ((best_mv->as_mv.row + ss[i+1].mv.row) < x->mv_row_max);
1245 all_in &= ((best_mv->as_mv.col + ss[i+2].mv.col) > x->mv_col_min);
1246 all_in &= ((best_mv->as_mv.col + ss[i+3].mv.col) < x->mv_col_max);
1250 unsigned int sad_array[4];
1252 for (j = 0 ; j < x->searches_per_step ; j += 4)
1254 const unsigned char *block_offset[4];
1256 for (t = 0; t < 4; t++)
1257 block_offset[t] = ss[i+t].offset + best_address;
1259 fn_ptr->sdx4df(what, what_stride, block_offset, in_what_stride, sad_array);
1261 for (t = 0; t < 4; t++, i++)
1263 if (sad_array[t] < bestsad)
1265 this_mv.as_mv.row = best_mv->as_mv.row + ss[i].mv.row;
1266 this_mv.as_mv.col = best_mv->as_mv.col + ss[i].mv.col;
1267 sad_array[t] += mvsad_err_cost(&this_mv, &fcenter_mv,
1268 mvsadcost, sad_per_bit);
1270 if (sad_array[t] < bestsad)
1272 bestsad = sad_array[t];
1281 for (j = 0 ; j < x->searches_per_step ; j++)
1283 /* Trap illegal vectors */
1284 this_row_offset = best_mv->as_mv.row + ss[i].mv.row;
1285 this_col_offset = best_mv->as_mv.col + ss[i].mv.col;
1287 if ((this_col_offset > x->mv_col_min) && (this_col_offset < x->mv_col_max) &&
1288 (this_row_offset > x->mv_row_min) && (this_row_offset < x->mv_row_max))
1290 check_here = ss[i].offset + best_address;
1291 thissad = fn_ptr->sdf(what, what_stride, check_here, in_what_stride, bestsad);
1293 if (thissad < bestsad)
1295 this_mv.as_mv.row = this_row_offset;
1296 this_mv.as_mv.col = this_col_offset;
1297 thissad += mvsad_err_cost(&this_mv, &fcenter_mv,
1298 mvsadcost, sad_per_bit);
1300 if (thissad < bestsad)
1311 if (best_site != last_site)
1313 best_mv->as_mv.row += ss[best_site].mv.row;
1314 best_mv->as_mv.col += ss[best_site].mv.col;
1315 best_address += ss[best_site].offset;
1316 last_site = best_site;
1318 else if (best_address == in_what)
1322 this_mv.as_mv.row = best_mv->as_mv.row * 8;
1323 this_mv.as_mv.col = best_mv->as_mv.col * 8;
1325 return fn_ptr->vf(what, what_stride, best_address, in_what_stride, &thissad)
1326 + mv_err_cost(&this_mv, center_mv, mvcost, x->errorperbit);
1329 int vp8_full_search_sad_c(MACROBLOCK *x, BLOCK *b, BLOCKD *d, int_mv *ref_mv,
1330 int sad_per_bit, int distance,
1331 vp8_variance_fn_ptr_t *fn_ptr, int *mvcost[2],
1334 unsigned char *what = (*(b->base_src) + b->src);
1335 int what_stride = b->src_stride;
1336 unsigned char *in_what;
1337 int pre_stride = x->e_mbd.pre.y_stride;
1338 unsigned char *base_pre = x->e_mbd.pre.y_buffer;
1339 int in_what_stride = pre_stride;
1340 int mv_stride = pre_stride;
1341 unsigned char *bestaddress;
1342 int_mv *best_mv = &d->bmi.mv;
1344 unsigned int bestsad;
1345 unsigned int thissad;
1348 unsigned char *check_here;
1350 int ref_row = ref_mv->as_mv.row;
1351 int ref_col = ref_mv->as_mv.col;
1353 int row_min = ref_row - distance;
1354 int row_max = ref_row + distance;
1355 int col_min = ref_col - distance;
1356 int col_max = ref_col + distance;
1361 mvsadcost[0] = x->mvsadcost[0];
1362 mvsadcost[1] = x->mvsadcost[1];
1363 fcenter_mv.as_mv.row = center_mv->as_mv.row >> 3;
1364 fcenter_mv.as_mv.col = center_mv->as_mv.col >> 3;
1366 /* Work out the mid point for the search */
1367 in_what = base_pre + d->offset;
1368 bestaddress = in_what + (ref_row * pre_stride) + ref_col;
1370 best_mv->as_mv.row = ref_row;
1371 best_mv->as_mv.col = ref_col;
1373 /* Baseline value at the centre */
1374 bestsad = fn_ptr->sdf(what, what_stride, bestaddress,
1375 in_what_stride, UINT_MAX)
1376 + mvsad_err_cost(best_mv, &fcenter_mv, mvsadcost, sad_per_bit);
1378 /* Apply further limits to prevent us looking using vectors that
1379 * stretch beyiond the UMV border
1381 if (col_min < x->mv_col_min)
1382 col_min = x->mv_col_min;
1384 if (col_max > x->mv_col_max)
1385 col_max = x->mv_col_max;
1387 if (row_min < x->mv_row_min)
1388 row_min = x->mv_row_min;
1390 if (row_max > x->mv_row_max)
1391 row_max = x->mv_row_max;
1393 for (r = row_min; r < row_max ; r++)
1395 this_mv.as_mv.row = r;
1396 check_here = r * mv_stride + in_what + col_min;
1398 for (c = col_min; c < col_max; c++)
1400 thissad = fn_ptr->sdf(what, what_stride, check_here, in_what_stride, bestsad);
1402 this_mv.as_mv.col = c;
1403 thissad += mvsad_err_cost(&this_mv, &fcenter_mv,
1404 mvsadcost, sad_per_bit);
1406 if (thissad < bestsad)
1409 best_mv->as_mv.row = r;
1410 best_mv->as_mv.col = c;
1411 bestaddress = check_here;
1418 this_mv.as_mv.row = best_mv->as_mv.row << 3;
1419 this_mv.as_mv.col = best_mv->as_mv.col << 3;
1421 return fn_ptr->vf(what, what_stride, bestaddress, in_what_stride, &thissad)
1422 + mv_err_cost(&this_mv, center_mv, mvcost, x->errorperbit);
1425 int vp8_full_search_sadx3(MACROBLOCK *x, BLOCK *b, BLOCKD *d, int_mv *ref_mv,
1426 int sad_per_bit, int distance,
1427 vp8_variance_fn_ptr_t *fn_ptr, int *mvcost[2],
1430 unsigned char *what = (*(b->base_src) + b->src);
1431 int what_stride = b->src_stride;
1432 unsigned char *in_what;
1433 int pre_stride = x->e_mbd.pre.y_stride;
1434 unsigned char *base_pre = x->e_mbd.pre.y_buffer;
1435 int in_what_stride = pre_stride;
1436 int mv_stride = pre_stride;
1437 unsigned char *bestaddress;
1438 int_mv *best_mv = &d->bmi.mv;
1440 unsigned int bestsad;
1441 unsigned int thissad;
1444 unsigned char *check_here;
1446 int ref_row = ref_mv->as_mv.row;
1447 int ref_col = ref_mv->as_mv.col;
1449 int row_min = ref_row - distance;
1450 int row_max = ref_row + distance;
1451 int col_min = ref_col - distance;
1452 int col_max = ref_col + distance;
1454 unsigned int sad_array[3];
1459 mvsadcost[0] = x->mvsadcost[0];
1460 mvsadcost[1] = x->mvsadcost[1];
1461 fcenter_mv.as_mv.row = center_mv->as_mv.row >> 3;
1462 fcenter_mv.as_mv.col = center_mv->as_mv.col >> 3;
1464 /* Work out the mid point for the search */
1465 in_what = base_pre + d->offset;
1466 bestaddress = in_what + (ref_row * pre_stride) + ref_col;
1468 best_mv->as_mv.row = ref_row;
1469 best_mv->as_mv.col = ref_col;
1471 /* Baseline value at the centre */
1472 bestsad = fn_ptr->sdf(what, what_stride, bestaddress,
1473 in_what_stride, UINT_MAX)
1474 + mvsad_err_cost(best_mv, &fcenter_mv, mvsadcost, sad_per_bit);
1476 /* Apply further limits to prevent us looking using vectors that stretch
1477 * beyond the UMV border
1479 if (col_min < x->mv_col_min)
1480 col_min = x->mv_col_min;
1482 if (col_max > x->mv_col_max)
1483 col_max = x->mv_col_max;
1485 if (row_min < x->mv_row_min)
1486 row_min = x->mv_row_min;
1488 if (row_max > x->mv_row_max)
1489 row_max = x->mv_row_max;
1491 for (r = row_min; r < row_max ; r++)
1493 this_mv.as_mv.row = r;
1494 check_here = r * mv_stride + in_what + col_min;
1497 while ((c + 2) < col_max)
1501 fn_ptr->sdx3f(what, what_stride, check_here, in_what_stride, sad_array);
1503 for (i = 0; i < 3; i++)
1505 thissad = sad_array[i];
1507 if (thissad < bestsad)
1509 this_mv.as_mv.col = c;
1510 thissad += mvsad_err_cost(&this_mv, &fcenter_mv,
1511 mvsadcost, sad_per_bit);
1513 if (thissad < bestsad)
1516 best_mv->as_mv.row = r;
1517 best_mv->as_mv.col = c;
1518 bestaddress = check_here;
1529 thissad = fn_ptr->sdf(what, what_stride, check_here, in_what_stride, bestsad);
1531 if (thissad < bestsad)
1533 this_mv.as_mv.col = c;
1534 thissad += mvsad_err_cost(&this_mv, &fcenter_mv,
1535 mvsadcost, sad_per_bit);
1537 if (thissad < bestsad)
1540 best_mv->as_mv.row = r;
1541 best_mv->as_mv.col = c;
1542 bestaddress = check_here;
1552 this_mv.as_mv.row = best_mv->as_mv.row << 3;
1553 this_mv.as_mv.col = best_mv->as_mv.col << 3;
1555 return fn_ptr->vf(what, what_stride, bestaddress, in_what_stride, &thissad)
1556 + mv_err_cost(&this_mv, center_mv, mvcost, x->errorperbit);
1559 int vp8_full_search_sadx8(MACROBLOCK *x, BLOCK *b, BLOCKD *d, int_mv *ref_mv,
1560 int sad_per_bit, int distance,
1561 vp8_variance_fn_ptr_t *fn_ptr, int *mvcost[2],
1564 unsigned char *what = (*(b->base_src) + b->src);
1565 int what_stride = b->src_stride;
1566 int pre_stride = x->e_mbd.pre.y_stride;
1567 unsigned char *base_pre = x->e_mbd.pre.y_buffer;
1568 unsigned char *in_what;
1569 int in_what_stride = pre_stride;
1570 int mv_stride = pre_stride;
1571 unsigned char *bestaddress;
1572 int_mv *best_mv = &d->bmi.mv;
1574 unsigned int bestsad;
1575 unsigned int thissad;
1578 unsigned char *check_here;
1580 int ref_row = ref_mv->as_mv.row;
1581 int ref_col = ref_mv->as_mv.col;
1583 int row_min = ref_row - distance;
1584 int row_max = ref_row + distance;
1585 int col_min = ref_col - distance;
1586 int col_max = ref_col + distance;
1588 DECLARE_ALIGNED_ARRAY(16, unsigned short, sad_array8, 8);
1589 unsigned int sad_array[3];
1594 mvsadcost[0] = x->mvsadcost[0];
1595 mvsadcost[1] = x->mvsadcost[1];
1596 fcenter_mv.as_mv.row = center_mv->as_mv.row >> 3;
1597 fcenter_mv.as_mv.col = center_mv->as_mv.col >> 3;
1599 /* Work out the mid point for the search */
1600 in_what = base_pre + d->offset;
1601 bestaddress = in_what + (ref_row * pre_stride) + ref_col;
1603 best_mv->as_mv.row = ref_row;
1604 best_mv->as_mv.col = ref_col;
1606 /* Baseline value at the centre */
1607 bestsad = fn_ptr->sdf(what, what_stride,
1608 bestaddress, in_what_stride, UINT_MAX)
1609 + mvsad_err_cost(best_mv, &fcenter_mv, mvsadcost, sad_per_bit);
1611 /* Apply further limits to prevent us looking using vectors that stretch
1612 * beyond the UMV border
1614 if (col_min < x->mv_col_min)
1615 col_min = x->mv_col_min;
1617 if (col_max > x->mv_col_max)
1618 col_max = x->mv_col_max;
1620 if (row_min < x->mv_row_min)
1621 row_min = x->mv_row_min;
1623 if (row_max > x->mv_row_max)
1624 row_max = x->mv_row_max;
1626 for (r = row_min; r < row_max ; r++)
1628 this_mv.as_mv.row = r;
1629 check_here = r * mv_stride + in_what + col_min;
1632 while ((c + 7) < col_max)
1636 fn_ptr->sdx8f(what, what_stride, check_here, in_what_stride, sad_array8);
1638 for (i = 0; i < 8; i++)
1640 thissad = sad_array8[i];
1642 if (thissad < bestsad)
1644 this_mv.as_mv.col = c;
1645 thissad += mvsad_err_cost(&this_mv, &fcenter_mv,
1646 mvsadcost, sad_per_bit);
1648 if (thissad < bestsad)
1651 best_mv->as_mv.row = r;
1652 best_mv->as_mv.col = c;
1653 bestaddress = check_here;
1662 while ((c + 2) < col_max)
1666 fn_ptr->sdx3f(what, what_stride, check_here , in_what_stride, sad_array);
1668 for (i = 0; i < 3; i++)
1670 thissad = sad_array[i];
1672 if (thissad < bestsad)
1674 this_mv.as_mv.col = c;
1675 thissad += mvsad_err_cost(&this_mv, &fcenter_mv,
1676 mvsadcost, sad_per_bit);
1678 if (thissad < bestsad)
1681 best_mv->as_mv.row = r;
1682 best_mv->as_mv.col = c;
1683 bestaddress = check_here;
1694 thissad = fn_ptr->sdf(what, what_stride, check_here , in_what_stride, bestsad);
1696 if (thissad < bestsad)
1698 this_mv.as_mv.col = c;
1699 thissad += mvsad_err_cost(&this_mv, &fcenter_mv,
1700 mvsadcost, sad_per_bit);
1702 if (thissad < bestsad)
1705 best_mv->as_mv.row = r;
1706 best_mv->as_mv.col = c;
1707 bestaddress = check_here;
1716 this_mv.as_mv.row = best_mv->as_mv.row * 8;
1717 this_mv.as_mv.col = best_mv->as_mv.col * 8;
1719 return fn_ptr->vf(what, what_stride, bestaddress, in_what_stride, &thissad)
1720 + mv_err_cost(&this_mv, center_mv, mvcost, x->errorperbit);
1723 int vp8_refining_search_sad_c(MACROBLOCK *x, BLOCK *b, BLOCKD *d, int_mv *ref_mv,
1724 int error_per_bit, int search_range,
1725 vp8_variance_fn_ptr_t *fn_ptr, int *mvcost[2],
1728 MV neighbors[4] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}};
1730 short this_row_offset, this_col_offset;
1732 int what_stride = b->src_stride;
1733 int pre_stride = x->e_mbd.pre.y_stride;
1734 unsigned char *base_pre = x->e_mbd.pre.y_buffer;
1735 int in_what_stride = pre_stride;
1736 unsigned char *what = (*(b->base_src) + b->src);
1737 unsigned char *best_address = (unsigned char *)(base_pre + d->offset +
1738 (ref_mv->as_mv.row * pre_stride) + ref_mv->as_mv.col);
1739 unsigned char *check_here;
1741 unsigned int bestsad;
1742 unsigned int thissad;
1747 mvsadcost[0] = x->mvsadcost[0];
1748 mvsadcost[1] = x->mvsadcost[1];
1749 fcenter_mv.as_mv.row = center_mv->as_mv.row >> 3;
1750 fcenter_mv.as_mv.col = center_mv->as_mv.col >> 3;
1752 bestsad = fn_ptr->sdf(what, what_stride, best_address,
1753 in_what_stride, UINT_MAX)
1754 + mvsad_err_cost(ref_mv, &fcenter_mv, mvsadcost, error_per_bit);
1756 for (i=0; i<search_range; i++)
1760 for (j = 0 ; j < 4 ; j++)
1762 this_row_offset = ref_mv->as_mv.row + neighbors[j].row;
1763 this_col_offset = ref_mv->as_mv.col + neighbors[j].col;
1765 if ((this_col_offset > x->mv_col_min) && (this_col_offset < x->mv_col_max) &&
1766 (this_row_offset > x->mv_row_min) && (this_row_offset < x->mv_row_max))
1768 check_here = (neighbors[j].row)*in_what_stride + neighbors[j].col + best_address;
1769 thissad = fn_ptr->sdf(what, what_stride, check_here , in_what_stride, bestsad);
1771 if (thissad < bestsad)
1773 this_mv.as_mv.row = this_row_offset;
1774 this_mv.as_mv.col = this_col_offset;
1775 thissad += mvsad_err_cost(&this_mv, &fcenter_mv, mvsadcost, error_per_bit);
1777 if (thissad < bestsad)
1786 if (best_site == -1)
1790 ref_mv->as_mv.row += neighbors[best_site].row;
1791 ref_mv->as_mv.col += neighbors[best_site].col;
1792 best_address += (neighbors[best_site].row)*in_what_stride + neighbors[best_site].col;
1796 this_mv.as_mv.row = ref_mv->as_mv.row << 3;
1797 this_mv.as_mv.col = ref_mv->as_mv.col << 3;
1799 return fn_ptr->vf(what, what_stride, best_address, in_what_stride, &thissad)
1800 + mv_err_cost(&this_mv, center_mv, mvcost, x->errorperbit);
1803 int vp8_refining_search_sadx4(MACROBLOCK *x, BLOCK *b, BLOCKD *d,
1804 int_mv *ref_mv, int error_per_bit,
1805 int search_range, vp8_variance_fn_ptr_t *fn_ptr,
1806 int *mvcost[2], int_mv *center_mv)
1808 MV neighbors[4] = {{-1, 0}, {0, -1}, {0, 1}, {1, 0}};
1810 short this_row_offset, this_col_offset;
1812 int what_stride = b->src_stride;
1813 int pre_stride = x->e_mbd.pre.y_stride;
1814 unsigned char *base_pre = x->e_mbd.pre.y_buffer;
1815 int in_what_stride = pre_stride;
1816 unsigned char *what = (*(b->base_src) + b->src);
1817 unsigned char *best_address = (unsigned char *)(base_pre + d->offset +
1818 (ref_mv->as_mv.row * pre_stride) + ref_mv->as_mv.col);
1819 unsigned char *check_here;
1821 unsigned int bestsad;
1822 unsigned int thissad;
1827 mvsadcost[0] = x->mvsadcost[0];
1828 mvsadcost[1] = x->mvsadcost[1];
1829 fcenter_mv.as_mv.row = center_mv->as_mv.row >> 3;
1830 fcenter_mv.as_mv.col = center_mv->as_mv.col >> 3;
1832 bestsad = fn_ptr->sdf(what, what_stride, best_address,
1833 in_what_stride, UINT_MAX)
1834 + mvsad_err_cost(ref_mv, &fcenter_mv, mvsadcost, error_per_bit);
1836 for (i=0; i<search_range; i++)
1841 all_in &= ((ref_mv->as_mv.row - 1) > x->mv_row_min);
1842 all_in &= ((ref_mv->as_mv.row + 1) < x->mv_row_max);
1843 all_in &= ((ref_mv->as_mv.col - 1) > x->mv_col_min);
1844 all_in &= ((ref_mv->as_mv.col + 1) < x->mv_col_max);
1848 unsigned int sad_array[4];
1849 const unsigned char *block_offset[4];
1850 block_offset[0] = best_address - in_what_stride;
1851 block_offset[1] = best_address - 1;
1852 block_offset[2] = best_address + 1;
1853 block_offset[3] = best_address + in_what_stride;
1855 fn_ptr->sdx4df(what, what_stride, block_offset, in_what_stride, sad_array);
1857 for (j = 0; j < 4; j++)
1859 if (sad_array[j] < bestsad)
1861 this_mv.as_mv.row = ref_mv->as_mv.row + neighbors[j].row;
1862 this_mv.as_mv.col = ref_mv->as_mv.col + neighbors[j].col;
1863 sad_array[j] += mvsad_err_cost(&this_mv, &fcenter_mv, mvsadcost, error_per_bit);
1865 if (sad_array[j] < bestsad)
1867 bestsad = sad_array[j];
1875 for (j = 0 ; j < 4 ; j++)
1877 this_row_offset = ref_mv->as_mv.row + neighbors[j].row;
1878 this_col_offset = ref_mv->as_mv.col + neighbors[j].col;
1880 if ((this_col_offset > x->mv_col_min) && (this_col_offset < x->mv_col_max) &&
1881 (this_row_offset > x->mv_row_min) && (this_row_offset < x->mv_row_max))
1883 check_here = (neighbors[j].row)*in_what_stride + neighbors[j].col + best_address;
1884 thissad = fn_ptr->sdf(what, what_stride, check_here , in_what_stride, bestsad);
1886 if (thissad < bestsad)
1888 this_mv.as_mv.row = this_row_offset;
1889 this_mv.as_mv.col = this_col_offset;
1890 thissad += mvsad_err_cost(&this_mv, &fcenter_mv, mvsadcost, error_per_bit);
1892 if (thissad < bestsad)
1902 if (best_site == -1)
1906 ref_mv->as_mv.row += neighbors[best_site].row;
1907 ref_mv->as_mv.col += neighbors[best_site].col;
1908 best_address += (neighbors[best_site].row)*in_what_stride + neighbors[best_site].col;
1912 this_mv.as_mv.row = ref_mv->as_mv.row * 8;
1913 this_mv.as_mv.col = ref_mv->as_mv.col * 8;
1915 return fn_ptr->vf(what, what_stride, best_address, in_what_stride, &thissad)
1916 + mv_err_cost(&this_mv, center_mv, mvcost, x->errorperbit);
1919 #ifdef VP8_ENTROPY_STATS
1920 void print_mode_context(void)
1922 FILE *f = fopen("modecont.c", "w");
1925 fprintf(f, "#include \"entropy.h\"\n");
1926 fprintf(f, "const int vp8_mode_contexts[6][4] =\n");
1929 for (j = 0; j < 6; j++)
1931 fprintf(f, " { /* %d */\n", j);
1934 for (i = 0; i < 4; i++)
1941 count = mv_mode_cts[i][0] + mv_mode_cts[i][1];
1944 overal_prob = 256 * mv_mode_cts[i][0] / count;
1948 if (overal_prob == 0)
1952 count = mv_ref_ct[j][i][0] + mv_ref_ct[j][i][1];
1955 this_prob = 256 * mv_ref_ct[j][i][0] / count;
1962 fprintf(f, "%5d, ", this_prob);
1965 fprintf(f, " },\n");
1972 /* MV ref count VP8_ENTROPY_STATS stats code */
1973 #ifdef VP8_ENTROPY_STATS
1974 void init_mv_ref_counts()
1976 vpx_memset(mv_ref_ct, 0, sizeof(mv_ref_ct));
1977 vpx_memset(mv_mode_cts, 0, sizeof(mv_mode_cts));
1980 void accum_mv_refs(MB_PREDICTION_MODE m, const int ct[4])
1984 ++mv_ref_ct [ct[0]] [0] [0];
1985 ++mv_mode_cts[0][0];
1989 ++mv_ref_ct [ct[0]] [0] [1];
1990 ++mv_mode_cts[0][1];
1994 ++mv_ref_ct [ct[1]] [1] [0];
1995 ++mv_mode_cts[1][0];
1999 ++mv_ref_ct [ct[1]] [1] [1];
2000 ++mv_mode_cts[1][1];
2004 ++mv_ref_ct [ct[2]] [2] [0];
2005 ++mv_mode_cts[2][0];
2009 ++mv_ref_ct [ct[2]] [2] [1];
2010 ++mv_mode_cts[2][1];
2014 ++mv_ref_ct [ct[3]] [3] [0];
2015 ++mv_mode_cts[3][0];
2019 ++mv_ref_ct [ct[3]] [3] [1];
2020 ++mv_mode_cts[3][1];
2027 #endif/* END MV ref count VP8_ENTROPY_STATS stats code */