1 /*
2 * Copyright (c) 2010 The WebM project authors. All Rights Reserved.
3 *
4 * Use of this source code is governed by a BSD-style license
5 * that can be found in the LICENSE file in the root of the source
6 * tree. An additional intellectual property rights grant can be found
7 * in the file PATENTS. All contributing project authors may
8 * be found in the AUTHORS file in the root of the source tree.
9 */
10
11 #include "findnearmv.h"
12
13 const unsigned char vp8_mbsplit_offset[4][16] = {
14 { 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
15 { 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
16 { 0, 2, 8, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 },
17 { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 }
18 };
19
20 /* Predict motion vectors using those from already-decoded nearby blocks.
21 Note that we only consider one 4x4 subblock from each candidate 16x16
22 macroblock. */
vp8_find_near_mvs(MACROBLOCKD * xd,const MODE_INFO * here,int_mv * nearest,int_mv * nearby,int_mv * best_mv,int near_mv_ref_cnts[4],int refframe,int * ref_frame_sign_bias)23 void vp8_find_near_mvs(MACROBLOCKD *xd, const MODE_INFO *here, int_mv *nearest,
24 int_mv *nearby, int_mv *best_mv, int near_mv_ref_cnts[4],
25 int refframe, int *ref_frame_sign_bias) {
26 const MODE_INFO *above = here - xd->mode_info_stride;
27 const MODE_INFO *left = here - 1;
28 const MODE_INFO *aboveleft = above - 1;
29 int_mv near_mvs[4];
30 int_mv *mv = near_mvs;
31 int *cntx = near_mv_ref_cnts;
32 enum { CNT_INTRA, CNT_NEAREST, CNT_NEAR, CNT_SPLITMV };
33
34 /* Zero accumulators */
35 mv[0].as_int = mv[1].as_int = mv[2].as_int = 0;
36 near_mv_ref_cnts[0] = near_mv_ref_cnts[1] = near_mv_ref_cnts[2] =
37 near_mv_ref_cnts[3] = 0;
38
39 /* Process above */
40 if (above->mbmi.ref_frame != INTRA_FRAME) {
41 if (above->mbmi.mv.as_int) {
42 (++mv)->as_int = above->mbmi.mv.as_int;
43 mv_bias(ref_frame_sign_bias[above->mbmi.ref_frame], refframe, mv,
44 ref_frame_sign_bias);
45 ++cntx;
46 }
47
48 *cntx += 2;
49 }
50
51 /* Process left */
52 if (left->mbmi.ref_frame != INTRA_FRAME) {
53 if (left->mbmi.mv.as_int) {
54 int_mv this_mv;
55
56 this_mv.as_int = left->mbmi.mv.as_int;
57 mv_bias(ref_frame_sign_bias[left->mbmi.ref_frame], refframe, &this_mv,
58 ref_frame_sign_bias);
59
60 if (this_mv.as_int != mv->as_int) {
61 (++mv)->as_int = this_mv.as_int;
62 ++cntx;
63 }
64
65 *cntx += 2;
66 } else {
67 near_mv_ref_cnts[CNT_INTRA] += 2;
68 }
69 }
70
71 /* Process above left */
72 if (aboveleft->mbmi.ref_frame != INTRA_FRAME) {
73 if (aboveleft->mbmi.mv.as_int) {
74 int_mv this_mv;
75
76 this_mv.as_int = aboveleft->mbmi.mv.as_int;
77 mv_bias(ref_frame_sign_bias[aboveleft->mbmi.ref_frame], refframe,
78 &this_mv, ref_frame_sign_bias);
79
80 if (this_mv.as_int != mv->as_int) {
81 (++mv)->as_int = this_mv.as_int;
82 ++cntx;
83 }
84
85 *cntx += 1;
86 } else {
87 near_mv_ref_cnts[CNT_INTRA] += 1;
88 }
89 }
90
91 /* If we have three distinct MV's ... */
92 if (near_mv_ref_cnts[CNT_SPLITMV]) {
93 /* See if above-left MV can be merged with NEAREST */
94 if (mv->as_int == near_mvs[CNT_NEAREST].as_int)
95 near_mv_ref_cnts[CNT_NEAREST] += 1;
96 }
97
98 near_mv_ref_cnts[CNT_SPLITMV] =
99 ((above->mbmi.mode == SPLITMV) + (left->mbmi.mode == SPLITMV)) * 2 +
100 (aboveleft->mbmi.mode == SPLITMV);
101
102 /* Swap near and nearest if necessary */
103 if (near_mv_ref_cnts[CNT_NEAR] > near_mv_ref_cnts[CNT_NEAREST]) {
104 int tmp;
105 tmp = near_mv_ref_cnts[CNT_NEAREST];
106 near_mv_ref_cnts[CNT_NEAREST] = near_mv_ref_cnts[CNT_NEAR];
107 near_mv_ref_cnts[CNT_NEAR] = tmp;
108 tmp = near_mvs[CNT_NEAREST].as_int;
109 near_mvs[CNT_NEAREST].as_int = near_mvs[CNT_NEAR].as_int;
110 near_mvs[CNT_NEAR].as_int = tmp;
111 }
112
113 /* Use near_mvs[0] to store the "best" MV */
114 if (near_mv_ref_cnts[CNT_NEAREST] >= near_mv_ref_cnts[CNT_INTRA]) {
115 near_mvs[CNT_INTRA] = near_mvs[CNT_NEAREST];
116 }
117
118 /* Set up return values */
119 best_mv->as_int = near_mvs[0].as_int;
120 nearest->as_int = near_mvs[CNT_NEAREST].as_int;
121 nearby->as_int = near_mvs[CNT_NEAR].as_int;
122 }
123
invert_and_clamp_mvs(int_mv * inv,int_mv * src,MACROBLOCKD * xd)124 static void invert_and_clamp_mvs(int_mv *inv, int_mv *src, MACROBLOCKD *xd) {
125 inv->as_mv.row = src->as_mv.row * -1;
126 inv->as_mv.col = src->as_mv.col * -1;
127 vp8_clamp_mv2(inv, xd);
128 vp8_clamp_mv2(src, xd);
129 }
130
vp8_find_near_mvs_bias(MACROBLOCKD * xd,const MODE_INFO * here,int_mv mode_mv_sb[2][MB_MODE_COUNT],int_mv best_mv_sb[2],int cnt[4],int refframe,int * ref_frame_sign_bias)131 int vp8_find_near_mvs_bias(MACROBLOCKD *xd, const MODE_INFO *here,
132 int_mv mode_mv_sb[2][MB_MODE_COUNT],
133 int_mv best_mv_sb[2], int cnt[4], int refframe,
134 int *ref_frame_sign_bias) {
135 int sign_bias = ref_frame_sign_bias[refframe];
136
137 vp8_find_near_mvs(xd, here, &mode_mv_sb[sign_bias][NEARESTMV],
138 &mode_mv_sb[sign_bias][NEARMV], &best_mv_sb[sign_bias], cnt,
139 refframe, ref_frame_sign_bias);
140
141 invert_and_clamp_mvs(&mode_mv_sb[!sign_bias][NEARESTMV],
142 &mode_mv_sb[sign_bias][NEARESTMV], xd);
143 invert_and_clamp_mvs(&mode_mv_sb[!sign_bias][NEARMV],
144 &mode_mv_sb[sign_bias][NEARMV], xd);
145 invert_and_clamp_mvs(&best_mv_sb[!sign_bias], &best_mv_sb[sign_bias], xd);
146
147 return sign_bias;
148 }
149
vp8_mv_ref_probs(vp8_prob p[VP8_MVREFS-1],const int near_mv_ref_ct[4])150 vp8_prob *vp8_mv_ref_probs(vp8_prob p[VP8_MVREFS - 1],
151 const int near_mv_ref_ct[4]) {
152 p[0] = vp8_mode_contexts[near_mv_ref_ct[0]][0];
153 p[1] = vp8_mode_contexts[near_mv_ref_ct[1]][1];
154 p[2] = vp8_mode_contexts[near_mv_ref_ct[2]][2];
155 p[3] = vp8_mode_contexts[near_mv_ref_ct[3]][3];
156 /* p[3] = vp8_mode_contexts[near_mv_ref_ct[1] + near_mv_ref_ct[2] +
157 near_mv_ref_ct[3]][3]; */
158 return p;
159 }
160