2 * Error resilience / concealment
4 * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
6 * This file is part of Libav.
8 * Libav 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.
13 * Libav 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.
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with Libav; if not, write to the Free Software
20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
25 * Error resilience / concealment.
32 #include "mpegvideo.h"
34 #include "rectangle.h"
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
43 static void decode_mb(MpegEncContext *s, int ref)
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);
49 if (CONFIG_H264_DECODER && s->codec_id == CODEC_ID_H264) {
50 H264Context *h = (void*)s;
51 h->mb_xy = s->mb_x + s->mb_y * s->mb_stride;
52 memset(h->non_zero_count_cache, 0, sizeof(h->non_zero_count_cache));
54 /* FIXME: It is possible albeit uncommon that slice references
55 * differ between slices. We take the easy approach and ignore
56 * it for now. If this turns out to have any relevance in
57 * practice then correct remapping should be added. */
58 if (ref >= h->ref_count[0])
60 fill_rectangle(&s->current_picture.f.ref_index[0][4 * h->mb_xy],
62 fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, ref, 1);
63 fill_rectangle(h->mv_cache[0][scan8[0]], 4, 4, 8,
64 pack16to32(s->mv[0][0][0], s->mv[0][0][1]), 4);
66 ff_h264_hl_decode_mb(h);
69 MPV_decode_mb(s, s->block);
74 * @param stride the number of MVs to get to the next row
75 * @param mv_step the number of MVs per row or column in a macroblock
77 static void set_mv_strides(MpegEncContext *s, int *mv_step, int *stride)
79 if (s->codec_id == CODEC_ID_H264) {
80 H264Context *h = (void*)s;
81 assert(s->quarter_sample);
83 *stride = h->b_stride;
86 *stride = s->b8_stride;
91 * Replace the current MB with a flat dc-only version.
93 static void put_dc(MpegEncContext *s, uint8_t *dest_y, uint8_t *dest_cb,
94 uint8_t *dest_cr, int mb_x, int mb_y)
96 int dc, dcu, dcv, y, i;
97 for (i = 0; i < 4; i++) {
98 dc = s->dc_val[0][mb_x * 2 + (i & 1) + (mb_y * 2 + (i >> 1)) * s->b8_stride];
103 for (y = 0; y < 8; y++) {
105 for (x = 0; x < 8; x++)
106 dest_y[x + (i & 1) * 8 + (y + (i >> 1) * 8) * s->linesize] = dc / 8;
109 dcu = s->dc_val[1][mb_x + mb_y * s->mb_stride];
110 dcv = s->dc_val[2][mb_x + mb_y * s->mb_stride];
119 for (y = 0; y < 8; y++) {
121 for (x = 0; x < 8; x++) {
122 dest_cb[x + y * s->uvlinesize] = dcu / 8;
123 dest_cr[x + y * s->uvlinesize] = dcv / 8;
128 static void filter181(int16_t *data, int width, int height, int stride)
132 /* horizontal filter */
133 for (y = 1; y < height - 1; y++) {
134 int prev_dc = data[0 + y * stride];
136 for (x = 1; x < width - 1; x++) {
139 data[x + y * stride] * 8 -
140 data[x + 1 + y * stride];
141 dc = (dc * 10923 + 32768) >> 16;
142 prev_dc = data[x + y * stride];
143 data[x + y * stride] = dc;
147 /* vertical filter */
148 for (x = 1; x < width - 1; x++) {
149 int prev_dc = data[x];
151 for (y = 1; y < height - 1; y++) {
155 data[x + y * stride] * 8 -
156 data[x + (y + 1) * stride];
157 dc = (dc * 10923 + 32768) >> 16;
158 prev_dc = data[x + y * stride];
159 data[x + y * stride] = dc;
165 * guess the dc of blocks which do not have an undamaged dc
166 * @param w width in 8 pixel blocks
167 * @param h height in 8 pixel blocks
169 static void guess_dc(MpegEncContext *s, int16_t *dc, int w,
170 int h, int stride, int is_luma)
174 for (b_y = 0; b_y < h; b_y++) {
175 for (b_x = 0; b_x < w; b_x++) {
176 int color[4] = { 1024, 1024, 1024, 1024 };
177 int distance[4] = { 9999, 9999, 9999, 9999 };
178 int mb_index, error, j;
179 int64_t guess, weight_sum;
180 mb_index = (b_x >> is_luma) + (b_y >> is_luma) * s->mb_stride;
181 error = s->error_status_table[mb_index];
183 if (IS_INTER(s->current_picture.f.mb_type[mb_index]))
185 if (!(error & ER_DC_ERROR))
189 for (j = b_x + 1; j < w; j++) {
190 int mb_index_j = (j >> is_luma) + (b_y >> is_luma) * s->mb_stride;
191 int error_j = s->error_status_table[mb_index_j];
192 int intra_j = IS_INTRA(s->current_picture.f.mb_type[mb_index_j]);
193 if (intra_j == 0 || !(error_j & ER_DC_ERROR)) {
194 color[0] = dc[j + b_y * stride];
195 distance[0] = j - b_x;
201 for (j = b_x - 1; j >= 0; j--) {
202 int mb_index_j = (j >> is_luma) + (b_y >> is_luma) * s->mb_stride;
203 int error_j = s->error_status_table[mb_index_j];
204 int intra_j = IS_INTRA(s->current_picture.f.mb_type[mb_index_j]);
205 if (intra_j == 0 || !(error_j & ER_DC_ERROR)) {
206 color[1] = dc[j + b_y * stride];
207 distance[1] = b_x - j;
213 for (j = b_y + 1; j < h; j++) {
214 int mb_index_j = (b_x >> is_luma) + (j >> is_luma) * s->mb_stride;
215 int error_j = s->error_status_table[mb_index_j];
216 int intra_j = IS_INTRA(s->current_picture.f.mb_type[mb_index_j]);
218 if (intra_j == 0 || !(error_j & ER_DC_ERROR)) {
219 color[2] = dc[b_x + j * stride];
220 distance[2] = j - b_y;
226 for (j = b_y - 1; j >= 0; j--) {
227 int mb_index_j = (b_x >> is_luma) + (j >> is_luma) * s->mb_stride;
228 int error_j = s->error_status_table[mb_index_j];
229 int intra_j = IS_INTRA(s->current_picture.f.mb_type[mb_index_j]);
230 if (intra_j == 0 || !(error_j & ER_DC_ERROR)) {
231 color[3] = dc[b_x + j * stride];
232 distance[3] = b_y - j;
239 for (j = 0; j < 4; j++) {
240 int64_t weight = 256 * 256 * 256 * 16 / distance[j];
241 guess += weight * (int64_t) color[j];
242 weight_sum += weight;
244 guess = (guess + weight_sum / 2) / weight_sum;
245 dc[b_x + b_y * stride] = guess;
251 * simple horizontal deblocking filter used for error resilience
252 * @param w width in 8 pixel blocks
253 * @param h height in 8 pixel blocks
255 static void h_block_filter(MpegEncContext *s, uint8_t *dst, int w,
256 int h, int stride, int is_luma)
258 int b_x, b_y, mvx_stride, mvy_stride;
259 uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;
260 set_mv_strides(s, &mvx_stride, &mvy_stride);
261 mvx_stride >>= is_luma;
262 mvy_stride *= mvx_stride;
264 for (b_y = 0; b_y < h; b_y++) {
265 for (b_x = 0; b_x < w - 1; b_x++) {
267 int left_status = s->error_status_table[( b_x >> is_luma) + (b_y >> is_luma) * s->mb_stride];
268 int right_status = s->error_status_table[((b_x + 1) >> is_luma) + (b_y >> is_luma) * s->mb_stride];
269 int left_intra = IS_INTRA(s->current_picture.f.mb_type[( b_x >> is_luma) + (b_y >> is_luma) * s->mb_stride]);
270 int right_intra = IS_INTRA(s->current_picture.f.mb_type[((b_x + 1) >> is_luma) + (b_y >> is_luma) * s->mb_stride]);
271 int left_damage = left_status & ER_MB_ERROR;
272 int right_damage = right_status & ER_MB_ERROR;
273 int offset = b_x * 8 + b_y * stride * 8;
274 int16_t *left_mv = s->current_picture.f.motion_val[0][mvy_stride * b_y + mvx_stride * b_x];
275 int16_t *right_mv = s->current_picture.f.motion_val[0][mvy_stride * b_y + mvx_stride * (b_x + 1)];
276 if (!(left_damage || right_damage))
277 continue; // both undamaged
278 if ((!left_intra) && (!right_intra) &&
279 FFABS(left_mv[0] - right_mv[0]) +
280 FFABS(left_mv[1] + right_mv[1]) < 2)
283 for (y = 0; y < 8; y++) {
286 a = dst[offset + 7 + y * stride] - dst[offset + 6 + y * stride];
287 b = dst[offset + 8 + y * stride] - dst[offset + 7 + y * stride];
288 c = dst[offset + 9 + y * stride] - dst[offset + 8 + y * stride];
290 d = FFABS(b) - ((FFABS(a) + FFABS(c) + 1) >> 1);
298 if (!(left_damage && right_damage))
302 dst[offset + 7 + y * stride] = cm[dst[offset + 7 + y * stride] + ((d * 7) >> 4)];
303 dst[offset + 6 + y * stride] = cm[dst[offset + 6 + y * stride] + ((d * 5) >> 4)];
304 dst[offset + 5 + y * stride] = cm[dst[offset + 5 + y * stride] + ((d * 3) >> 4)];
305 dst[offset + 4 + y * stride] = cm[dst[offset + 4 + y * stride] + ((d * 1) >> 4)];
308 dst[offset + 8 + y * stride] = cm[dst[offset + 8 + y * stride] - ((d * 7) >> 4)];
309 dst[offset + 9 + y * stride] = cm[dst[offset + 9 + y * stride] - ((d * 5) >> 4)];
310 dst[offset + 10+ y * stride] = cm[dst[offset + 10 + y * stride] - ((d * 3) >> 4)];
311 dst[offset + 11+ y * stride] = cm[dst[offset + 11 + y * stride] - ((d * 1) >> 4)];
319 * simple vertical deblocking filter used for error resilience
320 * @param w width in 8 pixel blocks
321 * @param h height in 8 pixel blocks
323 static void v_block_filter(MpegEncContext *s, uint8_t *dst, int w, int h,
324 int stride, int is_luma)
326 int b_x, b_y, mvx_stride, mvy_stride;
327 uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;
328 set_mv_strides(s, &mvx_stride, &mvy_stride);
329 mvx_stride >>= is_luma;
330 mvy_stride *= mvx_stride;
332 for (b_y = 0; b_y < h - 1; b_y++) {
333 for (b_x = 0; b_x < w; b_x++) {
335 int top_status = s->error_status_table[(b_x >> is_luma) + (b_y >> is_luma) * s->mb_stride];
336 int bottom_status = s->error_status_table[(b_x >> is_luma) + ((b_y + 1) >> is_luma) * s->mb_stride];
337 int top_intra = IS_INTRA(s->current_picture.f.mb_type[(b_x >> is_luma) + ( b_y >> is_luma) * s->mb_stride]);
338 int bottom_intra = IS_INTRA(s->current_picture.f.mb_type[(b_x >> is_luma) + ((b_y + 1) >> is_luma) * s->mb_stride]);
339 int top_damage = top_status & ER_MB_ERROR;
340 int bottom_damage = bottom_status & ER_MB_ERROR;
341 int offset = b_x * 8 + b_y * stride * 8;
343 int16_t *top_mv = s->current_picture.f.motion_val[0][mvy_stride * b_y + mvx_stride * b_x];
344 int16_t *bottom_mv = s->current_picture.f.motion_val[0][mvy_stride * (b_y + 1) + mvx_stride * b_x];
346 if (!(top_damage || bottom_damage))
347 continue; // both undamaged
349 if ((!top_intra) && (!bottom_intra) &&
350 FFABS(top_mv[0] - bottom_mv[0]) +
351 FFABS(top_mv[1] + bottom_mv[1]) < 2)
354 for (x = 0; x < 8; x++) {
357 a = dst[offset + x + 7 * stride] - dst[offset + x + 6 * stride];
358 b = dst[offset + x + 8 * stride] - dst[offset + x + 7 * stride];
359 c = dst[offset + x + 9 * stride] - dst[offset + x + 8 * stride];
361 d = FFABS(b) - ((FFABS(a) + FFABS(c) + 1) >> 1);
369 if (!(top_damage && bottom_damage))
373 dst[offset + x + 7 * stride] = cm[dst[offset + x + 7 * stride] + ((d * 7) >> 4)];
374 dst[offset + x + 6 * stride] = cm[dst[offset + x + 6 * stride] + ((d * 5) >> 4)];
375 dst[offset + x + 5 * stride] = cm[dst[offset + x + 5 * stride] + ((d * 3) >> 4)];
376 dst[offset + x + 4 * stride] = cm[dst[offset + x + 4 * stride] + ((d * 1) >> 4)];
379 dst[offset + x + 8 * stride] = cm[dst[offset + x + 8 * stride] - ((d * 7) >> 4)];
380 dst[offset + x + 9 * stride] = cm[dst[offset + x + 9 * stride] - ((d * 5) >> 4)];
381 dst[offset + x + 10 * stride] = cm[dst[offset + x + 10 * stride] - ((d * 3) >> 4)];
382 dst[offset + x + 11 * stride] = cm[dst[offset + x + 11 * stride] - ((d * 1) >> 4)];
389 static void guess_mv(MpegEncContext *s)
391 uint8_t fixed[s->mb_stride * s->mb_height];
394 #define MV_UNCHANGED 1
395 const int mb_stride = s->mb_stride;
396 const int mb_width = s->mb_width;
397 const int mb_height = s->mb_height;
398 int i, depth, num_avail;
399 int mb_x, mb_y, mot_step, mot_stride;
401 set_mv_strides(s, &mot_step, &mot_stride);
404 for (i = 0; i < s->mb_num; i++) {
405 const int mb_xy = s->mb_index2xy[i];
407 int error = s->error_status_table[mb_xy];
409 if (IS_INTRA(s->current_picture.f.mb_type[mb_xy]))
410 f = MV_FROZEN; // intra // FIXME check
411 if (!(error & ER_MV_ERROR))
412 f = MV_FROZEN; // inter with undamaged MV
419 if ((!(s->avctx->error_concealment&FF_EC_GUESS_MVS)) ||
420 num_avail <= mb_width / 2) {
421 for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
422 for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
423 const int mb_xy = mb_x + mb_y * s->mb_stride;
425 if (IS_INTRA(s->current_picture.f.mb_type[mb_xy]))
427 if (!(s->error_status_table[mb_xy] & ER_MV_ERROR))
430 s->mv_dir = s->last_picture.f.data[0] ? MV_DIR_FORWARD
433 s->mv_type = MV_TYPE_16X16;
436 s->dsp.clear_blocks(s->block[0]);
448 for (depth = 0; ; depth++) {
449 int changed, pass, none_left;
453 for (pass = 0; (changed || pass < 2) && pass < 10; pass++) {
458 for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
459 for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
460 const int mb_xy = mb_x + mb_y * s->mb_stride;
461 int mv_predictor[8][2] = { { 0 } };
465 int best_score = 256 * 256 * 256 * 64;
467 const int mot_index = (mb_x + mb_y * mot_stride) * mot_step;
468 int prev_x, prev_y, prev_ref;
470 if ((mb_x ^ mb_y ^ pass) & 1)
473 if (fixed[mb_xy] == MV_FROZEN)
475 assert(!IS_INTRA(s->current_picture.f.mb_type[mb_xy]));
476 assert(s->last_picture_ptr && s->last_picture_ptr->f.data[0]);
479 if (mb_x > 0 && fixed[mb_xy - 1] == MV_FROZEN)
481 if (mb_x + 1 < mb_width && fixed[mb_xy + 1] == MV_FROZEN)
483 if (mb_y > 0 && fixed[mb_xy - mb_stride] == MV_FROZEN)
485 if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride] == MV_FROZEN)
491 if (mb_x > 0 && fixed[mb_xy - 1 ] == MV_CHANGED)
493 if (mb_x + 1 < mb_width && fixed[mb_xy + 1 ] == MV_CHANGED)
495 if (mb_y > 0 && fixed[mb_xy - mb_stride] == MV_CHANGED)
497 if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride] == MV_CHANGED)
499 if (j == 0 && pass > 1)
504 if (mb_x > 0 && fixed[mb_xy - 1]) {
505 mv_predictor[pred_count][0] =
506 s->current_picture.f.motion_val[0][mot_index - mot_step][0];
507 mv_predictor[pred_count][1] =
508 s->current_picture.f.motion_val[0][mot_index - mot_step][1];
510 s->current_picture.f.ref_index[0][4 * (mb_xy - 1)];
513 if (mb_x + 1 < mb_width && fixed[mb_xy + 1]) {
514 mv_predictor[pred_count][0] =
515 s->current_picture.f.motion_val[0][mot_index + mot_step][0];
516 mv_predictor[pred_count][1] =
517 s->current_picture.f.motion_val[0][mot_index + mot_step][1];
519 s->current_picture.f.ref_index[0][4 * (mb_xy + 1)];
522 if (mb_y > 0 && fixed[mb_xy - mb_stride]) {
523 mv_predictor[pred_count][0] =
524 s->current_picture.f.motion_val[0][mot_index - mot_stride * mot_step][0];
525 mv_predictor[pred_count][1] =
526 s->current_picture.f.motion_val[0][mot_index - mot_stride * mot_step][1];
528 s->current_picture.f.ref_index[0][4 * (mb_xy - s->mb_stride)];
531 if (mb_y + 1<mb_height && fixed[mb_xy + mb_stride]) {
532 mv_predictor[pred_count][0] =
533 s->current_picture.f.motion_val[0][mot_index + mot_stride * mot_step][0];
534 mv_predictor[pred_count][1] =
535 s->current_picture.f.motion_val[0][mot_index + mot_stride * mot_step][1];
537 s->current_picture.f.ref_index[0][4 * (mb_xy + s->mb_stride)];
543 if (pred_count > 1) {
544 int sum_x = 0, sum_y = 0, sum_r = 0;
545 int max_x, max_y, min_x, min_y, max_r, min_r;
547 for (j = 0; j < pred_count; j++) {
548 sum_x += mv_predictor[j][0];
549 sum_y += mv_predictor[j][1];
551 if (j && ref[j] != ref[j - 1])
552 goto skip_mean_and_median;
556 mv_predictor[pred_count][0] = sum_x / j;
557 mv_predictor[pred_count][1] = sum_y / j;
558 ref[pred_count] = sum_r / j;
561 if (pred_count >= 3) {
562 min_y = min_x = min_r = 99999;
563 max_y = max_x = max_r = -99999;
565 min_x = min_y = max_x = max_y = min_r = max_r = 0;
567 for (j = 0; j < pred_count; j++) {
568 max_x = FFMAX(max_x, mv_predictor[j][0]);
569 max_y = FFMAX(max_y, mv_predictor[j][1]);
570 max_r = FFMAX(max_r, ref[j]);
571 min_x = FFMIN(min_x, mv_predictor[j][0]);
572 min_y = FFMIN(min_y, mv_predictor[j][1]);
573 min_r = FFMIN(min_r, ref[j]);
575 mv_predictor[pred_count + 1][0] = sum_x - max_x - min_x;
576 mv_predictor[pred_count + 1][1] = sum_y - max_y - min_y;
577 ref[pred_count + 1] = sum_r - max_r - min_r;
579 if (pred_count == 4) {
580 mv_predictor[pred_count + 1][0] /= 2;
581 mv_predictor[pred_count + 1][1] /= 2;
582 ref[pred_count + 1] /= 2;
587 skip_mean_and_median:
592 if (s->avctx->codec_id == CODEC_ID_H264) {
595 ff_thread_await_progress((AVFrame *) s->last_picture_ptr,
598 if (!s->last_picture.f.motion_val[0] ||
599 !s->last_picture.f.ref_index[0])
601 prev_x = s->last_picture.f.motion_val[0][mot_index][0];
602 prev_y = s->last_picture.f.motion_val[0][mot_index][1];
603 prev_ref = s->last_picture.f.ref_index[0][4 * mb_xy];
605 prev_x = s->current_picture.f.motion_val[0][mot_index][0];
606 prev_y = s->current_picture.f.motion_val[0][mot_index][1];
607 prev_ref = s->current_picture.f.ref_index[0][4 * mb_xy];
611 mv_predictor[pred_count][0] = prev_x;
612 mv_predictor[pred_count][1] = prev_y;
613 ref[pred_count] = prev_ref;
617 s->mv_dir = MV_DIR_FORWARD;
619 s->mv_type = MV_TYPE_16X16;
622 s->dsp.clear_blocks(s->block[0]);
627 for (j = 0; j < pred_count; j++) {
629 uint8_t *src = s->current_picture.f.data[0] +
630 mb_x * 16 + mb_y * 16 * s->linesize;
632 s->current_picture.f.motion_val[0][mot_index][0] =
633 s->mv[0][0][0] = mv_predictor[j][0];
634 s->current_picture.f.motion_val[0][mot_index][1] =
635 s->mv[0][0][1] = mv_predictor[j][1];
637 // predictor intra or otherwise not available
641 decode_mb(s, ref[j]);
643 if (mb_x > 0 && fixed[mb_xy - 1]) {
645 for (k = 0; k < 16; k++)
646 score += FFABS(src[k * s->linesize - 1] -
647 src[k * s->linesize]);
649 if (mb_x + 1 < mb_width && fixed[mb_xy + 1]) {
651 for (k = 0; k < 16; k++)
652 score += FFABS(src[k * s->linesize + 15] -
653 src[k * s->linesize + 16]);
655 if (mb_y > 0 && fixed[mb_xy - mb_stride]) {
657 for (k = 0; k < 16; k++)
658 score += FFABS(src[k - s->linesize] - src[k]);
660 if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride]) {
662 for (k = 0; k < 16; k++)
663 score += FFABS(src[k + s->linesize * 15] -
664 src[k + s->linesize * 16]);
667 if (score <= best_score) { // <= will favor the last MV
672 score_sum += best_score;
673 s->mv[0][0][0] = mv_predictor[best_pred][0];
674 s->mv[0][0][1] = mv_predictor[best_pred][1];
676 for (i = 0; i < mot_step; i++)
677 for (j = 0; j < mot_step; j++) {
678 s->current_picture.f.motion_val[0][mot_index + i + j * mot_stride][0] = s->mv[0][0][0];
679 s->current_picture.f.motion_val[0][mot_index + i + j * mot_stride][1] = s->mv[0][0][1];
682 decode_mb(s, ref[best_pred]);
685 if (s->mv[0][0][0] != prev_x || s->mv[0][0][1] != prev_y) {
686 fixed[mb_xy] = MV_CHANGED;
689 fixed[mb_xy] = MV_UNCHANGED;
693 // printf(".%d/%d", changed, score_sum); fflush(stdout);
699 for (i = 0; i < s->mb_num; i++) {
700 int mb_xy = s->mb_index2xy[i];
702 fixed[mb_xy] = MV_FROZEN;
704 // printf(":"); fflush(stdout);
708 static int is_intra_more_likely(MpegEncContext *s)
710 int is_intra_likely, i, j, undamaged_count, skip_amount, mb_x, mb_y;
712 if (!s->last_picture_ptr || !s->last_picture_ptr->f.data[0])
713 return 1; // no previous frame available -> use spatial prediction
716 for (i = 0; i < s->mb_num; i++) {
717 const int mb_xy = s->mb_index2xy[i];
718 const int error = s->error_status_table[mb_xy];
719 if (!((error & ER_DC_ERROR) && (error & ER_MV_ERROR)))
723 if (s->codec_id == CODEC_ID_H264) {
724 H264Context *h = (void*) s;
725 if (h->list_count <= 0 || h->ref_count[0] <= 0 ||
726 !h->ref_list[0][0].f.data[0])
730 if (undamaged_count < 5)
731 return 0; // almost all MBs damaged -> use temporal prediction
733 // prevent dsp.sad() check, that requires access to the image
734 if (CONFIG_MPEG_XVMC_DECODER &&
735 s->avctx->xvmc_acceleration &&
736 s->pict_type == AV_PICTURE_TYPE_I)
739 skip_amount = FFMAX(undamaged_count / 50, 1); // check only up to 50 MBs
743 for (mb_y = 0; mb_y < s->mb_height - 1; mb_y++) {
744 for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
746 const int mb_xy = mb_x + mb_y * s->mb_stride;
748 error = s->error_status_table[mb_xy];
749 if ((error & ER_DC_ERROR) && (error & ER_MV_ERROR))
750 continue; // skip damaged
753 // skip a few to speed things up
754 if ((j % skip_amount) != 0)
757 if (s->pict_type == AV_PICTURE_TYPE_I) {
758 uint8_t *mb_ptr = s->current_picture.f.data[0] +
759 mb_x * 16 + mb_y * 16 * s->linesize;
760 uint8_t *last_mb_ptr = s->last_picture.f.data[0] +
761 mb_x * 16 + mb_y * 16 * s->linesize;
763 if (s->avctx->codec_id == CODEC_ID_H264) {
766 ff_thread_await_progress((AVFrame *) s->last_picture_ptr,
769 is_intra_likely += s->dsp.sad[0](NULL, last_mb_ptr, mb_ptr,
771 is_intra_likely -= s->dsp.sad[0](NULL, last_mb_ptr,
772 last_mb_ptr + s->linesize * 16,
775 if (IS_INTRA(s->current_picture.f.mb_type[mb_xy]))
782 // printf("is_intra_likely: %d type:%d\n", is_intra_likely, s->pict_type);
783 return is_intra_likely > 0;
786 void ff_er_frame_start(MpegEncContext *s)
788 if (!s->err_recognition)
791 memset(s->error_status_table, ER_MB_ERROR | VP_START | ER_MB_END,
792 s->mb_stride * s->mb_height * sizeof(uint8_t));
793 s->error_count = 3 * s->mb_num;
794 s->error_occurred = 0;
799 * @param endx x component of the last macroblock, can be -1
800 * for the last of the previous line
801 * @param status the status at the end (ER_MV_END, ER_AC_ERROR, ...), it is
802 * assumed that no earlier end or error of the same type occurred
804 void ff_er_add_slice(MpegEncContext *s, int startx, int starty,
805 int endx, int endy, int status)
807 const int start_i = av_clip(startx + starty * s->mb_width, 0, s->mb_num - 1);
808 const int end_i = av_clip(endx + endy * s->mb_width, 0, s->mb_num);
809 const int start_xy = s->mb_index2xy[start_i];
810 const int end_xy = s->mb_index2xy[end_i];
813 if (s->avctx->hwaccel)
816 if (start_i > end_i || start_xy > end_xy) {
817 av_log(s->avctx, AV_LOG_ERROR,
818 "internal error, slice end before start\n");
822 if (!s->err_recognition)
826 if (status & (ER_AC_ERROR | ER_AC_END)) {
827 mask &= ~(ER_AC_ERROR | ER_AC_END);
828 s->error_count -= end_i - start_i + 1;
830 if (status & (ER_DC_ERROR | ER_DC_END)) {
831 mask &= ~(ER_DC_ERROR | ER_DC_END);
832 s->error_count -= end_i - start_i + 1;
834 if (status & (ER_MV_ERROR | ER_MV_END)) {
835 mask &= ~(ER_MV_ERROR | ER_MV_END);
836 s->error_count -= end_i - start_i + 1;
839 if (status & ER_MB_ERROR) {
840 s->error_occurred = 1;
841 s->error_count = INT_MAX;
845 memset(&s->error_status_table[start_xy], 0,
846 (end_xy - start_xy) * sizeof(uint8_t));
849 for (i = start_xy; i < end_xy; i++)
850 s->error_status_table[i] &= mask;
853 if (end_i == s->mb_num)
854 s->error_count = INT_MAX;
856 s->error_status_table[end_xy] &= mask;
857 s->error_status_table[end_xy] |= status;
860 s->error_status_table[start_xy] |= VP_START;
862 if (start_xy > 0 && s->avctx->thread_count <= 1 &&
863 s->avctx->skip_top * s->mb_width < start_i) {
864 int prev_status = s->error_status_table[s->mb_index2xy[start_i - 1]];
866 prev_status &= ~ VP_START;
867 if (prev_status != (ER_MV_END | ER_DC_END | ER_AC_END))
868 s->error_count = INT_MAX;
872 void ff_er_frame_end(MpegEncContext *s)
874 int i, mb_x, mb_y, error, error_type, dc_error, mv_error, ac_error;
876 int threshold_part[4] = { 100, 100, 100 };
879 int size = s->b8_stride * 2 * s->mb_height;
880 Picture *pic = s->current_picture_ptr;
882 /* We do not support ER of field pictures yet,
883 * though it should not crash if enabled. */
884 if (!s->err_recognition || s->error_count == 0 || s->avctx->lowres ||
886 s->avctx->codec->capabilities&CODEC_CAP_HWACCEL_VDPAU ||
887 s->picture_structure != PICT_FRAME ||
888 s->error_count == 3 * s->mb_width *
889 (s->avctx->skip_top + s->avctx->skip_bottom)) {
893 if (s->current_picture.f.motion_val[0] == NULL) {
894 av_log(s->avctx, AV_LOG_ERROR, "Warning MVs not available\n");
896 for (i = 0; i < 2; i++) {
897 pic->f.ref_index[i] = av_mallocz(s->mb_stride * s->mb_height * 4 * sizeof(uint8_t));
898 pic->motion_val_base[i] = av_mallocz((size + 4) * 2 * sizeof(uint16_t));
899 pic->f.motion_val[i] = pic->motion_val_base[i] + 4;
901 pic->f.motion_subsample_log2 = 3;
902 s->current_picture = *s->current_picture_ptr;
905 if (s->avctx->debug & FF_DEBUG_ER) {
906 for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
907 for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
908 int status = s->error_status_table[mb_x + mb_y * s->mb_stride];
910 av_log(s->avctx, AV_LOG_DEBUG, "%2X ", status);
912 av_log(s->avctx, AV_LOG_DEBUG, "\n");
916 /* handle overlapping slices */
917 for (error_type = 1; error_type <= 3; error_type++) {
920 for (i = s->mb_num - 1; i >= 0; i--) {
921 const int mb_xy = s->mb_index2xy[i];
922 int error = s->error_status_table[mb_xy];
924 if (error & (1 << error_type))
926 if (error & (8 << error_type))
930 s->error_status_table[mb_xy] |= 1 << error_type;
932 if (error & VP_START)
937 /* handle slices with partitions of different length */
938 if (s->partitioned_frame) {
941 for (i = s->mb_num - 1; i >= 0; i--) {
942 const int mb_xy = s->mb_index2xy[i];
943 int error = s->error_status_table[mb_xy];
945 if (error & ER_AC_END)
947 if ((error & ER_MV_END) ||
948 (error & ER_DC_END) ||
949 (error & ER_AC_ERROR))
953 s->error_status_table[mb_xy]|= ER_AC_ERROR;
955 if (error & VP_START)
960 /* handle missing slices */
961 if (s->err_recognition & AV_EF_EXPLODE) {
965 for (i = s->mb_num - 2; i >= s->mb_width + 100; i--) {
966 const int mb_xy = s->mb_index2xy[i];
967 int error1 = s->error_status_table[mb_xy];
968 int error2 = s->error_status_table[s->mb_index2xy[i + 1]];
970 if (error1 & VP_START)
973 if (error2 == (VP_START | ER_MB_ERROR | ER_MB_END) &&
974 error1 != (VP_START | ER_MB_ERROR | ER_MB_END) &&
975 ((error1 & ER_AC_END) || (error1 & ER_DC_END) ||
976 (error1 & ER_MV_END))) {
982 s->error_status_table[mb_xy] |= ER_MB_ERROR;
986 /* backward mark errors */
988 for (error_type = 1; error_type <= 3; error_type++) {
989 for (i = s->mb_num - 1; i >= 0; i--) {
990 const int mb_xy = s->mb_index2xy[i];
991 int error = s->error_status_table[mb_xy];
993 if (!s->mbskip_table[mb_xy]) // FIXME partition specific
995 if (error & (1 << error_type))
998 if (s->partitioned_frame) {
999 if (distance < threshold_part[error_type - 1])
1000 s->error_status_table[mb_xy] |= 1 << error_type;
1002 if (distance < threshold)
1003 s->error_status_table[mb_xy] |= 1 << error_type;
1006 if (error & VP_START)
1011 /* forward mark errors */
1013 for (i = 0; i < s->mb_num; i++) {
1014 const int mb_xy = s->mb_index2xy[i];
1015 int old_error = s->error_status_table[mb_xy];
1017 if (old_error & VP_START) {
1018 error = old_error & ER_MB_ERROR;
1020 error |= old_error & ER_MB_ERROR;
1021 s->error_status_table[mb_xy] |= error;
1025 /* handle not partitioned case */
1026 if (!s->partitioned_frame) {
1027 for (i = 0; i < s->mb_num; i++) {
1028 const int mb_xy = s->mb_index2xy[i];
1029 error = s->error_status_table[mb_xy];
1030 if (error & ER_MB_ERROR)
1031 error |= ER_MB_ERROR;
1032 s->error_status_table[mb_xy] = error;
1036 dc_error = ac_error = mv_error = 0;
1037 for (i = 0; i < s->mb_num; i++) {
1038 const int mb_xy = s->mb_index2xy[i];
1039 error = s->error_status_table[mb_xy];
1040 if (error & ER_DC_ERROR)
1042 if (error & ER_AC_ERROR)
1044 if (error & ER_MV_ERROR)
1047 av_log(s->avctx, AV_LOG_INFO, "concealing %d DC, %d AC, %d MV errors\n",
1048 dc_error, ac_error, mv_error);
1050 is_intra_likely = is_intra_more_likely(s);
1052 /* set unknown mb-type to most likely */
1053 for (i = 0; i < s->mb_num; i++) {
1054 const int mb_xy = s->mb_index2xy[i];
1055 error = s->error_status_table[mb_xy];
1056 if (!((error & ER_DC_ERROR) && (error & ER_MV_ERROR)))
1059 if (is_intra_likely)
1060 s->current_picture.f.mb_type[mb_xy] = MB_TYPE_INTRA4x4;
1062 s->current_picture.f.mb_type[mb_xy] = MB_TYPE_16x16 | MB_TYPE_L0;
1065 // change inter to intra blocks if no reference frames are available
1066 if (!s->last_picture.f.data[0] && !s->next_picture.f.data[0])
1067 for (i = 0; i < s->mb_num; i++) {
1068 const int mb_xy = s->mb_index2xy[i];
1069 if (!IS_INTRA(s->current_picture.f.mb_type[mb_xy]))
1070 s->current_picture.f.mb_type[mb_xy] = MB_TYPE_INTRA4x4;
1073 /* handle inter blocks with damaged AC */
1074 for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
1075 for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
1076 const int mb_xy = mb_x + mb_y * s->mb_stride;
1077 const int mb_type = s->current_picture.f.mb_type[mb_xy];
1078 int dir = !s->last_picture.f.data[0];
1080 error = s->error_status_table[mb_xy];
1082 if (IS_INTRA(mb_type))
1084 if (error & ER_MV_ERROR)
1085 continue; // inter with damaged MV
1086 if (!(error & ER_AC_ERROR))
1087 continue; // undamaged inter
1089 s->mv_dir = dir ? MV_DIR_BACKWARD : MV_DIR_FORWARD;
1092 if (IS_8X8(mb_type)) {
1093 int mb_index = mb_x * 2 + mb_y * 2 * s->b8_stride;
1095 s->mv_type = MV_TYPE_8X8;
1096 for (j = 0; j < 4; j++) {
1097 s->mv[0][j][0] = s->current_picture.f.motion_val[dir][mb_index + (j & 1) + (j >> 1) * s->b8_stride][0];
1098 s->mv[0][j][1] = s->current_picture.f.motion_val[dir][mb_index + (j & 1) + (j >> 1) * s->b8_stride][1];
1101 s->mv_type = MV_TYPE_16X16;
1102 s->mv[0][0][0] = s->current_picture.f.motion_val[dir][mb_x * 2 + mb_y * 2 * s->b8_stride][0];
1103 s->mv[0][0][1] = s->current_picture.f.motion_val[dir][mb_x * 2 + mb_y * 2 * s->b8_stride][1];
1106 s->dsp.clear_blocks(s->block[0]);
1110 decode_mb(s, 0 /* FIXME h264 partitioned slices need this set */);
1115 if (s->pict_type == AV_PICTURE_TYPE_B) {
1116 for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
1117 for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
1118 int xy = mb_x * 2 + mb_y * 2 * s->b8_stride;
1119 const int mb_xy = mb_x + mb_y * s->mb_stride;
1120 const int mb_type = s->current_picture.f.mb_type[mb_xy];
1122 error = s->error_status_table[mb_xy];
1124 if (IS_INTRA(mb_type))
1126 if (!(error & ER_MV_ERROR))
1127 continue; // inter with undamaged MV
1128 if (!(error & ER_AC_ERROR))
1129 continue; // undamaged inter
1131 s->mv_dir = MV_DIR_FORWARD | MV_DIR_BACKWARD;
1132 if (!s->last_picture.f.data[0])
1133 s->mv_dir &= ~MV_DIR_FORWARD;
1134 if (!s->next_picture.f.data[0])
1135 s->mv_dir &= ~MV_DIR_BACKWARD;
1137 s->mv_type = MV_TYPE_16X16;
1141 int time_pp = s->pp_time;
1142 int time_pb = s->pb_time;
1144 if (s->avctx->codec_id == CODEC_ID_H264) {
1147 ff_thread_await_progress((AVFrame *) s->next_picture_ptr, mb_y, 0);
1149 s->mv[0][0][0] = s->next_picture.f.motion_val[0][xy][0] * time_pb / time_pp;
1150 s->mv[0][0][1] = s->next_picture.f.motion_val[0][xy][1] * time_pb / time_pp;
1151 s->mv[1][0][0] = s->next_picture.f.motion_val[0][xy][0] * (time_pb - time_pp) / time_pp;
1152 s->mv[1][0][1] = s->next_picture.f.motion_val[0][xy][1] * (time_pb - time_pp) / time_pp;
1160 s->dsp.clear_blocks(s->block[0]);
1169 /* the filters below are not XvMC compatible, skip them */
1170 if (CONFIG_MPEG_XVMC_DECODER && s->avctx->xvmc_acceleration)
1172 /* fill DC for inter blocks */
1173 for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
1174 for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
1175 int dc, dcu, dcv, y, n;
1177 uint8_t *dest_y, *dest_cb, *dest_cr;
1178 const int mb_xy = mb_x + mb_y * s->mb_stride;
1179 const int mb_type = s->current_picture.f.mb_type[mb_xy];
1181 error = s->error_status_table[mb_xy];
1183 if (IS_INTRA(mb_type) && s->partitioned_frame)
1185 // if (error & ER_MV_ERROR)
1186 // continue; // inter data damaged FIXME is this good?
1188 dest_y = s->current_picture.f.data[0] + mb_x * 16 + mb_y * 16 * s->linesize;
1189 dest_cb = s->current_picture.f.data[1] + mb_x * 8 + mb_y * 8 * s->uvlinesize;
1190 dest_cr = s->current_picture.f.data[2] + mb_x * 8 + mb_y * 8 * s->uvlinesize;
1192 dc_ptr = &s->dc_val[0][mb_x * 2 + mb_y * 2 * s->b8_stride];
1193 for (n = 0; n < 4; n++) {
1195 for (y = 0; y < 8; y++) {
1197 for (x = 0; x < 8; x++)
1198 dc += dest_y[x + (n & 1) * 8 +
1199 (y + (n >> 1) * 8) * s->linesize];
1201 dc_ptr[(n & 1) + (n >> 1) * s->b8_stride] = (dc + 4) >> 3;
1205 for (y = 0; y < 8; y++) {
1207 for (x = 0; x < 8; x++) {
1208 dcu += dest_cb[x + y * s->uvlinesize];
1209 dcv += dest_cr[x + y * s->uvlinesize];
1212 s->dc_val[1][mb_x + mb_y * s->mb_stride] = (dcu + 4) >> 3;
1213 s->dc_val[2][mb_x + mb_y * s->mb_stride] = (dcv + 4) >> 3;
1217 /* guess DC for damaged blocks */
1218 guess_dc(s, s->dc_val[0], s->mb_width * 2, s->mb_height * 2, s->b8_stride, 1);
1219 guess_dc(s, s->dc_val[1], s->mb_width, s->mb_height, s->mb_stride, 0);
1220 guess_dc(s, s->dc_val[2], s->mb_width, s->mb_height, s->mb_stride, 0);
1222 /* filter luma DC */
1223 filter181(s->dc_val[0], s->mb_width * 2, s->mb_height * 2, s->b8_stride);
1225 /* render DC only intra */
1226 for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
1227 for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
1228 uint8_t *dest_y, *dest_cb, *dest_cr;
1229 const int mb_xy = mb_x + mb_y * s->mb_stride;
1230 const int mb_type = s->current_picture.f.mb_type[mb_xy];
1232 error = s->error_status_table[mb_xy];
1234 if (IS_INTER(mb_type))
1236 if (!(error & ER_AC_ERROR))
1237 continue; // undamaged
1239 dest_y = s->current_picture.f.data[0] + mb_x * 16 + mb_y * 16 * s->linesize;
1240 dest_cb = s->current_picture.f.data[1] + mb_x * 8 + mb_y * 8 * s->uvlinesize;
1241 dest_cr = s->current_picture.f.data[2] + mb_x * 8 + mb_y * 8 * s->uvlinesize;
1243 put_dc(s, dest_y, dest_cb, dest_cr, mb_x, mb_y);
1247 if (s->avctx->error_concealment & FF_EC_DEBLOCK) {
1248 /* filter horizontal block boundaries */
1249 h_block_filter(s, s->current_picture.f.data[0], s->mb_width * 2,
1250 s->mb_height * 2, s->linesize, 1);
1251 h_block_filter(s, s->current_picture.f.data[1], s->mb_width,
1252 s->mb_height , s->uvlinesize, 0);
1253 h_block_filter(s, s->current_picture.f.data[2], s->mb_width,
1254 s->mb_height , s->uvlinesize, 0);
1256 /* filter vertical block boundaries */
1257 v_block_filter(s, s->current_picture.f.data[0], s->mb_width * 2,
1258 s->mb_height * 2, s->linesize, 1);
1259 v_block_filter(s, s->current_picture.f.data[1], s->mb_width,
1260 s->mb_height , s->uvlinesize, 0);
1261 v_block_filter(s, s->current_picture.f.data[2], s->mb_width,
1262 s->mb_height , s->uvlinesize, 0);
1266 /* clean a few tables */
1267 for (i = 0; i < s->mb_num; i++) {
1268 const int mb_xy = s->mb_index2xy[i];
1269 int error = s->error_status_table[mb_xy];
1271 if (s->pict_type != AV_PICTURE_TYPE_B &&
1272 (error & (ER_DC_ERROR | ER_MV_ERROR | ER_AC_ERROR))) {
1273 s->mbskip_table[mb_xy] = 0;
1275 s->mbintra_table[mb_xy] = 1;