开通博客赚积分
发布资源赚积分
分类

源码开发语言/平台
当前位置：首页 > 源码/资料 > 多媒体 > 流媒体/Mpeg4/MP4 > 查看源码
error_resilience.c
资源名称：X264CODEC.rar　[点击查看]
上传用户：lctgjx
上传日期：2022-06-04
资源大小：8887k
文件大小：40k
源码类别：

流媒体/Mpeg4/MP4

开发平台：

Visual C++

error_resilience.c：源码内容
  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.  */
  23. /**
  24.  * @file error_resilience.c
  25.  * Error resilience / concealment.
  26.  */
  28. #include <limits.h>
  30. #include "avcodec.h"
  31. #include "dsputil.h"
  32. #include "mpegvideo.h"
  33. #include "log.h"
  35. static void decode_mb(MpegEncContext *s){
  36.     s->dest[0] = s->current_picture.data[0] + (s->mb_y * 16* s->linesize  ) + s->mb_x * 16;
  37.     s->dest[1] = s->current_picture.data[1] + (s->mb_y * 8 * s->uvlinesize) + s->mb_x * 8;
  38.     s->dest[2] = s->current_picture.data[2] + (s->mb_y * 8 * s->uvlinesize) + s->mb_x * 8;
  40.     MPV_decode_mb(s, s->block);
  41. }
  43. /**
  44.  * replaces the current MB with a flat dc only version.
  45.  */
  46. static void put_dc(MpegEncContext *s, uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr, int mb_x, int mb_y)
  47. {
  48.     int dc, dcu, dcv, y, i;
  49.     for(i=0; i<4; i++){
  50.         dc= s->dc_val[0][mb_x*2 + (i&1) + (mb_y*2 + (i>>1))*s->b8_stride];
  51.         if(dc<0) dc=0;
  52.         else if(dc>2040) dc=2040;
  53.         for(y=0; y<8; y++){
  54.             int x;
  55.             for(x=0; x<8; x++){
  56.                 dest_y[x + (i&1)*8 + (y + (i>>1)*8)*s->linesize]= dc/8;
  57.             }
  58.         }
  59.     }
  60.     dcu = s->dc_val[1][mb_x + mb_y*s->mb_stride];
  61.     dcv = s->dc_val[2][mb_x + mb_y*s->mb_stride];
  62.     if     (dcu<0   ) dcu=0;
  63.     else if(dcu>2040) dcu=2040;
  64.     if     (dcv<0   ) dcv=0;
  65.     else if(dcv>2040) dcv=2040;
  66.     for(y=0; y<8; y++){
  67.         int x;
  68.         for(x=0; x<8; x++){
  69.             dest_cb[x + y*(s->uvlinesize)]= dcu/8;
  70.             dest_cr[x + y*(s->uvlinesize)]= dcv/8;
  71.         }
  72.     }
  73. }
  75. static void filter181(int16_t *data, int width, int height, int stride){
  76.     int x,y;
  78.     /* horizontal filter */
  79.     for(y=1; y<height-1; y++){
  80.         int prev_dc= data[0 + y*stride];
  82.         for(x=1; x<width-1; x++){
  83.             int dc;
  85.             dc= - prev_dc
  86.                 + data[x     + y*stride]*8
  87.                 - data[x + 1 + y*stride];
  88.             dc= (dc*10923 + 32768)>>16;
  89.             prev_dc= data[x + y*stride];
  90.             data[x + y*stride]= dc;
  91.         }
  92.     }
  94.     /* vertical filter */
  95.     for(x=1; x<width-1; x++){
  96.         int prev_dc= data[x];
  98.         for(y=1; y<height-1; y++){
  99.             int dc;
  101.             dc= - prev_dc
  102.                 + data[x +  y   *stride]*8
  103.                 - data[x + (y+1)*stride];
  104.             dc= (dc*10923 + 32768)>>16;
  105.             prev_dc= data[x + y*stride];
  106.             data[x + y*stride]= dc;
  107.         }
  108.     }
  109. }
  111. /**
  112.  * guess the dc of blocks which do not have an undamaged dc
  113.  * @param w     width in 8 pixel blocks
  114.  * @param h     height in 8 pixel blocks
  115.  */
  116. static void guess_dc(MpegEncContext *s, int16_t *dc, int w, int h, int stride, int is_luma){
  117.     int b_x, b_y;
  119.     for(b_y=0; b_y<h; b_y++){
  120.         for(b_x=0; b_x<w; b_x++){
  121.             int color[4]={1024,1024,1024,1024};
  122.             int distance[4]={9999,9999,9999,9999};
  123.             int mb_index, error, j;
  124.             int64_t guess, weight_sum;
  126.             mb_index= (b_x>>is_luma) + (b_y>>is_luma)*s->mb_stride;
  128.             error= s->error_status_table[mb_index];
  130.             if(IS_INTER(s->current_picture.mb_type[mb_index])) continue; //inter
  131.             if(!(error&DC_ERROR)) continue;           //dc-ok
  133.             /* right block */
  134.             for(j=b_x+1; j<w; j++){
  135.                 int mb_index_j= (j>>is_luma) + (b_y>>is_luma)*s->mb_stride;
  136.                 int error_j= s->error_status_table[mb_index_j];
  137.                 int intra_j= IS_INTRA(s->current_picture.mb_type[mb_index_j]);
  138.                 if(intra_j==0 || !(error_j&DC_ERROR)){
  139.                     color[0]= dc[j + b_y*stride];
  140.                     distance[0]= j-b_x;
  141.                     break;
  142.                 }
  143.             }
  145.             /* left block */
  146.             for(j=b_x-1; j>=0; j--){
  147.                 int mb_index_j= (j>>is_luma) + (b_y>>is_luma)*s->mb_stride;
  148.                 int error_j= s->error_status_table[mb_index_j];
  149.                 int intra_j= IS_INTRA(s->current_picture.mb_type[mb_index_j]);
  150.                 if(intra_j==0 || !(error_j&DC_ERROR)){
  151.                     color[1]= dc[j + b_y*stride];
  152.                     distance[1]= b_x-j;
  153.                     break;
  154.                 }
  155.             }
  157.             /* bottom block */
  158.             for(j=b_y+1; j<h; j++){
  159.                 int mb_index_j= (b_x>>is_luma) + (j>>is_luma)*s->mb_stride;
  160.                 int error_j= s->error_status_table[mb_index_j];
  161.                 int intra_j= IS_INTRA(s->current_picture.mb_type[mb_index_j]);
  162.                 if(intra_j==0 || !(error_j&DC_ERROR)){
  163.                     color[2]= dc[b_x + j*stride];
  164.                     distance[2]= j-b_y;
  165.                     break;
  166.                 }
  167.             }
  169.             /* top block */
  170.             for(j=b_y-1; j>=0; j--){
  171.                 int mb_index_j= (b_x>>is_luma) + (j>>is_luma)*s->mb_stride;
  172.                 int error_j= s->error_status_table[mb_index_j];
  173.                 int intra_j= IS_INTRA(s->current_picture.mb_type[mb_index_j]);
  174.                 if(intra_j==0 || !(error_j&DC_ERROR)){
  175.                     color[3]= dc[b_x + j*stride];
  176.                     distance[3]= b_y-j;
  177.                     break;
  178.                 }
  179.             }
  181.             weight_sum=0;
  182.             guess=0;
  183.             for(j=0; j<4; j++){
  184.                 int64_t weight= 256*256*256*16/distance[j];
  185.                 guess+= weight*(int64_t)color[j];
  186.                 weight_sum+= weight;
  187.             }
  188.             guess= (guess + weight_sum/2) / weight_sum;
  190.             dc[b_x + b_y*stride]= guess;
  191.         }
  192.     }
  193. }
  195. /**
  196.  * simple horizontal deblocking filter used for error resilience
  197.  * @param w     width in 8 pixel blocks
  198.  * @param h     height in 8 pixel blocks
  199.  */
  200. static void h_block_filter(MpegEncContext *s, uint8_t *dst, int w, int h, int stride, int is_luma){
  201.     int b_x, b_y;
  202.     uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;
  204.     for(b_y=0; b_y<h; b_y++){
  205.         for(b_x=0; b_x<w-1; b_x++){
  206.             int y;
  207.             int left_status = s->error_status_table[( b_x   >>is_luma) + (b_y>>is_luma)*s->mb_stride];
  208.             int right_status= s->error_status_table[((b_x+1)>>is_luma) + (b_y>>is_luma)*s->mb_stride];
  209.             int left_intra=   IS_INTRA(s->current_picture.mb_type      [( b_x   >>is_luma) + (b_y>>is_luma)*s->mb_stride]);
  210.             int right_intra=  IS_INTRA(s->current_picture.mb_type      [((b_x+1)>>is_luma) + (b_y>>is_luma)*s->mb_stride]);
  211.             int left_damage =  left_status&(DC_ERROR|AC_ERROR|MV_ERROR);
  212.             int right_damage= right_status&(DC_ERROR|AC_ERROR|MV_ERROR);
  213.             int offset= b_x*8 + b_y*stride*8;
  214.             int16_t *left_mv=  s->current_picture.motion_val[0][s->b8_stride*(b_y<<(1-is_luma)) + ( b_x   <<(1-is_luma))];
  215.             int16_t *right_mv= s->current_picture.motion_val[0][s->b8_stride*(b_y<<(1-is_luma)) + ((b_x+1)<<(1-is_luma))];
  217.             if(!(left_damage||right_damage)) continue; // both undamaged
  219.             if(   (!left_intra) && (!right_intra)
  220.                && FFABS(left_mv[0]-right_mv[0]) + FFABS(left_mv[1]+right_mv[1]) < 2) continue;
  222.             for(y=0; y<8; y++){
  223.                 int a,b,c,d;
  225.                 a= dst[offset + 7 + y*stride] - dst[offset + 6 + y*stride];
  226.                 b= dst[offset + 8 + y*stride] - dst[offset + 7 + y*stride];
  227.                 c= dst[offset + 9 + y*stride] - dst[offset + 8 + y*stride];
  229.                 d= FFABS(b) - ((FFABS(a) + FFABS(c) + 1)>>1);
  230.                 d= FFMAX(d, 0);
  231.                 if(b<0) d= -d;
  233.                 if(d==0) continue;
  235.                 if(!(left_damage && right_damage))
  236.                     d= d*16/9;
  238.                 if(left_damage){
  239.                     dst[offset + 7 + y*stride] = cm[dst[offset + 7 + y*stride] + ((d*7)>>4)];
  240.                     dst[offset + 6 + y*stride] = cm[dst[offset + 6 + y*stride] + ((d*5)>>4)];
  241.                     dst[offset + 5 + y*stride] = cm[dst[offset + 5 + y*stride] + ((d*3)>>4)];
  242.                     dst[offset + 4 + y*stride] = cm[dst[offset + 4 + y*stride] + ((d*1)>>4)];
  243.                 }
  244.                 if(right_damage){
  245.                     dst[offset + 8 + y*stride] = cm[dst[offset + 8 + y*stride] - ((d*7)>>4)];
  246.                     dst[offset + 9 + y*stride] = cm[dst[offset + 9 + y*stride] - ((d*5)>>4)];
  247.                     dst[offset + 10+ y*stride] = cm[dst[offset +10 + y*stride] - ((d*3)>>4)];
  248.                     dst[offset + 11+ y*stride] = cm[dst[offset +11 + y*stride] - ((d*1)>>4)];
  249.                 }
  250.             }
  251.         }
  252.     }
  253. }
  255. /**
  256.  * simple vertical deblocking filter used for error resilience
  257.  * @param w     width in 8 pixel blocks
  258.  * @param h     height in 8 pixel blocks
  259.  */
  260. static void v_block_filter(MpegEncContext *s, uint8_t *dst, int w, int h, int stride, int is_luma){
  261.     int b_x, b_y;
  262.     uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;
  264.     for(b_y=0; b_y<h-1; b_y++){
  265.         for(b_x=0; b_x<w; b_x++){
  266.             int x;
  267.             int top_status   = s->error_status_table[(b_x>>is_luma) + ( b_y   >>is_luma)*s->mb_stride];
  268.             int bottom_status= s->error_status_table[(b_x>>is_luma) + ((b_y+1)>>is_luma)*s->mb_stride];
  269.             int top_intra=     IS_INTRA(s->current_picture.mb_type      [(b_x>>is_luma) + ( b_y   >>is_luma)*s->mb_stride]);
  270.             int bottom_intra=  IS_INTRA(s->current_picture.mb_type      [(b_x>>is_luma) + ((b_y+1)>>is_luma)*s->mb_stride]);
  271.             int top_damage =      top_status&(DC_ERROR|AC_ERROR|MV_ERROR);
  272.             int bottom_damage= bottom_status&(DC_ERROR|AC_ERROR|MV_ERROR);
  273.             int offset= b_x*8 + b_y*stride*8;
  274.             int16_t *top_mv=    s->current_picture.motion_val[0][s->b8_stride*( b_y   <<(1-is_luma)) + (b_x<<(1-is_luma))];
  275.             int16_t *bottom_mv= s->current_picture.motion_val[0][s->b8_stride*((b_y+1)<<(1-is_luma)) + (b_x<<(1-is_luma))];
  277.             if(!(top_damage||bottom_damage)) continue; // both undamaged
  279.             if(   (!top_intra) && (!bottom_intra)
  280.                && FFABS(top_mv[0]-bottom_mv[0]) + FFABS(top_mv[1]+bottom_mv[1]) < 2) continue;
  282.             for(x=0; x<8; x++){
  283.                 int a,b,c,d;
  285.                 a= dst[offset + x + 7*stride] - dst[offset + x + 6*stride];
  286.                 b= dst[offset + x + 8*stride] - dst[offset + x + 7*stride];
  287.                 c= dst[offset + x + 9*stride] - dst[offset + x + 8*stride];
  289.                 d= FFABS(b) - ((FFABS(a) + FFABS(c)+1)>>1);
  290.                 d= FFMAX(d, 0);
  291.                 if(b<0) d= -d;
  293.                 if(d==0) continue;
  295.                 if(!(top_damage && bottom_damage))
  296.                     d= d*16/9;
  298.                 if(top_damage){
  299.                     dst[offset + x +  7*stride] = cm[dst[offset + x +  7*stride] + ((d*7)>>4)];
  300.                     dst[offset + x +  6*stride] = cm[dst[offset + x +  6*stride] + ((d*5)>>4)];
  301.                     dst[offset + x +  5*stride] = cm[dst[offset + x +  5*stride] + ((d*3)>>4)];
  302.                     dst[offset + x +  4*stride] = cm[dst[offset + x +  4*stride] + ((d*1)>>4)];
  303.                 }
  304.                 if(bottom_damage){
  305.                     dst[offset + x +  8*stride] = cm[dst[offset + x +  8*stride] - ((d*7)>>4)];
  306.                     dst[offset + x +  9*stride] = cm[dst[offset + x +  9*stride] - ((d*5)>>4)];
  307.                     dst[offset + x + 10*stride] = cm[dst[offset + x + 10*stride] - ((d*3)>>4)];
  308.                     dst[offset + x + 11*stride] = cm[dst[offset + x + 11*stride] - ((d*1)>>4)];
  309.                 }
  310.             }
  311.         }
  312.     }
  313. }
  315. static void guess_mv(MpegEncContext *s){
  316. //    uint8_t fixed[s->mb_stride * s->mb_height];
  317. uint8_t fixed[2000];
  318. #define MV_FROZEN    3
  319. #define MV_CHANGED   2
  320. #define MV_UNCHANGED 1
  321.     const int mb_stride = s->mb_stride;
  322.     const int mb_width = s->mb_width;
  323.     const int mb_height= s->mb_height;
  324.     int i, depth, num_avail;
  325.     int mb_x, mb_y;
  327.     num_avail=0;
  328.     for(i=0; i<s->mb_num; i++){
  329.         const int mb_xy= s->mb_index2xy[ i ];
  330.         int f=0;
  331.         int error= s->error_status_table[mb_xy];
  333.         if(IS_INTRA(s->current_picture.mb_type[mb_xy])) f=MV_FROZEN; //intra //FIXME check
  334.         if(!(error&MV_ERROR)) f=MV_FROZEN;           //inter with undamaged MV
  336.         fixed[mb_xy]= f;
  337.         if(f==MV_FROZEN)
  338.             num_avail++;
  339.     }
  341.     if((!(s->avctx->error_concealment&FF_EC_GUESS_MVS)) || num_avail <= mb_width/2){
  342.         for(mb_y=0; mb_y<s->mb_height; mb_y++){
  343.             for(mb_x=0; mb_x<s->mb_width; mb_x++){
  344.                 const int mb_xy= mb_x + mb_y*s->mb_stride;
  346.                 if(IS_INTRA(s->current_picture.mb_type[mb_xy]))  continue;
  347.                 if(!(s->error_status_table[mb_xy]&MV_ERROR)) continue;
  349.                 s->mv_dir = MV_DIR_FORWARD;
  350.                 s->mb_intra=0;
  351.                 s->mv_type = MV_TYPE_16X16;
  352.                 s->mb_skipped=0;
  354.                 s->dsp.clear_blocks(s->block[0]);
  356.                 s->mb_x= mb_x;
  357.                 s->mb_y= mb_y;
  358.                 s->mv[0][0][0]= 0;
  359.                 s->mv[0][0][1]= 0;
  360.                 decode_mb(s);
  361.             }
  362.         }
  363.         return;
  364.     }
  366.     for(depth=0;; depth++){
  367.         int changed, pass, none_left;
  369.         none_left=1;
  370.         changed=1;
  371.         for(pass=0; (changed || pass<2) && pass<10; pass++){
  372.             int mb_x, mb_y;
  373. int score_sum=0;
  375.             changed=0;
  376.             for(mb_y=0; mb_y<s->mb_height; mb_y++){
  377.                 for(mb_x=0; mb_x<s->mb_width; mb_x++){
  378.                     const int mb_xy= mb_x + mb_y*s->mb_stride;
  379.                     int mv_predictor[8][2]={{0}};
  380.                     int pred_count=0;
  381.                     int j;
  382.                     int best_score=256*256*256*64;
  383.                     int best_pred=0;
  384.                     const int mot_stride= s->b8_stride;
  385.                     const int mot_index= mb_x*2 + mb_y*2*mot_stride;
  386.                     int prev_x= s->current_picture.motion_val[0][mot_index][0];
  387.                     int prev_y= s->current_picture.motion_val[0][mot_index][1];
  389.                     if((mb_x^mb_y^pass)&1) continue;
  391.                     if(fixed[mb_xy]==MV_FROZEN) continue;
  392.                     assert(!IS_INTRA(s->current_picture.mb_type[mb_xy]));
  393.                     assert(s->last_picture_ptr && s->last_picture_ptr->data[0]);
  395.                     j=0;
  396.                     if(mb_x>0           && fixed[mb_xy-1        ]==MV_FROZEN) j=1;
  397.                     if(mb_x+1<mb_width  && fixed[mb_xy+1        ]==MV_FROZEN) j=1;
  398.                     if(mb_y>0           && fixed[mb_xy-mb_stride]==MV_FROZEN) j=1;
  399.                     if(mb_y+1<mb_height && fixed[mb_xy+mb_stride]==MV_FROZEN) j=1;
  400.                     if(j==0) continue;
  402.                     j=0;
  403.                     if(mb_x>0           && fixed[mb_xy-1        ]==MV_CHANGED) j=1;
  404.                     if(mb_x+1<mb_width  && fixed[mb_xy+1        ]==MV_CHANGED) j=1;
  405.                     if(mb_y>0           && fixed[mb_xy-mb_stride]==MV_CHANGED) j=1;
  406.                     if(mb_y+1<mb_height && fixed[mb_xy+mb_stride]==MV_CHANGED) j=1;
  407.                     if(j==0 && pass>1) continue;
  409.                     none_left=0;
  411.                     if(mb_x>0 && fixed[mb_xy-1]){
  412.                         mv_predictor[pred_count][0]= s->current_picture.motion_val[0][mot_index - 2][0];
  413.                         mv_predictor[pred_count][1]= s->current_picture.motion_val[0][mot_index - 2][1];
  414.                         pred_count++;
  415.                     }
  416.                     if(mb_x+1<mb_width && fixed[mb_xy+1]){
  417.                         mv_predictor[pred_count][0]= s->current_picture.motion_val[0][mot_index + 2][0];
  418.                         mv_predictor[pred_count][1]= s->current_picture.motion_val[0][mot_index + 2][1];
  419.                         pred_count++;
  420.                     }
  421.                     if(mb_y>0 && fixed[mb_xy-mb_stride]){
  422.                         mv_predictor[pred_count][0]= s->current_picture.motion_val[0][mot_index - mot_stride*2][0];
  423.                         mv_predictor[pred_count][1]= s->current_picture.motion_val[0][mot_index - mot_stride*2][1];
  424.                         pred_count++;
  425.                     }
  426.                     if(mb_y+1<mb_height && fixed[mb_xy+mb_stride]){
  427.                         mv_predictor[pred_count][0]= s->current_picture.motion_val[0][mot_index + mot_stride*2][0];
  428.                         mv_predictor[pred_count][1]= s->current_picture.motion_val[0][mot_index + mot_stride*2][1];
  429.                         pred_count++;
  430.                     }
  431.                     if(pred_count==0) continue;
  433.                     if(pred_count>1){
  434.                         int sum_x=0, sum_y=0;
  435.                         int max_x, max_y, min_x, min_y;
  437.                         for(j=0; j<pred_count; j++){
  438.                             sum_x+= mv_predictor[j][0];
  439.                             sum_y+= mv_predictor[j][1];
  440.                         }
  442.                         /* mean */
  443.                         mv_predictor[pred_count][0] = sum_x/j;
  444.                         mv_predictor[pred_count][1] = sum_y/j;
  446.                         /* median */
  447.                         if(pred_count>=3){
  448.                             min_y= min_x= 99999;
  449.                             max_y= max_x=-99999;
  450.                         }else{
  451.                             min_x=min_y=max_x=max_y=0;
  452.                         }
  453.                         for(j=0; j<pred_count; j++){
  454.                             max_x= FFMAX(max_x, mv_predictor[j][0]);
  455.                             max_y= FFMAX(max_y, mv_predictor[j][1]);
  456.                             min_x= FFMIN(min_x, mv_predictor[j][0]);
  457.                             min_y= FFMIN(min_y, mv_predictor[j][1]);
  458.                         }
  459.                         mv_predictor[pred_count+1][0] = sum_x - max_x - min_x;
  460.                         mv_predictor[pred_count+1][1] = sum_y - max_y - min_y;
  462.                         if(pred_count==4){
  463.                             mv_predictor[pred_count+1][0] /= 2;
  464.                             mv_predictor[pred_count+1][1] /= 2;
  465.                         }
  466.                         pred_count+=2;
  467.                     }
  469.                     /* zero MV */
  470.                     pred_count++;
  472.                     /* last MV */
  473.                     mv_predictor[pred_count][0]= s->current_picture.motion_val[0][mot_index][0];
  474.                     mv_predictor[pred_count][1]= s->current_picture.motion_val[0][mot_index][1];
  475.                     pred_count++;
  477.                     s->mv_dir = MV_DIR_FORWARD;
  478.                     s->mb_intra=0;
  479.                     s->mv_type = MV_TYPE_16X16;
  480.                     s->mb_skipped=0;
  482.                     s->dsp.clear_blocks(s->block[0]);
  484.                     s->mb_x= mb_x;
  485.                     s->mb_y= mb_y;
  487.                     for(j=0; j<pred_count; j++){
  488.                         int score=0;
  489.                         uint8_t *src= s->current_picture.data[0] + mb_x*16 + mb_y*16*s->linesize;
  491.                         s->current_picture.motion_val[0][mot_index][0]= s->mv[0][0][0]= mv_predictor[j][0];
  492.                         s->current_picture.motion_val[0][mot_index][1]= s->mv[0][0][1]= mv_predictor[j][1];
  494.                         decode_mb(s);
  496.                         if(mb_x>0 && fixed[mb_xy-1]){
  497.                             int k;
  498.                             for(k=0; k<16; k++)
  499.                                 score += FFABS(src[k*s->linesize-1 ]-src[k*s->linesize   ]);
  500.                         }
  501.                         if(mb_x+1<mb_width && fixed[mb_xy+1]){
  502.                             int k;
  503.                             for(k=0; k<16; k++)
  504.                                 score += FFABS(src[k*s->linesize+15]-src[k*s->linesize+16]);
  505.                         }
  506.                         if(mb_y>0 && fixed[mb_xy-mb_stride]){
  507.                             int k;
  508.                             for(k=0; k<16; k++)
  509.                                 score += FFABS(src[k-s->linesize   ]-src[k               ]);
  510.                         }
  511.                         if(mb_y+1<mb_height && fixed[mb_xy+mb_stride]){
  512.                             int k;
  513.                             for(k=0; k<16; k++)
  514.                                 score += FFABS(src[k+s->linesize*15]-src[k+s->linesize*16]);
  515.                         }
  517.                         if(score <= best_score){ // <= will favor the last MV
  518.                             best_score= score;
  519.                             best_pred= j;
  520.                         }
  521.                     }
  522. score_sum+= best_score;
  523. //FIXME no need to set s->current_picture.motion_val[0][mot_index][0] explicit
  524.                     s->current_picture.motion_val[0][mot_index][0]= s->mv[0][0][0]= mv_predictor[best_pred][0];
  525.                     s->current_picture.motion_val[0][mot_index][1]= s->mv[0][0][1]= mv_predictor[best_pred][1];
  527.                     decode_mb(s);
  530.                     if(s->mv[0][0][0] != prev_x || s->mv[0][0][1] != prev_y){
  531.                         fixed[mb_xy]=MV_CHANGED;
  532.                         changed++;
  533.                     }else
  534.                         fixed[mb_xy]=MV_UNCHANGED;
  535.                 }
  536.             }
  538. //            printf(".%d/%d", changed, score_sum); fflush(stdout);
  539.         }
  541.         if(none_left)
  542.             return;
  544.         for(i=0; i<s->mb_num; i++){
  545.             int mb_xy= s->mb_index2xy[i];
  546.             if(fixed[mb_xy])
  547.                 fixed[mb_xy]=MV_FROZEN;
  548.         }
  549. //        printf(":"); fflush(stdout);
  550.     }
  551. }
  553. static int is_intra_more_likely(MpegEncContext *s){
  554.     int is_intra_likely, i, j, undamaged_count, skip_amount, mb_x, mb_y;
  556.     if(s->last_picture_ptr==NULL) return 1; //no previous frame available -> use spatial prediction
  558.     undamaged_count=0;
  559.     for(i=0; i<s->mb_num; i++){
  560.         const int mb_xy= s->mb_index2xy[i];
  561.         const int error= s->error_status_table[mb_xy];
  562.         if(!((error&DC_ERROR) && (error&MV_ERROR)))
  563.             undamaged_count++;
  564.     }
  566.     if(undamaged_count < 5) return 0; //almost all MBs damaged -> use temporal prediction
  568. #ifdef HAVE_XVMC
  569.     //prevent dsp.sad() check, that requires access to the image
  570.     if(s->avctx->xvmc_acceleration && s->pict_type==FF_I_TYPE) return 1;
  571. #endif
  573.     skip_amount= FFMAX(undamaged_count/50, 1); //check only upto 50 MBs
  574.     is_intra_likely=0;
  576.     j=0;
  577.     for(mb_y= 0; mb_y<s->mb_height-1; mb_y++){
  578.         for(mb_x= 0; mb_x<s->mb_width; mb_x++){
  579.             int error;
  580.             const int mb_xy= mb_x + mb_y*s->mb_stride;
  582.             error= s->error_status_table[mb_xy];
  583.             if((error&DC_ERROR) && (error&MV_ERROR))
  584.                 continue; //skip damaged
  586.             j++;
  587.             if((j%skip_amount) != 0) continue; //skip a few to speed things up
  589.             if(s->pict_type==FF_I_TYPE){
  590.                 uint8_t *mb_ptr     = s->current_picture.data[0] + mb_x*16 + mb_y*16*s->linesize;
  591.                 uint8_t *last_mb_ptr= s->last_picture.data   [0] + mb_x*16 + mb_y*16*s->linesize;
  593.                 is_intra_likely += s->dsp.sad[0](NULL, last_mb_ptr, mb_ptr                    , s->linesize, 16);
  594.                 is_intra_likely -= s->dsp.sad[0](NULL, last_mb_ptr, last_mb_ptr+s->linesize*16, s->linesize, 16);
  595.             }else{
  596.                 if(IS_INTRA(s->current_picture.mb_type[mb_xy]))
  597.                    is_intra_likely++;
  598.                 else
  599.                    is_intra_likely--;
  600.             }
  601.         }
  602.     }
  603. //printf("is_intra_likely: %d type:%dn", is_intra_likely, s->pict_type);
  604.     return is_intra_likely > 0;
  605. }
  607. void ff_er_frame_start(MpegEncContext *s){
  608.     if(!s->error_resilience) return;
  610.     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));
  611.     s->error_count= 3*s->mb_num;
  612. }
  614. /**
  615.  * adds a slice.
  616.  * @param endx x component of the last macroblock, can be -1 for the last of the previous line
  617.  * @param status the status at the end (MV_END, AC_ERROR, ...), it is assumed that no earlier end or
  618.  *               error of the same type occurred
  619.  */
  620. void ff_er_add_slice(MpegEncContext *s, int startx, int starty, int endx, int endy, int status){
  621.     const int start_i= av_clip(startx + starty * s->mb_width    , 0, s->mb_num-1);
  622.     const int end_i  = av_clip(endx   + endy   * s->mb_width    , 0, s->mb_num);
  623.     const int start_xy= s->mb_index2xy[start_i];
  624.     const int end_xy  = s->mb_index2xy[end_i];
  625.     int mask= -1;
  627.     if(start_i > end_i || start_xy > end_xy){
  628.         av_log(s->avctx, AV_LOG_ERROR, "internal error, slice end before startn");
  629.         return;
  630.     }
  632.     if(!s->error_resilience) return;
  634.     mask &= ~VP_START;
  635.     if(status & (AC_ERROR|AC_END)){
  636.         mask &= ~(AC_ERROR|AC_END);
  637.         s->error_count -= end_i - start_i + 1;
  638.     }
  639.     if(status & (DC_ERROR|DC_END)){
  640.         mask &= ~(DC_ERROR|DC_END);
  641.         s->error_count -= end_i - start_i + 1;
  642.     }
  643.     if(status & (MV_ERROR|MV_END)){
  644.         mask &= ~(MV_ERROR|MV_END);
  645.         s->error_count -= end_i - start_i + 1;
  646.     }
  648.     if(status & (AC_ERROR|DC_ERROR|MV_ERROR)) s->error_count= INT_MAX;
  650.     if(mask == ~0x7F){
  651.         memset(&s->error_status_table[start_xy], 0, (end_xy - start_xy) * sizeof(uint8_t));
  652.     }else{
  653.         int i;
  654.         for(i=start_xy; i<end_xy; i++){
  655.             s->error_status_table[ i ] &= mask;
  656.         }
  657.     }
  659.     if(end_i == s->mb_num)
  660.         s->error_count= INT_MAX;
  661.     else{
  662.         s->error_status_table[end_xy] &= mask;
  663.         s->error_status_table[end_xy] |= status;
  664.     }
  666.     s->error_status_table[start_xy] |= VP_START;
  668.     if(start_xy > 0 && s->avctx->thread_count <= 1 && s->avctx->skip_top*s->mb_width < start_i){
  669.         int prev_status= s->error_status_table[ s->mb_index2xy[start_i - 1] ];
  671.         prev_status &= ~ VP_START;
  672.         if(prev_status != (MV_END|DC_END|AC_END)) s->error_count= INT_MAX;
  673.     }
  674. }
  676. void ff_er_frame_end(MpegEncContext *s){
  677.     int i, mb_x, mb_y, error, error_type, dc_error, mv_error, ac_error;
  678.     int distance;
  679.     int threshold_part[4]= {100,100,100};
  680.     int threshold= 50;
  681.     int is_intra_likely;
  682.     int size = s->b8_stride * 2 * s->mb_height;
  683.     Picture *pic= s->current_picture_ptr;
  685.     if(!s->error_resilience || s->error_count==0 ||
  686.        s->error_count==3*s->mb_width*(s->avctx->skip_top + s->avctx->skip_bottom)) return;
  688.     if(s->current_picture.motion_val[0] == NULL){
  689.         av_log(s->avctx, AV_LOG_ERROR, "Warning MVs not availablen");
  691.         for(i=0; i<2; i++){
  692.             pic->ref_index[i]= av_mallocz(size * sizeof(uint8_t));
  693.             pic->motion_val_base[i]= av_mallocz((size+4) * 2 * sizeof(uint16_t));
  694.             pic->motion_val[i]= pic->motion_val_base[i]+4;
  695.         }
  696.         pic->motion_subsample_log2= 3;
  697.         s->current_picture= *s->current_picture_ptr;
  698.     }
  700.     for(i=0; i<2; i++){
  701.         if(pic->ref_index[i])
  702.             memset(pic->ref_index[i], 0, size * sizeof(uint8_t));
  703.     }
  705.     if(s->avctx->debug&FF_DEBUG_ER){
  706.         for(mb_y=0; mb_y<s->mb_height; mb_y++){
  707.             for(mb_x=0; mb_x<s->mb_width; mb_x++){
  708.                 int status= s->error_status_table[mb_x + mb_y*s->mb_stride];
  710.                 av_log(s->avctx, AV_LOG_DEBUG, "%2X ", status);
  711.             }
  712.             av_log(s->avctx, AV_LOG_DEBUG, "n");
  713.         }
  714.     }
  716. #if 1
  717.     /* handle overlapping slices */
  718.     for(error_type=1; error_type<=3; error_type++){
  719.         int end_ok=0;
  721.         for(i=s->mb_num-1; i>=0; i--){
  722.             const int mb_xy= s->mb_index2xy[i];
  723.             int error= s->error_status_table[mb_xy];
  725.             if(error&(1<<error_type))
  726.                 end_ok=1;
  727.             if(error&(8<<error_type))
  728.                 end_ok=1;
  730.             if(!end_ok)
  731.                 s->error_status_table[mb_xy]|= 1<<error_type;
  733.             if(error&VP_START)
  734.                 end_ok=0;
  735.         }
  736.     }
  737. #endif
  738. #if 1
  739.     /* handle slices with partitions of different length */
  740.     if(s->partitioned_frame){
  741.         int end_ok=0;
  743.         for(i=s->mb_num-1; i>=0; i--){
  744.             const int mb_xy= s->mb_index2xy[i];
  745.             int error= s->error_status_table[mb_xy];
  747.             if(error&AC_END)
  748.                 end_ok=0;
  749.             if((error&MV_END) || (error&DC_END) || (error&AC_ERROR))
  750.                 end_ok=1;
  752.             if(!end_ok)
  753.                 s->error_status_table[mb_xy]|= AC_ERROR;
  755.             if(error&VP_START)
  756.                 end_ok=0;
  757.         }
  758.     }
  759. #endif
  760.     /* handle missing slices */
  761.     if(s->error_resilience>=4){
  762.         int end_ok=1;
  764.         for(i=s->mb_num-2; i>=s->mb_width+100; i--){ //FIXME +100 hack
  765.             const int mb_xy= s->mb_index2xy[i];
  766.             int error1= s->error_status_table[mb_xy  ];
  767.             int error2= s->error_status_table[s->mb_index2xy[i+1]];
  769.             if(error1&VP_START)
  770.                 end_ok=1;
  772.             if(   error2==(VP_START|DC_ERROR|AC_ERROR|MV_ERROR|AC_END|DC_END|MV_END)
  773.                && error1!=(VP_START|DC_ERROR|AC_ERROR|MV_ERROR|AC_END|DC_END|MV_END)
  774.                && ((error1&AC_END) || (error1&DC_END) || (error1&MV_END))){ //end & uninit
  775.                 end_ok=0;
  776.             }
  778.             if(!end_ok)
  779.                 s->error_status_table[mb_xy]|= DC_ERROR|AC_ERROR|MV_ERROR;
  780.         }
  781.     }
  783. #if 1
  784.     /* backward mark errors */
  785.     distance=9999999;
  786.     for(error_type=1; error_type<=3; error_type++){
  787.         for(i=s->mb_num-1; i>=0; i--){
  788.             const int mb_xy= s->mb_index2xy[i];
  789.             int error= s->error_status_table[mb_xy];
  791.             if(!s->mbskip_table[mb_xy]) //FIXME partition specific
  792.                 distance++;
  793.             if(error&(1<<error_type))
  794.                 distance= 0;
  796.             if(s->partitioned_frame){
  797.                 if(distance < threshold_part[error_type-1])
  798.                     s->error_status_table[mb_xy]|= 1<<error_type;
  799.             }else{
  800.                 if(distance < threshold)
  801.                     s->error_status_table[mb_xy]|= 1<<error_type;
  802.             }
  804.             if(error&VP_START)
  805.                 distance= 9999999;
  806.         }
  807.     }
  808. #endif
  810.     /* forward mark errors */
  811.     error=0;
  812.     for(i=0; i<s->mb_num; i++){
  813.         const int mb_xy= s->mb_index2xy[i];
  814.         int old_error= s->error_status_table[mb_xy];
  816.         if(old_error&VP_START)
  817.             error= old_error& (DC_ERROR|AC_ERROR|MV_ERROR);
  818.         else{
  819.             error|= old_error& (DC_ERROR|AC_ERROR|MV_ERROR);
  820.             s->error_status_table[mb_xy]|= error;
  821.         }
  822.     }
  823. #if 1
  824.     /* handle not partitioned case */
  825.     if(!s->partitioned_frame){
  826.         for(i=0; i<s->mb_num; i++){
  827.             const int mb_xy= s->mb_index2xy[i];
  828.             error= s->error_status_table[mb_xy];
  829.             if(error&(AC_ERROR|DC_ERROR|MV_ERROR))
  830.                 error|= AC_ERROR|DC_ERROR|MV_ERROR;
  831.             s->error_status_table[mb_xy]= error;
  832.         }
  833.     }
  834. #endif
  836.     dc_error= ac_error= mv_error=0;
  837.     for(i=0; i<s->mb_num; i++){
  838.         const int mb_xy= s->mb_index2xy[i];
  839.         error= s->error_status_table[mb_xy];
  840.         if(error&DC_ERROR) dc_error ++;
  841.         if(error&AC_ERROR) ac_error ++;
  842.         if(error&MV_ERROR) mv_error ++;
  843.     }
  844.     av_log(s->avctx, AV_LOG_INFO, "concealing %d DC, %d AC, %d MV errorsn", dc_error, ac_error, mv_error);
  846.     is_intra_likely= is_intra_more_likely(s);
  848.     /* set unknown mb-type to most likely */
  849.     for(i=0; i<s->mb_num; i++){
  850.         const int mb_xy= s->mb_index2xy[i];
  851.         error= s->error_status_table[mb_xy];
  852.         if(!((error&DC_ERROR) && (error&MV_ERROR)))
  853.             continue;
  855.         if(is_intra_likely)
  856.             s->current_picture.mb_type[mb_xy]= MB_TYPE_INTRA4x4;
  857.         else
  858.             s->current_picture.mb_type[mb_xy]= MB_TYPE_16x16 | MB_TYPE_L0;
  859.     }
  861.     /* handle inter blocks with damaged AC */
  862.     for(mb_y=0; mb_y<s->mb_height; mb_y++){
  863.         for(mb_x=0; mb_x<s->mb_width; mb_x++){
  864.             const int mb_xy= mb_x + mb_y * s->mb_stride;
  865.             const int mb_type= s->current_picture.mb_type[mb_xy];
  866.             error= s->error_status_table[mb_xy];
  868.             if(IS_INTRA(mb_type)) continue; //intra
  869.             if(error&MV_ERROR) continue;              //inter with damaged MV
  870.             if(!(error&AC_ERROR)) continue;           //undamaged inter
  872.             s->mv_dir = MV_DIR_FORWARD;
  873.             s->mb_intra=0;
  874.             s->mb_skipped=0;
  875.             if(IS_8X8(mb_type)){
  876.                 int mb_index= mb_x*2 + mb_y*2*s->b8_stride;
  877.                 int j;
  878.                 s->mv_type = MV_TYPE_8X8;
  879.                 for(j=0; j<4; j++){
  880.                     s->mv[0][j][0] = s->current_picture.motion_val[0][ mb_index + (j&1) + (j>>1)*s->b8_stride ][0];
  881.                     s->mv[0][j][1] = s->current_picture.motion_val[0][ mb_index + (j&1) + (j>>1)*s->b8_stride ][1];
  882.                 }
  883.             }else{
  884.                 s->mv_type = MV_TYPE_16X16;
  885.                 s->mv[0][0][0] = s->current_picture.motion_val[0][ mb_x*2 + mb_y*2*s->b8_stride ][0];
  886.                 s->mv[0][0][1] = s->current_picture.motion_val[0][ mb_x*2 + mb_y*2*s->b8_stride ][1];
  887.             }
  889.             s->dsp.clear_blocks(s->block[0]);
  891.             s->mb_x= mb_x;
  892.             s->mb_y= mb_y;
  893.             decode_mb(s);
  894.         }
  895.     }
  897.     /* guess MVs */
  898.     if(s->pict_type==FF_B_TYPE){
  899.         for(mb_y=0; mb_y<s->mb_height; mb_y++){
  900.             for(mb_x=0; mb_x<s->mb_width; mb_x++){
  901.                 int xy= mb_x*2 + mb_y*2*s->b8_stride;
  902.                 const int mb_xy= mb_x + mb_y * s->mb_stride;
  903.                 const int mb_type= s->current_picture.mb_type[mb_xy];
  904.                 error= s->error_status_table[mb_xy];
  906.                 if(IS_INTRA(mb_type)) continue;
  907.                 if(!(error&MV_ERROR)) continue;           //inter with undamaged MV
  908.                 if(!(error&AC_ERROR)) continue;           //undamaged inter
  910.                 s->mv_dir = MV_DIR_FORWARD|MV_DIR_BACKWARD;
  911.                 s->mb_intra=0;
  912.                 s->mv_type = MV_TYPE_16X16;
  913.                 s->mb_skipped=0;
  915.                 if(s->pp_time){
  916.                     int time_pp= s->pp_time;
  917.                     int time_pb= s->pb_time;
  919.                     s->mv[0][0][0] = s->next_picture.motion_val[0][xy][0]*time_pb/time_pp;
  920.                     s->mv[0][0][1] = s->next_picture.motion_val[0][xy][1]*time_pb/time_pp;
  921.                     s->mv[1][0][0] = s->next_picture.motion_val[0][xy][0]*(time_pb - time_pp)/time_pp;
  922.                     s->mv[1][0][1] = s->next_picture.motion_val[0][xy][1]*(time_pb - time_pp)/time_pp;
  923.                 }else{
  924.                     s->mv[0][0][0]= 0;
  925.                     s->mv[0][0][1]= 0;
  926.                     s->mv[1][0][0]= 0;
  927.                     s->mv[1][0][1]= 0;
  928.                 }
  930.                 s->dsp.clear_blocks(s->block[0]);
  931.                 s->mb_x= mb_x;
  932.                 s->mb_y= mb_y;
  933.                 decode_mb(s);
  934.             }
  935.         }
  936.     }else
  937.         guess_mv(s);
  939. #ifdef HAVE_XVMC
  940.     /* the filters below are not XvMC compatible, skip them */
  941.     if(s->avctx->xvmc_acceleration) goto ec_clean;
  942. #endif
  943.     /* fill DC for inter blocks */
  944.     for(mb_y=0; mb_y<s->mb_height; mb_y++){
  945.         for(mb_x=0; mb_x<s->mb_width; mb_x++){
  946.             int dc, dcu, dcv, y, n;
  947.             int16_t *dc_ptr;
  948.             uint8_t *dest_y, *dest_cb, *dest_cr;
  949.             const int mb_xy= mb_x + mb_y * s->mb_stride;
  950.             const int mb_type= s->current_picture.mb_type[mb_xy];
  952.             error= s->error_status_table[mb_xy];
  954.             if(IS_INTRA(mb_type) && s->partitioned_frame) continue;
  955. //            if(error&MV_ERROR) continue; //inter data damaged FIXME is this good?
  957.             dest_y = s->current_picture.data[0] + mb_x*16 + mb_y*16*s->linesize;
  958.             dest_cb= s->current_picture.data[1] + mb_x*8  + mb_y*8 *s->uvlinesize;
  959.             dest_cr= s->current_picture.data[2] + mb_x*8  + mb_y*8 *s->uvlinesize;
  961.             dc_ptr= &s->dc_val[0][mb_x*2 + mb_y*2*s->b8_stride];
  962.             for(n=0; n<4; n++){
  963.                 dc=0;
  964.                 for(y=0; y<8; y++){
  965.                     int x;
  966.                     for(x=0; x<8; x++){
  967.                        dc+= dest_y[x + (n&1)*8 + (y + (n>>1)*8)*s->linesize];
  968.                     }
  969.                 }
  970.                 dc_ptr[(n&1) + (n>>1)*s->b8_stride]= (dc+4)>>3;
  971.             }
  973.             dcu=dcv=0;
  974.             for(y=0; y<8; y++){
  975.                 int x;
  976.                 for(x=0; x<8; x++){
  977.                     dcu+=dest_cb[x + y*(s->uvlinesize)];
  978.                     dcv+=dest_cr[x + y*(s->uvlinesize)];
  979.                 }
  980.             }
  981.             s->dc_val[1][mb_x + mb_y*s->mb_stride]= (dcu+4)>>3;
  982.             s->dc_val[2][mb_x + mb_y*s->mb_stride]= (dcv+4)>>3;
  983.         }
  984.     }
  985. #if 1
  986.     /* guess DC for damaged blocks */
  987.     guess_dc(s, s->dc_val[0], s->mb_width*2, s->mb_height*2, s->b8_stride, 1);
  988.     guess_dc(s, s->dc_val[1], s->mb_width  , s->mb_height  , s->mb_stride, 0);
  989.     guess_dc(s, s->dc_val[2], s->mb_width  , s->mb_height  , s->mb_stride, 0);
  990. #endif
  991.     /* filter luma DC */
  992.     filter181(s->dc_val[0], s->mb_width*2, s->mb_height*2, s->b8_stride);
  994. #if 1
  995.     /* render DC only intra */
  996.     for(mb_y=0; mb_y<s->mb_height; mb_y++){
  997.         for(mb_x=0; mb_x<s->mb_width; mb_x++){
  998.             uint8_t *dest_y, *dest_cb, *dest_cr;
  999.             const int mb_xy= mb_x + mb_y * s->mb_stride;
  1000.             const int mb_type= s->current_picture.mb_type[mb_xy];
  1002.             error= s->error_status_table[mb_xy];
  1004.             if(IS_INTER(mb_type)) continue;
  1005.             if(!(error&AC_ERROR)) continue;              //undamaged
  1007.             dest_y = s->current_picture.data[0] + mb_x*16 + mb_y*16*s->linesize;
  1008.             dest_cb= s->current_picture.data[1] + mb_x*8  + mb_y*8 *s->uvlinesize;
  1009.             dest_cr= s->current_picture.data[2] + mb_x*8  + mb_y*8 *s->uvlinesize;
  1011.             put_dc(s, dest_y, dest_cb, dest_cr, mb_x, mb_y);
  1012.         }
  1013.     }
  1014. #endif
  1016.     if(s->avctx->error_concealment&FF_EC_DEBLOCK){
  1017.         /* filter horizontal block boundaries */
  1018.         h_block_filter(s, s->current_picture.data[0], s->mb_width*2, s->mb_height*2, s->linesize  , 1);
  1019.         h_block_filter(s, s->current_picture.data[1], s->mb_width  , s->mb_height  , s->uvlinesize, 0);
  1020.         h_block_filter(s, s->current_picture.data[2], s->mb_width  , s->mb_height  , s->uvlinesize, 0);
  1022.         /* filter vertical block boundaries */
  1023.         v_block_filter(s, s->current_picture.data[0], s->mb_width*2, s->mb_height*2, s->linesize  , 1);
  1024.         v_block_filter(s, s->current_picture.data[1], s->mb_width  , s->mb_height  , s->uvlinesize, 0);
  1025.         v_block_filter(s, s->current_picture.data[2], s->mb_width  , s->mb_height  , s->uvlinesize, 0);
  1026.     }
  1028. #ifdef HAVE_XVMC
  1029. ec_clean:
  1030. #endif
  1031.     /* clean a few tables */
  1032.     for(i=0; i<s->mb_num; i++){
  1033.         const int mb_xy= s->mb_index2xy[i];
  1034.         int error= s->error_status_table[mb_xy];
  1036.         if(s->pict_type!=FF_B_TYPE && (error&(DC_ERROR|MV_ERROR|AC_ERROR))){
  1037.             s->mbskip_table[mb_xy]=0;
  1038.         }
  1039.         s->mbintra_table[mb_xy]=1;
  1040.     }
  1041. }