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

1316 lines
50KB
Raw Blame History 

  1. /*

  2.  * Error resilience / concealment

  3.  *

  4.  * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>

  5.  *

  6.  * This file is part of FFmpeg.

  7.  *

  8.  * FFmpeg is free software; you can redistribute it and/or

  9.  * modify it under the terms of the GNU Lesser General Public

  10.  * License as published by the Free Software Foundation; either

  11.  * version 2.1 of the License, or (at your option) any later version.

  12.  *

  13.  * FFmpeg is distributed in the hope that it will be useful,

  14.  * but WITHOUT ANY WARRANTY; without even the implied warranty of

  15.  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU

  16.  * Lesser General Public License for more details.

  17.  *

  18.  * You should have received a copy of the GNU Lesser General Public

  19.  * License along with FFmpeg; if not, write to the Free Software

  20.  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA

  21.  */

  22. 

  23. /**

  24.  * @file

  25.  * Error resilience / concealment.

  26.  */

  27. 

  28. #include <limits.h>

  29. 

  30. #include "avcodec.h"

  31. #include "dsputil.h"

  32. #include "mpegvideo.h"

  33. #include "h264.h"

  34. #include "rectangle.h"

  35. #include "thread.h"

  36. 

  37. /*

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

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

  40.  */

  41. #undef mb_intra

  42. 

  43. static void decode_mb(MpegEncContext *s, int ref)

  44. {

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

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

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

  48. 

  49.     ff_init_block_index(s);

  50.     ff_update_block_index(s);

  51.     s->dest[1] += (16 >> s->chroma_x_shift) - 8;

  52.     s->dest[2] += (16 >> s->chroma_x_shift) - 8;

  53. 

  54.     if (CONFIG_H264_DECODER && s->codec_id == AV_CODEC_ID_H264) {

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

  56.         h->mb_xy = s->mb_x + s->mb_y * s->mb_stride;

  57.         memset(h->non_zero_count_cache, 0, sizeof(h->non_zero_count_cache));

  58.         av_assert1(ref >= 0);

  59.         /* FIXME: It is possible albeit uncommon that slice references

  60.          * differ between slices. We take the easy approach and ignore

  61.          * it for now. If this turns out to have any relevance in

  62.          * practice then correct remapping should be added. */

  63.         if (ref >= h->ref_count[0])

  64.             ref = 0;

  65.         if (!h->ref_list[0][ref].f.data[0]) {

  66.             av_log(s->avctx, AV_LOG_DEBUG, "Reference not available for error concealing\n");

  67.             ref = 0;

  68.         }

  69.         fill_rectangle(&s->current_picture.f.ref_index[0][4 * h->mb_xy],

  70.                        2, 2, 2, ref, 1);

  71.         fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, ref, 1);

  72.         fill_rectangle(h->mv_cache[0][scan8[0]], 4, 4, 8,

  73.                        pack16to32(s->mv[0][0][0], s->mv[0][0][1]), 4);

  74.         h->mb_mbaff =

  75.         h->mb_field_decoding_flag = 0;

  76.         ff_h264_hl_decode_mb(h);

  77.     } else {

  78.         assert(ref == 0);

  79.         ff_MPV_decode_mb(s, s->block);

  80.     }

  81. }

  82. 

  83. /**

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

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

  86.  */

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

  88. {

  89.     if (s->codec_id == AV_CODEC_ID_H264) {

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

  91.         av_assert0(s->quarter_sample);

  92.         *mv_step = 4;

  93.         *stride  = h->b_stride;

  94.     } else {

  95.         *mv_step = 2;

  96.         *stride  = s->b8_stride;

  97.     }

  98. }

  99. 

  100. /**

  101.  * Replace the current MB with a flat dc-only version.

  102.  */

  103. static void put_dc(MpegEncContext *s, uint8_t *dest_y, uint8_t *dest_cb,

  104.                    uint8_t *dest_cr, int mb_x, int mb_y)

  105. {

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

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

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

  109.         if (dc < 0)

  110.             dc = 0;

  111.         else if (dc > 2040)

  112.             dc = 2040;

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

  114.             int x;

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

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

  117.         }

  118.     }

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

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

  121.     if (dcu < 0)

  122.         dcu = 0;

  123.     else if (dcu > 2040)

  124.         dcu = 2040;

  125.     if (dcv < 0)

  126.         dcv = 0;

  127.     else if (dcv > 2040)

  128.         dcv = 2040;

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

  130.         int x;

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

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

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

  134.         }

  135.     }

  136. }

  137. 

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

  139. {

  140.     int x, y;

  141. 

  142.     /* horizontal filter */

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

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

  145. 

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

  147.             int dc;

  148.             dc = -prev_dc +

  149.                  data[x     + y * stride] * 8 -

  150.                  data[x + 1 + y * stride];

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

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

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

  154.         }

  155.     }

  156. 

  157.     /* vertical filter */

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

  159.         int prev_dc = data[x];

  160. 

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

  162.             int dc;

  163. 

  164.             dc = -prev_dc +

  165.                  data[x +  y      * stride] * 8 -

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

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

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

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

  170.         }

  171.     }

  172. }

  173. 

  174. /**

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

  176.  * @param w     width in 8 pixel blocks

  177.  * @param h     height in 8 pixel blocks

  178.  */

  179. static void guess_dc(MpegEncContext *s, int16_t *dc, int w,

  180.                      int h, int stride, int is_luma)

  181. {

  182.     int b_x, b_y;

  183.     int16_t  (*col )[4] = av_malloc(stride*h*sizeof( int16_t)*4);

  184.     uint32_t (*dist)[4] = av_malloc(stride*h*sizeof(uint32_t)*4);

  185. 

  186.     if(!col || !dist) {

  187.         av_log(s->avctx, AV_LOG_ERROR, "guess_dc() is out of memory\n");

  188.         goto fail;

  189.     }

  190. 

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

  192.         int color= 1024;

  193.         int distance= -1;

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

  195.             int mb_index_j= (b_x>>is_luma) + (b_y>>is_luma)*s->mb_stride;

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

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

  198.             if(intra_j==0 || !(error_j&ER_DC_ERROR)){

  199.                 color= dc[b_x + b_y*stride];

  200.                 distance= b_x;

  201.             }

  202.             col [b_x + b_y*stride][1]= color;

  203.             dist[b_x + b_y*stride][1]= distance >= 0 ? b_x-distance : 9999;

  204.         }

  205.         color= 1024;

  206.         distance= -1;

  207.         for(b_x=w-1; b_x>=0; b_x--){

  208.             int mb_index_j= (b_x>>is_luma) + (b_y>>is_luma)*s->mb_stride;

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

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

  211.             if(intra_j==0 || !(error_j&ER_DC_ERROR)){

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

  213.                 distance= b_x;

  214.             }

  215.             col [b_x + b_y*stride][0]= color;

  216.             dist[b_x + b_y*stride][0]= distance >= 0 ? distance-b_x : 9999;

  217.         }

  218.     }

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

  220.         int color= 1024;

  221.         int distance= -1;

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

  223.             int mb_index_j= (b_x>>is_luma) + (b_y>>is_luma)*s->mb_stride;

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

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

  226.             if(intra_j==0 || !(error_j&ER_DC_ERROR)){

  227.                 color= dc[b_x + b_y*stride];

  228.                 distance= b_y;

  229.             }

  230.             col [b_x + b_y*stride][3]= color;

  231.             dist[b_x + b_y*stride][3]= distance >= 0 ? b_y-distance : 9999;

  232.         }

  233.         color= 1024;

  234.         distance= -1;

  235.         for(b_y=h-1; b_y>=0; b_y--){

  236.             int mb_index_j= (b_x>>is_luma) + (b_y>>is_luma)*s->mb_stride;

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

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

  239.             if(intra_j==0 || !(error_j&ER_DC_ERROR)){

  240.                 color= dc[b_x + b_y*stride];

  241.                 distance= b_y;

  242.             }

  243.             col [b_x + b_y*stride][2]= color;

  244.             dist[b_x + b_y*stride][2]= distance >= 0 ? distance-b_y : 9999;

  245.         }

  246.     }

  247. 

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

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

  250.             int mb_index, error, j;

  251.             int64_t guess, weight_sum;

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

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

  254. 

  255.             if (IS_INTER(s->current_picture.f.mb_type[mb_index]))

  256.                 continue; // inter

  257.             if (!(error & ER_DC_ERROR))

  258.                 continue; // dc-ok

  259. 

  260.             weight_sum = 0;

  261.             guess      = 0;

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

  263.                 int64_t weight  = 256 * 256 * 256 * 16 / FFMAX(dist[b_x + b_y*stride][j], 1);

  264.                 guess          += weight*(int64_t)col[b_x + b_y*stride][j];

  265.                 weight_sum     += weight;

  266.             }

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

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

  269.         }

  270.     }

  271. 

  272. fail:

  273.     av_freep(&col);

  274.     av_freep(&dist);

  275. }

  276. 

  277. /**

  278.  * simple horizontal deblocking filter used for error resilience

  279.  * @param w     width in 8 pixel blocks

  280.  * @param h     height in 8 pixel blocks

  281.  */

  282. static void h_block_filter(MpegEncContext *s, uint8_t *dst, int w,

  283.                            int h, int stride, int is_luma)

  284. {

  285.     int b_x, b_y, mvx_stride, mvy_stride;

  286.     uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;

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

  288.     mvx_stride >>= is_luma;

  289.     mvy_stride *= mvx_stride;

  290. 

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

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

  293.             int y;

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

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

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

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

  298.             int left_damage  = left_status & ER_MB_ERROR;

  299.             int right_damage = right_status & ER_MB_ERROR;

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

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

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

  303.             if (!(left_damage || right_damage))

  304.                 continue; // both undamaged

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

  306.                 FFABS(left_mv[0] - right_mv[0]) +

  307.                 FFABS(left_mv[1] + right_mv[1]) < 2)

  308.                 continue;

  309. 

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

  311.                 int a, b, c, d;

  312. 

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

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

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

  316. 

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

  318.                 d = FFMAX(d, 0);

  319.                 if (b < 0)

  320.                     d = -d;

  321. 

  322.                 if (d == 0)

  323.                     continue;

  324. 

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

  326.                     d = d * 16 / 9;

  327. 

  328.                 if (left_damage) {

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

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

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

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

  333.                 }

  334.                 if (right_damage) {

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

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

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

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

  339.                 }

  340.             }

  341.         }

  342.     }

  343. }

  344. 

  345. /**

  346.  * simple vertical deblocking filter used for error resilience

  347.  * @param w     width in 8 pixel blocks

  348.  * @param h     height in 8 pixel blocks

  349.  */

  350. static void v_block_filter(MpegEncContext *s, uint8_t *dst, int w, int h,

  351.                            int stride, int is_luma)

  352. {

  353.     int b_x, b_y, mvx_stride, mvy_stride;

  354.     uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;

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

  356.     mvx_stride >>= is_luma;

  357.     mvy_stride *= mvx_stride;

  358. 

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

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

  361.             int x;

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

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

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

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

  366.             int top_damage    = top_status & ER_MB_ERROR;

  367.             int bottom_damage = bottom_status & ER_MB_ERROR;

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

  369. 

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

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

  372. 

  373.             if (!(top_damage || bottom_damage))

  374.                 continue; // both undamaged

  375. 

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

  377.                 FFABS(top_mv[0] - bottom_mv[0]) +

  378.                 FFABS(top_mv[1] + bottom_mv[1]) < 2)

  379.                 continue;

  380. 

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

  382.                 int a, b, c, d;

  383. 

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

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

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

  387. 

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

  389.                 d = FFMAX(d, 0);

  390.                 if (b < 0)

  391.                     d = -d;

  392. 

  393.                 if (d == 0)

  394.                     continue;

  395. 

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

  397.                     d = d * 16 / 9;

  398. 

  399.                 if (top_damage) {

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

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

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

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

  404.                 }

  405.                 if (bottom_damage) {

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

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

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

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

  410.                 }

  411.             }

  412.         }

  413.     }

  414. }

  415. 

  416. static void guess_mv(MpegEncContext *s)

  417. {

  418.     uint8_t *fixed = s->er_temp_buffer;

  419. #define MV_FROZEN    3

  420. #define MV_CHANGED   2

  421. #define MV_UNCHANGED 1

  422.     const int mb_stride = s->mb_stride;

  423.     const int mb_width  = s->mb_width;

  424.     const int mb_height = s->mb_height;

  425.     int i, depth, num_avail;

  426.     int mb_x, mb_y, mot_step, mot_stride;

  427. 

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

  429. 

  430.     num_avail = 0;

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

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

  433.         int f = 0;

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

  435. 

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

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

  438.         if (!(error & ER_MV_ERROR))

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

  440. 

  441.         fixed[mb_xy] = f;

  442.         if (f == MV_FROZEN)

  443.             num_avail++;

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

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

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

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

  448.             s->current_picture.f.motion_val[0][mot_index][0]= s->last_picture.f.motion_val[0][mot_index][0];

  449.             s->current_picture.f.motion_val[0][mot_index][1]= s->last_picture.f.motion_val[0][mot_index][1];

  450.             s->current_picture.f.ref_index[0][4*mb_xy]      = s->last_picture.f.ref_index[0][4*mb_xy];

  451.         }

  452.     }

  453. 

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

  455.         num_avail <= mb_width / 2) {

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

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

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

  459. 

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

  461.                     continue;

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

  463.                     continue;

  464. 

  465.                 s->mv_dir     = s->last_picture.f.data[0] ? MV_DIR_FORWARD

  466.                                                           : MV_DIR_BACKWARD;

  467.                 s->mb_intra   = 0;

  468.                 s->mv_type    = MV_TYPE_16X16;

  469.                 s->mb_skipped = 0;

  470. 

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

  472. 

  473.                 s->mb_x        = mb_x;

  474.                 s->mb_y        = mb_y;

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

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

  477.                 decode_mb(s, 0);

  478.             }

  479.         }

  480.         return;

  481.     }

  482. 

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

  484.         int changed, pass, none_left;

  485. 

  486.         none_left = 1;

  487.         changed   = 1;

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

  489.             int mb_x, mb_y;

  490.             int score_sum = 0;

  491. 

  492.             changed = 0;

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

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

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

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

  497.                     int ref[8]             = { 0 };

  498.                     int pred_count         = 0;

  499.                     int j;

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

  501.                     int best_pred          = 0;

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

  503.                     int prev_x, prev_y, prev_ref;

  504. 

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

  506.                         continue;

  507. 

  508.                     if (fixed[mb_xy] == MV_FROZEN)

  509.                         continue;

  510.                     av_assert1(!IS_INTRA(s->current_picture.f.mb_type[mb_xy]));

  511.                     av_assert1(s->last_picture_ptr && s->last_picture_ptr->f.data[0]);

  512. 

  513.                     j = 0;

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

  515.                         j = 1;

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

  517.                         j = 1;

  518.                     if (mb_y > 0             && fixed[mb_xy - mb_stride] == MV_FROZEN)

  519.                         j = 1;

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

  521.                         j = 1;

  522.                     if (j == 0)

  523.                         continue;

  524. 

  525.                     j = 0;

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

  527.                         j = 1;

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

  529.                         j = 1;

  530.                     if (mb_y > 0             && fixed[mb_xy - mb_stride] == MV_CHANGED)

  531.                         j = 1;

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

  533.                         j = 1;

  534.                     if (j == 0 && pass > 1)

  535.                         continue;

  536. 

  537.                     none_left = 0;

  538. 

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

  540.                         mv_predictor[pred_count][0] =

  541.                             s->current_picture.f.motion_val[0][mot_index - mot_step][0];

  542.                         mv_predictor[pred_count][1] =

  543.                             s->current_picture.f.motion_val[0][mot_index - mot_step][1];

  544.                         ref[pred_count] =

  545.                             s->current_picture.f.ref_index[0][4 * (mb_xy - 1)];

  546.                         pred_count++;

  547.                     }

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

  549.                         mv_predictor[pred_count][0] =

  550.                             s->current_picture.f.motion_val[0][mot_index + mot_step][0];

  551.                         mv_predictor[pred_count][1] =

  552.                             s->current_picture.f.motion_val[0][mot_index + mot_step][1];

  553.                         ref[pred_count] =

  554.                             s->current_picture.f.ref_index[0][4 * (mb_xy + 1)];

  555.                         pred_count++;

  556.                     }

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

  558.                         mv_predictor[pred_count][0] =

  559.                             s->current_picture.f.motion_val[0][mot_index - mot_stride * mot_step][0];

  560.                         mv_predictor[pred_count][1] =

  561.                             s->current_picture.f.motion_val[0][mot_index - mot_stride * mot_step][1];

  562.                         ref[pred_count] =

  563.                             s->current_picture.f.ref_index[0][4 * (mb_xy - s->mb_stride)];

  564.                         pred_count++;

  565.                     }

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

  567.                         mv_predictor[pred_count][0] =

  568.                             s->current_picture.f.motion_val[0][mot_index + mot_stride * mot_step][0];

  569.                         mv_predictor[pred_count][1] =

  570.                             s->current_picture.f.motion_val[0][mot_index + mot_stride * mot_step][1];

  571.                         ref[pred_count] =

  572.                             s->current_picture.f.ref_index[0][4 * (mb_xy + s->mb_stride)];

  573.                         pred_count++;

  574.                     }

  575.                     if (pred_count == 0)

  576.                         continue;

  577. 

  578.                     if (pred_count > 1) {

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

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

  581. 

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

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

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

  585.                             sum_r += ref[j];

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

  587.                                 goto skip_mean_and_median;

  588.                         }

  589. 

  590.                         /* mean */

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

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

  593.                                  ref[pred_count]    = sum_r / j;

  594. 

  595.                         /* median */

  596.                         if (pred_count >= 3) {

  597.                             min_y = min_x = min_r =  99999;

  598.                             max_y = max_x = max_r = -99999;

  599.                         } else {

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

  601.                         }

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

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

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

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

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

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

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

  609.                         }

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

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

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

  613. 

  614.                         if (pred_count == 4) {

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

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

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

  618.                         }

  619.                         pred_count += 2;

  620.                     }

  621. 

  622. skip_mean_and_median:

  623.                     /* zero MV */

  624.                     pred_count++;

  625. 

  626.                     if (!fixed[mb_xy] && 0) {

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

  628.                             // FIXME

  629.                         } else {

  630.                             ff_thread_await_progress(&s->last_picture_ptr->f,

  631.                                                      mb_y, 0);

  632.                         }

  633.                         if (!s->last_picture.f.motion_val[0] ||

  634.                             !s->last_picture.f.ref_index[0])

  635.                             goto skip_last_mv;

  636.                         prev_x   = s->last_picture.f.motion_val[0][mot_index][0];

  637.                         prev_y   = s->last_picture.f.motion_val[0][mot_index][1];

  638.                         prev_ref = s->last_picture.f.ref_index[0][4 * mb_xy];

  639.                     } else {

  640.                         prev_x   = s->current_picture.f.motion_val[0][mot_index][0];

  641.                         prev_y   = s->current_picture.f.motion_val[0][mot_index][1];

  642.                         prev_ref = s->current_picture.f.ref_index[0][4 * mb_xy];

  643.                     }

  644. 

  645.                     /* last MV */

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

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

  648.                              ref[pred_count]    = prev_ref;

  649.                     pred_count++;

  650. 

  651. skip_last_mv:

  652.                     s->mv_dir     = MV_DIR_FORWARD;

  653.                     s->mb_intra   = 0;

  654.                     s->mv_type    = MV_TYPE_16X16;

  655.                     s->mb_skipped = 0;

  656. 

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

  658. 

  659.                     s->mb_x = mb_x;

  660.                     s->mb_y = mb_y;

  661. 

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

  663.                         int score = 0;

  664.                         uint8_t *src = s->current_picture.f.data[0] +

  665.                                        mb_x * 16 + mb_y * 16 * s->linesize;

  666. 

  667.                         s->current_picture.f.motion_val[0][mot_index][0] =

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

  669.                         s->current_picture.f.motion_val[0][mot_index][1] =

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

  671. 

  672.                         // predictor intra or otherwise not available

  673.                         if (ref[j] < 0)

  674.                             continue;

  675. 

  676.                         decode_mb(s, ref[j]);

  677. 

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

  679.                             int k;

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

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

  682.                                                src[k * s->linesize]);

  683.                         }

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

  685.                             int k;

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

  687.                                 score += FFABS(src[k * s->linesize + 15] -

  688.                                                src[k * s->linesize + 16]);

  689.                         }

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

  691.                             int k;

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

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

  694.                         }

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

  696.                             int k;

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

  698.                                 score += FFABS(src[k + s->linesize * 15] -

  699.                                                src[k + s->linesize * 16]);

  700.                         }

  701. 

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

  703.                             best_score = score;

  704.                             best_pred  = j;

  705.                         }

  706.                     }

  707.                     score_sum += best_score;

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

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

  710. 

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

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

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

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

  715.                         }

  716. 

  717.                     decode_mb(s, ref[best_pred]);

  718. 

  719. 

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

  721.                         fixed[mb_xy] = MV_CHANGED;

  722.                         changed++;

  723.                     } else

  724.                         fixed[mb_xy] = MV_UNCHANGED;

  725.                 }

  726.             }

  727.         }

  728. 

  729.         if (none_left)

  730.             return;

  731. 

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

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

  734.             if (fixed[mb_xy])

  735.                 fixed[mb_xy] = MV_FROZEN;

  736.         }

  737.     }

  738. }

  739. 

  740. static int is_intra_more_likely(MpegEncContext *s)

  741. {

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

  743. 

  744.     if (!s->last_picture_ptr || !s->last_picture_ptr->f.data[0])

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

  746. 

  747.     undamaged_count = 0;

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

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

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

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

  752.             undamaged_count++;

  753.     }

  754. 

  755.     if (s->codec_id == AV_CODEC_ID_H264) {

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

  757.         if (h->list_count <= 0 || h->ref_count[0] <= 0 ||

  758.             !h->ref_list[0][0].f.data[0])

  759.             return 1;

  760.     }

  761. 

  762.     if (undamaged_count < 5)

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

  764. 

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

  766.     if (CONFIG_MPEG_XVMC_DECODER    &&

  767.         s->avctx->xvmc_acceleration &&

  768.         s->pict_type == AV_PICTURE_TYPE_I)

  769.         return 1;

  770. 

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

  772.     is_intra_likely = 0;

  773. 

  774.     j = 0;

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

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

  777.             int error;

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

  779. 

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

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

  782.                 continue; // skip damaged

  783. 

  784.             j++;

  785.             // skip a few to speed things up

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

  787.                 continue;

  788. 

  789.             if (s->pict_type == AV_PICTURE_TYPE_I) {

  790.                 uint8_t *mb_ptr      = s->current_picture.f.data[0] +

  791.                                        mb_x * 16 + mb_y * 16 * s->linesize;

  792.                 uint8_t *last_mb_ptr = s->last_picture.f.data[0] +

  793.                                        mb_x * 16 + mb_y * 16 * s->linesize;

  794. 

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

  796.                     // FIXME

  797.                 } else {

  798.                     ff_thread_await_progress(&s->last_picture_ptr->f,

  799.                                              mb_y, 0);

  800.                 }

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

  802.                 // FIXME need await_progress() here

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

  804.             } else {

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

  806.                    is_intra_likely++;

  807.                 else

  808.                    is_intra_likely--;

  809.             }

  810.         }

  811.     }

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

  813.     return is_intra_likely > 0;

  814. }

  815. 

  816. void ff_er_frame_start(MpegEncContext *s)

  817. {

  818.     if (!s->err_recognition)

  819.         return;

  820. 

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

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

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

  824.     s->error_occurred = 0;

  825. }

  826. 

  827. /**

  828.  * Add a slice.

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

  830.  *               for the last of the previous line

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

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

  833.  */

  834. void ff_er_add_slice(MpegEncContext *s, int startx, int starty,

  835.                      int endx, int endy, int status)

  836. {

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

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

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

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

  841.     int mask           = -1;

  842. 

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

  844.         return;

  845. 

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

  847.         av_log(s->avctx, AV_LOG_ERROR,

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

  849.         return;

  850.     }

  851. 

  852.     if (!s->err_recognition)

  853.         return;

  854. 

  855.     mask &= ~VP_START;

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

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

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

  859.     }

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

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

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

  863.     }

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

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

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

  867.     }

  868. 

  869.     if (status & ER_MB_ERROR) {

  870.         s->error_occurred = 1;

  871.         s->error_count    = INT_MAX;

  872.     }

  873. 

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

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

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

  877.     } else {

  878.         int i;

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

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

  881.     }

  882. 

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

  884.         s->error_count = INT_MAX;

  885.     else {

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

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

  888.     }

  889. 

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

  891. 

  892.     if (start_xy > 0 && s->avctx->thread_count <= 1 &&

  893.         s->avctx->skip_top * s->mb_width < start_i) {

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

  895. 

  896.         prev_status &= ~ VP_START;

  897.         if (prev_status != (ER_MV_END | ER_DC_END | ER_AC_END))

  898.             s->error_count = INT_MAX;

  899.     }

  900. }

  901. 

  902. void ff_er_frame_end(MpegEncContext *s)

  903. {

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

  905.     int distance;

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

  907.     int threshold = 50;

  908.     int is_intra_likely;

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

  910.     Picture *pic = s->current_picture_ptr;

  911. 

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

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

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

  915.         s->avctx->hwaccel                                              ||

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

  917.         s->picture_structure != PICT_FRAME                             ||

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

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

  920.         return;

  921.     };

  922. 

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

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

  925. 

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

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

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

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

  930.         }

  931.         pic->f.motion_subsample_log2 = 3;

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

  933.     }

  934. 

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

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

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

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

  939. 

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

  941.             }

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

  943.         }

  944.     }

  945. 

  946. #if 1

  947.     /* handle overlapping slices */

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

  949.         int end_ok = 0;

  950. 

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

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

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

  954. 

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

  956.                 end_ok = 1;

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

  958.                 end_ok = 1;

  959. 

  960.             if (!end_ok)

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

  962. 

  963.             if (error & VP_START)

  964.                 end_ok = 0;

  965.         }

  966.     }

  967. #endif

  968. #if 1

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

  970.     if (s->partitioned_frame) {

  971.         int end_ok = 0;

  972. 

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

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

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

  976. 

  977.             if (error & ER_AC_END)

  978.                 end_ok = 0;

  979.             if ((error & ER_MV_END) ||

  980.                 (error & ER_DC_END) ||

  981.                 (error & ER_AC_ERROR))

  982.                 end_ok = 1;

  983. 

  984.             if (!end_ok)

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

  986. 

  987.             if (error & VP_START)

  988.                 end_ok = 0;

  989.         }

  990.     }

  991. #endif

  992.     /* handle missing slices */

  993.     if (s->err_recognition & AV_EF_EXPLODE) {

  994.         int end_ok = 1;

  995. 

  996.         // FIXME + 100 hack

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

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

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

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

  1001. 

  1002.             if (error1 & VP_START)

  1003.                 end_ok = 1;

  1004. 

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

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

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

  1008.                 (error1 & ER_MV_END))) {

  1009.                 // end & uninit

  1010.                 end_ok = 0;

  1011.             }

  1012. 

  1013.             if (!end_ok)

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

  1015.         }

  1016.     }

  1017. 

  1018. #if 1

  1019.     /* backward mark errors */

  1020.     distance = 9999999;

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

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

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

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

  1025. 

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

  1027.                 distance++;

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

  1029.                 distance = 0;

  1030. 

  1031.             if (s->partitioned_frame) {

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

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

  1034.             } else {

  1035.                 if (distance < threshold)

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

  1037.             }

  1038. 

  1039.             if (error & VP_START)

  1040.                 distance = 9999999;

  1041.         }

  1042.     }

  1043. #endif

  1044. 

  1045.     /* forward mark errors */

  1046.     error = 0;

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

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

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

  1050. 

  1051.         if (old_error & VP_START) {

  1052.             error = old_error & ER_MB_ERROR;

  1053.         } else {

  1054.             error |= old_error & ER_MB_ERROR;

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

  1056.         }

  1057.     }

  1058. #if 1

  1059.     /* handle not partitioned case */

  1060.     if (!s->partitioned_frame) {

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

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

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

  1064.             if (error & ER_MB_ERROR)

  1065.                 error |= ER_MB_ERROR;

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

  1067.         }

  1068.     }

  1069. #endif

  1070. 

  1071.     dc_error = ac_error = mv_error = 0;

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

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

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

  1075.         if (error & ER_DC_ERROR)

  1076.             dc_error++;

  1077.         if (error & ER_AC_ERROR)

  1078.             ac_error++;

  1079.         if (error & ER_MV_ERROR)

  1080.             mv_error++;

  1081.     }

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

  1083.            dc_error, ac_error, mv_error, av_get_picture_type_char(s->pict_type));

  1084. 

  1085.     is_intra_likely = is_intra_more_likely(s);

  1086. 

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

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

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

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

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

  1092.             continue;

  1093. 

  1094.         if (is_intra_likely)

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

  1096.         else

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

  1098.     }

  1099. 

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

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

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

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

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

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

  1106.         }

  1107. 

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

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

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

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

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

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

  1114. 

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

  1116. 

  1117.             if (IS_INTRA(mb_type))

  1118.                 continue; // intra

  1119.             if (error & ER_MV_ERROR)

  1120.                 continue; // inter with damaged MV

  1121.             if (!(error & ER_AC_ERROR))

  1122.                 continue; // undamaged inter

  1123. 

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

  1125.             s->mb_intra   = 0;

  1126.             s->mb_skipped = 0;

  1127.             if (IS_8X8(mb_type)) {

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

  1129.                 int j;

  1130.                 s->mv_type = MV_TYPE_8X8;

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

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

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

  1134.                 }

  1135.             } else {

  1136.                 s->mv_type     = MV_TYPE_16X16;

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

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

  1139.             }

  1140. 

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

  1142. 

  1143.             s->mb_x = mb_x;

  1144.             s->mb_y = mb_y;

  1145.             decode_mb(s, 0 /* FIXME h264 partitioned slices need this set */);

  1146.         }

  1147.     }

  1148. 

  1149.     /* guess MVs */

  1150.     if (s->pict_type == AV_PICTURE_TYPE_B) {

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

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

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

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

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

  1156. 

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

  1158. 

  1159.                 if (IS_INTRA(mb_type))

  1160.                     continue;

  1161.                 if (!(error & ER_MV_ERROR))

  1162.                     continue; // inter with undamaged MV

  1163.                 if (!(error & ER_AC_ERROR))

  1164.                     continue; // undamaged inter

  1165. 

  1166.                 s->mv_dir = MV_DIR_FORWARD | MV_DIR_BACKWARD;

  1167.                 if (!s->last_picture.f.data[0])

  1168.                     s->mv_dir &= ~MV_DIR_FORWARD;

  1169.                 if (!s->next_picture.f.data[0])

  1170.                     s->mv_dir &= ~MV_DIR_BACKWARD;

  1171.                 s->mb_intra   = 0;

  1172.                 s->mv_type    = MV_TYPE_16X16;

  1173.                 s->mb_skipped = 0;

  1174. 

  1175.                 if (s->pp_time) {

  1176.                     int time_pp = s->pp_time;

  1177.                     int time_pb = s->pb_time;

  1178. 

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

  1180.                         // FIXME

  1181.                     } else {

  1182.                         ff_thread_await_progress(&s->next_picture_ptr->f, mb_y, 0);

  1183.                     }

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

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

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

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

  1188.                 } else {

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

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

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

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

  1193.                 }

  1194. 

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

  1196.                 s->mb_x = mb_x;

  1197.                 s->mb_y = mb_y;

  1198.                 decode_mb(s, 0);

  1199.             }

  1200.         }

  1201.     } else

  1202.         guess_mv(s);

  1203. 

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

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

  1206.         goto ec_clean;

  1207.     /* fill DC for inter blocks */

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

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

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

  1211.             int16_t *dc_ptr;

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

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

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

  1215. 

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

  1217. 

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

  1219.                 continue;

  1220.             // if (error & ER_MV_ERROR)

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

  1222. 

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

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

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

  1226. 

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

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

  1229.                 dc = 0;

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

  1231.                     int x;

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

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

  1234.                              (y + (n >> 1) * 8) * s->linesize];

  1235.                 }

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

  1237.             }

  1238. 

  1239.             dcu = dcv = 0;

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

  1241.                 int x;

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

  1243.                     dcu += dest_cb[x + y * s->uvlinesize];

  1244.                     dcv += dest_cr[x + y * s->uvlinesize];

  1245.                 }

  1246.             }

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

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

  1249.         }

  1250.     }

  1251. #if 1

  1252.     /* guess DC for damaged blocks */

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

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

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

  1256. #endif

  1257. 

  1258.     /* filter luma DC */

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

  1260. 

  1261. #if 1

  1262.     /* render DC only intra */

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

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

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

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

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

  1268. 

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

  1270. 

  1271.             if (IS_INTER(mb_type))

  1272.                 continue;

  1273.             if (!(error & ER_AC_ERROR))

  1274.                 continue; // undamaged

  1275. 

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

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

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

  1279. 

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

  1281.         }

  1282.     }

  1283. #endif

  1284. 

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

  1286.         /* filter horizontal block boundaries */

  1287.         h_block_filter(s, s->current_picture.f.data[0], s->mb_width * 2,

  1288.                        s->mb_height * 2, s->linesize, 1);

  1289.         h_block_filter(s, s->current_picture.f.data[1], s->mb_width,

  1290.                        s->mb_height  , s->uvlinesize, 0);

  1291.         h_block_filter(s, s->current_picture.f.data[2], s->mb_width,

  1292.                        s->mb_height  , s->uvlinesize, 0);

  1293. 

  1294.         /* filter vertical block boundaries */

  1295.         v_block_filter(s, s->current_picture.f.data[0], s->mb_width * 2,

  1296.                        s->mb_height * 2, s->linesize, 1);

  1297.         v_block_filter(s, s->current_picture.f.data[1], s->mb_width,

  1298.                        s->mb_height  , s->uvlinesize, 0);

  1299.         v_block_filter(s, s->current_picture.f.data[2], s->mb_width,

  1300.                        s->mb_height  , s->uvlinesize, 0);

  1301.     }

  1302. 

  1303. ec_clean:

  1304.     /* clean a few tables */

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

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

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

  1308. 

  1309.         if (s->pict_type != AV_PICTURE_TYPE_B &&

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

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

  1312.         }

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

  1314.     }

  1315. }