60 uint8_t *dest_cr,
int mb_x,
int mb_y)
63 int dc, dcu, dcv,
y, i;
64 for (i = 0; i < 4; i++) {
65 dc = s->
dc_val[0][mb_x * 2 + (i & 1) + (mb_y * 2 + (i >> 1)) * s->
b8_stride];
70 for (y = 0; y < 8; y++) {
72 for (x = 0; x < 8; x++)
73 dest_y[x + (i & 1) * 8 + (y + (i >> 1) * 8) * linesize[0]] = dc / 8;
86 for (y = 0; y < 8; y++) {
88 for (x = 0; x < 8; x++) {
89 dest_cb[x + y * linesize[1]] = dcu / 8;
90 dest_cr[x + y * linesize[2]] = dcv / 8;
100 for (y = 1; y < height - 1; y++) {
101 int prev_dc = data[0 + y *
stride];
103 for (x = 1; x < width - 1; x++) {
106 data[x + y *
stride] * 8 -
108 dc = (dc * 10923 + 32768) >> 16;
109 prev_dc = data[x + y *
stride];
115 for (x = 1; x < width - 1; x++) {
116 int prev_dc = data[x];
118 for (y = 1; y < height - 1; y++) {
122 data[x + y *
stride] * 8 -
123 data[x + (y + 1) * stride];
124 dc = (dc * 10923 + 32768) >> 16;
125 prev_dc = data[x + y *
stride];
137 int h,
int stride,
int is_luma)
148 for(b_y=0; b_y<h; b_y++){
151 for(b_x=0; b_x<w; b_x++){
152 int mb_index_j= (b_x>>is_luma) + (b_y>>is_luma)*s->
mb_stride;
156 color= dc[b_x + b_y*
stride];
160 dist[b_x + b_y*
stride][1]= distance >= 0 ? b_x-distance : 9999;
164 for(b_x=w-1; b_x>=0; b_x--){
165 int mb_index_j= (b_x>>is_luma) + (b_y>>is_luma)*s->
mb_stride;
169 color= dc[b_x + b_y*
stride];
173 dist[b_x + b_y*
stride][0]= distance >= 0 ? distance-b_x : 9999;
176 for(b_x=0; b_x<w; b_x++){
179 for(b_y=0; b_y<h; b_y++){
180 int mb_index_j= (b_x>>is_luma) + (b_y>>is_luma)*s->
mb_stride;
184 color= dc[b_x + b_y*
stride];
188 dist[b_x + b_y*
stride][3]= distance >= 0 ? b_y-distance : 9999;
192 for(b_y=h-1; b_y>=0; b_y--){
193 int mb_index_j= (b_x>>is_luma) + (b_y>>is_luma)*s->
mb_stride;
197 color= dc[b_x + b_y*
stride];
201 dist[b_x + b_y*
stride][2]= distance >= 0 ? distance-b_y : 9999;
205 for (b_y = 0; b_y < h; b_y++) {
206 for (b_x = 0; b_x < w; b_x++) {
207 int mb_index, error, j;
208 int64_t guess, weight_sum;
209 mb_index = (b_x >> is_luma) + (b_y >> is_luma) * s->
mb_stride;
219 for (j = 0; j < 4; j++) {
220 int64_t
weight = 256 * 256 * 256 * 16 /
FFMAX(dist[b_x + b_y*stride][j], 1);
221 guess += weight*(int64_t)col[b_x + b_y*stride][j];
224 guess = (guess + weight_sum / 2) / weight_sum;
225 dc[b_x + b_y *
stride] = guess;
240 int h,
int stride,
int is_luma)
242 int b_x, b_y, mvx_stride, mvy_stride;
245 mvx_stride >>= is_luma;
246 mvy_stride *= mvx_stride;
248 for (b_y = 0; b_y < h; b_y++) {
249 for (b_x = 0; b_x < w - 1; b_x++) {
257 int offset = b_x * 8 + b_y * stride * 8;
258 int16_t *left_mv = s->
cur_pic.
motion_val[0][mvy_stride * b_y + mvx_stride * b_x];
259 int16_t *right_mv = s->
cur_pic.
motion_val[0][mvy_stride * b_y + mvx_stride * (b_x + 1)];
260 if (!(left_damage || right_damage))
262 if ((!left_intra) && (!right_intra) &&
263 FFABS(left_mv[0] - right_mv[0]) +
264 FFABS(left_mv[1] + right_mv[1]) < 2)
267 for (y = 0; y < 8; y++) {
270 a = dst[offset + 7 + y *
stride] - dst[offset + 6 + y *
stride];
271 b = dst[offset + 8 + y *
stride] - dst[offset + 7 + y *
stride];
272 c = dst[offset + 9 + y *
stride] - dst[offset + 8 + y *
stride];
282 if (!(left_damage && right_damage))
286 dst[offset + 7 + y *
stride] = cm[dst[offset + 7 + y *
stride] + ((d * 7) >> 4)];
287 dst[offset + 6 + y *
stride] = cm[dst[offset + 6 + y *
stride] + ((d * 5) >> 4)];
288 dst[offset + 5 + y *
stride] = cm[dst[offset + 5 + y *
stride] + ((d * 3) >> 4)];
289 dst[offset + 4 + y *
stride] = cm[dst[offset + 4 + y *
stride] + ((d * 1) >> 4)];
292 dst[offset + 8 + y *
stride] = cm[dst[offset + 8 + y *
stride] - ((d * 7) >> 4)];
293 dst[offset + 9 + y *
stride] = cm[dst[offset + 9 + y *
stride] - ((d * 5) >> 4)];
294 dst[offset + 10+ y *
stride] = cm[dst[offset + 10 + y *
stride] - ((d * 3) >> 4)];
295 dst[offset + 11+ y *
stride] = cm[dst[offset + 11 + y *
stride] - ((d * 1) >> 4)];
310 int b_x, b_y, mvx_stride, mvy_stride;
313 mvx_stride >>= is_luma;
314 mvy_stride *= mvx_stride;
316 for (b_y = 0; b_y < h - 1; b_y++) {
317 for (b_x = 0; b_x < w; b_x++) {
325 int offset = b_x * 8 + b_y * stride * 8;
328 int16_t *bottom_mv = s->
cur_pic.
motion_val[0][mvy_stride * (b_y + 1) + mvx_stride * b_x];
330 if (!(top_damage || bottom_damage))
333 if ((!top_intra) && (!bottom_intra) &&
334 FFABS(top_mv[0] - bottom_mv[0]) +
335 FFABS(top_mv[1] + bottom_mv[1]) < 2)
338 for (x = 0; x < 8; x++) {
341 a = dst[offset + x + 7 *
stride] - dst[offset + x + 6 *
stride];
342 b = dst[offset + x + 8 *
stride] - dst[offset + x + 7 *
stride];
343 c = dst[offset + x + 9 *
stride] - dst[offset + x + 8 *
stride];
353 if (!(top_damage && bottom_damage))
357 dst[offset + x + 7 *
stride] = cm[dst[offset + x + 7 *
stride] + ((d * 7) >> 4)];
358 dst[offset + x + 6 *
stride] = cm[dst[offset + x + 6 *
stride] + ((d * 5) >> 4)];
359 dst[offset + x + 5 *
stride] = cm[dst[offset + x + 5 *
stride] + ((d * 3) >> 4)];
360 dst[offset + x + 4 *
stride] = cm[dst[offset + x + 4 *
stride] + ((d * 1) >> 4)];
363 dst[offset + x + 8 *
stride] = cm[dst[offset + x + 8 *
stride] - ((d * 7) >> 4)];
364 dst[offset + x + 9 *
stride] = cm[dst[offset + x + 9 *
stride] - ((d * 5) >> 4)];
365 dst[offset + x + 10 *
stride] = cm[dst[offset + x + 10 *
stride] - ((d * 3) >> 4)];
366 dst[offset + x + 11 *
stride] = cm[dst[offset + x + 11 *
stride] - ((d * 1) >> 4)];
378 #define MV_UNCHANGED 1
382 int i,
depth, num_avail;
383 int mb_x, mb_y, mot_step, mot_stride;
388 for (i = 0; i < s->
mb_num; i++) {
404 const int mot_index= (mb_x + mb_y*mot_stride) * mot_step;
412 num_avail <= mb_width / 2) {
413 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
414 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
415 const int mb_xy = mb_x + mb_y * s->
mb_stride;
432 for (depth = 0; ; depth++) {
433 int changed,
pass, none_left;
437 for (pass = 0; (changed || pass < 2) && pass < 10; pass++) {
442 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
443 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
444 const int mb_xy = mb_x + mb_y * s->
mb_stride;
445 int mv_predictor[8][2] = { { 0 } };
449 int best_score = 256 * 256 * 256 * 64;
451 const int mot_index = (mb_x + mb_y * mot_stride) * mot_step;
452 int prev_x = 0, prev_y = 0, prev_ref = 0;
454 if ((mb_x ^ mb_y ^ pass) & 1)
463 if (mb_x > 0 && fixed[mb_xy - 1] ==
MV_FROZEN)
465 if (mb_x + 1 < mb_width && fixed[mb_xy + 1] ==
MV_FROZEN)
467 if (mb_y > 0 && fixed[mb_xy - mb_stride] ==
MV_FROZEN)
469 if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride] ==
MV_FROZEN)
475 if (mb_x > 0 && fixed[mb_xy - 1 ] ==
MV_CHANGED)
477 if (mb_x + 1 < mb_width && fixed[mb_xy + 1 ] ==
MV_CHANGED)
479 if (mb_y > 0 && fixed[mb_xy - mb_stride] ==
MV_CHANGED)
481 if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride] ==
MV_CHANGED)
483 if (j == 0 && pass > 1)
488 if (mb_x > 0 && fixed[mb_xy - 1]) {
489 mv_predictor[pred_count][0] =
491 mv_predictor[pred_count][1] =
497 if (mb_x + 1 < mb_width && fixed[mb_xy + 1]) {
498 mv_predictor[pred_count][0] =
500 mv_predictor[pred_count][1] =
506 if (mb_y > 0 && fixed[mb_xy - mb_stride]) {
507 mv_predictor[pred_count][0] =
509 mv_predictor[pred_count][1] =
515 if (mb_y + 1<mb_height && fixed[mb_xy + mb_stride]) {
516 mv_predictor[pred_count][0] =
518 mv_predictor[pred_count][1] =
527 if (pred_count > 1) {
528 int sum_x = 0, sum_y = 0, sum_r = 0;
529 int max_x, max_y, min_x, min_y, max_r, min_r;
531 for (j = 0; j < pred_count; j++) {
532 sum_x += mv_predictor[j][0];
533 sum_y += mv_predictor[j][1];
535 if (j && ref[j] != ref[j - 1])
536 goto skip_mean_and_median;
540 mv_predictor[pred_count][0] = sum_x / j;
541 mv_predictor[pred_count][1] = sum_y / j;
542 ref[pred_count] = sum_r / j;
545 if (pred_count >= 3) {
546 min_y = min_x = min_r = 99999;
547 max_y = max_x = max_r = -99999;
549 min_x = min_y = max_x = max_y = min_r = max_r = 0;
551 for (j = 0; j < pred_count; j++) {
552 max_x =
FFMAX(max_x, mv_predictor[j][0]);
553 max_y =
FFMAX(max_y, mv_predictor[j][1]);
554 max_r =
FFMAX(max_r, ref[j]);
555 min_x =
FFMIN(min_x, mv_predictor[j][0]);
556 min_y =
FFMIN(min_y, mv_predictor[j][1]);
557 min_r =
FFMIN(min_r, ref[j]);
559 mv_predictor[pred_count + 1][0] = sum_x - max_x - min_x;
560 mv_predictor[pred_count + 1][1] = sum_y - max_y - min_y;
561 ref[pred_count + 1] = sum_r - max_r - min_r;
563 if (pred_count == 4) {
564 mv_predictor[pred_count + 1][0] /= 2;
565 mv_predictor[pred_count + 1][1] /= 2;
566 ref[pred_count + 1] /= 2;
571 skip_mean_and_median:
575 if (!fixed[mb_xy] && 0) {
595 mv_predictor[pred_count][0] = prev_x;
596 mv_predictor[pred_count][1] = prev_y;
597 ref[pred_count] = prev_ref;
602 for (j = 0; j < pred_count; j++) {
606 mb_x * 16 + mb_y * 16 * linesize[0];
609 s->
mv[0][0][0] = mv_predictor[j][0];
611 s->
mv[0][0][1] = mv_predictor[j][1];
620 if (mb_x > 0 && fixed[mb_xy - 1]) {
622 for (k = 0; k < 16; k++)
623 score +=
FFABS(src[k * linesize[0] - 1] -
624 src[k * linesize[0]]);
626 if (mb_x + 1 < mb_width && fixed[mb_xy + 1]) {
628 for (k = 0; k < 16; k++)
629 score +=
FFABS(src[k * linesize[0] + 15] -
630 src[k * linesize[0] + 16]);
632 if (mb_y > 0 && fixed[mb_xy - mb_stride]) {
634 for (k = 0; k < 16; k++)
635 score +=
FFABS(src[k - linesize[0]] - src[k]);
637 if (mb_y + 1 < mb_height && fixed[mb_xy + mb_stride]) {
639 for (k = 0; k < 16; k++)
640 score +=
FFABS(src[k + linesize[0] * 15] -
641 src[k + linesize[0] * 16]);
644 if (score <= best_score) {
649 score_sum += best_score;
650 s->
mv[0][0][0] = mv_predictor[best_pred][0];
651 s->
mv[0][0][1] = mv_predictor[best_pred][1];
653 for (i = 0; i < mot_step; i++)
654 for (j = 0; j < mot_step; j++) {
663 if (s->
mv[0][0][0] != prev_x || s->
mv[0][0][1] != prev_y) {
675 for (i = 0; i < s->
mb_num; i++) {
685 int is_intra_likely, i, j, undamaged_count, skip_amount, mb_x, mb_y;
694 for (i = 0; i < s->
mb_num; i++) {
701 if (undamaged_count < 5)
710 skip_amount =
FFMAX(undamaged_count / 50, 1);
714 for (mb_y = 0; mb_y < s->
mb_height - 1; mb_y++) {
715 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
717 const int mb_xy = mb_x + mb_y * s->
mb_stride;
725 if ((j % skip_amount) != 0)
731 mb_x * 16 + mb_y * 16 * linesize[0];
733 mb_x * 16 + mb_y * 16 * linesize[0];
740 is_intra_likely += s->
mecc.
sad[0](
NULL, last_mb_ptr, mb_ptr,
743 is_intra_likely -= s->
mecc.
sad[0](
NULL, last_mb_ptr,
744 last_mb_ptr + linesize[0] * 16,
755 return is_intra_likely > 0;
793 int endx,
int endy,
int status)
795 const int start_i = av_clip(startx + starty * s->
mb_width, 0, s->
mb_num - 1);
796 const int end_i = av_clip(endx + endy * s->
mb_width, 0, s->
mb_num);
804 if (start_i > end_i || start_xy > end_xy) {
806 "internal error, slice end before start\n");
834 (end_xy - start_xy) *
sizeof(
uint8_t));
837 for (i = start_xy; i < end_xy; i++)
864 int *linesize =
NULL;
865 int i, mb_x, mb_y, error, error_type, dc_error, mv_error, ac_error;
867 int threshold_part[4] = { 100, 100, 100 };
882 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
917 for (i = 0; i < 2; i++) {
926 for (i = 0; i < 2; i++) {
937 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
938 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
949 for (error_type = 1; error_type <= 3; error_type++) {
952 for (i = s->
mb_num - 1; i >= 0; i--) {
956 if (error & (1 << error_type))
958 if (error & (8 << error_type))
974 for (i = s->
mb_num - 1; i >= 0; i--) {
1022 for (error_type = 1; error_type <= 3; error_type++) {
1023 for (i = s->
mb_num - 1; i >= 0; i--) {
1029 if (error & (1 << error_type))
1033 if (distance < threshold_part[error_type - 1])
1036 if (distance < threshold)
1048 for (i = 0; i < s->
mb_num; i++) {
1062 for (i = 0; i < s->
mb_num; i++) {
1072 dc_error = ac_error = mv_error = 0;
1073 for (i = 0; i < s->
mb_num; i++) {
1089 for (i = 0; i < s->
mb_num; i++) {
1095 if (is_intra_likely)
1104 for (i = 0; i < s->
mb_num; i++) {
1111 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
1112 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
1113 const int mb_xy = mb_x + mb_y * s->
mb_stride;
1129 int mb_index = mb_x * 2 + mb_y * 2 * s->
b8_stride;
1132 for (j = 0; j < 4; j++) {
1143 mv_dir, mv_type, &s->
mv, mb_x, mb_y, 0, 0);
1149 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
1150 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
1151 int xy = mb_x * 2 + mb_y * 2 * s->
b8_stride;
1152 const int mb_xy = mb_x + mb_y * s->
mb_stride;
1199 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
1200 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
1201 int dc, dcu, dcv,
y,
n;
1203 uint8_t *dest_y, *dest_cb, *dest_cr;
1204 const int mb_xy = mb_x + mb_y * s->
mb_stride;
1214 dest_y = s->
cur_pic.
f->
data[0] + mb_x * 16 + mb_y * 16 * linesize[0];
1215 dest_cb = s->
cur_pic.
f->
data[1] + mb_x * 8 + mb_y * 8 * linesize[1];
1216 dest_cr = s->
cur_pic.
f->
data[2] + mb_x * 8 + mb_y * 8 * linesize[2];
1219 for (n = 0; n < 4; n++) {
1221 for (y = 0; y < 8; y++) {
1223 for (x = 0; x < 8; x++)
1224 dc += dest_y[x + (n & 1) * 8 +
1225 (y + (n >> 1) * 8) * linesize[0]];
1227 dc_ptr[(n & 1) + (n >> 1) * s->
b8_stride] = (dc + 4) >> 3;
1231 for (y = 0; y < 8; y++) {
1233 for (x = 0; x < 8; x++) {
1234 dcu += dest_cb[x + y * linesize[1]];
1235 dcv += dest_cr[x + y * linesize[2]];
1254 for (mb_y = 0; mb_y < s->
mb_height; mb_y++) {
1255 for (mb_x = 0; mb_x < s->
mb_width; mb_x++) {
1256 uint8_t *dest_y, *dest_cb, *dest_cr;
1257 const int mb_xy = mb_x + mb_y * s->
mb_stride;
1267 dest_y = s->
cur_pic.
f->
data[0] + mb_x * 16 + mb_y * 16 * linesize[0];
1268 dest_cb = s->
cur_pic.
f->
data[1] + mb_x * 8 + mb_y * 8 * linesize[1];
1269 dest_cr = s->
cur_pic.
f->
data[2] + mb_x * 8 + mb_y * 8 * linesize[2];
1271 put_dc(s, dest_y, dest_cb, dest_cr, mb_x, mb_y);
1296 for (i = 0; i < s->
mb_num; i++) {
1307 for (i = 0; i < 2; i++) {
av_cold void ff_me_cmp_init(MECmpContext *c, AVCodecContext *avctx)
const struct AVCodec * codec
void av_buffer_unref(AVBufferRef **buf)
Free a given reference and automatically free the buffer if there are no more references to it...
ptrdiff_t const GLvoid * data
AVBufferRef * motion_val_buf[2]
#define FF_EC_FAVOR_INTER
#define AV_LOG_WARNING
Something somehow does not look correct.
static void put_dc(ERContext *s, uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr, int mb_x, int mb_y)
Replace the current MB with a flat dc-only version.
void ff_er_frame_end(ERContext *s)
static void v_block_filter(ERContext *s, uint8_t *dst, int w, int h, int stride, int is_luma)
simple vertical deblocking filter used for error resilience
static void filter181(int16_t *data, int width, int height, int stride)
#define VP_START
< current MB is the first after a resync marker
static void guess_mv(ERContext *s)
void ff_thread_await_progress(ThreadFrame *f, int n, int field)
Wait for earlier decoding threads to finish reference pictures.
struct AVHWAccel * hwaccel
Hardware accelerator in use.
#define av_assert0(cond)
assert() equivalent, that is always enabled.
AVBufferRef * ref_index_buf[2]
static const uint32_t color[16+AV_CLASS_CATEGORY_NB]
Multithreading support functions.
#define CODEC_CAP_HWACCEL_VDPAU
Codec can export data for HW decoding (VDPAU).
char av_get_picture_type_char(enum AVPictureType pict_type)
Return a single letter to describe the given picture type pict_type.
void(* decode_mb)(struct MpegEncContext *s)
Called for every Macroblock in a slice.
static void guess_dc(ERContext *s, int16_t *dc, int w, int h, int stride, int is_luma)
guess the dc of blocks which do not have an undamaged dc
int lowres
low resolution decoding, 1-> 1/2 size, 2->1/4 size
Libavcodec version macros.
int width
width and height of the video frame
#define AV_LOG_ERROR
Something went wrong and cannot losslessly be recovered.
void ff_er_add_slice(ERContext *s, int startx, int starty, int endx, int endy, int status)
Add a slice.
static const uint16_t mask[17]
#define AV_EF_EXPLODE
abort decoding on minor error detection
int active_thread_type
Which multithreading methods are in use by the codec.
int error_concealment
error concealment flags
int capabilities
Codec capabilities.
#define AV_LOG_DEBUG
Stuff which is only useful for libav* developers.
void(* decode_mb)(void *opaque, int ref, int mv_dir, int mv_type, int(*mv)[2][4][2], int mb_x, int mb_y, int mb_intra, int mb_skipped)
static const uint8_t offset[127][2]
Libavcodec external API header.
static float distance(float x, float y, int band)
uint8_t * error_status_table
common internal API header
useful rectangle filling function
enum AVPictureType pict_type
Picture type of the frame.
int err_recognition
Error recognition; may misdetect some more or less valid parts as errors.
#define av_assert1(cond)
assert() equivalent, that does not lie in speed critical code.
int skip_top
Number of macroblock rows at the top which are skipped.
preferred ID for MPEG-1/2 video decoding
int format
format of the frame, -1 if unknown or unset Values correspond to enum AVPixelFormat for video frames...
#define MV_TYPE_16X16
1 vector for the whole mb
#define AV_LOG_INFO
Standard information.
#define FF_THREAD_SLICE
Decode more than one part of a single frame at once.
int linesize[AV_NUM_DATA_POINTERS]
For video, size in bytes of each picture line.
uint8_t * data
The data buffer.
AVBufferRef * av_buffer_allocz(int size)
Same as av_buffer_alloc(), except the returned buffer will be initialized to zero.
BYTE int const BYTE int int int height
static int weight(int i, int blen, int offset)
int skip_bottom
Number of macroblock rows at the bottom which are skipped.
uint8_t * data[AV_NUM_DATA_POINTERS]
pointer to the picture/channel planes.
uint8_t pi<< 24) CONV_FUNC_GROUP(AV_SAMPLE_FMT_FLT, float, AV_SAMPLE_FMT_U8, uint8_t,(*(constuint8_t *) pi-0x80)*(1.0f/(1<< 7))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_DBL, double, AV_SAMPLE_FMT_U8, uint8_t,(*(constuint8_t *) pi-0x80)*(1.0/(1<< 7))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_U8, uint8_t, AV_SAMPLE_FMT_S16, int16_t,(*(constint16_t *) pi >>8)+0x80) CONV_FUNC_GROUP(AV_SAMPLE_FMT_FLT, float, AV_SAMPLE_FMT_S16, int16_t,*(constint16_t *) pi *(1.0f/(1<< 15))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_DBL, double, AV_SAMPLE_FMT_S16, int16_t,*(constint16_t *) pi *(1.0/(1<< 15))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_U8, uint8_t, AV_SAMPLE_FMT_S32, int32_t,(*(constint32_t *) pi >>24)+0x80) CONV_FUNC_GROUP(AV_SAMPLE_FMT_FLT, float, AV_SAMPLE_FMT_S32, int32_t,*(constint32_t *) pi *(1.0f/(1U<< 31))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_DBL, double, AV_SAMPLE_FMT_S32, int32_t,*(constint32_t *) pi *(1.0/(1U<< 31))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_U8, uint8_t, AV_SAMPLE_FMT_FLT, float, av_clip_uint8(lrintf(*(constfloat *) pi *(1<< 7))+0x80)) CONV_FUNC_GROUP(AV_SAMPLE_FMT_S16, int16_t, AV_SAMPLE_FMT_FLT, float, av_clip_int16(lrintf(*(constfloat *) pi *(1<< 15)))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_S32, int32_t, AV_SAMPLE_FMT_FLT, float, av_clipl_int32(llrintf(*(constfloat *) pi *(1U<< 31)))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_U8, uint8_t, AV_SAMPLE_FMT_DBL, double, av_clip_uint8(lrint(*(constdouble *) pi *(1<< 7))+0x80)) CONV_FUNC_GROUP(AV_SAMPLE_FMT_S16, int16_t, AV_SAMPLE_FMT_DBL, double, av_clip_int16(lrint(*(constdouble *) pi *(1<< 15)))) CONV_FUNC_GROUP(AV_SAMPLE_FMT_S32, int32_t, AV_SAMPLE_FMT_DBL, double, av_clipl_int32(llrint(*(constdouble *) pi *(1U<< 31))))#defineSET_CONV_FUNC_GROUP(ofmt, ifmt) staticvoidset_generic_function(AudioConvert *ac){}voidff_audio_convert_free(AudioConvert **ac){if(!*ac) return;ff_dither_free(&(*ac) ->dc);av_freep(ac);}AudioConvert *ff_audio_convert_alloc(AVAudioResampleContext *avr, enumAVSampleFormatout_fmt, enumAVSampleFormatin_fmt, intchannels, intsample_rate, intapply_map){AudioConvert *ac;intin_planar, out_planar;ac=av_mallocz(sizeof(*ac));if(!ac) returnNULL;ac->avr=avr;ac->out_fmt=out_fmt;ac->in_fmt=in_fmt;ac->channels=channels;ac->apply_map=apply_map;if(avr->dither_method!=AV_RESAMPLE_DITHER_NONE &&av_get_packed_sample_fmt(out_fmt)==AV_SAMPLE_FMT_S16 &&av_get_bytes_per_sample(in_fmt)>2){ac->dc=ff_dither_alloc(avr, out_fmt, in_fmt, channels, sample_rate, apply_map);if(!ac->dc){av_free(ac);returnNULL;}returnac;}in_planar=ff_sample_fmt_is_planar(in_fmt, channels);out_planar=ff_sample_fmt_is_planar(out_fmt, channels);if(in_planar==out_planar){ac->func_type=CONV_FUNC_TYPE_FLAT;ac->planes=in_planar?ac->channels:1;}elseif(in_planar) ac->func_type=CONV_FUNC_TYPE_INTERLEAVE;elseac->func_type=CONV_FUNC_TYPE_DEINTERLEAVE;set_generic_function(ac);if(ARCH_AARCH64) ff_audio_convert_init_aarch64(ac);if(ARCH_ARM) ff_audio_convert_init_arm(ac);if(ARCH_X86) ff_audio_convert_init_x86(ac);returnac;}intff_audio_convert(AudioConvert *ac, AudioData *out, AudioData *in){intuse_generic=1;intlen=in->nb_samples;intp;if(ac->dc){av_dlog(ac->avr,"%dsamples-audio_convert:%sto%s(dithered)\n", len, av_get_sample_fmt_name(ac->in_fmt), av_get_sample_fmt_name(ac->out_fmt));returnff_convert_dither(ac-> dc
GLint GLenum GLboolean GLsizei stride
static int is_intra_more_likely(ERContext *s)
int16_t(*[2] motion_val)[2]
static int er_supported(ERContext *s)
void ff_er_frame_start(ERContext *s)
static void h_block_filter(ERContext *s, uint8_t *dst, int w, int h, int stride, int is_luma)
simple horizontal deblocking filter used for error resilience
#define av_malloc_array(a, b)
int(* decode_slice)(AVCodecContext *avctx, const uint8_t *buf, uint32_t buf_size)
Callback for each slice.
#define MV_TYPE_8X8
4 vectors (h263, mpeg4 4MV)
static void set_mv_strides(ERContext *s, int *mv_step, int *stride)