FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libavfilter/vf_pullup.c
Date: 2024-11-20 23:03:26
Exec Total Coverage
Lines: 340 422 80.6%
Functions: 25 25 100.0%
Branches: 175 264 66.3%
Line Branch Exec Source
1 /*
2 * Copyright (c) 2003 Rich Felker
3 *
4 * This file is part of FFmpeg.
5 *
6 * FFmpeg is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public
8 * License as published by the Free Software Foundation; either
9 * version 2 of the License, or (at your option) any later version.
10 *
11 * FFmpeg is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License along
17 * with FFmpeg; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
19 */
20
21 #include "libavutil/avassert.h"
22 #include "libavutil/emms.h"
23 #include "libavutil/imgutils.h"
24 #include "libavutil/mem.h"
25 #include "libavutil/opt.h"
26 #include "libavutil/pixdesc.h"
27 #include "avfilter.h"
28 #include "filters.h"
29 #include "video.h"
30 #include "vf_pullup.h"
31
32 #define F_HAVE_BREAKS 1
33 #define F_HAVE_AFFINITY 2
34
35 #define BREAK_LEFT 1
36 #define BREAK_RIGHT 2
37
38 #define OFFSET(x) offsetof(PullupContext, x)
39 #define FLAGS AV_OPT_FLAG_VIDEO_PARAM|AV_OPT_FLAG_FILTERING_PARAM
40
41 static const AVOption pullup_options[] = {
42 { "jl", "set left junk size", OFFSET(junk_left), AV_OPT_TYPE_INT, {.i64=1}, 0, INT_MAX, FLAGS },
43 { "jr", "set right junk size", OFFSET(junk_right), AV_OPT_TYPE_INT, {.i64=1}, 0, INT_MAX, FLAGS },
44 { "jt", "set top junk size", OFFSET(junk_top), AV_OPT_TYPE_INT, {.i64=4}, 1, INT_MAX, FLAGS },
45 { "jb", "set bottom junk size", OFFSET(junk_bottom), AV_OPT_TYPE_INT, {.i64=4}, 1, INT_MAX, FLAGS },
46 { "sb", "set strict breaks", OFFSET(strict_breaks), AV_OPT_TYPE_BOOL,{.i64=0},-1, 1, FLAGS },
47 { "mp", "set metric plane", OFFSET(metric_plane), AV_OPT_TYPE_INT, {.i64=0}, 0, 2, FLAGS, .unit = "mp" },
48 { "y", "luma", 0, AV_OPT_TYPE_CONST, {.i64=0}, 0, 0, FLAGS, .unit = "mp" },
49 { "u", "chroma blue", 0, AV_OPT_TYPE_CONST, {.i64=1}, 0, 0, FLAGS, .unit = "mp" },
50 { "v", "chroma red", 0, AV_OPT_TYPE_CONST, {.i64=2}, 0, 0, FLAGS, .unit = "mp" },
51 { NULL }
52 };
53
54 AVFILTER_DEFINE_CLASS(pullup);
55
56 static const enum AVPixelFormat pix_fmts[] = {
57 AV_PIX_FMT_YUVJ444P, AV_PIX_FMT_YUVJ440P,
58 AV_PIX_FMT_YUVJ422P, AV_PIX_FMT_YUVJ420P,
59 AV_PIX_FMT_YUV444P, AV_PIX_FMT_YUV440P,
60 AV_PIX_FMT_YUV422P, AV_PIX_FMT_YUV420P,
61 AV_PIX_FMT_YUV411P, AV_PIX_FMT_YUV410P,
62 AV_PIX_FMT_YUVJ411P, AV_PIX_FMT_GRAY8,
63 AV_PIX_FMT_NONE
64 };
65
66 #define ABS(a) (((a) ^ ((a) >> 31)) - ((a) >> 31))
67
68 993888 static int diff_c(const uint8_t *a, const uint8_t *b, ptrdiff_t s)
69 {
70 993888 int i, j, diff = 0;
71
72
2/2
✓ Branch 0 taken 3975552 times.
✓ Branch 1 taken 993888 times.
 4969440 for (i = 0; i < 4; i++) {
73
2/2
✓ Branch 0 taken 31804416 times.
✓ Branch 1 taken 3975552 times.
 35779968 for (j = 0; j < 8; j++)
74 31804416 diff += ABS(a[j] - b[j]);
75 3975552 a += s;
76 3975552 b += s;
77 }
78
79 993888 return diff;
80 }
81
82 1113840 static int comb_c(const uint8_t *a, const uint8_t *b, ptrdiff_t s)
83 {
84 1113840 int i, j, comb = 0;
85
86
2/2
✓ Branch 0 taken 4455360 times.
✓ Branch 1 taken 1113840 times.
 5569200 for (i = 0; i < 4; i++) {
87
2/2
✓ Branch 0 taken 35642880 times.
✓ Branch 1 taken 4455360 times.
 40098240 for (j = 0; j < 8; j++)
88 35642880 comb += ABS((a[j] << 1) - b[j - s] - b[j ]) +
89 35642880 ABS((b[j] << 1) - a[j ] - a[j + s]);
90 4455360 a += s;
91 4455360 b += s;
92 }
93
94 1113840 return comb;
95 }
96
97 1130976 static int var_c(const uint8_t *a, const uint8_t *b, ptrdiff_t s)
98 {
99 1130976 int i, j, var = 0;
100
101
2/2
✓ Branch 0 taken 3392928 times.
✓ Branch 1 taken 1130976 times.
 4523904 for (i = 0; i < 3; i++) {
102
2/2
✓ Branch 0 taken 27143424 times.
✓ Branch 1 taken 3392928 times.
 30536352 for (j = 0; j < 8; j++)
103 27143424 var += ABS(a[j] - a[j + s]);
104 3392928 a += s;
105 }
106
107 1130976 return 4 * var; /* match comb scaling */
108 }
109
110 108 static int alloc_metrics(PullupContext *s, PullupField *f)
111 {
112 108 f->diffs = av_calloc(FFALIGN(s->metric_length, 16), sizeof(*f->diffs));
113 108 f->combs = av_calloc(FFALIGN(s->metric_length, 16), sizeof(*f->combs));
114 108 f->vars = av_calloc(FFALIGN(s->metric_length, 16), sizeof(*f->vars));
115
116
3/6
✓ Branch 0 taken 108 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 108 times.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✓ Branch 5 taken 108 times.
 108 if (!f->diffs || !f->combs || !f->vars) {
117 ✗ av_freep(&f->diffs);
118 ✗ av_freep(&f->combs);
119 ✗ av_freep(&f->vars);
120 ✗ return AVERROR(ENOMEM);
121 }
122 108 return 0;
123 }
124
125 25 static void free_field_queue(PullupField *head)
126 {
127 25 PullupField *f = head;
128 do {
129 PullupField *next;
130
2/2
✓ Branch 0 taken 13 times.
✓ Branch 1 taken 108 times.
 121 if (!f)
131 13 break;
132 108 av_free(f->diffs);
133 108 av_free(f->combs);
134 108 av_free(f->vars);
135 108 next = f->next;
136 108 memset(f, 0, sizeof(*f)); // clear all pointers to avoid stale ones
137 108 av_free(f);
138 108 f = next;
139
2/2
✓ Branch 0 taken 96 times.
✓ Branch 1 taken 12 times.
 108 } while (f != head);
140 25 }
141
142 12 static PullupField *make_field_queue(PullupContext *s, int len)
143 {
144 PullupField *head, *f;
145
146 12 f = head = av_mallocz(sizeof(*head));
147
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 12 times.
 12 if (!f)
148 ✗ return NULL;
149
150
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 12 times.
 12 if (alloc_metrics(s, f) < 0) {
151 ✗ av_free(f);
152 ✗ return NULL;
153 }
154
155
2/2
✓ Branch 0 taken 96 times.
✓ Branch 1 taken 12 times.
 108 for (; len > 0; len--) {
156 96 f->next = av_mallocz(sizeof(*f->next));
157
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 96 times.
 96 if (!f->next) {
158 ✗ free_field_queue(head);
159 ✗ return NULL;
160 }
161
162 96 f->next->prev = f;
163 96 f = f->next;
164
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 96 times.
 96 if (alloc_metrics(s, f) < 0) {
165 ✗ free_field_queue(head);
166 ✗ return NULL;
167 }
168 }
169
170 12 f->next = head;
171 12 head->prev = f;
172
173 12 return head;
174 }
175
176 12 static int config_input(AVFilterLink *inlink)
177 {
178 12 AVFilterContext *ctx = inlink->dst;
179 12 PullupContext *s = ctx->priv;
180 12 const AVPixFmtDescriptor *desc = av_pix_fmt_desc_get(inlink->format);
181 12 int mp = s->metric_plane;
182
183 12 s->nb_planes = av_pix_fmt_count_planes(inlink->format);
184
185
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 12 times.
 12 if (mp + 1 > s->nb_planes) {
186 ✗ av_log(ctx, AV_LOG_ERROR, "input format does not have such plane\n");
187 ✗ return AVERROR(EINVAL);
188 }
189
190 12 s->planeheight[1] = s->planeheight[2] = AV_CEIL_RSHIFT(inlink->h, desc->log2_chroma_h);
191 12 s->planeheight[0] = s->planeheight[3] = inlink->h;
192 12 s->planewidth[1] = s->planewidth[2] = AV_CEIL_RSHIFT(inlink->w, desc->log2_chroma_w);
193 12 s->planewidth[0] = s->planewidth[3] = inlink->w;
194
195 12 s->metric_w = (s->planewidth[mp] - ((s->junk_left + s->junk_right) << 3)) >> 3;
196 12 s->metric_h = (s->planeheight[mp] - ((s->junk_top + s->junk_bottom) << 1)) >> 3;
197 12 s->metric_offset = (s->junk_left << 3) + (s->junk_top << 1) * s->planewidth[mp];
198 12 s->metric_length = s->metric_w * s->metric_h;
199
200 12 av_log(ctx, AV_LOG_DEBUG, "w: %d h: %d\n", s->metric_w, s->metric_h);
201 12 av_log(ctx, AV_LOG_DEBUG, "offset: %d length: %d\n", s->metric_offset, s->metric_length);
202
203 12 s->head = make_field_queue(s, 8);
204
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 12 times.
 12 if (!s->head)
205 ✗ return AVERROR(ENOMEM);
206
207 12 s->diff = diff_c;
208 12 s->comb = comb_c;
209 12 s->var = var_c;
210
211 #if ARCH_X86
212 12 ff_pullup_init_x86(s);
213 #endif
214 12 return 0;
215 }
216
217 2136 static PullupBuffer *pullup_lock_buffer(PullupBuffer *b, int parity)
218 {
219
2/2
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 2112 times.
 2136 if (!b)
220 24 return NULL;
221
222
2/2
✓ Branch 0 taken 1404 times.
✓ Branch 1 taken 708 times.
 2112 if ((parity + 1) & 1)
223 1404 b->lock[0]++;
224
2/2
✓ Branch 0 taken 1404 times.
✓ Branch 1 taken 708 times.
 2112 if ((parity + 1) & 2)
225 1404 b->lock[1]++;
226
227 2112 return b;
228 }
229
230 2124 static void pullup_release_buffer(PullupBuffer *b, int parity)
231 {
232
2/2
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 2100 times.
 2124 if (!b)
233 24 return;
234
235
2/2
✓ Branch 0 taken 1404 times.
✓ Branch 1 taken 696 times.
 2100 if ((parity + 1) & 1)
236 1404 b->lock[0]--;
237
2/2
✓ Branch 0 taken 1392 times.
✓ Branch 1 taken 708 times.
 2100 if ((parity + 1) & 2)
238 1392 b->lock[1]--;
239 }
240
241 396 static int alloc_buffer(PullupContext *s, PullupBuffer *b)
242 {
243 int i;
244
245
2/2
✓ Branch 0 taken 360 times.
✓ Branch 1 taken 36 times.
 396 if (b->planes[0])
246 360 return 0;
247
2/2
✓ Branch 0 taken 102 times.
✓ Branch 1 taken 36 times.
 138 for (i = 0; i < s->nb_planes; i++) {
248 102 b->planes[i] = av_malloc(s->planeheight[i] * s->planewidth[i]);
249 }
250
2/2
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 33 times.
 36 if (s->nb_planes == 1)
251 3 b->planes[1] = av_malloc(4*256);
252
253 36 return 0;
254 }
255
256 396 static PullupBuffer *pullup_get_buffer(PullupContext *s, int parity)
257 {
258 int i;
259
260 /* Try first to get the sister buffer for the previous field */
261
1/6
✗ Branch 0 not taken.
✓ Branch 1 taken 396 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
 396 if (parity < 2 && s->last && parity != s->last->parity
262 ✗ && !s->last->buffer->lock[parity]) {
263 ✗ alloc_buffer(s, s->last->buffer);
264 ✗ return pullup_lock_buffer(s->last->buffer, parity);
265 }
266
267 /* Prefer a buffer with both fields open */
268
1/2
✓ Branch 0 taken 720 times.
✗ Branch 1 not taken.
 720 for (i = 0; i < FF_ARRAY_ELEMS(s->buffers); i++) {
269
2/2
✓ Branch 0 taken 180 times.
✓ Branch 1 taken 540 times.
 720 if (s->buffers[i].lock[0])
270 180 continue;
271
2/2
✓ Branch 0 taken 144 times.
✓ Branch 1 taken 396 times.
 540 if (s->buffers[i].lock[1])
272 144 continue;
273 396 alloc_buffer(s, &s->buffers[i]);
274 396 return pullup_lock_buffer(&s->buffers[i], parity);
275 }
276
277 ✗ if (parity == 2)
278 ✗ return 0;
279
280 /* Search for any half-free buffer */
281 ✗ for (i = 0; i < FF_ARRAY_ELEMS(s->buffers); i++) {
282 ✗ if (((parity + 1) & 1) && s->buffers[i].lock[0])
283 ✗ continue;
284 ✗ if (((parity + 1) & 2) && s->buffers[i].lock[1])
285 ✗ continue;
286 ✗ alloc_buffer(s, &s->buffers[i]);
287 ✗ return pullup_lock_buffer(&s->buffers[i], parity);
288 }
289
290 ✗ return NULL;
291 }
292
293 744 static int queue_length(PullupField *begin, PullupField *end)
294 {
295 PullupField *f;
296 744 int count = 1;
297
298
2/4
✓ Branch 0 taken 744 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 744 times.
 744 if (!begin || !end)
299 ✗ return 0;
300
301
2/2
✓ Branch 0 taken 2436 times.
✓ Branch 1 taken 744 times.
 3180 for (f = begin; f != end; f = f->next)
302 2436 count++;
303
304 744 return count;
305 }
306
307 300 static int find_first_break(PullupField *f, int max)
308 {
309 int i;
310
311
2/2
✓ Branch 0 taken 828 times.
✓ Branch 1 taken 72 times.
 900 for (i = 0; i < max; i++) {
312
4/4
✓ Branch 0 taken 672 times.
✓ Branch 1 taken 156 times.
✓ Branch 2 taken 72 times.
✓ Branch 3 taken 600 times.
 828 if (f->breaks & BREAK_RIGHT || f->next->breaks & BREAK_LEFT)
313 228 return i + 1;
314 600 f = f->next;
315 }
316
317 72 return 0;
318 }
319
320 480 static void compute_breaks(PullupContext *s, PullupField *f0)
321 {
322 480 PullupField *f1 = f0->next;
323 480 PullupField *f2 = f1->next;
324 480 PullupField *f3 = f2->next;
325 480 int i, l, max_l = 0, max_r = 0;
326
327
2/2
✓ Branch 0 taken 12 times.
✓ Branch 1 taken 468 times.
 480 if (f0->flags & F_HAVE_BREAKS)
328 12 return;
329
330 468 f0->flags |= F_HAVE_BREAKS;
331
332 /* Special case when fields are 100% identical */
333
1/4
✗ Branch 0 not taken.
✓ Branch 1 taken 468 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
 468 if (f0->buffer == f2->buffer && f1->buffer != f3->buffer) {
334 ✗ f2->breaks |= BREAK_RIGHT;
335 ✗ return;
336 }
337
338
2/4
✓ Branch 0 taken 468 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 468 times.
 468 if (f0->buffer != f2->buffer && f1->buffer == f3->buffer) {
339 ✗ f1->breaks |= BREAK_LEFT;
340 ✗ return;
341 }
342
343
2/2
✓ Branch 0 taken 668304 times.
✓ Branch 1 taken 468 times.
 668772 for (i = 0; i < s->metric_length; i++) {
344 668304 l = f2->diffs[i] - f3->diffs[i];
345
346
2/2
✓ Branch 0 taken 2880 times.
✓ Branch 1 taken 665424 times.
 668304 if ( l > max_l)
347 2880 max_l = l;
348
2/2
✓ Branch 0 taken 3948 times.
✓ Branch 1 taken 664356 times.
 668304 if (-l > max_r)
349 3948 max_r = -l;
350 }
351
352 /* Don't get tripped up when differences are mostly quant error */
353
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 468 times.
 468 if (max_l + max_r < 128)
354 ✗ return;
355
2/2
✓ Branch 0 taken 84 times.
✓ Branch 1 taken 384 times.
 468 if (max_l > 4 * max_r)
356 84 f1->breaks |= BREAK_LEFT;
357
2/2
✓ Branch 0 taken 156 times.
✓ Branch 1 taken 312 times.
 468 if (max_r > 4 * max_l)
358 156 f2->breaks |= BREAK_RIGHT;
359 }
360
361 1128 static void compute_affinity(PullupContext *s, PullupField *f)
362 {
363 1128 int i, max_l = 0, max_r = 0, l;
364
365
2/2
✓ Branch 0 taken 348 times.
✓ Branch 1 taken 780 times.
 1128 if (f->flags & F_HAVE_AFFINITY)
366 348 return;
367
368 780 f->flags |= F_HAVE_AFFINITY;
369
370
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 780 times.
 780 if (f->buffer == f->next->next->buffer) {
371 ✗ f->affinity = 1;
372 ✗ f->next->affinity = 0;
373 ✗ f->next->next->affinity = -1;
374 ✗ f->next->flags |= F_HAVE_AFFINITY;
375 ✗ f->next->next->flags |= F_HAVE_AFFINITY;
376 ✗ return;
377 }
378
379
2/2
✓ Branch 0 taken 1113840 times.
✓ Branch 1 taken 780 times.
 1114620 for (i = 0; i < s->metric_length; i++) {
380 1113840 int v = f->vars[i];
381 1113840 int lv = f->prev->vars[i];
382 1113840 int rv = f->next->vars[i];
383 1113840 int lc = f-> combs[i] - 2*(v < lv ? v : lv);
384 1113840 int rc = f->next->combs[i] - 2*(v < rv ? v : rv);
385
386 1113840 lc = FFMAX(lc, 0);
387 1113840 rc = FFMAX(rc, 0);
388 1113840 l = lc - rc;
389
390
2/2
✓ Branch 0 taken 3948 times.
✓ Branch 1 taken 1109892 times.
 1113840 if ( l > max_l)
391 3948 max_l = l;
392
2/2
✓ Branch 0 taken 4110 times.
✓ Branch 1 taken 1109730 times.
 1113840 if (-l > max_r)
393 4110 max_r = -l;
394 }
395
396
2/2
✓ Branch 0 taken 156 times.
✓ Branch 1 taken 624 times.
 780 if (max_l + max_r < 64)
397 156 return;
398
399
2/2
✓ Branch 0 taken 252 times.
✓ Branch 1 taken 372 times.
 624 if (max_r > 6 * max_l)
400 252 f->affinity = -1;
401
2/2
✓ Branch 0 taken 204 times.
✓ Branch 1 taken 168 times.
 372 else if (max_l > 6 * max_r)
402 204 f->affinity = 1;
403 }
404
405 420 static int decide_frame_length(PullupContext *s)
406 {
407 420 PullupField *f0 = s->first;
408 420 PullupField *f1 = f0->next;
409 420 PullupField *f2 = f1->next;
410 PullupField *f;
411 int i, l, n;
412
413
2/2
✓ Branch 1 taken 96 times.
✓ Branch 2 taken 324 times.
 420 if (queue_length(s->first, s->last) < 4)
414 96 return 0;
415
416 324 f = s->first;
417 324 n = queue_length(f, s->last);
418
2/2
✓ Branch 0 taken 1128 times.
✓ Branch 1 taken 324 times.
 1452 for (i = 0; i < n - 1; i++) {
419
2/2
✓ Branch 0 taken 480 times.
✓ Branch 1 taken 648 times.
 1128 if (i < n - 3)
420 480 compute_breaks(s, f);
421
422 1128 compute_affinity(s, f);
423
424 1128 f = f->next;
425 }
426
427
2/2
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 300 times.
 324 if (f0->affinity == -1)
428 24 return 1;
429
430 300 l = find_first_break(f0, 3);
431
432
1/4
✗ Branch 0 not taken.
✓ Branch 1 taken 300 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
 300 if (l == 1 && s->strict_breaks < 0)
433 ✗ l = 0;
434
435
3/4
✗ Branch 0 not taken.
✓ Branch 1 taken 72 times.
✓ Branch 2 taken 156 times.
✓ Branch 3 taken 72 times.
 300 switch (l) {
436 ✗ case 1:
437 ✗ return 1 + (s->strict_breaks < 1 && f0->affinity == 1 && f1->affinity == -1);
438 72 case 2:
439 /* FIXME: strictly speaking, f0->prev is no longer valid... :) */
440
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 72 times.
 72 if (s->strict_pairs
441 ✗ && (f0->prev->breaks & BREAK_RIGHT) && (f2->breaks & BREAK_LEFT)
442 ✗ && (f0->affinity != 1 || f1->affinity != -1) )
443 ✗ return 1;
444
1/2
✓ Branch 0 taken 72 times.
✗ Branch 1 not taken.
 72 return 1 + (f1->affinity != 1);
445 156 case 3:
446
1/2
✓ Branch 0 taken 156 times.
✗ Branch 1 not taken.
 156 return 2 + (f2->affinity != 1);
447 72 default:
448 /* 9 possibilities covered before switch */
449
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 72 times.
 72 if (f1->affinity == 1)
450 ✗ return 1; /* covers 6 */
451
2/2
✓ Branch 0 taken 60 times.
✓ Branch 1 taken 12 times.
 72 else if (f1->affinity == -1)
452 60 return 2; /* covers 6 */
453
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 12 times.
 12 else if (f2->affinity == -1) { /* covers 2 */
454 ✗ return (f0->affinity == 1) ? 3 : 1;
455 } else {
456 12 return 2; /* the remaining 6 */
457 }
458 }
459 }
460
461 420 static PullupFrame *pullup_get_frame(PullupContext *s)
462 {
463 420 PullupFrame *fr = &s->frame;
464 420 int i, n = decide_frame_length(s);
465 420 int aff = s->first->next->affinity;
466
467 av_assert1(n < FF_ARRAY_ELEMS(fr->ifields));
468
3/4
✓ Branch 0 taken 324 times.
✓ Branch 1 taken 96 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 324 times.
 420 if (!n || fr->lock)
469 96 return NULL;
470
471 324 fr->lock++;
472 324 fr->length = n;
473 324 fr->parity = s->first->parity;
474 324 fr->buffer = 0;
475
476
2/2
✓ Branch 0 taken 780 times.
✓ Branch 1 taken 324 times.
 1104 for (i = 0; i < n; i++) {
477 /* We cheat and steal the buffer without release+relock */
478 780 fr->ifields[i] = s->first->buffer;
479 780 s->first->buffer = 0;
480 780 s->first = s->first->next;
481 }
482
483
2/2
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 300 times.
 324 if (n == 1) {
484 24 fr->ofields[fr->parity ] = fr->ifields[0];
485 24 fr->ofields[fr->parity ^ 1] = 0;
486
2/2
✓ Branch 0 taken 144 times.
✓ Branch 1 taken 156 times.
 300 } else if (n == 2) {
487 144 fr->ofields[fr->parity ] = fr->ifields[0];
488 144 fr->ofields[fr->parity ^ 1] = fr->ifields[1];
489
1/2
✓ Branch 0 taken 156 times.
✗ Branch 1 not taken.
 156 } else if (n == 3) {
490
1/2
✓ Branch 0 taken 156 times.
✗ Branch 1 not taken.
 156 if (!aff)
491
2/2
✓ Branch 0 taken 84 times.
✓ Branch 1 taken 72 times.
 156 aff = (fr->ifields[0] == fr->ifields[1]) ? -1 : 1;
492 156 fr->ofields[fr->parity ] = fr->ifields[1 + aff];
493 156 fr->ofields[fr->parity ^ 1] = fr->ifields[1 ];
494 }
495
496 324 pullup_lock_buffer(fr->ofields[0], 0);
497 324 pullup_lock_buffer(fr->ofields[1], 1);
498
499
2/2
✓ Branch 0 taken 228 times.
✓ Branch 1 taken 96 times.
 324 if (fr->ofields[0] == fr->ofields[1]) {
500 228 fr->buffer = fr->ofields[0];
501 228 pullup_lock_buffer(fr->buffer, 2);
502 228 return fr;
503 }
504
505 96 return fr;
506 }
507
508 324 static void pullup_release_frame(PullupFrame *f)
509 {
510 int i;
511
512
2/2
✓ Branch 0 taken 780 times.
✓ Branch 1 taken 324 times.
 1104 for (i = 0; i < f->length; i++)
513 780 pullup_release_buffer(f->ifields[i], f->parity ^ (i & 1));
514
515 324 pullup_release_buffer(f->ofields[0], 0);
516 324 pullup_release_buffer(f->ofields[1], 1);
517
518
2/2
✓ Branch 0 taken 300 times.
✓ Branch 1 taken 24 times.
 324 if (f->buffer)
519 300 pullup_release_buffer(f->buffer, 2);
520 324 f->lock--;
521 324 }
522
523 2376 static void compute_metric(PullupContext *s, int *dest,
524 PullupField *fa, int pa, PullupField *fb, int pb,
525 int (*func)(const uint8_t *, const uint8_t *, ptrdiff_t))
526 {
527 2376 int mp = s->metric_plane;
528 2376 int xstep = 8;
529 2376 int ystep = s->planewidth[mp] << 3;
530 2376 int stride = s->planewidth[mp] << 1; /* field stride */
531 2376 int w = s->metric_w * xstep;
532 uint8_t *a, *b;
533 int x, y;
534
535
3/4
✓ Branch 0 taken 2376 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 108 times.
✓ Branch 3 taken 2268 times.
 2376 if (!fa->buffer || !fb->buffer)
536 108 return;
537
538 /* Shortcut for duplicate fields (e.g. from RFF flag) */
539
3/4
✓ Branch 0 taken 1188 times.
✓ Branch 1 taken 1080 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 1188 times.
 2268 if (fa->buffer == fb->buffer && pa == pb) {
540 ✗ memset(dest, 0, s->metric_length * sizeof(*dest));
541 ✗ return;
542 }
543
544 2268 a = fa->buffer->planes[mp] + pa * s->planewidth[mp] + s->metric_offset;
545 2268 b = fb->buffer->planes[mp] + pb * s->planewidth[mp] + s->metric_offset;
546
547
2/2
✓ Branch 0 taken 77112 times.
✓ Branch 1 taken 2268 times.
 79380 for (y = 0; y < s->metric_h; y++) {
548
2/2
✓ Branch 0 taken 3238704 times.
✓ Branch 1 taken 77112 times.
 3315816 for (x = 0; x < w; x += xstep)
549 3238704 *dest++ = func(a + x, b + x, stride);
550 77112 a += ystep; b += ystep;
551 }
552 }
553
554 792 static int check_field_queue(PullupContext *s)
555 {
556 int ret;
557
558
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 792 times.
 792 if (s->head->next == s->first) {
559 ✗ PullupField *f = av_mallocz(sizeof(*f));
560
561 ✗ if (!f)
562 ✗ return AVERROR(ENOMEM);
563
564 ✗ if ((ret = alloc_metrics(s, f)) < 0) {
565 ✗ av_free(f);
566 ✗ return ret;
567 }
568
569 ✗ f->prev = s->head;
570 ✗ f->next = s->first;
571 ✗ s->head->next = f;
572 ✗ s->first->prev = f;
573 }
574
575 792 return 0;
576 }
577
578 792 static void pullup_submit_field(PullupContext *s, PullupBuffer *b, int parity)
579 {
580 PullupField *f;
581
582 /* Grow the circular list if needed */
583
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 792 times.
 792 if (check_field_queue(s) < 0)
584 ✗ return;
585
586 /* Cannot have two fields of same parity in a row; drop the new one */
587
3/4
✓ Branch 0 taken 780 times.
✓ Branch 1 taken 12 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 780 times.
 792 if (s->last && s->last->parity == parity)
588 ✗ return;
589
590 792 f = s->head;
591 792 f->parity = parity;
592 792 f->buffer = pullup_lock_buffer(b, parity);
593 792 f->flags = 0;
594 792 f->breaks = 0;
595 792 f->affinity = 0;
596
597 792 compute_metric(s, f->diffs, f, parity, f->prev->prev, parity, s->diff);
598
4/4
✓ Branch 0 taken 396 times.
✓ Branch 1 taken 396 times.
✓ Branch 2 taken 396 times.
✓ Branch 3 taken 396 times.
 792 compute_metric(s, f->combs, parity ? f->prev : f, 0, parity ? f : f->prev, 1, s->comb);
599 792 compute_metric(s, f->vars, f, parity, f, -1, s->var);
600 792 emms_c();
601
602 /* Advance the circular list */
603
2/2
✓ Branch 0 taken 12 times.
✓ Branch 1 taken 780 times.
 792 if (!s->first)
604 12 s->first = s->head;
605
606 792 s->last = s->head;
607 792 s->head = s->head->next;
608 }
609
610 72 static void copy_field(PullupContext *s,
611 PullupBuffer *dst, PullupBuffer *src, int parity)
612 {
613 uint8_t *dd, *ss;
614 int i;
615
616
2/2
✓ Branch 0 taken 204 times.
✓ Branch 1 taken 72 times.
 276 for (i = 0; i < s->nb_planes; i++) {
617 204 ss = src->planes[i] + parity * s->planewidth[i];
618 204 dd = dst->planes[i] + parity * s->planewidth[i];
619
620 204 av_image_copy_plane(dd, s->planewidth[i] << 1,
621 204 ss, s->planewidth[i] << 1,
622 204 s->planewidth[i], s->planeheight[i] >> 1);
623 }
624 72 }
625
626 72 static void pullup_pack_frame(PullupContext *s, PullupFrame *fr)
627 {
628 int i;
629
630
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 72 times.
 72 if (fr->buffer)
631 ✗ return;
632
633
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 72 times.
 72 if (fr->length < 2)
634 ✗ return; /* FIXME: deal with this */
635
636
1/2
✓ Branch 0 taken 144 times.
✗ Branch 1 not taken.
 144 for (i = 0; i < 2; i++) {
637
2/2
✓ Branch 0 taken 72 times.
✓ Branch 1 taken 72 times.
 144 if (fr->ofields[i]->lock[i^1])
638 72 continue;
639
640 72 fr->buffer = fr->ofields[i];
641 72 pullup_lock_buffer(fr->buffer, 2);
642 72 copy_field(s, fr->buffer, fr->ofields[i^1], i^1);
643 72 return;
644 }
645
646 ✗ fr->buffer = pullup_get_buffer(s, 2);
647
648 ✗ copy_field(s, fr->buffer, fr->ofields[0], 0);
649 ✗ copy_field(s, fr->buffer, fr->ofields[1], 1);
650 }
651
652 396 static int filter_frame(AVFilterLink *inlink, AVFrame *in)
653 {
654 396 AVFilterContext *ctx = inlink->dst;
655 396 AVFilterLink *outlink = ctx->outputs[0];
656 396 PullupContext *s = ctx->priv;
657 PullupBuffer *b;
658 PullupFrame *f;
659 AVFrame *out;
660 396 int p, ret = 0;
661
662 396 b = pullup_get_buffer(s, 2);
663
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 396 times.
 396 if (!b) {
664 ✗ av_log(ctx, AV_LOG_WARNING, "Could not get buffer!\n");
665 ✗ f = pullup_get_frame(s);
666 ✗ pullup_release_frame(f);
667 ✗ goto end;
668 }
669
670 396 av_image_copy2(b->planes, s->planewidth,
671 396 in->data, in->linesize,
672 396 inlink->format, inlink->w, inlink->h);
673
674 792 p = (in->flags & AV_FRAME_FLAG_INTERLACED) ?
675
3/4
✓ Branch 0 taken 300 times.
✓ Branch 1 taken 96 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 300 times.
 396 !(in->flags & AV_FRAME_FLAG_TOP_FIELD_FIRST) : 0;
676 396 pullup_submit_field(s, b, p );
677 396 pullup_submit_field(s, b, p^1);
678
679
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 396 times.
 396 if (in->repeat_pict)
680 ✗ pullup_submit_field(s, b, p);
681
682 396 pullup_release_buffer(b, 2);
683
684 396 f = pullup_get_frame(s);
685
2/2
✓ Branch 0 taken 84 times.
✓ Branch 1 taken 312 times.
 396 if (!f)
686 84 goto end;
687
688
2/2
✓ Branch 0 taken 24 times.
✓ Branch 1 taken 288 times.
 312 if (f->length < 2) {
689 24 pullup_release_frame(f);
690 24 f = pullup_get_frame(s);
691
2/2
✓ Branch 0 taken 12 times.
✓ Branch 1 taken 12 times.
 24 if (!f)
692 12 goto end;
693
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 12 times.
 12 if (f->length < 2) {
694 ✗ pullup_release_frame(f);
695 ✗ if (!in->repeat_pict)
696 ✗ goto end;
697 ✗ f = pullup_get_frame(s);
698 ✗ if (!f)
699 ✗ goto end;
700 ✗ if (f->length < 2) {
701 ✗ pullup_release_frame(f);
702 ✗ goto end;
703 }
704 }
705 }
706
707 /* If the frame isn't already exportable... */
708
2/2
✓ Branch 0 taken 72 times.
✓ Branch 1 taken 228 times.
 300 if (!f->buffer)
709 72 pullup_pack_frame(s, f);
710
711 300 out = ff_get_video_buffer(outlink, outlink->w, outlink->h);
712
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 300 times.
 300 if (!out) {
713 ✗ ret = AVERROR(ENOMEM);
714 ✗ goto end;
715 }
716 300 av_frame_copy_props(out, in);
717
718 300 av_image_copy2(out->data, out->linesize,
719 300 f->buffer->planes, s->planewidth,
720 300 inlink->format, inlink->w, inlink->h);
721
722 300 ret = ff_filter_frame(outlink, out);
723 300 pullup_release_frame(f);
724 396 end:
725 396 av_frame_free(&in);
726 396 return ret;
727 }
728
729 25 static av_cold void uninit(AVFilterContext *ctx)
730 {
731 25 PullupContext *s = ctx->priv;
732 int i;
733
734 25 free_field_queue(s->head);
735 25 s->last = NULL;
736
737
2/2
✓ Branch 0 taken 250 times.
✓ Branch 1 taken 25 times.
 275 for (i = 0; i < FF_ARRAY_ELEMS(s->buffers); i++) {
738 250 av_freep(&s->buffers[i].planes[0]);
739 250 av_freep(&s->buffers[i].planes[1]);
740 250 av_freep(&s->buffers[i].planes[2]);
741 }
742 25 }
743
744 static const AVFilterPad pullup_inputs[] = {
745 {
746 .name = "default",
747 .type = AVMEDIA_TYPE_VIDEO,
748 .filter_frame = filter_frame,
749 .config_props = config_input,
750 },
751 };
752
753 const AVFilter ff_vf_pullup = {
754 .name = "pullup",
755 .description = NULL_IF_CONFIG_SMALL("Pullup from field sequence to frames."),
756 .priv_size = sizeof(PullupContext),
757 .priv_class = &pullup_class,
758 .uninit = uninit,
759 FILTER_INPUTS(pullup_inputs),
760 FILTER_OUTPUTS(ff_video_default_filterpad),
761 FILTER_PIXFMTS_ARRAY(pix_fmts),
762 };
763