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.
83194 Commits
32 Branches
1.2GB
Tree: d9d9fd9446
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'd9d9fd9446'
${ noResults }
FFmpeg/libavcodec/error_resilience.c

1367 lines
52KB
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. #define MV_FROZEN    8

  377. #define MV_CHANGED   4

  378. #define MV_UNCHANGED 2

  379. #define MV_LISTED    1

  380. static av_always_inline void add_blocklist(int (*blocklist)[2], int *blocklist_length, uint8_t *fixed, int mb_x, int mb_y, int mb_xy)

  381. {

  382.     if (fixed[mb_xy])

  383.         return;

  384.     fixed[mb_xy] = MV_LISTED;

  385.     blocklist[ *blocklist_length   ][0] = mb_x;

  386.     blocklist[(*blocklist_length)++][1] = mb_y;

  387. }

  388. 

  389. static void guess_mv(ERContext *s)

  390. {

  391.     int (*blocklist)[2], (*next_blocklist)[2];

  392.     uint8_t *fixed;

  393.     const int mb_stride = s->mb_stride;

  394.     const int mb_width  = s->mb_width;

  395.     int mb_height = s->mb_height;

  396.     int i, depth, num_avail;

  397.     int mb_x, mb_y, mot_step, mot_stride;

  398.     int blocklist_length, next_blocklist_length;

  399. 

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

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

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

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

  404. 

  405.     blocklist      =  s->er_temp_buffer;

  406.     next_blocklist = (s->er_temp_buffer + 2 * sizeof(int) * s->mb_stride * s->mb_height);

  407.     fixed          =  s->er_temp_buffer + 4 * sizeof(int) * s->mb_stride * s->mb_height;

  408. 

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

  410. 

  411.     num_avail = 0;

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

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

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

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

  416.         int f = 0;

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

  418. 

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

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

  421.         if (!(error & ER_MV_ERROR))

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

  423. 

  424.         fixed[mb_xy] = f;

  425.         if (f == MV_FROZEN)

  426.             num_avail++;

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

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

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

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

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

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

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

  434.         }

  435.     }

  436. 

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

  438.         num_avail <= mb_width / 2) {

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

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

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

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

  443. 

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

  445.                     continue;

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

  447.                     continue;

  448. 

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

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

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

  452.                              mb_x, mb_y, 0, 0);

  453.             }

  454.         }

  455.         return;

  456.     }

  457. 

  458.     blocklist_length = 0;

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

  460.         for (mb_x = 0; mb_x < mb_width; mb_x++) {

  461.             const int mb_xy = mb_x + mb_y * mb_stride;

  462.             if (fixed[mb_xy] == MV_FROZEN) {

  463.                 if (mb_x)               add_blocklist(blocklist, &blocklist_length, fixed, mb_x - 1, mb_y, mb_xy - 1);

  464.                 if (mb_y)               add_blocklist(blocklist, &blocklist_length, fixed, mb_x, mb_y - 1, mb_xy - mb_stride);

  465.                 if (mb_x+1 < mb_width)  add_blocklist(blocklist, &blocklist_length, fixed, mb_x + 1, mb_y, mb_xy + 1);

  466.                 if (mb_y+1 < mb_height) add_blocklist(blocklist, &blocklist_length, fixed, mb_x, mb_y + 1, mb_xy + mb_stride);

  467.             }

  468.         }

  469.     }

  470. 

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

  472.         int changed, pass, none_left;

  473.         int blocklist_index;

  474. 

  475.         none_left = 1;

  476.         changed   = 1;

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

  478.             int mb_x, mb_y;

  479.             int score_sum = 0;

  480. 

  481.             changed = 0;

  482.             for (blocklist_index = 0; blocklist_index < blocklist_length; blocklist_index++) {

  483.                 const int mb_x = blocklist[blocklist_index][0];

  484.                 const int mb_y = blocklist[blocklist_index][1];

  485.                 const int mb_xy = mb_x + mb_y * mb_stride;

  486.                 int mv_predictor[8][2];

  487.                 int ref[8];

  488.                 int pred_count;

  489.                 int j;

  490.                 int best_score;

  491.                 int best_pred;

  492.                 int mot_index;

  493.                 int prev_x, prev_y, prev_ref;

  494. 

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

  496.                     continue;

  497.                 av_assert2(fixed[mb_xy] != MV_FROZEN);

  498. 

  499. 

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

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

  502. 

  503.                     j = 0;

  504.                     if (mb_x > 0)

  505.                         j |= fixed[mb_xy - 1];

  506.                     if (mb_x + 1 < mb_width)

  507.                         j |= fixed[mb_xy + 1];

  508.                     if (mb_y > 0)

  509.                         j |= fixed[mb_xy - mb_stride];

  510.                     if (mb_y + 1 < mb_height)

  511.                         j |= fixed[mb_xy + mb_stride];

  512. 

  513.                     av_assert2(j & MV_FROZEN);

  514. 

  515.                     if (!(j & MV_CHANGED) && pass > 1)

  516.                         continue;

  517. 

  518.                     none_left = 0;

  519.                     pred_count = 0;

  520.                     mot_index  = (mb_x + mb_y * mot_stride) * mot_step;

  521. 

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

  523.                         mv_predictor[pred_count][0] =

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

  525.                         mv_predictor[pred_count][1] =

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

  527.                         ref[pred_count] =

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

  529.                         pred_count++;

  530.                     }

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

  532.                         mv_predictor[pred_count][0] =

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

  534.                         mv_predictor[pred_count][1] =

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

  536.                         ref[pred_count] =

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

  538.                         pred_count++;

  539.                     }

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

  541.                         mv_predictor[pred_count][0] =

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

  543.                         mv_predictor[pred_count][1] =

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

  545.                         ref[pred_count] =

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

  547.                         pred_count++;

  548.                     }

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

  550.                         mv_predictor[pred_count][0] =

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

  552.                         mv_predictor[pred_count][1] =

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

  554.                         ref[pred_count] =

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

  556.                         pred_count++;

  557.                     }

  558.                     if (pred_count == 0)

  559.                         continue;

  560. 

  561.                     if (pred_count > 1) {

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

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

  564. 

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

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

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

  568.                             sum_r += ref[j];

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

  570.                                 goto skip_mean_and_median;

  571.                         }

  572. 

  573.                         /* mean */

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

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

  576.                                  ref[pred_count]    = sum_r / j;

  577. 

  578.                         /* median */

  579.                         if (pred_count >= 3) {

  580.                             min_y = min_x = min_r =  99999;

  581.                             max_y = max_x = max_r = -99999;

  582.                         } else {

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

  584.                         }

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

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

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

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

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

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

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

  592.                         }

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

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

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

  596. 

  597.                         if (pred_count == 4) {

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

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

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

  601.                         }

  602.                         pred_count += 2;

  603.                     }

  604. 

  605. skip_mean_and_median:

  606.                     /* zero MV */

  607.                     mv_predictor[pred_count][0] =

  608.                     mv_predictor[pred_count][1] =

  609.                              ref[pred_count]    = 0;

  610.                     pred_count++;

  611. 

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

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

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

  615. 

  616.                     /* last MV */

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

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

  619.                              ref[pred_count]    = prev_ref;

  620.                     pred_count++;

  621. 

  622.                     best_pred = 0;

  623.                     best_score = 256 * 256 * 256 * 64;

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

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

  626.                         int score = 0;

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

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

  629. 

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

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

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

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

  634. 

  635.                         // predictor intra or otherwise not available

  636.                         if (ref[j] < 0)

  637.                             continue;

  638. 

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

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

  641. 

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

  643.                             int k;

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

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

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

  647.                         }

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

  649.                             int k;

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

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

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

  653.                         }

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

  655.                             int k;

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

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

  658.                         }

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

  660.                             int k;

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

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

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

  664.                         }

  665. 

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

  667.                             best_score = score;

  668.                             best_pred  = j;

  669.                         }

  670.                     }

  671.                     score_sum += best_score;

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

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

  674. 

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

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

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

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

  679.                         }

  680. 

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

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

  683. 

  684. 

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

  686.                         fixed[mb_xy] = MV_CHANGED;

  687.                         changed++;

  688.                     } else

  689.                         fixed[mb_xy] = MV_UNCHANGED;

  690.             }

  691.         }

  692. 

  693.         if (none_left)

  694.             return;

  695. 

  696.         next_blocklist_length = 0;

  697. 

  698.         for (blocklist_index = 0; blocklist_index < blocklist_length; blocklist_index++) {

  699.             const int mb_x = blocklist[blocklist_index][0];

  700.             const int mb_y = blocklist[blocklist_index][1];

  701.             const int mb_xy = mb_x + mb_y * mb_stride;

  702. 

  703.             if (fixed[mb_xy] & (MV_CHANGED|MV_UNCHANGED|MV_FROZEN)) {

  704.                 fixed[mb_xy] = MV_FROZEN;

  705.                 if (mb_x > 0)

  706.                     add_blocklist(next_blocklist, &next_blocklist_length, fixed, mb_x - 1, mb_y, mb_xy - 1);

  707.                 if (mb_y > 0)

  708.                     add_blocklist(next_blocklist, &next_blocklist_length, fixed, mb_x, mb_y - 1, mb_xy - mb_stride);

  709.                 if (mb_x + 1 < mb_width)

  710.                     add_blocklist(next_blocklist, &next_blocklist_length, fixed, mb_x + 1, mb_y, mb_xy + 1);

  711.                 if (mb_y + 1 < mb_height)

  712.                     add_blocklist(next_blocklist, &next_blocklist_length, fixed, mb_x, mb_y + 1, mb_xy + mb_stride);

  713.             }

  714.         }

  715.         av_assert0(next_blocklist_length <= mb_height * mb_width);

  716.         FFSWAP(int , blocklist_length, next_blocklist_length);

  717.         FFSWAP(void*, blocklist, next_blocklist);

  718.     }

  719. }

  720. 

  721. static int is_intra_more_likely(ERContext *s)

  722. {

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

  724. 

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

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

  727. 

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

  729.         return 0;

  730. 

  731.     undamaged_count = 0;

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

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

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

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

  736.             undamaged_count++;

  737.     }

  738. 

  739.     if (undamaged_count < 5)

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

  741. 

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

  743.     if (CONFIG_XVMC    &&

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

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

  746.         return 1;

  747. 

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

  749.     is_intra_likely = 0;

  750. 

  751.     j = 0;

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

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

  754.             int error;

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

  756. 

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

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

  759.                 continue; // skip damaged

  760. 

  761.             j++;

  762.             // skip a few to speed things up

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

  764.                 continue;

  765. 

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

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

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

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

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

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

  772. 

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

  774.                     // FIXME

  775.                 } else {

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

  777.                 }

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

  779.                                                   linesize[0], 16);

  780.                 // FIXME need await_progress() here

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

  782.                                                   last_mb_ptr + linesize[0] * 16,

  783.                                                   linesize[0], 16);

  784.             } else {

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

  786.                    is_intra_likely++;

  787.                 else

  788.                    is_intra_likely--;

  789.             }

  790.         }

  791.     }

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

  793.     return is_intra_likely > 0;

  794. }

  795. 

  796. void ff_er_frame_start(ERContext *s)

  797. {

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

  799.         return;

  800. 

  801.     if (!s->mecc_inited) {

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

  803.         s->mecc_inited = 1;

  804.     }

  805. 

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

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

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

  809.     s->error_occurred = 0;

  810. }

  811. 

  812. static int er_supported(ERContext *s)

  813. {

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

  815. #if FF_API_CAP_VDPAU

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

  817. #endif

  818.        !s->cur_pic.f                                                  ||

  819.        s->cur_pic.field_picture

  820.     )

  821.         return 0;

  822.     return 1;

  823. }

  824. 

  825. /**

  826.  * Add a slice.

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

  828.  *               for the last of the previous line

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

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

  831.  */

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

  833.                      int endx, int endy, int status)

  834. {

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

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

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

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

  839.     int mask           = -1;

  840. 

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

  842.         return;

  843. 

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

  845.         av_log(s->avctx, AV_LOG_ERROR,

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

  847.         return;

  848.     }

  849. 

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

  851.         return;

  852. 

  853.     mask &= ~VP_START;

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

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

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

  857.     }

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

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

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

  861.     }

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

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

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

  865.     }

  866. 

  867.     if (status & ER_MB_ERROR) {

  868.         s->error_occurred = 1;

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

  870.     }

  871. 

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

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

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

  875.     } else {

  876.         int i;

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

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

  879.     }

  880. 

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

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

  883.     else {

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

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

  886.     }

  887. 

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

  889. 

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

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

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

  893. 

  894.         prev_status &= ~ VP_START;

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

  896.             s->error_occurred = 1;

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

  898.         }

  899.     }

  900. }

  901. 

  902. void ff_er_frame_end(ERContext *s)

  903. {

  904.     int *linesize = NULL;

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

  906.     int distance;

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

  908.     int threshold = 50;

  909.     int is_intra_likely;

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

  911. 

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

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

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

  915.         s->avctx->lowres                                               ||

  916.         !er_supported(s)                                               ||

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

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

  919.         return;

  920.     }

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

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

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

  924.         if (status != 0x7F)

  925.             break;

  926.     }

  927. 

  928.     if (   mb_x == s->mb_width

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

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

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

  932.     ) {

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

  934.         return;

  935.     }

  936. 

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

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

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

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

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

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

  943.         }

  944.     }

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

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

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

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

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

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

  951.         }

  952.     }

  953. 

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

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

  956. 

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

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

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

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

  961.                 break;

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

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

  964.         }

  965.         if (i < 2) {

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

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

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

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

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

  971.             }

  972.             return;

  973.         }

  974.     }

  975. 

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

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

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

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

  980. 

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

  982.             }

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

  984.         }

  985.     }

  986. 

  987. #if 1

  988.     /* handle overlapping slices */

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

  990.         int end_ok = 0;

  991. 

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

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

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

  995. 

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

  997.                 end_ok = 1;

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

  999.                 end_ok = 1;

  1000. 

  1001.             if (!end_ok)

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

  1003. 

  1004.             if (error & VP_START)

  1005.                 end_ok = 0;

  1006.         }

  1007.     }

  1008. #endif

  1009. #if 1

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

  1011.     if (s->partitioned_frame) {

  1012.         int end_ok = 0;

  1013. 

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

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

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

  1017. 

  1018.             if (error & ER_AC_END)

  1019.                 end_ok = 0;

  1020.             if ((error & ER_MV_END) ||

  1021.                 (error & ER_DC_END) ||

  1022.                 (error & ER_AC_ERROR))

  1023.                 end_ok = 1;

  1024. 

  1025.             if (!end_ok)

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

  1027. 

  1028.             if (error & VP_START)

  1029.                 end_ok = 0;

  1030.         }

  1031.     }

  1032. #endif

  1033.     /* handle missing slices */

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

  1035.         int end_ok = 1;

  1036. 

  1037.         // FIXME + 100 hack

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

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

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

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

  1042. 

  1043.             if (error1 & VP_START)

  1044.                 end_ok = 1;

  1045. 

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

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

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

  1049.                 (error1 & ER_MV_END))) {

  1050.                 // end & uninit

  1051.                 end_ok = 0;

  1052.             }

  1053. 

  1054.             if (!end_ok)

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

  1056.         }

  1057.     }

  1058. 

  1059. #if 1

  1060.     /* backward mark errors */

  1061.     distance = 9999999;

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

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

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

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

  1066. 

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

  1068.                 distance++;

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

  1070.                 distance = 0;

  1071. 

  1072.             if (s->partitioned_frame) {

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

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

  1075.             } else {

  1076.                 if (distance < threshold)

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

  1078.             }

  1079. 

  1080.             if (error & VP_START)

  1081.                 distance = 9999999;

  1082.         }

  1083.     }

  1084. #endif

  1085. 

  1086.     /* forward mark errors */

  1087.     error = 0;

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

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

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

  1091. 

  1092.         if (old_error & VP_START) {

  1093.             error = old_error & ER_MB_ERROR;

  1094.         } else {

  1095.             error |= old_error & ER_MB_ERROR;

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

  1097.         }

  1098.     }

  1099. #if 1

  1100.     /* handle not partitioned case */

  1101.     if (!s->partitioned_frame) {

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

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

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

  1105.             if (error & ER_MB_ERROR)

  1106.                 error |= ER_MB_ERROR;

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

  1108.         }

  1109.     }

  1110. #endif

  1111. 

  1112.     dc_error = ac_error = mv_error = 0;

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

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

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

  1116.         if (error & ER_DC_ERROR)

  1117.             dc_error++;

  1118.         if (error & ER_AC_ERROR)

  1119.             ac_error++;

  1120.         if (error & ER_MV_ERROR)

  1121.             mv_error++;

  1122.     }

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

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

  1125. 

  1126.     is_intra_likely = is_intra_more_likely(s);

  1127. 

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

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

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

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

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

  1133.             continue;

  1134. 

  1135.         if (is_intra_likely)

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

  1137.         else

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

  1139.     }

  1140. 

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

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

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

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

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

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

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

  1148.         }

  1149. 

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

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

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

  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.             const int dir     = !(s->last_pic.f && s->last_pic.f->data[0]);

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

  1157.             int mv_type;

  1158. 

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

  1160. 

  1161.             if (IS_INTRA(mb_type))

  1162.                 continue; // intra

  1163.             if (error & ER_MV_ERROR)

  1164.                 continue; // inter with damaged MV

  1165.             if (!(error & ER_AC_ERROR))

  1166.                 continue; // undamaged inter

  1167. 

  1168.             if (IS_8X8(mb_type)) {

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

  1170.                 int j;

  1171.                 mv_type = MV_TYPE_8X8;

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

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

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

  1175.                 }

  1176.             } else {

  1177.                 mv_type     = MV_TYPE_16X16;

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

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

  1180.             }

  1181. 

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

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

  1184.         }

  1185.     }

  1186. 

  1187.     /* guess MVs */

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

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

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

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

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

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

  1194.                 int mv_dir = MV_DIR_FORWARD | MV_DIR_BACKWARD;

  1195. 

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

  1197. 

  1198.                 if (IS_INTRA(mb_type))

  1199.                     continue;

  1200.                 if (!(error & ER_MV_ERROR))

  1201.                     continue; // inter with undamaged MV

  1202.                 if (!(error & ER_AC_ERROR))

  1203.                     continue; // undamaged inter

  1204. 

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

  1206.                     mv_dir &= ~MV_DIR_FORWARD;

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

  1208.                     mv_dir &= ~MV_DIR_BACKWARD;

  1209. 

  1210.                 if (s->pp_time) {

  1211.                     int time_pp = s->pp_time;

  1212.                     int time_pb = s->pb_time;

  1213. 

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

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

  1216. 

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

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

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

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

  1221.                 } else {

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

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

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

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

  1226.                 }

  1227. 

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

  1229.                              mb_x, mb_y, 0, 0);

  1230.             }

  1231.         }

  1232.     } else

  1233.         guess_mv(s);

  1234. 

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

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

  1237.         goto ec_clean;

  1238.     /* fill DC for inter blocks */

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

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

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

  1242.             int16_t *dc_ptr;

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

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

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

  1246. 

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

  1248. 

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

  1250.                 continue;

  1251.             // if (error & ER_MV_ERROR)

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

  1253. 

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

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

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

  1257. 

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

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

  1260.                 dc = 0;

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

  1262.                     int x;

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

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

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

  1266.                 }

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

  1268.             }

  1269. 

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

  1271.                 continue;

  1272. 

  1273.             dcu = dcv = 0;

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

  1275.                 int x;

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

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

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

  1279.                 }

  1280.             }

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

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

  1283.         }

  1284.     }

  1285. #if 1

  1286.     /* guess DC for damaged blocks */

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

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

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

  1290. #endif

  1291. 

  1292.     /* filter luma DC */

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

  1294. 

  1295. #if 1

  1296.     /* render DC only intra */

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

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

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

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

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

  1302. 

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

  1304. 

  1305.             if (IS_INTER(mb_type))

  1306.                 continue;

  1307.             if (!(error & ER_AC_ERROR))

  1308.                 continue; // undamaged

  1309. 

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

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

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

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

  1314.                 dest_cb = dest_cr = NULL;

  1315. 

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

  1317.         }

  1318.     }

  1319. #endif

  1320. 

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

  1322.         /* filter horizontal block boundaries */

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

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

  1325. 

  1326.         /* filter vertical block boundaries */

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

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

  1329. 

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

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

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

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

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

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

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

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

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

  1339.         }

  1340.     }

  1341. 

  1342. ec_clean:

  1343.     /* clean a few tables */

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

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

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

  1347. 

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

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

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

  1351.         }

  1352.         if (s->mbintra_table)

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

  1354.     }

  1355. 

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

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

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

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

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

  1361.     }

  1362. 

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

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

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

  1366. }