• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /*
2  * Copyright (C) 2006-2011 Michael Niedermayer <michaelni@gmx.at>
3  *               2010      James Darnley <james.darnley@gmail.com>
4 
5  * This file is part of FFmpeg.
6  *
7  * FFmpeg is free software; you can redistribute it and/or
8  * modify it under the terms of the GNU Lesser General Public
9  * License as published by the Free Software Foundation; either
10  * version 2.1 of the License, or (at your option) any later version.
11  *
12  * FFmpeg is distributed in the hope that it will be useful,
13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
15  * Lesser General Public License for more details.
16  *
17  * You should have received a copy of the GNU Lesser General Public
18  * License along with FFmpeg; if not, write to the Free Software
19  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20  */
21 
22 #include "libavutil/common.h"
23 #include "libavutil/pixdesc.h"
24 #include "libavutil/imgutils.h"
25 #include "avfilter.h"
26 #include "formats.h"
27 #include "internal.h"
28 #include "video.h"
29 #include "yadif.h"
30 
31 typedef struct ThreadData {
32     AVFrame *frame;
33     int plane;
34     int w, h;
35     int parity;
36     int tff;
37 } ThreadData;
38 
39 #define CHECK(j)\
40     {   int score = FFABS(cur[mrefs - 1 + (j)] - cur[prefs - 1 - (j)])\
41                   + FFABS(cur[mrefs  +(j)] - cur[prefs  -(j)])\
42                   + FFABS(cur[mrefs + 1 + (j)] - cur[prefs + 1 - (j)]);\
43         if (score < spatial_score) {\
44             spatial_score= score;\
45             spatial_pred= (cur[mrefs  +(j)] + cur[prefs  -(j)])>>1;\
46 
47 /* The is_not_edge argument here controls when the code will enter a branch
48  * which reads up to and including x-3 and x+3. */
49 
50 #define FILTER(start, end, is_not_edge) \
51     for (x = start;  x < end; x++) { \
52         int c = cur[mrefs]; \
53         int d = (prev2[0] + next2[0])>>1; \
54         int e = cur[prefs]; \
55         int temporal_diff0 = FFABS(prev2[0] - next2[0]); \
56         int temporal_diff1 =(FFABS(prev[mrefs] - c) + FFABS(prev[prefs] - e) )>>1; \
57         int temporal_diff2 =(FFABS(next[mrefs] - c) + FFABS(next[prefs] - e) )>>1; \
58         int diff = FFMAX3(temporal_diff0 >> 1, temporal_diff1, temporal_diff2); \
59         int spatial_pred = (c+e) >> 1; \
60  \
61         if (is_not_edge) {\
62             int spatial_score = FFABS(cur[mrefs - 1] - cur[prefs - 1]) + FFABS(c-e) \
63                               + FFABS(cur[mrefs + 1] - cur[prefs + 1]) - 1; \
64             CHECK(-1) CHECK(-2) }} }} \
65             CHECK( 1) CHECK( 2) }} }} \
66         }\
67  \
68         if (!(mode&2)) { \
69             int b = (prev2[2 * mrefs] + next2[2 * mrefs])>>1; \
70             int f = (prev2[2 * prefs] + next2[2 * prefs])>>1; \
71             int max = FFMAX3(d - e, d - c, FFMIN(b - c, f - e)); \
72             int min = FFMIN3(d - e, d - c, FFMAX(b - c, f - e)); \
73  \
74             diff = FFMAX3(diff, min, -max); \
75         } \
76  \
77         if (spatial_pred > d + diff) \
78            spatial_pred = d + diff; \
79         else if (spatial_pred < d - diff) \
80            spatial_pred = d - diff; \
81  \
82         dst[0] = spatial_pred; \
83  \
84         dst++; \
85         cur++; \
86         prev++; \
87         next++; \
88         prev2++; \
89         next2++; \
90     }
91 
filter_line_c(void * dst1,void * prev1,void * cur1,void * next1,int w,int prefs,int mrefs,int parity,int mode)92 static void filter_line_c(void *dst1,
93                           void *prev1, void *cur1, void *next1,
94                           int w, int prefs, int mrefs, int parity, int mode)
95 {
96     uint8_t *dst  = dst1;
97     uint8_t *prev = prev1;
98     uint8_t *cur  = cur1;
99     uint8_t *next = next1;
100     int x;
101     uint8_t *prev2 = parity ? prev : cur ;
102     uint8_t *next2 = parity ? cur  : next;
103 
104     /* The function is called with the pointers already pointing to data[3] and
105      * with 6 subtracted from the width.  This allows the FILTER macro to be
106      * called so that it processes all the pixels normally.  A constant value of
107      * true for is_not_edge lets the compiler ignore the if statement. */
108     FILTER(0, w, 1)
109 }
110 
111 #define MAX_ALIGN 8
filter_edges(void * dst1,void * prev1,void * cur1,void * next1,int w,int prefs,int mrefs,int parity,int mode)112 static void filter_edges(void *dst1, void *prev1, void *cur1, void *next1,
113                          int w, int prefs, int mrefs, int parity, int mode)
114 {
115     uint8_t *dst  = dst1;
116     uint8_t *prev = prev1;
117     uint8_t *cur  = cur1;
118     uint8_t *next = next1;
119     int x;
120     uint8_t *prev2 = parity ? prev : cur ;
121     uint8_t *next2 = parity ? cur  : next;
122 
123     const int edge = MAX_ALIGN - 1;
124     int offset = FFMAX(w - edge, 3);
125 
126     /* Only edge pixels need to be processed here.  A constant value of false
127      * for is_not_edge should let the compiler ignore the whole branch. */
128     FILTER(0, FFMIN(3, w), 0)
129 
130     dst  = (uint8_t*)dst1  + offset;
131     prev = (uint8_t*)prev1 + offset;
132     cur  = (uint8_t*)cur1  + offset;
133     next = (uint8_t*)next1 + offset;
134     prev2 = (uint8_t*)(parity ? prev : cur);
135     next2 = (uint8_t*)(parity ? cur  : next);
136 
137     FILTER(offset, w - 3, 1)
138     offset = FFMAX(offset, w - 3);
139     FILTER(offset, w, 0)
140 }
141 
142 
filter_line_c_16bit(void * dst1,void * prev1,void * cur1,void * next1,int w,int prefs,int mrefs,int parity,int mode)143 static void filter_line_c_16bit(void *dst1,
144                                 void *prev1, void *cur1, void *next1,
145                                 int w, int prefs, int mrefs, int parity,
146                                 int mode)
147 {
148     uint16_t *dst  = dst1;
149     uint16_t *prev = prev1;
150     uint16_t *cur  = cur1;
151     uint16_t *next = next1;
152     int x;
153     uint16_t *prev2 = parity ? prev : cur ;
154     uint16_t *next2 = parity ? cur  : next;
155     mrefs /= 2;
156     prefs /= 2;
157 
158     FILTER(0, w, 1)
159 }
160 
filter_edges_16bit(void * dst1,void * prev1,void * cur1,void * next1,int w,int prefs,int mrefs,int parity,int mode)161 static void filter_edges_16bit(void *dst1, void *prev1, void *cur1, void *next1,
162                                int w, int prefs, int mrefs, int parity, int mode)
163 {
164     uint16_t *dst  = dst1;
165     uint16_t *prev = prev1;
166     uint16_t *cur  = cur1;
167     uint16_t *next = next1;
168     int x;
169     uint16_t *prev2 = parity ? prev : cur ;
170     uint16_t *next2 = parity ? cur  : next;
171 
172     const int edge = MAX_ALIGN / 2 - 1;
173     int offset = FFMAX(w - edge, 3);
174 
175     mrefs /= 2;
176     prefs /= 2;
177 
178     FILTER(0,  FFMIN(3, w), 0)
179 
180     dst   = (uint16_t*)dst1  + offset;
181     prev  = (uint16_t*)prev1 + offset;
182     cur   = (uint16_t*)cur1  + offset;
183     next  = (uint16_t*)next1 + offset;
184     prev2 = (uint16_t*)(parity ? prev : cur);
185     next2 = (uint16_t*)(parity ? cur  : next);
186 
187     FILTER(offset, w - 3, 1)
188     offset = FFMAX(offset, w - 3);
189     FILTER(offset, w, 0)
190 }
191 
filter_slice(AVFilterContext * ctx,void * arg,int jobnr,int nb_jobs)192 static int filter_slice(AVFilterContext *ctx, void *arg, int jobnr, int nb_jobs)
193 {
194     YADIFContext *s = ctx->priv;
195     ThreadData *td  = arg;
196     int refs = s->cur->linesize[td->plane];
197     int df = (s->csp->comp[td->plane].depth + 7) / 8;
198     int pix_3 = 3 * df;
199     int slice_start = (td->h *  jobnr   ) / nb_jobs;
200     int slice_end   = (td->h * (jobnr+1)) / nb_jobs;
201     int y;
202     int edge = 3 + MAX_ALIGN / df - 1;
203 
204     /* filtering reads 3 pixels to the left/right; to avoid invalid reads,
205      * we need to call the c variant which avoids this for border pixels
206      */
207     for (y = slice_start; y < slice_end; y++) {
208         if ((y ^ td->parity) & 1) {
209             uint8_t *prev = &s->prev->data[td->plane][y * refs];
210             uint8_t *cur  = &s->cur ->data[td->plane][y * refs];
211             uint8_t *next = &s->next->data[td->plane][y * refs];
212             uint8_t *dst  = &td->frame->data[td->plane][y * td->frame->linesize[td->plane]];
213             int     mode  = y == 1 || y + 2 == td->h ? 2 : s->mode;
214             s->filter_line(dst + pix_3, prev + pix_3, cur + pix_3,
215                            next + pix_3, td->w - edge,
216                            y + 1 < td->h ? refs : -refs,
217                            y ? -refs : refs,
218                            td->parity ^ td->tff, mode);
219             s->filter_edges(dst, prev, cur, next, td->w,
220                             y + 1 < td->h ? refs : -refs,
221                             y ? -refs : refs,
222                             td->parity ^ td->tff, mode);
223         } else {
224             memcpy(&td->frame->data[td->plane][y * td->frame->linesize[td->plane]],
225                    &s->cur->data[td->plane][y * refs], td->w * df);
226         }
227     }
228     return 0;
229 }
230 
filter(AVFilterContext * ctx,AVFrame * dstpic,int parity,int tff)231 static void filter(AVFilterContext *ctx, AVFrame *dstpic,
232                    int parity, int tff)
233 {
234     YADIFContext *yadif = ctx->priv;
235     ThreadData td = { .frame = dstpic, .parity = parity, .tff = tff };
236     int i;
237 
238     for (i = 0; i < yadif->csp->nb_components; i++) {
239         int w = dstpic->width;
240         int h = dstpic->height;
241 
242         if (i == 1 || i == 2) {
243             w = AV_CEIL_RSHIFT(w, yadif->csp->log2_chroma_w);
244             h = AV_CEIL_RSHIFT(h, yadif->csp->log2_chroma_h);
245         }
246 
247 
248         td.w       = w;
249         td.h       = h;
250         td.plane   = i;
251 
252         ff_filter_execute(ctx, filter_slice, &td, NULL,
253                           FFMIN(h, ff_filter_get_nb_threads(ctx)));
254     }
255 
256     emms_c();
257 }
258 
uninit(AVFilterContext * ctx)259 static av_cold void uninit(AVFilterContext *ctx)
260 {
261     YADIFContext *yadif = ctx->priv;
262 
263     av_frame_free(&yadif->prev);
264     av_frame_free(&yadif->cur );
265     av_frame_free(&yadif->next);
266 }
267 
268 static const enum AVPixelFormat pix_fmts[] = {
269     AV_PIX_FMT_YUV420P,   AV_PIX_FMT_YUV422P,   AV_PIX_FMT_YUV444P,
270     AV_PIX_FMT_YUV410P,   AV_PIX_FMT_YUV411P,   AV_PIX_FMT_YUV440P,
271     AV_PIX_FMT_GRAY8,     AV_PIX_FMT_GRAY16,
272     AV_PIX_FMT_YUVJ420P,  AV_PIX_FMT_YUVJ422P,  AV_PIX_FMT_YUVJ444P,
273     AV_PIX_FMT_YUVJ440P,
274     AV_PIX_FMT_YUV420P9,  AV_PIX_FMT_YUV422P9,  AV_PIX_FMT_YUV444P9,
275     AV_PIX_FMT_YUV420P10, AV_PIX_FMT_YUV422P10, AV_PIX_FMT_YUV444P10,
276     AV_PIX_FMT_YUV420P12, AV_PIX_FMT_YUV422P12, AV_PIX_FMT_YUV444P12,
277     AV_PIX_FMT_YUV420P14, AV_PIX_FMT_YUV422P14, AV_PIX_FMT_YUV444P14,
278     AV_PIX_FMT_YUV420P16, AV_PIX_FMT_YUV422P16, AV_PIX_FMT_YUV444P16,
279     AV_PIX_FMT_YUVA420P,  AV_PIX_FMT_YUVA422P,  AV_PIX_FMT_YUVA444P,
280     AV_PIX_FMT_GBRP,      AV_PIX_FMT_GBRP9,     AV_PIX_FMT_GBRP10,
281     AV_PIX_FMT_GBRP12,    AV_PIX_FMT_GBRP14,    AV_PIX_FMT_GBRP16,
282     AV_PIX_FMT_GBRAP,
283     AV_PIX_FMT_NONE
284 };
285 
config_output(AVFilterLink * outlink)286 static int config_output(AVFilterLink *outlink)
287 {
288     AVFilterContext *ctx = outlink->src;
289     YADIFContext *s = ctx->priv;
290 
291     outlink->time_base = av_mul_q(ctx->inputs[0]->time_base, (AVRational){1, 2});
292     outlink->w             = ctx->inputs[0]->w;
293     outlink->h             = ctx->inputs[0]->h;
294 
295     if(s->mode & 1)
296         outlink->frame_rate = av_mul_q(ctx->inputs[0]->frame_rate,
297                                     (AVRational){2, 1});
298 
299     if (outlink->w < 3 || outlink->h < 3) {
300         av_log(ctx, AV_LOG_ERROR, "Video of less than 3 columns or lines is not supported\n");
301         return AVERROR(EINVAL);
302     }
303 
304     s->csp = av_pix_fmt_desc_get(outlink->format);
305     s->filter = filter;
306     if (s->csp->comp[0].depth > 8) {
307         s->filter_line  = filter_line_c_16bit;
308         s->filter_edges = filter_edges_16bit;
309     } else {
310         s->filter_line  = filter_line_c;
311         s->filter_edges = filter_edges;
312     }
313 
314 #if ARCH_X86
315     ff_yadif_init_x86(s);
316 #endif
317 
318     return 0;
319 }
320 
321 
322 static const AVClass yadif_class = {
323     .class_name = "yadif",
324     .item_name  = av_default_item_name,
325     .option     = ff_yadif_options,
326     .version    = LIBAVUTIL_VERSION_INT,
327     .category   = AV_CLASS_CATEGORY_FILTER,
328 };
329 
330 static const AVFilterPad avfilter_vf_yadif_inputs[] = {
331     {
332         .name          = "default",
333         .type          = AVMEDIA_TYPE_VIDEO,
334         .filter_frame  = ff_yadif_filter_frame,
335     },
336 };
337 
338 static const AVFilterPad avfilter_vf_yadif_outputs[] = {
339     {
340         .name          = "default",
341         .type          = AVMEDIA_TYPE_VIDEO,
342         .request_frame = ff_yadif_request_frame,
343         .config_props  = config_output,
344     },
345 };
346 
347 const AVFilter ff_vf_yadif = {
348     .name          = "yadif",
349     .description   = NULL_IF_CONFIG_SMALL("Deinterlace the input image."),
350     .priv_size     = sizeof(YADIFContext),
351     .priv_class    = &yadif_class,
352     .uninit        = uninit,
353     FILTER_INPUTS(avfilter_vf_yadif_inputs),
354     FILTER_OUTPUTS(avfilter_vf_yadif_outputs),
355     FILTER_PIXFMTS_ARRAY(pix_fmts),
356     .flags         = AVFILTER_FLAG_SUPPORT_TIMELINE_INTERNAL | AVFILTER_FLAG_SLICE_THREADS,
357 };
358