FFmpeg  2.6.9
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
error_resilience.c
Go to the documentation of this file.
1 /*
2  * Error resilience / concealment
3  *
4  * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
5  *
6  * This file is part of FFmpeg.
7  *
8  * FFmpeg is free software; you can redistribute it and/or
9  * modify it under the terms of the GNU Lesser General Public
10  * License as published by the Free Software Foundation; either
11  * version 2.1 of the License, or (at your option) any later version.
12  *
13  * FFmpeg is distributed in the hope that it will be useful,
14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16  * Lesser General Public License for more details.
17  *
18  * You should have received a copy of the GNU Lesser General Public
19  * License along with FFmpeg; if not, write to the Free Software
20  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
21  */
22 
23 /**
24  * @file
25  * Error resilience / concealment.
26  */
27 
28 #include <limits.h>
29 
30 #include "libavutil/internal.h"
31 #include "avcodec.h"
32 #include "error_resilience.h"
33 #include "me_cmp.h"
34 #include "mpegutils.h"
35 #include "mpegvideo.h"
36 #include "rectangle.h"
37 #include "thread.h"
38 #include "version.h"
39 
40 /**
41  * @param stride the number of MVs to get to the next row
42  * @param mv_step the number of MVs per row or column in a macroblock
43  */
44 static void set_mv_strides(ERContext *s, int *mv_step, int *stride)
45 {
46  if (s->avctx->codec_id == AV_CODEC_ID_H264) {
48  *mv_step = 4;
49  *stride = s->mb_width * 4;
50  } else {
51  *mv_step = 2;
52  *stride = s->b8_stride;
53  }
54 }
55 
56 /**
57  * Replace the current MB with a flat dc-only version.
58  */
59 static void put_dc(ERContext *s, uint8_t *dest_y, uint8_t *dest_cb,
60  uint8_t *dest_cr, int mb_x, int mb_y)
61 {
62  int *linesize = s->cur_pic.f->linesize;
63  int dc, dcu, dcv, y, i;
64  for (i = 0; i < 4; i++) {
65  dc = s->dc_val[0][mb_x * 2 + (i & 1) + (mb_y * 2 + (i >> 1)) * s->b8_stride];
66  if (dc < 0)
67  dc = 0;
68  else if (dc > 2040)
69  dc = 2040;
70  for (y = 0; y < 8; y++) {
71  int x;
72  for (x = 0; x < 8; x++)
73  dest_y[x + (i & 1) * 8 + (y + (i >> 1) * 8) * linesize[0]] = dc / 8;
74  }
75  }
76  dcu = s->dc_val[1][mb_x + mb_y * s->mb_stride];
77  dcv = s->dc_val[2][mb_x + mb_y * s->mb_stride];
78  if (dcu < 0)
79  dcu = 0;
80  else if (dcu > 2040)
81  dcu = 2040;
82  if (dcv < 0)
83  dcv = 0;
84  else if (dcv > 2040)
85  dcv = 2040;
86  for (y = 0; y < 8; y++) {
87  int x;
88  for (x = 0; x < 8; x++) {
89  dest_cb[x + y * linesize[1]] = dcu / 8;
90  dest_cr[x + y * linesize[2]] = dcv / 8;
91  }
92  }
93 }
94 
95 static void filter181(int16_t *data, int width, int height, int stride)
96 {
97  int x, y;
98 
99  /* horizontal filter */
100  for (y = 1; y < height - 1; y++) {
101  int prev_dc = data[0 + y * stride];
102 
103  for (x = 1; x < width - 1; x++) {
104  int dc;
105  dc = -prev_dc +
106  data[x + y * stride] * 8 -
107  data[x + 1 + y * stride];
108  dc = (dc * 10923 + 32768) >> 16;
109  prev_dc = data[x + y * stride];
110  data[x + y * stride] = dc;
111  }
112  }
113 
114  /* vertical filter */
115  for (x = 1; x < width - 1; x++) {
116  int prev_dc = data[x];
117 
118  for (y = 1; y < height - 1; y++) {
119  int dc;
120 
121  dc = -prev_dc +
122  data[x + y * stride] * 8 -
123  data[x + (y + 1) * stride];
124  dc = (dc * 10923 + 32768) >> 16;
125  prev_dc = data[x + y * stride];
126  data[x + y * stride] = dc;
127  }
128  }
129 }
130 
131 /**
132  * guess the dc of blocks which do not have an undamaged dc
133  * @param w width in 8 pixel blocks
134  * @param h height in 8 pixel blocks
135  */
136 static void guess_dc(ERContext *s, int16_t *dc, int w,
137  int h, int stride, int is_luma)
138 {
139  int b_x, b_y;
140  int16_t (*col )[4] = av_malloc_array(stride, h*sizeof( int16_t)*4);
141  uint32_t (*dist)[4] = av_malloc_array(stride, h*sizeof(uint32_t)*4);
142 
143  if(!col || !dist) {
144  av_log(s->avctx, AV_LOG_ERROR, "guess_dc() is out of memory\n");
145  goto fail;
146  }
147 
148  for(b_y=0; b_y<h; b_y++){
149  int color= 1024;
150  int distance= -1;
151  for(b_x=0; b_x<w; b_x++){
152  int mb_index_j= (b_x>>is_luma) + (b_y>>is_luma)*s->mb_stride;
153  int error_j= s->error_status_table[mb_index_j];
154  int intra_j = IS_INTRA(s->cur_pic.mb_type[mb_index_j]);
155  if(intra_j==0 || !(error_j&ER_DC_ERROR)){
156  color= dc[b_x + b_y*stride];
157  distance= b_x;
158  }
159  col [b_x + b_y*stride][1]= color;
160  dist[b_x + b_y*stride][1]= distance >= 0 ? b_x-distance : 9999;
161  }
162  color= 1024;
163  distance= -1;
164  for(b_x=w-1; b_x>=0; b_x--){
165  int mb_index_j= (b_x>>is_luma) + (b_y>>is_luma)*s->mb_stride;
166  int error_j= s->error_status_table[mb_index_j];
167  int intra_j = IS_INTRA(s->cur_pic.mb_type[mb_index_j]);
168  if(intra_j==0 || !(error_j&ER_DC_ERROR)){
169  color= dc[b_x + b_y*stride];
170  distance= b_x;
171  }
172  col [b_x + b_y*stride][0]= color;
173  dist[b_x + b_y*stride][0]= distance >= 0 ? distance-b_x : 9999;
174  }
175  }
176  for(b_x=0; b_x<w; b_x++){
177  int color= 1024;
178  int distance= -1;
179  for(b_y=0; b_y<h; b_y++){
180  int mb_index_j= (b_x>>is_luma) + (b_y>>is_luma)*s->mb_stride;
181  int error_j= s->error_status_table[mb_index_j];
182  int intra_j = IS_INTRA(s->cur_pic.mb_type[mb_index_j]);
183  if(intra_j==0 || !(error_j&ER_DC_ERROR)){
184  color= dc[b_x + b_y*stride];
185  distance= b_y;
186  }
187  col [b_x + b_y*stride][3]= color;
188  dist[b_x + b_y*stride][3]= distance >= 0 ? b_y-distance : 9999;
189  }
190  color= 1024;
191  distance= -1;
192  for(b_y=h-1; b_y>=0; b_y--){
193  int mb_index_j= (b_x>>is_luma) + (b_y>>is_luma)*s->mb_stride;
194  int error_j= s->error_status_table[mb_index_j];
195  int intra_j = IS_INTRA(s->cur_pic.mb_type[mb_index_j]);
196  if(intra_j==0 || !(error_j&ER_DC_ERROR)){
197  color= dc[b_x + b_y*stride];
198  distance= b_y;
199  }
200  col [b_x + b_y*stride][2]= color;
201  dist[b_x + b_y*stride][2]= distance >= 0 ? distance-b_y : 9999;
202  }
203  }
204 
205  for (b_y = 0; b_y < h; b_y++) {
206  for (b_x = 0; b_x < w; b_x++) {
207  int mb_index, error, j;
208  int64_t guess, weight_sum;
209  mb_index = (b_x >> is_luma) + (b_y >> is_luma) * s->mb_stride;
210  error = s->error_status_table[mb_index];
211 
212  if (IS_INTER(s->cur_pic.mb_type[mb_index]))
213  continue; // inter
214  if (!(error & ER_DC_ERROR))
215  continue; // dc-ok
216 
217  weight_sum = 0;
218  guess = 0;
219  for (j = 0; j < 4; j++) {
220  int64_t weight = 256 * 256 * 256 * 16 / FFMAX(dist[b_x + b_y*stride][j], 1);
221  guess += weight*(int64_t)col[b_x + b_y*stride][j];
222  weight_sum += weight;
223  }
224  guess = (guess + weight_sum / 2) / weight_sum;
225  dc[b_x + b_y * stride] = guess;
226  }
227  }
228 
229 fail:
230  av_freep(&col);
231  av_freep(&dist);
232 }
233 
234 /**
235  * simple horizontal deblocking filter used for error resilience
236  * @param w width in 8 pixel blocks
237  * @param h height in 8 pixel blocks
238  */
239 static void h_block_filter(ERContext *s, uint8_t *dst, int w,
240  int h, int stride, int is_luma)
241 {
242  int b_x, b_y, mvx_stride, mvy_stride;
243  const uint8_t *cm = ff_crop_tab + MAX_NEG_CROP;
244  set_mv_strides(s, &mvx_stride, &mvy_stride);
245  mvx_stride >>= is_luma;
246  mvy_stride *= mvx_stride;
247 
248  for (b_y = 0; b_y < h; b_y++) {
249  for (b_x = 0; b_x < w - 1; b_x++) {
250  int y;
251  int left_status = s->error_status_table[( b_x >> is_luma) + (b_y >> is_luma) * s->mb_stride];
252  int right_status = s->error_status_table[((b_x + 1) >> is_luma) + (b_y >> is_luma) * s->mb_stride];
253  int left_intra = IS_INTRA(s->cur_pic.mb_type[( b_x >> is_luma) + (b_y >> is_luma) * s->mb_stride]);
254  int right_intra = IS_INTRA(s->cur_pic.mb_type[((b_x + 1) >> is_luma) + (b_y >> is_luma) * s->mb_stride]);
255  int left_damage = left_status & ER_MB_ERROR;
256  int right_damage = right_status & ER_MB_ERROR;
257  int offset = b_x * 8 + b_y * stride * 8;
258  int16_t *left_mv = s->cur_pic.motion_val[0][mvy_stride * b_y + mvx_stride * b_x];
259  int16_t *right_mv = s->cur_pic.motion_val[0][mvy_stride * b_y + mvx_stride * (b_x + 1)];
260  if (!(left_damage || right_damage))
261  continue; // both undamaged
262  if ((!left_intra) && (!right_intra) &&
263  FFABS(left_mv[0] - right_mv[0]) +
264  FFABS(left_mv[1] + right_mv[1]) < 2)
265  continue;
266 
267  for (y = 0; y < 8; y++) {
268  int a, b, c, d;
269 
270  a = dst[offset + 7 + y * stride] - dst[offset + 6 + y * stride];
271  b = dst[offset + 8 + y * stride] - dst[offset + 7 + y * stride];
272  c = dst[offset + 9 + y * stride] - dst[offset + 8 + y * stride];
273 
274  d = FFABS(b) - ((FFABS(a) + FFABS(c) + 1) >> 1);
275  d = FFMAX(d, 0);
276  if (b < 0)
277  d = -d;
278 
279  if (d == 0)
280  continue;
281 
282  if (!(left_damage && right_damage))
283  d = d * 16 / 9;
284 
285  if (left_damage) {
286  dst[offset + 7 + y * stride] = cm[dst[offset + 7 + y * stride] + ((d * 7) >> 4)];
287  dst[offset + 6 + y * stride] = cm[dst[offset + 6 + y * stride] + ((d * 5) >> 4)];
288  dst[offset + 5 + y * stride] = cm[dst[offset + 5 + y * stride] + ((d * 3) >> 4)];
289  dst[offset + 4 + y * stride] = cm[dst[offset + 4 + y * stride] + ((d * 1) >> 4)];
290  }
291  if (right_damage) {
292  dst[offset + 8 + y * stride] = cm[dst[offset + 8 + y * stride] - ((d * 7) >> 4)];
293  dst[offset + 9 + y * stride] = cm[dst[offset + 9 + y * stride] - ((d * 5) >> 4)];
294  dst[offset + 10+ y * stride] = cm[dst[offset + 10 + y * stride] - ((d * 3) >> 4)];
295  dst[offset + 11+ y * stride] = cm[dst[offset + 11 + y * stride] - ((d * 1) >> 4)];
296  }
297  }
298  }
299  }
300 }
301 
302 /**
303  * simple vertical deblocking filter used for error resilience
304  * @param w width in 8 pixel blocks
305  * @param h height in 8 pixel blocks
306  */
307 static void v_block_filter(ERContext *s, uint8_t *dst, int w, int h,
308  int stride, int is_luma)
309 {
310  int b_x, b_y, mvx_stride, mvy_stride;
311  const uint8_t *cm = ff_crop_tab + MAX_NEG_CROP;
312  set_mv_strides(s, &mvx_stride, &mvy_stride);
313  mvx_stride >>= is_luma;
314  mvy_stride *= mvx_stride;
315 
316  for (b_y = 0; b_y < h - 1; b_y++) {
317  for (b_x = 0; b_x < w; b_x++) {
318  int x;
319  int top_status = s->error_status_table[(b_x >> is_luma) + (b_y >> is_luma) * s->mb_stride];
320  int bottom_status = s->error_status_table[(b_x >> is_luma) + ((b_y + 1) >> is_luma) * s->mb_stride];
321  int top_intra = IS_INTRA(s->cur_pic.mb_type[(b_x >> is_luma) + ( b_y >> is_luma) * s->mb_stride]);
322  int bottom_intra = IS_INTRA(s->cur_pic.mb_type[(b_x >> is_luma) + ((b_y + 1) >> is_luma) * s->mb_stride]);
323  int top_damage = top_status & ER_MB_ERROR;
324  int bottom_damage = bottom_status & ER_MB_ERROR;
325  int offset = b_x * 8 + b_y * stride * 8;
326 
327  int16_t *top_mv = s->cur_pic.motion_val[0][mvy_stride * b_y + mvx_stride * b_x];
328  int16_t *bottom_mv = s->cur_pic.motion_val[0][mvy_stride * (b_y + 1) + mvx_stride * b_x];
329 
330  if (!(top_damage || bottom_damage))
331  continue; // both undamaged
332 
333  if ((!top_intra) && (!bottom_intra) &&
334  FFABS(top_mv[0] - bottom_mv[0]) +
335  FFABS(top_mv[1] + bottom_mv[1]) < 2)
336  continue;
337 
338  for (x = 0; x < 8; x++) {
339  int a, b, c, d;
340 
341  a = dst[offset + x + 7 * stride] - dst[offset + x + 6 * stride];
342  b = dst[offset + x + 8 * stride] - dst[offset + x + 7 * stride];
343  c = dst[offset + x + 9 * stride] - dst[offset + x + 8 * stride];
344 
345  d = FFABS(b) - ((FFABS(a) + FFABS(c) + 1) >> 1);
346  d = FFMAX(d, 0);
347  if (b < 0)
348  d = -d;
349 
350  if (d == 0)
351  continue;
352 
353  if (!(top_damage && bottom_damage))
354  d = d * 16 / 9;
355 
356  if (top_damage) {
357  dst[offset + x + 7 * stride] = cm[dst[offset + x + 7 * stride] + ((d * 7) >> 4)];
358  dst[offset + x + 6 * stride] = cm[dst[offset + x + 6 * stride] + ((d * 5) >> 4)];
359  dst[offset + x + 5 * stride] = cm[dst[offset + x + 5 * stride] + ((d * 3) >> 4)];
360  dst[offset + x + 4 * stride] = cm[dst[offset + x + 4 * stride] + ((d * 1) >> 4)];
361  }
362  if (bottom_damage) {
363  dst[offset + x + 8 * stride] = cm[dst[offset + x + 8 * stride] - ((d * 7) >> 4)];
364  dst[offset + x + 9 * stride] = cm[dst[offset + x + 9 * stride] - ((d * 5) >> 4)];
365  dst[offset + x + 10 * stride] = cm[dst[offset + x + 10 * stride] - ((d * 3) >> 4)];
366  dst[offset + x + 11 * stride] = cm[dst[offset + x + 11 * stride] - ((d * 1) >> 4)];
367  }
368  }
369  }
370  }
371 }
372 
373 static void guess_mv(ERContext *s)
374 {
375  uint8_t *fixed = s->er_temp_buffer;
376 #define MV_FROZEN 3
377 #define MV_CHANGED 2
378 #define MV_UNCHANGED 1
379  const int mb_stride = s->mb_stride;
380  const int mb_width = s->mb_width;
381  int mb_height = s->mb_height;
382  int i, depth, num_avail;
383  int mb_x, mb_y, mot_step, mot_stride;
384 
385  if (s->last_pic.f && s->last_pic.f->data[0])
386  mb_height = FFMIN(mb_height, (s->last_pic.f->height+15)>>4);
387  if (s->next_pic.f && s->next_pic.f->data[0])
388  mb_height = FFMIN(mb_height, (s->next_pic.f->height+15)>>4);
389 
390  set_mv_strides(s, &mot_step, &mot_stride);
391 
392  num_avail = 0;
393  for (i = 0; i < mb_width * mb_height; i++) {
394  const int mb_xy = s->mb_index2xy[i];
395  int f = 0;
396  int error = s->error_status_table[mb_xy];
397 
398  if (IS_INTRA(s->cur_pic.mb_type[mb_xy]))
399  f = MV_FROZEN; // intra // FIXME check
400  if (!(error & ER_MV_ERROR))
401  f = MV_FROZEN; // inter with undamaged MV
402 
403  fixed[mb_xy] = f;
404  if (f == MV_FROZEN)
405  num_avail++;
406  else if(s->last_pic.f->data[0] && s->last_pic.motion_val[0]){
407  const int mb_y= mb_xy / s->mb_stride;
408  const int mb_x= mb_xy % s->mb_stride;
409  const int mot_index= (mb_x + mb_y*mot_stride) * mot_step;
410  s->cur_pic.motion_val[0][mot_index][0]= s->last_pic.motion_val[0][mot_index][0];
411  s->cur_pic.motion_val[0][mot_index][1]= s->last_pic.motion_val[0][mot_index][1];
412  s->cur_pic.ref_index[0][4*mb_xy] = s->last_pic.ref_index[0][4*mb_xy];
413  }
414  }
415 
416  if ((!(s->avctx->error_concealment&FF_EC_GUESS_MVS)) ||
417  num_avail <= mb_width / 2) {
418  for (mb_y = 0; mb_y < mb_height; mb_y++) {
419  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
420  const int mb_xy = mb_x + mb_y * s->mb_stride;
421  int mv_dir = (s->last_pic.f && s->last_pic.f->data[0]) ? MV_DIR_FORWARD : MV_DIR_BACKWARD;
422 
423  if (IS_INTRA(s->cur_pic.mb_type[mb_xy]))
424  continue;
425  if (!(s->error_status_table[mb_xy] & ER_MV_ERROR))
426  continue;
427 
428  s->mv[0][0][0] = 0;
429  s->mv[0][0][1] = 0;
430  s->decode_mb(s->opaque, 0, mv_dir, MV_TYPE_16X16, &s->mv,
431  mb_x, mb_y, 0, 0);
432  }
433  }
434  return;
435  }
436 
437  for (depth = 0; ; depth++) {
438  int changed, pass, none_left;
439 
440  none_left = 1;
441  changed = 1;
442  for (pass = 0; (changed || pass < 2) && pass < 10; pass++) {
443  int mb_x, mb_y;
444  int score_sum = 0;
445 
446  changed = 0;
447  for (mb_y = 0; mb_y < mb_height; mb_y++) {
448  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
449  const int mb_xy = mb_x + mb_y * s->mb_stride;
450  int mv_predictor[8][2] = { { 0 } };
451  int ref[8] = { 0 };
452  int pred_count = 0;
453  int j;
454  int best_score = 256 * 256 * 256 * 64;
455  int best_pred = 0;
456  const int mot_index = (mb_x + mb_y * mot_stride) * mot_step;
457  int prev_x = 0, prev_y = 0, prev_ref = 0;
458 
459  if ((mb_x ^ mb_y ^ pass) & 1)
460  continue;
461 
462  if (fixed[mb_xy] == MV_FROZEN)
463  continue;
464  av_assert1(!IS_INTRA(s->cur_pic.mb_type[mb_xy]));
465  av_assert1(s->last_pic.f && s->last_pic.f->data[0]);
466 
467  j = 0;
468  if (mb_x > 0 && fixed[mb_xy - 1] == MV_FROZEN)
469  j = 1;
470  if (mb_x + 1 < mb_width && fixed[mb_xy + 1] == MV_FROZEN)
471  j = 1;
472  if (mb_y > 0 && fixed[mb_xy - mb_stride] == MV_FROZEN)
473  j = 1;
474  if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride] == MV_FROZEN)
475  j = 1;
476  if (j == 0)
477  continue;
478 
479  j = 0;
480  if (mb_x > 0 && fixed[mb_xy - 1 ] == MV_CHANGED)
481  j = 1;
482  if (mb_x + 1 < mb_width && fixed[mb_xy + 1 ] == MV_CHANGED)
483  j = 1;
484  if (mb_y > 0 && fixed[mb_xy - mb_stride] == MV_CHANGED)
485  j = 1;
486  if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride] == MV_CHANGED)
487  j = 1;
488  if (j == 0 && pass > 1)
489  continue;
490 
491  none_left = 0;
492 
493  if (mb_x > 0 && fixed[mb_xy - 1]) {
494  mv_predictor[pred_count][0] =
495  s->cur_pic.motion_val[0][mot_index - mot_step][0];
496  mv_predictor[pred_count][1] =
497  s->cur_pic.motion_val[0][mot_index - mot_step][1];
498  ref[pred_count] =
499  s->cur_pic.ref_index[0][4 * (mb_xy - 1)];
500  pred_count++;
501  }
502  if (mb_x + 1 < mb_width && fixed[mb_xy + 1]) {
503  mv_predictor[pred_count][0] =
504  s->cur_pic.motion_val[0][mot_index + mot_step][0];
505  mv_predictor[pred_count][1] =
506  s->cur_pic.motion_val[0][mot_index + mot_step][1];
507  ref[pred_count] =
508  s->cur_pic.ref_index[0][4 * (mb_xy + 1)];
509  pred_count++;
510  }
511  if (mb_y > 0 && fixed[mb_xy - mb_stride]) {
512  mv_predictor[pred_count][0] =
513  s->cur_pic.motion_val[0][mot_index - mot_stride * mot_step][0];
514  mv_predictor[pred_count][1] =
515  s->cur_pic.motion_val[0][mot_index - mot_stride * mot_step][1];
516  ref[pred_count] =
517  s->cur_pic.ref_index[0][4 * (mb_xy - s->mb_stride)];
518  pred_count++;
519  }
520  if (mb_y + 1<mb_height && fixed[mb_xy + mb_stride]) {
521  mv_predictor[pred_count][0] =
522  s->cur_pic.motion_val[0][mot_index + mot_stride * mot_step][0];
523  mv_predictor[pred_count][1] =
524  s->cur_pic.motion_val[0][mot_index + mot_stride * mot_step][1];
525  ref[pred_count] =
526  s->cur_pic.ref_index[0][4 * (mb_xy + s->mb_stride)];
527  pred_count++;
528  }
529  if (pred_count == 0)
530  continue;
531 
532  if (pred_count > 1) {
533  int sum_x = 0, sum_y = 0, sum_r = 0;
534  int max_x, max_y, min_x, min_y, max_r, min_r;
535 
536  for (j = 0; j < pred_count; j++) {
537  sum_x += mv_predictor[j][0];
538  sum_y += mv_predictor[j][1];
539  sum_r += ref[j];
540  if (j && ref[j] != ref[j - 1])
541  goto skip_mean_and_median;
542  }
543 
544  /* mean */
545  mv_predictor[pred_count][0] = sum_x / j;
546  mv_predictor[pred_count][1] = sum_y / j;
547  ref[pred_count] = sum_r / j;
548 
549  /* median */
550  if (pred_count >= 3) {
551  min_y = min_x = min_r = 99999;
552  max_y = max_x = max_r = -99999;
553  } else {
554  min_x = min_y = max_x = max_y = min_r = max_r = 0;
555  }
556  for (j = 0; j < pred_count; j++) {
557  max_x = FFMAX(max_x, mv_predictor[j][0]);
558  max_y = FFMAX(max_y, mv_predictor[j][1]);
559  max_r = FFMAX(max_r, ref[j]);
560  min_x = FFMIN(min_x, mv_predictor[j][0]);
561  min_y = FFMIN(min_y, mv_predictor[j][1]);
562  min_r = FFMIN(min_r, ref[j]);
563  }
564  mv_predictor[pred_count + 1][0] = sum_x - max_x - min_x;
565  mv_predictor[pred_count + 1][1] = sum_y - max_y - min_y;
566  ref[pred_count + 1] = sum_r - max_r - min_r;
567 
568  if (pred_count == 4) {
569  mv_predictor[pred_count + 1][0] /= 2;
570  mv_predictor[pred_count + 1][1] /= 2;
571  ref[pred_count + 1] /= 2;
572  }
573  pred_count += 2;
574  }
575 
576 skip_mean_and_median:
577  /* zero MV */
578  pred_count++;
579 
580  if (!fixed[mb_xy] && 0) {
581  if (s->avctx->codec_id == AV_CODEC_ID_H264) {
582  // FIXME
583  } else {
585  mb_y, 0);
586  }
587  if (!s->last_pic.motion_val[0] ||
588  !s->last_pic.ref_index[0])
589  goto skip_last_mv;
590  prev_x = s->last_pic.motion_val[0][mot_index][0];
591  prev_y = s->last_pic.motion_val[0][mot_index][1];
592  prev_ref = s->last_pic.ref_index[0][4 * mb_xy];
593  } else {
594  prev_x = s->cur_pic.motion_val[0][mot_index][0];
595  prev_y = s->cur_pic.motion_val[0][mot_index][1];
596  prev_ref = s->cur_pic.ref_index[0][4 * mb_xy];
597  }
598 
599  /* last MV */
600  mv_predictor[pred_count][0] = prev_x;
601  mv_predictor[pred_count][1] = prev_y;
602  ref[pred_count] = prev_ref;
603  pred_count++;
604 
605 skip_last_mv:
606 
607  for (j = 0; j < pred_count; j++) {
608  int *linesize = s->cur_pic.f->linesize;
609  int score = 0;
610  uint8_t *src = s->cur_pic.f->data[0] +
611  mb_x * 16 + mb_y * 16 * linesize[0];
612 
613  s->cur_pic.motion_val[0][mot_index][0] =
614  s->mv[0][0][0] = mv_predictor[j][0];
615  s->cur_pic.motion_val[0][mot_index][1] =
616  s->mv[0][0][1] = mv_predictor[j][1];
617 
618  // predictor intra or otherwise not available
619  if (ref[j] < 0)
620  continue;
621 
622  s->decode_mb(s->opaque, ref[j], MV_DIR_FORWARD,
623  MV_TYPE_16X16, &s->mv, mb_x, mb_y, 0, 0);
624 
625  if (mb_x > 0 && fixed[mb_xy - 1]) {
626  int k;
627  for (k = 0; k < 16; k++)
628  score += FFABS(src[k * linesize[0] - 1] -
629  src[k * linesize[0]]);
630  }
631  if (mb_x + 1 < mb_width && fixed[mb_xy + 1]) {
632  int k;
633  for (k = 0; k < 16; k++)
634  score += FFABS(src[k * linesize[0] + 15] -
635  src[k * linesize[0] + 16]);
636  }
637  if (mb_y > 0 && fixed[mb_xy - mb_stride]) {
638  int k;
639  for (k = 0; k < 16; k++)
640  score += FFABS(src[k - linesize[0]] - src[k]);
641  }
642  if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride]) {
643  int k;
644  for (k = 0; k < 16; k++)
645  score += FFABS(src[k + linesize[0] * 15] -
646  src[k + linesize[0] * 16]);
647  }
648 
649  if (score <= best_score) { // <= will favor the last MV
650  best_score = score;
651  best_pred = j;
652  }
653  }
654  score_sum += best_score;
655  s->mv[0][0][0] = mv_predictor[best_pred][0];
656  s->mv[0][0][1] = mv_predictor[best_pred][1];
657 
658  for (i = 0; i < mot_step; i++)
659  for (j = 0; j < mot_step; j++) {
660  s->cur_pic.motion_val[0][mot_index + i + j * mot_stride][0] = s->mv[0][0][0];
661  s->cur_pic.motion_val[0][mot_index + i + j * mot_stride][1] = s->mv[0][0][1];
662  }
663 
664  s->decode_mb(s->opaque, ref[best_pred], MV_DIR_FORWARD,
665  MV_TYPE_16X16, &s->mv, mb_x, mb_y, 0, 0);
666 
667 
668  if (s->mv[0][0][0] != prev_x || s->mv[0][0][1] != prev_y) {
669  fixed[mb_xy] = MV_CHANGED;
670  changed++;
671  } else
672  fixed[mb_xy] = MV_UNCHANGED;
673  }
674  }
675  }
676 
677  if (none_left)
678  return;
679 
680  for (i = 0; i < mb_width * mb_height; i++) {
681  int mb_xy = s->mb_index2xy[i];
682  if (fixed[mb_xy])
683  fixed[mb_xy] = MV_FROZEN;
684  }
685  }
686 }
687 
689 {
690  int is_intra_likely, i, j, undamaged_count, skip_amount, mb_x, mb_y;
691 
692  if (!s->last_pic.f || !s->last_pic.f->data[0])
693  return 1; // no previous frame available -> use spatial prediction
694 
696  return 0;
697 
698  undamaged_count = 0;
699  for (i = 0; i < s->mb_num; i++) {
700  const int mb_xy = s->mb_index2xy[i];
701  const int error = s->error_status_table[mb_xy];
702  if (!((error & ER_DC_ERROR) && (error & ER_MV_ERROR)))
703  undamaged_count++;
704  }
705 
706  if (undamaged_count < 5)
707  return 0; // almost all MBs damaged -> use temporal prediction
708 
709  // prevent dsp.sad() check, that requires access to the image
710  if (CONFIG_XVMC &&
711  s->avctx->hwaccel && s->avctx->hwaccel->decode_mb &&
713  return 1;
714 
715  skip_amount = FFMAX(undamaged_count / 50, 1); // check only up to 50 MBs
716  is_intra_likely = 0;
717 
718  j = 0;
719  for (mb_y = 0; mb_y < s->mb_height - 1; mb_y++) {
720  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
721  int error;
722  const int mb_xy = mb_x + mb_y * s->mb_stride;
723 
724  error = s->error_status_table[mb_xy];
725  if ((error & ER_DC_ERROR) && (error & ER_MV_ERROR))
726  continue; // skip damaged
727 
728  j++;
729  // skip a few to speed things up
730  if ((j % skip_amount) != 0)
731  continue;
732 
733  if (s->cur_pic.f->pict_type == AV_PICTURE_TYPE_I) {
734  int *linesize = s->cur_pic.f->linesize;
735  uint8_t *mb_ptr = s->cur_pic.f->data[0] +
736  mb_x * 16 + mb_y * 16 * linesize[0];
737  uint8_t *last_mb_ptr = s->last_pic.f->data[0] +
738  mb_x * 16 + mb_y * 16 * linesize[0];
739 
740  if (s->avctx->codec_id == AV_CODEC_ID_H264) {
741  // FIXME
742  } else {
743  ff_thread_await_progress(s->last_pic.tf, mb_y, 0);
744  }
745  is_intra_likely += s->mecc.sad[0](NULL, last_mb_ptr, mb_ptr,
746  linesize[0], 16);
747  // FIXME need await_progress() here
748  is_intra_likely -= s->mecc.sad[0](NULL, last_mb_ptr,
749  last_mb_ptr + linesize[0] * 16,
750  linesize[0], 16);
751  } else {
752  if (IS_INTRA(s->cur_pic.mb_type[mb_xy]))
753  is_intra_likely++;
754  else
755  is_intra_likely--;
756  }
757  }
758  }
759 // av_log(NULL, AV_LOG_ERROR, "is_intra_likely: %d type:%d\n", is_intra_likely, s->pict_type);
760  return is_intra_likely > 0;
761 }
762 
764 {
765  if (!s->avctx->error_concealment)
766  return;
767 
768  if (!s->mecc_inited) {
769  ff_me_cmp_init(&s->mecc, s->avctx);
770  s->mecc_inited = 1;
771  }
772 
774  s->mb_stride * s->mb_height * sizeof(uint8_t));
775  s->error_count = 3 * s->mb_num;
776  s->error_occurred = 0;
777 }
778 
780 {
781  if(s->avctx->hwaccel && s->avctx->hwaccel->decode_slice ||
783  !s->cur_pic.f ||
785  )
786  return 0;
787  return 1;
788 }
789 
790 /**
791  * Add a slice.
792  * @param endx x component of the last macroblock, can be -1
793  * for the last of the previous line
794  * @param status the status at the end (ER_MV_END, ER_AC_ERROR, ...), it is
795  * assumed that no earlier end or error of the same type occurred
796  */
797 void ff_er_add_slice(ERContext *s, int startx, int starty,
798  int endx, int endy, int status)
799 {
800  const int start_i = av_clip(startx + starty * s->mb_width, 0, s->mb_num - 1);
801  const int end_i = av_clip(endx + endy * s->mb_width, 0, s->mb_num);
802  const int start_xy = s->mb_index2xy[start_i];
803  const int end_xy = s->mb_index2xy[end_i];
804  int mask = -1;
805 
806  if (s->avctx->hwaccel && s->avctx->hwaccel->decode_slice)
807  return;
808 
809  if (start_i > end_i || start_xy > end_xy) {
811  "internal error, slice end before start\n");
812  return;
813  }
814 
815  if (!s->avctx->error_concealment)
816  return;
817 
818  mask &= ~VP_START;
819  if (status & (ER_AC_ERROR | ER_AC_END)) {
820  mask &= ~(ER_AC_ERROR | ER_AC_END);
821  s->error_count -= end_i - start_i + 1;
822  }
823  if (status & (ER_DC_ERROR | ER_DC_END)) {
824  mask &= ~(ER_DC_ERROR | ER_DC_END);
825  s->error_count -= end_i - start_i + 1;
826  }
827  if (status & (ER_MV_ERROR | ER_MV_END)) {
828  mask &= ~(ER_MV_ERROR | ER_MV_END);
829  s->error_count -= end_i - start_i + 1;
830  }
831 
832  if (status & ER_MB_ERROR) {
833  s->error_occurred = 1;
834  s->error_count = INT_MAX;
835  }
836 
837  if (mask == ~0x7F) {
838  memset(&s->error_status_table[start_xy], 0,
839  (end_xy - start_xy) * sizeof(uint8_t));
840  } else {
841  int i;
842  for (i = start_xy; i < end_xy; i++)
843  s->error_status_table[i] &= mask;
844  }
845 
846  if (end_i == s->mb_num)
847  s->error_count = INT_MAX;
848  else {
849  s->error_status_table[end_xy] &= mask;
850  s->error_status_table[end_xy] |= status;
851  }
852 
853  s->error_status_table[start_xy] |= VP_START;
854 
855  if (start_xy > 0 && !(s->avctx->active_thread_type & FF_THREAD_SLICE) &&
856  er_supported(s) && s->avctx->skip_top * s->mb_width < start_i) {
857  int prev_status = s->error_status_table[s->mb_index2xy[start_i - 1]];
858 
859  prev_status &= ~ VP_START;
860  if (prev_status != (ER_MV_END | ER_DC_END | ER_AC_END)) {
861  s->error_occurred = 1;
862  s->error_count = INT_MAX;
863  }
864  }
865 }
866 
868 {
869  int *linesize = NULL;
870  int i, mb_x, mb_y, error, error_type, dc_error, mv_error, ac_error;
871  int distance;
872  int threshold_part[4] = { 100, 100, 100 };
873  int threshold = 50;
874  int is_intra_likely;
875  int size = s->b8_stride * 2 * s->mb_height;
876 
877  /* We do not support ER of field pictures yet,
878  * though it should not crash if enabled. */
879  if (!s->avctx->error_concealment || s->error_count == 0 ||
880  s->avctx->lowres ||
881  !er_supported(s) ||
882  s->error_count == 3 * s->mb_width *
883  (s->avctx->skip_top + s->avctx->skip_bottom)) {
884  return;
885  }
886  linesize = s->cur_pic.f->linesize;
887  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
888  int status = s->error_status_table[mb_x + (s->mb_height - 1) * s->mb_stride];
889  if (status != 0x7F)
890  break;
891  }
892 
893  if ( mb_x == s->mb_width
895  && (s->avctx->height&16)
896  && s->error_count == 3 * s->mb_width * (s->avctx->skip_top + s->avctx->skip_bottom + 1)
897  ) {
898  av_log(s->avctx, AV_LOG_DEBUG, "ignoring last missing slice\n");
899  return;
900  }
901 
902  if (s->last_pic.f) {
903  if (s->last_pic.f->width != s->cur_pic.f->width ||
904  s->last_pic.f->height != s->cur_pic.f->height ||
905  s->last_pic.f->format != s->cur_pic.f->format) {
906  av_log(s->avctx, AV_LOG_WARNING, "Cannot use previous picture in error concealment\n");
907  memset(&s->last_pic, 0, sizeof(s->last_pic));
908  }
909  }
910  if (s->next_pic.f) {
911  if (s->next_pic.f->width != s->cur_pic.f->width ||
912  s->next_pic.f->height != s->cur_pic.f->height ||
913  s->next_pic.f->format != s->cur_pic.f->format) {
914  av_log(s->avctx, AV_LOG_WARNING, "Cannot use next picture in error concealment\n");
915  memset(&s->next_pic, 0, sizeof(s->next_pic));
916  }
917  }
918 
919  if (!s->cur_pic.motion_val[0] || !s->cur_pic.ref_index[0]) {
920  av_log(s->avctx, AV_LOG_ERROR, "Warning MVs not available\n");
921 
922  for (i = 0; i < 2; i++) {
923  s->ref_index_buf[i] = av_buffer_allocz(s->mb_stride * s->mb_height * 4 * sizeof(uint8_t));
924  s->motion_val_buf[i] = av_buffer_allocz((size + 4) * 2 * sizeof(uint16_t));
925  if (!s->ref_index_buf[i] || !s->motion_val_buf[i])
926  break;
927  s->cur_pic.ref_index[i] = s->ref_index_buf[i]->data;
928  s->cur_pic.motion_val[i] = (int16_t (*)[2])s->motion_val_buf[i]->data + 4;
929  }
930  if (i < 2) {
931  for (i = 0; i < 2; i++) {
934  s->cur_pic.ref_index[i] = NULL;
935  s->cur_pic.motion_val[i] = NULL;
936  }
937  return;
938  }
939  }
940 
941  if (s->avctx->debug & FF_DEBUG_ER) {
942  for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
943  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
944  int status = s->error_status_table[mb_x + mb_y * s->mb_stride];
945 
946  av_log(s->avctx, AV_LOG_DEBUG, "%2X ", status);
947  }
948  av_log(s->avctx, AV_LOG_DEBUG, "\n");
949  }
950  }
951 
952 #if 1
953  /* handle overlapping slices */
954  for (error_type = 1; error_type <= 3; error_type++) {
955  int end_ok = 0;
956 
957  for (i = s->mb_num - 1; i >= 0; i--) {
958  const int mb_xy = s->mb_index2xy[i];
959  int error = s->error_status_table[mb_xy];
960 
961  if (error & (1 << error_type))
962  end_ok = 1;
963  if (error & (8 << error_type))
964  end_ok = 1;
965 
966  if (!end_ok)
967  s->error_status_table[mb_xy] |= 1 << error_type;
968 
969  if (error & VP_START)
970  end_ok = 0;
971  }
972  }
973 #endif
974 #if 1
975  /* handle slices with partitions of different length */
976  if (s->partitioned_frame) {
977  int end_ok = 0;
978 
979  for (i = s->mb_num - 1; i >= 0; i--) {
980  const int mb_xy = s->mb_index2xy[i];
981  int error = s->error_status_table[mb_xy];
982 
983  if (error & ER_AC_END)
984  end_ok = 0;
985  if ((error & ER_MV_END) ||
986  (error & ER_DC_END) ||
987  (error & ER_AC_ERROR))
988  end_ok = 1;
989 
990  if (!end_ok)
991  s->error_status_table[mb_xy]|= ER_AC_ERROR;
992 
993  if (error & VP_START)
994  end_ok = 0;
995  }
996  }
997 #endif
998  /* handle missing slices */
999  if (s->avctx->err_recognition & AV_EF_EXPLODE) {
1000  int end_ok = 1;
1001 
1002  // FIXME + 100 hack
1003  for (i = s->mb_num - 2; i >= s->mb_width + 100; i--) {
1004  const int mb_xy = s->mb_index2xy[i];
1005  int error1 = s->error_status_table[mb_xy];
1006  int error2 = s->error_status_table[s->mb_index2xy[i + 1]];
1007 
1008  if (error1 & VP_START)
1009  end_ok = 1;
1010 
1011  if (error2 == (VP_START | ER_MB_ERROR | ER_MB_END) &&
1012  error1 != (VP_START | ER_MB_ERROR | ER_MB_END) &&
1013  ((error1 & ER_AC_END) || (error1 & ER_DC_END) ||
1014  (error1 & ER_MV_END))) {
1015  // end & uninit
1016  end_ok = 0;
1017  }
1018 
1019  if (!end_ok)
1020  s->error_status_table[mb_xy] |= ER_MB_ERROR;
1021  }
1022  }
1023 
1024 #if 1
1025  /* backward mark errors */
1026  distance = 9999999;
1027  for (error_type = 1; error_type <= 3; error_type++) {
1028  for (i = s->mb_num - 1; i >= 0; i--) {
1029  const int mb_xy = s->mb_index2xy[i];
1030  int error = s->error_status_table[mb_xy];
1031 
1032  if (!s->mbskip_table[mb_xy]) // FIXME partition specific
1033  distance++;
1034  if (error & (1 << error_type))
1035  distance = 0;
1036 
1037  if (s->partitioned_frame) {
1038  if (distance < threshold_part[error_type - 1])
1039  s->error_status_table[mb_xy] |= 1 << error_type;
1040  } else {
1041  if (distance < threshold)
1042  s->error_status_table[mb_xy] |= 1 << error_type;
1043  }
1044 
1045  if (error & VP_START)
1046  distance = 9999999;
1047  }
1048  }
1049 #endif
1050 
1051  /* forward mark errors */
1052  error = 0;
1053  for (i = 0; i < s->mb_num; i++) {
1054  const int mb_xy = s->mb_index2xy[i];
1055  int old_error = s->error_status_table[mb_xy];
1056 
1057  if (old_error & VP_START) {
1058  error = old_error & ER_MB_ERROR;
1059  } else {
1060  error |= old_error & ER_MB_ERROR;
1061  s->error_status_table[mb_xy] |= error;
1062  }
1063  }
1064 #if 1
1065  /* handle not partitioned case */
1066  if (!s->partitioned_frame) {
1067  for (i = 0; i < s->mb_num; i++) {
1068  const int mb_xy = s->mb_index2xy[i];
1069  int error = s->error_status_table[mb_xy];
1070  if (error & ER_MB_ERROR)
1071  error |= ER_MB_ERROR;
1072  s->error_status_table[mb_xy] = error;
1073  }
1074  }
1075 #endif
1076 
1077  dc_error = ac_error = mv_error = 0;
1078  for (i = 0; i < s->mb_num; i++) {
1079  const int mb_xy = s->mb_index2xy[i];
1080  int error = s->error_status_table[mb_xy];
1081  if (error & ER_DC_ERROR)
1082  dc_error++;
1083  if (error & ER_AC_ERROR)
1084  ac_error++;
1085  if (error & ER_MV_ERROR)
1086  mv_error++;
1087  }
1088  av_log(s->avctx, AV_LOG_INFO, "concealing %d DC, %d AC, %d MV errors in %c frame\n",
1089  dc_error, ac_error, mv_error, av_get_picture_type_char(s->cur_pic.f->pict_type));
1090 
1091  is_intra_likely = is_intra_more_likely(s);
1092 
1093  /* set unknown mb-type to most likely */
1094  for (i = 0; i < s->mb_num; i++) {
1095  const int mb_xy = s->mb_index2xy[i];
1096  int error = s->error_status_table[mb_xy];
1097  if (!((error & ER_DC_ERROR) && (error & ER_MV_ERROR)))
1098  continue;
1099 
1100  if (is_intra_likely)
1101  s->cur_pic.mb_type[mb_xy] = MB_TYPE_INTRA4x4;
1102  else
1103  s->cur_pic.mb_type[mb_xy] = MB_TYPE_16x16 | MB_TYPE_L0;
1104  }
1105 
1106  // change inter to intra blocks if no reference frames are available
1107  if (!(s->last_pic.f && s->last_pic.f->data[0]) &&
1108  !(s->next_pic.f && s->next_pic.f->data[0]))
1109  for (i = 0; i < s->mb_num; i++) {
1110  const int mb_xy = s->mb_index2xy[i];
1111  if (!IS_INTRA(s->cur_pic.mb_type[mb_xy]))
1112  s->cur_pic.mb_type[mb_xy] = MB_TYPE_INTRA4x4;
1113  }
1114 
1115  /* handle inter blocks with damaged AC */
1116  for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
1117  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
1118  const int mb_xy = mb_x + mb_y * s->mb_stride;
1119  const int mb_type = s->cur_pic.mb_type[mb_xy];
1120  const int dir = !(s->last_pic.f && s->last_pic.f->data[0]);
1121  const int mv_dir = dir ? MV_DIR_BACKWARD : MV_DIR_FORWARD;
1122  int mv_type;
1123 
1124  int error = s->error_status_table[mb_xy];
1125 
1126  if (IS_INTRA(mb_type))
1127  continue; // intra
1128  if (error & ER_MV_ERROR)
1129  continue; // inter with damaged MV
1130  if (!(error & ER_AC_ERROR))
1131  continue; // undamaged inter
1132 
1133  if (IS_8X8(mb_type)) {
1134  int mb_index = mb_x * 2 + mb_y * 2 * s->b8_stride;
1135  int j;
1136  mv_type = MV_TYPE_8X8;
1137  for (j = 0; j < 4; j++) {
1138  s->mv[0][j][0] = s->cur_pic.motion_val[dir][mb_index + (j & 1) + (j >> 1) * s->b8_stride][0];
1139  s->mv[0][j][1] = s->cur_pic.motion_val[dir][mb_index + (j & 1) + (j >> 1) * s->b8_stride][1];
1140  }
1141  } else {
1142  mv_type = MV_TYPE_16X16;
1143  s->mv[0][0][0] = s->cur_pic.motion_val[dir][mb_x * 2 + mb_y * 2 * s->b8_stride][0];
1144  s->mv[0][0][1] = s->cur_pic.motion_val[dir][mb_x * 2 + mb_y * 2 * s->b8_stride][1];
1145  }
1146 
1147  s->decode_mb(s->opaque, 0 /* FIXME h264 partitioned slices need this set */,
1148  mv_dir, mv_type, &s->mv, mb_x, mb_y, 0, 0);
1149  }
1150  }
1151 
1152  /* guess MVs */
1153  if (s->cur_pic.f->pict_type == AV_PICTURE_TYPE_B) {
1154  for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
1155  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
1156  int xy = mb_x * 2 + mb_y * 2 * s->b8_stride;
1157  const int mb_xy = mb_x + mb_y * s->mb_stride;
1158  const int mb_type = s->cur_pic.mb_type[mb_xy];
1159  int mv_dir = MV_DIR_FORWARD | MV_DIR_BACKWARD;
1160 
1161  int error = s->error_status_table[mb_xy];
1162 
1163  if (IS_INTRA(mb_type))
1164  continue;
1165  if (!(error & ER_MV_ERROR))
1166  continue; // inter with undamaged MV
1167  if (!(error & ER_AC_ERROR))
1168  continue; // undamaged inter
1169 
1170  if (!(s->last_pic.f && s->last_pic.f->data[0]))
1171  mv_dir &= ~MV_DIR_FORWARD;
1172  if (!(s->next_pic.f && s->next_pic.f->data[0]))
1173  mv_dir &= ~MV_DIR_BACKWARD;
1174 
1175  if (s->pp_time) {
1176  int time_pp = s->pp_time;
1177  int time_pb = s->pb_time;
1178 
1180  ff_thread_await_progress(s->next_pic.tf, mb_y, 0);
1181 
1182  s->mv[0][0][0] = s->next_pic.motion_val[0][xy][0] * time_pb / time_pp;
1183  s->mv[0][0][1] = s->next_pic.motion_val[0][xy][1] * time_pb / time_pp;
1184  s->mv[1][0][0] = s->next_pic.motion_val[0][xy][0] * (time_pb - time_pp) / time_pp;
1185  s->mv[1][0][1] = s->next_pic.motion_val[0][xy][1] * (time_pb - time_pp) / time_pp;
1186  } else {
1187  s->mv[0][0][0] = 0;
1188  s->mv[0][0][1] = 0;
1189  s->mv[1][0][0] = 0;
1190  s->mv[1][0][1] = 0;
1191  }
1192 
1193  s->decode_mb(s->opaque, 0, mv_dir, MV_TYPE_16X16, &s->mv,
1194  mb_x, mb_y, 0, 0);
1195  }
1196  }
1197  } else
1198  guess_mv(s);
1199 
1200  /* the filters below manipulate raw image, skip them */
1201  if (CONFIG_XVMC && s->avctx->hwaccel && s->avctx->hwaccel->decode_mb)
1202  goto ec_clean;
1203  /* fill DC for inter blocks */
1204  for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
1205  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
1206  int dc, dcu, dcv, y, n;
1207  int16_t *dc_ptr;
1208  uint8_t *dest_y, *dest_cb, *dest_cr;
1209  const int mb_xy = mb_x + mb_y * s->mb_stride;
1210  const int mb_type = s->cur_pic.mb_type[mb_xy];
1211 
1212  // error = s->error_status_table[mb_xy];
1213 
1214  if (IS_INTRA(mb_type) && s->partitioned_frame)
1215  continue;
1216  // if (error & ER_MV_ERROR)
1217  // continue; // inter data damaged FIXME is this good?
1218 
1219  dest_y = s->cur_pic.f->data[0] + mb_x * 16 + mb_y * 16 * linesize[0];
1220  dest_cb = s->cur_pic.f->data[1] + mb_x * 8 + mb_y * 8 * linesize[1];
1221  dest_cr = s->cur_pic.f->data[2] + mb_x * 8 + mb_y * 8 * linesize[2];
1222 
1223  dc_ptr = &s->dc_val[0][mb_x * 2 + mb_y * 2 * s->b8_stride];
1224  for (n = 0; n < 4; n++) {
1225  dc = 0;
1226  for (y = 0; y < 8; y++) {
1227  int x;
1228  for (x = 0; x < 8; x++)
1229  dc += dest_y[x + (n & 1) * 8 +
1230  (y + (n >> 1) * 8) * linesize[0]];
1231  }
1232  dc_ptr[(n & 1) + (n >> 1) * s->b8_stride] = (dc + 4) >> 3;
1233  }
1234 
1235  dcu = dcv = 0;
1236  for (y = 0; y < 8; y++) {
1237  int x;
1238  for (x = 0; x < 8; x++) {
1239  dcu += dest_cb[x + y * linesize[1]];
1240  dcv += dest_cr[x + y * linesize[2]];
1241  }
1242  }
1243  s->dc_val[1][mb_x + mb_y * s->mb_stride] = (dcu + 4) >> 3;
1244  s->dc_val[2][mb_x + mb_y * s->mb_stride] = (dcv + 4) >> 3;
1245  }
1246  }
1247 #if 1
1248  /* guess DC for damaged blocks */
1249  guess_dc(s, s->dc_val[0], s->mb_width*2, s->mb_height*2, s->b8_stride, 1);
1250  guess_dc(s, s->dc_val[1], s->mb_width , s->mb_height , s->mb_stride, 0);
1251  guess_dc(s, s->dc_val[2], s->mb_width , s->mb_height , s->mb_stride, 0);
1252 #endif
1253 
1254  /* filter luma DC */
1255  filter181(s->dc_val[0], s->mb_width * 2, s->mb_height * 2, s->b8_stride);
1256 
1257 #if 1
1258  /* render DC only intra */
1259  for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
1260  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
1261  uint8_t *dest_y, *dest_cb, *dest_cr;
1262  const int mb_xy = mb_x + mb_y * s->mb_stride;
1263  const int mb_type = s->cur_pic.mb_type[mb_xy];
1264 
1265  int error = s->error_status_table[mb_xy];
1266 
1267  if (IS_INTER(mb_type))
1268  continue;
1269  if (!(error & ER_AC_ERROR))
1270  continue; // undamaged
1271 
1272  dest_y = s->cur_pic.f->data[0] + mb_x * 16 + mb_y * 16 * linesize[0];
1273  dest_cb = s->cur_pic.f->data[1] + mb_x * 8 + mb_y * 8 * linesize[1];
1274  dest_cr = s->cur_pic.f->data[2] + mb_x * 8 + mb_y * 8 * linesize[2];
1275 
1276  put_dc(s, dest_y, dest_cb, dest_cr, mb_x, mb_y);
1277  }
1278  }
1279 #endif
1280 
1282  /* filter horizontal block boundaries */
1283  h_block_filter(s, s->cur_pic.f->data[0], s->mb_width * 2,
1284  s->mb_height * 2, linesize[0], 1);
1285  h_block_filter(s, s->cur_pic.f->data[1], s->mb_width,
1286  s->mb_height, linesize[1], 0);
1287  h_block_filter(s, s->cur_pic.f->data[2], s->mb_width,
1288  s->mb_height, linesize[2], 0);
1289 
1290  /* filter vertical block boundaries */
1291  v_block_filter(s, s->cur_pic.f->data[0], s->mb_width * 2,
1292  s->mb_height * 2, linesize[0], 1);
1293  v_block_filter(s, s->cur_pic.f->data[1], s->mb_width,
1294  s->mb_height, linesize[1], 0);
1295  v_block_filter(s, s->cur_pic.f->data[2], s->mb_width,
1296  s->mb_height, linesize[2], 0);
1297  }
1298 
1299 ec_clean:
1300  /* clean a few tables */
1301  for (i = 0; i < s->mb_num; i++) {
1302  const int mb_xy = s->mb_index2xy[i];
1303  int error = s->error_status_table[mb_xy];
1304 
1305  if (s->cur_pic.f->pict_type != AV_PICTURE_TYPE_B &&
1306  (error & (ER_DC_ERROR | ER_MV_ERROR | ER_AC_ERROR))) {
1307  s->mbskip_table[mb_xy] = 0;
1308  }
1309  s->mbintra_table[mb_xy] = 1;
1310  }
1311 
1312  for (i = 0; i < 2; i++) {
1315  s->cur_pic.ref_index[i] = NULL;
1316  s->cur_pic.motion_val[i] = NULL;
1317  }
1318 
1319  memset(&s->cur_pic, 0, sizeof(ERPicture));
1320  memset(&s->last_pic, 0, sizeof(ERPicture));
1321  memset(&s->next_pic, 0, sizeof(ERPicture));
1322 }