move motion_val & mb_type to AVFrame patch by (Wolfgang Hesseler <qv at multimediawar...
[ffmpeg.git] / libavcodec / error_resilience.c
1 /*
2  * Error resilience / concealment
3  *
4  * Copyright (c) 2002 Michael Niedermayer <michaelni@gmx.at>
5  *
6  * This library is free software; you can redistribute it and/or
7  * modify it under the terms of the GNU Lesser General Public
8  * License as published by the Free Software Foundation; either
9  * version 2 of the License, or (at your option) any later version.
10  *
11  * This library is distributed in the hope that it will be useful,
12  * but WITHOUT ANY WARRANTY; without even the implied warranty of
13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
14  * Lesser General Public License for more details.
15  *
16  * You should have received a copy of the GNU Lesser General Public
17  * License along with this library; if not, write to the Free Software
18  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
19  */
20  
21 /**
22  * @file error_resilience.c
23  * Error resilience / concealment.
24  */
25
26 #include <limits.h>
27  
28 #include "avcodec.h"
29 #include "dsputil.h"
30 #include "mpegvideo.h"
31 #include "common.h"
32
33 static void decode_mb(MpegEncContext *s){
34     s->dest[0] = s->current_picture.data[0] + (s->mb_y * 16* s->linesize  ) + s->mb_x * 16;
35     s->dest[1] = s->current_picture.data[1] + (s->mb_y * 8 * s->uvlinesize) + s->mb_x * 8;
36     s->dest[2] = s->current_picture.data[2] + (s->mb_y * 8 * s->uvlinesize) + s->mb_x * 8;
37
38     MPV_decode_mb(s, s->block);    
39 }
40
41 /**
42  * replaces the current MB with a flat dc only version.
43  */
44 static void put_dc(MpegEncContext *s, uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr, int mb_x, int mb_y)
45 {
46     int dc, dcu, dcv, y, i;
47     for(i=0; i<4; i++){
48         dc= s->dc_val[0][mb_x*2+1 + (i&1) + (mb_y*2+1 + (i>>1))*(s->mb_width*2+2)];
49         if(dc<0) dc=0;
50         else if(dc>2040) dc=2040;
51         for(y=0; y<8; y++){
52             int x;
53             for(x=0; x<8; x++){
54                 dest_y[x + (i&1)*8 + (y + (i>>1)*8)*s->linesize]= dc/8;
55             }
56         }
57     }
58     dcu = s->dc_val[1][mb_x+1 + (mb_y+1)*(s->mb_width+2)];
59     dcv = s->dc_val[2][mb_x+1 + (mb_y+1)*(s->mb_width+2)];
60     if     (dcu<0   ) dcu=0;
61     else if(dcu>2040) dcu=2040;
62     if     (dcv<0   ) dcv=0;
63     else if(dcv>2040) dcv=2040;
64     for(y=0; y<8; y++){
65         int x;
66         for(x=0; x<8; x++){
67             dest_cb[x + y*(s->uvlinesize)]= dcu/8;
68             dest_cr[x + y*(s->uvlinesize)]= dcv/8;
69         }
70     }
71 }
72
73 static void filter181(int16_t *data, int width, int height, int stride){
74     int x,y;
75
76     /* horizontal filter */
77     for(y=1; y<height-1; y++){
78         int prev_dc= data[0 + y*stride];
79
80         for(x=1; x<width-1; x++){
81             int dc;
82             
83             dc= - prev_dc 
84                 + data[x     + y*stride]*8
85                 - data[x + 1 + y*stride];
86             dc= (dc*10923 + 32768)>>16;
87             prev_dc= data[x + y*stride];
88             data[x + y*stride]= dc;
89         }
90     }
91     
92     /* vertical filter */
93     for(x=1; x<width-1; x++){
94         int prev_dc= data[x];
95
96         for(y=1; y<height-1; y++){
97             int dc;
98             
99             dc= - prev_dc 
100                 + data[x +  y   *stride]*8
101                 - data[x + (y+1)*stride];
102             dc= (dc*10923 + 32768)>>16;
103             prev_dc= data[x + y*stride];
104             data[x + y*stride]= dc;
105         }
106     }
107 }
108
109 /**
110  * guess the dc of blocks which dont have a undamaged dc
111  * @param w     width in 8 pixel blocks
112  * @param h     height in 8 pixel blocks
113  */
114 static void guess_dc(MpegEncContext *s, int16_t *dc, int w, int h, int stride, int is_luma){
115     int b_x, b_y;
116
117     for(b_y=0; b_y<h; b_y++){
118         for(b_x=0; b_x<w; b_x++){
119             int color[4]={1024,1024,1024,1024};
120             int distance[4]={9999,9999,9999,9999};
121             int mb_index, error, j;
122             int64_t guess, weight_sum;
123             
124             mb_index= (b_x>>is_luma) + (b_y>>is_luma)*s->mb_stride;
125             
126             error= s->error_status_table[mb_index];
127             
128             if(IS_INTER(s->current_picture.mb_type[mb_index])) continue; //inter
129             if(!(error&DC_ERROR)) continue;           //dc-ok
130             
131             /* right block */
132             for(j=b_x+1; j<w; j++){
133                 int mb_index_j= (j>>is_luma) + (b_y>>is_luma)*s->mb_stride;
134                 int error_j= s->error_status_table[mb_index_j];
135                 int intra_j= IS_INTRA(s->current_picture.mb_type[mb_index_j]);
136                 if(intra_j==0 || !(error_j&DC_ERROR)){
137                     color[0]= dc[j + b_y*stride];
138                     distance[0]= j-b_x;
139                     break;
140                 }
141             }
142             
143             /* left block */
144             for(j=b_x-1; j>=0; j--){
145                 int mb_index_j= (j>>is_luma) + (b_y>>is_luma)*s->mb_stride;
146                 int error_j= s->error_status_table[mb_index_j];
147                 int intra_j= IS_INTRA(s->current_picture.mb_type[mb_index_j]);
148                 if(intra_j==0 || !(error_j&DC_ERROR)){
149                     color[1]= dc[j + b_y*stride];
150                     distance[1]= b_x-j;
151                     break;
152                 }
153             }
154
155             /* bottom block */
156             for(j=b_y+1; j<h; j++){
157                 int mb_index_j= (b_x>>is_luma) + (j>>is_luma)*s->mb_stride;
158                 int error_j= s->error_status_table[mb_index_j];
159                 int intra_j= IS_INTRA(s->current_picture.mb_type[mb_index_j]);
160                 if(intra_j==0 || !(error_j&DC_ERROR)){
161                     color[2]= dc[b_x + j*stride];
162                     distance[2]= j-b_y;
163                     break;
164                 }
165             }
166
167             /* top block */
168             for(j=b_y-1; j>=0; j--){
169                 int mb_index_j= (b_x>>is_luma) + (j>>is_luma)*s->mb_stride;
170                 int error_j= s->error_status_table[mb_index_j];
171                 int intra_j= IS_INTRA(s->current_picture.mb_type[mb_index_j]);
172                 if(intra_j==0 || !(error_j&DC_ERROR)){
173                     color[3]= dc[b_x + j*stride];
174                     distance[3]= b_y-j;
175                     break;
176                 }
177             }
178             
179             weight_sum=0;
180             guess=0;
181             for(j=0; j<4; j++){
182                 int64_t weight= 256*256*256*16/distance[j];
183                 guess+= weight*(int64_t)color[j];
184                 weight_sum+= weight;
185             }
186             guess= (guess + weight_sum/2) / weight_sum;
187
188             dc[b_x + b_y*stride]= guess;
189         }
190     }
191 }
192
193 /**
194  * simple horizontal deblocking filter used for error resilience
195  * @param w     width in 8 pixel blocks
196  * @param h     height in 8 pixel blocks
197  */
198 static void h_block_filter(MpegEncContext *s, uint8_t *dst, int w, int h, int stride, int is_luma){
199     int b_x, b_y;
200     uint8_t *cm = cropTbl + MAX_NEG_CROP;
201
202     for(b_y=0; b_y<h; b_y++){
203         for(b_x=0; b_x<w-1; b_x++){
204             int y;
205             int left_status = s->error_status_table[( b_x   >>is_luma) + (b_y>>is_luma)*s->mb_stride];
206             int right_status= s->error_status_table[((b_x+1)>>is_luma) + (b_y>>is_luma)*s->mb_stride];
207             int left_intra=   IS_INTRA(s->current_picture.mb_type      [( b_x   >>is_luma) + (b_y>>is_luma)*s->mb_stride]);
208             int right_intra=  IS_INTRA(s->current_picture.mb_type      [((b_x+1)>>is_luma) + (b_y>>is_luma)*s->mb_stride]);
209             int left_damage =  left_status&(DC_ERROR|AC_ERROR|MV_ERROR);
210             int right_damage= right_status&(DC_ERROR|AC_ERROR|MV_ERROR);
211             int offset= b_x*8 + b_y*stride*8;
212             int16_t *left_mv=  s->current_picture.motion_val[0][s->block_wrap[0]*((b_y<<(1-is_luma)) + 1) + ( b_x   <<(1-is_luma))];
213             int16_t *right_mv= s->current_picture.motion_val[0][s->block_wrap[0]*((b_y<<(1-is_luma)) + 1) + ((b_x+1)<<(1-is_luma))];
214             
215             if(!(left_damage||right_damage)) continue; // both undamaged
216             
217             if(   (!left_intra) && (!right_intra) 
218                && ABS(left_mv[0]-right_mv[0]) + ABS(left_mv[1]+right_mv[1]) < 2) continue;
219             
220             for(y=0; y<8; y++){
221                 int a,b,c,d;
222                 
223                 a= dst[offset + 7 + y*stride] - dst[offset + 6 + y*stride];
224                 b= dst[offset + 8 + y*stride] - dst[offset + 7 + y*stride];
225                 c= dst[offset + 9 + y*stride] - dst[offset + 8 + y*stride];
226                 
227                 d= ABS(b) - ((ABS(a) + ABS(c) + 1)>>1);
228                 d= FFMAX(d, 0);
229                 if(b<0) d= -d;
230                 
231                 if(d==0) continue;
232
233                 if(!(left_damage && right_damage))
234                     d= d*16/9;
235                 
236                 if(left_damage){
237                     dst[offset + 7 + y*stride] = cm[dst[offset + 7 + y*stride] + ((d*7)>>4)];
238                     dst[offset + 6 + y*stride] = cm[dst[offset + 6 + y*stride] + ((d*5)>>4)];
239                     dst[offset + 5 + y*stride] = cm[dst[offset + 5 + y*stride] + ((d*3)>>4)];
240                     dst[offset + 4 + y*stride] = cm[dst[offset + 4 + y*stride] + ((d*1)>>4)];
241                 }
242                 if(right_damage){
243                     dst[offset + 8 + y*stride] = cm[dst[offset + 8 + y*stride] - ((d*7)>>4)];
244                     dst[offset + 9 + y*stride] = cm[dst[offset + 9 + y*stride] - ((d*5)>>4)];
245                     dst[offset + 10+ y*stride] = cm[dst[offset +10 + y*stride] - ((d*3)>>4)];
246                     dst[offset + 11+ y*stride] = cm[dst[offset +11 + y*stride] - ((d*1)>>4)];
247                 }
248             }
249         }
250     }
251 }
252
253 /**
254  * simple vertical deblocking filter used for error resilience
255  * @param w     width in 8 pixel blocks
256  * @param h     height in 8 pixel blocks
257  */
258 static void v_block_filter(MpegEncContext *s, uint8_t *dst, int w, int h, int stride, int is_luma){
259     int b_x, b_y;
260     uint8_t *cm = cropTbl + MAX_NEG_CROP;
261
262     for(b_y=0; b_y<h-1; b_y++){
263         for(b_x=0; b_x<w; b_x++){
264             int x;
265             int top_status   = s->error_status_table[(b_x>>is_luma) + ( b_y   >>is_luma)*s->mb_stride];
266             int bottom_status= s->error_status_table[(b_x>>is_luma) + ((b_y+1)>>is_luma)*s->mb_stride];
267             int top_intra=     IS_INTRA(s->current_picture.mb_type      [(b_x>>is_luma) + ( b_y   >>is_luma)*s->mb_stride]);
268             int bottom_intra=  IS_INTRA(s->current_picture.mb_type      [(b_x>>is_luma) + ((b_y+1)>>is_luma)*s->mb_stride]);
269             int top_damage =      top_status&(DC_ERROR|AC_ERROR|MV_ERROR);
270             int bottom_damage= bottom_status&(DC_ERROR|AC_ERROR|MV_ERROR);
271             int offset= b_x*8 + b_y*stride*8;
272             int16_t *top_mv=    s->current_picture.motion_val[0][s->block_wrap[0]*(( b_y   <<(1-is_luma)) + 1) + (b_x<<(1-is_luma))];
273             int16_t *bottom_mv= s->current_picture.motion_val[0][s->block_wrap[0]*(((b_y+1)<<(1-is_luma)) + 1) + (b_x<<(1-is_luma))];
274             
275             if(!(top_damage||bottom_damage)) continue; // both undamaged
276             
277             if(   (!top_intra) && (!bottom_intra) 
278                && ABS(top_mv[0]-bottom_mv[0]) + ABS(top_mv[1]+bottom_mv[1]) < 2) continue;
279             
280             for(x=0; x<8; x++){
281                 int a,b,c,d;
282                 
283                 a= dst[offset + x + 7*stride] - dst[offset + x + 6*stride];
284                 b= dst[offset + x + 8*stride] - dst[offset + x + 7*stride];
285                 c= dst[offset + x + 9*stride] - dst[offset + x + 8*stride];
286                 
287                 d= ABS(b) - ((ABS(a) + ABS(c)+1)>>1);
288                 d= FFMAX(d, 0);
289                 if(b<0) d= -d;
290                 
291                 if(d==0) continue;
292
293                 if(!(top_damage && bottom_damage))
294                     d= d*16/9;
295                 
296                 if(top_damage){
297                     dst[offset + x +  7*stride] = cm[dst[offset + x +  7*stride] + ((d*7)>>4)];
298                     dst[offset + x +  6*stride] = cm[dst[offset + x +  6*stride] + ((d*5)>>4)];
299                     dst[offset + x +  5*stride] = cm[dst[offset + x +  5*stride] + ((d*3)>>4)];
300                     dst[offset + x +  4*stride] = cm[dst[offset + x +  4*stride] + ((d*1)>>4)];
301                 }
302                 if(bottom_damage){
303                     dst[offset + x +  8*stride] = cm[dst[offset + x +  8*stride] - ((d*7)>>4)];
304                     dst[offset + x +  9*stride] = cm[dst[offset + x +  9*stride] - ((d*5)>>4)];
305                     dst[offset + x + 10*stride] = cm[dst[offset + x + 10*stride] - ((d*3)>>4)];
306                     dst[offset + x + 11*stride] = cm[dst[offset + x + 11*stride] - ((d*1)>>4)];
307                 }
308             }
309         }
310     }
311 }
312
313 static void guess_mv(MpegEncContext *s){
314     uint8_t fixed[s->mb_stride * s->mb_height];
315 #define MV_FROZEN    3
316 #define MV_CHANGED   2
317 #define MV_UNCHANGED 1
318     const int mb_stride = s->mb_stride;
319     const int mb_width = s->mb_width;
320     const int mb_height= s->mb_height;
321     int i, depth, num_avail;
322     int mb_x, mb_y;
323    
324     num_avail=0;
325     for(i=0; i<s->mb_num; i++){
326         const int mb_xy= s->mb_index2xy[ i ];
327         int f=0;
328         int error= s->error_status_table[mb_xy];
329
330         if(IS_INTRA(s->current_picture.mb_type[mb_xy])) f=MV_FROZEN; //intra //FIXME check
331         if(!(error&MV_ERROR)) f=MV_FROZEN;           //inter with undamaged MV
332         
333         fixed[mb_xy]= f;
334         if(f==MV_FROZEN)
335             num_avail++;
336     }
337     
338     if((!(s->avctx->error_concealment&FF_EC_GUESS_MVS)) || num_avail <= mb_width/2){
339         for(mb_y=0; mb_y<s->mb_height; mb_y++){
340             for(mb_x=0; mb_x<s->mb_width; mb_x++){
341                 const int mb_xy= mb_x + mb_y*s->mb_stride;
342                 
343                 if(IS_INTRA(s->current_picture.mb_type[mb_xy]))  continue;
344                 if(!(s->error_status_table[mb_xy]&MV_ERROR)) continue;
345
346                 s->mv_dir = MV_DIR_FORWARD;
347                 s->mb_intra=0;
348                 s->mv_type = MV_TYPE_16X16;
349                 s->mb_skiped=0;
350
351                 s->dsp.clear_blocks(s->block[0]);
352
353                 s->mb_x= mb_x;
354                 s->mb_y= mb_y;
355                 s->mv[0][0][0]= 0;
356                 s->mv[0][0][1]= 0;
357                 decode_mb(s);
358             }
359         }
360         return;
361     }
362     
363     for(depth=0;; depth++){
364         int changed, pass, none_left;
365
366         none_left=1;
367         changed=1;
368         for(pass=0; (changed || pass<2) && pass<10; pass++){
369             int mb_x, mb_y;
370 int score_sum=0;
371  
372             changed=0;
373             for(mb_y=0; mb_y<s->mb_height; mb_y++){
374                 for(mb_x=0; mb_x<s->mb_width; mb_x++){
375                     const int mb_xy= mb_x + mb_y*s->mb_stride;
376                     int mv_predictor[8][2]={{0}};
377                     int pred_count=0;
378                     int j;
379                     int best_score=256*256*256*64;
380                     int best_pred=0;
381                     const int mot_stride= mb_width*2+2;
382                     const int mot_index= mb_x*2 + 1 + (mb_y*2+1)*mot_stride;
383                     int prev_x= s->current_picture.motion_val[0][mot_index][0];
384                     int prev_y= s->current_picture.motion_val[0][mot_index][1];
385
386                     if((mb_x^mb_y^pass)&1) continue;
387                     
388                     if(fixed[mb_xy]==MV_FROZEN) continue;
389                     assert(!IS_INTRA(s->current_picture.mb_type[mb_xy]));
390                     assert(s->last_picture_ptr && s->last_picture_ptr->data[0]);
391                     
392                     j=0;
393                     if(mb_x>0           && fixed[mb_xy-1        ]==MV_FROZEN) j=1;
394                     if(mb_x+1<mb_width  && fixed[mb_xy+1        ]==MV_FROZEN) j=1;
395                     if(mb_y>0           && fixed[mb_xy-mb_stride]==MV_FROZEN) j=1;
396                     if(mb_y+1<mb_height && fixed[mb_xy+mb_stride]==MV_FROZEN) j=1;
397                     if(j==0) continue;
398
399                     j=0;
400                     if(mb_x>0           && fixed[mb_xy-1        ]==MV_CHANGED) j=1;
401                     if(mb_x+1<mb_width  && fixed[mb_xy+1        ]==MV_CHANGED) j=1;
402                     if(mb_y>0           && fixed[mb_xy-mb_stride]==MV_CHANGED) j=1;
403                     if(mb_y+1<mb_height && fixed[mb_xy+mb_stride]==MV_CHANGED) j=1;
404                     if(j==0 && pass>1) continue;
405                     
406                     none_left=0;
407                     
408                     if(mb_x>0 && fixed[mb_xy-1]){
409                         mv_predictor[pred_count][0]= s->current_picture.motion_val[0][mot_index - 2][0];
410                         mv_predictor[pred_count][1]= s->current_picture.motion_val[0][mot_index - 2][1];
411                         pred_count++;
412                     }
413                     if(mb_x+1<mb_width && fixed[mb_xy+1]){
414                         mv_predictor[pred_count][0]= s->current_picture.motion_val[0][mot_index + 2][0];
415                         mv_predictor[pred_count][1]= s->current_picture.motion_val[0][mot_index + 2][1];
416                         pred_count++;
417                     }
418                     if(mb_y>0 && fixed[mb_xy-mb_stride]){
419                         mv_predictor[pred_count][0]= s->current_picture.motion_val[0][mot_index - mot_stride*2][0];
420                         mv_predictor[pred_count][1]= s->current_picture.motion_val[0][mot_index - mot_stride*2][1];
421                         pred_count++;
422                     }
423                     if(mb_y+1<mb_height && fixed[mb_xy+mb_stride]){
424                         mv_predictor[pred_count][0]= s->current_picture.motion_val[0][mot_index + mot_stride*2][0];
425                         mv_predictor[pred_count][1]= s->current_picture.motion_val[0][mot_index + mot_stride*2][1];
426                         pred_count++;
427                     }
428                     if(pred_count==0) continue;
429                     
430                     if(pred_count>1){
431                         int sum_x=0, sum_y=0;
432                         int max_x, max_y, min_x, min_y;
433
434                         for(j=0; j<pred_count; j++){
435                             sum_x+= mv_predictor[j][0];
436                             sum_y+= mv_predictor[j][1];
437                         }
438                     
439                         /* mean */
440                         mv_predictor[pred_count][0] = sum_x/j;
441                         mv_predictor[pred_count][1] = sum_y/j;
442                     
443                         /* median */
444                         if(pred_count>=3){
445                             min_y= min_x= 99999;
446                             max_y= max_x=-99999;
447                         }else{
448                             min_x=min_y=max_x=max_y=0;
449                         }
450                         for(j=0; j<pred_count; j++){
451                             max_x= FFMAX(max_x, mv_predictor[j][0]);
452                             max_y= FFMAX(max_y, mv_predictor[j][1]);
453                             min_x= FFMIN(min_x, mv_predictor[j][0]);
454                             min_y= FFMIN(min_y, mv_predictor[j][1]);
455                         }
456                         mv_predictor[pred_count+1][0] = sum_x - max_x - min_x;
457                         mv_predictor[pred_count+1][1] = sum_y - max_y - min_y;
458                         
459                         if(pred_count==4){
460                             mv_predictor[pred_count+1][0] /= 2;
461                             mv_predictor[pred_count+1][1] /= 2;
462                         }
463                         pred_count+=2;
464                     }
465                     
466                     /* zero MV */
467                     pred_count++;
468
469                     /* last MV */
470                     mv_predictor[pred_count][0]= s->current_picture.motion_val[0][mot_index][0];
471                     mv_predictor[pred_count][1]= s->current_picture.motion_val[0][mot_index][1];
472                     pred_count++;                    
473                     
474                     s->mv_dir = MV_DIR_FORWARD;
475                     s->mb_intra=0;
476                     s->mv_type = MV_TYPE_16X16;
477                     s->mb_skiped=0;
478
479                     s->dsp.clear_blocks(s->block[0]);
480
481                     s->mb_x= mb_x;
482                     s->mb_y= mb_y;
483
484                     for(j=0; j<pred_count; j++){
485                         int score=0;
486                         uint8_t *src= s->current_picture.data[0] + mb_x*16 + mb_y*16*s->linesize;
487
488                         s->current_picture.motion_val[0][mot_index][0]= s->mv[0][0][0]= mv_predictor[j][0];
489                         s->current_picture.motion_val[0][mot_index][1]= s->mv[0][0][1]= mv_predictor[j][1];
490
491                         decode_mb(s);
492                         
493                         if(mb_x>0 && fixed[mb_xy-1]){
494                             int k;
495                             for(k=0; k<16; k++)
496                                 score += ABS(src[k*s->linesize-1 ]-src[k*s->linesize   ]);
497                         }
498                         if(mb_x+1<mb_width && fixed[mb_xy+1]){
499                             int k;
500                             for(k=0; k<16; k++)
501                                 score += ABS(src[k*s->linesize+15]-src[k*s->linesize+16]);
502                         }
503                         if(mb_y>0 && fixed[mb_xy-mb_stride]){
504                             int k;
505                             for(k=0; k<16; k++)
506                                 score += ABS(src[k-s->linesize   ]-src[k               ]);
507                         }
508                         if(mb_y+1<mb_height && fixed[mb_xy+mb_stride]){
509                             int k;
510                             for(k=0; k<16; k++)
511                                 score += ABS(src[k+s->linesize*15]-src[k+s->linesize*16]);
512                         }
513                         
514                         if(score <= best_score){ // <= will favor the last MV
515                             best_score= score;
516                             best_pred= j;
517                         }
518                     }
519 score_sum+= best_score;
520 //FIXME no need to set s->current_picture.motion_val[0][mot_index][0] explicit
521                     s->current_picture.motion_val[0][mot_index][0]= s->mv[0][0][0]= mv_predictor[best_pred][0];
522                     s->current_picture.motion_val[0][mot_index][1]= s->mv[0][0][1]= mv_predictor[best_pred][1];
523
524                     decode_mb(s);
525
526                     
527                     if(s->mv[0][0][0] != prev_x || s->mv[0][0][1] != prev_y){
528                         fixed[mb_xy]=MV_CHANGED;
529                         changed++;
530                     }else
531                         fixed[mb_xy]=MV_UNCHANGED;
532                 }
533             }
534
535 //            printf(".%d/%d", changed, score_sum); fflush(stdout);
536         }
537         
538         if(none_left) 
539             return;
540             
541         for(i=0; i<s->mb_num; i++){
542             int mb_xy= s->mb_index2xy[i];
543             if(fixed[mb_xy])
544                 fixed[mb_xy]=MV_FROZEN;
545         }
546 //        printf(":"); fflush(stdout);
547     }
548 }
549     
550 static int is_intra_more_likely(MpegEncContext *s){
551     int is_intra_likely, i, j, undamaged_count, skip_amount, mb_x, mb_y;
552     
553     if(s->last_picture_ptr==NULL) return 1; //no previous frame available -> use spatial prediction
554
555     undamaged_count=0;
556     for(i=0; i<s->mb_num; i++){
557         const int mb_xy= s->mb_index2xy[i];
558         const int error= s->error_status_table[mb_xy];
559         if(!((error&DC_ERROR) && (error&MV_ERROR)))
560             undamaged_count++;
561     }
562     
563     if(undamaged_count < 5) return 0; //allmost all MBs damaged -> use temporal prediction
564     
565     skip_amount= FFMAX(undamaged_count/50, 1); //check only upto 50 MBs 
566     is_intra_likely=0;
567
568     j=0;
569     for(mb_y= 0; mb_y<s->mb_height-1; mb_y++){
570         for(mb_x= 0; mb_x<s->mb_width; mb_x++){
571             int error;
572             const int mb_xy= mb_x + mb_y*s->mb_stride;
573
574             error= s->error_status_table[mb_xy];
575             if((error&DC_ERROR) && (error&MV_ERROR))
576                 continue; //skip damaged
577         
578             j++;    
579             if((j%skip_amount) != 0) continue; //skip a few to speed things up
580     
581             if(s->pict_type==I_TYPE){
582                 uint8_t *mb_ptr     = s->current_picture.data[0] + mb_x*16 + mb_y*16*s->linesize;
583                 uint8_t *last_mb_ptr= s->last_picture.data   [0] + mb_x*16 + mb_y*16*s->linesize;
584     
585                 is_intra_likely += s->dsp.pix_abs16x16(last_mb_ptr, mb_ptr                    , s->linesize);
586                 is_intra_likely -= s->dsp.pix_abs16x16(last_mb_ptr, last_mb_ptr+s->linesize*16, s->linesize);
587             }else{
588                 if(IS_INTRA(s->current_picture.mb_type[mb_xy]))
589                    is_intra_likely++;
590                 else
591                    is_intra_likely--;
592             }
593         }
594     }
595 //printf("is_intra_likely: %d type:%d\n", is_intra_likely, s->pict_type);
596     return is_intra_likely > 0;    
597 }
598
599 void ff_er_frame_start(MpegEncContext *s){
600     if(!s->error_resilience) return;
601
602     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));
603     s->error_count= 3*s->mb_num;
604 }
605
606 /**
607  * adds a slice.
608  * @param endx x component of the last macroblock, can be -1 for the last of the previous line
609  * @param status the status at the end (MV_END, AC_ERROR, ...), it is assumed that no earlier end or
610  *               error of the same type occured
611  */
612 void ff_er_add_slice(MpegEncContext *s, int startx, int starty, int endx, int endy, int status){
613     const int start_i= clip(startx + starty * s->mb_width    , 0, s->mb_num-1);
614     const int end_i  = clip(endx   + endy   * s->mb_width    , 0, s->mb_num);
615     const int start_xy= s->mb_index2xy[start_i];
616     const int end_xy  = s->mb_index2xy[end_i];
617     int mask= -1;
618     
619     if(!s->error_resilience) return;
620
621     mask &= ~VP_START;
622     if(status & (AC_ERROR|AC_END)){
623         mask &= ~(AC_ERROR|AC_END);
624         s->error_count -= end_i - start_i + 1;
625     }
626     if(status & (DC_ERROR|DC_END)){
627         mask &= ~(DC_ERROR|DC_END);
628         s->error_count -= end_i - start_i + 1;
629     }
630     if(status & (MV_ERROR|MV_END)){
631         mask &= ~(MV_ERROR|MV_END);
632         s->error_count -= end_i - start_i + 1;
633     }
634
635     if(status & (AC_ERROR|DC_ERROR|MV_ERROR)) s->error_count= INT_MAX;
636
637     if(mask == ~0x7F){
638         memset(&s->error_status_table[start_xy], 0, (end_xy - start_xy) * sizeof(uint8_t));
639     }else{
640         int i;
641         for(i=start_xy; i<end_xy; i++){
642             s->error_status_table[ i ] &= mask;
643         }
644     }
645
646     if(end_i == s->mb_num) 
647         s->error_count= INT_MAX;
648     else{
649         s->error_status_table[end_xy] &= mask;
650         s->error_status_table[end_xy] |= status;
651     }
652  
653     s->error_status_table[start_xy] |= VP_START;
654
655     if(start_xy > 0){
656         int prev_status= s->error_status_table[ s->mb_index2xy[start_i - 1] ];
657         
658         prev_status &= ~ VP_START;
659         if(prev_status != (MV_END|DC_END|AC_END)) s->error_count= INT_MAX;
660     }
661 }
662
663 void ff_er_frame_end(MpegEncContext *s){
664     int i, mb_x, mb_y, error, error_type;
665     int distance;
666     int threshold_part[4]= {100,100,100};
667     int threshold= 50;
668     int is_intra_likely;
669     
670     if(!s->error_resilience || s->error_count==0) return;
671
672     av_log(s->avctx, AV_LOG_INFO, "concealing errors\n");
673     
674     if(s->current_picture.motion_val[0] == NULL){
675         int size = (2 * s->mb_width + 2) * (2 * s->mb_height + 2);
676         
677         av_log(s->avctx, AV_LOG_ERROR, "Warning MVs not available\n");
678         
679         s->current_picture.motion_val[0]= av_mallocz(size * 2 * sizeof(int16_t)); //FIXME
680     }
681     
682     if(s->avctx->debug&FF_DEBUG_ER){
683         for(mb_y=0; mb_y<s->mb_height; mb_y++){
684             for(mb_x=0; mb_x<s->mb_width; mb_x++){
685                 int status= s->error_status_table[mb_x + mb_y*s->mb_stride];
686             
687                 av_log(s->avctx, AV_LOG_DEBUG, "%2X ", status); 
688             }
689             av_log(s->avctx, AV_LOG_DEBUG, "\n");
690         }
691     }
692     
693 #if 1
694     /* handle overlapping slices */
695     for(error_type=1; error_type<=3; error_type++){
696         int end_ok=0;
697
698         for(i=s->mb_num-1; i>=0; i--){
699             const int mb_xy= s->mb_index2xy[i];
700             int error= s->error_status_table[mb_xy];
701         
702             if(error&(1<<error_type))
703                 end_ok=1;
704             if(error&(8<<error_type))
705                 end_ok=1;
706
707             if(!end_ok)
708                 s->error_status_table[mb_xy]|= 1<<error_type;
709
710             if(error&VP_START)
711                 end_ok=0;
712         }
713     }
714 #endif
715 #if 1
716     /* handle slices with partitions of different length */
717     if(s->partitioned_frame){
718         int end_ok=0;
719
720         for(i=s->mb_num-1; i>=0; i--){
721             const int mb_xy= s->mb_index2xy[i];
722             int error= s->error_status_table[mb_xy];
723         
724             if(error&AC_END)
725                 end_ok=0;
726             if((error&MV_END) || (error&DC_END) || (error&AC_ERROR))
727                 end_ok=1;
728
729             if(!end_ok)
730                 s->error_status_table[mb_xy]|= AC_ERROR;
731
732             if(error&VP_START)
733                 end_ok=0;
734         }
735     }
736 #endif
737     /* handle missing slices */
738     if(s->error_resilience>=4){
739         int end_ok=1;
740                 
741         for(i=s->mb_num-2; i>=s->mb_width+100; i--){ //FIXME +100 hack
742             const int mb_xy= s->mb_index2xy[i];
743             int error1= s->error_status_table[mb_xy  ];
744             int error2= s->error_status_table[s->mb_index2xy[i+1]];
745         
746             if(error1&VP_START)
747                 end_ok=1;
748              
749             if(   error2==(VP_START|DC_ERROR|AC_ERROR|MV_ERROR|AC_END|DC_END|MV_END)
750                && error1!=(VP_START|DC_ERROR|AC_ERROR|MV_ERROR|AC_END|DC_END|MV_END) 
751                && ((error1&AC_END) || (error1&DC_END) || (error1&MV_END))){ //end & uninited
752                 end_ok=0;
753             }
754         
755             if(!end_ok)
756                 s->error_status_table[mb_xy]|= DC_ERROR|AC_ERROR|MV_ERROR;
757         }
758     }
759     
760 #if 1
761     /* backward mark errors */
762     distance=9999999;
763     for(error_type=1; error_type<=3; error_type++){
764         for(i=s->mb_num-1; i>=0; i--){
765             const int mb_xy= s->mb_index2xy[i];
766             int error= s->error_status_table[mb_xy];
767             
768             if(!s->mbskip_table[mb_xy]) //FIXME partition specific
769                 distance++;            
770             if(error&(1<<error_type))
771                 distance= 0;
772
773             if(s->partitioned_frame){
774                 if(distance < threshold_part[error_type-1])
775                     s->error_status_table[mb_xy]|= 1<<error_type;
776             }else{
777                 if(distance < threshold)
778                     s->error_status_table[mb_xy]|= 1<<error_type;
779             }
780
781             if(error&VP_START)
782                 distance= 9999999;
783         }
784     }
785 #endif
786
787     /* forward mark errors */
788     error=0;
789     for(i=0; i<s->mb_num; i++){
790         const int mb_xy= s->mb_index2xy[i];
791         int old_error= s->error_status_table[mb_xy];
792         
793         if(old_error&VP_START)
794             error= old_error& (DC_ERROR|AC_ERROR|MV_ERROR);
795         else{
796             error|= old_error& (DC_ERROR|AC_ERROR|MV_ERROR);
797             s->error_status_table[mb_xy]|= error;
798         }
799     }
800 #if 1
801     /* handle not partitioned case */
802     if(!s->partitioned_frame){
803         for(i=0; i<s->mb_num; i++){
804             const int mb_xy= s->mb_index2xy[i];
805             error= s->error_status_table[mb_xy];
806             if(error&(AC_ERROR|DC_ERROR|MV_ERROR))
807                 error|= AC_ERROR|DC_ERROR|MV_ERROR;
808             s->error_status_table[mb_xy]= error;
809         }
810     }
811 #endif
812     is_intra_likely= is_intra_more_likely(s);
813
814     /* set unknown mb-type to most likely */
815     for(i=0; i<s->mb_num; i++){
816         const int mb_xy= s->mb_index2xy[i];
817         error= s->error_status_table[mb_xy];
818         if(!((error&DC_ERROR) && (error&MV_ERROR)))
819             continue;
820
821         if(is_intra_likely)
822             s->current_picture.mb_type[mb_xy]= MB_TYPE_INTRA4x4;
823         else
824             s->current_picture.mb_type[mb_xy]= MB_TYPE_16x16 | MB_TYPE_L0;
825     }
826     
827     /* handle inter blocks with damaged AC */
828     for(mb_y=0; mb_y<s->mb_height; mb_y++){
829         for(mb_x=0; mb_x<s->mb_width; mb_x++){
830             const int mb_xy= mb_x + mb_y * s->mb_stride;
831             const int mb_type= s->current_picture.mb_type[mb_xy];
832             error= s->error_status_table[mb_xy];
833
834             if(IS_INTRA(mb_type)) continue; //intra
835             if(error&MV_ERROR) continue;              //inter with damaged MV
836             if(!(error&AC_ERROR)) continue;           //undamaged inter
837             
838             s->mv_dir = MV_DIR_FORWARD;
839             s->mb_intra=0;
840             s->mb_skiped=0;
841             if(IS_8X8(mb_type)){
842                 int mb_index= mb_x*2+1 + (mb_y*2+1)*s->block_wrap[0];
843                 int j;
844                 s->mv_type = MV_TYPE_8X8;
845                 for(j=0; j<4; j++){
846                     s->mv[0][j][0] = s->current_picture.motion_val[0][ mb_index + (j&1) + (j>>1)*s->block_wrap[0] ][0];
847                     s->mv[0][j][1] = s->current_picture.motion_val[0][ mb_index + (j&1) + (j>>1)*s->block_wrap[0] ][1];
848                 }
849             }else{
850                 s->mv_type = MV_TYPE_16X16;
851                 s->mv[0][0][0] = s->current_picture.motion_val[0][ mb_x*2+1 + (mb_y*2+1)*s->block_wrap[0] ][0];
852                 s->mv[0][0][1] = s->current_picture.motion_val[0][ mb_x*2+1 + (mb_y*2+1)*s->block_wrap[0] ][1];
853             }
854         
855             s->dsp.clear_blocks(s->block[0]);
856
857             s->mb_x= mb_x;
858             s->mb_y= mb_y;
859             decode_mb(s);
860         }
861     }
862
863     /* guess MVs */
864     if(s->pict_type==B_TYPE){
865         for(mb_y=0; mb_y<s->mb_height; mb_y++){
866             for(mb_x=0; mb_x<s->mb_width; mb_x++){
867                 int xy= mb_x*2+1 + (mb_y*2+1)*s->block_wrap[0];
868                 const int mb_xy= mb_x + mb_y * s->mb_stride;
869                 const int mb_type= s->current_picture.mb_type[mb_xy];
870                 error= s->error_status_table[mb_xy];
871
872                 if(IS_INTRA(mb_type)) continue;
873                 if(!(error&MV_ERROR)) continue;           //inter with undamaged MV
874                 if(!(error&AC_ERROR)) continue;           //undamaged inter
875             
876                 s->mv_dir = MV_DIR_FORWARD|MV_DIR_BACKWARD;
877                 s->mb_intra=0;
878                 s->mv_type = MV_TYPE_16X16;
879                 s->mb_skiped=0;
880                 
881                 if(s->pp_time){
882                     int time_pp= s->pp_time;
883                     int time_pb= s->pb_time;
884             
885                     s->mv[0][0][0] = s->next_picture.motion_val[0][xy][0]*time_pb/time_pp;
886                     s->mv[0][0][1] = s->next_picture.motion_val[0][xy][1]*time_pb/time_pp;
887                     s->mv[1][0][0] = s->next_picture.motion_val[0][xy][0]*(time_pb - time_pp)/time_pp;
888                     s->mv[1][0][1] = s->next_picture.motion_val[0][xy][1]*(time_pb - time_pp)/time_pp;
889                 }else{
890                     s->mv[0][0][0]= 0;
891                     s->mv[0][0][1]= 0;
892                     s->mv[1][0][0]= 0;
893                     s->mv[1][0][1]= 0;
894                 }
895
896                 s->dsp.clear_blocks(s->block[0]);
897                 s->mb_x= mb_x;
898                 s->mb_y= mb_y;
899                 decode_mb(s);
900             }
901         }
902     }else
903         guess_mv(s);
904
905 #ifdef HAVE_XVMC
906     /* the filters below are not XvMC compatible, skip them */
907     if(s->avctx->xvmc_acceleration) goto ec_clean;
908 #endif
909     /* fill DC for inter blocks */
910     for(mb_y=0; mb_y<s->mb_height; mb_y++){
911         for(mb_x=0; mb_x<s->mb_width; mb_x++){
912             int dc, dcu, dcv, y, n;
913             int16_t *dc_ptr;
914             uint8_t *dest_y, *dest_cb, *dest_cr;
915             const int mb_xy= mb_x + mb_y * s->mb_stride;
916             const int mb_type= s->current_picture.mb_type[mb_xy];
917            
918             error= s->error_status_table[mb_xy];
919
920             if(IS_INTRA(mb_type) && s->partitioned_frame) continue;
921 //            if(error&MV_ERROR) continue; //inter data damaged FIXME is this good?
922             
923             dest_y = s->current_picture.data[0] + mb_x*16 + mb_y*16*s->linesize;
924             dest_cb= s->current_picture.data[1] + mb_x*8  + mb_y*8 *s->uvlinesize;
925             dest_cr= s->current_picture.data[2] + mb_x*8  + mb_y*8 *s->uvlinesize;
926            
927             dc_ptr= &s->dc_val[0][mb_x*2+1 + (mb_y*2+1)*(s->mb_width*2+2)];
928             for(n=0; n<4; n++){
929                 dc=0;
930                 for(y=0; y<8; y++){
931                     int x;
932                     for(x=0; x<8; x++){
933                        dc+= dest_y[x + (n&1)*8 + (y + (n>>1)*8)*s->linesize];
934                     }
935                 }
936                 dc_ptr[(n&1) + (n>>1)*(s->mb_width*2+2)]= (dc+4)>>3;
937             }
938
939             dcu=dcv=0;
940             for(y=0; y<8; y++){
941                 int x;
942                 for(x=0; x<8; x++){
943                     dcu+=dest_cb[x + y*(s->uvlinesize)];
944                     dcv+=dest_cr[x + y*(s->uvlinesize)];
945                 }
946             }
947             s->dc_val[1][mb_x+1 + (mb_y+1)*(s->mb_width+2)]= (dcu+4)>>3;
948             s->dc_val[2][mb_x+1 + (mb_y+1)*(s->mb_width+2)]= (dcv+4)>>3;   
949         }
950     }
951 #if 1
952     /* guess DC for damaged blocks */
953     guess_dc(s, s->dc_val[0] + s->mb_width*2+3, s->mb_width*2, s->mb_height*2, s->mb_width*2+2, 1);
954     guess_dc(s, s->dc_val[1] + s->mb_width  +3, s->mb_width  , s->mb_height  , s->mb_width  +2, 0);
955     guess_dc(s, s->dc_val[2] + s->mb_width  +3, s->mb_width  , s->mb_height  , s->mb_width  +2, 0);
956 #endif   
957     /* filter luma DC */
958     filter181(s->dc_val[0] + s->mb_width*2+3, s->mb_width*2, s->mb_height*2, s->mb_width*2+2);
959     
960 #if 1
961     /* render DC only intra */
962     for(mb_y=0; mb_y<s->mb_height; mb_y++){
963         for(mb_x=0; mb_x<s->mb_width; mb_x++){
964             uint8_t *dest_y, *dest_cb, *dest_cr;
965             const int mb_xy= mb_x + mb_y * s->mb_stride;
966             const int mb_type= s->current_picture.mb_type[mb_xy];
967
968             error= s->error_status_table[mb_xy];
969
970             if(IS_INTER(mb_type)) continue;
971             if(!(error&AC_ERROR)) continue;              //undamaged
972             
973             dest_y = s->current_picture.data[0] + mb_x*16 + mb_y*16*s->linesize;
974             dest_cb= s->current_picture.data[1] + mb_x*8  + mb_y*8 *s->uvlinesize;
975             dest_cr= s->current_picture.data[2] + mb_x*8  + mb_y*8 *s->uvlinesize;
976             
977             put_dc(s, dest_y, dest_cb, dest_cr, mb_x, mb_y);
978         }
979     }
980 #endif
981     
982     if(s->avctx->error_concealment&FF_EC_DEBLOCK){
983         /* filter horizontal block boundaries */
984         h_block_filter(s, s->current_picture.data[0], s->mb_width*2, s->mb_height*2, s->linesize  , 1);
985         h_block_filter(s, s->current_picture.data[1], s->mb_width  , s->mb_height  , s->uvlinesize, 0);
986         h_block_filter(s, s->current_picture.data[2], s->mb_width  , s->mb_height  , s->uvlinesize, 0);
987
988         /* filter vertical block boundaries */
989         v_block_filter(s, s->current_picture.data[0], s->mb_width*2, s->mb_height*2, s->linesize  , 1);
990         v_block_filter(s, s->current_picture.data[1], s->mb_width  , s->mb_height  , s->uvlinesize, 0);
991         v_block_filter(s, s->current_picture.data[2], s->mb_width  , s->mb_height  , s->uvlinesize, 0);
992     }
993
994 #ifdef HAVE_XVMC
995 ec_clean:
996 #endif
997     /* clean a few tables */
998     for(i=0; i<s->mb_num; i++){
999         const int mb_xy= s->mb_index2xy[i];
1000         int error= s->error_status_table[mb_xy];
1001         
1002         if(s->pict_type!=B_TYPE && (error&(DC_ERROR|MV_ERROR|AC_ERROR))){
1003             s->mbskip_table[mb_xy]=0;
1004         }
1005         s->mbintra_table[mb_xy]=1;
1006     }    
1007 }