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