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.
80498 Commits
32 Branches
424MB
Tree: 8ef57a0d61
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '8ef57a0d61'
${ noResults }
FFmpeg/libavcodec/error_resilience.c

1324 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/atomic.h"

  31. #include "libavutil/internal.h"

  32. #include "avcodec.h"

  33. #include "error_resilience.h"

  34. #include "me_cmp.h"

  35. #include "mpegutils.h"

  36. #include "mpegvideo.h"

  37. #include "rectangle.h"

  38. #include "thread.h"

  39. #include "version.h"

  40. 

  41. /**

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

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

  44.  */

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

  46. {

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

  48.         av_assert0(s->quarter_sample);

  49.         *mv_step = 4;

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

  51.     } else {

  52.         *mv_step = 2;

  53.         *stride  = s->b8_stride;

  54.     }

  55. }

  56. 

  57. /**

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

  59.  */

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

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

  62. {

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

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

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

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

  67.         if (dc < 0)

  68.             dc = 0;

  69.         else if (dc > 2040)

  70.             dc = 2040;

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

  72.             int x;

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

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

  75.         }

  76.     }

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

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

  79.     if (dcu < 0)

  80.         dcu = 0;

  81.     else if (dcu > 2040)

  82.         dcu = 2040;

  83.     if (dcv < 0)

  84.         dcv = 0;

  85.     else if (dcv > 2040)

  86.         dcv = 2040;

  87. 

  88.     if (dest_cr)

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

  90.         int x;

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

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

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

  94.         }

  95.     }

  96. }

  97. 

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

  99. {

  100.     int x, y;

  101. 

  102.     /* horizontal filter */

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

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

  105. 

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

  107.             int dc;

  108.             dc = -prev_dc +

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

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

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

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

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

  114.         }

  115.     }

  116. 

  117.     /* vertical filter */

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

  119.         int prev_dc = data[x];

  120. 

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

  122.             int dc;

  123. 

  124.             dc = -prev_dc +

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

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

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

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

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

  130.         }

  131.     }

  132. }

  133. 

  134. /**

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

  136.  * @param w     width in 8 pixel blocks

  137.  * @param h     height in 8 pixel blocks

  138.  */

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

  140.                      int h, int stride, int is_luma)

  141. {

  142.     int b_x, b_y;

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

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

  145. 

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

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

  148.         goto fail;

  149.     }

  150. 

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

  152.         int color= 1024;

  153.         int distance= -1;

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

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

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

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

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

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

  160.                 distance= b_x;

  161.             }

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

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

  164.         }

  165.         color= 1024;

  166.         distance= -1;

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

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

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

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

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

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

  173.                 distance= b_x;

  174.             }

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

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

  177.         }

  178.     }

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

  180.         int color= 1024;

  181.         int distance= -1;

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

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

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

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

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

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

  188.                 distance= b_y;

  189.             }

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

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

  192.         }

  193.         color= 1024;

  194.         distance= -1;

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

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

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

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

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

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

  201.                 distance= b_y;

  202.             }

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

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

  205.         }

  206.     }

  207. 

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

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

  210.             int mb_index, error, j;

  211.             int64_t guess, weight_sum;

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

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

  214. 

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

  216.                 continue; // inter

  217.             if (!(error & ER_DC_ERROR))

  218.                 continue; // dc-ok

  219. 

  220.             weight_sum = 0;

  221.             guess      = 0;

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

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

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

  225.                 weight_sum     += weight;

  226.             }

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

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

  229.         }

  230.     }

  231. 

  232. fail:

  233.     av_freep(&col);

  234.     av_freep(&dist);

  235. }

  236. 

  237. /**

  238.  * simple horizontal deblocking filter used for error resilience

  239.  * @param w     width in 8 pixel blocks

  240.  * @param h     height in 8 pixel blocks

  241.  */

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

  243.                            int h, int stride, int is_luma)

  244. {

  245.     int b_x, b_y, mvx_stride, mvy_stride;

  246.     const uint8_t *cm = ff_crop_tab + MAX_NEG_CROP;

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

  248.     mvx_stride >>= is_luma;

  249.     mvy_stride *= mvx_stride;

  250. 

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

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

  253.             int y;

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

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

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

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

  258.             int left_damage  = left_status & ER_MB_ERROR;

  259.             int right_damage = right_status & ER_MB_ERROR;

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

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

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

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

  264.                 continue; // both undamaged

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

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

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

  268.                 continue;

  269. 

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

  271.                 int a, b, c, d;

  272. 

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

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

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

  276. 

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

  278.                 d = FFMAX(d, 0);

  279.                 if (b < 0)

  280.                     d = -d;

  281. 

  282.                 if (d == 0)

  283.                     continue;

  284. 

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

  286.                     d = d * 16 / 9;

  287. 

  288.                 if (left_damage) {

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

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

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

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

  293.                 }

  294.                 if (right_damage) {

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

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

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

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

  299.                 }

  300.             }

  301.         }

  302.     }

  303. }

  304. 

  305. /**

  306.  * simple vertical deblocking filter used for error resilience

  307.  * @param w     width in 8 pixel blocks

  308.  * @param h     height in 8 pixel blocks

  309.  */

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

  311.                            int stride, int is_luma)

  312. {

  313.     int b_x, b_y, mvx_stride, mvy_stride;

  314.     const uint8_t *cm = ff_crop_tab + MAX_NEG_CROP;

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

  316.     mvx_stride >>= is_luma;

  317.     mvy_stride *= mvx_stride;

  318. 

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

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

  321.             int x;

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

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

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

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

  326.             int top_damage    = top_status & ER_MB_ERROR;

  327.             int bottom_damage = bottom_status & ER_MB_ERROR;

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

  329. 

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

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

  332. 

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

  334.                 continue; // both undamaged

  335. 

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

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

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

  339.                 continue;

  340. 

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

  342.                 int a, b, c, d;

  343. 

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

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

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

  347. 

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

  349.                 d = FFMAX(d, 0);

  350.                 if (b < 0)

  351.                     d = -d;

  352. 

  353.                 if (d == 0)

  354.                     continue;

  355. 

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

  357.                     d = d * 16 / 9;

  358. 

  359.                 if (top_damage) {

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

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

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

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

  364.                 }

  365.                 if (bottom_damage) {

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

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

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

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

  370.                 }

  371.             }

  372.         }

  373.     }

  374. }

  375. 

  376. static void guess_mv(ERContext *s)

  377. {

  378.     uint8_t *fixed = s->er_temp_buffer;

  379. #define MV_FROZEN    3

  380. #define MV_CHANGED   2

  381. #define MV_UNCHANGED 1

  382.     const int mb_stride = s->mb_stride;

  383.     const int mb_width  = s->mb_width;

  384.     int mb_height = s->mb_height;

  385.     int i, depth, num_avail;

  386.     int mb_x, mb_y, mot_step, mot_stride;

  387. 

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

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

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

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

  392. 

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

  394. 

  395.     num_avail = 0;

  396.     if (s->last_pic.motion_val[0])

  397.         ff_thread_await_progress(s->last_pic.tf, mb_height-1, 0);

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

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

  400.         int f = 0;

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

  402. 

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

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

  405.         if (!(error & ER_MV_ERROR))

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

  407. 

  408.         fixed[mb_xy] = f;

  409.         if (f == MV_FROZEN)

  410.             num_avail++;

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

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

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

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

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

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

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

  418.         }

  419.     }

  420. 

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

  422.         num_avail <= mb_width / 2) {

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

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

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

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

  427. 

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

  429.                     continue;

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

  431.                     continue;

  432. 

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

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

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

  436.                              mb_x, mb_y, 0, 0);

  437.             }

  438.         }

  439.         return;

  440.     }

  441. 

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

  443.         int changed, pass, none_left;

  444. 

  445.         none_left = 1;

  446.         changed   = 1;

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

  448.             int mb_x, mb_y;

  449.             int score_sum = 0;

  450. 

  451.             changed = 0;

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

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

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

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

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

  457.                     int pred_count         = 0;

  458.                     int j;

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

  460.                     int best_pred          = 0;

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

  462.                     int prev_x = 0, prev_y = 0, prev_ref = 0;

  463. 

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

  465.                         continue;

  466. 

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

  468.                         continue;

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

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

  471. 

  472.                     j = 0;

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

  474.                         j = 1;

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

  476.                         j = 1;

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

  478.                         j = 1;

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

  480.                         j = 1;

  481.                     if (j == 0)

  482.                         continue;

  483. 

  484.                     j = 0;

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

  486.                         j = 1;

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

  488.                         j = 1;

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

  490.                         j = 1;

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

  492.                         j = 1;

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

  494.                         continue;

  495. 

  496.                     none_left = 0;

  497. 

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

  499.                         mv_predictor[pred_count][0] =

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

  501.                         mv_predictor[pred_count][1] =

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

  503.                         ref[pred_count] =

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

  505.                         pred_count++;

  506.                     }

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

  508.                         mv_predictor[pred_count][0] =

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

  510.                         mv_predictor[pred_count][1] =

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

  512.                         ref[pred_count] =

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

  514.                         pred_count++;

  515.                     }

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

  517.                         mv_predictor[pred_count][0] =

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

  519.                         mv_predictor[pred_count][1] =

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

  521.                         ref[pred_count] =

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

  523.                         pred_count++;

  524.                     }

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

  526.                         mv_predictor[pred_count][0] =

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

  528.                         mv_predictor[pred_count][1] =

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

  530.                         ref[pred_count] =

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

  532.                         pred_count++;

  533.                     }

  534.                     if (pred_count == 0)

  535.                         continue;

  536. 

  537.                     if (pred_count > 1) {

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

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

  540. 

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

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

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

  544.                             sum_r += ref[j];

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

  546.                                 goto skip_mean_and_median;

  547.                         }

  548. 

  549.                         /* mean */

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

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

  552.                                  ref[pred_count]    = sum_r / j;

  553. 

  554.                         /* median */

  555.                         if (pred_count >= 3) {

  556.                             min_y = min_x = min_r =  99999;

  557.                             max_y = max_x = max_r = -99999;

  558.                         } else {

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

  560.                         }

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

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

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

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

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

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

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

  568.                         }

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

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

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

  572. 

  573.                         if (pred_count == 4) {

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

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

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

  577.                         }

  578.                         pred_count += 2;

  579.                     }

  580. 

  581. skip_mean_and_median:

  582.                     /* zero MV */

  583.                     pred_count++;

  584. 

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

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

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

  588. 

  589.                     /* last MV */

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

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

  592.                              ref[pred_count]    = prev_ref;

  593.                     pred_count++;

  594. 

  595. skip_last_mv:

  596. 

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

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

  599.                         int score = 0;

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

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

  602. 

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

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

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

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

  607. 

  608.                         // predictor intra or otherwise not available

  609.                         if (ref[j] < 0)

  610.                             continue;

  611. 

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

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

  614. 

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

  616.                             int k;

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

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

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

  620.                         }

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

  622.                             int k;

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

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

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

  626.                         }

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

  628.                             int k;

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

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

  631.                         }

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

  633.                             int k;

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

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

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

  637.                         }

  638. 

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

  640.                             best_score = score;

  641.                             best_pred  = j;

  642.                         }

  643.                     }

  644.                     score_sum += best_score;

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

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

  647. 

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

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

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

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

  652.                         }

  653. 

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

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

  656. 

  657. 

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

  659.                         fixed[mb_xy] = MV_CHANGED;

  660.                         changed++;

  661.                     } else

  662.                         fixed[mb_xy] = MV_UNCHANGED;

  663.                 }

  664.             }

  665.         }

  666. 

  667.         if (none_left)

  668.             return;

  669. 

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

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

  672.             if (fixed[mb_xy])

  673.                 fixed[mb_xy] = MV_FROZEN;

  674.         }

  675.     }

  676. }

  677. 

  678. static int is_intra_more_likely(ERContext *s)

  679. {

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

  681. 

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

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

  684. 

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

  686.         return 0;

  687. 

  688.     undamaged_count = 0;

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

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

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

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

  693.             undamaged_count++;

  694.     }

  695. 

  696.     if (undamaged_count < 5)

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

  698. 

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

  700.     if (CONFIG_XVMC    &&

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

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

  703.         return 1;

  704. 

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

  706.     is_intra_likely = 0;

  707. 

  708.     j = 0;

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

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

  711.             int error;

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

  713. 

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

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

  716.                 continue; // skip damaged

  717. 

  718.             j++;

  719.             // skip a few to speed things up

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

  721.                 continue;

  722. 

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

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

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

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

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

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

  729. 

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

  731.                     // FIXME

  732.                 } else {

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

  734.                 }

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

  736.                                                   linesize[0], 16);

  737.                 // FIXME need await_progress() here

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

  739.                                                   last_mb_ptr + linesize[0] * 16,

  740.                                                   linesize[0], 16);

  741.             } else {

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

  743.                    is_intra_likely++;

  744.                 else

  745.                    is_intra_likely--;

  746.             }

  747.         }

  748.     }

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

  750.     return is_intra_likely > 0;

  751. }

  752. 

  753. void ff_er_frame_start(ERContext *s)

  754. {

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

  756.         return;

  757. 

  758.     if (!s->mecc_inited) {

  759.         ff_me_cmp_init(&s->mecc, s->avctx);

  760.         s->mecc_inited = 1;

  761.     }

  762. 

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

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

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

  766.     s->error_occurred = 0;

  767. }

  768. 

  769. static int er_supported(ERContext *s)

  770. {

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

  772. #if FF_API_CAP_VDPAU

  773.        s->avctx->codec->capabilities&AV_CODEC_CAP_HWACCEL_VDPAU          ||

  774. #endif

  775.        !s->cur_pic.f                                                  ||

  776.        s->cur_pic.field_picture

  777.     )

  778.         return 0;

  779.     return 1;

  780. }

  781. 

  782. /**

  783.  * Add a slice.

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

  785.  *               for the last of the previous line

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

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

  788.  */

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

  790.                      int endx, int endy, int status)

  791. {

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

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

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

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

  796.     int mask           = -1;

  797. 

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

  799.         return;

  800. 

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

  802.         av_log(s->avctx, AV_LOG_ERROR,

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

  804.         return;

  805.     }

  806. 

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

  808.         return;

  809. 

  810.     mask &= ~VP_START;

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

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

  813.         avpriv_atomic_int_add_and_fetch(&s->error_count, start_i - end_i - 1);

  814.     }

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

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

  817.         avpriv_atomic_int_add_and_fetch(&s->error_count, start_i - end_i - 1);

  818.     }

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

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

  821.         avpriv_atomic_int_add_and_fetch(&s->error_count, start_i - end_i - 1);

  822.     }

  823. 

  824.     if (status & ER_MB_ERROR) {

  825.         s->error_occurred = 1;

  826.         avpriv_atomic_int_set(&s->error_count, INT_MAX);

  827.     }

  828. 

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

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

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

  832.     } else {

  833.         int i;

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

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

  836.     }

  837. 

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

  839.         avpriv_atomic_int_set(&s->error_count, INT_MAX);

  840.     else {

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

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

  843.     }

  844. 

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

  846. 

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

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

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

  850. 

  851.         prev_status &= ~ VP_START;

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

  853.             s->error_occurred = 1;

  854.             avpriv_atomic_int_set(&s->error_count, INT_MAX);

  855.         }

  856.     }

  857. }

  858. 

  859. void ff_er_frame_end(ERContext *s)

  860. {

  861.     int *linesize = NULL;

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

  863.     int distance;

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

  865.     int threshold = 50;

  866.     int is_intra_likely;

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

  868. 

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

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

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

  872.         s->avctx->lowres                                               ||

  873.         !er_supported(s)                                               ||

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

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

  876.         return;

  877.     }

  878.     linesize = s->cur_pic.f->linesize;

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

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

  881.         if (status != 0x7F)

  882.             break;

  883.     }

  884. 

  885.     if (   mb_x == s->mb_width

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

  887.         && (FFALIGN(s->avctx->height, 16)&16)

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

  889.     ) {

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

  891.         return;

  892.     }

  893. 

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

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

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

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

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

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

  900.         }

  901.     }

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

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

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

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

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

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

  908.         }

  909.     }

  910. 

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

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

  913. 

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

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

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

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

  918.                 break;

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

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

  921.         }

  922.         if (i < 2) {

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

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

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

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

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

  928.             }

  929.             return;

  930.         }

  931.     }

  932. 

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

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

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

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

  937. 

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

  939.             }

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

  941.         }

  942.     }

  943. 

  944. #if 1

  945.     /* handle overlapping slices */

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

  947.         int end_ok = 0;

  948. 

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

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

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

  952. 

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

  954.                 end_ok = 1;

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

  956.                 end_ok = 1;

  957. 

  958.             if (!end_ok)

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

  960. 

  961.             if (error & VP_START)

  962.                 end_ok = 0;

  963.         }

  964.     }

  965. #endif

  966. #if 1

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

  968.     if (s->partitioned_frame) {

  969.         int end_ok = 0;

  970. 

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

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

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

  974. 

  975.             if (error & ER_AC_END)

  976.                 end_ok = 0;

  977.             if ((error & ER_MV_END) ||

  978.                 (error & ER_DC_END) ||

  979.                 (error & ER_AC_ERROR))

  980.                 end_ok = 1;

  981. 

  982.             if (!end_ok)

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

  984. 

  985.             if (error & VP_START)

  986.                 end_ok = 0;

  987.         }

  988.     }

  989. #endif

  990.     /* handle missing slices */

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

  992.         int end_ok = 1;

  993. 

  994.         // FIXME + 100 hack

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

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

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

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

  999. 

  1000.             if (error1 & VP_START)

  1001.                 end_ok = 1;

  1002. 

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

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

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

  1006.                 (error1 & ER_MV_END))) {

  1007.                 // end & uninit

  1008.                 end_ok = 0;

  1009.             }

  1010. 

  1011.             if (!end_ok)

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

  1013.         }

  1014.     }

  1015. 

  1016. #if 1

  1017.     /* backward mark errors */

  1018.     distance = 9999999;

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

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

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

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

  1023. 

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

  1025.                 distance++;

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

  1027.                 distance = 0;

  1028. 

  1029.             if (s->partitioned_frame) {

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

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

  1032.             } else {

  1033.                 if (distance < threshold)

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

  1035.             }

  1036. 

  1037.             if (error & VP_START)

  1038.                 distance = 9999999;

  1039.         }

  1040.     }

  1041. #endif

  1042. 

  1043.     /* forward mark errors */

  1044.     error = 0;

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

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

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

  1048. 

  1049.         if (old_error & VP_START) {

  1050.             error = old_error & ER_MB_ERROR;

  1051.         } else {

  1052.             error |= old_error & ER_MB_ERROR;

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

  1054.         }

  1055.     }

  1056. #if 1

  1057.     /* handle not partitioned case */

  1058.     if (!s->partitioned_frame) {

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

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

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

  1062.             if (error & ER_MB_ERROR)

  1063.                 error |= ER_MB_ERROR;

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

  1065.         }

  1066.     }

  1067. #endif

  1068. 

  1069.     dc_error = ac_error = mv_error = 0;

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

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

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

  1073.         if (error & ER_DC_ERROR)

  1074.             dc_error++;

  1075.         if (error & ER_AC_ERROR)

  1076.             ac_error++;

  1077.         if (error & ER_MV_ERROR)

  1078.             mv_error++;

  1079.     }

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

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

  1082. 

  1083.     is_intra_likely = is_intra_more_likely(s);

  1084. 

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

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

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

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

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

  1090.             continue;

  1091. 

  1092.         if (is_intra_likely)

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

  1094.         else

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

  1096.     }

  1097. 

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

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

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

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

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

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

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

  1105.         }

  1106. 

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

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

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

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

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

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

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

  1114.             int mv_type;

  1115. 

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

  1117. 

  1118.             if (IS_INTRA(mb_type))

  1119.                 continue; // intra

  1120.             if (error & ER_MV_ERROR)

  1121.                 continue; // inter with damaged MV

  1122.             if (!(error & ER_AC_ERROR))

  1123.                 continue; // undamaged inter

  1124. 

  1125.             if (IS_8X8(mb_type)) {

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

  1127.                 int j;

  1128.                 mv_type = MV_TYPE_8X8;

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

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

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

  1132.                 }

  1133.             } else {

  1134.                 mv_type     = MV_TYPE_16X16;

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

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

  1137.             }

  1138. 

  1139.             s->decode_mb(s->opaque, 0 /* FIXME H.264 partitioned slices need this set */,

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

  1141.         }

  1142.     }

  1143. 

  1144.     /* guess MVs */

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

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

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

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

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

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

  1151.                 int mv_dir = MV_DIR_FORWARD | MV_DIR_BACKWARD;

  1152. 

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

  1154. 

  1155.                 if (IS_INTRA(mb_type))

  1156.                     continue;

  1157.                 if (!(error & ER_MV_ERROR))

  1158.                     continue; // inter with undamaged MV

  1159.                 if (!(error & ER_AC_ERROR))

  1160.                     continue; // undamaged inter

  1161. 

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

  1163.                     mv_dir &= ~MV_DIR_FORWARD;

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

  1165.                     mv_dir &= ~MV_DIR_BACKWARD;

  1166. 

  1167.                 if (s->pp_time) {

  1168.                     int time_pp = s->pp_time;

  1169.                     int time_pb = s->pb_time;

  1170. 

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

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

  1173. 

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

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

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

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

  1178.                 } else {

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

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

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

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

  1183.                 }

  1184. 

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

  1186.                              mb_x, mb_y, 0, 0);

  1187.             }

  1188.         }

  1189.     } else

  1190.         guess_mv(s);

  1191. 

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

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

  1194.         goto ec_clean;

  1195.     /* fill DC for inter blocks */

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

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

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

  1199.             int16_t *dc_ptr;

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

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

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

  1203. 

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

  1205. 

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

  1207.                 continue;

  1208.             // if (error & ER_MV_ERROR)

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

  1210. 

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

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

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

  1214. 

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

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

  1217.                 dc = 0;

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

  1219.                     int x;

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

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

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

  1223.                 }

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

  1225.             }

  1226. 

  1227.             if (!s->cur_pic.f->data[2])

  1228.                 continue;

  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.             if (!s->cur_pic.f->data[2])

  1271.                 dest_cb = dest_cr = NULL;

  1272. 

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

  1274.         }

  1275.     }

  1276. #endif

  1277. 

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

  1279.         /* filter horizontal block boundaries */

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

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

  1282. 

  1283.         /* filter vertical block boundaries */

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

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

  1286. 

  1287.         if (s->cur_pic.f->data[2]) {

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

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

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

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

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

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

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

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

  1296.         }

  1297.     }

  1298. 

  1299. ec_clean:

  1300.     /* clean a few tables */

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

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

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

  1304. 

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

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

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

  1308.         }

  1309.         if (s->mbintra_table)

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

  1311.     }

  1312. 

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

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

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

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

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

  1318.     }

  1319. 

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

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

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

  1323. }