2010-09-25 19:43:42 +03:00
|
|
|
/*
|
2011-11-11 19:06:47 +03:00
|
|
|
* Copyright (C) 2006-2011 Michael Niedermayer <michaelni@gmx.at>
|
2010-11-24 22:25:09 +02:00
|
|
|
* 2010 James Darnley <james.darnley@gmail.com>
|
2015-09-27 13:07:12 +02:00
|
|
|
|
|
|
|
* This file is part of FFmpeg.
|
2010-09-25 19:43:42 +03:00
|
|
|
*
|
2014-01-04 16:21:19 +03:00
|
|
|
* FFmpeg is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
2010-09-25 19:43:42 +03:00
|
|
|
*
|
|
|
|
* FFmpeg is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
2014-01-04 16:21:19 +03:00
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
2010-09-25 19:43:42 +03:00
|
|
|
*
|
2014-01-04 16:21:19 +03:00
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
* License along with FFmpeg; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
2010-09-25 19:43:42 +03:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "libavutil/common.h"
|
2011-04-05 03:45:10 +03:00
|
|
|
#include "libavutil/pixdesc.h"
|
2010-09-25 19:43:42 +03:00
|
|
|
#include "avfilter.h"
|
2012-05-30 12:20:32 +03:00
|
|
|
#include "internal.h"
|
2010-09-25 19:43:42 +03:00
|
|
|
#include "yadif.h"
|
|
|
|
|
2013-05-11 22:40:28 +03:00
|
|
|
typedef struct ThreadData {
|
|
|
|
AVFrame *frame;
|
|
|
|
int plane;
|
|
|
|
int w, h;
|
|
|
|
int parity;
|
|
|
|
int tff;
|
|
|
|
} ThreadData;
|
|
|
|
|
2010-09-25 19:43:42 +03:00
|
|
|
#define CHECK(j)\
|
2014-01-04 15:50:05 +03:00
|
|
|
{ int score = FFABS(cur[mrefs - 1 + (j)] - cur[prefs - 1 - (j)])\
|
|
|
|
+ FFABS(cur[mrefs +(j)] - cur[prefs -(j)])\
|
|
|
|
+ FFABS(cur[mrefs + 1 + (j)] - cur[prefs + 1 - (j)]);\
|
2010-09-25 19:43:42 +03:00
|
|
|
if (score < spatial_score) {\
|
|
|
|
spatial_score= score;\
|
2014-01-04 15:50:05 +03:00
|
|
|
spatial_pred= (cur[mrefs +(j)] + cur[prefs -(j)])>>1;\
|
2010-09-25 19:43:42 +03:00
|
|
|
|
2013-03-10 17:08:50 +03:00
|
|
|
/* The is_not_edge argument here controls when the code will enter a branch
|
|
|
|
* which reads up to and including x-3 and x+3. */
|
|
|
|
|
|
|
|
#define FILTER(start, end, is_not_edge) \
|
2013-02-07 20:31:45 +03:00
|
|
|
for (x = start; x < end; x++) { \
|
2011-04-05 04:11:05 +03:00
|
|
|
int c = cur[mrefs]; \
|
|
|
|
int d = (prev2[0] + next2[0])>>1; \
|
|
|
|
int e = cur[prefs]; \
|
|
|
|
int temporal_diff0 = FFABS(prev2[0] - next2[0]); \
|
|
|
|
int temporal_diff1 =(FFABS(prev[mrefs] - c) + FFABS(prev[prefs] - e) )>>1; \
|
|
|
|
int temporal_diff2 =(FFABS(next[mrefs] - c) + FFABS(next[prefs] - e) )>>1; \
|
2012-09-01 17:04:42 +03:00
|
|
|
int diff = FFMAX3(temporal_diff0 >> 1, temporal_diff1, temporal_diff2); \
|
|
|
|
int spatial_pred = (c+e) >> 1; \
|
2011-04-05 04:11:05 +03:00
|
|
|
\
|
2013-03-10 17:08:50 +03:00
|
|
|
if (is_not_edge) {\
|
|
|
|
int spatial_score = FFABS(cur[mrefs - 1] - cur[prefs - 1]) + FFABS(c-e) \
|
|
|
|
+ FFABS(cur[mrefs + 1] - cur[prefs + 1]) - 1; \
|
2013-02-07 20:31:45 +03:00
|
|
|
CHECK(-1) CHECK(-2) }} }} \
|
|
|
|
CHECK( 1) CHECK( 2) }} }} \
|
|
|
|
}\
|
2011-04-05 04:11:05 +03:00
|
|
|
\
|
2013-09-05 21:53:12 +03:00
|
|
|
if (!(mode&2)) { \
|
2012-09-01 17:04:42 +03:00
|
|
|
int b = (prev2[2 * mrefs] + next2[2 * mrefs])>>1; \
|
|
|
|
int f = (prev2[2 * prefs] + next2[2 * prefs])>>1; \
|
|
|
|
int max = FFMAX3(d - e, d - c, FFMIN(b - c, f - e)); \
|
|
|
|
int min = FFMIN3(d - e, d - c, FFMAX(b - c, f - e)); \
|
2011-04-05 04:11:05 +03:00
|
|
|
\
|
|
|
|
diff = FFMAX3(diff, min, -max); \
|
|
|
|
} \
|
|
|
|
\
|
|
|
|
if (spatial_pred > d + diff) \
|
|
|
|
spatial_pred = d + diff; \
|
|
|
|
else if (spatial_pred < d - diff) \
|
|
|
|
spatial_pred = d - diff; \
|
|
|
|
\
|
|
|
|
dst[0] = spatial_pred; \
|
|
|
|
\
|
|
|
|
dst++; \
|
|
|
|
cur++; \
|
|
|
|
prev++; \
|
|
|
|
next++; \
|
|
|
|
prev2++; \
|
|
|
|
next2++; \
|
|
|
|
}
|
2010-09-25 19:43:42 +03:00
|
|
|
|
vf_yadif: silence a warning.
clang says:
libavfilter/vf_yadif.c:192:28: warning: incompatible pointer types assigning to
'void (*)(uint8_t *, uint8_t *, uint8_t *, uint8_t *, int, int, int, int, int)'
from 'void (uint16_t *, uint16_t *, uint16_t *, uint16_t *, int, int, int, int, int)'
2013-01-26 22:49:16 +03:00
|
|
|
static void filter_line_c(void *dst1,
|
|
|
|
void *prev1, void *cur1, void *next1,
|
2011-04-05 04:11:05 +03:00
|
|
|
int w, int prefs, int mrefs, int parity, int mode)
|
|
|
|
{
|
vf_yadif: silence a warning.
clang says:
libavfilter/vf_yadif.c:192:28: warning: incompatible pointer types assigning to
'void (*)(uint8_t *, uint8_t *, uint8_t *, uint8_t *, int, int, int, int, int)'
from 'void (uint16_t *, uint16_t *, uint16_t *, uint16_t *, int, int, int, int, int)'
2013-01-26 22:49:16 +03:00
|
|
|
uint8_t *dst = dst1;
|
|
|
|
uint8_t *prev = prev1;
|
|
|
|
uint8_t *cur = cur1;
|
|
|
|
uint8_t *next = next1;
|
2011-04-05 04:11:05 +03:00
|
|
|
int x;
|
|
|
|
uint8_t *prev2 = parity ? prev : cur ;
|
|
|
|
uint8_t *next2 = parity ? cur : next;
|
2010-09-25 19:43:42 +03:00
|
|
|
|
2013-03-10 17:08:50 +03:00
|
|
|
/* The function is called with the pointers already pointing to data[3] and
|
|
|
|
* with 6 subtracted from the width. This allows the FILTER macro to be
|
|
|
|
* called so that it processes all the pixels normally. A constant value of
|
|
|
|
* true for is_not_edge lets the compiler ignore the if statement. */
|
|
|
|
FILTER(0, w, 1)
|
2010-09-25 19:43:42 +03:00
|
|
|
}
|
|
|
|
|
2013-05-24 18:12:58 +03:00
|
|
|
#define MAX_ALIGN 8
|
2013-02-07 20:31:45 +03:00
|
|
|
static void filter_edges(void *dst1, void *prev1, void *cur1, void *next1,
|
2013-03-10 17:08:50 +03:00
|
|
|
int w, int prefs, int mrefs, int parity, int mode)
|
2013-02-07 20:31:45 +03:00
|
|
|
{
|
|
|
|
uint8_t *dst = dst1;
|
|
|
|
uint8_t *prev = prev1;
|
|
|
|
uint8_t *cur = cur1;
|
|
|
|
uint8_t *next = next1;
|
|
|
|
int x;
|
|
|
|
uint8_t *prev2 = parity ? prev : cur ;
|
|
|
|
uint8_t *next2 = parity ? cur : next;
|
|
|
|
|
2017-08-21 09:55:48 +02:00
|
|
|
const int edge = MAX_ALIGN - 1;
|
2021-05-29 11:17:35 +02:00
|
|
|
int offset = FFMAX(w - edge, 3);
|
2017-08-21 09:55:48 +02:00
|
|
|
|
2013-03-10 17:08:50 +03:00
|
|
|
/* Only edge pixels need to be processed here. A constant value of false
|
|
|
|
* for is_not_edge should let the compiler ignore the whole branch. */
|
2021-05-29 11:17:35 +02:00
|
|
|
FILTER(0, FFMIN(3, w), 0)
|
2013-02-07 20:31:45 +03:00
|
|
|
|
2021-05-29 11:17:35 +02:00
|
|
|
dst = (uint8_t*)dst1 + offset;
|
|
|
|
prev = (uint8_t*)prev1 + offset;
|
|
|
|
cur = (uint8_t*)cur1 + offset;
|
|
|
|
next = (uint8_t*)next1 + offset;
|
2013-02-07 20:31:45 +03:00
|
|
|
prev2 = (uint8_t*)(parity ? prev : cur);
|
|
|
|
next2 = (uint8_t*)(parity ? cur : next);
|
|
|
|
|
2021-05-29 11:17:35 +02:00
|
|
|
FILTER(offset, w - 3, 1)
|
|
|
|
offset = FFMAX(offset, w - 3);
|
|
|
|
FILTER(offset, w, 0)
|
2013-02-07 20:31:45 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
|
vf_yadif: silence a warning.
clang says:
libavfilter/vf_yadif.c:192:28: warning: incompatible pointer types assigning to
'void (*)(uint8_t *, uint8_t *, uint8_t *, uint8_t *, int, int, int, int, int)'
from 'void (uint16_t *, uint16_t *, uint16_t *, uint16_t *, int, int, int, int, int)'
2013-01-26 22:49:16 +03:00
|
|
|
static void filter_line_c_16bit(void *dst1,
|
|
|
|
void *prev1, void *cur1, void *next1,
|
2012-09-01 17:04:42 +03:00
|
|
|
int w, int prefs, int mrefs, int parity,
|
|
|
|
int mode)
|
2010-11-24 22:25:09 +02:00
|
|
|
{
|
vf_yadif: silence a warning.
clang says:
libavfilter/vf_yadif.c:192:28: warning: incompatible pointer types assigning to
'void (*)(uint8_t *, uint8_t *, uint8_t *, uint8_t *, int, int, int, int, int)'
from 'void (uint16_t *, uint16_t *, uint16_t *, uint16_t *, int, int, int, int, int)'
2013-01-26 22:49:16 +03:00
|
|
|
uint16_t *dst = dst1;
|
|
|
|
uint16_t *prev = prev1;
|
|
|
|
uint16_t *cur = cur1;
|
|
|
|
uint16_t *next = next1;
|
2010-11-24 22:25:09 +02:00
|
|
|
int x;
|
|
|
|
uint16_t *prev2 = parity ? prev : cur ;
|
|
|
|
uint16_t *next2 = parity ? cur : next;
|
2011-04-05 04:02:52 +03:00
|
|
|
mrefs /= 2;
|
|
|
|
prefs /= 2;
|
2010-11-24 22:25:09 +02:00
|
|
|
|
2013-03-10 17:08:50 +03:00
|
|
|
FILTER(0, w, 1)
|
2013-02-07 20:31:45 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
static void filter_edges_16bit(void *dst1, void *prev1, void *cur1, void *next1,
|
2013-03-10 17:08:50 +03:00
|
|
|
int w, int prefs, int mrefs, int parity, int mode)
|
2013-02-07 20:31:45 +03:00
|
|
|
{
|
|
|
|
uint16_t *dst = dst1;
|
|
|
|
uint16_t *prev = prev1;
|
|
|
|
uint16_t *cur = cur1;
|
|
|
|
uint16_t *next = next1;
|
|
|
|
int x;
|
|
|
|
uint16_t *prev2 = parity ? prev : cur ;
|
|
|
|
uint16_t *next2 = parity ? cur : next;
|
2017-08-21 09:55:48 +02:00
|
|
|
|
|
|
|
const int edge = MAX_ALIGN / 2 - 1;
|
2021-05-29 11:17:35 +02:00
|
|
|
int offset = FFMAX(w - edge, 3);
|
2017-08-21 09:55:48 +02:00
|
|
|
|
2013-03-15 18:37:33 +03:00
|
|
|
mrefs /= 2;
|
|
|
|
prefs /= 2;
|
2013-02-07 20:31:45 +03:00
|
|
|
|
2021-05-29 11:17:35 +02:00
|
|
|
FILTER(0, FFMIN(3, w), 0)
|
2013-02-07 20:31:45 +03:00
|
|
|
|
2021-05-29 11:17:35 +02:00
|
|
|
dst = (uint16_t*)dst1 + offset;
|
|
|
|
prev = (uint16_t*)prev1 + offset;
|
|
|
|
cur = (uint16_t*)cur1 + offset;
|
|
|
|
next = (uint16_t*)next1 + offset;
|
2013-02-07 20:31:45 +03:00
|
|
|
prev2 = (uint16_t*)(parity ? prev : cur);
|
|
|
|
next2 = (uint16_t*)(parity ? cur : next);
|
|
|
|
|
2021-05-29 11:17:35 +02:00
|
|
|
FILTER(offset, w - 3, 1)
|
|
|
|
offset = FFMAX(offset, w - 3);
|
|
|
|
FILTER(offset, w, 0)
|
2010-11-24 22:25:09 +02:00
|
|
|
}
|
|
|
|
|
2013-05-11 22:40:28 +03:00
|
|
|
static int filter_slice(AVFilterContext *ctx, void *arg, int jobnr, int nb_jobs)
|
|
|
|
{
|
|
|
|
YADIFContext *s = ctx->priv;
|
|
|
|
ThreadData *td = arg;
|
|
|
|
int refs = s->cur->linesize[td->plane];
|
2020-08-27 01:30:30 +02:00
|
|
|
int df = (s->csp->comp[td->plane].depth + 7) / 8;
|
2013-05-11 22:40:28 +03:00
|
|
|
int pix_3 = 3 * df;
|
2013-05-24 18:33:59 +03:00
|
|
|
int slice_start = (td->h * jobnr ) / nb_jobs;
|
|
|
|
int slice_end = (td->h * (jobnr+1)) / nb_jobs;
|
2013-05-11 22:40:28 +03:00
|
|
|
int y;
|
2017-08-21 09:55:48 +02:00
|
|
|
int edge = 3 + MAX_ALIGN / df - 1;
|
2013-05-11 22:40:28 +03:00
|
|
|
|
|
|
|
/* filtering reads 3 pixels to the left/right; to avoid invalid reads,
|
|
|
|
* we need to call the c variant which avoids this for border pixels
|
|
|
|
*/
|
|
|
|
for (y = slice_start; y < slice_end; y++) {
|
|
|
|
if ((y ^ td->parity) & 1) {
|
|
|
|
uint8_t *prev = &s->prev->data[td->plane][y * refs];
|
|
|
|
uint8_t *cur = &s->cur ->data[td->plane][y * refs];
|
|
|
|
uint8_t *next = &s->next->data[td->plane][y * refs];
|
|
|
|
uint8_t *dst = &td->frame->data[td->plane][y * td->frame->linesize[td->plane]];
|
|
|
|
int mode = y == 1 || y + 2 == td->h ? 2 : s->mode;
|
|
|
|
s->filter_line(dst + pix_3, prev + pix_3, cur + pix_3,
|
2017-08-21 09:55:48 +02:00
|
|
|
next + pix_3, td->w - edge,
|
2013-05-11 22:40:28 +03:00
|
|
|
y + 1 < td->h ? refs : -refs,
|
|
|
|
y ? -refs : refs,
|
|
|
|
td->parity ^ td->tff, mode);
|
|
|
|
s->filter_edges(dst, prev, cur, next, td->w,
|
|
|
|
y + 1 < td->h ? refs : -refs,
|
|
|
|
y ? -refs : refs,
|
|
|
|
td->parity ^ td->tff, mode);
|
|
|
|
} else {
|
|
|
|
memcpy(&td->frame->data[td->plane][y * td->frame->linesize[td->plane]],
|
|
|
|
&s->cur->data[td->plane][y * refs], td->w * df);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-11-28 10:41:07 +03:00
|
|
|
static void filter(AVFilterContext *ctx, AVFrame *dstpic,
|
2010-09-25 19:43:42 +03:00
|
|
|
int parity, int tff)
|
|
|
|
{
|
|
|
|
YADIFContext *yadif = ctx->priv;
|
2013-05-11 22:40:28 +03:00
|
|
|
ThreadData td = { .frame = dstpic, .parity = parity, .tff = tff };
|
|
|
|
int i;
|
2010-09-25 19:43:42 +03:00
|
|
|
|
2020-08-27 01:30:30 +02:00
|
|
|
for (i = 0; i < yadif->csp->nb_components; i++) {
|
2012-11-28 10:41:07 +03:00
|
|
|
int w = dstpic->width;
|
|
|
|
int h = dstpic->height;
|
2010-09-25 19:43:42 +03:00
|
|
|
|
2011-08-27 19:32:14 +03:00
|
|
|
if (i == 1 || i == 2) {
|
2020-08-27 01:30:30 +02:00
|
|
|
w = AV_CEIL_RSHIFT(w, yadif->csp->log2_chroma_w);
|
|
|
|
h = AV_CEIL_RSHIFT(h, yadif->csp->log2_chroma_h);
|
2011-04-05 03:45:10 +03:00
|
|
|
}
|
|
|
|
|
2013-05-11 22:40:28 +03:00
|
|
|
|
|
|
|
td.w = w;
|
|
|
|
td.h = h;
|
|
|
|
td.plane = i;
|
|
|
|
|
2021-08-15 21:33:25 +02:00
|
|
|
ff_filter_execute(ctx, filter_slice, &td, NULL,
|
|
|
|
FFMIN(h, ff_filter_get_nb_threads(ctx)));
|
2010-09-25 19:43:42 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-09-29 15:57:43 +02:00
|
|
|
static const enum AVPixelFormat pix_fmts[] = {
|
|
|
|
AV_PIX_FMT_YUV420P, AV_PIX_FMT_YUV422P, AV_PIX_FMT_YUV444P,
|
|
|
|
AV_PIX_FMT_YUV410P, AV_PIX_FMT_YUV411P, AV_PIX_FMT_YUV440P,
|
|
|
|
AV_PIX_FMT_GRAY8, AV_PIX_FMT_GRAY16,
|
|
|
|
AV_PIX_FMT_YUVJ420P, AV_PIX_FMT_YUVJ422P, AV_PIX_FMT_YUVJ444P,
|
|
|
|
AV_PIX_FMT_YUVJ440P,
|
|
|
|
AV_PIX_FMT_YUV420P9, AV_PIX_FMT_YUV422P9, AV_PIX_FMT_YUV444P9,
|
|
|
|
AV_PIX_FMT_YUV420P10, AV_PIX_FMT_YUV422P10, AV_PIX_FMT_YUV444P10,
|
|
|
|
AV_PIX_FMT_YUV420P12, AV_PIX_FMT_YUV422P12, AV_PIX_FMT_YUV444P12,
|
|
|
|
AV_PIX_FMT_YUV420P14, AV_PIX_FMT_YUV422P14, AV_PIX_FMT_YUV444P14,
|
|
|
|
AV_PIX_FMT_YUV420P16, AV_PIX_FMT_YUV422P16, AV_PIX_FMT_YUV444P16,
|
|
|
|
AV_PIX_FMT_YUVA420P, AV_PIX_FMT_YUVA422P, AV_PIX_FMT_YUVA444P,
|
|
|
|
AV_PIX_FMT_GBRP, AV_PIX_FMT_GBRP9, AV_PIX_FMT_GBRP10,
|
|
|
|
AV_PIX_FMT_GBRP12, AV_PIX_FMT_GBRP14, AV_PIX_FMT_GBRP16,
|
|
|
|
AV_PIX_FMT_GBRAP,
|
|
|
|
AV_PIX_FMT_NONE
|
|
|
|
};
|
2010-09-25 19:43:42 +03:00
|
|
|
|
2019-11-28 03:41:15 +02:00
|
|
|
static int config_output(AVFilterLink *outlink)
|
2012-05-12 20:40:41 +03:00
|
|
|
{
|
2019-11-28 03:41:15 +02:00
|
|
|
AVFilterContext *ctx = outlink->src;
|
2016-01-31 23:23:07 +02:00
|
|
|
YADIFContext *s = ctx->priv;
|
2023-05-11 19:34:57 +02:00
|
|
|
int ret;
|
2012-07-30 06:08:19 +03:00
|
|
|
|
2024-01-26 00:08:52 +02:00
|
|
|
ret = ff_yadif_config_output_common(outlink);
|
|
|
|
if (ret < 0)
|
2023-05-11 19:34:57 +02:00
|
|
|
return ret;
|
2013-01-02 13:17:07 +03:00
|
|
|
|
2020-08-27 01:30:30 +02:00
|
|
|
s->csp = av_pix_fmt_desc_get(outlink->format);
|
2018-10-24 20:52:42 +02:00
|
|
|
s->filter = filter;
|
2020-08-27 01:30:30 +02:00
|
|
|
if (s->csp->comp[0].depth > 8) {
|
2013-02-07 20:31:45 +03:00
|
|
|
s->filter_line = filter_line_c_16bit;
|
|
|
|
s->filter_edges = filter_edges_16bit;
|
2013-02-09 10:28:37 +03:00
|
|
|
} else {
|
2013-02-07 20:31:45 +03:00
|
|
|
s->filter_line = filter_line_c;
|
|
|
|
s->filter_edges = filter_edges;
|
yadif: x86 assembly for 16-bit samples
This is a fairly dumb copy of the assembly for 8-bit samples but it
works and produces identical output to the C version. The options have
been tested on an Athlon64 and a Core2Quad.
Athlon64:
1810385 decicycles in C, 32726 runs, 42 skips
1080744 decicycles in mmx, 32744 runs, 24 skips, 1.7x faster
818315 decicycles in sse2, 32735 runs, 33 skips, 2.2x faster
Core2Quad:
924025 decicycles in C, 32750 runs, 18 skips
623995 decicycles in mmx, 32767 runs, 1 skips, 1.5x faster
406223 decicycles in sse2, 32764 runs, 4 skips, 2.3x faster
387842 decicycles in ssse3, 32767 runs, 1 skips, 2.4x faster
307726 decicycles in sse4, 32763 runs, 5 skips, 3.0x faster
Signed-off-by: Michael Niedermayer <michaelni@gmx.at>
2013-03-16 23:42:23 +03:00
|
|
|
}
|
2013-02-09 10:28:37 +03:00
|
|
|
|
2022-06-12 05:51:12 +02:00
|
|
|
#if ARCH_X86
|
|
|
|
ff_yadif_init_x86(s);
|
|
|
|
#endif
|
2014-01-04 15:49:38 +03:00
|
|
|
|
2012-05-12 20:40:41 +03:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-04-11 02:14:01 +03:00
|
|
|
|
2018-10-24 20:52:42 +02:00
|
|
|
static const AVClass yadif_class = {
|
|
|
|
.class_name = "yadif",
|
2024-01-19 14:33:28 +02:00
|
|
|
.item_name = av_default_item_name,
|
2018-10-24 20:52:42 +02:00
|
|
|
.option = ff_yadif_options,
|
|
|
|
.version = LIBAVUTIL_VERSION_INT,
|
|
|
|
.category = AV_CLASS_CATEGORY_FILTER,
|
2013-02-25 23:21:29 +03:00
|
|
|
};
|
|
|
|
|
2014-01-04 15:50:19 +03:00
|
|
|
static const AVFilterPad avfilter_vf_yadif_inputs[] = {
|
|
|
|
{
|
|
|
|
.name = "default",
|
|
|
|
.type = AVMEDIA_TYPE_VIDEO,
|
2018-10-24 20:52:42 +02:00
|
|
|
.filter_frame = ff_yadif_filter_frame,
|
2014-01-04 15:50:19 +03:00
|
|
|
},
|
|
|
|
};
|
|
|
|
|
|
|
|
static const AVFilterPad avfilter_vf_yadif_outputs[] = {
|
|
|
|
{
|
|
|
|
.name = "default",
|
|
|
|
.type = AVMEDIA_TYPE_VIDEO,
|
2018-10-24 20:52:42 +02:00
|
|
|
.request_frame = ff_yadif_request_frame,
|
2019-11-28 03:41:15 +02:00
|
|
|
.config_props = config_output,
|
2014-01-04 15:50:19 +03:00
|
|
|
},
|
|
|
|
};
|
|
|
|
|
2021-04-19 18:33:56 +02:00
|
|
|
const AVFilter ff_vf_yadif = {
|
2010-09-25 19:43:42 +03:00
|
|
|
.name = "yadif",
|
2012-01-20 02:16:27 +03:00
|
|
|
.description = NULL_IF_CONFIG_SMALL("Deinterlace the input image."),
|
2010-09-25 19:43:42 +03:00
|
|
|
.priv_size = sizeof(YADIFContext),
|
2013-02-25 23:21:29 +03:00
|
|
|
.priv_class = &yadif_class,
|
2024-01-26 00:08:52 +02:00
|
|
|
.uninit = ff_yadif_uninit,
|
2021-08-12 13:05:31 +02:00
|
|
|
FILTER_INPUTS(avfilter_vf_yadif_inputs),
|
|
|
|
FILTER_OUTPUTS(avfilter_vf_yadif_outputs),
|
2021-09-27 16:52:31 +02:00
|
|
|
FILTER_PIXFMTS_ARRAY(pix_fmts),
|
2013-09-07 15:13:50 +03:00
|
|
|
.flags = AVFILTER_FLAG_SUPPORT_TIMELINE_INTERNAL | AVFILTER_FLAG_SLICE_THREADS,
|
2010-09-25 19:43:42 +03:00
|
|
|
};
|