/src/ffmpeg/libswscale/ops.c
Line | Count | Source |
1 | | /** |
2 | | * Copyright (C) 2025 Niklas Haas |
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 Lesser General Public |
8 | | * License as published by the Free Software Foundation; either |
9 | | * version 2.1 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 GNU |
14 | | * Lesser General Public License for more details. |
15 | | * |
16 | | * You should have received a copy of the GNU Lesser General Public |
17 | | * License along 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/attributes.h" |
22 | | #include "libavutil/avassert.h" |
23 | | #include "libavutil/avstring.h" |
24 | | #include "libavutil/bprint.h" |
25 | | #include "libavutil/bswap.h" |
26 | | #include "libavutil/mem.h" |
27 | | #include "libavutil/rational.h" |
28 | | #include "libavutil/refstruct.h" |
29 | | |
30 | | #include "format.h" |
31 | | #include "ops.h" |
32 | | #include "ops_internal.h" |
33 | | |
34 | | extern const SwsOpBackend backend_c; |
35 | | extern const SwsOpBackend backend_murder; |
36 | | extern const SwsOpBackend backend_aarch64; |
37 | | extern const SwsOpBackend backend_x86; |
38 | | #if HAVE_SPIRV_HEADERS_SPIRV_H || HAVE_SPIRV_UNIFIED1_SPIRV_H |
39 | | extern const SwsOpBackend backend_spirv; |
40 | | #endif |
41 | | #if CONFIG_LIBSHADERC || CONFIG_LIBGLSLANG |
42 | | extern const SwsOpBackend backend_glsl; |
43 | | #endif |
44 | | |
45 | | const SwsOpBackend * const ff_sws_op_backends[] = { |
46 | | &backend_murder, |
47 | | #if ARCH_AARCH64 && HAVE_NEON |
48 | | &backend_aarch64, |
49 | | #elif ARCH_X86_64 && HAVE_X86ASM |
50 | | &backend_x86, |
51 | | #endif |
52 | | &backend_c, |
53 | | #if HAVE_SPIRV_HEADERS_SPIRV_H || HAVE_SPIRV_UNIFIED1_SPIRV_H |
54 | | &backend_spirv, |
55 | | #endif |
56 | | #if CONFIG_LIBSHADERC || CONFIG_LIBGLSLANG |
57 | | &backend_glsl, |
58 | | #endif |
59 | | NULL |
60 | | }; |
61 | | |
62 | | const char *ff_sws_pixel_type_name(SwsPixelType type) |
63 | 0 | { |
64 | 0 | switch (type) { |
65 | 0 | case SWS_PIXEL_U8: return "u8"; |
66 | 0 | case SWS_PIXEL_U16: return "u16"; |
67 | 0 | case SWS_PIXEL_U32: return "u32"; |
68 | 0 | case SWS_PIXEL_F32: return "f32"; |
69 | 0 | case SWS_PIXEL_NONE: return "none"; |
70 | 0 | case SWS_PIXEL_TYPE_NB: break; |
71 | 0 | } |
72 | | |
73 | 0 | av_unreachable("Invalid pixel type!"); |
74 | 0 | return "ERR"; |
75 | 0 | } |
76 | | |
77 | | int ff_sws_pixel_type_size(SwsPixelType type) |
78 | 0 | { |
79 | 0 | switch (type) { |
80 | 0 | case SWS_PIXEL_U8: return sizeof(uint8_t); |
81 | 0 | case SWS_PIXEL_U16: return sizeof(uint16_t); |
82 | 0 | case SWS_PIXEL_U32: return sizeof(uint32_t); |
83 | 0 | case SWS_PIXEL_F32: return sizeof(float); |
84 | 0 | case SWS_PIXEL_NONE: break; |
85 | 0 | case SWS_PIXEL_TYPE_NB: break; |
86 | 0 | } |
87 | | |
88 | 0 | av_unreachable("Invalid pixel type!"); |
89 | 0 | return 0; |
90 | 0 | } |
91 | | |
92 | | bool ff_sws_pixel_type_is_int(SwsPixelType type) |
93 | 0 | { |
94 | 0 | switch (type) { |
95 | 0 | case SWS_PIXEL_U8: |
96 | 0 | case SWS_PIXEL_U16: |
97 | 0 | case SWS_PIXEL_U32: |
98 | 0 | return true; |
99 | 0 | case SWS_PIXEL_F32: |
100 | 0 | return false; |
101 | 0 | case SWS_PIXEL_NONE: |
102 | 0 | case SWS_PIXEL_TYPE_NB: break; |
103 | 0 | } |
104 | | |
105 | 0 | av_unreachable("Invalid pixel type!"); |
106 | 0 | return false; |
107 | 0 | } |
108 | | |
109 | | const char *ff_sws_op_type_name(SwsOpType op) |
110 | 0 | { |
111 | 0 | switch (op) { |
112 | 0 | case SWS_OP_READ: return "SWS_OP_READ"; |
113 | 0 | case SWS_OP_WRITE: return "SWS_OP_WRITE"; |
114 | 0 | case SWS_OP_SWAP_BYTES: return "SWS_OP_SWAP_BYTES"; |
115 | 0 | case SWS_OP_SWIZZLE: return "SWS_OP_SWIZZLE"; |
116 | 0 | case SWS_OP_UNPACK: return "SWS_OP_UNPACK"; |
117 | 0 | case SWS_OP_PACK: return "SWS_OP_PACK"; |
118 | 0 | case SWS_OP_LSHIFT: return "SWS_OP_LSHIFT"; |
119 | 0 | case SWS_OP_RSHIFT: return "SWS_OP_RSHIFT"; |
120 | 0 | case SWS_OP_CLEAR: return "SWS_OP_CLEAR"; |
121 | 0 | case SWS_OP_CONVERT: return "SWS_OP_CONVERT"; |
122 | 0 | case SWS_OP_MIN: return "SWS_OP_MIN"; |
123 | 0 | case SWS_OP_MAX: return "SWS_OP_MAX"; |
124 | 0 | case SWS_OP_SCALE: return "SWS_OP_SCALE"; |
125 | 0 | case SWS_OP_LINEAR: return "SWS_OP_LINEAR"; |
126 | 0 | case SWS_OP_DITHER: return "SWS_OP_DITHER"; |
127 | 0 | case SWS_OP_FILTER_H: return "SWS_OP_FILTER_H"; |
128 | 0 | case SWS_OP_FILTER_V: return "SWS_OP_FILTER_V"; |
129 | 0 | case SWS_OP_INVALID: return "SWS_OP_INVALID"; |
130 | 0 | case SWS_OP_TYPE_NB: break; |
131 | 0 | } |
132 | | |
133 | 0 | av_unreachable("Invalid operation type!"); |
134 | 0 | return "ERR"; |
135 | 0 | } |
136 | | |
137 | | SwsCompMask ff_sws_comp_mask_q4(const AVRational q[4]) |
138 | 0 | { |
139 | 0 | SwsCompMask mask = 0; |
140 | 0 | for (int i = 0; i < 4; i++) { |
141 | 0 | if (q[i].den) |
142 | 0 | mask |= SWS_COMP(i); |
143 | 0 | } |
144 | 0 | return mask; |
145 | 0 | } |
146 | | |
147 | | SwsCompMask ff_sws_comp_mask_swizzle(const SwsCompMask mask, const SwsSwizzleOp swiz) |
148 | 0 | { |
149 | 0 | SwsCompMask res = 0; |
150 | 0 | for (int i = 0; i < 4; i++) { |
151 | 0 | const int src = swiz.in[i]; |
152 | 0 | if (SWS_COMP_TEST(mask, src)) |
153 | 0 | res |= SWS_COMP(i); |
154 | 0 | } |
155 | |
|
156 | 0 | return res; |
157 | 0 | } |
158 | | |
159 | | SwsCompMask ff_sws_comp_mask_needed(const SwsOp *op) |
160 | 0 | { |
161 | 0 | SwsCompMask mask = 0; |
162 | 0 | for (int i = 0; i < 4; i++) { |
163 | 0 | if (SWS_OP_NEEDED(op, i)) |
164 | 0 | mask |= SWS_COMP(i); |
165 | 0 | } |
166 | 0 | return mask; |
167 | 0 | } |
168 | | |
169 | | /* biased towards `a` */ |
170 | | static AVRational av_min_q(AVRational a, AVRational b) |
171 | 0 | { |
172 | 0 | return av_cmp_q(a, b) == 1 ? b : a; |
173 | 0 | } |
174 | | |
175 | | static AVRational av_max_q(AVRational a, AVRational b) |
176 | 0 | { |
177 | 0 | return av_cmp_q(a, b) == -1 ? b : a; |
178 | 0 | } |
179 | | |
180 | | void ff_sws_apply_op_q(const SwsOp *op, AVRational x[4]) |
181 | 0 | { |
182 | 0 | uint64_t mask[4]; |
183 | 0 | int shift[4]; |
184 | |
|
185 | 0 | switch (op->op) { |
186 | 0 | case SWS_OP_READ: |
187 | 0 | case SWS_OP_WRITE: |
188 | 0 | return; |
189 | 0 | case SWS_OP_UNPACK: { |
190 | 0 | av_assert1(ff_sws_pixel_type_is_int(op->type)); |
191 | 0 | ff_sws_pack_op_decode(op, mask, shift); |
192 | 0 | unsigned val = x[0].num; |
193 | 0 | for (int i = 0; i < 4; i++) |
194 | 0 | x[i] = Q((val >> shift[i]) & mask[i]); |
195 | 0 | return; |
196 | 0 | } |
197 | 0 | case SWS_OP_PACK: { |
198 | 0 | av_assert1(ff_sws_pixel_type_is_int(op->type)); |
199 | 0 | ff_sws_pack_op_decode(op, mask, shift); |
200 | 0 | unsigned val = 0; |
201 | 0 | for (int i = 0; i < 4; i++) |
202 | 0 | val |= (x[i].num & mask[i]) << shift[i]; |
203 | 0 | x[0] = Q(val); |
204 | 0 | return; |
205 | 0 | } |
206 | 0 | case SWS_OP_SWAP_BYTES: |
207 | 0 | av_assert1(ff_sws_pixel_type_is_int(op->type)); |
208 | 0 | switch (ff_sws_pixel_type_size(op->type)) { |
209 | 0 | case 2: |
210 | 0 | for (int i = 0; i < 4; i++) |
211 | 0 | x[i].num = av_bswap16(x[i].num); |
212 | 0 | break; |
213 | 0 | case 4: |
214 | 0 | for (int i = 0; i < 4; i++) |
215 | 0 | x[i].num = av_bswap32(x[i].num); |
216 | 0 | break; |
217 | 0 | } |
218 | 0 | return; |
219 | 0 | case SWS_OP_CLEAR: |
220 | 0 | for (int i = 0; i < 4; i++) { |
221 | 0 | if (SWS_COMP_TEST(op->clear.mask, i)) |
222 | 0 | x[i] = op->clear.value[i]; |
223 | 0 | } |
224 | 0 | return; |
225 | 0 | case SWS_OP_LSHIFT: { |
226 | 0 | av_assert1(ff_sws_pixel_type_is_int(op->type)); |
227 | 0 | AVRational mult = Q(1 << op->shift.amount); |
228 | 0 | for (int i = 0; i < 4; i++) |
229 | 0 | x[i] = x[i].den ? av_mul_q(x[i], mult) : x[i]; |
230 | 0 | return; |
231 | 0 | } |
232 | 0 | case SWS_OP_RSHIFT: { |
233 | 0 | av_assert1(ff_sws_pixel_type_is_int(op->type)); |
234 | 0 | for (int i = 0; i < 4; i++) |
235 | 0 | x[i] = x[i].den ? Q((x[i].num / x[i].den) >> op->shift.amount) : x[i]; |
236 | 0 | return; |
237 | 0 | } |
238 | 0 | case SWS_OP_SWIZZLE: { |
239 | 0 | const AVRational orig[4] = { x[0], x[1], x[2], x[3] }; |
240 | 0 | for (int i = 0; i < 4; i++) |
241 | 0 | x[i] = orig[op->swizzle.in[i]]; |
242 | 0 | return; |
243 | 0 | } |
244 | 0 | case SWS_OP_CONVERT: |
245 | 0 | if (ff_sws_pixel_type_is_int(op->convert.to)) { |
246 | 0 | const AVRational scale = ff_sws_pixel_expand(op->type, op->convert.to); |
247 | 0 | for (int i = 0; i < 4; i++) { |
248 | 0 | x[i] = x[i].den ? Q(x[i].num / x[i].den) : x[i]; |
249 | 0 | if (op->convert.expand) |
250 | 0 | x[i] = av_mul_q(x[i], scale); |
251 | 0 | } |
252 | 0 | } |
253 | 0 | return; |
254 | 0 | case SWS_OP_DITHER: |
255 | 0 | av_assert1(!ff_sws_pixel_type_is_int(op->type)); |
256 | 0 | for (int i = 0; i < 4; i++) { |
257 | 0 | if (op->dither.y_offset[i] >= 0 && x[i].den) |
258 | 0 | x[i] = av_add_q(x[i], av_make_q(1, 2)); |
259 | 0 | } |
260 | 0 | return; |
261 | 0 | case SWS_OP_MIN: |
262 | 0 | for (int i = 0; i < 4; i++) |
263 | 0 | x[i] = av_min_q(x[i], op->clamp.limit[i]); |
264 | 0 | return; |
265 | 0 | case SWS_OP_MAX: |
266 | 0 | for (int i = 0; i < 4; i++) |
267 | 0 | x[i] = av_max_q(x[i], op->clamp.limit[i]); |
268 | 0 | return; |
269 | 0 | case SWS_OP_LINEAR: { |
270 | 0 | av_assert1(!ff_sws_pixel_type_is_int(op->type)); |
271 | 0 | const AVRational orig[4] = { x[0], x[1], x[2], x[3] }; |
272 | 0 | for (int i = 0; i < 4; i++) { |
273 | 0 | AVRational sum = op->lin.m[i][4]; |
274 | 0 | for (int j = 0; j < 4; j++) |
275 | 0 | sum = av_add_q(sum, av_mul_q(orig[j], op->lin.m[i][j])); |
276 | 0 | x[i] = sum; |
277 | 0 | } |
278 | 0 | return; |
279 | 0 | } |
280 | 0 | case SWS_OP_SCALE: |
281 | 0 | for (int i = 0; i < 4; i++) |
282 | 0 | x[i] = x[i].den ? av_mul_q(x[i], op->scale.factor) : x[i]; |
283 | 0 | return; |
284 | 0 | case SWS_OP_FILTER_H: |
285 | 0 | case SWS_OP_FILTER_V: |
286 | | /* Filters have normalized energy by definition, so they don't |
287 | | * conceptually modify individual components */ |
288 | 0 | return; |
289 | 0 | } |
290 | | |
291 | 0 | av_unreachable("Invalid operation type!"); |
292 | 0 | } |
293 | | |
294 | | /* merge_comp_flags() forms a monoid with SWS_COMP_IDENTITY as the null element */ |
295 | | enum { |
296 | | SWS_COMP_IDENTITY = SWS_COMP_ZERO | SWS_COMP_EXACT, |
297 | | }; |
298 | | |
299 | | static SwsCompFlags merge_comp_flags(SwsCompFlags a, SwsCompFlags b) |
300 | 0 | { |
301 | 0 | const SwsCompFlags flags_or = SWS_COMP_GARBAGE; |
302 | 0 | const SwsCompFlags flags_and = SWS_COMP_IDENTITY; |
303 | 0 | return ((a & b) & flags_and) | ((a | b) & flags_or); |
304 | 0 | } |
305 | | |
306 | | /* Linearly propagate flags per component */ |
307 | | static void propagate_flags(SwsOp *op, const SwsComps *prev) |
308 | 0 | { |
309 | 0 | for (int i = 0; i < 4; i++) |
310 | 0 | op->comps.flags[i] = prev->flags[i]; |
311 | 0 | } |
312 | | |
313 | | /* Clear undefined values in dst with src */ |
314 | | static void clear_undefined_values(AVRational dst[4], const AVRational src[4]) |
315 | 0 | { |
316 | 0 | for (int i = 0; i < 4; i++) { |
317 | 0 | if (dst[i].den == 0) |
318 | 0 | dst[i] = src[i]; |
319 | 0 | } |
320 | 0 | } |
321 | | |
322 | | static void apply_filter_weights(SwsComps *comps, const SwsComps *prev, |
323 | | const SwsFilterWeights *weights) |
324 | 0 | { |
325 | 0 | const AVRational posw = { weights->sum_positive, SWS_FILTER_SCALE }; |
326 | 0 | const AVRational negw = { weights->sum_negative, SWS_FILTER_SCALE }; |
327 | 0 | for (int i = 0; i < 4; i++) { |
328 | 0 | comps->flags[i] = prev->flags[i]; |
329 | | /* Only point sampling preserves exactness */ |
330 | 0 | if (weights->filter_size != 1) |
331 | 0 | comps->flags[i] &= ~SWS_COMP_EXACT; |
332 | | /* Update min/max assuming extremes */ |
333 | 0 | comps->min[i] = av_add_q(av_mul_q(prev->min[i], posw), |
334 | 0 | av_mul_q(prev->max[i], negw)); |
335 | 0 | comps->max[i] = av_add_q(av_mul_q(prev->min[i], negw), |
336 | 0 | av_mul_q(prev->max[i], posw)); |
337 | 0 | } |
338 | 0 | } |
339 | | |
340 | | /* Infer + propagate known information about components */ |
341 | | void ff_sws_op_list_update_comps(SwsOpList *ops) |
342 | 0 | { |
343 | 0 | SwsComps prev = { .flags = { |
344 | 0 | SWS_COMP_GARBAGE, SWS_COMP_GARBAGE, SWS_COMP_GARBAGE, SWS_COMP_GARBAGE, |
345 | 0 | }}; |
346 | | |
347 | | /* Forwards pass, propagates knowledge about the incoming pixel values */ |
348 | 0 | for (int n = 0; n < ops->num_ops; n++) { |
349 | 0 | SwsOp *op = &ops->ops[n]; |
350 | |
|
351 | 0 | switch (op->op) { |
352 | 0 | case SWS_OP_READ: |
353 | 0 | case SWS_OP_LINEAR: |
354 | 0 | case SWS_OP_DITHER: |
355 | 0 | case SWS_OP_SWAP_BYTES: |
356 | 0 | case SWS_OP_UNPACK: |
357 | 0 | case SWS_OP_FILTER_H: |
358 | 0 | case SWS_OP_FILTER_V: |
359 | 0 | break; /* special cases, handled below */ |
360 | 0 | default: |
361 | 0 | memcpy(op->comps.min, prev.min, sizeof(prev.min)); |
362 | 0 | memcpy(op->comps.max, prev.max, sizeof(prev.max)); |
363 | 0 | ff_sws_apply_op_q(op, op->comps.min); |
364 | 0 | ff_sws_apply_op_q(op, op->comps.max); |
365 | 0 | break; |
366 | 0 | } |
367 | | |
368 | 0 | switch (op->op) { |
369 | 0 | case SWS_OP_READ: |
370 | | /* Active components are taken from the user-provided values, |
371 | | * other components are explicitly stripped */ |
372 | 0 | for (int i = 0; i < op->rw.elems; i++) { |
373 | 0 | const int idx = op->rw.packed ? i : ops->plane_src[i]; |
374 | 0 | av_assert0(!(ops->comps_src.flags[idx] & SWS_COMP_GARBAGE)); |
375 | 0 | op->comps.flags[i] = ops->comps_src.flags[idx]; |
376 | 0 | op->comps.min[i] = ops->comps_src.min[idx]; |
377 | 0 | op->comps.max[i] = ops->comps_src.max[idx]; |
378 | 0 | } |
379 | 0 | for (int i = op->rw.elems; i < 4; i++) { |
380 | 0 | op->comps.flags[i] = prev.flags[i]; |
381 | 0 | op->comps.min[i] = prev.min[i]; |
382 | 0 | op->comps.max[i] = prev.max[i]; |
383 | 0 | } |
384 | |
|
385 | 0 | if (op->rw.filter) { |
386 | 0 | const SwsComps prev = op->comps; |
387 | 0 | apply_filter_weights(&op->comps, &prev, op->rw.kernel); |
388 | 0 | } |
389 | 0 | break; |
390 | 0 | case SWS_OP_SWAP_BYTES: |
391 | 0 | for (int i = 0; i < 4; i++) { |
392 | 0 | op->comps.flags[i] = prev.flags[i] ^ SWS_COMP_SWAPPED; |
393 | 0 | op->comps.min[i] = prev.min[i]; |
394 | 0 | op->comps.max[i] = prev.max[i]; |
395 | 0 | } |
396 | 0 | break; |
397 | 0 | case SWS_OP_WRITE: |
398 | 0 | for (int i = 0; i < op->rw.elems; i++) |
399 | 0 | av_assert1(!(prev.flags[i] & SWS_COMP_GARBAGE)); |
400 | 0 | av_fallthrough; |
401 | 0 | case SWS_OP_LSHIFT: |
402 | 0 | case SWS_OP_RSHIFT: |
403 | 0 | propagate_flags(op, &prev); |
404 | 0 | break; |
405 | 0 | case SWS_OP_MIN: |
406 | 0 | propagate_flags(op, &prev); |
407 | 0 | clear_undefined_values(op->comps.max, op->clamp.limit); |
408 | 0 | break; |
409 | 0 | case SWS_OP_MAX: |
410 | 0 | propagate_flags(op, &prev); |
411 | 0 | clear_undefined_values(op->comps.min, op->clamp.limit); |
412 | 0 | break; |
413 | 0 | case SWS_OP_DITHER: |
414 | 0 | for (int i = 0; i < 4; i++) { |
415 | 0 | op->comps.min[i] = prev.min[i]; |
416 | 0 | op->comps.max[i] = prev.max[i]; |
417 | 0 | if (op->dither.y_offset[i] < 0) |
418 | 0 | continue; |
419 | | /* Strip zero flag because of the nonzero dithering offset */ |
420 | 0 | op->comps.flags[i] = prev.flags[i] & ~SWS_COMP_ZERO; |
421 | 0 | op->comps.min[i] = av_add_q(op->comps.min[i], op->dither.min); |
422 | 0 | op->comps.max[i] = av_add_q(op->comps.max[i], op->dither.max); |
423 | 0 | } |
424 | 0 | break; |
425 | 0 | case SWS_OP_UNPACK: |
426 | 0 | for (int i = 0; i < 4; i++) { |
427 | 0 | const int pattern = op->pack.pattern[i]; |
428 | 0 | if (pattern) { |
429 | 0 | av_assert1(pattern < 32); |
430 | 0 | op->comps.flags[i] = prev.flags[0]; |
431 | 0 | op->comps.min[i] = Q(0); |
432 | 0 | op->comps.max[i] = Q((1ULL << pattern) - 1); |
433 | 0 | } else |
434 | 0 | op->comps.flags[i] = SWS_COMP_GARBAGE; |
435 | 0 | } |
436 | 0 | break; |
437 | 0 | case SWS_OP_PACK: { |
438 | 0 | SwsCompFlags flags = SWS_COMP_IDENTITY; |
439 | 0 | for (int i = 0; i < 4; i++) { |
440 | 0 | if (op->pack.pattern[i]) |
441 | 0 | flags = merge_comp_flags(flags, prev.flags[i]); |
442 | 0 | if (i > 0) /* clear remaining comps for sanity */ |
443 | 0 | op->comps.flags[i] = SWS_COMP_GARBAGE; |
444 | 0 | } |
445 | 0 | op->comps.flags[0] = flags; |
446 | 0 | break; |
447 | 0 | } |
448 | 0 | case SWS_OP_CLEAR: |
449 | 0 | for (int i = 0; i < 4; i++) { |
450 | 0 | if (SWS_COMP_TEST(op->clear.mask, i)) { |
451 | 0 | op->comps.flags[i] = 0; |
452 | 0 | if (op->clear.value[i].num == 0) |
453 | 0 | op->comps.flags[i] |= SWS_COMP_ZERO; |
454 | 0 | if (op->clear.value[i].den == 1) |
455 | 0 | op->comps.flags[i] |= SWS_COMP_EXACT; |
456 | 0 | } else { |
457 | 0 | op->comps.flags[i] = prev.flags[i]; |
458 | 0 | } |
459 | 0 | } |
460 | 0 | break; |
461 | 0 | case SWS_OP_SWIZZLE: |
462 | 0 | for (int i = 0; i < 4; i++) |
463 | 0 | op->comps.flags[i] = prev.flags[op->swizzle.in[i]]; |
464 | 0 | break; |
465 | 0 | case SWS_OP_CONVERT: |
466 | 0 | for (int i = 0; i < 4; i++) { |
467 | 0 | op->comps.flags[i] = prev.flags[i]; |
468 | 0 | if (ff_sws_pixel_type_is_int(op->convert.to)) |
469 | 0 | op->comps.flags[i] |= SWS_COMP_EXACT; |
470 | 0 | } |
471 | 0 | break; |
472 | 0 | case SWS_OP_LINEAR: |
473 | 0 | for (int i = 0; i < 4; i++) { |
474 | 0 | SwsCompFlags flags = SWS_COMP_IDENTITY; |
475 | 0 | AVRational min = Q(0), max = Q(0); |
476 | 0 | for (int j = 0; j < 4; j++) { |
477 | 0 | const AVRational k = op->lin.m[i][j]; |
478 | 0 | AVRational mink = av_mul_q(prev.min[j], k); |
479 | 0 | AVRational maxk = av_mul_q(prev.max[j], k); |
480 | 0 | if (k.num) { |
481 | 0 | flags = merge_comp_flags(flags, prev.flags[j]); |
482 | 0 | if (k.den != 1) /* fractional coefficient */ |
483 | 0 | flags &= ~SWS_COMP_EXACT; |
484 | 0 | if (k.num < 0) |
485 | 0 | FFSWAP(AVRational, mink, maxk); |
486 | 0 | min = av_add_q(min, mink); |
487 | 0 | max = av_add_q(max, maxk); |
488 | 0 | } |
489 | 0 | } |
490 | 0 | if (op->lin.m[i][4].num) { /* nonzero offset */ |
491 | 0 | flags &= ~SWS_COMP_ZERO; |
492 | 0 | if (op->lin.m[i][4].den != 1) /* fractional offset */ |
493 | 0 | flags &= ~SWS_COMP_EXACT; |
494 | 0 | min = av_add_q(min, op->lin.m[i][4]); |
495 | 0 | max = av_add_q(max, op->lin.m[i][4]); |
496 | 0 | } |
497 | 0 | op->comps.flags[i] = flags; |
498 | 0 | op->comps.min[i] = min; |
499 | 0 | op->comps.max[i] = max; |
500 | 0 | } |
501 | 0 | break; |
502 | 0 | case SWS_OP_SCALE: |
503 | 0 | for (int i = 0; i < 4; i++) { |
504 | 0 | op->comps.flags[i] = prev.flags[i]; |
505 | 0 | if (op->scale.factor.den != 1) /* fractional scale */ |
506 | 0 | op->comps.flags[i] &= ~SWS_COMP_EXACT; |
507 | 0 | if (op->scale.factor.num < 0) |
508 | 0 | FFSWAP(AVRational, op->comps.min[i], op->comps.max[i]); |
509 | 0 | } |
510 | 0 | break; |
511 | 0 | case SWS_OP_FILTER_H: |
512 | 0 | case SWS_OP_FILTER_V: { |
513 | 0 | apply_filter_weights(&op->comps, &prev, op->filter.kernel); |
514 | 0 | break; |
515 | 0 | } |
516 | | |
517 | 0 | case SWS_OP_INVALID: |
518 | 0 | case SWS_OP_TYPE_NB: |
519 | 0 | av_unreachable("Invalid operation type!"); |
520 | 0 | } |
521 | | |
522 | 0 | prev = op->comps; |
523 | 0 | } |
524 | | |
525 | | /* Backwards pass, solves for component dependencies */ |
526 | 0 | bool need_out[4] = { false, false, false, false }; |
527 | 0 | for (int n = ops->num_ops - 1; n >= 0; n--) { |
528 | 0 | SwsOp *op = &ops->ops[n]; |
529 | 0 | bool need_in[4] = { false, false, false, false }; |
530 | |
|
531 | 0 | for (int i = 0; i < 4; i++) { |
532 | 0 | if (!need_out[i]) |
533 | 0 | op->comps.flags[i] = SWS_COMP_GARBAGE; |
534 | 0 | } |
535 | |
|
536 | 0 | switch (op->op) { |
537 | 0 | case SWS_OP_READ: |
538 | 0 | case SWS_OP_WRITE: |
539 | 0 | for (int i = 0; i < op->rw.elems; i++) |
540 | 0 | need_in[i] = op->op == SWS_OP_WRITE; |
541 | 0 | for (int i = op->rw.elems; i < 4; i++) |
542 | 0 | need_in[i] = need_out[i]; |
543 | 0 | break; |
544 | 0 | case SWS_OP_SWAP_BYTES: |
545 | 0 | case SWS_OP_LSHIFT: |
546 | 0 | case SWS_OP_RSHIFT: |
547 | 0 | case SWS_OP_CONVERT: |
548 | 0 | case SWS_OP_DITHER: |
549 | 0 | case SWS_OP_MIN: |
550 | 0 | case SWS_OP_MAX: |
551 | 0 | case SWS_OP_SCALE: |
552 | 0 | case SWS_OP_FILTER_H: |
553 | 0 | case SWS_OP_FILTER_V: |
554 | 0 | for (int i = 0; i < 4; i++) |
555 | 0 | need_in[i] = need_out[i]; |
556 | 0 | break; |
557 | 0 | case SWS_OP_UNPACK: |
558 | 0 | for (int i = 0; i < 4 && op->pack.pattern[i]; i++) |
559 | 0 | need_in[0] |= need_out[i]; |
560 | 0 | break; |
561 | 0 | case SWS_OP_PACK: |
562 | 0 | for (int i = 0; i < 4 && op->pack.pattern[i]; i++) |
563 | 0 | need_in[i] = need_out[0]; |
564 | 0 | break; |
565 | 0 | case SWS_OP_CLEAR: |
566 | 0 | for (int i = 0; i < 4; i++) { |
567 | 0 | if (!SWS_COMP_TEST(op->clear.mask, i)) |
568 | 0 | need_in[i] = need_out[i]; |
569 | 0 | } |
570 | 0 | break; |
571 | 0 | case SWS_OP_SWIZZLE: |
572 | 0 | for (int i = 0; i < 4; i++) |
573 | 0 | need_in[op->swizzle.in[i]] |= need_out[i]; |
574 | 0 | break; |
575 | 0 | case SWS_OP_LINEAR: |
576 | 0 | for (int i = 0; i < 4; i++) { |
577 | 0 | for (int j = 0; j < 4; j++) { |
578 | 0 | if (op->lin.m[i][j].num) |
579 | 0 | need_in[j] |= need_out[i]; |
580 | 0 | } |
581 | 0 | } |
582 | 0 | break; |
583 | 0 | } |
584 | | |
585 | 0 | memcpy(need_out, need_in, sizeof(need_in)); |
586 | 0 | } |
587 | 0 | } |
588 | | |
589 | | static void op_uninit(SwsOp *op) |
590 | 0 | { |
591 | 0 | switch (op->op) { |
592 | 0 | case SWS_OP_READ: |
593 | 0 | av_refstruct_unref(&op->rw.kernel); |
594 | 0 | break; |
595 | 0 | case SWS_OP_DITHER: |
596 | 0 | av_refstruct_unref(&op->dither.matrix); |
597 | 0 | break; |
598 | 0 | case SWS_OP_FILTER_H: |
599 | 0 | case SWS_OP_FILTER_V: |
600 | 0 | av_refstruct_unref(&op->filter.kernel); |
601 | 0 | break; |
602 | 0 | } |
603 | | |
604 | 0 | *op = (SwsOp) {0}; |
605 | 0 | } |
606 | | |
607 | | SwsOpList *ff_sws_op_list_alloc(void) |
608 | 0 | { |
609 | 0 | SwsOpList *ops = av_mallocz(sizeof(SwsOpList)); |
610 | 0 | if (!ops) |
611 | 0 | return NULL; |
612 | | |
613 | 0 | for (int i = 0; i < 4; i++) |
614 | 0 | ops->plane_src[i] = ops->plane_dst[i] = i; |
615 | 0 | ff_fmt_clear(&ops->src); |
616 | 0 | ff_fmt_clear(&ops->dst); |
617 | 0 | return ops; |
618 | 0 | } |
619 | | |
620 | | void ff_sws_op_list_free(SwsOpList **p_ops) |
621 | 0 | { |
622 | 0 | SwsOpList *ops = *p_ops; |
623 | 0 | if (!ops) |
624 | 0 | return; |
625 | | |
626 | 0 | for (int i = 0; i < ops->num_ops; i++) |
627 | 0 | op_uninit(&ops->ops[i]); |
628 | |
|
629 | 0 | av_freep(&ops->ops); |
630 | 0 | av_free(ops); |
631 | 0 | *p_ops = NULL; |
632 | 0 | } |
633 | | |
634 | | SwsOpList *ff_sws_op_list_duplicate(const SwsOpList *ops) |
635 | 0 | { |
636 | 0 | SwsOpList *copy = av_malloc(sizeof(*copy)); |
637 | 0 | if (!copy) |
638 | 0 | return NULL; |
639 | | |
640 | 0 | int num = ops->num_ops; |
641 | 0 | if (num) |
642 | 0 | num = 1 << av_ceil_log2(num); |
643 | |
|
644 | 0 | *copy = *ops; |
645 | 0 | copy->ops = av_memdup(ops->ops, num * sizeof(ops->ops[0])); |
646 | 0 | if (!copy->ops) { |
647 | 0 | av_free(copy); |
648 | 0 | return NULL; |
649 | 0 | } |
650 | | |
651 | 0 | for (int i = 0; i < copy->num_ops; i++) { |
652 | 0 | const SwsOp *op = ©->ops[i]; |
653 | 0 | switch (op->op) { |
654 | 0 | case SWS_OP_READ: |
655 | 0 | if (op->rw.kernel) |
656 | 0 | av_refstruct_ref(op->rw.kernel); |
657 | 0 | break; |
658 | 0 | case SWS_OP_DITHER: |
659 | 0 | av_refstruct_ref(op->dither.matrix); |
660 | 0 | break; |
661 | 0 | case SWS_OP_FILTER_H: |
662 | 0 | case SWS_OP_FILTER_V: |
663 | 0 | av_refstruct_ref(op->filter.kernel); |
664 | 0 | break; |
665 | 0 | } |
666 | 0 | } |
667 | | |
668 | 0 | return copy; |
669 | 0 | } |
670 | | |
671 | | const SwsOp *ff_sws_op_list_input(const SwsOpList *ops) |
672 | 0 | { |
673 | 0 | if (!ops->num_ops) |
674 | 0 | return NULL; |
675 | | |
676 | 0 | const SwsOp *read = &ops->ops[0]; |
677 | 0 | return read->op == SWS_OP_READ ? read : NULL; |
678 | 0 | } |
679 | | |
680 | | const SwsOp *ff_sws_op_list_output(const SwsOpList *ops) |
681 | 0 | { |
682 | 0 | if (!ops->num_ops) |
683 | 0 | return NULL; |
684 | | |
685 | 0 | const SwsOp *write = &ops->ops[ops->num_ops - 1]; |
686 | 0 | return write->op == SWS_OP_WRITE ? write : NULL; |
687 | 0 | } |
688 | | |
689 | | void ff_sws_op_list_remove_at(SwsOpList *ops, int index, int count) |
690 | 0 | { |
691 | 0 | const int end = ops->num_ops - count; |
692 | 0 | av_assert2(index >= 0 && count >= 0 && index + count <= ops->num_ops); |
693 | 0 | for (int i = 0; i < count; i++) |
694 | 0 | op_uninit(&ops->ops[index + i]); |
695 | 0 | for (int i = index; i < end; i++) |
696 | 0 | ops->ops[i] = ops->ops[i + count]; |
697 | 0 | ops->num_ops = end; |
698 | 0 | } |
699 | | |
700 | | int ff_sws_op_list_insert_at(SwsOpList *ops, int index, SwsOp *op) |
701 | 0 | { |
702 | 0 | void *ret = av_dynarray2_add((void **) &ops->ops, &ops->num_ops, sizeof(*op), NULL); |
703 | 0 | if (!ret) { |
704 | 0 | op_uninit(op); |
705 | 0 | return AVERROR(ENOMEM); |
706 | 0 | } |
707 | | |
708 | 0 | for (int i = ops->num_ops - 1; i > index; i--) |
709 | 0 | ops->ops[i] = ops->ops[i - 1]; |
710 | 0 | ops->ops[index] = *op; |
711 | 0 | return 0; |
712 | 0 | } |
713 | | |
714 | | int ff_sws_op_list_append(SwsOpList *ops, SwsOp *op) |
715 | 0 | { |
716 | 0 | return ff_sws_op_list_insert_at(ops, ops->num_ops, op); |
717 | 0 | } |
718 | | |
719 | | bool ff_sws_op_list_is_noop(const SwsOpList *ops) |
720 | 0 | { |
721 | 0 | if (!ops->num_ops) |
722 | 0 | return true; |
723 | | |
724 | 0 | const SwsOp *read = ff_sws_op_list_input(ops); |
725 | 0 | const SwsOp *write = ff_sws_op_list_output(ops); |
726 | 0 | if (!read || !write || ops->num_ops > 2 || |
727 | 0 | read->type != write->type || |
728 | 0 | read->rw.packed != write->rw.packed || |
729 | 0 | read->rw.elems != write->rw.elems || |
730 | 0 | read->rw.frac != write->rw.frac) |
731 | 0 | return false; |
732 | | |
733 | | /** |
734 | | * Note that this check is unlikely to ever be hit in practice, since it |
735 | | * would imply the existence of planar formats with different plane orders |
736 | | * between them, e.g. rgbap <-> gbrap, which doesn't currently exist. |
737 | | * However, the check is cheap and lets me sleep at night. |
738 | | */ |
739 | 0 | const int num_planes = read->rw.packed ? 1 : read->rw.elems; |
740 | 0 | for (int i = 0; i < num_planes; i++) { |
741 | 0 | if (ops->plane_src[i] != ops->plane_dst[i]) |
742 | 0 | return false; |
743 | 0 | } |
744 | | |
745 | 0 | return true; |
746 | 0 | } |
747 | | |
748 | | int ff_sws_op_list_max_size(const SwsOpList *ops) |
749 | 0 | { |
750 | 0 | int max_size = 0; |
751 | 0 | for (int i = 0; i < ops->num_ops; i++) { |
752 | 0 | const int size = ff_sws_pixel_type_size(ops->ops[i].type); |
753 | 0 | max_size = FFMAX(max_size, size); |
754 | 0 | } |
755 | |
|
756 | 0 | return max_size; |
757 | 0 | } |
758 | | |
759 | | uint32_t ff_sws_linear_mask(const SwsLinearOp c) |
760 | 0 | { |
761 | 0 | uint32_t mask = 0; |
762 | 0 | for (int i = 0; i < 4; i++) { |
763 | 0 | for (int j = 0; j < 5; j++) { |
764 | 0 | if (av_cmp_q(c.m[i][j], Q(i == j))) |
765 | 0 | mask |= SWS_MASK(i, j); |
766 | 0 | } |
767 | 0 | } |
768 | 0 | return mask; |
769 | 0 | } |
770 | | |
771 | | static const char *describe_lin_mask(uint32_t mask) |
772 | 0 | { |
773 | | /* Try to be fairly descriptive without assuming too much */ |
774 | 0 | static const struct { |
775 | 0 | char name[24]; |
776 | 0 | uint32_t mask; |
777 | 0 | } patterns[] = { |
778 | 0 | { "noop", 0 }, |
779 | 0 | { "luma", SWS_MASK_LUMA }, |
780 | 0 | { "alpha", SWS_MASK_ALPHA }, |
781 | 0 | { "luma+alpha", SWS_MASK_LUMA | SWS_MASK_ALPHA }, |
782 | 0 | { "dot3", 0x7 }, |
783 | 0 | { "dot4", 0xF }, |
784 | 0 | { "row0", SWS_MASK_ROW(0) }, |
785 | 0 | { "row0+alpha", SWS_MASK_ROW(0) | SWS_MASK_ALPHA }, |
786 | 0 | { "col0", SWS_MASK_COL(0) }, |
787 | 0 | { "col0+off3", SWS_MASK_COL(0) | SWS_MASK_OFF3 }, |
788 | 0 | { "off3", SWS_MASK_OFF3 }, |
789 | 0 | { "off3+alpha", SWS_MASK_OFF3 | SWS_MASK_ALPHA }, |
790 | 0 | { "diag3", SWS_MASK_DIAG3 }, |
791 | 0 | { "diag4", SWS_MASK_DIAG4 }, |
792 | 0 | { "diag3+alpha", SWS_MASK_DIAG3 | SWS_MASK_ALPHA }, |
793 | 0 | { "diag3+off3", SWS_MASK_DIAG3 | SWS_MASK_OFF3 }, |
794 | 0 | { "diag3+off3+alpha", SWS_MASK_DIAG3 | SWS_MASK_OFF3 | SWS_MASK_ALPHA }, |
795 | 0 | { "diag4+off4", SWS_MASK_DIAG4 | SWS_MASK_OFF4 }, |
796 | 0 | { "matrix3", SWS_MASK_MAT3 }, |
797 | 0 | { "matrix3+off3", SWS_MASK_MAT3 | SWS_MASK_OFF3 }, |
798 | 0 | { "matrix3+off3+alpha", SWS_MASK_MAT3 | SWS_MASK_OFF3 | SWS_MASK_ALPHA }, |
799 | 0 | { "matrix4", SWS_MASK_MAT4 }, |
800 | 0 | { "matrix4+off4", SWS_MASK_MAT4 | SWS_MASK_OFF4 }, |
801 | 0 | }; |
802 | |
|
803 | 0 | for (int i = 0; i < FF_ARRAY_ELEMS(patterns); i++) { |
804 | 0 | if (!(mask & ~patterns[i].mask)) |
805 | 0 | return patterns[i].name; |
806 | 0 | } |
807 | | |
808 | 0 | av_unreachable("Invalid linear mask!"); |
809 | 0 | return "ERR"; |
810 | 0 | } |
811 | | |
812 | | static char describe_comp_flags(SwsCompFlags flags) |
813 | 0 | { |
814 | 0 | if (flags & SWS_COMP_GARBAGE) |
815 | 0 | return 'X'; |
816 | 0 | else if (flags & SWS_COMP_ZERO) |
817 | 0 | return '0'; |
818 | 0 | else if (flags & SWS_COMP_SWAPPED) |
819 | 0 | return 'z'; |
820 | 0 | else if (flags & SWS_COMP_EXACT) |
821 | 0 | return '+'; |
822 | 0 | else |
823 | 0 | return '.'; |
824 | 0 | } |
825 | | |
826 | | static void print_q(AVBPrint *bp, const AVRational q) |
827 | 0 | { |
828 | 0 | if (!q.den) { |
829 | 0 | av_bprintf(bp, "%s", q.num > 0 ? "inf" : q.num < 0 ? "-inf" : "nan"); |
830 | 0 | } else if (q.den == 1) { |
831 | 0 | av_bprintf(bp, "%d", q.num); |
832 | 0 | } else if (abs(q.num) > 1000 || abs(q.den) > 1000) { |
833 | 0 | av_bprintf(bp, "%f", av_q2d(q)); |
834 | 0 | } else { |
835 | 0 | av_bprintf(bp, "%d/%d", q.num, q.den); |
836 | 0 | } |
837 | 0 | } |
838 | | |
839 | | static void print_q4(AVBPrint *bp, const AVRational q4[4], SwsCompMask mask) |
840 | 0 | { |
841 | 0 | av_bprintf(bp, "{"); |
842 | 0 | for (int i = 0; i < 4; i++) { |
843 | 0 | if (i) |
844 | 0 | av_bprintf(bp, " "); |
845 | 0 | if (!SWS_COMP_TEST(mask, i)) { |
846 | 0 | av_bprintf(bp, "_"); |
847 | 0 | } else { |
848 | 0 | print_q(bp, q4[i]); |
849 | 0 | } |
850 | 0 | } |
851 | 0 | av_bprintf(bp, "}"); |
852 | 0 | } |
853 | | |
854 | | void ff_sws_op_desc(AVBPrint *bp, const SwsOp *op) |
855 | 0 | { |
856 | 0 | const char *name = ff_sws_op_type_name(op->op); |
857 | 0 | const SwsCompMask mask = ff_sws_comp_mask_needed(op); |
858 | |
|
859 | 0 | switch (op->op) { |
860 | 0 | case SWS_OP_INVALID: |
861 | 0 | case SWS_OP_SWAP_BYTES: |
862 | 0 | av_bprintf(bp, "%s", name); |
863 | 0 | break; |
864 | 0 | case SWS_OP_READ: |
865 | 0 | case SWS_OP_WRITE: |
866 | 0 | av_bprintf(bp, "%-20s: %d elem(s) %s >> %d", name, |
867 | 0 | op->rw.elems, op->rw.packed ? "packed" : "planar", |
868 | 0 | op->rw.frac); |
869 | 0 | if (!op->rw.filter) |
870 | 0 | break; |
871 | 0 | const SwsFilterWeights *kernel = op->rw.kernel; |
872 | 0 | av_bprintf(bp, " + %d tap %s filter (%c)", |
873 | 0 | kernel->filter_size, kernel->name, |
874 | 0 | op->rw.filter == SWS_OP_FILTER_H ? 'H' : 'V'); |
875 | 0 | break; |
876 | 0 | case SWS_OP_LSHIFT: |
877 | 0 | av_bprintf(bp, "%-20s: << %u", name, op->shift.amount); |
878 | 0 | break; |
879 | 0 | case SWS_OP_RSHIFT: |
880 | 0 | av_bprintf(bp, "%-20s: >> %u", name, op->shift.amount); |
881 | 0 | break; |
882 | 0 | case SWS_OP_PACK: |
883 | 0 | case SWS_OP_UNPACK: |
884 | 0 | av_bprintf(bp, "%-20s: {%d %d %d %d}", name, |
885 | 0 | op->pack.pattern[0], op->pack.pattern[1], |
886 | 0 | op->pack.pattern[2], op->pack.pattern[3]); |
887 | 0 | break; |
888 | 0 | case SWS_OP_CLEAR: |
889 | 0 | av_bprintf(bp, "%-20s: ", name); |
890 | 0 | print_q4(bp, op->clear.value, mask & op->clear.mask); |
891 | 0 | break; |
892 | 0 | case SWS_OP_SWIZZLE: |
893 | 0 | av_bprintf(bp, "%-20s: %d%d%d%d", name, |
894 | 0 | op->swizzle.x, op->swizzle.y, op->swizzle.z, op->swizzle.w); |
895 | 0 | break; |
896 | 0 | case SWS_OP_CONVERT: |
897 | 0 | av_bprintf(bp, "%-20s: %s -> %s%s", name, |
898 | 0 | ff_sws_pixel_type_name(op->type), |
899 | 0 | ff_sws_pixel_type_name(op->convert.to), |
900 | 0 | op->convert.expand ? " (expand)" : ""); |
901 | 0 | break; |
902 | 0 | case SWS_OP_DITHER: |
903 | 0 | av_bprintf(bp, "%-20s: %dx%d matrix + {%d %d %d %d}", name, |
904 | 0 | 1 << op->dither.size_log2, 1 << op->dither.size_log2, |
905 | 0 | op->dither.y_offset[0], op->dither.y_offset[1], |
906 | 0 | op->dither.y_offset[2], op->dither.y_offset[3]); |
907 | 0 | break; |
908 | 0 | case SWS_OP_MIN: |
909 | 0 | av_bprintf(bp, "%-20s: x <= ", name); |
910 | 0 | print_q4(bp, op->clamp.limit, mask & ff_sws_comp_mask_q4(op->clamp.limit)); |
911 | 0 | break; |
912 | 0 | case SWS_OP_MAX: |
913 | 0 | av_bprintf(bp, "%-20s: ", name); |
914 | 0 | print_q4(bp, op->clamp.limit, mask & ff_sws_comp_mask_q4(op->clamp.limit)); |
915 | 0 | av_bprintf(bp, " <= x"); |
916 | 0 | break; |
917 | 0 | case SWS_OP_LINEAR: |
918 | 0 | av_bprintf(bp, "%-20s: %s [", name, describe_lin_mask(op->lin.mask)); |
919 | 0 | for (int i = 0; i < 4; i++) { |
920 | 0 | av_bprintf(bp, "%s[", i ? " " : ""); |
921 | 0 | for (int j = 0; j < 5; j++) { |
922 | 0 | av_bprintf(bp, j ? " " : ""); |
923 | 0 | print_q(bp, op->lin.m[i][j]); |
924 | 0 | } |
925 | 0 | av_bprintf(bp, "]"); |
926 | 0 | } |
927 | 0 | av_bprintf(bp, "]"); |
928 | 0 | break; |
929 | 0 | case SWS_OP_SCALE: |
930 | 0 | av_bprintf(bp, "%-20s: * %d", name, op->scale.factor.num); |
931 | 0 | if (op->scale.factor.den != 1) |
932 | 0 | av_bprintf(bp, "/%d", op->scale.factor.den); |
933 | 0 | break; |
934 | 0 | case SWS_OP_FILTER_H: |
935 | 0 | case SWS_OP_FILTER_V: { |
936 | 0 | const SwsFilterWeights *kernel = op->filter.kernel; |
937 | 0 | av_bprintf(bp, "%-20s: %d -> %d %s (%d taps)", name, |
938 | 0 | kernel->src_size, kernel->dst_size, |
939 | 0 | kernel->name, kernel->filter_size); |
940 | 0 | break; |
941 | 0 | } |
942 | 0 | case SWS_OP_TYPE_NB: |
943 | 0 | break; |
944 | 0 | } |
945 | 0 | } |
946 | | |
947 | | static void desc_plane_order(AVBPrint *bp, int nb_planes, const uint8_t *order) |
948 | 0 | { |
949 | 0 | bool inorder = true; |
950 | 0 | for (int i = 0; i < nb_planes; i++) |
951 | 0 | inorder &= order[i] == i; |
952 | 0 | if (inorder) |
953 | 0 | return; |
954 | | |
955 | 0 | av_bprintf(bp, ", via {"); |
956 | 0 | for (int i = 0; i < nb_planes; i++) |
957 | 0 | av_bprintf(bp, "%s%d", i ? ", " : "", order[i]); |
958 | 0 | av_bprintf(bp, "}"); |
959 | 0 | } |
960 | | |
961 | | void ff_sws_op_list_print(void *log, int lev, int lev_extra, |
962 | | const SwsOpList *ops) |
963 | 0 | { |
964 | 0 | AVBPrint bp; |
965 | 0 | if (!ops->num_ops) { |
966 | 0 | av_log(log, lev, " (empty)\n"); |
967 | 0 | return; |
968 | 0 | } |
969 | | |
970 | 0 | av_bprint_init(&bp, 0, AV_BPRINT_SIZE_AUTOMATIC); |
971 | |
|
972 | 0 | for (int i = 0; i < ops->num_ops; i++) { |
973 | 0 | const SwsOp *op = &ops->ops[i]; |
974 | 0 | const SwsCompMask mask = ff_sws_comp_mask_needed(op); |
975 | 0 | av_bprint_clear(&bp); |
976 | 0 | av_bprintf(&bp, " [%3s %c%c%c%c] ", |
977 | 0 | ff_sws_pixel_type_name(op->type), |
978 | 0 | describe_comp_flags(op->comps.flags[0]), |
979 | 0 | describe_comp_flags(op->comps.flags[1]), |
980 | 0 | describe_comp_flags(op->comps.flags[2]), |
981 | 0 | describe_comp_flags(op->comps.flags[3])); |
982 | |
|
983 | 0 | ff_sws_op_desc(&bp, op); |
984 | |
|
985 | 0 | if (op->op == SWS_OP_READ || op->op == SWS_OP_WRITE) { |
986 | 0 | const int planes = op->rw.packed ? 1 : op->rw.elems; |
987 | 0 | desc_plane_order(&bp, planes, |
988 | 0 | op->op == SWS_OP_READ ? ops->plane_src : ops->plane_dst); |
989 | 0 | } |
990 | |
|
991 | 0 | av_assert0(av_bprint_is_complete(&bp)); |
992 | 0 | av_log(log, lev, "%s\n", bp.str); |
993 | | |
994 | | /* Only print value ranges if any are relevant */ |
995 | 0 | SwsCompMask range_mask = ff_sws_comp_mask_q4(op->comps.min) | |
996 | 0 | ff_sws_comp_mask_q4(op->comps.max); |
997 | 0 | if (range_mask & mask) { |
998 | 0 | av_bprint_clear(&bp); |
999 | 0 | av_bprintf(&bp, " min: "); |
1000 | 0 | print_q4(&bp, op->comps.min, mask); |
1001 | 0 | av_bprintf(&bp, ", max: "); |
1002 | 0 | print_q4(&bp, op->comps.max, mask); |
1003 | 0 | av_assert0(av_bprint_is_complete(&bp)); |
1004 | 0 | av_log(log, lev_extra, "%s\n", bp.str); |
1005 | 0 | } |
1006 | |
|
1007 | 0 | } |
1008 | | |
1009 | 0 | av_log(log, lev, " (X = unused, z = byteswapped, + = exact, 0 = zero)\n"); |
1010 | 0 | } |
1011 | | |
1012 | | static int enum_ops_fmt(SwsContext *ctx, void *opaque, |
1013 | | enum AVPixelFormat src_fmt, enum AVPixelFormat dst_fmt, |
1014 | | int (*cb)(SwsContext *ctx, void *opaque, SwsOpList *ops)) |
1015 | 0 | { |
1016 | 0 | int ret; |
1017 | 0 | const SwsPixelType type = SWS_PIXEL_F32; |
1018 | 0 | SwsOpList *ops = ff_sws_op_list_alloc(); |
1019 | 0 | if (!ops) |
1020 | 0 | return AVERROR(ENOMEM); |
1021 | | |
1022 | 0 | ff_fmt_from_pixfmt(src_fmt, &ops->src); |
1023 | 0 | ff_fmt_from_pixfmt(dst_fmt, &ops->dst); |
1024 | 0 | ops->src.width = ops->dst.width = 16; |
1025 | 0 | ops->src.height = ops->dst.height = 16; |
1026 | |
|
1027 | 0 | bool incomplete = ff_infer_colors(&ops->src.color, &ops->dst.color); |
1028 | 0 | if (ff_sws_decode_pixfmt(ops, src_fmt) < 0 || |
1029 | 0 | ff_sws_decode_colors(ctx, type, ops, &ops->src, &incomplete) < 0 || |
1030 | 0 | ff_sws_encode_colors(ctx, type, ops, &ops->src, &ops->dst, &incomplete) < 0 || |
1031 | 0 | ff_sws_encode_pixfmt(ops, dst_fmt) < 0) |
1032 | 0 | { |
1033 | 0 | ret = 0; /* silently skip unsupported formats */ |
1034 | 0 | goto fail; |
1035 | 0 | } |
1036 | | |
1037 | 0 | ret = ff_sws_op_list_optimize(ops); |
1038 | 0 | if (ret < 0) |
1039 | 0 | goto fail; |
1040 | | |
1041 | 0 | ret = cb(ctx, opaque, ops); |
1042 | 0 | if (ret < 0) |
1043 | 0 | goto fail; |
1044 | | |
1045 | 0 | fail: |
1046 | 0 | ff_sws_op_list_free(&ops); |
1047 | 0 | return ret; |
1048 | 0 | } |
1049 | | |
1050 | | int ff_sws_enum_op_lists(SwsContext *ctx, void *opaque, |
1051 | | enum AVPixelFormat src_fmt, enum AVPixelFormat dst_fmt, |
1052 | | int (*cb)(SwsContext *ctx, void *opaque, SwsOpList *ops)) |
1053 | 0 | { |
1054 | 0 | const AVPixFmtDescriptor *src_start = av_pix_fmt_desc_next(NULL); |
1055 | 0 | const AVPixFmtDescriptor *dst_start = src_start; |
1056 | 0 | if (src_fmt != AV_PIX_FMT_NONE) |
1057 | 0 | src_start = av_pix_fmt_desc_get(src_fmt); |
1058 | 0 | if (dst_fmt != AV_PIX_FMT_NONE) |
1059 | 0 | dst_start = av_pix_fmt_desc_get(dst_fmt); |
1060 | |
|
1061 | 0 | const AVPixFmtDescriptor *src, *dst; |
1062 | 0 | for (src = src_start; src; src = av_pix_fmt_desc_next(src)) { |
1063 | 0 | const enum AVPixelFormat src_f = av_pix_fmt_desc_get_id(src); |
1064 | 0 | for (dst = dst_start; dst; dst = av_pix_fmt_desc_next(dst)) { |
1065 | 0 | const enum AVPixelFormat dst_f = av_pix_fmt_desc_get_id(dst); |
1066 | 0 | int ret = enum_ops_fmt(ctx, opaque, src_f, dst_f, cb); |
1067 | 0 | if (ret < 0) |
1068 | 0 | return ret; |
1069 | 0 | if (dst_fmt != AV_PIX_FMT_NONE) |
1070 | 0 | break; |
1071 | 0 | } |
1072 | 0 | if (src_fmt != AV_PIX_FMT_NONE) |
1073 | 0 | break; |
1074 | 0 | } |
1075 | | |
1076 | 0 | return 0; |
1077 | 0 | } |
1078 | | |
1079 | | struct EnumOpaque { |
1080 | | void *opaque; |
1081 | | int (*cb)(SwsContext *ctx, void *opaque, SwsOp *op); |
1082 | | }; |
1083 | | |
1084 | | static int enum_ops(SwsContext *ctx, void *opaque, SwsOpList *ops) |
1085 | 0 | { |
1086 | 0 | struct EnumOpaque *priv = opaque; |
1087 | 0 | for (int i = 0; i < ops->num_ops; i++) { |
1088 | 0 | int ret = priv->cb(ctx, priv->opaque, &ops->ops[i]); |
1089 | 0 | if (ret < 0) |
1090 | 0 | return ret; |
1091 | 0 | } |
1092 | 0 | return 0; |
1093 | 0 | } |
1094 | | |
1095 | | int ff_sws_enum_ops(SwsContext *ctx, void *opaque, |
1096 | | enum AVPixelFormat src_fmt, enum AVPixelFormat dst_fmt, |
1097 | | int (*cb)(SwsContext *ctx, void *opaque, SwsOp *op)) |
1098 | 0 | { |
1099 | 0 | struct EnumOpaque priv = { opaque, cb }; |
1100 | 0 | return ff_sws_enum_op_lists(ctx, &priv, src_fmt, dst_fmt, enum_ops); |
1101 | 0 | } |