falkTX
/
FFmpeg
mirror of https://github.com/falkTX/FFmpeg.git
1
0
Fork 0
Code Issues 0 Releases 338 Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
67218 Commits
32 Branches
1.0GB
Tree: 3879202d68
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '3879202d68'
${ noResults }
FFmpeg/libavcodec/error_resilience.c

1319 lines
50KB
Raw Blame History 

  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 "mpegutils.h"

  34. #include "mpegvideo.h"

  35. #include "rectangle.h"

  36. #include "thread.h"

  37. #include "version.h"

  38. 

  39. /**

  40.  * @param stride the number of MVs to get to the next row

  41.  * @param mv_step the number of MVs per row or column in a macroblock

  42.  */

  43. static void set_mv_strides(ERContext *s, int *mv_step, int *stride)

  44. {

  45.     if (s->avctx->codec_id == AV_CODEC_ID_H264) {

  46.         av_assert0(s->quarter_sample);

  47.         *mv_step = 4;

  48.         *stride  = s->mb_width * 4;

  49.     } else {

  50.         *mv_step = 2;

  51.         *stride  = s->b8_stride;

  52.     }

  53. }

  54. 

  55. /**

  56.  * Replace the current MB with a flat dc-only version.

  57.  */

  58. static void put_dc(ERContext *s, uint8_t *dest_y, uint8_t *dest_cb,

  59.                    uint8_t *dest_cr, int mb_x, int mb_y)

  60. {

  61.     int *linesize = s->cur_pic.f->linesize;

  62.     int dc, dcu, dcv, y, i;

  63.     for (i = 0; i < 4; i++) {

  64.         dc = s->dc_val[0][mb_x * 2 + (i &  1) + (mb_y * 2 + (i >> 1)) * s->b8_stride];

  65.         if (dc < 0)

  66.             dc = 0;

  67.         else if (dc > 2040)

  68.             dc = 2040;

  69.         for (y = 0; y < 8; y++) {

  70.             int x;

  71.             for (x = 0; x < 8; x++)

  72.                 dest_y[x + (i &  1) * 8 + (y + (i >> 1) * 8) * linesize[0]] = dc / 8;

  73.         }

  74.     }

  75.     dcu = s->dc_val[1][mb_x + mb_y * s->mb_stride];

  76.     dcv = s->dc_val[2][mb_x + mb_y * s->mb_stride];

  77.     if (dcu < 0)

  78.         dcu = 0;

  79.     else if (dcu > 2040)

  80.         dcu = 2040;

  81.     if (dcv < 0)

  82.         dcv = 0;

  83.     else if (dcv > 2040)

  84.         dcv = 2040;

  85.     for (y = 0; y < 8; y++) {

  86.         int x;

  87.         for (x = 0; x < 8; x++) {

  88.             dest_cb[x + y * linesize[1]] = dcu / 8;

  89.             dest_cr[x + y * linesize[2]] = dcv / 8;

  90.         }

  91.     }

  92. }

  93. 

  94. static void filter181(int16_t *data, int width, int height, int stride)

  95. {

  96.     int x, y;

  97. 

  98.     /* horizontal filter */

  99.     for (y = 1; y < height - 1; y++) {

  100.         int prev_dc = data[0 + y * stride];

  101. 

  102.         for (x = 1; x < width - 1; x++) {

  103.             int dc;

  104.             dc = -prev_dc +

  105.                  data[x     + y * stride] * 8 -

  106.                  data[x + 1 + y * stride];

  107.             dc = (dc * 10923 + 32768) >> 16;

  108.             prev_dc = data[x + y * stride];

  109.             data[x + y * stride] = dc;

  110.         }

  111.     }

  112. 

  113.     /* vertical filter */

  114.     for (x = 1; x < width - 1; x++) {

  115.         int prev_dc = data[x];

  116. 

  117.         for (y = 1; y < height - 1; y++) {

  118.             int dc;

  119. 

  120.             dc = -prev_dc +

  121.                  data[x +  y      * stride] * 8 -

  122.                  data[x + (y + 1) * stride];

  123.             dc = (dc * 10923 + 32768) >> 16;

  124.             prev_dc = data[x + y * stride];

  125.             data[x + y * stride] = dc;

  126.         }

  127.     }

  128. }

  129. 

  130. /**

  131.  * guess the dc of blocks which do not have an undamaged dc

  132.  * @param w     width in 8 pixel blocks

  133.  * @param h     height in 8 pixel blocks

  134.  */

  135. static void guess_dc(ERContext *s, int16_t *dc, int w,

  136.                      int h, int stride, int is_luma)

  137. {

  138.     int b_x, b_y;

  139.     int16_t  (*col )[4] = av_malloc_array(stride, h*sizeof( int16_t)*4);

  140.     uint32_t (*dist)[4] = av_malloc_array(stride, h*sizeof(uint32_t)*4);

  141. 

  142.     if(!col || !dist) {

  143.         av_log(s->avctx, AV_LOG_ERROR, "guess_dc() is out of memory\n");

  144.         goto fail;

  145.     }

  146. 

  147.     for(b_y=0; b_y<h; b_y++){

  148.         int color= 1024;

  149.         int distance= -1;

  150.         for(b_x=0; b_x<w; b_x++){

  151.             int mb_index_j= (b_x>>is_luma) + (b_y>>is_luma)*s->mb_stride;

  152.             int error_j= s->error_status_table[mb_index_j];

  153.             int intra_j = IS_INTRA(s->cur_pic.mb_type[mb_index_j]);

  154.             if(intra_j==0 || !(error_j&ER_DC_ERROR)){

  155.                 color= dc[b_x + b_y*stride];

  156.                 distance= b_x;

  157.             }

  158.             col [b_x + b_y*stride][1]= color;

  159.             dist[b_x + b_y*stride][1]= distance >= 0 ? b_x-distance : 9999;

  160.         }

  161.         color= 1024;

  162.         distance= -1;

  163.         for(b_x=w-1; b_x>=0; b_x--){

  164.             int mb_index_j= (b_x>>is_luma) + (b_y>>is_luma)*s->mb_stride;

  165.             int error_j= s->error_status_table[mb_index_j];

  166.             int intra_j = IS_INTRA(s->cur_pic.mb_type[mb_index_j]);

  167.             if(intra_j==0 || !(error_j&ER_DC_ERROR)){

  168.                 color= dc[b_x + b_y*stride];

  169.                 distance= b_x;

  170.             }

  171.             col [b_x + b_y*stride][0]= color;

  172.             dist[b_x + b_y*stride][0]= distance >= 0 ? distance-b_x : 9999;

  173.         }

  174.     }

  175.     for(b_x=0; b_x<w; b_x++){

  176.         int color= 1024;

  177.         int distance= -1;

  178.         for(b_y=0; b_y<h; b_y++){

  179.             int mb_index_j= (b_x>>is_luma) + (b_y>>is_luma)*s->mb_stride;

  180.             int error_j= s->error_status_table[mb_index_j];

  181.             int intra_j = IS_INTRA(s->cur_pic.mb_type[mb_index_j]);

  182.             if(intra_j==0 || !(error_j&ER_DC_ERROR)){

  183.                 color= dc[b_x + b_y*stride];

  184.                 distance= b_y;

  185.             }

  186.             col [b_x + b_y*stride][3]= color;

  187.             dist[b_x + b_y*stride][3]= distance >= 0 ? b_y-distance : 9999;

  188.         }

  189.         color= 1024;

  190.         distance= -1;

  191.         for(b_y=h-1; b_y>=0; b_y--){

  192.             int mb_index_j= (b_x>>is_luma) + (b_y>>is_luma)*s->mb_stride;

  193.             int error_j= s->error_status_table[mb_index_j];

  194.             int intra_j = IS_INTRA(s->cur_pic.mb_type[mb_index_j]);

  195.             if(intra_j==0 || !(error_j&ER_DC_ERROR)){

  196.                 color= dc[b_x + b_y*stride];

  197.                 distance= b_y;

  198.             }

  199.             col [b_x + b_y*stride][2]= color;

  200.             dist[b_x + b_y*stride][2]= distance >= 0 ? distance-b_y : 9999;

  201.         }

  202.     }

  203. 

  204.     for (b_y = 0; b_y < h; b_y++) {

  205.         for (b_x = 0; b_x < w; b_x++) {

  206.             int mb_index, error, j;

  207.             int64_t guess, weight_sum;

  208.             mb_index = (b_x >> is_luma) + (b_y >> is_luma) * s->mb_stride;

  209.             error    = s->error_status_table[mb_index];

  210. 

  211.             if (IS_INTER(s->cur_pic.mb_type[mb_index]))

  212.                 continue; // inter

  213.             if (!(error & ER_DC_ERROR))

  214.                 continue; // dc-ok

  215. 

  216.             weight_sum = 0;

  217.             guess      = 0;

  218.             for (j = 0; j < 4; j++) {

  219.                 int64_t weight  = 256 * 256 * 256 * 16 / FFMAX(dist[b_x + b_y*stride][j], 1);

  220.                 guess          += weight*(int64_t)col[b_x + b_y*stride][j];

  221.                 weight_sum     += weight;

  222.             }

  223.             guess = (guess + weight_sum / 2) / weight_sum;

  224.             dc[b_x + b_y * stride] = guess;

  225.         }

  226.     }

  227. 

  228. fail:

  229.     av_freep(&col);

  230.     av_freep(&dist);

  231. }

  232. 

  233. /**

  234.  * simple horizontal deblocking filter used for error resilience

  235.  * @param w     width in 8 pixel blocks

  236.  * @param h     height in 8 pixel blocks

  237.  */

  238. static void h_block_filter(ERContext *s, uint8_t *dst, int w,

  239.                            int h, int stride, int is_luma)

  240. {

  241.     int b_x, b_y, mvx_stride, mvy_stride;

  242.     const uint8_t *cm = ff_crop_tab + MAX_NEG_CROP;

  243.     set_mv_strides(s, &mvx_stride, &mvy_stride);

  244.     mvx_stride >>= is_luma;

  245.     mvy_stride *= mvx_stride;

  246. 

  247.     for (b_y = 0; b_y < h; b_y++) {

  248.         for (b_x = 0; b_x < w - 1; b_x++) {

  249.             int y;

  250.             int left_status  = s->error_status_table[( b_x      >> is_luma) + (b_y >> is_luma) * s->mb_stride];

  251.             int right_status = s->error_status_table[((b_x + 1) >> is_luma) + (b_y >> is_luma) * s->mb_stride];

  252.             int left_intra   = IS_INTRA(s->cur_pic.mb_type[( b_x      >> is_luma) + (b_y >> is_luma) * s->mb_stride]);

  253.             int right_intra  = IS_INTRA(s->cur_pic.mb_type[((b_x + 1) >> is_luma) + (b_y >> is_luma) * s->mb_stride]);

  254.             int left_damage  = left_status & ER_MB_ERROR;

  255.             int right_damage = right_status & ER_MB_ERROR;

  256.             int offset       = b_x * 8 + b_y * stride * 8;

  257.             int16_t *left_mv  = s->cur_pic.motion_val[0][mvy_stride * b_y + mvx_stride *  b_x];

  258.             int16_t *right_mv = s->cur_pic.motion_val[0][mvy_stride * b_y + mvx_stride * (b_x + 1)];

  259.             if (!(left_damage || right_damage))

  260.                 continue; // both undamaged

  261.             if ((!left_intra) && (!right_intra) &&

  262.                 FFABS(left_mv[0] - right_mv[0]) +

  263.                 FFABS(left_mv[1] + right_mv[1]) < 2)

  264.                 continue;

  265. 

  266.             for (y = 0; y < 8; y++) {

  267.                 int a, b, c, d;

  268. 

  269.                 a = dst[offset + 7 + y * stride] - dst[offset + 6 + y * stride];

  270.                 b = dst[offset + 8 + y * stride] - dst[offset + 7 + y * stride];

  271.                 c = dst[offset + 9 + y * stride] - dst[offset + 8 + y * stride];

  272. 

  273.                 d = FFABS(b) - ((FFABS(a) + FFABS(c) + 1) >> 1);

  274.                 d = FFMAX(d, 0);

  275.                 if (b < 0)

  276.                     d = -d;

  277. 

  278.                 if (d == 0)

  279.                     continue;

  280. 

  281.                 if (!(left_damage && right_damage))

  282.                     d = d * 16 / 9;

  283. 

  284.                 if (left_damage) {

  285.                     dst[offset + 7 + y * stride] = cm[dst[offset + 7 + y * stride] + ((d * 7) >> 4)];

  286.                     dst[offset + 6 + y * stride] = cm[dst[offset + 6 + y * stride] + ((d * 5) >> 4)];

  287.                     dst[offset + 5 + y * stride] = cm[dst[offset + 5 + y * stride] + ((d * 3) >> 4)];

  288.                     dst[offset + 4 + y * stride] = cm[dst[offset + 4 + y * stride] + ((d * 1) >> 4)];

  289.                 }

  290.                 if (right_damage) {

  291.                     dst[offset + 8 + y * stride] = cm[dst[offset +  8 + y * stride] - ((d * 7) >> 4)];

  292.                     dst[offset + 9 + y * stride] = cm[dst[offset +  9 + y * stride] - ((d * 5) >> 4)];

  293.                     dst[offset + 10+ y * stride] = cm[dst[offset + 10 + y * stride] - ((d * 3) >> 4)];

  294.                     dst[offset + 11+ y * stride] = cm[dst[offset + 11 + y * stride] - ((d * 1) >> 4)];

  295.                 }

  296.             }

  297.         }

  298.     }

  299. }

  300. 

  301. /**

  302.  * simple vertical deblocking filter used for error resilience

  303.  * @param w     width in 8 pixel blocks

  304.  * @param h     height in 8 pixel blocks

  305.  */

  306. static void v_block_filter(ERContext *s, uint8_t *dst, int w, int h,

  307.                            int stride, int is_luma)

  308. {

  309.     int b_x, b_y, mvx_stride, mvy_stride;

  310.     const uint8_t *cm = ff_crop_tab + MAX_NEG_CROP;

  311.     set_mv_strides(s, &mvx_stride, &mvy_stride);

  312.     mvx_stride >>= is_luma;

  313.     mvy_stride *= mvx_stride;

  314. 

  315.     for (b_y = 0; b_y < h - 1; b_y++) {

  316.         for (b_x = 0; b_x < w; b_x++) {

  317.             int x;

  318.             int top_status    = s->error_status_table[(b_x >> is_luma) +  (b_y      >> is_luma) * s->mb_stride];

  319.             int bottom_status = s->error_status_table[(b_x >> is_luma) + ((b_y + 1) >> is_luma) * s->mb_stride];

  320.             int top_intra     = IS_INTRA(s->cur_pic.mb_type[(b_x >> is_luma) + ( b_y      >> is_luma) * s->mb_stride]);

  321.             int bottom_intra  = IS_INTRA(s->cur_pic.mb_type[(b_x >> is_luma) + ((b_y + 1) >> is_luma) * s->mb_stride]);

  322.             int top_damage    = top_status & ER_MB_ERROR;

  323.             int bottom_damage = bottom_status & ER_MB_ERROR;

  324.             int offset        = b_x * 8 + b_y * stride * 8;

  325. 

  326.             int16_t *top_mv    = s->cur_pic.motion_val[0][mvy_stride *  b_y      + mvx_stride * b_x];

  327.             int16_t *bottom_mv = s->cur_pic.motion_val[0][mvy_stride * (b_y + 1) + mvx_stride * b_x];

  328. 

  329.             if (!(top_damage || bottom_damage))

  330.                 continue; // both undamaged

  331. 

  332.             if ((!top_intra) && (!bottom_intra) &&

  333.                 FFABS(top_mv[0] - bottom_mv[0]) +

  334.                 FFABS(top_mv[1] + bottom_mv[1]) < 2)

  335.                 continue;

  336. 

  337.             for (x = 0; x < 8; x++) {

  338.                 int a, b, c, d;

  339. 

  340.                 a = dst[offset + x + 7 * stride] - dst[offset + x + 6 * stride];

  341.                 b = dst[offset + x + 8 * stride] - dst[offset + x + 7 * stride];

  342.                 c = dst[offset + x + 9 * stride] - dst[offset + x + 8 * stride];

  343. 

  344.                 d = FFABS(b) - ((FFABS(a) + FFABS(c) + 1) >> 1);

  345.                 d = FFMAX(d, 0);

  346.                 if (b < 0)

  347.                     d = -d;

  348. 

  349.                 if (d == 0)

  350.                     continue;

  351. 

  352.                 if (!(top_damage && bottom_damage))

  353.                     d = d * 16 / 9;

  354. 

  355.                 if (top_damage) {

  356.                     dst[offset + x +  7 * stride] = cm[dst[offset + x +  7 * stride] + ((d * 7) >> 4)];

  357.                     dst[offset + x +  6 * stride] = cm[dst[offset + x +  6 * stride] + ((d * 5) >> 4)];

  358.                     dst[offset + x +  5 * stride] = cm[dst[offset + x +  5 * stride] + ((d * 3) >> 4)];

  359.                     dst[offset + x +  4 * stride] = cm[dst[offset + x +  4 * stride] + ((d * 1) >> 4)];

  360.                 }

  361.                 if (bottom_damage) {

  362.                     dst[offset + x +  8 * stride] = cm[dst[offset + x +  8 * stride] - ((d * 7) >> 4)];

  363.                     dst[offset + x +  9 * stride] = cm[dst[offset + x +  9 * stride] - ((d * 5) >> 4)];

  364.                     dst[offset + x + 10 * stride] = cm[dst[offset + x + 10 * stride] - ((d * 3) >> 4)];

  365.                     dst[offset + x + 11 * stride] = cm[dst[offset + x + 11 * stride] - ((d * 1) >> 4)];

  366.                 }

  367.             }

  368.         }

  369.     }

  370. }

  371. 

  372. static void guess_mv(ERContext *s)

  373. {

  374.     uint8_t *fixed = s->er_temp_buffer;

  375. #define MV_FROZEN    3

  376. #define MV_CHANGED   2

  377. #define MV_UNCHANGED 1

  378.     const int mb_stride = s->mb_stride;

  379.     const int mb_width  = s->mb_width;

  380.     int mb_height = s->mb_height;

  381.     int i, depth, num_avail;

  382.     int mb_x, mb_y, mot_step, mot_stride;

  383. 

  384.     if (s->last_pic.f && s->last_pic.f->data[0])

  385.         mb_height = FFMIN(mb_height, (s->last_pic.f->height+15)>>4);

  386.     if (s->next_pic.f && s->next_pic.f->data[0])

  387.         mb_height = FFMIN(mb_height, (s->next_pic.f->height+15)>>4);

  388. 

  389.     set_mv_strides(s, &mot_step, &mot_stride);

  390. 

  391.     num_avail = 0;

  392.     for (i = 0; i < mb_width * mb_height; i++) {

  393.         const int mb_xy = s->mb_index2xy[i];

  394.         int f = 0;

  395.         int error = s->error_status_table[mb_xy];

  396. 

  397.         if (IS_INTRA(s->cur_pic.mb_type[mb_xy]))

  398.             f = MV_FROZEN; // intra // FIXME check

  399.         if (!(error & ER_MV_ERROR))

  400.             f = MV_FROZEN; // inter with undamaged MV

  401. 

  402.         fixed[mb_xy] = f;

  403.         if (f == MV_FROZEN)

  404.             num_avail++;

  405.         else if(s->last_pic.f->data[0] && s->last_pic.motion_val[0]){

  406.             const int mb_y= mb_xy / s->mb_stride;

  407.             const int mb_x= mb_xy % s->mb_stride;

  408.             const int mot_index= (mb_x + mb_y*mot_stride) * mot_step;

  409.             s->cur_pic.motion_val[0][mot_index][0]= s->last_pic.motion_val[0][mot_index][0];

  410.             s->cur_pic.motion_val[0][mot_index][1]= s->last_pic.motion_val[0][mot_index][1];

  411.             s->cur_pic.ref_index[0][4*mb_xy]      = s->last_pic.ref_index[0][4*mb_xy];

  412.         }

  413.     }

  414. 

  415.     if ((!(s->avctx->error_concealment&FF_EC_GUESS_MVS)) ||

  416.         num_avail <= mb_width / 2) {

  417.         for (mb_y = 0; mb_y < mb_height; mb_y++) {

  418.             for (mb_x = 0; mb_x < s->mb_width; mb_x++) {

  419.                 const int mb_xy = mb_x + mb_y * s->mb_stride;

  420.                 int mv_dir = (s->last_pic.f && s->last_pic.f->data[0]) ? MV_DIR_FORWARD : MV_DIR_BACKWARD;

  421. 

  422.                 if (IS_INTRA(s->cur_pic.mb_type[mb_xy]))

  423.                     continue;

  424.                 if (!(s->error_status_table[mb_xy] & ER_MV_ERROR))

  425.                     continue;

  426. 

  427.                 s->mv[0][0][0] = 0;

  428.                 s->mv[0][0][1] = 0;

  429.                 s->decode_mb(s->opaque, 0, mv_dir, MV_TYPE_16X16, &s->mv,

  430.                              mb_x, mb_y, 0, 0);

  431.             }

  432.         }

  433.         return;

  434.     }

  435. 

  436.     for (depth = 0; ; depth++) {

  437.         int changed, pass, none_left;

  438. 

  439.         none_left = 1;

  440.         changed   = 1;

  441.         for (pass = 0; (changed || pass < 2) && pass < 10; pass++) {

  442.             int mb_x, mb_y;

  443.             int score_sum = 0;

  444. 

  445.             changed = 0;

  446.             for (mb_y = 0; mb_y < mb_height; mb_y++) {

  447.                 for (mb_x = 0; mb_x < s->mb_width; mb_x++) {

  448.                     const int mb_xy        = mb_x + mb_y * s->mb_stride;

  449.                     int mv_predictor[8][2] = { { 0 } };

  450.                     int ref[8]             = { 0 };

  451.                     int pred_count         = 0;

  452.                     int j;

  453.                     int best_score         = 256 * 256 * 256 * 64;

  454.                     int best_pred          = 0;

  455.                     const int mot_index    = (mb_x + mb_y * mot_stride) * mot_step;

  456.                     int prev_x, prev_y, prev_ref;

  457. 

  458.                     if ((mb_x ^ mb_y ^ pass) & 1)

  459.                         continue;

  460. 

  461.                     if (fixed[mb_xy] == MV_FROZEN)

  462.                         continue;

  463.                     av_assert1(!IS_INTRA(s->cur_pic.mb_type[mb_xy]));

  464.                     av_assert1(s->last_pic.f && s->last_pic.f->data[0]);

  465. 

  466.                     j = 0;

  467.                     if (mb_x > 0             && fixed[mb_xy - 1]         == MV_FROZEN)

  468.                         j = 1;

  469.                     if (mb_x + 1 < mb_width  && fixed[mb_xy + 1]         == MV_FROZEN)

  470.                         j = 1;

  471.                     if (mb_y > 0             && fixed[mb_xy - mb_stride] == MV_FROZEN)

  472.                         j = 1;

  473.                     if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride] == MV_FROZEN)

  474.                         j = 1;

  475.                     if (j == 0)

  476.                         continue;

  477. 

  478.                     j = 0;

  479.                     if (mb_x > 0             && fixed[mb_xy - 1        ] == MV_CHANGED)

  480.                         j = 1;

  481.                     if (mb_x + 1 < mb_width  && fixed[mb_xy + 1        ] == MV_CHANGED)

  482.                         j = 1;

  483.                     if (mb_y > 0             && fixed[mb_xy - mb_stride] == MV_CHANGED)

  484.                         j = 1;

  485.                     if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride] == MV_CHANGED)

  486.                         j = 1;

  487.                     if (j == 0 && pass > 1)

  488.                         continue;

  489. 

  490.                     none_left = 0;

  491. 

  492.                     if (mb_x > 0 && fixed[mb_xy - 1]) {

  493.                         mv_predictor[pred_count][0] =

  494.                             s->cur_pic.motion_val[0][mot_index - mot_step][0];

  495.                         mv_predictor[pred_count][1] =

  496.                             s->cur_pic.motion_val[0][mot_index - mot_step][1];

  497.                         ref[pred_count] =

  498.                             s->cur_pic.ref_index[0][4 * (mb_xy - 1)];

  499.                         pred_count++;

  500.                     }

  501.                     if (mb_x + 1 < mb_width && fixed[mb_xy + 1]) {

  502.                         mv_predictor[pred_count][0] =

  503.                             s->cur_pic.motion_val[0][mot_index + mot_step][0];

  504.                         mv_predictor[pred_count][1] =

  505.                             s->cur_pic.motion_val[0][mot_index + mot_step][1];

  506.                         ref[pred_count] =

  507.                             s->cur_pic.ref_index[0][4 * (mb_xy + 1)];

  508.                         pred_count++;

  509.                     }

  510.                     if (mb_y > 0 && fixed[mb_xy - mb_stride]) {

  511.                         mv_predictor[pred_count][0] =

  512.                             s->cur_pic.motion_val[0][mot_index - mot_stride * mot_step][0];

  513.                         mv_predictor[pred_count][1] =

  514.                             s->cur_pic.motion_val[0][mot_index - mot_stride * mot_step][1];

  515.                         ref[pred_count] =

  516.                             s->cur_pic.ref_index[0][4 * (mb_xy - s->mb_stride)];

  517.                         pred_count++;

  518.                     }

  519.                     if (mb_y + 1<mb_height && fixed[mb_xy + mb_stride]) {

  520.                         mv_predictor[pred_count][0] =

  521.                             s->cur_pic.motion_val[0][mot_index + mot_stride * mot_step][0];

  522.                         mv_predictor[pred_count][1] =

  523.                             s->cur_pic.motion_val[0][mot_index + mot_stride * mot_step][1];

  524.                         ref[pred_count] =

  525.                             s->cur_pic.ref_index[0][4 * (mb_xy + s->mb_stride)];

  526.                         pred_count++;

  527.                     }

  528.                     if (pred_count == 0)

  529.                         continue;

  530. 

  531.                     if (pred_count > 1) {

  532.                         int sum_x = 0, sum_y = 0, sum_r = 0;

  533.                         int max_x, max_y, min_x, min_y, max_r, min_r;

  534. 

  535.                         for (j = 0; j < pred_count; j++) {

  536.                             sum_x += mv_predictor[j][0];

  537.                             sum_y += mv_predictor[j][1];

  538.                             sum_r += ref[j];

  539.                             if (j && ref[j] != ref[j - 1])

  540.                                 goto skip_mean_and_median;

  541.                         }

  542. 

  543.                         /* mean */

  544.                         mv_predictor[pred_count][0] = sum_x / j;

  545.                         mv_predictor[pred_count][1] = sum_y / j;

  546.                                  ref[pred_count]    = sum_r / j;

  547. 

  548.                         /* median */

  549.                         if (pred_count >= 3) {

  550.                             min_y = min_x = min_r =  99999;

  551.                             max_y = max_x = max_r = -99999;

  552.                         } else {

  553.                             min_x = min_y = max_x = max_y = min_r = max_r = 0;

  554.                         }

  555.                         for (j = 0; j < pred_count; j++) {

  556.                             max_x = FFMAX(max_x, mv_predictor[j][0]);

  557.                             max_y = FFMAX(max_y, mv_predictor[j][1]);

  558.                             max_r = FFMAX(max_r, ref[j]);

  559.                             min_x = FFMIN(min_x, mv_predictor[j][0]);

  560.                             min_y = FFMIN(min_y, mv_predictor[j][1]);

  561.                             min_r = FFMIN(min_r, ref[j]);

  562.                         }

  563.                         mv_predictor[pred_count + 1][0] = sum_x - max_x - min_x;

  564.                         mv_predictor[pred_count + 1][1] = sum_y - max_y - min_y;

  565.                                  ref[pred_count + 1]    = sum_r - max_r - min_r;

  566. 

  567.                         if (pred_count == 4) {

  568.                             mv_predictor[pred_count + 1][0] /= 2;

  569.                             mv_predictor[pred_count + 1][1] /= 2;

  570.                                      ref[pred_count + 1]    /= 2;

  571.                         }

  572.                         pred_count += 2;

  573.                     }

  574. 

  575. skip_mean_and_median:

  576.                     /* zero MV */

  577.                     pred_count++;

  578. 

  579.                     if (!fixed[mb_xy] && 0) {

  580.                         if (s->avctx->codec_id == AV_CODEC_ID_H264) {

  581.                             // FIXME

  582.                         } else {

  583.                             ff_thread_await_progress(s->last_pic.tf,

  584.                                                      mb_y, 0);

  585.                         }

  586.                         if (!s->last_pic.motion_val[0] ||

  587.                             !s->last_pic.ref_index[0])

  588.                             goto skip_last_mv;

  589.                         prev_x   = s->last_pic.motion_val[0][mot_index][0];

  590.                         prev_y   = s->last_pic.motion_val[0][mot_index][1];

  591.                         prev_ref = s->last_pic.ref_index[0][4 * mb_xy];

  592.                     } else {

  593.                         prev_x   = s->cur_pic.motion_val[0][mot_index][0];

  594.                         prev_y   = s->cur_pic.motion_val[0][mot_index][1];

  595.                         prev_ref = s->cur_pic.ref_index[0][4 * mb_xy];

  596.                     }

  597. 

  598.                     /* last MV */

  599.                     mv_predictor[pred_count][0] = prev_x;

  600.                     mv_predictor[pred_count][1] = prev_y;

  601.                              ref[pred_count]    = prev_ref;

  602.                     pred_count++;

  603. 

  604. skip_last_mv:

  605. 

  606.                     for (j = 0; j < pred_count; j++) {

  607.                         int *linesize = s->cur_pic.f->linesize;

  608.                         int score = 0;

  609.                         uint8_t *src = s->cur_pic.f->data[0] +

  610.                                        mb_x * 16 + mb_y * 16 * linesize[0];

  611. 

  612.                         s->cur_pic.motion_val[0][mot_index][0] =

  613.                             s->mv[0][0][0] = mv_predictor[j][0];

  614.                         s->cur_pic.motion_val[0][mot_index][1] =

  615.                             s->mv[0][0][1] = mv_predictor[j][1];

  616. 

  617.                         // predictor intra or otherwise not available

  618.                         if (ref[j] < 0)

  619.                             continue;

  620. 

  621.                         s->decode_mb(s->opaque, ref[j], MV_DIR_FORWARD,

  622.                                      MV_TYPE_16X16, &s->mv, mb_x, mb_y, 0, 0);

  623. 

  624.                         if (mb_x > 0 && fixed[mb_xy - 1]) {

  625.                             int k;

  626.                             for (k = 0; k < 16; k++)

  627.                                 score += FFABS(src[k * linesize[0] - 1] -

  628.                                                src[k * linesize[0]]);

  629.                         }

  630.                         if (mb_x + 1 < mb_width && fixed[mb_xy + 1]) {

  631.                             int k;

  632.                             for (k = 0; k < 16; k++)

  633.                                 score += FFABS(src[k * linesize[0] + 15] -

  634.                                                src[k * linesize[0] + 16]);

  635.                         }

  636.                         if (mb_y > 0 && fixed[mb_xy - mb_stride]) {

  637.                             int k;

  638.                             for (k = 0; k < 16; k++)

  639.                                 score += FFABS(src[k - linesize[0]] - src[k]);

  640.                         }

  641.                         if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride]) {

  642.                             int k;

  643.                             for (k = 0; k < 16; k++)

  644.                                 score += FFABS(src[k + linesize[0] * 15] -

  645.                                                src[k + linesize[0] * 16]);

  646.                         }

  647. 

  648.                         if (score <= best_score) { // <= will favor the last MV

  649.                             best_score = score;

  650.                             best_pred  = j;

  651.                         }

  652.                     }

  653.                     score_sum += best_score;

  654.                     s->mv[0][0][0] = mv_predictor[best_pred][0];

  655.                     s->mv[0][0][1] = mv_predictor[best_pred][1];

  656. 

  657.                     for (i = 0; i < mot_step; i++)

  658.                         for (j = 0; j < mot_step; j++) {

  659.                             s->cur_pic.motion_val[0][mot_index + i + j * mot_stride][0] = s->mv[0][0][0];

  660.                             s->cur_pic.motion_val[0][mot_index + i + j * mot_stride][1] = s->mv[0][0][1];

  661.                         }

  662. 

  663.                     s->decode_mb(s->opaque, ref[best_pred], MV_DIR_FORWARD,

  664.                                  MV_TYPE_16X16, &s->mv, mb_x, mb_y, 0, 0);

  665. 

  666. 

  667.                     if (s->mv[0][0][0] != prev_x || s->mv[0][0][1] != prev_y) {

  668.                         fixed[mb_xy] = MV_CHANGED;

  669.                         changed++;

  670.                     } else

  671.                         fixed[mb_xy] = MV_UNCHANGED;

  672.                 }

  673.             }

  674.         }

  675. 

  676.         if (none_left)

  677.             return;

  678. 

  679.         for (i = 0; i < mb_width * mb_height; i++) {

  680.             int mb_xy = s->mb_index2xy[i];

  681.             if (fixed[mb_xy])

  682.                 fixed[mb_xy] = MV_FROZEN;

  683.         }

  684.     }

  685. }

  686. 

  687. static int is_intra_more_likely(ERContext *s)

  688. {

  689.     int is_intra_likely, i, j, undamaged_count, skip_amount, mb_x, mb_y;

  690. 

  691.     if (!s->last_pic.f || !s->last_pic.f->data[0])

  692.         return 1; // no previous frame available -> use spatial prediction

  693. 

  694.     if (s->avctx->error_concealment & FF_EC_FAVOR_INTER)

  695.         return 0;

  696. 

  697.     undamaged_count = 0;

  698.     for (i = 0; i < s->mb_num; i++) {

  699.         const int mb_xy = s->mb_index2xy[i];

  700.         const int error = s->error_status_table[mb_xy];

  701.         if (!((error & ER_DC_ERROR) && (error & ER_MV_ERROR)))

  702.             undamaged_count++;

  703.     }

  704. 

  705.     if (s->avctx->codec_id == AV_CODEC_ID_H264 && s->ref_count <= 0)

  706.         return 1;

  707. 

  708.     if (undamaged_count < 5)

  709.         return 0; // almost all MBs damaged -> use temporal prediction

  710. 

  711.     // prevent dsp.sad() check, that requires access to the image

  712.     if (CONFIG_XVMC    &&

  713.         s->avctx->hwaccel && s->avctx->hwaccel->decode_mb &&

  714.         s->cur_pic.f->pict_type == AV_PICTURE_TYPE_I)

  715.         return 1;

  716. 

  717.     skip_amount     = FFMAX(undamaged_count / 50, 1); // check only up to 50 MBs

  718.     is_intra_likely = 0;

  719. 

  720.     j = 0;

  721.     for (mb_y = 0; mb_y < s->mb_height - 1; mb_y++) {

  722.         for (mb_x = 0; mb_x < s->mb_width; mb_x++) {

  723.             int error;

  724.             const int mb_xy = mb_x + mb_y * s->mb_stride;

  725. 

  726.             error = s->error_status_table[mb_xy];

  727.             if ((error & ER_DC_ERROR) && (error & ER_MV_ERROR))

  728.                 continue; // skip damaged

  729. 

  730.             j++;

  731.             // skip a few to speed things up

  732.             if ((j % skip_amount) != 0)

  733.                 continue;

  734. 

  735.             if (s->cur_pic.f->pict_type == AV_PICTURE_TYPE_I) {

  736.                 int *linesize = s->cur_pic.f->linesize;

  737.                 uint8_t *mb_ptr      = s->cur_pic.f->data[0] +

  738.                                        mb_x * 16 + mb_y * 16 * linesize[0];

  739.                 uint8_t *last_mb_ptr = s->last_pic.f->data[0] +

  740.                                        mb_x * 16 + mb_y * 16 * linesize[0];

  741. 

  742.                 if (s->avctx->codec_id == AV_CODEC_ID_H264) {

  743.                     // FIXME

  744.                 } else {

  745.                     ff_thread_await_progress(s->last_pic.tf, mb_y, 0);

  746.                 }

  747.                 is_intra_likely += s->mecc->sad[0](NULL, last_mb_ptr, mb_ptr,

  748.                                                    linesize[0], 16);

  749.                 // FIXME need await_progress() here

  750.                 is_intra_likely -= s->mecc->sad[0](NULL, last_mb_ptr,

  751.                                                    last_mb_ptr + linesize[0] * 16,

  752.                                                    linesize[0], 16);

  753.             } else {

  754.                 if (IS_INTRA(s->cur_pic.mb_type[mb_xy]))

  755.                    is_intra_likely++;

  756.                 else

  757.                    is_intra_likely--;

  758.             }

  759.         }

  760.     }

  761. //      av_log(NULL, AV_LOG_ERROR, "is_intra_likely: %d type:%d\n", is_intra_likely, s->pict_type);

  762.     return is_intra_likely > 0;

  763. }

  764. 

  765. void ff_er_frame_start(ERContext *s)

  766. {

  767.     if (!s->avctx->error_concealment)

  768.         return;

  769. 

  770.     memset(s->error_status_table, ER_MB_ERROR | VP_START | ER_MB_END,

  771.            s->mb_stride * s->mb_height * sizeof(uint8_t));

  772.     s->error_count    = 3 * s->mb_num;

  773.     s->error_occurred = 0;

  774. }

  775. 

  776. static int er_supported(ERContext *s)

  777. {

  778.     if(s->avctx->hwaccel && s->avctx->hwaccel->decode_slice           ||

  779.        s->avctx->codec->capabilities&CODEC_CAP_HWACCEL_VDPAU          ||

  780.        !s->cur_pic.f                                                  ||

  781.        s->cur_pic.field_picture

  782.     )

  783.         return 0;

  784.     return 1;

  785. }

  786. 

  787. /**

  788.  * Add a slice.

  789.  * @param endx   x component of the last macroblock, can be -1

  790.  *               for the last of the previous line

  791.  * @param status the status at the end (ER_MV_END, ER_AC_ERROR, ...), it is

  792.  *               assumed that no earlier end or error of the same type occurred

  793.  */

  794. void ff_er_add_slice(ERContext *s, int startx, int starty,

  795.                      int endx, int endy, int status)

  796. {

  797.     const int start_i  = av_clip(startx + starty * s->mb_width, 0, s->mb_num - 1);

  798.     const int end_i    = av_clip(endx   + endy   * s->mb_width, 0, s->mb_num);

  799.     const int start_xy = s->mb_index2xy[start_i];

  800.     const int end_xy   = s->mb_index2xy[end_i];

  801.     int mask           = -1;

  802. 

  803.     if (s->avctx->hwaccel && s->avctx->hwaccel->decode_slice)

  804.         return;

  805. 

  806.     if (start_i > end_i || start_xy > end_xy) {

  807.         av_log(s->avctx, AV_LOG_ERROR,

  808.                "internal error, slice end before start\n");

  809.         return;

  810.     }

  811. 

  812.     if (!s->avctx->error_concealment)

  813.         return;

  814. 

  815.     mask &= ~VP_START;

  816.     if (status & (ER_AC_ERROR | ER_AC_END)) {

  817.         mask           &= ~(ER_AC_ERROR | ER_AC_END);

  818.         s->error_count -= end_i - start_i + 1;

  819.     }

  820.     if (status & (ER_DC_ERROR | ER_DC_END)) {

  821.         mask           &= ~(ER_DC_ERROR | ER_DC_END);

  822.         s->error_count -= end_i - start_i + 1;

  823.     }

  824.     if (status & (ER_MV_ERROR | ER_MV_END)) {

  825.         mask           &= ~(ER_MV_ERROR | ER_MV_END);

  826.         s->error_count -= end_i - start_i + 1;

  827.     }

  828. 

  829.     if (status & ER_MB_ERROR) {

  830.         s->error_occurred = 1;

  831.         s->error_count    = INT_MAX;

  832.     }

  833. 

  834.     if (mask == ~0x7F) {

  835.         memset(&s->error_status_table[start_xy], 0,

  836.                (end_xy - start_xy) * sizeof(uint8_t));

  837.     } else {

  838.         int i;

  839.         for (i = start_xy; i < end_xy; i++)

  840.             s->error_status_table[i] &= mask;

  841.     }

  842. 

  843.     if (end_i == s->mb_num)

  844.         s->error_count = INT_MAX;

  845.     else {

  846.         s->error_status_table[end_xy] &= mask;

  847.         s->error_status_table[end_xy] |= status;

  848.     }

  849. 

  850.     s->error_status_table[start_xy] |= VP_START;

  851. 

  852.     if (start_xy > 0 && !(s->avctx->active_thread_type & FF_THREAD_SLICE) &&

  853.         er_supported(s) && s->avctx->skip_top * s->mb_width < start_i) {

  854.         int prev_status = s->error_status_table[s->mb_index2xy[start_i - 1]];

  855. 

  856.         prev_status &= ~ VP_START;

  857.         if (prev_status != (ER_MV_END | ER_DC_END | ER_AC_END)) {

  858.             s->error_occurred = 1;

  859.             s->error_count = INT_MAX;

  860.         }

  861.     }

  862. }

  863. 

  864. void ff_er_frame_end(ERContext *s)

  865. {

  866.     int *linesize = s->cur_pic.f->linesize;

  867.     int i, mb_x, mb_y, error, error_type, dc_error, mv_error, ac_error;

  868.     int distance;

  869.     int threshold_part[4] = { 100, 100, 100 };

  870.     int threshold = 50;

  871.     int is_intra_likely;

  872.     int size = s->b8_stride * 2 * s->mb_height;

  873. 

  874.     /* We do not support ER of field pictures yet,

  875.      * though it should not crash if enabled. */

  876.     if (!s->avctx->error_concealment || s->error_count == 0            ||

  877.         s->avctx->lowres                                               ||

  878.         !er_supported(s)                                               ||

  879.         s->error_count == 3 * s->mb_width *

  880.                           (s->avctx->skip_top + s->avctx->skip_bottom)) {

  881.         return;

  882.     }

  883.     for (mb_x = 0; mb_x < s->mb_width; mb_x++) {

  884.         int status = s->error_status_table[mb_x + (s->mb_height - 1) * s->mb_stride];

  885.         if (status != 0x7F)

  886.             break;

  887.     }

  888. 

  889.     if (   mb_x == s->mb_width

  890.         && s->avctx->codec_id == AV_CODEC_ID_MPEG2VIDEO

  891.         && (s->avctx->height&16)

  892.         && s->error_count == 3 * s->mb_width * (s->avctx->skip_top + s->avctx->skip_bottom + 1)

  893.     ) {

  894.         av_log(s->avctx, AV_LOG_DEBUG, "ignoring last missing slice\n");

  895.         return;

  896.     }

  897. 

  898.     if (s->last_pic.f) {

  899.         if (s->last_pic.f->width  != s->cur_pic.f->width  ||

  900.             s->last_pic.f->height != s->cur_pic.f->height ||

  901.             s->last_pic.f->format != s->cur_pic.f->format) {

  902.             av_log(s->avctx, AV_LOG_WARNING, "Cannot use previous picture in error concealment\n");

  903.             memset(&s->last_pic, 0, sizeof(s->last_pic));

  904.         }

  905.     }

  906.     if (s->next_pic.f) {

  907.         if (s->next_pic.f->width  != s->cur_pic.f->width  ||

  908.             s->next_pic.f->height != s->cur_pic.f->height ||

  909.             s->next_pic.f->format != s->cur_pic.f->format) {

  910.             av_log(s->avctx, AV_LOG_WARNING, "Cannot use next picture in error concealment\n");

  911.             memset(&s->next_pic, 0, sizeof(s->next_pic));

  912.         }

  913.     }

  914. 

  915.     if (!s->cur_pic.motion_val[0] || !s->cur_pic.ref_index[0]) {

  916.         av_log(s->avctx, AV_LOG_ERROR, "Warning MVs not available\n");

  917. 

  918.         for (i = 0; i < 2; i++) {

  919.             s->ref_index_buf[i]  = av_buffer_allocz(s->mb_stride * s->mb_height * 4 * sizeof(uint8_t));

  920.             s->motion_val_buf[i] = av_buffer_allocz((size + 4) * 2 * sizeof(uint16_t));

  921.             if (!s->ref_index_buf[i] || !s->motion_val_buf[i])

  922.                 break;

  923.             s->cur_pic.ref_index[i]  = s->ref_index_buf[i]->data;

  924.             s->cur_pic.motion_val[i] = (int16_t (*)[2])s->motion_val_buf[i]->data + 4;

  925.         }

  926.         if (i < 2) {

  927.             for (i = 0; i < 2; i++) {

  928.                 av_buffer_unref(&s->ref_index_buf[i]);

  929.                 av_buffer_unref(&s->motion_val_buf[i]);

  930.                 s->cur_pic.ref_index[i]  = NULL;

  931.                 s->cur_pic.motion_val[i] = NULL;

  932.             }

  933.             return;

  934.         }

  935.     }

  936. 

  937.     if (s->avctx->debug & FF_DEBUG_ER) {

  938.         for (mb_y = 0; mb_y < s->mb_height; mb_y++) {

  939.             for (mb_x = 0; mb_x < s->mb_width; mb_x++) {

  940.                 int status = s->error_status_table[mb_x + mb_y * s->mb_stride];

  941. 

  942.                 av_log(s->avctx, AV_LOG_DEBUG, "%2X ", status);

  943.             }

  944.             av_log(s->avctx, AV_LOG_DEBUG, "\n");

  945.         }

  946.     }

  947. 

  948. #if 1

  949.     /* handle overlapping slices */

  950.     for (error_type = 1; error_type <= 3; error_type++) {

  951.         int end_ok = 0;

  952. 

  953.         for (i = s->mb_num - 1; i >= 0; i--) {

  954.             const int mb_xy = s->mb_index2xy[i];

  955.             int error       = s->error_status_table[mb_xy];

  956. 

  957.             if (error & (1 << error_type))

  958.                 end_ok = 1;

  959.             if (error & (8 << error_type))

  960.                 end_ok = 1;

  961. 

  962.             if (!end_ok)

  963.                 s->error_status_table[mb_xy] |= 1 << error_type;

  964. 

  965.             if (error & VP_START)

  966.                 end_ok = 0;

  967.         }

  968.     }

  969. #endif

  970. #if 1

  971.     /* handle slices with partitions of different length */

  972.     if (s->partitioned_frame) {

  973.         int end_ok = 0;

  974. 

  975.         for (i = s->mb_num - 1; i >= 0; i--) {

  976.             const int mb_xy = s->mb_index2xy[i];

  977.             int error       = s->error_status_table[mb_xy];

  978. 

  979.             if (error & ER_AC_END)

  980.                 end_ok = 0;

  981.             if ((error & ER_MV_END) ||

  982.                 (error & ER_DC_END) ||

  983.                 (error & ER_AC_ERROR))

  984.                 end_ok = 1;

  985. 

  986.             if (!end_ok)

  987.                 s->error_status_table[mb_xy]|= ER_AC_ERROR;

  988. 

  989.             if (error & VP_START)

  990.                 end_ok = 0;

  991.         }

  992.     }

  993. #endif

  994.     /* handle missing slices */

  995.     if (s->avctx->err_recognition & AV_EF_EXPLODE) {

  996.         int end_ok = 1;

  997. 

  998.         // FIXME + 100 hack

  999.         for (i = s->mb_num - 2; i >= s->mb_width + 100; i--) {

  1000.             const int mb_xy = s->mb_index2xy[i];

  1001.             int error1 = s->error_status_table[mb_xy];

  1002.             int error2 = s->error_status_table[s->mb_index2xy[i + 1]];

  1003. 

  1004.             if (error1 & VP_START)

  1005.                 end_ok = 1;

  1006. 

  1007.             if (error2 == (VP_START | ER_MB_ERROR | ER_MB_END) &&

  1008.                 error1 != (VP_START | ER_MB_ERROR | ER_MB_END) &&

  1009.                 ((error1 & ER_AC_END) || (error1 & ER_DC_END) ||

  1010.                 (error1 & ER_MV_END))) {

  1011.                 // end & uninit

  1012.                 end_ok = 0;

  1013.             }

  1014. 

  1015.             if (!end_ok)

  1016.                 s->error_status_table[mb_xy] |= ER_MB_ERROR;

  1017.         }

  1018.     }

  1019. 

  1020. #if 1

  1021.     /* backward mark errors */

  1022.     distance = 9999999;

  1023.     for (error_type = 1; error_type <= 3; error_type++) {

  1024.         for (i = s->mb_num - 1; i >= 0; i--) {

  1025.             const int mb_xy = s->mb_index2xy[i];

  1026.             int       error = s->error_status_table[mb_xy];

  1027. 

  1028.             if (!s->mbskip_table[mb_xy]) // FIXME partition specific

  1029.                 distance++;

  1030.             if (error & (1 << error_type))

  1031.                 distance = 0;

  1032. 

  1033.             if (s->partitioned_frame) {

  1034.                 if (distance < threshold_part[error_type - 1])

  1035.                     s->error_status_table[mb_xy] |= 1 << error_type;

  1036.             } else {

  1037.                 if (distance < threshold)

  1038.                     s->error_status_table[mb_xy] |= 1 << error_type;

  1039.             }

  1040. 

  1041.             if (error & VP_START)

  1042.                 distance = 9999999;

  1043.         }

  1044.     }

  1045. #endif

  1046. 

  1047.     /* forward mark errors */

  1048.     error = 0;

  1049.     for (i = 0; i < s->mb_num; i++) {

  1050.         const int mb_xy = s->mb_index2xy[i];

  1051.         int old_error   = s->error_status_table[mb_xy];

  1052. 

  1053.         if (old_error & VP_START) {

  1054.             error = old_error & ER_MB_ERROR;

  1055.         } else {

  1056.             error |= old_error & ER_MB_ERROR;

  1057.             s->error_status_table[mb_xy] |= error;

  1058.         }

  1059.     }

  1060. #if 1

  1061.     /* handle not partitioned case */

  1062.     if (!s->partitioned_frame) {

  1063.         for (i = 0; i < s->mb_num; i++) {

  1064.             const int mb_xy = s->mb_index2xy[i];

  1065.             int error = s->error_status_table[mb_xy];

  1066.             if (error & ER_MB_ERROR)

  1067.                 error |= ER_MB_ERROR;

  1068.             s->error_status_table[mb_xy] = error;

  1069.         }

  1070.     }

  1071. #endif

  1072. 

  1073.     dc_error = ac_error = mv_error = 0;

  1074.     for (i = 0; i < s->mb_num; i++) {

  1075.         const int mb_xy = s->mb_index2xy[i];

  1076.         int error = s->error_status_table[mb_xy];

  1077.         if (error & ER_DC_ERROR)

  1078.             dc_error++;

  1079.         if (error & ER_AC_ERROR)

  1080.             ac_error++;

  1081.         if (error & ER_MV_ERROR)

  1082.             mv_error++;

  1083.     }

  1084.     av_log(s->avctx, AV_LOG_INFO, "concealing %d DC, %d AC, %d MV errors in %c frame\n",

  1085.            dc_error, ac_error, mv_error, av_get_picture_type_char(s->cur_pic.f->pict_type));

  1086. 

  1087.     is_intra_likely = is_intra_more_likely(s);

  1088. 

  1089.     /* set unknown mb-type to most likely */

  1090.     for (i = 0; i < s->mb_num; i++) {

  1091.         const int mb_xy = s->mb_index2xy[i];

  1092.         int error = s->error_status_table[mb_xy];

  1093.         if (!((error & ER_DC_ERROR) && (error & ER_MV_ERROR)))

  1094.             continue;

  1095. 

  1096.         if (is_intra_likely)

  1097.             s->cur_pic.mb_type[mb_xy] = MB_TYPE_INTRA4x4;

  1098.         else

  1099.             s->cur_pic.mb_type[mb_xy] = MB_TYPE_16x16 | MB_TYPE_L0;

  1100.     }

  1101. 

  1102.     // change inter to intra blocks if no reference frames are available

  1103.     if (!(s->last_pic.f && s->last_pic.f->data[0]) &&

  1104.         !(s->next_pic.f && s->next_pic.f->data[0]))

  1105.         for (i = 0; i < s->mb_num; i++) {

  1106.             const int mb_xy = s->mb_index2xy[i];

  1107.             if (!IS_INTRA(s->cur_pic.mb_type[mb_xy]))

  1108.                 s->cur_pic.mb_type[mb_xy] = MB_TYPE_INTRA4x4;

  1109.         }

  1110. 

  1111.     /* handle inter blocks with damaged AC */

  1112.     for (mb_y = 0; mb_y < s->mb_height; mb_y++) {

  1113.         for (mb_x = 0; mb_x < s->mb_width; mb_x++) {

  1114.             const int mb_xy   = mb_x + mb_y * s->mb_stride;

  1115.             const int mb_type = s->cur_pic.mb_type[mb_xy];

  1116.             const int dir     = !(s->last_pic.f && s->last_pic.f->data[0]);

  1117.             const int mv_dir  = dir ? MV_DIR_BACKWARD : MV_DIR_FORWARD;

  1118.             int mv_type;

  1119. 

  1120.             int error = s->error_status_table[mb_xy];

  1121. 

  1122.             if (IS_INTRA(mb_type))

  1123.                 continue; // intra

  1124.             if (error & ER_MV_ERROR)

  1125.                 continue; // inter with damaged MV

  1126.             if (!(error & ER_AC_ERROR))

  1127.                 continue; // undamaged inter

  1128. 

  1129.             if (IS_8X8(mb_type)) {

  1130.                 int mb_index = mb_x * 2 + mb_y * 2 * s->b8_stride;

  1131.                 int j;

  1132.                 mv_type = MV_TYPE_8X8;

  1133.                 for (j = 0; j < 4; j++) {

  1134.                     s->mv[0][j][0] = s->cur_pic.motion_val[dir][mb_index + (j & 1) + (j >> 1) * s->b8_stride][0];

  1135.                     s->mv[0][j][1] = s->cur_pic.motion_val[dir][mb_index + (j & 1) + (j >> 1) * s->b8_stride][1];

  1136.                 }

  1137.             } else {

  1138.                 mv_type     = MV_TYPE_16X16;

  1139.                 s->mv[0][0][0] = s->cur_pic.motion_val[dir][mb_x * 2 + mb_y * 2 * s->b8_stride][0];

  1140.                 s->mv[0][0][1] = s->cur_pic.motion_val[dir][mb_x * 2 + mb_y * 2 * s->b8_stride][1];

  1141.             }

  1142. 

  1143.             s->decode_mb(s->opaque, 0 /* FIXME h264 partitioned slices need this set */,

  1144.                          mv_dir, mv_type, &s->mv, mb_x, mb_y, 0, 0);

  1145.         }

  1146.     }

  1147. 

  1148.     /* guess MVs */

  1149.     if (s->cur_pic.f->pict_type == AV_PICTURE_TYPE_B) {

  1150.         for (mb_y = 0; mb_y < s->mb_height; mb_y++) {

  1151.             for (mb_x = 0; mb_x < s->mb_width; mb_x++) {

  1152.                 int       xy      = mb_x * 2 + mb_y * 2 * s->b8_stride;

  1153.                 const int mb_xy   = mb_x + mb_y * s->mb_stride;

  1154.                 const int mb_type = s->cur_pic.mb_type[mb_xy];

  1155.                 int mv_dir = MV_DIR_FORWARD | MV_DIR_BACKWARD;

  1156. 

  1157.                 int error = s->error_status_table[mb_xy];

  1158. 

  1159.                 if (IS_INTRA(mb_type))

  1160.                     continue;

  1161.                 if (!(error & ER_MV_ERROR))

  1162.                     continue; // inter with undamaged MV

  1163.                 if (!(error & ER_AC_ERROR))

  1164.                     continue; // undamaged inter

  1165. 

  1166.                 if (!(s->last_pic.f && s->last_pic.f->data[0]))

  1167.                     mv_dir &= ~MV_DIR_FORWARD;

  1168.                 if (!(s->next_pic.f && s->next_pic.f->data[0]))

  1169.                     mv_dir &= ~MV_DIR_BACKWARD;

  1170. 

  1171.                 if (s->pp_time) {

  1172.                     int time_pp = s->pp_time;

  1173.                     int time_pb = s->pb_time;

  1174. 

  1175.                     av_assert0(s->avctx->codec_id != AV_CODEC_ID_H264);

  1176.                     ff_thread_await_progress(s->next_pic.tf, mb_y, 0);

  1177. 

  1178.                     s->mv[0][0][0] = s->next_pic.motion_val[0][xy][0] *  time_pb            / time_pp;

  1179.                     s->mv[0][0][1] = s->next_pic.motion_val[0][xy][1] *  time_pb            / time_pp;

  1180.                     s->mv[1][0][0] = s->next_pic.motion_val[0][xy][0] * (time_pb - time_pp) / time_pp;

  1181.                     s->mv[1][0][1] = s->next_pic.motion_val[0][xy][1] * (time_pb - time_pp) / time_pp;

  1182.                 } else {

  1183.                     s->mv[0][0][0] = 0;

  1184.                     s->mv[0][0][1] = 0;

  1185.                     s->mv[1][0][0] = 0;

  1186.                     s->mv[1][0][1] = 0;

  1187.                 }

  1188. 

  1189.                 s->decode_mb(s->opaque, 0, mv_dir, MV_TYPE_16X16, &s->mv,

  1190.                              mb_x, mb_y, 0, 0);

  1191.             }

  1192.         }

  1193.     } else

  1194.         guess_mv(s);

  1195. 

  1196.     /* the filters below manipulate raw image, skip them */

  1197.     if (CONFIG_XVMC && s->avctx->hwaccel && s->avctx->hwaccel->decode_mb)

  1198.         goto ec_clean;

  1199.     /* fill DC for inter blocks */

  1200.     for (mb_y = 0; mb_y < s->mb_height; mb_y++) {

  1201.         for (mb_x = 0; mb_x < s->mb_width; mb_x++) {

  1202.             int dc, dcu, dcv, y, n;

  1203.             int16_t *dc_ptr;

  1204.             uint8_t *dest_y, *dest_cb, *dest_cr;

  1205.             const int mb_xy   = mb_x + mb_y * s->mb_stride;

  1206.             const int mb_type = s->cur_pic.mb_type[mb_xy];

  1207. 

  1208.             // error = s->error_status_table[mb_xy];

  1209. 

  1210.             if (IS_INTRA(mb_type) && s->partitioned_frame)

  1211.                 continue;

  1212.             // if (error & ER_MV_ERROR)

  1213.             //     continue; // inter data damaged FIXME is this good?

  1214. 

  1215.             dest_y  = s->cur_pic.f->data[0] + mb_x * 16 + mb_y * 16 * linesize[0];

  1216.             dest_cb = s->cur_pic.f->data[1] + mb_x *  8 + mb_y *  8 * linesize[1];

  1217.             dest_cr = s->cur_pic.f->data[2] + mb_x *  8 + mb_y *  8 * linesize[2];

  1218. 

  1219.             dc_ptr = &s->dc_val[0][mb_x * 2 + mb_y * 2 * s->b8_stride];

  1220.             for (n = 0; n < 4; n++) {

  1221.                 dc = 0;

  1222.                 for (y = 0; y < 8; y++) {

  1223.                     int x;

  1224.                     for (x = 0; x < 8; x++)

  1225.                        dc += dest_y[x + (n & 1) * 8 +

  1226.                              (y + (n >> 1) * 8) * linesize[0]];

  1227.                 }

  1228.                 dc_ptr[(n & 1) + (n >> 1) * s->b8_stride] = (dc + 4) >> 3;

  1229.             }

  1230. 

  1231.             dcu = dcv = 0;

  1232.             for (y = 0; y < 8; y++) {

  1233.                 int x;

  1234.                 for (x = 0; x < 8; x++) {

  1235.                     dcu += dest_cb[x + y * linesize[1]];

  1236.                     dcv += dest_cr[x + y * linesize[2]];

  1237.                 }

  1238.             }

  1239.             s->dc_val[1][mb_x + mb_y * s->mb_stride] = (dcu + 4) >> 3;

  1240.             s->dc_val[2][mb_x + mb_y * s->mb_stride] = (dcv + 4) >> 3;

  1241.         }

  1242.     }

  1243. #if 1

  1244.     /* guess DC for damaged blocks */

  1245.     guess_dc(s, s->dc_val[0], s->mb_width*2, s->mb_height*2, s->b8_stride, 1);

  1246.     guess_dc(s, s->dc_val[1], s->mb_width  , s->mb_height  , s->mb_stride, 0);

  1247.     guess_dc(s, s->dc_val[2], s->mb_width  , s->mb_height  , s->mb_stride, 0);

  1248. #endif

  1249. 

  1250.     /* filter luma DC */

  1251.     filter181(s->dc_val[0], s->mb_width * 2, s->mb_height * 2, s->b8_stride);

  1252. 

  1253. #if 1

  1254.     /* render DC only intra */

  1255.     for (mb_y = 0; mb_y < s->mb_height; mb_y++) {

  1256.         for (mb_x = 0; mb_x < s->mb_width; mb_x++) {

  1257.             uint8_t *dest_y, *dest_cb, *dest_cr;

  1258.             const int mb_xy   = mb_x + mb_y * s->mb_stride;

  1259.             const int mb_type = s->cur_pic.mb_type[mb_xy];

  1260. 

  1261.             int error = s->error_status_table[mb_xy];

  1262. 

  1263.             if (IS_INTER(mb_type))

  1264.                 continue;

  1265.             if (!(error & ER_AC_ERROR))

  1266.                 continue; // undamaged

  1267. 

  1268.             dest_y  = s->cur_pic.f->data[0] + mb_x * 16 + mb_y * 16 * linesize[0];

  1269.             dest_cb = s->cur_pic.f->data[1] + mb_x *  8 + mb_y *  8 * linesize[1];

  1270.             dest_cr = s->cur_pic.f->data[2] + mb_x *  8 + mb_y *  8 * linesize[2];

  1271. 

  1272.             put_dc(s, dest_y, dest_cb, dest_cr, mb_x, mb_y);

  1273.         }

  1274.     }

  1275. #endif

  1276. 

  1277.     if (s->avctx->error_concealment & FF_EC_DEBLOCK) {

  1278.         /* filter horizontal block boundaries */

  1279.         h_block_filter(s, s->cur_pic.f->data[0], s->mb_width * 2,

  1280.                        s->mb_height * 2, linesize[0], 1);

  1281.         h_block_filter(s, s->cur_pic.f->data[1], s->mb_width,

  1282.                        s->mb_height, linesize[1], 0);

  1283.         h_block_filter(s, s->cur_pic.f->data[2], s->mb_width,

  1284.                        s->mb_height, linesize[2], 0);

  1285. 

  1286.         /* filter vertical block boundaries */

  1287.         v_block_filter(s, s->cur_pic.f->data[0], s->mb_width * 2,

  1288.                        s->mb_height * 2, linesize[0], 1);

  1289.         v_block_filter(s, s->cur_pic.f->data[1], s->mb_width,

  1290.                        s->mb_height, linesize[1], 0);

  1291.         v_block_filter(s, s->cur_pic.f->data[2], s->mb_width,

  1292.                        s->mb_height, linesize[2], 0);

  1293.     }

  1294. 

  1295. ec_clean:

  1296.     /* clean a few tables */

  1297.     for (i = 0; i < s->mb_num; i++) {

  1298.         const int mb_xy = s->mb_index2xy[i];

  1299.         int       error = s->error_status_table[mb_xy];

  1300. 

  1301.         if (s->cur_pic.f->pict_type != AV_PICTURE_TYPE_B &&

  1302.             (error & (ER_DC_ERROR | ER_MV_ERROR | ER_AC_ERROR))) {

  1303.             s->mbskip_table[mb_xy] = 0;

  1304.         }

  1305.         s->mbintra_table[mb_xy] = 1;

  1306.     }

  1307. 

  1308.     for (i = 0; i < 2; i++) {

  1309.         av_buffer_unref(&s->ref_index_buf[i]);

  1310.         av_buffer_unref(&s->motion_val_buf[i]);

  1311.         s->cur_pic.ref_index[i]  = NULL;

  1312.         s->cur_pic.motion_val[i] = NULL;

  1313.     }

  1314. 

  1315.     memset(&s->cur_pic, 0, sizeof(ERPicture));

  1316.     memset(&s->last_pic, 0, sizeof(ERPicture));

  1317.     memset(&s->next_pic, 0, sizeof(ERPicture));

  1318. }