Mercurial > audlegacy-plugins

comparison src/ffmpeg/libavcodec/error_resilience.c @ 808:e8776388b02a trunk

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