58 uint8_t *dest_cr,
int mb_x,
int mb_y)
61 int dc, dcu, dcv, y, i;
62 for (i = 0; i < 4; i++) {
63 dc = s->
dc_val[0][mb_x * 2 + (i & 1) + (mb_y * 2 + (i >> 1)) * s->
b8_stride];
68 for (y = 0; y < 8; y++) {
70 for (x = 0; x < 8; x++)
71 dest_y[x + (i & 1) * 8 + (y + (i >> 1) * 8) * linesize[0]] = dc / 8;
84 for (y = 0; y < 8; y++) {
86 for (x = 0; x < 8; x++) {
87 dest_cb[x + y * linesize[1]] = dcu / 8;
88 dest_cr[x + y * linesize[2]] = dcv / 8;
98 for (y = 1; y < height - 1; y++) {
99 int prev_dc = data[0 + y *
stride];
101 for (x = 1; x < width - 1; x++) {
104 data[x + y *
stride] * 8 -
106 dc = (dc * 10923 + 32768) >> 16;
107 prev_dc = data[x + y *
stride];
113 for (x = 1; x < width - 1; x++) {
114 int prev_dc = data[x];
116 for (y = 1; y < height - 1; y++) {
120 data[x + y *
stride] * 8 -
121 data[x + (y + 1) * stride];
122 dc = (dc * 10923 + 32768) >> 16;
123 prev_dc = data[x + y *
stride];
135 int h,
int stride,
int is_luma)
139 for (b_y = 0; b_y < h; b_y++) {
140 for (b_x = 0; b_x < w; b_x++) {
141 int color[4] = { 1024, 1024, 1024, 1024 };
142 int distance[4] = { 9999, 9999, 9999, 9999 };
143 int mb_index, error, j;
144 int64_t guess, weight_sum;
145 mb_index = (b_x >> is_luma) + (b_y >> is_luma) * s->
mb_stride;
154 for (j = b_x + 1; j < w; j++) {
155 int mb_index_j = (j >> is_luma) + (b_y >> is_luma) * s->
mb_stride;
158 if (intra_j == 0 || !(error_j & ER_DC_ERROR)) {
159 color[0] = dc[j + b_y *
stride];
160 distance[0] = j - b_x;
166 for (j = b_x - 1; j >= 0; j--) {
167 int mb_index_j = (j >> is_luma) + (b_y >> is_luma) * s->
mb_stride;
170 if (intra_j == 0 || !(error_j & ER_DC_ERROR)) {
171 color[1] = dc[j + b_y *
stride];
172 distance[1] = b_x - j;
178 for (j = b_y + 1; j < h; j++) {
179 int mb_index_j = (b_x >> is_luma) + (j >> is_luma) * s->
mb_stride;
183 if (intra_j == 0 || !(error_j & ER_DC_ERROR)) {
184 color[2] = dc[b_x + j *
stride];
185 distance[2] = j - b_y;
191 for (j = b_y - 1; j >= 0; j--) {
192 int mb_index_j = (b_x >> is_luma) + (j >> is_luma) * s->
mb_stride;
195 if (intra_j == 0 || !(error_j & ER_DC_ERROR)) {
196 color[3] = dc[b_x + j *
stride];
197 distance[3] = b_y - j;
204 for (j = 0; j < 4; j++) {
205 int64_t weight = 256 * 256 * 256 * 16 / distance[j];
206 guess += weight * (int64_t) color[j];
207 weight_sum += weight;
209 guess = (guess + weight_sum / 2) / weight_sum;
210 dc[b_x + b_y *
stride] = guess;
221 int h,
int stride,
int is_luma)
223 int b_x, b_y, mvx_stride, mvy_stride;
226 mvx_stride >>= is_luma;
227 mvy_stride *= mvx_stride;
229 for (b_y = 0; b_y < h; b_y++) {
230 for (b_x = 0; b_x < w - 1; b_x++) {
238 int offset = b_x * 8 + b_y * stride * 8;
239 int16_t *left_mv = s->
cur_pic->
motion_val[0][mvy_stride * b_y + mvx_stride * b_x];
240 int16_t *right_mv = s->
cur_pic->
motion_val[0][mvy_stride * b_y + mvx_stride * (b_x + 1)];
241 if (!(left_damage || right_damage))
243 if ((!left_intra) && (!right_intra) &&
244 FFABS(left_mv[0] - right_mv[0]) +
245 FFABS(left_mv[1] + right_mv[1]) < 2)
248 for (y = 0; y < 8; y++) {
251 a = dst[offset + 7 + y *
stride] - dst[offset + 6 + y *
stride];
252 b = dst[offset + 8 + y *
stride] - dst[offset + 7 + y *
stride];
253 c = dst[offset + 9 + y *
stride] - dst[offset + 8 + y *
stride];
263 if (!(left_damage && right_damage))
267 dst[offset + 7 + y *
stride] = cm[dst[offset + 7 + y *
stride] + ((d * 7) >> 4)];
268 dst[offset + 6 + y *
stride] = cm[dst[offset + 6 + y *
stride] + ((d * 5) >> 4)];
269 dst[offset + 5 + y *
stride] = cm[dst[offset + 5 + y *
stride] + ((d * 3) >> 4)];
270 dst[offset + 4 + y *
stride] = cm[dst[offset + 4 + y *
stride] + ((d * 1) >> 4)];
273 dst[offset + 8 + y *
stride] = cm[dst[offset + 8 + y *
stride] - ((d * 7) >> 4)];
274 dst[offset + 9 + y *
stride] = cm[dst[offset + 9 + y *
stride] - ((d * 5) >> 4)];
275 dst[offset + 10+ y *
stride] = cm[dst[offset + 10 + y *
stride] - ((d * 3) >> 4)];
276 dst[offset + 11+ y *
stride] = cm[dst[offset + 11 + y *
stride] - ((d * 1) >> 4)];
291 int b_x, b_y, mvx_stride, mvy_stride;
294 mvx_stride >>= is_luma;
295 mvy_stride *= mvx_stride;
297 for (b_y = 0; b_y < h - 1; b_y++) {
298 for (b_x = 0; b_x < w; b_x++) {
306 int offset = b_x * 8 + b_y * stride * 8;
308 int16_t *top_mv = s->
cur_pic->
motion_val[0][mvy_stride * b_y + mvx_stride * b_x];
309 int16_t *bottom_mv = s->
cur_pic->
motion_val[0][mvy_stride * (b_y + 1) + mvx_stride * b_x];
311 if (!(top_damage || bottom_damage))
314 if ((!top_intra) && (!bottom_intra) &&
315 FFABS(top_mv[0] - bottom_mv[0]) +
316 FFABS(top_mv[1] + bottom_mv[1]) < 2)
319 for (x = 0; x < 8; x++) {
322 a = dst[offset + x + 7 *
stride] - dst[offset + x + 6 *
stride];
323 b = dst[offset + x + 8 *
stride] - dst[offset + x + 7 *
stride];
324 c = dst[offset + x + 9 *
stride] - dst[offset + x + 8 *
stride];
334 if (!(top_damage && bottom_damage))
338 dst[offset + x + 7 *
stride] = cm[dst[offset + x + 7 *
stride] + ((d * 7) >> 4)];
339 dst[offset + x + 6 *
stride] = cm[dst[offset + x + 6 *
stride] + ((d * 5) >> 4)];
340 dst[offset + x + 5 *
stride] = cm[dst[offset + x + 5 *
stride] + ((d * 3) >> 4)];
341 dst[offset + x + 4 *
stride] = cm[dst[offset + x + 4 *
stride] + ((d * 1) >> 4)];
344 dst[offset + x + 8 *
stride] = cm[dst[offset + x + 8 *
stride] - ((d * 7) >> 4)];
345 dst[offset + x + 9 *
stride] = cm[dst[offset + x + 9 *
stride] - ((d * 5) >> 4)];
346 dst[offset + x + 10 *
stride] = cm[dst[offset + x + 10 *
stride] - ((d * 3) >> 4)];
347 dst[offset + x + 11 *
stride] = cm[dst[offset + x + 11 *
stride] - ((d * 1) >> 4)];
359 #define MV_UNCHANGED 1
363 int i, depth, num_avail;
364 int mb_x, mb_y, mot_step, mot_stride;
369 for (i = 0; i < s->
mb_num; i++) {
385 num_avail <= mb_width / 2) {
386 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
387 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
388 const int mb_xy = mb_x + mb_y * s->
mb_stride;
405 for (depth = 0; ; depth++) {
406 int changed,
pass, none_left;
410 for (pass = 0; (changed || pass < 2) && pass < 10; pass++) {
415 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
416 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
417 const int mb_xy = mb_x + mb_y * s->
mb_stride;
418 int mv_predictor[8][2] = { { 0 } };
422 int best_score = 256 * 256 * 256 * 64;
424 const int mot_index = (mb_x + mb_y * mot_stride) * mot_step;
425 int prev_x, prev_y, prev_ref;
427 if ((mb_x ^ mb_y ^ pass) & 1)
436 if (mb_x > 0 && fixed[mb_xy - 1] ==
MV_FROZEN)
438 if (mb_x + 1 < mb_width && fixed[mb_xy + 1] ==
MV_FROZEN)
440 if (mb_y > 0 && fixed[mb_xy - mb_stride] ==
MV_FROZEN)
442 if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride] ==
MV_FROZEN)
448 if (mb_x > 0 && fixed[mb_xy - 1 ] ==
MV_CHANGED)
450 if (mb_x + 1 < mb_width && fixed[mb_xy + 1 ] ==
MV_CHANGED)
452 if (mb_y > 0 && fixed[mb_xy - mb_stride] ==
MV_CHANGED)
454 if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride] ==
MV_CHANGED)
456 if (j == 0 && pass > 1)
461 if (mb_x > 0 && fixed[mb_xy - 1]) {
462 mv_predictor[pred_count][0] =
464 mv_predictor[pred_count][1] =
470 if (mb_x + 1 < mb_width && fixed[mb_xy + 1]) {
471 mv_predictor[pred_count][0] =
473 mv_predictor[pred_count][1] =
479 if (mb_y > 0 && fixed[mb_xy - mb_stride]) {
480 mv_predictor[pred_count][0] =
482 mv_predictor[pred_count][1] =
488 if (mb_y + 1<mb_height && fixed[mb_xy + mb_stride]) {
489 mv_predictor[pred_count][0] =
491 mv_predictor[pred_count][1] =
500 if (pred_count > 1) {
501 int sum_x = 0, sum_y = 0, sum_r = 0;
502 int max_x, max_y, min_x, min_y, max_r, min_r;
504 for (j = 0; j < pred_count; j++) {
505 sum_x += mv_predictor[j][0];
506 sum_y += mv_predictor[j][1];
508 if (j && ref[j] != ref[j - 1])
509 goto skip_mean_and_median;
513 mv_predictor[pred_count][0] = sum_x / j;
514 mv_predictor[pred_count][1] = sum_y / j;
515 ref[pred_count] = sum_r / j;
518 if (pred_count >= 3) {
519 min_y = min_x = min_r = 99999;
520 max_y = max_x = max_r = -99999;
522 min_x = min_y = max_x = max_y = min_r = max_r = 0;
524 for (j = 0; j < pred_count; j++) {
525 max_x =
FFMAX(max_x, mv_predictor[j][0]);
526 max_y =
FFMAX(max_y, mv_predictor[j][1]);
527 max_r =
FFMAX(max_r, ref[j]);
528 min_x =
FFMIN(min_x, mv_predictor[j][0]);
529 min_y =
FFMIN(min_y, mv_predictor[j][1]);
530 min_r =
FFMIN(min_r, ref[j]);
532 mv_predictor[pred_count + 1][0] = sum_x - max_x - min_x;
533 mv_predictor[pred_count + 1][1] = sum_y - max_y - min_y;
534 ref[pred_count + 1] = sum_r - max_r - min_r;
536 if (pred_count == 4) {
537 mv_predictor[pred_count + 1][0] /= 2;
538 mv_predictor[pred_count + 1][1] /= 2;
539 ref[pred_count + 1] /= 2;
544 skip_mean_and_median:
568 mv_predictor[pred_count][0] = prev_x;
569 mv_predictor[pred_count][1] = prev_y;
570 ref[pred_count] = prev_ref;
575 for (j = 0; j < pred_count; j++) {
579 mb_x * 16 + mb_y * 16 * linesize[0];
582 s->
mv[0][0][0] = mv_predictor[j][0];
584 s->
mv[0][0][1] = mv_predictor[j][1];
593 if (mb_x > 0 && fixed[mb_xy - 1]) {
595 for (k = 0; k < 16; k++)
596 score +=
FFABS(src[k * linesize[0] - 1] -
597 src[k * linesize[0]]);
599 if (mb_x + 1 < mb_width && fixed[mb_xy + 1]) {
601 for (k = 0; k < 16; k++)
602 score +=
FFABS(src[k * linesize[0] + 15] -
603 src[k * linesize[0] + 16]);
605 if (mb_y > 0 && fixed[mb_xy - mb_stride]) {
607 for (k = 0; k < 16; k++)
608 score +=
FFABS(src[k - linesize[0]] - src[k]);
610 if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride]) {
612 for (k = 0; k < 16; k++)
613 score +=
FFABS(src[k + linesize[0] * 15] -
614 src[k + linesize[0] * 16]);
617 if (score <= best_score) {
622 score_sum += best_score;
623 s->
mv[0][0][0] = mv_predictor[best_pred][0];
624 s->
mv[0][0][1] = mv_predictor[best_pred][1];
626 for (i = 0; i < mot_step; i++)
627 for (j = 0; j < mot_step; j++) {
636 if (s->
mv[0][0][0] != prev_x || s->
mv[0][0][1] != prev_y) {
648 for (i = 0; i < s->
mb_num; i++) {
658 int is_intra_likely, i, j, undamaged_count, skip_amount, mb_x, mb_y;
664 for (i = 0; i < s->
mb_num; i++) {
674 if (undamaged_count < 5)
681 s->
avctx->xvmc_acceleration &&
687 skip_amount =
FFMAX(undamaged_count / 50, 1);
691 for (mb_y = 0; mb_y < s->
mb_height - 1; mb_y++) {
692 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
694 const int mb_xy = mb_x + mb_y * s->
mb_stride;
702 if ((j % skip_amount) != 0)
708 mb_x * 16 + mb_y * 16 * linesize[0];
710 mb_x * 16 + mb_y * 16 * linesize[0];
717 is_intra_likely += s->
dsp->
sad[0](
NULL, last_mb_ptr, mb_ptr,
719 is_intra_likely -= s->
dsp->
sad[0](
NULL, last_mb_ptr,
720 last_mb_ptr + linesize[0] * 16,
730 return is_intra_likely > 0;
752 int endx,
int endy,
int status)
754 const int start_i = av_clip(startx + starty * s->
mb_width, 0, s->
mb_num - 1);
755 const int end_i = av_clip(endx + endy * s->
mb_width, 0, s->
mb_num);
763 if (start_i > end_i || start_xy > end_xy) {
765 "internal error, slice end before start\n");
793 (end_xy - start_xy) *
sizeof(
uint8_t));
796 for (i = start_xy; i < end_xy; i++)
822 int i, mb_x, mb_y, error, error_type, dc_error, mv_error, ac_error;
824 int threshold_part[4] = { 100, 100, 100 };
842 for (i = 0; i < 2; i++) {
851 for (i = 0; i < 2; i++) {
862 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
863 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
873 for (error_type = 1; error_type <= 3; error_type++) {
876 for (i = s->
mb_num - 1; i >= 0; i--) {
880 if (error & (1 << error_type))
882 if (error & (8 << error_type))
897 for (i = s->
mb_num - 1; i >= 0; i--) {
944 for (error_type = 1; error_type <= 3; error_type++) {
945 for (i = s->
mb_num - 1; i >= 0; i--) {
951 if (error & (1 << error_type))
955 if (distance < threshold_part[error_type - 1])
958 if (distance < threshold)
969 for (i = 0; i < s->
mb_num; i++) {
983 for (i = 0; i < s->
mb_num; i++) {
992 dc_error = ac_error = mv_error = 0;
993 for (i = 0; i < s->
mb_num; i++) {
1004 dc_error, ac_error, mv_error);
1009 for (i = 0; i < s->
mb_num; i++) {
1015 if (is_intra_likely)
1024 for (i = 0; i < s->
mb_num; i++) {
1031 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
1032 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
1033 const int mb_xy = mb_x + mb_y * s->
mb_stride;
1049 int mb_index = mb_x * 2 + mb_y * 2 * s->
b8_stride;
1052 for (j = 0; j < 4; j++) {
1063 mv_dir, mv_type, &s->
mv, mb_x, mb_y, 0, 0);
1069 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
1070 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
1071 int xy = mb_x * 2 + mb_y * 2 * s->
b8_stride;
1072 const int mb_xy = mb_x + mb_y * s->
mb_stride;
1122 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
1123 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
1124 int dc, dcu, dcv, y, n;
1126 uint8_t *dest_y, *dest_cb, *dest_cr;
1127 const int mb_xy = mb_x + mb_y * s->
mb_stride;
1137 dest_y = s->
cur_pic->
f.
data[0] + mb_x * 16 + mb_y * 16 * linesize[0];
1138 dest_cb = s->
cur_pic->
f.
data[1] + mb_x * 8 + mb_y * 8 * linesize[1];
1139 dest_cr = s->
cur_pic->
f.
data[2] + mb_x * 8 + mb_y * 8 * linesize[2];
1142 for (n = 0; n < 4; n++) {
1144 for (y = 0; y < 8; y++) {
1146 for (x = 0; x < 8; x++)
1147 dc += dest_y[x + (n & 1) * 8 +
1148 (y + (n >> 1) * 8) * linesize[0]];
1150 dc_ptr[(n & 1) + (n >> 1) * s->
b8_stride] = (dc + 4) >> 3;
1154 for (y = 0; y < 8; y++) {
1156 for (x = 0; x < 8; x++) {
1157 dcu += dest_cb[x + y * linesize[1]];
1158 dcv += dest_cr[x + y * linesize[2]];
1175 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
1176 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
1177 uint8_t *dest_y, *dest_cb, *dest_cr;
1178 const int mb_xy = mb_x + mb_y * s->
mb_stride;
1188 dest_y = s->
cur_pic->
f.
data[0] + mb_x * 16 + mb_y * 16 * linesize[0];
1189 dest_cb = s->
cur_pic->
f.
data[1] + mb_x * 8 + mb_y * 8 * linesize[1];
1190 dest_cr = s->
cur_pic->
f.
data[2] + mb_x * 8 + mb_y * 8 * linesize[2];
1192 put_dc(s, dest_y, dest_cb, dest_cr, mb_x, mb_y);
1216 for (i = 0; i < s->
mb_num; i++) {