FFmpeg
 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  const int mb_height = s->mb_height;
382  int i, depth, num_avail;
383  int mb_x, mb_y, mot_step, mot_stride;
384 
385  set_mv_strides(s, &mot_step, &mot_stride);
386 
387  num_avail = 0;
388  for (i = 0; i < s->mb_num; i++) {
389  const int mb_xy = s->mb_index2xy[i];
390  int f = 0;
391  int error = s->error_status_table[mb_xy];
392 
393  if (IS_INTRA(s->cur_pic.mb_type[mb_xy]))
394  f = MV_FROZEN; // intra // FIXME check
395  if (!(error & ER_MV_ERROR))
396  f = MV_FROZEN; // inter with undamaged MV
397 
398  fixed[mb_xy] = f;
399  if (f == MV_FROZEN)
400  num_avail++;
401  else if(s->last_pic.f->data[0] && s->last_pic.motion_val[0]){
402  const int mb_y= mb_xy / s->mb_stride;
403  const int mb_x= mb_xy % s->mb_stride;
404  const int mot_index= (mb_x + mb_y*mot_stride) * mot_step;
405  s->cur_pic.motion_val[0][mot_index][0]= s->last_pic.motion_val[0][mot_index][0];
406  s->cur_pic.motion_val[0][mot_index][1]= s->last_pic.motion_val[0][mot_index][1];
407  s->cur_pic.ref_index[0][4*mb_xy] = s->last_pic.ref_index[0][4*mb_xy];
408  }
409  }
410 
411  if ((!(s->avctx->error_concealment&FF_EC_GUESS_MVS)) ||
412  num_avail <= mb_width / 2) {
413  for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
414  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
415  const int mb_xy = mb_x + mb_y * s->mb_stride;
416  int mv_dir = (s->last_pic.f && s->last_pic.f->data[0]) ? MV_DIR_FORWARD : MV_DIR_BACKWARD;
417 
418  if (IS_INTRA(s->cur_pic.mb_type[mb_xy]))
419  continue;
420  if (!(s->error_status_table[mb_xy] & ER_MV_ERROR))
421  continue;
422 
423  s->mv[0][0][0] = 0;
424  s->mv[0][0][1] = 0;
425  s->decode_mb(s->opaque, 0, mv_dir, MV_TYPE_16X16, &s->mv,
426  mb_x, mb_y, 0, 0);
427  }
428  }
429  return;
430  }
431 
432  for (depth = 0; ; depth++) {
433  int changed, pass, none_left;
434 
435  none_left = 1;
436  changed = 1;
437  for (pass = 0; (changed || pass < 2) && pass < 10; pass++) {
438  int mb_x, mb_y;
439  int score_sum = 0;
440 
441  changed = 0;
442  for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
443  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
444  const int mb_xy = mb_x + mb_y * s->mb_stride;
445  int mv_predictor[8][2] = { { 0 } };
446  int ref[8] = { 0 };
447  int pred_count = 0;
448  int j;
449  int best_score = 256 * 256 * 256 * 64;
450  int best_pred = 0;
451  const int mot_index = (mb_x + mb_y * mot_stride) * mot_step;
452  int prev_x = 0, prev_y = 0, prev_ref = 0;
453 
454  if ((mb_x ^ mb_y ^ pass) & 1)
455  continue;
456 
457  if (fixed[mb_xy] == MV_FROZEN)
458  continue;
459  av_assert1(!IS_INTRA(s->cur_pic.mb_type[mb_xy]));
460  av_assert1(s->last_pic.f && s->last_pic.f->data[0]);
461 
462  j = 0;
463  if (mb_x > 0 && fixed[mb_xy - 1] == MV_FROZEN)
464  j = 1;
465  if (mb_x + 1 < mb_width && fixed[mb_xy + 1] == MV_FROZEN)
466  j = 1;
467  if (mb_y > 0 && fixed[mb_xy - mb_stride] == MV_FROZEN)
468  j = 1;
469  if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride] == MV_FROZEN)
470  j = 1;
471  if (j == 0)
472  continue;
473 
474  j = 0;
475  if (mb_x > 0 && fixed[mb_xy - 1 ] == MV_CHANGED)
476  j = 1;
477  if (mb_x + 1 < mb_width && fixed[mb_xy + 1 ] == MV_CHANGED)
478  j = 1;
479  if (mb_y > 0 && fixed[mb_xy - mb_stride] == MV_CHANGED)
480  j = 1;
481  if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride] == MV_CHANGED)
482  j = 1;
483  if (j == 0 && pass > 1)
484  continue;
485 
486  none_left = 0;
487 
488  if (mb_x > 0 && fixed[mb_xy - 1]) {
489  mv_predictor[pred_count][0] =
490  s->cur_pic.motion_val[0][mot_index - mot_step][0];
491  mv_predictor[pred_count][1] =
492  s->cur_pic.motion_val[0][mot_index - mot_step][1];
493  ref[pred_count] =
494  s->cur_pic.ref_index[0][4 * (mb_xy - 1)];
495  pred_count++;
496  }
497  if (mb_x + 1 < mb_width && fixed[mb_xy + 1]) {
498  mv_predictor[pred_count][0] =
499  s->cur_pic.motion_val[0][mot_index + mot_step][0];
500  mv_predictor[pred_count][1] =
501  s->cur_pic.motion_val[0][mot_index + mot_step][1];
502  ref[pred_count] =
503  s->cur_pic.ref_index[0][4 * (mb_xy + 1)];
504  pred_count++;
505  }
506  if (mb_y > 0 && fixed[mb_xy - mb_stride]) {
507  mv_predictor[pred_count][0] =
508  s->cur_pic.motion_val[0][mot_index - mot_stride * mot_step][0];
509  mv_predictor[pred_count][1] =
510  s->cur_pic.motion_val[0][mot_index - mot_stride * mot_step][1];
511  ref[pred_count] =
512  s->cur_pic.ref_index[0][4 * (mb_xy - s->mb_stride)];
513  pred_count++;
514  }
515  if (mb_y + 1<mb_height && fixed[mb_xy + mb_stride]) {
516  mv_predictor[pred_count][0] =
517  s->cur_pic.motion_val[0][mot_index + mot_stride * mot_step][0];
518  mv_predictor[pred_count][1] =
519  s->cur_pic.motion_val[0][mot_index + mot_stride * mot_step][1];
520  ref[pred_count] =
521  s->cur_pic.ref_index[0][4 * (mb_xy + s->mb_stride)];
522  pred_count++;
523  }
524  if (pred_count == 0)
525  continue;
526 
527  if (pred_count > 1) {
528  int sum_x = 0, sum_y = 0, sum_r = 0;
529  int max_x, max_y, min_x, min_y, max_r, min_r;
530 
531  for (j = 0; j < pred_count; j++) {
532  sum_x += mv_predictor[j][0];
533  sum_y += mv_predictor[j][1];
534  sum_r += ref[j];
535  if (j && ref[j] != ref[j - 1])
536  goto skip_mean_and_median;
537  }
538 
539  /* mean */
540  mv_predictor[pred_count][0] = sum_x / j;
541  mv_predictor[pred_count][1] = sum_y / j;
542  ref[pred_count] = sum_r / j;
543 
544  /* median */
545  if (pred_count >= 3) {
546  min_y = min_x = min_r = 99999;
547  max_y = max_x = max_r = -99999;
548  } else {
549  min_x = min_y = max_x = max_y = min_r = max_r = 0;
550  }
551  for (j = 0; j < pred_count; j++) {
552  max_x = FFMAX(max_x, mv_predictor[j][0]);
553  max_y = FFMAX(max_y, mv_predictor[j][1]);
554  max_r = FFMAX(max_r, ref[j]);
555  min_x = FFMIN(min_x, mv_predictor[j][0]);
556  min_y = FFMIN(min_y, mv_predictor[j][1]);
557  min_r = FFMIN(min_r, ref[j]);
558  }
559  mv_predictor[pred_count + 1][0] = sum_x - max_x - min_x;
560  mv_predictor[pred_count + 1][1] = sum_y - max_y - min_y;
561  ref[pred_count + 1] = sum_r - max_r - min_r;
562 
563  if (pred_count == 4) {
564  mv_predictor[pred_count + 1][0] /= 2;
565  mv_predictor[pred_count + 1][1] /= 2;
566  ref[pred_count + 1] /= 2;
567  }
568  pred_count += 2;
569  }
570 
571 skip_mean_and_median:
572  /* zero MV */
573  pred_count++;
574 
575  if (!fixed[mb_xy] && 0) {
576  if (s->avctx->codec_id == AV_CODEC_ID_H264) {
577  // FIXME
578  } else {
580  mb_y, 0);
581  }
582  if (!s->last_pic.motion_val[0] ||
583  !s->last_pic.ref_index[0])
584  goto skip_last_mv;
585  prev_x = s->last_pic.motion_val[0][mot_index][0];
586  prev_y = s->last_pic.motion_val[0][mot_index][1];
587  prev_ref = s->last_pic.ref_index[0][4 * mb_xy];
588  } else {
589  prev_x = s->cur_pic.motion_val[0][mot_index][0];
590  prev_y = s->cur_pic.motion_val[0][mot_index][1];
591  prev_ref = s->cur_pic.ref_index[0][4 * mb_xy];
592  }
593 
594  /* last MV */
595  mv_predictor[pred_count][0] = prev_x;
596  mv_predictor[pred_count][1] = prev_y;
597  ref[pred_count] = prev_ref;
598  pred_count++;
599 
600 skip_last_mv:
601 
602  for (j = 0; j < pred_count; j++) {
603  int *linesize = s->cur_pic.f->linesize;
604  int score = 0;
605  uint8_t *src = s->cur_pic.f->data[0] +
606  mb_x * 16 + mb_y * 16 * linesize[0];
607 
608  s->cur_pic.motion_val[0][mot_index][0] =
609  s->mv[0][0][0] = mv_predictor[j][0];
610  s->cur_pic.motion_val[0][mot_index][1] =
611  s->mv[0][0][1] = mv_predictor[j][1];
612 
613  // predictor intra or otherwise not available
614  if (ref[j] < 0)
615  continue;
616 
617  s->decode_mb(s->opaque, ref[j], MV_DIR_FORWARD,
618  MV_TYPE_16X16, &s->mv, mb_x, mb_y, 0, 0);
619 
620  if (mb_x > 0 && fixed[mb_xy - 1]) {
621  int k;
622  for (k = 0; k < 16; k++)
623  score += FFABS(src[k * linesize[0] - 1] -
624  src[k * linesize[0]]);
625  }
626  if (mb_x + 1 < mb_width && fixed[mb_xy + 1]) {
627  int k;
628  for (k = 0; k < 16; k++)
629  score += FFABS(src[k * linesize[0] + 15] -
630  src[k * linesize[0] + 16]);
631  }
632  if (mb_y > 0 && fixed[mb_xy - mb_stride]) {
633  int k;
634  for (k = 0; k < 16; k++)
635  score += FFABS(src[k - linesize[0]] - src[k]);
636  }
637  if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride]) {
638  int k;
639  for (k = 0; k < 16; k++)
640  score += FFABS(src[k + linesize[0] * 15] -
641  src[k + linesize[0] * 16]);
642  }
643 
644  if (score <= best_score) { // <= will favor the last MV
645  best_score = score;
646  best_pred = j;
647  }
648  }
649  score_sum += best_score;
650  s->mv[0][0][0] = mv_predictor[best_pred][0];
651  s->mv[0][0][1] = mv_predictor[best_pred][1];
652 
653  for (i = 0; i < mot_step; i++)
654  for (j = 0; j < mot_step; j++) {
655  s->cur_pic.motion_val[0][mot_index + i + j * mot_stride][0] = s->mv[0][0][0];
656  s->cur_pic.motion_val[0][mot_index + i + j * mot_stride][1] = s->mv[0][0][1];
657  }
658 
659  s->decode_mb(s->opaque, ref[best_pred], MV_DIR_FORWARD,
660  MV_TYPE_16X16, &s->mv, mb_x, mb_y, 0, 0);
661 
662 
663  if (s->mv[0][0][0] != prev_x || s->mv[0][0][1] != prev_y) {
664  fixed[mb_xy] = MV_CHANGED;
665  changed++;
666  } else
667  fixed[mb_xy] = MV_UNCHANGED;
668  }
669  }
670  }
671 
672  if (none_left)
673  return;
674 
675  for (i = 0; i < s->mb_num; i++) {
676  int mb_xy = s->mb_index2xy[i];
677  if (fixed[mb_xy])
678  fixed[mb_xy] = MV_FROZEN;
679  }
680  }
681 }
682 
684 {
685  int is_intra_likely, i, j, undamaged_count, skip_amount, mb_x, mb_y;
686 
687  if (!s->last_pic.f || !s->last_pic.f->data[0])
688  return 1; // no previous frame available -> use spatial prediction
689 
691  return 0;
692 
693  undamaged_count = 0;
694  for (i = 0; i < s->mb_num; i++) {
695  const int mb_xy = s->mb_index2xy[i];
696  const int error = s->error_status_table[mb_xy];
697  if (!((error & ER_DC_ERROR) && (error & ER_MV_ERROR)))
698  undamaged_count++;
699  }
700 
701  if (undamaged_count < 5)
702  return 0; // almost all MBs damaged -> use temporal prediction
703 
704  // prevent dsp.sad() check, that requires access to the image
705  if (CONFIG_XVMC &&
706  s->avctx->hwaccel && s->avctx->hwaccel->decode_mb &&
708  return 1;
709 
710  skip_amount = FFMAX(undamaged_count / 50, 1); // check only up to 50 MBs
711  is_intra_likely = 0;
712 
713  j = 0;
714  for (mb_y = 0; mb_y < s->mb_height - 1; mb_y++) {
715  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
716  int error;
717  const int mb_xy = mb_x + mb_y * s->mb_stride;
718 
719  error = s->error_status_table[mb_xy];
720  if ((error & ER_DC_ERROR) && (error & ER_MV_ERROR))
721  continue; // skip damaged
722 
723  j++;
724  // skip a few to speed things up
725  if ((j % skip_amount) != 0)
726  continue;
727 
728  if (s->cur_pic.f->pict_type == AV_PICTURE_TYPE_I) {
729  int *linesize = s->cur_pic.f->linesize;
730  uint8_t *mb_ptr = s->cur_pic.f->data[0] +
731  mb_x * 16 + mb_y * 16 * linesize[0];
732  uint8_t *last_mb_ptr = s->last_pic.f->data[0] +
733  mb_x * 16 + mb_y * 16 * linesize[0];
734 
735  if (s->avctx->codec_id == AV_CODEC_ID_H264) {
736  // FIXME
737  } else {
738  ff_thread_await_progress(s->last_pic.tf, mb_y, 0);
739  }
740  is_intra_likely += s->mecc.sad[0](NULL, last_mb_ptr, mb_ptr,
741  linesize[0], 16);
742  // FIXME need await_progress() here
743  is_intra_likely -= s->mecc.sad[0](NULL, last_mb_ptr,
744  last_mb_ptr + linesize[0] * 16,
745  linesize[0], 16);
746  } else {
747  if (IS_INTRA(s->cur_pic.mb_type[mb_xy]))
748  is_intra_likely++;
749  else
750  is_intra_likely--;
751  }
752  }
753  }
754 // av_log(NULL, AV_LOG_ERROR, "is_intra_likely: %d type:%d\n", is_intra_likely, s->pict_type);
755  return is_intra_likely > 0;
756 }
757 
759 {
760  if (!s->avctx->error_concealment)
761  return;
762 
763  if (!s->mecc_inited) {
764  ff_me_cmp_init(&s->mecc, s->avctx);
765  s->mecc_inited = 1;
766  }
767 
769  s->mb_stride * s->mb_height * sizeof(uint8_t));
770  s->error_count = 3 * s->mb_num;
771  s->error_occurred = 0;
772 }
773 
775 {
776  if(s->avctx->hwaccel && s->avctx->hwaccel->decode_slice ||
778  !s->cur_pic.f ||
780  )
781  return 0;
782  return 1;
783 }
784 
785 /**
786  * Add a slice.
787  * @param endx x component of the last macroblock, can be -1
788  * for the last of the previous line
789  * @param status the status at the end (ER_MV_END, ER_AC_ERROR, ...), it is
790  * assumed that no earlier end or error of the same type occurred
791  */
792 void ff_er_add_slice(ERContext *s, int startx, int starty,
793  int endx, int endy, int status)
794 {
795  const int start_i = av_clip(startx + starty * s->mb_width, 0, s->mb_num - 1);
796  const int end_i = av_clip(endx + endy * s->mb_width, 0, s->mb_num);
797  const int start_xy = s->mb_index2xy[start_i];
798  const int end_xy = s->mb_index2xy[end_i];
799  int mask = -1;
800 
801  if (s->avctx->hwaccel && s->avctx->hwaccel->decode_slice)
802  return;
803 
804  if (start_i > end_i || start_xy > end_xy) {
806  "internal error, slice end before start\n");
807  return;
808  }
809 
810  if (!s->avctx->error_concealment)
811  return;
812 
813  mask &= ~VP_START;
814  if (status & (ER_AC_ERROR | ER_AC_END)) {
815  mask &= ~(ER_AC_ERROR | ER_AC_END);
816  s->error_count -= end_i - start_i + 1;
817  }
818  if (status & (ER_DC_ERROR | ER_DC_END)) {
819  mask &= ~(ER_DC_ERROR | ER_DC_END);
820  s->error_count -= end_i - start_i + 1;
821  }
822  if (status & (ER_MV_ERROR | ER_MV_END)) {
823  mask &= ~(ER_MV_ERROR | ER_MV_END);
824  s->error_count -= end_i - start_i + 1;
825  }
826 
827  if (status & ER_MB_ERROR) {
828  s->error_occurred = 1;
829  s->error_count = INT_MAX;
830  }
831 
832  if (mask == ~0x7F) {
833  memset(&s->error_status_table[start_xy], 0,
834  (end_xy - start_xy) * sizeof(uint8_t));
835  } else {
836  int i;
837  for (i = start_xy; i < end_xy; i++)
838  s->error_status_table[i] &= mask;
839  }
840 
841  if (end_i == s->mb_num)
842  s->error_count = INT_MAX;
843  else {
844  s->error_status_table[end_xy] &= mask;
845  s->error_status_table[end_xy] |= status;
846  }
847 
848  s->error_status_table[start_xy] |= VP_START;
849 
850  if (start_xy > 0 && !(s->avctx->active_thread_type & FF_THREAD_SLICE) &&
851  er_supported(s) && s->avctx->skip_top * s->mb_width < start_i) {
852  int prev_status = s->error_status_table[s->mb_index2xy[start_i - 1]];
853 
854  prev_status &= ~ VP_START;
855  if (prev_status != (ER_MV_END | ER_DC_END | ER_AC_END)) {
856  s->error_occurred = 1;
857  s->error_count = INT_MAX;
858  }
859  }
860 }
861 
863 {
864  int *linesize = NULL;
865  int i, mb_x, mb_y, error, error_type, dc_error, mv_error, ac_error;
866  int distance;
867  int threshold_part[4] = { 100, 100, 100 };
868  int threshold = 50;
869  int is_intra_likely;
870  int size = s->b8_stride * 2 * s->mb_height;
871 
872  /* We do not support ER of field pictures yet,
873  * though it should not crash if enabled. */
874  if (!s->avctx->error_concealment || s->error_count == 0 ||
875  s->avctx->lowres ||
876  !er_supported(s) ||
877  s->error_count == 3 * s->mb_width *
878  (s->avctx->skip_top + s->avctx->skip_bottom)) {
879  return;
880  }
881  linesize = s->cur_pic.f->linesize;
882  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
883  int status = s->error_status_table[mb_x + (s->mb_height - 1) * s->mb_stride];
884  if (status != 0x7F)
885  break;
886  }
887 
888  if ( mb_x == s->mb_width
890  && (s->avctx->height&16)
891  && s->error_count == 3 * s->mb_width * (s->avctx->skip_top + s->avctx->skip_bottom + 1)
892  ) {
893  av_log(s->avctx, AV_LOG_DEBUG, "ignoring last missing slice\n");
894  return;
895  }
896 
897  if (s->last_pic.f) {
898  if (s->last_pic.f->width != s->cur_pic.f->width ||
899  s->last_pic.f->height != s->cur_pic.f->height ||
900  s->last_pic.f->format != s->cur_pic.f->format) {
901  av_log(s->avctx, AV_LOG_WARNING, "Cannot use previous picture in error concealment\n");
902  memset(&s->last_pic, 0, sizeof(s->last_pic));
903  }
904  }
905  if (s->next_pic.f) {
906  if (s->next_pic.f->width != s->cur_pic.f->width ||
907  s->next_pic.f->height != s->cur_pic.f->height ||
908  s->next_pic.f->format != s->cur_pic.f->format) {
909  av_log(s->avctx, AV_LOG_WARNING, "Cannot use next picture in error concealment\n");
910  memset(&s->next_pic, 0, sizeof(s->next_pic));
911  }
912  }
913 
914  if (!s->cur_pic.motion_val[0] || !s->cur_pic.ref_index[0]) {
915  av_log(s->avctx, AV_LOG_ERROR, "Warning MVs not available\n");
916 
917  for (i = 0; i < 2; i++) {
918  s->ref_index_buf[i] = av_buffer_allocz(s->mb_stride * s->mb_height * 4 * sizeof(uint8_t));
919  s->motion_val_buf[i] = av_buffer_allocz((size + 4) * 2 * sizeof(uint16_t));
920  if (!s->ref_index_buf[i] || !s->motion_val_buf[i])
921  break;
922  s->cur_pic.ref_index[i] = s->ref_index_buf[i]->data;
923  s->cur_pic.motion_val[i] = (int16_t (*)[2])s->motion_val_buf[i]->data + 4;
924  }
925  if (i < 2) {
926  for (i = 0; i < 2; i++) {
929  s->cur_pic.ref_index[i] = NULL;
930  s->cur_pic.motion_val[i] = NULL;
931  }
932  return;
933  }
934  }
935 
936  if (s->avctx->debug & FF_DEBUG_ER) {
937  for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
938  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
939  int status = s->error_status_table[mb_x + mb_y * s->mb_stride];
940 
941  av_log(s->avctx, AV_LOG_DEBUG, "%2X ", status);
942  }
943  av_log(s->avctx, AV_LOG_DEBUG, "\n");
944  }
945  }
946 
947 #if 1
948  /* handle overlapping slices */
949  for (error_type = 1; error_type <= 3; error_type++) {
950  int end_ok = 0;
951 
952  for (i = s->mb_num - 1; i >= 0; i--) {
953  const int mb_xy = s->mb_index2xy[i];
954  int error = s->error_status_table[mb_xy];
955 
956  if (error & (1 << error_type))
957  end_ok = 1;
958  if (error & (8 << error_type))
959  end_ok = 1;
960 
961  if (!end_ok)
962  s->error_status_table[mb_xy] |= 1 << error_type;
963 
964  if (error & VP_START)
965  end_ok = 0;
966  }
967  }
968 #endif
969 #if 1
970  /* handle slices with partitions of different length */
971  if (s->partitioned_frame) {
972  int end_ok = 0;
973 
974  for (i = s->mb_num - 1; i >= 0; i--) {
975  const int mb_xy = s->mb_index2xy[i];
976  int error = s->error_status_table[mb_xy];
977 
978  if (error & ER_AC_END)
979  end_ok = 0;
980  if ((error & ER_MV_END) ||
981  (error & ER_DC_END) ||
982  (error & ER_AC_ERROR))
983  end_ok = 1;
984 
985  if (!end_ok)
986  s->error_status_table[mb_xy]|= ER_AC_ERROR;
987 
988  if (error & VP_START)
989  end_ok = 0;
990  }
991  }
992 #endif
993  /* handle missing slices */
994  if (s->avctx->err_recognition & AV_EF_EXPLODE) {
995  int end_ok = 1;
996 
997  // FIXME + 100 hack
998  for (i = s->mb_num - 2; i >= s->mb_width + 100; i--) {
999  const int mb_xy = s->mb_index2xy[i];
1000  int error1 = s->error_status_table[mb_xy];
1001  int error2 = s->error_status_table[s->mb_index2xy[i + 1]];
1002 
1003  if (error1 & VP_START)
1004  end_ok = 1;
1005 
1006  if (error2 == (VP_START | ER_MB_ERROR | ER_MB_END) &&
1007  error1 != (VP_START | ER_MB_ERROR | ER_MB_END) &&
1008  ((error1 & ER_AC_END) || (error1 & ER_DC_END) ||
1009  (error1 & ER_MV_END))) {
1010  // end & uninit
1011  end_ok = 0;
1012  }
1013 
1014  if (!end_ok)
1015  s->error_status_table[mb_xy] |= ER_MB_ERROR;
1016  }
1017  }
1018 
1019 #if 1
1020  /* backward mark errors */
1021  distance = 9999999;
1022  for (error_type = 1; error_type <= 3; error_type++) {
1023  for (i = s->mb_num - 1; i >= 0; i--) {
1024  const int mb_xy = s->mb_index2xy[i];
1025  int error = s->error_status_table[mb_xy];
1026 
1027  if (!s->mbskip_table[mb_xy]) // FIXME partition specific
1028  distance++;
1029  if (error & (1 << error_type))
1030  distance = 0;
1031 
1032  if (s->partitioned_frame) {
1033  if (distance < threshold_part[error_type - 1])
1034  s->error_status_table[mb_xy] |= 1 << error_type;
1035  } else {
1036  if (distance < threshold)
1037  s->error_status_table[mb_xy] |= 1 << error_type;
1038  }
1039 
1040  if (error & VP_START)
1041  distance = 9999999;
1042  }
1043  }
1044 #endif
1045 
1046  /* forward mark errors */
1047  error = 0;
1048  for (i = 0; i < s->mb_num; i++) {
1049  const int mb_xy = s->mb_index2xy[i];
1050  int old_error = s->error_status_table[mb_xy];
1051 
1052  if (old_error & VP_START) {
1053  error = old_error & ER_MB_ERROR;
1054  } else {
1055  error |= old_error & ER_MB_ERROR;
1056  s->error_status_table[mb_xy] |= error;
1057  }
1058  }
1059 #if 1
1060  /* handle not partitioned case */
1061  if (!s->partitioned_frame) {
1062  for (i = 0; i < s->mb_num; i++) {
1063  const int mb_xy = s->mb_index2xy[i];
1064  int error = s->error_status_table[mb_xy];
1065  if (error & ER_MB_ERROR)
1066  error |= ER_MB_ERROR;
1067  s->error_status_table[mb_xy] = error;
1068  }
1069  }
1070 #endif
1071 
1072  dc_error = ac_error = mv_error = 0;
1073  for (i = 0; i < s->mb_num; i++) {
1074  const int mb_xy = s->mb_index2xy[i];
1075  int error = s->error_status_table[mb_xy];
1076  if (error & ER_DC_ERROR)
1077  dc_error++;
1078  if (error & ER_AC_ERROR)
1079  ac_error++;
1080  if (error & ER_MV_ERROR)
1081  mv_error++;
1082  }
1083  av_log(s->avctx, AV_LOG_INFO, "concealing %d DC, %d AC, %d MV errors in %c frame\n",
1084  dc_error, ac_error, mv_error, av_get_picture_type_char(s->cur_pic.f->pict_type));
1085 
1086  is_intra_likely = is_intra_more_likely(s);
1087 
1088  /* set unknown mb-type to most likely */
1089  for (i = 0; i < s->mb_num; i++) {
1090  const int mb_xy = s->mb_index2xy[i];
1091  int error = s->error_status_table[mb_xy];
1092  if (!((error & ER_DC_ERROR) && (error & ER_MV_ERROR)))
1093  continue;
1094 
1095  if (is_intra_likely)
1096  s->cur_pic.mb_type[mb_xy] = MB_TYPE_INTRA4x4;
1097  else
1098  s->cur_pic.mb_type[mb_xy] = MB_TYPE_16x16 | MB_TYPE_L0;
1099  }
1100 
1101  // change inter to intra blocks if no reference frames are available
1102  if (!(s->last_pic.f && s->last_pic.f->data[0]) &&
1103  !(s->next_pic.f && s->next_pic.f->data[0]))
1104  for (i = 0; i < s->mb_num; i++) {
1105  const int mb_xy = s->mb_index2xy[i];
1106  if (!IS_INTRA(s->cur_pic.mb_type[mb_xy]))
1107  s->cur_pic.mb_type[mb_xy] = MB_TYPE_INTRA4x4;
1108  }
1109 
1110  /* handle inter blocks with damaged AC */
1111  for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
1112  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
1113  const int mb_xy = mb_x + mb_y * s->mb_stride;
1114  const int mb_type = s->cur_pic.mb_type[mb_xy];
1115  const int dir = !(s->last_pic.f && s->last_pic.f->data[0]);
1116  const int mv_dir = dir ? MV_DIR_BACKWARD : MV_DIR_FORWARD;
1117  int mv_type;
1118 
1119  int error = s->error_status_table[mb_xy];
1120 
1121  if (IS_INTRA(mb_type))
1122  continue; // intra
1123  if (error & ER_MV_ERROR)
1124  continue; // inter with damaged MV
1125  if (!(error & ER_AC_ERROR))
1126  continue; // undamaged inter
1127 
1128  if (IS_8X8(mb_type)) {
1129  int mb_index = mb_x * 2 + mb_y * 2 * s->b8_stride;
1130  int j;
1131  mv_type = MV_TYPE_8X8;
1132  for (j = 0; j < 4; j++) {
1133  s->mv[0][j][0] = s->cur_pic.motion_val[dir][mb_index + (j & 1) + (j >> 1) * s->b8_stride][0];
1134  s->mv[0][j][1] = s->cur_pic.motion_val[dir][mb_index + (j & 1) + (j >> 1) * s->b8_stride][1];
1135  }
1136  } else {
1137  mv_type = MV_TYPE_16X16;
1138  s->mv[0][0][0] = s->cur_pic.motion_val[dir][mb_x * 2 + mb_y * 2 * s->b8_stride][0];
1139  s->mv[0][0][1] = s->cur_pic.motion_val[dir][mb_x * 2 + mb_y * 2 * s->b8_stride][1];
1140  }
1141 
1142  s->decode_mb(s->opaque, 0 /* FIXME h264 partitioned slices need this set */,
1143  mv_dir, mv_type, &s->mv, mb_x, mb_y, 0, 0);
1144  }
1145  }
1146 
1147  /* guess MVs */
1148  if (s->cur_pic.f->pict_type == AV_PICTURE_TYPE_B) {
1149  for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
1150  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
1151  int xy = mb_x * 2 + mb_y * 2 * s->b8_stride;
1152  const int mb_xy = mb_x + mb_y * s->mb_stride;
1153  const int mb_type = s->cur_pic.mb_type[mb_xy];
1154  int mv_dir = MV_DIR_FORWARD | MV_DIR_BACKWARD;
1155 
1156  int error = s->error_status_table[mb_xy];
1157 
1158  if (IS_INTRA(mb_type))
1159  continue;
1160  if (!(error & ER_MV_ERROR))
1161  continue; // inter with undamaged MV
1162  if (!(error & ER_AC_ERROR))
1163  continue; // undamaged inter
1164 
1165  if (!(s->last_pic.f && s->last_pic.f->data[0]))
1166  mv_dir &= ~MV_DIR_FORWARD;
1167  if (!(s->next_pic.f && s->next_pic.f->data[0]))
1168  mv_dir &= ~MV_DIR_BACKWARD;
1169 
1170  if (s->pp_time) {
1171  int time_pp = s->pp_time;
1172  int time_pb = s->pb_time;
1173 
1175  ff_thread_await_progress(s->next_pic.tf, mb_y, 0);
1176 
1177  s->mv[0][0][0] = s->next_pic.motion_val[0][xy][0] * time_pb / time_pp;
1178  s->mv[0][0][1] = s->next_pic.motion_val[0][xy][1] * time_pb / time_pp;
1179  s->mv[1][0][0] = s->next_pic.motion_val[0][xy][0] * (time_pb - time_pp) / time_pp;
1180  s->mv[1][0][1] = s->next_pic.motion_val[0][xy][1] * (time_pb - time_pp) / time_pp;
1181  } else {
1182  s->mv[0][0][0] = 0;
1183  s->mv[0][0][1] = 0;
1184  s->mv[1][0][0] = 0;
1185  s->mv[1][0][1] = 0;
1186  }
1187 
1188  s->decode_mb(s->opaque, 0, mv_dir, MV_TYPE_16X16, &s->mv,
1189  mb_x, mb_y, 0, 0);
1190  }
1191  }
1192  } else
1193  guess_mv(s);
1194 
1195  /* the filters below manipulate raw image, skip them */
1196  if (CONFIG_XVMC && s->avctx->hwaccel && s->avctx->hwaccel->decode_mb)
1197  goto ec_clean;
1198  /* fill DC for inter blocks */
1199  for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
1200  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
1201  int dc, dcu, dcv, y, n;
1202  int16_t *dc_ptr;
1203  uint8_t *dest_y, *dest_cb, *dest_cr;
1204  const int mb_xy = mb_x + mb_y * s->mb_stride;
1205  const int mb_type = s->cur_pic.mb_type[mb_xy];
1206 
1207  // error = s->error_status_table[mb_xy];
1208 
1209  if (IS_INTRA(mb_type) && s->partitioned_frame)
1210  continue;
1211  // if (error & ER_MV_ERROR)
1212  // continue; // inter data damaged FIXME is this good?
1213 
1214  dest_y = s->cur_pic.f->data[0] + mb_x * 16 + mb_y * 16 * linesize[0];
1215  dest_cb = s->cur_pic.f->data[1] + mb_x * 8 + mb_y * 8 * linesize[1];
1216  dest_cr = s->cur_pic.f->data[2] + mb_x * 8 + mb_y * 8 * linesize[2];
1217 
1218  dc_ptr = &s->dc_val[0][mb_x * 2 + mb_y * 2 * s->b8_stride];
1219  for (n = 0; n < 4; n++) {
1220  dc = 0;
1221  for (y = 0; y < 8; y++) {
1222  int x;
1223  for (x = 0; x < 8; x++)
1224  dc += dest_y[x + (n & 1) * 8 +
1225  (y + (n >> 1) * 8) * linesize[0]];
1226  }
1227  dc_ptr[(n & 1) + (n >> 1) * s->b8_stride] = (dc + 4) >> 3;
1228  }
1229 
1230  dcu = dcv = 0;
1231  for (y = 0; y < 8; y++) {
1232  int x;
1233  for (x = 0; x < 8; x++) {
1234  dcu += dest_cb[x + y * linesize[1]];
1235  dcv += dest_cr[x + y * linesize[2]];
1236  }
1237  }
1238  s->dc_val[1][mb_x + mb_y * s->mb_stride] = (dcu + 4) >> 3;
1239  s->dc_val[2][mb_x + mb_y * s->mb_stride] = (dcv + 4) >> 3;
1240  }
1241  }
1242 #if 1
1243  /* guess DC for damaged blocks */
1244  guess_dc(s, s->dc_val[0], s->mb_width*2, s->mb_height*2, s->b8_stride, 1);
1245  guess_dc(s, s->dc_val[1], s->mb_width , s->mb_height , s->mb_stride, 0);
1246  guess_dc(s, s->dc_val[2], s->mb_width , s->mb_height , s->mb_stride, 0);
1247 #endif
1248 
1249  /* filter luma DC */
1250  filter181(s->dc_val[0], s->mb_width * 2, s->mb_height * 2, s->b8_stride);
1251 
1252 #if 1
1253  /* render DC only intra */
1254  for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
1255  for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
1256  uint8_t *dest_y, *dest_cb, *dest_cr;
1257  const int mb_xy = mb_x + mb_y * s->mb_stride;
1258  const int mb_type = s->cur_pic.mb_type[mb_xy];
1259 
1260  int error = s->error_status_table[mb_xy];
1261 
1262  if (IS_INTER(mb_type))
1263  continue;
1264  if (!(error & ER_AC_ERROR))
1265  continue; // undamaged
1266 
1267  dest_y = s->cur_pic.f->data[0] + mb_x * 16 + mb_y * 16 * linesize[0];
1268  dest_cb = s->cur_pic.f->data[1] + mb_x * 8 + mb_y * 8 * linesize[1];
1269  dest_cr = s->cur_pic.f->data[2] + mb_x * 8 + mb_y * 8 * linesize[2];
1270 
1271  put_dc(s, dest_y, dest_cb, dest_cr, mb_x, mb_y);
1272  }
1273  }
1274 #endif
1275 
1277  /* filter horizontal block boundaries */
1278  h_block_filter(s, s->cur_pic.f->data[0], s->mb_width * 2,
1279  s->mb_height * 2, linesize[0], 1);
1280  h_block_filter(s, s->cur_pic.f->data[1], s->mb_width,
1281  s->mb_height, linesize[1], 0);
1282  h_block_filter(s, s->cur_pic.f->data[2], s->mb_width,
1283  s->mb_height, linesize[2], 0);
1284 
1285  /* filter vertical block boundaries */
1286  v_block_filter(s, s->cur_pic.f->data[0], s->mb_width * 2,
1287  s->mb_height * 2, linesize[0], 1);
1288  v_block_filter(s, s->cur_pic.f->data[1], s->mb_width,
1289  s->mb_height, linesize[1], 0);
1290  v_block_filter(s, s->cur_pic.f->data[2], s->mb_width,
1291  s->mb_height, linesize[2], 0);
1292  }
1293 
1294 ec_clean:
1295  /* clean a few tables */
1296  for (i = 0; i < s->mb_num; i++) {
1297  const int mb_xy = s->mb_index2xy[i];
1298  int error = s->error_status_table[mb_xy];
1299 
1300  if (s->cur_pic.f->pict_type != AV_PICTURE_TYPE_B &&
1301  (error & (ER_DC_ERROR | ER_MV_ERROR | ER_AC_ERROR))) {
1302  s->mbskip_table[mb_xy] = 0;
1303  }
1304  s->mbintra_table[mb_xy] = 1;
1305  }
1306 
1307  for (i = 0; i < 2; i++) {
1310  s->cur_pic.ref_index[i] = NULL;
1311  s->cur_pic.motion_val[i] = NULL;
1312  }
1313 
1314  memset(&s->cur_pic, 0, sizeof(ERPicture));
1315  memset(&s->last_pic, 0, sizeof(ERPicture));
1316  memset(&s->next_pic, 0, sizeof(ERPicture));
1317 }