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

1077 lines
40KB
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 libavcodec/error_resilience.c

  25.  * Error resilience / concealment.

  26.  */

  27. 

  28. #include <limits.h>

  29. 

  30. #include "avcodec.h"

  31. #include "dsputil.h"

  32. #include "mpegvideo.h"

  33. #include "h264.h"

  34. 

  35. /*

  36.  * H264 redefines mb_intra so it is not mistakely used (its uninitialized in h264)

  37.  * but error concealment must support both h264 and h263 thus we must undo this

  38.  */

  39. #undef mb_intra

  40. 

  41. static void decode_mb(MpegEncContext *s){

  42.     s->dest[0] = s->current_picture.data[0] + (s->mb_y * 16* s->linesize  ) + s->mb_x * 16;

  43.     s->dest[1] = s->current_picture.data[1] + (s->mb_y * (16>>s->chroma_y_shift) * s->uvlinesize) + s->mb_x * (16>>s->chroma_x_shift);

  44.     s->dest[2] = s->current_picture.data[2] + (s->mb_y * (16>>s->chroma_y_shift) * s->uvlinesize) + s->mb_x * (16>>s->chroma_x_shift);

  45. 

  46.     MPV_decode_mb(s, s->block);

  47. }

  48. 

  49. /**

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

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

  52.  */

  53. static void set_mv_strides(MpegEncContext *s, int *mv_step, int *stride){

  54.     if(s->codec_id == CODEC_ID_H264){

  55.         H264Context *h= (void*)s;

  56.         assert(s->quarter_sample);

  57.         *mv_step= 4;

  58.         *stride= h->b_stride;

  59.     }else{

  60.         *mv_step= 2;

  61.         *stride= s->b8_stride;

  62.     }

  63. }

  64. 

  65. /**

  66.  * replaces the current MB with a flat dc only version.

  67.  */

  68. static void put_dc(MpegEncContext *s, uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr, int mb_x, int mb_y)

  69. {

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

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

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

  73.         if(dc<0) dc=0;

  74.         else if(dc>2040) dc=2040;

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

  76.             int x;

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

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

  79.             }

  80.         }

  81.     }

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

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

  84.     if     (dcu<0   ) dcu=0;

  85.     else if(dcu>2040) dcu=2040;

  86.     if     (dcv<0   ) dcv=0;

  87.     else if(dcv>2040) dcv=2040;

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

  89.         int x;

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

  91.             dest_cb[x + y*(s->uvlinesize)]= dcu/8;

  92.             dest_cr[x + y*(s->uvlinesize)]= dcv/8;

  93.         }

  94.     }

  95. }

  96. 

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

  98.     int x,y;

  99. 

  100.     /* horizontal filter */

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

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

  103. 

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

  105.             int dc;

  106. 

  107.             dc= - prev_dc

  108.                 + data[x     + y*stride]*8

  109.                 - data[x + 1 + y*stride];

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

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

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

  113.         }

  114.     }

  115. 

  116.     /* vertical filter */

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

  118.         int prev_dc= data[x];

  119. 

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

  121.             int dc;

  122. 

  123.             dc= - prev_dc

  124.                 + data[x +  y   *stride]*8

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

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

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

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

  129.         }

  130.     }

  131. }

  132. 

  133. /**

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

  135.  * @param w     width in 8 pixel blocks

  136.  * @param h     height in 8 pixel blocks

  137.  */

  138. static void guess_dc(MpegEncContext *s, int16_t *dc, int w, int h, int stride, int is_luma){

  139.     int b_x, b_y;

  140. 

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

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

  143.             int color[4]={1024,1024,1024,1024};

  144.             int distance[4]={9999,9999,9999,9999};

  145.             int mb_index, error, j;

  146.             int64_t guess, weight_sum;

  147. 

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

  149. 

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

  151. 

  152.             if(IS_INTER(s->current_picture.mb_type[mb_index])) continue; //inter

  153.             if(!(error&DC_ERROR)) continue;           //dc-ok

  154. 

  155.             /* right block */

  156.             for(j=b_x+1; j<w; j++){

  157.                 int mb_index_j= (j>>is_luma) + (b_y>>is_luma)*s->mb_stride;

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

  159.                 int intra_j= IS_INTRA(s->current_picture.mb_type[mb_index_j]);

  160.                 if(intra_j==0 || !(error_j&DC_ERROR)){

  161.                     color[0]= dc[j + b_y*stride];

  162.                     distance[0]= j-b_x;

  163.                     break;

  164.                 }

  165.             }

  166. 

  167.             /* left block */

  168.             for(j=b_x-1; j>=0; j--){

  169.                 int mb_index_j= (j>>is_luma) + (b_y>>is_luma)*s->mb_stride;

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

  171.                 int intra_j= IS_INTRA(s->current_picture.mb_type[mb_index_j]);

  172.                 if(intra_j==0 || !(error_j&DC_ERROR)){

  173.                     color[1]= dc[j + b_y*stride];

  174.                     distance[1]= b_x-j;

  175.                     break;

  176.                 }

  177.             }

  178. 

  179.             /* bottom block */

  180.             for(j=b_y+1; j<h; j++){

  181.                 int mb_index_j= (b_x>>is_luma) + (j>>is_luma)*s->mb_stride;

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

  183.                 int intra_j= IS_INTRA(s->current_picture.mb_type[mb_index_j]);

  184.                 if(intra_j==0 || !(error_j&DC_ERROR)){

  185.                     color[2]= dc[b_x + j*stride];

  186.                     distance[2]= j-b_y;

  187.                     break;

  188.                 }

  189.             }

  190. 

  191.             /* top block */

  192.             for(j=b_y-1; j>=0; j--){

  193.                 int mb_index_j= (b_x>>is_luma) + (j>>is_luma)*s->mb_stride;

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

  195.                 int intra_j= IS_INTRA(s->current_picture.mb_type[mb_index_j]);

  196.                 if(intra_j==0 || !(error_j&DC_ERROR)){

  197.                     color[3]= dc[b_x + j*stride];

  198.                     distance[3]= b_y-j;

  199.                     break;

  200.                 }

  201.             }

  202. 

  203.             weight_sum=0;

  204.             guess=0;

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

  206.                 int64_t weight= 256*256*256*16/distance[j];

  207.                 guess+= weight*(int64_t)color[j];

  208.                 weight_sum+= weight;

  209.             }

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

  211. 

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

  213.         }

  214.     }

  215. }

  216. 

  217. /**

  218.  * simple horizontal deblocking filter used for error resilience

  219.  * @param w     width in 8 pixel blocks

  220.  * @param h     height in 8 pixel blocks

  221.  */

  222. static void h_block_filter(MpegEncContext *s, uint8_t *dst, int w, int h, int stride, int is_luma){

  223.     int b_x, b_y;

  224.     uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;

  225. 

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

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

  228.             int y;

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

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

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

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

  233.             int left_damage =  left_status&(DC_ERROR|AC_ERROR|MV_ERROR);

  234.             int right_damage= right_status&(DC_ERROR|AC_ERROR|MV_ERROR);

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

  236.             int16_t *left_mv=  s->current_picture.motion_val[0][s->b8_stride*(b_y<<(1-is_luma)) + ( b_x   <<(1-is_luma))];

  237.             int16_t *right_mv= s->current_picture.motion_val[0][s->b8_stride*(b_y<<(1-is_luma)) + ((b_x+1)<<(1-is_luma))];

  238. 

  239.             if(!(left_damage||right_damage)) continue; // both undamaged

  240. 

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

  242.                && FFABS(left_mv[0]-right_mv[0]) + FFABS(left_mv[1]+right_mv[1]) < 2) continue;

  243. 

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

  245.                 int a,b,c,d;

  246. 

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

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

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

  250. 

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

  252.                 d= FFMAX(d, 0);

  253.                 if(b<0) d= -d;

  254. 

  255.                 if(d==0) continue;

  256. 

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

  258.                     d= d*16/9;

  259. 

  260.                 if(left_damage){

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

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

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

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

  265.                 }

  266.                 if(right_damage){

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

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

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

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

  271.                 }

  272.             }

  273.         }

  274.     }

  275. }

  276. 

  277. /**

  278.  * simple vertical deblocking filter used for error resilience

  279.  * @param w     width in 8 pixel blocks

  280.  * @param h     height in 8 pixel blocks

  281.  */

  282. static void v_block_filter(MpegEncContext *s, uint8_t *dst, int w, int h, int stride, int is_luma){

  283.     int b_x, b_y;

  284.     uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;

  285. 

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

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

  288.             int x;

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

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

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

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

  293.             int top_damage =      top_status&(DC_ERROR|AC_ERROR|MV_ERROR);

  294.             int bottom_damage= bottom_status&(DC_ERROR|AC_ERROR|MV_ERROR);

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

  296.             int16_t *top_mv=    s->current_picture.motion_val[0][s->b8_stride*( b_y   <<(1-is_luma)) + (b_x<<(1-is_luma))];

  297.             int16_t *bottom_mv= s->current_picture.motion_val[0][s->b8_stride*((b_y+1)<<(1-is_luma)) + (b_x<<(1-is_luma))];

  298. 

  299.             if(!(top_damage||bottom_damage)) continue; // both undamaged

  300. 

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

  302.                && FFABS(top_mv[0]-bottom_mv[0]) + FFABS(top_mv[1]+bottom_mv[1]) < 2) continue;

  303. 

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

  305.                 int a,b,c,d;

  306. 

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

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

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

  310. 

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

  312.                 d= FFMAX(d, 0);

  313.                 if(b<0) d= -d;

  314. 

  315.                 if(d==0) continue;

  316. 

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

  318.                     d= d*16/9;

  319. 

  320.                 if(top_damage){

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

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

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

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

  325.                 }

  326.                 if(bottom_damage){

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

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

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

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

  331.                 }

  332.             }

  333.         }

  334.     }

  335. }

  336. 

  337. static void guess_mv(MpegEncContext *s){

  338.     uint8_t fixed[s->mb_stride * s->mb_height];

  339. #define MV_FROZEN    3

  340. #define MV_CHANGED   2

  341. #define MV_UNCHANGED 1

  342.     const int mb_stride = s->mb_stride;

  343.     const int mb_width = s->mb_width;

  344.     const int mb_height= s->mb_height;

  345.     int i, depth, num_avail;

  346.     int mb_x, mb_y, mot_step, mot_stride;

  347. 

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

  349. 

  350.     num_avail=0;

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

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

  353.         int f=0;

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

  355. 

  356.         if(IS_INTRA(s->current_picture.mb_type[mb_xy])) f=MV_FROZEN; //intra //FIXME check

  357.         if(!(error&MV_ERROR)) f=MV_FROZEN;           //inter with undamaged MV

  358. 

  359.         fixed[mb_xy]= f;

  360.         if(f==MV_FROZEN)

  361.             num_avail++;

  362.     }

  363. 

  364.     if((!(s->avctx->error_concealment&FF_EC_GUESS_MVS)) || num_avail <= mb_width/2){

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

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

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

  368. 

  369.                 if(IS_INTRA(s->current_picture.mb_type[mb_xy]))  continue;

  370.                 if(!(s->error_status_table[mb_xy]&MV_ERROR)) continue;

  371. 

  372.                 s->mv_dir = s->last_picture.data[0] ? MV_DIR_FORWARD : MV_DIR_BACKWARD;

  373.                 s->mb_intra=0;

  374.                 s->mv_type = MV_TYPE_16X16;

  375.                 s->mb_skipped=0;

  376. 

  377.                 s->dsp.clear_blocks(s->block[0]);

  378. 

  379.                 s->mb_x= mb_x;

  380.                 s->mb_y= mb_y;

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

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

  383.                 decode_mb(s);

  384.             }

  385.         }

  386.         return;

  387.     }

  388. 

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

  390.         int changed, pass, none_left;

  391. 

  392.         none_left=1;

  393.         changed=1;

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

  395.             int mb_x, mb_y;

  396. int score_sum=0;

  397. 

  398.             changed=0;

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

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

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

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

  403.                     int pred_count=0;

  404.                     int j;

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

  406.                     int best_pred=0;

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

  408.                     int prev_x= s->current_picture.motion_val[0][mot_index][0];

  409.                     int prev_y= s->current_picture.motion_val[0][mot_index][1];

  410. 

  411.                     if((mb_x^mb_y^pass)&1) continue;

  412. 

  413.                     if(fixed[mb_xy]==MV_FROZEN) continue;

  414.                     assert(!IS_INTRA(s->current_picture.mb_type[mb_xy]));

  415.                     assert(s->last_picture_ptr && s->last_picture_ptr->data[0]);

  416. 

  417.                     j=0;

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

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

  420.                     if(mb_y>0           && fixed[mb_xy-mb_stride]==MV_FROZEN) j=1;

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

  422.                     if(j==0) continue;

  423. 

  424.                     j=0;

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

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

  427.                     if(mb_y>0           && fixed[mb_xy-mb_stride]==MV_CHANGED) j=1;

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

  429.                     if(j==0 && pass>1) continue;

  430. 

  431.                     none_left=0;

  432. 

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

  434.                         mv_predictor[pred_count][0]= s->current_picture.motion_val[0][mot_index - mot_step][0];

  435.                         mv_predictor[pred_count][1]= s->current_picture.motion_val[0][mot_index - mot_step][1];

  436.                         pred_count++;

  437.                     }

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

  439.                         mv_predictor[pred_count][0]= s->current_picture.motion_val[0][mot_index + mot_step][0];

  440.                         mv_predictor[pred_count][1]= s->current_picture.motion_val[0][mot_index + mot_step][1];

  441.                         pred_count++;

  442.                     }

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

  444.                         mv_predictor[pred_count][0]= s->current_picture.motion_val[0][mot_index - mot_stride*mot_step][0];

  445.                         mv_predictor[pred_count][1]= s->current_picture.motion_val[0][mot_index - mot_stride*mot_step][1];

  446.                         pred_count++;

  447.                     }

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

  449.                         mv_predictor[pred_count][0]= s->current_picture.motion_val[0][mot_index + mot_stride*mot_step][0];

  450.                         mv_predictor[pred_count][1]= s->current_picture.motion_val[0][mot_index + mot_stride*mot_step][1];

  451.                         pred_count++;

  452.                     }

  453.                     if(pred_count==0) continue;

  454. 

  455.                     if(pred_count>1){

  456.                         int sum_x=0, sum_y=0;

  457.                         int max_x, max_y, min_x, min_y;

  458. 

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

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

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

  462.                         }

  463. 

  464.                         /* mean */

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

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

  467. 

  468.                         /* median */

  469.                         if(pred_count>=3){

  470.                             min_y= min_x= 99999;

  471.                             max_y= max_x=-99999;

  472.                         }else{

  473.                             min_x=min_y=max_x=max_y=0;

  474.                         }

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

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

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

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

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

  480.                         }

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

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

  483. 

  484.                         if(pred_count==4){

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

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

  487.                         }

  488.                         pred_count+=2;

  489.                     }

  490. 

  491.                     /* zero MV */

  492.                     pred_count++;

  493. 

  494.                     /* last MV */

  495.                     mv_predictor[pred_count][0]= s->current_picture.motion_val[0][mot_index][0];

  496.                     mv_predictor[pred_count][1]= s->current_picture.motion_val[0][mot_index][1];

  497.                     pred_count++;

  498. 

  499.                     s->mv_dir = MV_DIR_FORWARD;

  500.                     s->mb_intra=0;

  501.                     s->mv_type = MV_TYPE_16X16;

  502.                     s->mb_skipped=0;

  503. 

  504.                     s->dsp.clear_blocks(s->block[0]);

  505. 

  506.                     s->mb_x= mb_x;

  507.                     s->mb_y= mb_y;

  508. 

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

  510.                         int score=0;

  511.                         uint8_t *src= s->current_picture.data[0] + mb_x*16 + mb_y*16*s->linesize;

  512. 

  513.                         s->current_picture.motion_val[0][mot_index][0]= s->mv[0][0][0]= mv_predictor[j][0];

  514.                         s->current_picture.motion_val[0][mot_index][1]= s->mv[0][0][1]= mv_predictor[j][1];

  515. 

  516.                         decode_mb(s);

  517. 

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

  519.                             int k;

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

  521.                                 score += FFABS(src[k*s->linesize-1 ]-src[k*s->linesize   ]);

  522.                         }

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

  524.                             int k;

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

  526.                                 score += FFABS(src[k*s->linesize+15]-src[k*s->linesize+16]);

  527.                         }

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

  529.                             int k;

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

  531.                                 score += FFABS(src[k-s->linesize   ]-src[k               ]);

  532.                         }

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

  534.                             int k;

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

  536.                                 score += FFABS(src[k+s->linesize*15]-src[k+s->linesize*16]);

  537.                         }

  538. 

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

  540.                             best_score= score;

  541.                             best_pred= j;

  542.                         }

  543.                     }

  544. score_sum+= best_score;

  545. //FIXME no need to set s->current_picture.motion_val[0][mot_index][0] explicit

  546.                     s->current_picture.motion_val[0][mot_index][0]= s->mv[0][0][0]= mv_predictor[best_pred][0];

  547.                     s->current_picture.motion_val[0][mot_index][1]= s->mv[0][0][1]= mv_predictor[best_pred][1];

  548. 

  549.                     decode_mb(s);

  550. 

  551. 

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

  553.                         fixed[mb_xy]=MV_CHANGED;

  554.                         changed++;

  555.                     }else

  556.                         fixed[mb_xy]=MV_UNCHANGED;

  557.                 }

  558.             }

  559. 

  560. //            printf(".%d/%d", changed, score_sum); fflush(stdout);

  561.         }

  562. 

  563.         if(none_left)

  564.             return;

  565. 

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

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

  568.             if(fixed[mb_xy])

  569.                 fixed[mb_xy]=MV_FROZEN;

  570.         }

  571. //        printf(":"); fflush(stdout);

  572.     }

  573. }

  574. 

  575. static int is_intra_more_likely(MpegEncContext *s){

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

  577. 

  578.     if(!s->last_picture_ptr || !s->last_picture_ptr->data[0]) return 1; //no previous frame available -> use spatial prediction

  579. 

  580.     undamaged_count=0;

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

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

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

  584.         if(!((error&DC_ERROR) && (error&MV_ERROR)))

  585.             undamaged_count++;

  586.     }

  587. 

  588.     if(undamaged_count < 5) return 0; //almost all MBs damaged -> use temporal prediction

  589. 

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

  591.     if(CONFIG_MPEG_XVMC_DECODER && s->avctx->xvmc_acceleration && s->pict_type == FF_I_TYPE)

  592.         return 1;

  593. 

  594.     skip_amount= FFMAX(undamaged_count/50, 1); //check only upto 50 MBs

  595.     is_intra_likely=0;

  596. 

  597.     j=0;

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

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

  600.             int error;

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

  602. 

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

  604.             if((error&DC_ERROR) && (error&MV_ERROR))

  605.                 continue; //skip damaged

  606. 

  607.             j++;

  608.             if((j%skip_amount) != 0) continue; //skip a few to speed things up

  609. 

  610.             if(s->pict_type==FF_I_TYPE){

  611.                 uint8_t *mb_ptr     = s->current_picture.data[0] + mb_x*16 + mb_y*16*s->linesize;

  612.                 uint8_t *last_mb_ptr= s->last_picture.data   [0] + mb_x*16 + mb_y*16*s->linesize;

  613. 

  614.                 is_intra_likely += s->dsp.sad[0](NULL, last_mb_ptr, mb_ptr                    , s->linesize, 16);

  615.                 is_intra_likely -= s->dsp.sad[0](NULL, last_mb_ptr, last_mb_ptr+s->linesize*16, s->linesize, 16);

  616.             }else{

  617.                 if(IS_INTRA(s->current_picture.mb_type[mb_xy]))

  618.                    is_intra_likely++;

  619.                 else

  620.                    is_intra_likely--;

  621.             }

  622.         }

  623.     }

  624. //printf("is_intra_likely: %d type:%d\n", is_intra_likely, s->pict_type);

  625.     return is_intra_likely > 0;

  626. }

  627. 

  628. void ff_er_frame_start(MpegEncContext *s){

  629.     if(!s->error_recognition) return;

  630. 

  631.     memset(s->error_status_table, MV_ERROR|AC_ERROR|DC_ERROR|VP_START|AC_END|DC_END|MV_END, s->mb_stride*s->mb_height*sizeof(uint8_t));

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

  633. }

  634. 

  635. /**

  636.  * adds a slice.

  637.  * @param endx x component of the last macroblock, can be -1 for the last of the previous line

  638.  * @param status the status at the end (MV_END, AC_ERROR, ...), it is assumed that no earlier end or

  639.  *               error of the same type occurred

  640.  */

  641. void ff_er_add_slice(MpegEncContext *s, int startx, int starty, int endx, int endy, int status){

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

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

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

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

  646.     int mask= -1;

  647. 

  648.     if(s->avctx->hwaccel)

  649.         return;

  650. 

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

  652.         av_log(s->avctx, AV_LOG_ERROR, "internal error, slice end before start\n");

  653.         return;

  654.     }

  655. 

  656.     if(!s->error_recognition) return;

  657. 

  658.     mask &= ~VP_START;

  659.     if(status & (AC_ERROR|AC_END)){

  660.         mask &= ~(AC_ERROR|AC_END);

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

  662.     }

  663.     if(status & (DC_ERROR|DC_END)){

  664.         mask &= ~(DC_ERROR|DC_END);

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

  666.     }

  667.     if(status & (MV_ERROR|MV_END)){

  668.         mask &= ~(MV_ERROR|MV_END);

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

  670.     }

  671. 

  672.     if(status & (AC_ERROR|DC_ERROR|MV_ERROR)) s->error_count= INT_MAX;

  673. 

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

  675.         memset(&s->error_status_table[start_xy], 0, (end_xy - start_xy) * sizeof(uint8_t));

  676.     }else{

  677.         int i;

  678.         for(i=start_xy; i<end_xy; i++){

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

  680.         }

  681.     }

  682. 

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

  684.         s->error_count= INT_MAX;

  685.     else{

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

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

  688.     }

  689. 

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

  691. 

  692.     if(start_xy > 0 && s->avctx->thread_count <= 1 && s->avctx->skip_top*s->mb_width < start_i){

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

  694. 

  695.         prev_status &= ~ VP_START;

  696.         if(prev_status != (MV_END|DC_END|AC_END)) s->error_count= INT_MAX;

  697.     }

  698. }

  699. 

  700. void ff_er_frame_end(MpegEncContext *s){

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

  702.     int distance;

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

  704.     int threshold= 50;

  705.     int is_intra_likely;

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

  707.     Picture *pic= s->current_picture_ptr;

  708. 

  709.     if(!s->error_recognition || s->error_count==0 || s->avctx->lowres ||

  710.        s->avctx->hwaccel ||

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

  712.        s->picture_structure != PICT_FRAME || // we dont support ER of field pictures yet, though it should not crash if enabled

  713.        s->error_count==3*s->mb_width*(s->avctx->skip_top + s->avctx->skip_bottom)) return;

  714. 

  715.     if(s->current_picture.motion_val[0] == NULL){

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

  717. 

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

  719.             pic->ref_index[i]= av_mallocz(s->mb_stride * s->mb_height * 4 * sizeof(uint8_t));

  720.             pic->motion_val_base[i]= av_mallocz((size+4) * 2 * sizeof(uint16_t));

  721.             pic->motion_val[i]= pic->motion_val_base[i]+4;

  722.         }

  723.         pic->motion_subsample_log2= 3;

  724.         s->current_picture= *s->current_picture_ptr;

  725.     }

  726. 

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

  728.         if(pic->ref_index[i])

  729.             memset(pic->ref_index[i], 0, size * sizeof(uint8_t));

  730.     }

  731. 

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

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

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

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

  736. 

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

  738.             }

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

  740.         }

  741.     }

  742. 

  743. #if 1

  744.     /* handle overlapping slices */

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

  746.         int end_ok=0;

  747. 

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

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

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

  751. 

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

  753.                 end_ok=1;

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

  755.                 end_ok=1;

  756. 

  757.             if(!end_ok)

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

  759. 

  760.             if(error&VP_START)

  761.                 end_ok=0;

  762.         }

  763.     }

  764. #endif

  765. #if 1

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

  767.     if(s->partitioned_frame){

  768.         int end_ok=0;

  769. 

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

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

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

  773. 

  774.             if(error&AC_END)

  775.                 end_ok=0;

  776.             if((error&MV_END) || (error&DC_END) || (error&AC_ERROR))

  777.                 end_ok=1;

  778. 

  779.             if(!end_ok)

  780.                 s->error_status_table[mb_xy]|= AC_ERROR;

  781. 

  782.             if(error&VP_START)

  783.                 end_ok=0;

  784.         }

  785.     }

  786. #endif

  787.     /* handle missing slices */

  788.     if(s->error_recognition>=4){

  789.         int end_ok=1;

  790. 

  791.         for(i=s->mb_num-2; i>=s->mb_width+100; i--){ //FIXME +100 hack

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

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

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

  795. 

  796.             if(error1&VP_START)

  797.                 end_ok=1;

  798. 

  799.             if(   error2==(VP_START|DC_ERROR|AC_ERROR|MV_ERROR|AC_END|DC_END|MV_END)

  800.                && error1!=(VP_START|DC_ERROR|AC_ERROR|MV_ERROR|AC_END|DC_END|MV_END)

  801.                && ((error1&AC_END) || (error1&DC_END) || (error1&MV_END))){ //end & uninit

  802.                 end_ok=0;

  803.             }

  804. 

  805.             if(!end_ok)

  806.                 s->error_status_table[mb_xy]|= DC_ERROR|AC_ERROR|MV_ERROR;

  807.         }

  808.     }

  809. 

  810. #if 1

  811.     /* backward mark errors */

  812.     distance=9999999;

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

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

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

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

  817. 

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

  819.                 distance++;

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

  821.                 distance= 0;

  822. 

  823.             if(s->partitioned_frame){

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

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

  826.             }else{

  827.                 if(distance < threshold)

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

  829.             }

  830. 

  831.             if(error&VP_START)

  832.                 distance= 9999999;

  833.         }

  834.     }

  835. #endif

  836. 

  837.     /* forward mark errors */

  838.     error=0;

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

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

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

  842. 

  843.         if(old_error&VP_START)

  844.             error= old_error& (DC_ERROR|AC_ERROR|MV_ERROR);

  845.         else{

  846.             error|= old_error& (DC_ERROR|AC_ERROR|MV_ERROR);

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

  848.         }

  849.     }

  850. #if 1

  851.     /* handle not partitioned case */

  852.     if(!s->partitioned_frame){

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

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

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

  856.             if(error&(AC_ERROR|DC_ERROR|MV_ERROR))

  857.                 error|= AC_ERROR|DC_ERROR|MV_ERROR;

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

  859.         }

  860.     }

  861. #endif

  862. 

  863.     dc_error= ac_error= mv_error=0;

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

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

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

  867.         if(error&DC_ERROR) dc_error ++;

  868.         if(error&AC_ERROR) ac_error ++;

  869.         if(error&MV_ERROR) mv_error ++;

  870.     }

  871.     av_log(s->avctx, AV_LOG_INFO, "concealing %d DC, %d AC, %d MV errors\n", dc_error, ac_error, mv_error);

  872. 

  873.     is_intra_likely= is_intra_more_likely(s);

  874. 

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

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

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

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

  879.         if(!((error&DC_ERROR) && (error&MV_ERROR)))

  880.             continue;

  881. 

  882.         if(is_intra_likely)

  883.             s->current_picture.mb_type[mb_xy]= MB_TYPE_INTRA4x4;

  884.         else

  885.             s->current_picture.mb_type[mb_xy]= MB_TYPE_16x16 | MB_TYPE_L0;

  886.     }

  887. 

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

  889.     if (!s->last_picture.data[0] && !s->next_picture.data[0])

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

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

  892.             if(!IS_INTRA(s->current_picture.mb_type[mb_xy]))

  893.                 s->current_picture.mb_type[mb_xy]= MB_TYPE_INTRA4x4;

  894.         }

  895. 

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

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

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

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

  900.             const int mb_type= s->current_picture.mb_type[mb_xy];

  901.             int dir = !s->last_picture.data[0];

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

  903. 

  904.             if(IS_INTRA(mb_type)) continue; //intra

  905.             if(error&MV_ERROR) continue;              //inter with damaged MV

  906.             if(!(error&AC_ERROR)) continue;           //undamaged inter

  907. 

  908.             s->mv_dir = dir ? MV_DIR_BACKWARD : MV_DIR_FORWARD;

  909.             s->mb_intra=0;

  910.             s->mb_skipped=0;

  911.             if(IS_8X8(mb_type)){

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

  913.                 int j;

  914.                 s->mv_type = MV_TYPE_8X8;

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

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

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

  918.                 }

  919.             }else{

  920.                 s->mv_type = MV_TYPE_16X16;

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

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

  923.             }

  924. 

  925.             s->dsp.clear_blocks(s->block[0]);

  926. 

  927.             s->mb_x= mb_x;

  928.             s->mb_y= mb_y;

  929.             decode_mb(s);

  930.         }

  931.     }

  932. 

  933.     /* guess MVs */

  934.     if(s->pict_type==FF_B_TYPE){

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

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

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

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

  939.                 const int mb_type= s->current_picture.mb_type[mb_xy];

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

  941. 

  942.                 if(IS_INTRA(mb_type)) continue;

  943.                 if(!(error&MV_ERROR)) continue;           //inter with undamaged MV

  944.                 if(!(error&AC_ERROR)) continue;           //undamaged inter

  945. 

  946.                 s->mv_dir = MV_DIR_FORWARD|MV_DIR_BACKWARD;

  947.                 if(!s->last_picture.data[0]) s->mv_dir &= ~MV_DIR_FORWARD;

  948.                 if(!s->next_picture.data[0]) s->mv_dir &= ~MV_DIR_BACKWARD;

  949.                 s->mb_intra=0;

  950.                 s->mv_type = MV_TYPE_16X16;

  951.                 s->mb_skipped=0;

  952. 

  953.                 if(s->pp_time){

  954.                     int time_pp= s->pp_time;

  955.                     int time_pb= s->pb_time;

  956. 

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

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

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

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

  961.                 }else{

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

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

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

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

  966.                 }

  967. 

  968.                 s->dsp.clear_blocks(s->block[0]);

  969.                 s->mb_x= mb_x;

  970.                 s->mb_y= mb_y;

  971.                 decode_mb(s);

  972.             }

  973.         }

  974.     }else

  975.         guess_mv(s);

  976. 

  977.     /* the filters below are not XvMC compatible, skip them */

  978.     if(CONFIG_MPEG_XVMC_DECODER && s->avctx->xvmc_acceleration)

  979.         goto ec_clean;

  980.     /* fill DC for inter blocks */

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

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

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

  984.             int16_t *dc_ptr;

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

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

  987.             const int mb_type= s->current_picture.mb_type[mb_xy];

  988. 

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

  990. 

  991.             if(IS_INTRA(mb_type) && s->partitioned_frame) continue;

  992. //            if(error&MV_ERROR) continue; //inter data damaged FIXME is this good?

  993. 

  994.             dest_y = s->current_picture.data[0] + mb_x*16 + mb_y*16*s->linesize;

  995.             dest_cb= s->current_picture.data[1] + mb_x*8  + mb_y*8 *s->uvlinesize;

  996.             dest_cr= s->current_picture.data[2] + mb_x*8  + mb_y*8 *s->uvlinesize;

  997. 

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

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

  1000.                 dc=0;

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

  1002.                     int x;

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

  1004.                        dc+= dest_y[x + (n&1)*8 + (y + (n>>1)*8)*s->linesize];

  1005.                     }

  1006.                 }

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

  1008.             }

  1009. 

  1010.             dcu=dcv=0;

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

  1012.                 int x;

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

  1014.                     dcu+=dest_cb[x + y*(s->uvlinesize)];

  1015.                     dcv+=dest_cr[x + y*(s->uvlinesize)];

  1016.                 }

  1017.             }

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

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

  1020.         }

  1021.     }

  1022. #if 1

  1023.     /* guess DC for damaged blocks */

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

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

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

  1027. #endif

  1028.     /* filter luma DC */

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

  1030. 

  1031. #if 1

  1032.     /* render DC only intra */

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

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

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

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

  1037.             const int mb_type= s->current_picture.mb_type[mb_xy];

  1038. 

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

  1040. 

  1041.             if(IS_INTER(mb_type)) continue;

  1042.             if(!(error&AC_ERROR)) continue;              //undamaged

  1043. 

  1044.             dest_y = s->current_picture.data[0] + mb_x*16 + mb_y*16*s->linesize;

  1045.             dest_cb= s->current_picture.data[1] + mb_x*8  + mb_y*8 *s->uvlinesize;

  1046.             dest_cr= s->current_picture.data[2] + mb_x*8  + mb_y*8 *s->uvlinesize;

  1047. 

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

  1049.         }

  1050.     }

  1051. #endif

  1052. 

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

  1054.         /* filter horizontal block boundaries */

  1055.         h_block_filter(s, s->current_picture.data[0], s->mb_width*2, s->mb_height*2, s->linesize  , 1);

  1056.         h_block_filter(s, s->current_picture.data[1], s->mb_width  , s->mb_height  , s->uvlinesize, 0);

  1057.         h_block_filter(s, s->current_picture.data[2], s->mb_width  , s->mb_height  , s->uvlinesize, 0);

  1058. 

  1059.         /* filter vertical block boundaries */

  1060.         v_block_filter(s, s->current_picture.data[0], s->mb_width*2, s->mb_height*2, s->linesize  , 1);

  1061.         v_block_filter(s, s->current_picture.data[1], s->mb_width  , s->mb_height  , s->uvlinesize, 0);

  1062.         v_block_filter(s, s->current_picture.data[2], s->mb_width  , s->mb_height  , s->uvlinesize, 0);

  1063.     }

  1064. 

  1065. ec_clean:

  1066.     /* clean a few tables */

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

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

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

  1070. 

  1071.         if(s->pict_type!=FF_B_TYPE && (error&(DC_ERROR|MV_ERROR|AC_ERROR))){

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

  1073.         }

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

  1075.     }

  1076. }