OLD | NEW |
1 /* | 1 /* |
2 * Copyright (c) 2010 The WebM project authors. All Rights Reserved. | 2 * Copyright (c) 2010 The WebM project authors. All Rights Reserved. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license | 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 | 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 | 6 * tree. An additional intellectual property rights grant can be found |
7 * in the file PATENTS. All contributing project authors may | 7 * in the file PATENTS. All contributing project authors may |
8 * be found in the AUTHORS file in the root of the source tree. | 8 * be found in the AUTHORS file in the root of the source tree. |
9 */ | 9 */ |
10 | 10 |
(...skipping 18 matching lines...) Expand all Loading... |
29 { | 29 { |
30 yleft_col[i] = yleft[i* left_stride]; | 30 yleft_col[i] = yleft[i* left_stride]; |
31 } | 31 } |
32 | 32 |
33 /* for Y */ | 33 /* for Y */ |
34 switch (x->mode_info_context->mbmi.mode) | 34 switch (x->mode_info_context->mbmi.mode) |
35 { | 35 { |
36 case DC_PRED: | 36 case DC_PRED: |
37 { | 37 { |
38 int expected_dc; | 38 int expected_dc; |
39 int i; | |
40 int shift; | 39 int shift; |
41 int average = 0; | 40 int average = 0; |
42 | 41 |
43 | 42 |
44 if (x->up_available || x->left_available) | 43 if (x->up_available || x->left_available) |
45 { | 44 { |
46 if (x->up_available) | 45 if (x->up_available) |
47 { | 46 { |
48 for (i = 0; i < 16; i++) | 47 for (i = 0; i < 16; i++) |
49 { | 48 { |
(...skipping 111 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
161 uleft_col[i] = uleft [i* left_stride]; | 160 uleft_col[i] = uleft [i* left_stride]; |
162 vleft_col[i] = vleft [i* left_stride]; | 161 vleft_col[i] = vleft [i* left_stride]; |
163 } | 162 } |
164 | 163 |
165 switch (x->mode_info_context->mbmi.uv_mode) | 164 switch (x->mode_info_context->mbmi.uv_mode) |
166 { | 165 { |
167 case DC_PRED: | 166 case DC_PRED: |
168 { | 167 { |
169 int expected_udc; | 168 int expected_udc; |
170 int expected_vdc; | 169 int expected_vdc; |
171 int i; | |
172 int shift; | 170 int shift; |
173 int Uaverage = 0; | 171 int Uaverage = 0; |
174 int Vaverage = 0; | 172 int Vaverage = 0; |
175 | 173 |
176 if (x->up_available) | 174 if (x->up_available) |
177 { | 175 { |
178 for (i = 0; i < 8; i++) | 176 for (i = 0; i < 8; i++) |
179 { | 177 { |
180 Uaverage += uabove_row[i]; | 178 Uaverage += uabove_row[i]; |
181 Vaverage += vabove_row[i]; | 179 Vaverage += vabove_row[i]; |
(...skipping 28 matching lines...) Expand all Loading... |
210 { | 208 { |
211 vpx_memset(upred_ptr, expected_udc, 8); | 209 vpx_memset(upred_ptr, expected_udc, 8); |
212 vpx_memset(vpred_ptr, expected_vdc, 8); | 210 vpx_memset(vpred_ptr, expected_vdc, 8); |
213 upred_ptr += pred_stride; | 211 upred_ptr += pred_stride; |
214 vpred_ptr += pred_stride; | 212 vpred_ptr += pred_stride; |
215 } | 213 } |
216 } | 214 } |
217 break; | 215 break; |
218 case V_PRED: | 216 case V_PRED: |
219 { | 217 { |
220 int i; | |
221 | |
222 for (i = 0; i < 8; i++) | 218 for (i = 0; i < 8; i++) |
223 { | 219 { |
224 vpx_memcpy(upred_ptr, uabove_row, 8); | 220 vpx_memcpy(upred_ptr, uabove_row, 8); |
225 vpx_memcpy(vpred_ptr, vabove_row, 8); | 221 vpx_memcpy(vpred_ptr, vabove_row, 8); |
226 upred_ptr += pred_stride; | 222 upred_ptr += pred_stride; |
227 vpred_ptr += pred_stride; | 223 vpred_ptr += pred_stride; |
228 } | 224 } |
229 | 225 |
230 } | 226 } |
231 break; | 227 break; |
232 case H_PRED: | 228 case H_PRED: |
233 { | 229 { |
234 int i; | |
235 | |
236 for (i = 0; i < 8; i++) | 230 for (i = 0; i < 8; i++) |
237 { | 231 { |
238 vpx_memset(upred_ptr, uleft_col[i], 8); | 232 vpx_memset(upred_ptr, uleft_col[i], 8); |
239 vpx_memset(vpred_ptr, vleft_col[i], 8); | 233 vpx_memset(vpred_ptr, vleft_col[i], 8); |
240 upred_ptr += pred_stride; | 234 upred_ptr += pred_stride; |
241 vpred_ptr += pred_stride; | 235 vpred_ptr += pred_stride; |
242 } | 236 } |
243 } | 237 } |
244 | 238 |
245 break; | 239 break; |
246 case TM_PRED: | 240 case TM_PRED: |
247 { | 241 { |
248 int i; | |
249 | |
250 for (i = 0; i < 8; i++) | 242 for (i = 0; i < 8; i++) |
251 { | 243 { |
252 for (j = 0; j < 8; j++) | 244 for (j = 0; j < 8; j++) |
253 { | 245 { |
254 int predu = uleft_col[i] + uabove_row[j] - utop_left; | 246 int predu = uleft_col[i] + uabove_row[j] - utop_left; |
255 int predv = vleft_col[i] + vabove_row[j] - vtop_left; | 247 int predv = vleft_col[i] + vabove_row[j] - vtop_left; |
256 | 248 |
257 if (predu < 0) | 249 if (predu < 0) |
258 predu = 0; | 250 predu = 0; |
259 | 251 |
(...skipping 19 matching lines...) Expand all Loading... |
279 case B_PRED: | 271 case B_PRED: |
280 case NEARESTMV: | 272 case NEARESTMV: |
281 case NEARMV: | 273 case NEARMV: |
282 case ZEROMV: | 274 case ZEROMV: |
283 case NEWMV: | 275 case NEWMV: |
284 case SPLITMV: | 276 case SPLITMV: |
285 case MB_MODE_COUNT: | 277 case MB_MODE_COUNT: |
286 break; | 278 break; |
287 } | 279 } |
288 } | 280 } |
OLD | NEW |