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

1041 lines
39KB
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 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. 

  34. static void decode_mb(MpegEncContext *s){

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

  36.     s->dest[1] = s->current_picture.data[1] + (s->mb_y * 8 * s->uvlinesize) + s->mb_x * 8;

  37.     s->dest[2] = s->current_picture.data[2] + (s->mb_y * 8 * s->uvlinesize) + s->mb_x * 8;

  38. 

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

  40. }

  41. 

  42. /**

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

  44.  */

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

  46. {

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

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

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

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

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

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

  53.             int x;

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

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

  56.             }

  57.         }

  58.     }

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

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

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

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

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

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

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

  66.         int x;

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

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

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

  70.         }

  71.     }

  72. }

  73. 

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

  75.     int x,y;

  76. 

  77.     /* horizontal filter */

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

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

  80. 

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

  82.             int dc;

  83. 

  84.             dc= - prev_dc

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

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

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

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

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

  90.         }

  91.     }

  92. 

  93.     /* vertical filter */

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

  95.         int prev_dc= data[x];

  96. 

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

  98.             int dc;

  99. 

  100.             dc= - prev_dc

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

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

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

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

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

  106.         }

  107.     }

  108. }

  109. 

  110. /**

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

  112.  * @param w     width in 8 pixel blocks

  113.  * @param h     height in 8 pixel blocks

  114.  */

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

  116.     int b_x, b_y;

  117. 

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

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

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

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

  122.             int mb_index, error, j;

  123.             int64_t guess, weight_sum;

  124. 

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

  126. 

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

  128. 

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

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

  131. 

  132.             /* right block */

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

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

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

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

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

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

  139.                     distance[0]= j-b_x;

  140.                     break;

  141.                 }

  142.             }

  143. 

  144.             /* left block */

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

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

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

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

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

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

  151.                     distance[1]= b_x-j;

  152.                     break;

  153.                 }

  154.             }

  155. 

  156.             /* bottom block */

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

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

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

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

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

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

  163.                     distance[2]= j-b_y;

  164.                     break;

  165.                 }

  166.             }

  167. 

  168.             /* top block */

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

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

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

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

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

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

  175.                     distance[3]= b_y-j;

  176.                     break;

  177.                 }

  178.             }

  179. 

  180.             weight_sum=0;

  181.             guess=0;

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

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

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

  185.                 weight_sum+= weight;

  186.             }

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

  188. 

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

  190.         }

  191.     }

  192. }

  193. 

  194. /**

  195.  * simple horizontal deblocking filter used for error resilience

  196.  * @param w     width in 8 pixel blocks

  197.  * @param h     height in 8 pixel blocks

  198.  */

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

  200.     int b_x, b_y;

  201.     uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;

  202. 

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

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

  205.             int y;

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

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

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

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

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

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

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

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

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

  215. 

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

  217. 

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

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

  220. 

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

  222.                 int a,b,c,d;

  223. 

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

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

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

  227. 

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

  229.                 d= FFMAX(d, 0);

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

  231. 

  232.                 if(d==0) continue;

  233. 

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

  235.                     d= d*16/9;

  236. 

  237.                 if(left_damage){

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

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

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

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

  242.                 }

  243.                 if(right_damage){

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

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

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

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

  248.                 }

  249.             }

  250.         }

  251.     }

  252. }

  253. 

  254. /**

  255.  * simple vertical deblocking filter used for error resilience

  256.  * @param w     width in 8 pixel blocks

  257.  * @param h     height in 8 pixel blocks

  258.  */

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

  260.     int b_x, b_y;

  261.     uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;

  262. 

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

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

  265.             int x;

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

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

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

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

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

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

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

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

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

  275. 

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

  277. 

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

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

  280. 

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

  282.                 int a,b,c,d;

  283. 

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

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

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

  287. 

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

  289.                 d= FFMAX(d, 0);

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

  291. 

  292.                 if(d==0) continue;

  293. 

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

  295.                     d= d*16/9;

  296. 

  297.                 if(top_damage){

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

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

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

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

  302.                 }

  303.                 if(bottom_damage){

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

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

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

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

  308.                 }

  309.             }

  310.         }

  311.     }

  312. }

  313. 

  314. static void guess_mv(MpegEncContext *s){

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

  316. #define MV_FROZEN    3

  317. #define MV_CHANGED   2

  318. #define MV_UNCHANGED 1

  319.     const int mb_stride = s->mb_stride;

  320.     const int mb_width = s->mb_width;

  321.     const int mb_height= s->mb_height;

  322.     int i, depth, num_avail;

  323.     int mb_x, mb_y;

  324. 

  325.     num_avail=0;

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

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

  328.         int f=0;

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

  330. 

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

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

  333. 

  334.         fixed[mb_xy]= f;

  335.         if(f==MV_FROZEN)

  336.             num_avail++;

  337.     }

  338. 

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

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

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

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

  343. 

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

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

  346. 

  347.                 s->mv_dir = MV_DIR_FORWARD;

  348.                 s->mb_intra=0;

  349.                 s->mv_type = MV_TYPE_16X16;

  350.                 s->mb_skipped=0;

  351. 

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

  353. 

  354.                 s->mb_x= mb_x;

  355.                 s->mb_y= mb_y;

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

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

  358.                 decode_mb(s);

  359.             }

  360.         }

  361.         return;

  362.     }

  363. 

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

  365.         int changed, pass, none_left;

  366. 

  367.         none_left=1;

  368.         changed=1;

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

  370.             int mb_x, mb_y;

  371. int score_sum=0;

  372. 

  373.             changed=0;

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

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

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

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

  378.                     int pred_count=0;

  379.                     int j;

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

  381.                     int best_pred=0;

  382.                     const int mot_stride= s->b8_stride;

  383.                     const int mot_index= mb_x*2 + mb_y*2*mot_stride;

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

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

  386. 

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

  388. 

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

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

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

  392. 

  393.                     j=0;

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

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

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

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

  398.                     if(j==0) continue;

  399. 

  400.                     j=0;

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

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

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

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

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

  406. 

  407.                     none_left=0;

  408. 

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

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

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

  412.                         pred_count++;

  413.                     }

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

  415.                         mv_predictor[pred_count][0]= s->current_picture.motion_val[0][mot_index + 2][0];

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

  417.                         pred_count++;

  418.                     }

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

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

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

  422.                         pred_count++;

  423.                     }

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

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

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

  427.                         pred_count++;

  428.                     }

  429.                     if(pred_count==0) continue;

  430. 

  431.                     if(pred_count>1){

  432.                         int sum_x=0, sum_y=0;

  433.                         int max_x, max_y, min_x, min_y;

  434. 

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

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

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

  438.                         }

  439. 

  440.                         /* mean */

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

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

  443. 

  444.                         /* median */

  445.                         if(pred_count>=3){

  446.                             min_y= min_x= 99999;

  447.                             max_y= max_x=-99999;

  448.                         }else{

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

  450.                         }

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

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

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

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

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

  456.                         }

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

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

  459. 

  460.                         if(pred_count==4){

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

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

  463.                         }

  464.                         pred_count+=2;

  465.                     }

  466. 

  467.                     /* zero MV */

  468.                     pred_count++;

  469. 

  470.                     /* last MV */

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

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

  473.                     pred_count++;

  474. 

  475.                     s->mv_dir = MV_DIR_FORWARD;

  476.                     s->mb_intra=0;

  477.                     s->mv_type = MV_TYPE_16X16;

  478.                     s->mb_skipped=0;

  479. 

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

  481. 

  482.                     s->mb_x= mb_x;

  483.                     s->mb_y= mb_y;

  484. 

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

  486.                         int score=0;

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

  488. 

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

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

  491. 

  492.                         decode_mb(s);

  493. 

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

  495.                             int k;

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

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

  498.                         }

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

  500.                             int k;

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

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

  503.                         }

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

  505.                             int k;

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

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

  508.                         }

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

  510.                             int k;

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

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

  513.                         }

  514. 

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

  516.                             best_score= score;

  517.                             best_pred= j;

  518.                         }

  519.                     }

  520. score_sum+= best_score;

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

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

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

  524. 

  525.                     decode_mb(s);

  526. 

  527. 

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

  529.                         fixed[mb_xy]=MV_CHANGED;

  530.                         changed++;

  531.                     }else

  532.                         fixed[mb_xy]=MV_UNCHANGED;

  533.                 }

  534.             }

  535. 

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

  537.         }

  538. 

  539.         if(none_left)

  540.             return;

  541. 

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

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

  544.             if(fixed[mb_xy])

  545.                 fixed[mb_xy]=MV_FROZEN;

  546.         }

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

  548.     }

  549. }

  550. 

  551. static int is_intra_more_likely(MpegEncContext *s){

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

  553. 

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

  555. 

  556.     undamaged_count=0;

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

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

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

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

  561.             undamaged_count++;

  562.     }

  563. 

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

  565. 

  566. #if CONFIG_XVMC

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

  568.     if(s->avctx->xvmc_acceleration && s->pict_type==FF_I_TYPE) return 1;

  569. #endif

  570. 

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

  572.     is_intra_likely=0;

  573. 

  574.     j=0;

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

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

  577.             int error;

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

  579. 

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

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

  582.                 continue; //skip damaged

  583. 

  584.             j++;

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

  586. 

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

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

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

  590. 

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

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

  593.             }else{

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

  595.                    is_intra_likely++;

  596.                 else

  597.                    is_intra_likely--;

  598.             }

  599.         }

  600.     }

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

  602.     return is_intra_likely > 0;

  603. }

  604. 

  605. void ff_er_frame_start(MpegEncContext *s){

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

  607. 

  608.     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));

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

  610. }

  611. 

  612. /**

  613.  * adds a slice.

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

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

  616.  *               error of the same type occurred

  617.  */

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

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

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

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

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

  623.     int mask= -1;

  624. 

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

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

  627.         return;

  628.     }

  629. 

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

  631. 

  632.     mask &= ~VP_START;

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

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

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

  636.     }

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

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

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

  640.     }

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

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

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

  644.     }

  645. 

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

  647. 

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

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

  650.     }else{

  651.         int i;

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

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

  654.         }

  655.     }

  656. 

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

  658.         s->error_count= INT_MAX;

  659.     else{

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

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

  662.     }

  663. 

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

  665. 

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

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

  668. 

  669.         prev_status &= ~ VP_START;

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

  671.     }

  672. }

  673. 

  674. void ff_er_frame_end(MpegEncContext *s){

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

  676.     int distance;

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

  678.     int threshold= 50;

  679.     int is_intra_likely;

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

  681.     Picture *pic= s->current_picture_ptr;

  682. 

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

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

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

  686. 

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

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

  689. 

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

  691.             pic->ref_index[i]= av_mallocz(size * sizeof(uint8_t));

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

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

  694.         }

  695.         pic->motion_subsample_log2= 3;

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

  697.     }

  698. 

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

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

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

  702.     }

  703. 

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

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

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

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

  708. 

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

  710.             }

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

  712.         }

  713.     }

  714. 

  715. #if 1

  716.     /* handle overlapping slices */

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

  718.         int end_ok=0;

  719. 

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

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

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

  723. 

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

  725.                 end_ok=1;

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

  727.                 end_ok=1;

  728. 

  729.             if(!end_ok)

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

  731. 

  732.             if(error&VP_START)

  733.                 end_ok=0;

  734.         }

  735.     }

  736. #endif

  737. #if 1

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

  739.     if(s->partitioned_frame){

  740.         int end_ok=0;

  741. 

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

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

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

  745. 

  746.             if(error&AC_END)

  747.                 end_ok=0;

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

  749.                 end_ok=1;

  750. 

  751.             if(!end_ok)

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

  753. 

  754.             if(error&VP_START)

  755.                 end_ok=0;

  756.         }

  757.     }

  758. #endif

  759.     /* handle missing slices */

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

  761.         int end_ok=1;

  762. 

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

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

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

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

  767. 

  768.             if(error1&VP_START)

  769.                 end_ok=1;

  770. 

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

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

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

  774.                 end_ok=0;

  775.             }

  776. 

  777.             if(!end_ok)

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

  779.         }

  780.     }

  781. 

  782. #if 1

  783.     /* backward mark errors */

  784.     distance=9999999;

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

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

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

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

  789. 

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

  791.                 distance++;

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

  793.                 distance= 0;

  794. 

  795.             if(s->partitioned_frame){

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

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

  798.             }else{

  799.                 if(distance < threshold)

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

  801.             }

  802. 

  803.             if(error&VP_START)

  804.                 distance= 9999999;

  805.         }

  806.     }

  807. #endif

  808. 

  809.     /* forward mark errors */

  810.     error=0;

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

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

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

  814. 

  815.         if(old_error&VP_START)

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

  817.         else{

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

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

  820.         }

  821.     }

  822. #if 1

  823.     /* handle not partitioned case */

  824.     if(!s->partitioned_frame){

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

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

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

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

  829.                 error|= AC_ERROR|DC_ERROR|MV_ERROR;

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

  831.         }

  832.     }

  833. #endif

  834. 

  835.     dc_error= ac_error= mv_error=0;

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

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

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

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

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

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

  842.     }

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

  844. 

  845.     is_intra_likely= is_intra_more_likely(s);

  846. 

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

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

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

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

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

  852.             continue;

  853. 

  854.         if(is_intra_likely)

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

  856.         else

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

  858.     }

  859. 

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

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

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

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

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

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

  866. 

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

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

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

  870. 

  871.             s->mv_dir = MV_DIR_FORWARD;

  872.             s->mb_intra=0;

  873.             s->mb_skipped=0;

  874.             if(IS_8X8(mb_type)){

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

  876.                 int j;

  877.                 s->mv_type = MV_TYPE_8X8;

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

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

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

  881.                 }

  882.             }else{

  883.                 s->mv_type = MV_TYPE_16X16;

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

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

  886.             }

  887. 

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

  889. 

  890.             s->mb_x= mb_x;

  891.             s->mb_y= mb_y;

  892.             decode_mb(s);

  893.         }

  894.     }

  895. 

  896.     /* guess MVs */

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

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

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

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

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

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

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

  904. 

  905.                 if(IS_INTRA(mb_type)) continue;

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

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

  908. 

  909.                 s->mv_dir = MV_DIR_FORWARD|MV_DIR_BACKWARD;

  910.                 s->mb_intra=0;

  911.                 s->mv_type = MV_TYPE_16X16;

  912.                 s->mb_skipped=0;

  913. 

  914.                 if(s->pp_time){

  915.                     int time_pp= s->pp_time;

  916.                     int time_pb= s->pb_time;

  917. 

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

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

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

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

  922.                 }else{

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

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

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

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

  927.                 }

  928. 

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

  930.                 s->mb_x= mb_x;

  931.                 s->mb_y= mb_y;

  932.                 decode_mb(s);

  933.             }

  934.         }

  935.     }else

  936.         guess_mv(s);

  937. 

  938. #if CONFIG_XVMC

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

  940.     if(s->avctx->xvmc_acceleration) goto ec_clean;

  941. #endif

  942.     /* fill DC for inter blocks */

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

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

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

  946.             int16_t *dc_ptr;

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

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

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

  950. 

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

  952. 

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

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

  955. 

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

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

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

  959. 

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

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

  962.                 dc=0;

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

  964.                     int x;

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

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

  967.                     }

  968.                 }

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

  970.             }

  971. 

  972.             dcu=dcv=0;

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

  974.                 int x;

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

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

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

  978.                 }

  979.             }

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

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

  982.         }

  983.     }

  984. #if 1

  985.     /* guess DC for damaged blocks */

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

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

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

  989. #endif

  990.     /* filter luma DC */

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

  992. 

  993. #if 1

  994.     /* render DC only intra */

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

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

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

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

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

  1000. 

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

  1002. 

  1003.             if(IS_INTER(mb_type)) continue;

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

  1005. 

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

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

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

  1009. 

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

  1011.         }

  1012.     }

  1013. #endif

  1014. 

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

  1016.         /* filter horizontal block boundaries */

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

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

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

  1020. 

  1021.         /* filter vertical block boundaries */

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

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

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

  1025.     }

  1026. 

  1027. #if CONFIG_XVMC

  1028. ec_clean:

  1029. #endif

  1030.     /* clean a few tables */

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

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

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

  1034. 

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

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

  1037.         }

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

  1039.     }

  1040. }