FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libavfilter/vf_spp.c
Date: 2026-04-23 21:43:00
Exec Total Coverage
Lines: 150 206 72.8%
Functions: 9 13 69.2%
Branches: 71 141 50.4%
Line Branch Exec Source
1 /*
2 * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>
3 * Copyright (c) 2013 Clément Bœsch <u pkh me>
4 *
5 * This file is part of FFmpeg.
6 *
7 * FFmpeg is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (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
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License along
18 * with FFmpeg; if not, write to the Free Software Foundation, Inc.,
19 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
20 */
21
22 /**
23 * @file
24 * Simple post processing filter
25 *
26 * This implementation is based on an algorithm described in
27 * "Aria Nosratinia Embedded Post-Processing for
28 * Enhancement of Compressed Images (1999)"
29 *
30 * Originally written by Michael Niedermayer for the MPlayer project, and
31 * ported by Clément Bœsch for FFmpeg.
32 */
33
34 #include "libavutil/imgutils.h"
35 #include "libavutil/mem.h"
36 #include "libavutil/mem_internal.h"
37 #include "libavutil/opt.h"
38 #include "libavutil/pixdesc.h"
39
40 #include "filters.h"
41 #include "qp_table.h"
42 #include "vf_spp.h"
43 #include "video.h"
44
45 enum mode {
46 MODE_HARD,
47 MODE_SOFT,
48 NB_MODES
49 };
50
51 ✗ static const AVClass *child_class_iterate(void **iter)
52 {
53 ✗ const AVClass *c = *iter ? NULL : avcodec_dct_get_class();
54 ✗ *iter = (void*)(uintptr_t)c;
55 ✗ return c;
56 }
57
58 4 static void *child_next(void *obj, void *prev)
59 {
60 4 SPPContext *s = obj;
61
1/2
✓ Branch 0 taken 4 times.
✗ Branch 1 not taken.
 4 return prev ? NULL : s->dct;
62 }
63
64 #define OFFSET(x) offsetof(SPPContext, x)
65 #define FLAGS AV_OPT_FLAG_FILTERING_PARAM|AV_OPT_FLAG_VIDEO_PARAM
66 #define TFLAGS AV_OPT_FLAG_FILTERING_PARAM|AV_OPT_FLAG_VIDEO_PARAM|AV_OPT_FLAG_RUNTIME_PARAM
67 static const AVOption spp_options[] = {
68 { "quality", "set quality", OFFSET(log2_count), AV_OPT_TYPE_INT, {.i64 = 3}, 0, MAX_LEVEL, TFLAGS },
69 { "qp", "force a constant quantizer parameter", OFFSET(qp), AV_OPT_TYPE_INT, {.i64 = 0}, 0, 63, FLAGS },
70 { "mode", "set thresholding mode", OFFSET(mode), AV_OPT_TYPE_INT, {.i64 = MODE_HARD}, 0, NB_MODES - 1, FLAGS, .unit = "mode" },
71 { "hard", "hard thresholding", 0, AV_OPT_TYPE_CONST, {.i64 = MODE_HARD}, INT_MIN, INT_MAX, FLAGS, .unit = "mode" },
72 { "soft", "soft thresholding", 0, AV_OPT_TYPE_CONST, {.i64 = MODE_SOFT}, INT_MIN, INT_MAX, FLAGS, .unit = "mode" },
73 { "use_bframe_qp", "use B-frames' QP", OFFSET(use_bframe_qp), AV_OPT_TYPE_BOOL, {.i64 = 0}, 0, 1, FLAGS },
74 { NULL }
75 };
76
77 static const AVClass spp_class = {
78 .class_name = "spp",
79 .item_name = av_default_item_name,
80 .option = spp_options,
81 .version = LIBAVUTIL_VERSION_INT,
82 .category = AV_CLASS_CATEGORY_FILTER,
83 .child_class_iterate = child_class_iterate,
84 .child_next = child_next,
85 };
86
87 // XXX: share between filters?
88 DECLARE_ALIGNED(8, static const uint8_t, ldither)[8][8] = {
89 { 0, 48, 12, 60, 3, 51, 15, 63 },
90 { 32, 16, 44, 28, 35, 19, 47, 31 },
91 { 8, 56, 4, 52, 11, 59, 7, 55 },
92 { 40, 24, 36, 20, 43, 27, 39, 23 },
93 { 2, 50, 14, 62, 1, 49, 13, 61 },
94 { 34, 18, 46, 30, 33, 17, 45, 29 },
95 { 10, 58, 6, 54, 9, 57, 5, 53 },
96 { 42, 26, 38, 22, 41, 25, 37, 21 },
97 };
98
99 static const uint8_t offset[128][2] = {
100 {0,0}, // unused
101 {0,0},
102 {0,0}, {4,4}, // quality = 1
103 {0,0}, {2,2}, {6,4}, {4,6}, // quality = 2
104 {0,0}, {5,1}, {2,2}, {7,3}, {4,4}, {1,5}, {6,6}, {3,7}, // quality = 3
105
106 {0,0}, {4,0}, {1,1}, {5,1}, {3,2}, {7,2}, {2,3}, {6,3}, // quality = 4
107 {0,4}, {4,4}, {1,5}, {5,5}, {3,6}, {7,6}, {2,7}, {6,7},
108
109 {0,0}, {0,2}, {0,4}, {0,6}, {1,1}, {1,3}, {1,5}, {1,7}, // quality = 5
110 {2,0}, {2,2}, {2,4}, {2,6}, {3,1}, {3,3}, {3,5}, {3,7},
111 {4,0}, {4,2}, {4,4}, {4,6}, {5,1}, {5,3}, {5,5}, {5,7},
112 {6,0}, {6,2}, {6,4}, {6,6}, {7,1}, {7,3}, {7,5}, {7,7},
113
114 {0,0}, {4,4}, {0,4}, {4,0}, {2,2}, {6,6}, {2,6}, {6,2}, // quality = 6
115 {0,2}, {4,6}, {0,6}, {4,2}, {2,0}, {6,4}, {2,4}, {6,0},
116 {1,1}, {5,5}, {1,5}, {5,1}, {3,3}, {7,7}, {3,7}, {7,3},
117 {1,3}, {5,7}, {1,7}, {5,3}, {3,1}, {7,5}, {3,5}, {7,1},
118 {0,1}, {4,5}, {0,5}, {4,1}, {2,3}, {6,7}, {2,7}, {6,3},
119 {0,3}, {4,7}, {0,7}, {4,3}, {2,1}, {6,5}, {2,5}, {6,1},
120 {1,0}, {5,4}, {1,4}, {5,0}, {3,2}, {7,6}, {3,6}, {7,2},
121 {1,2}, {5,6}, {1,6}, {5,2}, {3,0}, {7,4}, {3,4}, {7,0},
122 };
123
124 121872 static void hardthresh_c(int16_t dst[64], const int16_t src[64],
125 int qp, const uint8_t *permutation)
126 {
127 int i;
128 121872 int bias = 0; // FIXME
129
130 121872 unsigned threshold1 = qp * ((1<<4) - bias) - 1;
131 121872 unsigned threshold2 = threshold1 << 1;
132
133 121872 memset(dst, 0, 64 * sizeof(dst[0]));
134 121872 dst[0] = (src[0] + 4) >> 3;
135
136
2/2
✓ Branch 0 taken 7677936 times.
✓ Branch 1 taken 121872 times.
 7799808 for (i = 1; i < 64; i++) {
137 7677936 int level = src[i];
138
2/2
✓ Branch 0 taken 3400251 times.
✓ Branch 1 taken 4277685 times.
 7677936 if (((unsigned)(level + threshold1)) > threshold2) {
139 3400251 const int j = permutation[i];
140 3400251 dst[j] = (level + 4) >> 3;
141 }
142 }
143 121872 }
144
145 ✗ static void softthresh_c(int16_t dst[64], const int16_t src[64],
146 int qp, const uint8_t *permutation)
147 {
148 int i;
149 ✗ int bias = 0; //FIXME
150
151 ✗ unsigned threshold1 = qp * ((1<<4) - bias) - 1;
152 ✗ unsigned threshold2 = threshold1 << 1;
153
154 ✗ memset(dst, 0, 64 * sizeof(dst[0]));
155 ✗ dst[0] = (src[0] + 4) >> 3;
156
157 ✗ for (i = 1; i < 64; i++) {
158 ✗ int level = src[i];
159 ✗ if (((unsigned)(level + threshold1)) > threshold2) {
160 ✗ const int j = permutation[i];
161 ✗ if (level > 0) dst[j] = (level - threshold1 + 4) >> 3;
162 ✗ else dst[j] = (level + threshold1 + 4) >> 3;
163 }
164 }
165 ✗ }
166
167 432 static void store_slice_c(uint8_t *dst, const int16_t *src,
168 int dst_linesize, int src_linesize,
169 int width, int height, int log2_scale,
170 const uint8_t dither[8][8])
171 {
172 int y, x;
173
174 #define STORE(pos) do { \
175 temp = (src[x + y*src_linesize + pos] * (1 << log2_scale) + d[pos]) >> 6;\
176 if (temp & 0x100) \
177 temp = ~(temp >> 31); \
178 dst[x + y*dst_linesize + pos] = temp; \
179 } while (0)
180
181
2/2
✓ Branch 0 taken 3456 times.
✓ Branch 1 taken 432 times.
 3888 for (y = 0; y < height; y++) {
182 3456 const uint8_t *d = dither[y];
183
2/2
✓ Branch 0 taken 114048 times.
✓ Branch 1 taken 3456 times.
 117504 for (x = 0; x < width; x += 8) {
184 int temp;
185
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 114048 times.
 114048 STORE(0);
186
2/2
✓ Branch 0 taken 2 times.
✓ Branch 1 taken 114046 times.
 114048 STORE(1);
187
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 114048 times.
 114048 STORE(2);
188
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 114048 times.
 114048 STORE(3);
189
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 114048 times.
 114048 STORE(4);
190
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 114048 times.
 114048 STORE(5);
191
2/2
✓ Branch 0 taken 1 times.
✓ Branch 1 taken 114047 times.
 114048 STORE(6);
192
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 114048 times.
 114048 STORE(7);
193 }
194 }
195 432 }
196
197 ✗ static void store_slice16_c(uint16_t *dst, const int16_t *src,
198 int dst_linesize, int src_linesize,
199 int width, int height, int log2_scale,
200 const uint8_t dither[8][8], int depth)
201 {
202 int y, x;
203 ✗ unsigned int mask = -1<<depth;
204
205 #define STORE16(pos) do { \
206 temp = (src[x + y*src_linesize + pos] * (1 << log2_scale) + (d[pos]>>1)) >> 5; \
207 if (temp & mask ) \
208 temp = ~(temp >> 31); \
209 dst[x + y*dst_linesize + pos] = temp; \
210 } while (0)
211
212 ✗ for (y = 0; y < height; y++) {
213 ✗ const uint8_t *d = dither[y];
214 ✗ for (x = 0; x < width; x += 8) {
215 int temp;
216 ✗ STORE16(0);
217 ✗ STORE16(1);
218 ✗ STORE16(2);
219 ✗ STORE16(3);
220 ✗ STORE16(4);
221 ✗ STORE16(5);
222 ✗ STORE16(6);
223 ✗ STORE16(7);
224 }
225 }
226 ✗ }
227
228 121872 static inline void add_block(uint16_t *dst, int linesize, const int16_t block[64])
229 {
230 int y;
231
232
2/2
✓ Branch 0 taken 974976 times.
✓ Branch 1 taken 121872 times.
 1096848 for (y = 0; y < 8; y++) {
233 974976 dst[0 + y*linesize] += block[0 + y*8];
234 974976 dst[1 + y*linesize] += block[1 + y*8];
235 974976 dst[2 + y*linesize] += block[2 + y*8];
236 974976 dst[3 + y*linesize] += block[3 + y*8];
237 974976 dst[4 + y*linesize] += block[4 + y*8];
238 974976 dst[5 + y*linesize] += block[5 + y*8];
239 974976 dst[6 + y*linesize] += block[6 + y*8];
240 974976 dst[7 + y*linesize] += block[7 + y*8];
241 }
242 121872 }
243
244 18 static void filter(SPPContext *p, uint8_t *dst, uint8_t *src,
245 int dst_linesize, int src_linesize, int width, int height,
246 const uint8_t *qp_table, int qp_stride, int is_luma, int depth)
247 {
248 int x, y, i;
249 18 const int count = 1 << p->log2_count;
250
2/2
✓ Branch 0 taken 6 times.
✓ Branch 1 taken 12 times.
 18 const int linesize = is_luma ? p->temp_linesize : FFALIGN(width+16, 16);
251 DECLARE_ALIGNED(16, uint64_t, block_align)[32];
252 18 int16_t *block = (int16_t *)block_align;
253 18 int16_t *block2 = (int16_t *)(block_align + 16);
254 18 uint16_t *psrc16 = (uint16_t*)p->src;
255 18 const int sample_bytes = (depth+7) / 8;
256
257
2/2
✓ Branch 0 taken 3456 times.
✓ Branch 1 taken 18 times.
 3474 for (y = 0; y < height; y++) {
258 3456 int index = 8 + 8*linesize + y*linesize;
259 3456 memcpy(p->src + index*sample_bytes, src + y*src_linesize, width*sample_bytes);
260
1/2
✓ Branch 0 taken 3456 times.
✗ Branch 1 not taken.
 3456 if (sample_bytes == 1) {
261
2/2
✓ Branch 0 taken 27648 times.
✓ Branch 1 taken 3456 times.
 31104 for (x = 0; x < 8; x++) {
262 27648 p->src[index - x - 1] = p->src[index + x ];
263 27648 p->src[index + width + x ] = p->src[index + width - x - 1];
264 }
265 } else {
266 ✗ for (x = 0; x < 8; x++) {
267 ✗ psrc16[index - x - 1] = psrc16[index + x ];
268 ✗ psrc16[index + width + x ] = psrc16[index + width - x - 1];
269 }
270 }
271 }
272
2/2
✓ Branch 0 taken 144 times.
✓ Branch 1 taken 18 times.
 162 for (y = 0; y < 8; y++) {
273 144 memcpy(p->src + ( 7-y)*linesize * sample_bytes, p->src + ( y+8)*linesize * sample_bytes, linesize * sample_bytes);
274 144 memcpy(p->src + (height+8+y)*linesize * sample_bytes, p->src + (height-y+7)*linesize * sample_bytes, linesize * sample_bytes);
275 }
276
277
2/2
✓ Branch 0 taken 450 times.
✓ Branch 1 taken 18 times.
 468 for (y = 0; y < height + 8; y += 8) {
278 450 memset(p->temp + (8 + y) * linesize, 0, 8 * linesize * sizeof(*p->temp));
279
2/2
✓ Branch 0 taken 15234 times.
✓ Branch 1 taken 450 times.
 15684 for (x = 0; x < width + 8; x += 8) {
280 int qp;
281
282
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 15234 times.
 15234 if (p->qp) {
283 ✗ qp = p->qp;
284 } else{
285 15234 const int qps = 3 + is_luma;
286
4/4
✓ Branch 0 taken 450 times.
✓ Branch 1 taken 14784 times.
✓ Branch 2 taken 546 times.
✓ Branch 3 taken 14688 times.
 15234 qp = qp_table[(FFMIN(x, width - 1) >> qps) + (FFMIN(y, height - 1) >> qps) * qp_stride];
287
1/2
✓ Branch 1 taken 15234 times.
✗ Branch 2 not taken.
 15234 qp = FFMAX(1, ff_norm_qscale(qp, p->qscale_type));
288 }
289
2/2
✓ Branch 0 taken 121872 times.
✓ Branch 1 taken 15234 times.
 137106 for (i = 0; i < count; i++) {
290 121872 const int x1 = x + offset[i + count][0];
291 121872 const int y1 = y + offset[i + count][1];
292 121872 const int index = x1 + y1*linesize;
293 121872 p->dct->get_pixels_unaligned(block, p->src + sample_bytes*index, sample_bytes*linesize);
294 121872 p->dct->fdct(block);
295 121872 p->requantize(block2, block, qp, p->dct->idct_permutation);
296 121872 p->dct->idct(block2);
297 121872 add_block(p->temp + index, linesize, block2);
298 }
299 }
300
2/2
✓ Branch 0 taken 432 times.
✓ Branch 1 taken 18 times.
 450 if (y) {
301
1/2
✓ Branch 0 taken 432 times.
✗ Branch 1 not taken.
 432 if (sample_bytes == 1) {
302 432 p->store_slice(dst + (y - 8) * dst_linesize, p->temp + 8 + y*linesize,
303 dst_linesize, linesize, width,
304 432 FFMIN(8, height + 8 - y), MAX_LEVEL - p->log2_count,
305 ldither);
306 } else {
307 ✗ store_slice16_c((uint16_t*)(dst + (y - 8) * dst_linesize), p->temp + 8 + y*linesize,
308 dst_linesize/2, linesize, width,
309 ✗ FFMIN(8, height + 8 - y), MAX_LEVEL - p->log2_count,
310 ldither, depth);
311 }
312 }
313 }
314 18 }
315
316 static const enum AVPixelFormat pix_fmts[] = {
317 AV_PIX_FMT_YUV444P, AV_PIX_FMT_YUV422P,
318 AV_PIX_FMT_YUV420P, AV_PIX_FMT_YUV411P,
319 AV_PIX_FMT_YUV410P, AV_PIX_FMT_YUV440P,
320 AV_PIX_FMT_YUVJ444P, AV_PIX_FMT_YUVJ422P,
321 AV_PIX_FMT_YUVJ420P, AV_PIX_FMT_YUVJ440P,
322 AV_PIX_FMT_YUV444P10, AV_PIX_FMT_YUV422P10,
323 AV_PIX_FMT_YUV420P10,
324 AV_PIX_FMT_YUV444P9, AV_PIX_FMT_YUV422P9,
325 AV_PIX_FMT_YUV420P9,
326 AV_PIX_FMT_GRAY8,
327 AV_PIX_FMT_GBRP,
328 AV_PIX_FMT_GBRP9,
329 AV_PIX_FMT_GBRP10,
330 AV_PIX_FMT_NONE
331 };
332
333 1 static int config_input(AVFilterLink *inlink)
334 {
335 1 SPPContext *s = inlink->dst->priv;
336 1 const int h = FFALIGN(inlink->h + 16, 16);
337 1 const AVPixFmtDescriptor *desc = av_pix_fmt_desc_get(inlink->format);
338 1 const int bps = desc->comp[0].depth;
339
340 1 s->store_slice = store_slice_c;
341
1/3
✓ Branch 0 taken 1 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
 1 switch (s->mode) {
342 1 case MODE_HARD: s->requantize = hardthresh_c; break;
343 ✗ case MODE_SOFT: s->requantize = softthresh_c; break;
344 }
345
346 1 av_opt_set_int(s->dct, "bits_per_sample", bps, 0);
347 1 avcodec_dct_init(s->dct);
348
349 #if ARCH_X86
350 1 ff_spp_init_x86(s);
351 #endif
352
353 1 s->hsub = desc->log2_chroma_w;
354 1 s->vsub = desc->log2_chroma_h;
355 1 s->temp_linesize = FFALIGN(inlink->w + 16, 16);
356 1 s->temp = av_malloc_array(s->temp_linesize, h * sizeof(*s->temp));
357 1 s->src = av_malloc_array(s->temp_linesize, h * sizeof(*s->src) * 2);
358
359
2/4
✓ Branch 0 taken 1 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 1 times.
 1 if (!s->temp || !s->src)
360 ✗ return AVERROR(ENOMEM);
361 1 return 0;
362 }
363
364 6 static int filter_frame(AVFilterLink *inlink, AVFrame *in)
365 {
366 6 AVFilterContext *ctx = inlink->dst;
367 6 SPPContext *s = ctx->priv;
368 6 AVFilterLink *outlink = ctx->outputs[0];
369 6 AVFrame *out = in;
370 6 int qp_stride = 0;
371 6 int8_t *qp_table = NULL;
372 6 const AVPixFmtDescriptor *desc = av_pix_fmt_desc_get(inlink->format);
373 6 const int depth = desc->comp[0].depth;
374 6 int ret = 0;
375
376 /* if we are not in a constant user quantizer mode and we don't want to use
377 * the quantizers from the B-frames (B-frames often have a higher QP), we
378 * need to save the qp table from the last non B-frame; this is what the
379 * following code block does */
380
4/6
✓ Branch 0 taken 6 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 6 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 2 times.
✓ Branch 5 taken 4 times.
 6 if (!s->qp && (s->use_bframe_qp || in->pict_type != AV_PICTURE_TYPE_B)) {
381 2 ret = ff_qp_table_extract(in, &qp_table, &qp_stride, NULL, &s->qscale_type);
382
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2 times.
 2 if (ret < 0) {
383 ✗ av_frame_free(&in);
384 ✗ return ret;
385 }
386
387
2/4
✓ Branch 0 taken 2 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 2 times.
✗ Branch 3 not taken.
 2 if (!s->use_bframe_qp && in->pict_type != AV_PICTURE_TYPE_B) {
388 2 av_freep(&s->non_b_qp_table);
389 2 s->non_b_qp_table = qp_table;
390 2 s->non_b_qp_stride = qp_stride;
391 }
392 }
393
394
2/4
✓ Branch 0 taken 6 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 6 times.
✗ Branch 3 not taken.
 6 if (s->log2_count && !ctx->is_disabled) {
395
2/4
✓ Branch 0 taken 6 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 6 times.
✗ Branch 3 not taken.
 6 if (!s->use_bframe_qp && s->non_b_qp_table) {
396 6 qp_table = s->non_b_qp_table;
397 6 qp_stride = s->non_b_qp_stride;
398 }
399
400
1/4
✗ Branch 0 not taken.
✓ Branch 1 taken 6 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
 6 if (qp_table || s->qp) {
401 6 const int cw = AV_CEIL_RSHIFT(inlink->w, s->hsub);
402 6 const int ch = AV_CEIL_RSHIFT(inlink->h, s->vsub);
403
404 /* get a new frame if in-place is not possible or if the dimensions
405 * are not multiple of 8 */
406
4/6
✓ Branch 1 taken 3 times.
✓ Branch 2 taken 3 times.
✓ Branch 3 taken 3 times.
✗ Branch 4 not taken.
✗ Branch 5 not taken.
✓ Branch 6 taken 3 times.
 6 if (!av_frame_is_writable(in) || (inlink->w & 7) || (inlink->h & 7)) {
407 3 const int aligned_w = FFALIGN(inlink->w, 8);
408 3 const int aligned_h = FFALIGN(inlink->h, 8);
409
410 3 out = ff_get_video_buffer(outlink, aligned_w, aligned_h);
411
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3 times.
 3 if (!out) {
412 ✗ av_frame_free(&in);
413 ✗ ret = AVERROR(ENOMEM);
414 ✗ goto finish;
415 }
416 3 av_frame_copy_props(out, in);
417 3 out->width = in->width;
418 3 out->height = in->height;
419 }
420
421 6 filter(s, out->data[0], in->data[0], out->linesize[0], in->linesize[0], inlink->w, inlink->h, qp_table, qp_stride, 1, depth);
422
423
1/2
✓ Branch 0 taken 6 times.
✗ Branch 1 not taken.
 6 if (out->data[2]) {
424 6 filter(s, out->data[1], in->data[1], out->linesize[1], in->linesize[1], cw, ch, qp_table, qp_stride, 0, depth);
425 6 filter(s, out->data[2], in->data[2], out->linesize[2], in->linesize[2], cw, ch, qp_table, qp_stride, 0, depth);
426 }
427 }
428 }
429
430
2/2
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 3 times.
 6 if (in != out) {
431
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3 times.
 3 if (in->data[3])
432 ✗ av_image_copy_plane(out->data[3], out->linesize[3],
433 ✗ in ->data[3], in ->linesize[3],
434 inlink->w, inlink->h);
435 3 av_frame_free(&in);
436 }
437 6 ret = ff_filter_frame(outlink, out);
438 6 finish:
439
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 6 times.
 6 if (qp_table != s->non_b_qp_table)
440 ✗ av_freep(&qp_table);
441 6 return ret;
442 }
443
444 ✗ static int process_command(AVFilterContext *ctx, const char *cmd, const char *args,
445 char *res, int res_len, int flags)
446 {
447 ✗ SPPContext *s = ctx->priv;
448
449 ✗ if (!strcmp(cmd, "level") || !strcmp(cmd, "quality")) {
450 ✗ if (!strcmp(args, "max"))
451 ✗ s->log2_count = MAX_LEVEL;
452 else
453 ✗ s->log2_count = av_clip(strtol(args, NULL, 10), 0, MAX_LEVEL);
454 ✗ return 0;
455 }
456 ✗ return AVERROR(ENOSYS);
457 }
458
459 2 static av_cold int preinit(AVFilterContext *ctx)
460 {
461 2 SPPContext *s = ctx->priv;
462
463 2 s->dct = avcodec_dct_alloc();
464
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2 times.
 2 if (!s->dct)
465 ✗ return AVERROR(ENOMEM);
466
467 2 return 0;
468 }
469
470 2 static av_cold void uninit(AVFilterContext *ctx)
471 {
472 2 SPPContext *s = ctx->priv;
473
474 2 av_freep(&s->temp);
475 2 av_freep(&s->src);
476 2 av_freep(&s->dct);
477 2 av_freep(&s->non_b_qp_table);
478 2 }
479
480 static const AVFilterPad spp_inputs[] = {
481 {
482 .name = "default",
483 .type = AVMEDIA_TYPE_VIDEO,
484 .config_props = config_input,
485 .filter_frame = filter_frame,
486 },
487 };
488
489 const FFFilter ff_vf_spp = {
490 .p.name = "spp",
491 .p.description = NULL_IF_CONFIG_SMALL("Apply a simple post processing filter."),
492 .p.priv_class = &spp_class,
493 .p.flags = AVFILTER_FLAG_SUPPORT_TIMELINE_INTERNAL,
494 .priv_size = sizeof(SPPContext),
495 .preinit = preinit,
496 .uninit = uninit,
497 FILTER_INPUTS(spp_inputs),
498 FILTER_OUTPUTS(ff_video_default_filterpad),
499 FILTER_PIXFMTS_ARRAY(pix_fmts),
500 .process_command = process_command,
501 };
502