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

1088 lines
41KB
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, mvx_stride, mvy_stride;

  224.     uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;

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

  226.     mvx_stride >>= is_luma;

  227.     mvy_stride *= mvx_stride;

  228. 

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

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

  231.             int y;

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

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

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

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

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

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

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

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

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

  241. 

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

  243. 

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

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

  246. 

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

  248.                 int a,b,c,d;

  249. 

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

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

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

  253. 

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

  255.                 d= FFMAX(d, 0);

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

  257. 

  258.                 if(d==0) continue;

  259. 

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

  261.                     d= d*16/9;

  262. 

  263.                 if(left_damage){

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

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

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

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

  268.                 }

  269.                 if(right_damage){

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

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

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

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

  274.                 }

  275.             }

  276.         }

  277.     }

  278. }

  279. 

  280. /**

  281.  * simple vertical deblocking filter used for error resilience

  282.  * @param w     width in 8 pixel blocks

  283.  * @param h     height in 8 pixel blocks

  284.  */

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

  286.     int b_x, b_y, mvx_stride, mvy_stride;

  287.     uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;

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

  289.     mvx_stride >>= is_luma;

  290.     mvy_stride *= mvx_stride;

  291. 

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

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

  294.             int x;

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

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

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

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

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

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

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

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

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

  304. 

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

  306. 

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

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

  309. 

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

  311.                 int a,b,c,d;

  312. 

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

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

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

  316. 

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

  318.                 d= FFMAX(d, 0);

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

  320. 

  321.                 if(d==0) continue;

  322. 

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

  324.                     d= d*16/9;

  325. 

  326.                 if(top_damage){

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

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

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

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

  331.                 }

  332.                 if(bottom_damage){

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

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

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

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

  337.                 }

  338.             }

  339.         }

  340.     }

  341. }

  342. 

  343. static void guess_mv(MpegEncContext *s){

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

  345. #define MV_FROZEN    3

  346. #define MV_CHANGED   2

  347. #define MV_UNCHANGED 1

  348.     const int mb_stride = s->mb_stride;

  349.     const int mb_width = s->mb_width;

  350.     const int mb_height= s->mb_height;

  351.     int i, depth, num_avail;

  352.     int mb_x, mb_y, mot_step, mot_stride;

  353. 

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

  355. 

  356.     num_avail=0;

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

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

  359.         int f=0;

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

  361. 

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

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

  364. 

  365.         fixed[mb_xy]= f;

  366.         if(f==MV_FROZEN)

  367.             num_avail++;

  368.     }

  369. 

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

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

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

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

  374. 

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

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

  377. 

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

  379.                 s->mb_intra=0;

  380.                 s->mv_type = MV_TYPE_16X16;

  381.                 s->mb_skipped=0;

  382. 

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

  384. 

  385.                 s->mb_x= mb_x;

  386.                 s->mb_y= mb_y;

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

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

  389.                 decode_mb(s);

  390.             }

  391.         }

  392.         return;

  393.     }

  394. 

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

  396.         int changed, pass, none_left;

  397. 

  398.         none_left=1;

  399.         changed=1;

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

  401.             int mb_x, mb_y;

  402. int score_sum=0;

  403. 

  404.             changed=0;

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

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

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

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

  409.                     int pred_count=0;

  410.                     int j;

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

  412.                     int best_pred=0;

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

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

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

  416. 

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

  418. 

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

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

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

  422. 

  423.                     j=0;

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

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

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

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

  428.                     if(j==0) continue;

  429. 

  430.                     j=0;

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

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

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

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

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

  436. 

  437.                     none_left=0;

  438. 

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

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

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

  442.                         pred_count++;

  443.                     }

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

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

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

  447.                         pred_count++;

  448.                     }

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

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

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

  452.                         pred_count++;

  453.                     }

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

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

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

  457.                         pred_count++;

  458.                     }

  459.                     if(pred_count==0) continue;

  460. 

  461.                     if(pred_count>1){

  462.                         int sum_x=0, sum_y=0;

  463.                         int max_x, max_y, min_x, min_y;

  464. 

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

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

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

  468.                         }

  469. 

  470.                         /* mean */

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

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

  473. 

  474.                         /* median */

  475.                         if(pred_count>=3){

  476.                             min_y= min_x= 99999;

  477.                             max_y= max_x=-99999;

  478.                         }else{

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

  480.                         }

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

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

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

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

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

  486.                         }

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

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

  489. 

  490.                         if(pred_count==4){

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

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

  493.                         }

  494.                         pred_count+=2;

  495.                     }

  496. 

  497.                     /* zero MV */

  498.                     pred_count++;

  499. 

  500.                     /* last MV */

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

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

  503.                     pred_count++;

  504. 

  505.                     s->mv_dir = MV_DIR_FORWARD;

  506.                     s->mb_intra=0;

  507.                     s->mv_type = MV_TYPE_16X16;

  508.                     s->mb_skipped=0;

  509. 

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

  511. 

  512.                     s->mb_x= mb_x;

  513.                     s->mb_y= mb_y;

  514. 

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

  516.                         int score=0;

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

  518. 

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

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

  521. 

  522.                         decode_mb(s);

  523. 

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

  525.                             int k;

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

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

  528.                         }

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

  530.                             int k;

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

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

  533.                         }

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

  535.                             int k;

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

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

  538.                         }

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

  540.                             int k;

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

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

  543.                         }

  544. 

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

  546.                             best_score= score;

  547.                             best_pred= j;

  548.                         }

  549.                     }

  550. score_sum+= best_score;

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

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

  553. 

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

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

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

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

  558.                         }

  559. 

  560.                     decode_mb(s);

  561. 

  562. 

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

  564.                         fixed[mb_xy]=MV_CHANGED;

  565.                         changed++;

  566.                     }else

  567.                         fixed[mb_xy]=MV_UNCHANGED;

  568.                 }

  569.             }

  570. 

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

  572.         }

  573. 

  574.         if(none_left)

  575.             return;

  576. 

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

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

  579.             if(fixed[mb_xy])

  580.                 fixed[mb_xy]=MV_FROZEN;

  581.         }

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

  583.     }

  584. }

  585. 

  586. static int is_intra_more_likely(MpegEncContext *s){

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

  588. 

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

  590. 

  591.     undamaged_count=0;

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

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

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

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

  596.             undamaged_count++;

  597.     }

  598. 

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

  600. 

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

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

  603.         return 1;

  604. 

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

  606.     is_intra_likely=0;

  607. 

  608.     j=0;

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

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

  611.             int error;

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

  613. 

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

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

  616.                 continue; //skip damaged

  617. 

  618.             j++;

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

  620. 

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

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

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

  624. 

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

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

  627.             }else{

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

  629.                    is_intra_likely++;

  630.                 else

  631.                    is_intra_likely--;

  632.             }

  633.         }

  634.     }

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

  636.     return is_intra_likely > 0;

  637. }

  638. 

  639. void ff_er_frame_start(MpegEncContext *s){

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

  641. 

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

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

  644. }

  645. 

  646. /**

  647.  * adds a slice.

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

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

  650.  *               error of the same type occurred

  651.  */

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

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

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

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

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

  657.     int mask= -1;

  658. 

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

  660.         return;

  661. 

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

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

  664.         return;

  665.     }

  666. 

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

  668. 

  669.     mask &= ~VP_START;

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

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

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

  673.     }

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

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

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

  677.     }

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

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

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

  681.     }

  682. 

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

  684. 

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

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

  687.     }else{

  688.         int i;

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

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

  691.         }

  692.     }

  693. 

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

  695.         s->error_count= INT_MAX;

  696.     else{

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

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

  699.     }

  700. 

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

  702. 

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

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

  705. 

  706.         prev_status &= ~ VP_START;

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

  708.     }

  709. }

  710. 

  711. void ff_er_frame_end(MpegEncContext *s){

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

  713.     int distance;

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

  715.     int threshold= 50;

  716.     int is_intra_likely;

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

  718.     Picture *pic= s->current_picture_ptr;

  719. 

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

  721.        s->avctx->hwaccel ||

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

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

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

  725. 

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

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

  728. 

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

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

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

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

  733.         }

  734.         pic->motion_subsample_log2= 3;

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

  736.     }

  737. 

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

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

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

  741.     }

  742. 

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

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

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

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

  747. 

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

  749.             }

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

  751.         }

  752.     }

  753. 

  754. #if 1

  755.     /* handle overlapping slices */

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

  757.         int end_ok=0;

  758. 

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

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

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

  762. 

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

  764.                 end_ok=1;

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

  766.                 end_ok=1;

  767. 

  768.             if(!end_ok)

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

  770. 

  771.             if(error&VP_START)

  772.                 end_ok=0;

  773.         }

  774.     }

  775. #endif

  776. #if 1

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

  778.     if(s->partitioned_frame){

  779.         int end_ok=0;

  780. 

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

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

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

  784. 

  785.             if(error&AC_END)

  786.                 end_ok=0;

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

  788.                 end_ok=1;

  789. 

  790.             if(!end_ok)

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

  792. 

  793.             if(error&VP_START)

  794.                 end_ok=0;

  795.         }

  796.     }

  797. #endif

  798.     /* handle missing slices */

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

  800.         int end_ok=1;

  801. 

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

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

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

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

  806. 

  807.             if(error1&VP_START)

  808.                 end_ok=1;

  809. 

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

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

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

  813.                 end_ok=0;

  814.             }

  815. 

  816.             if(!end_ok)

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

  818.         }

  819.     }

  820. 

  821. #if 1

  822.     /* backward mark errors */

  823.     distance=9999999;

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

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

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

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

  828. 

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

  830.                 distance++;

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

  832.                 distance= 0;

  833. 

  834.             if(s->partitioned_frame){

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

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

  837.             }else{

  838.                 if(distance < threshold)

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

  840.             }

  841. 

  842.             if(error&VP_START)

  843.                 distance= 9999999;

  844.         }

  845.     }

  846. #endif

  847. 

  848.     /* forward mark errors */

  849.     error=0;

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

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

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

  853. 

  854.         if(old_error&VP_START)

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

  856.         else{

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

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

  859.         }

  860.     }

  861. #if 1

  862.     /* handle not partitioned case */

  863.     if(!s->partitioned_frame){

  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&(AC_ERROR|DC_ERROR|MV_ERROR))

  868.                 error|= AC_ERROR|DC_ERROR|MV_ERROR;

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

  870.         }

  871.     }

  872. #endif

  873. 

  874.     dc_error= ac_error= mv_error=0;

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

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

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

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

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

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

  881.     }

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

  883. 

  884.     is_intra_likely= is_intra_more_likely(s);

  885. 

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

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

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

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

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

  891.             continue;

  892. 

  893.         if(is_intra_likely)

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

  895.         else

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

  897.     }

  898. 

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

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

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

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

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

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

  905.         }

  906. 

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

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

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

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

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

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

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

  914. 

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

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

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

  918. 

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

  920.             s->mb_intra=0;

  921.             s->mb_skipped=0;

  922.             if(IS_8X8(mb_type)){

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

  924.                 int j;

  925.                 s->mv_type = MV_TYPE_8X8;

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

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

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

  929.                 }

  930.             }else{

  931.                 s->mv_type = MV_TYPE_16X16;

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

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

  934.             }

  935. 

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

  937. 

  938.             s->mb_x= mb_x;

  939.             s->mb_y= mb_y;

  940.             decode_mb(s);

  941.         }

  942.     }

  943. 

  944.     /* guess MVs */

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

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

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

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

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

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

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

  952. 

  953.                 if(IS_INTRA(mb_type)) continue;

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

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

  956. 

  957.                 s->mv_dir = MV_DIR_FORWARD|MV_DIR_BACKWARD;

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

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

  960.                 s->mb_intra=0;

  961.                 s->mv_type = MV_TYPE_16X16;

  962.                 s->mb_skipped=0;

  963. 

  964.                 if(s->pp_time){

  965.                     int time_pp= s->pp_time;

  966.                     int time_pb= s->pb_time;

  967. 

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

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

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

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

  972.                 }else{

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

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

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

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

  977.                 }

  978. 

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

  980.                 s->mb_x= mb_x;

  981.                 s->mb_y= mb_y;

  982.                 decode_mb(s);

  983.             }

  984.         }

  985.     }else

  986.         guess_mv(s);

  987. 

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

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

  990.         goto ec_clean;

  991.     /* fill DC for inter blocks */

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

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

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

  995.             int16_t *dc_ptr;

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

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

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

  999. 

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

  1001. 

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

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

  1004. 

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

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

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

  1008. 

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

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

  1011.                 dc=0;

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

  1013.                     int x;

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

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

  1016.                     }

  1017.                 }

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

  1019.             }

  1020. 

  1021.             dcu=dcv=0;

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

  1023.                 int x;

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

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

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

  1027.                 }

  1028.             }

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

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

  1031.         }

  1032.     }

  1033. #if 1

  1034.     /* guess DC for damaged blocks */

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

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

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

  1038. #endif

  1039.     /* filter luma DC */

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

  1041. 

  1042. #if 1

  1043.     /* render DC only intra */

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

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

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

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

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

  1049. 

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

  1051. 

  1052.             if(IS_INTER(mb_type)) continue;

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

  1054. 

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

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

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

  1058. 

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

  1060.         }

  1061.     }

  1062. #endif

  1063. 

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

  1065.         /* filter horizontal block boundaries */

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

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

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

  1069. 

  1070.         /* filter vertical block boundaries */

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

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

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

  1074.     }

  1075. 

  1076. ec_clean:

  1077.     /* clean a few tables */

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

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

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

  1081. 

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

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

  1084.         }

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

  1086.     }

  1087. }