Go to the documentation of this file.
38 #if HAVE_SPIRV_HEADERS_SPIRV_H || HAVE_SPIRV_UNIFIED1_SPIRV_H
44 #if ARCH_AARCH64 && HAVE_NEON
46 #elif ARCH_X86_64 && HAVE_X86ASM
50 #if HAVE_SPIRV_HEADERS_SPIRV_H || HAVE_SPIRV_UNIFIED1_SPIRV_H
134 for (
int i = 0;
i < 4;
i++) {
145 for (
int i = 0;
i < 4;
i++) {
146 const int src = swiz->
in[
i];
157 for (
int i = 0;
i < 4;
i++) {
167 switch (
op->rw.mode) {
201 for (
int i = 0;
i < 4;
i++)
209 for (
int i = 0;
i < 4;
i++)
217 for (
int i = 0;
i < 4;
i++) {
223 for (
int i = 0;
i < 4;
i++) {
232 for (
int i = 0;
i < 4;
i++) {
234 x[
i] =
op->clear.value[
i];
240 for (
int i = 0;
i < 4;
i++)
246 for (
int i = 0;
i < 4;
i++)
247 x[
i] = x[
i].den ?
Q((x[
i].num / x[
i].den) >>
op->shift.amount) : x[
i];
251 const AVRational64 orig[4] = { x[0], x[1], x[2], x[3] };
252 for (
int i = 0;
i < 4;
i++)
253 x[
i] = orig[
op->swizzle.in[
i]];
259 for (
int i = 0;
i < 4;
i++) {
260 x[
i] = x[
i].
den ?
Q(x[
i].num / x[
i].den) : x[
i];
261 if (
op->convert.expand)
268 for (
int i = 0;
i < 4;
i++) {
269 if (
op->dither.y_offset[
i] >= 0 && x[
i].
den)
274 for (
int i = 0;
i < 4;
i++)
278 for (
int i = 0;
i < 4;
i++)
283 const AVRational64 orig[4] = { x[0], x[1], x[2], x[3] };
284 for (
int i = 0;
i < 4;
i++) {
286 for (
int j = 0; j < 4; j++)
293 for (
int i = 0;
i < 4;
i++)
318 return ((
a &
b) & flags_and) | ((
a |
b) & flags_or);
326 for (
int i = 0;
i < 4;
i++) {
347 for (
int n = 0; n < ops->
num_ops; n++) {
359 memcpy(
op->comps.min, prev.
min,
sizeof(prev.
min));
360 memcpy(
op->comps.max, prev.
max,
sizeof(prev.
max));
370 for (
int i = 0;
i <
op->rw.elems;
i++) {
372 switch (
op->rw.mode) {
394 if (
op->rw.filter.op) {
400 for (
int i = 0;
i < 4;
i++) {
402 op->comps.min[
i] = prev.
min[
i];
403 op->comps.max[
i] = prev.
max[
i];
407 for (
int i = 0;
i <
op->rw.elems;
i++)
409 for (
int i = 0;
i < 4;
i++)
414 for (
int i = 0;
i < 4;
i++)
420 for (
int i = 0;
i < 4;
i++) {
422 if (
op->clamp.limit[
i].den)
430 for (
int i = 0;
i < 4;
i++) {
432 op->comps.min[
i] = prev.
min[
i];
433 op->comps.max[
i] = prev.
max[
i];
434 if (
op->dither.y_offset[
i] < 0)
443 for (
int i = 0;
i < 4;
i++) {
444 const int pattern =
op->pack.pattern[
i];
448 op->comps.min[
i] =
Q(0);
449 op->comps.max[
i] =
Q((1ULL << pattern) - 1);
456 for (
int i = 0;
i < 4;
i++) {
457 if (
op->pack.pattern[
i])
466 for (
int i = 0;
i < 4;
i++) {
469 if (
op->clear.value[
i].num == 0)
471 if (
op->clear.value[
i].den == 1)
479 for (
int i = 0;
i < 4;
i++)
480 op->comps.flags[
i] = prev.
flags[
op->swizzle.in[
i]];
483 for (
int i = 0;
i < 4;
i++) {
492 for (
int i = 0;
i < 4;
i++) {
496 for (
int j = 0; j < 4; j++) {
513 if (
op->lin.m[
i][4].num) {
515 if (
op->lin.m[
i][4].den != 1)
526 for (
int i = 0;
i < 4;
i++) {
528 if (
op->scale.factor.den != 1)
530 if (
op->scale.factor.num < 0)
549 bool need_out[4] = {
false,
false,
false,
false };
550 for (
int n = ops->num_ops - 1; n >= 0; n--) {
552 bool need_in[4] = {
false,
false,
false,
false };
554 for (
int i = 0;
i < 4;
i++) {
562 for (
int i = 0;
i <
op->rw.elems;
i++)
564 for (
int i =
op->rw.elems;
i < 4;
i++)
565 need_in[
i] = need_out[
i];
577 for (
int i = 0;
i < 4;
i++)
578 need_in[
i] = need_out[
i];
581 for (
int i = 0;
i < 4 &&
op->pack.pattern[
i];
i++)
582 need_in[0] |= need_out[
i];
585 for (
int i = 0;
i < 4 &&
op->pack.pattern[
i];
i++)
586 need_in[
i] = need_out[0];
589 for (
int i = 0;
i < 4;
i++) {
591 need_in[
i] = need_out[
i];
595 for (
int i = 0;
i < 4;
i++)
596 need_in[
op->swizzle.in[
i]] |= need_out[
i];
599 for (
int i = 0;
i < 4;
i++) {
600 for (
int j = 0; j < 4; j++) {
601 if (
op->lin.m[
i][j].num)
602 need_in[j] |= need_out[
i];
608 memcpy(need_out, need_in,
sizeof(need_in));
636 for (
int i = 0;
i < 4;
i++)
674 for (
int i = 0;
i <
copy->num_ops;
i++) {
678 if (
op->rw.filter.kernel)
714 const int end = ops->
num_ops - count;
716 for (
int i = 0;
i < count;
i++)
764 for (
int i = 0;
i < num_planes;
i++) {
786 for (
int i = 0;
i < 4;
i++) {
787 for (
int j = 0; j < 5; j++) {
817 }
else if (q.
den == 1) {
819 }
else if (q.
num > 1000 || q.
num < -1000 || q.
den > 1000 || q.
den < -1000) {
829 for (
int i = 0;
i < 4;
i++) {
862 if (!
op->rw.filter.op)
878 op->pack.pattern[0],
op->pack.pattern[1],
879 op->pack.pattern[2],
op->pack.pattern[3]);
887 op->swizzle.x,
op->swizzle.y,
op->swizzle.z,
op->swizzle.w);
893 op->convert.expand ?
" (expand)" :
"");
897 1 <<
op->dither.size_log2, 1 <<
op->dither.size_log2,
898 op->dither.y_offset[0],
op->dither.y_offset[1],
899 op->dither.y_offset[2],
op->dither.y_offset[3]);
912 for (
int i = 0;
i < 4;
i++) {
914 for (
int j = 0; j < 5; j++) {
924 if (
op->scale.factor.den != 1)
943 for (
int i = 0;
i < nb_planes;
i++)
944 inorder &= order[
i] ==
i;
949 for (
int i = 0;
i < nb_planes;
i++)
990 if (range_mask &
mask) {
1002 av_log(
log,
lev,
" ('X' unused, 'z' byteswapped, '=' copied, '$' const, '+' integer, '0' zero)\n");
void ff_sws_op_list_free(SwsOpList **p_ops)
int ff_sws_rw_op_planes(const SwsOp *op)
Return the number of planes involved in a read/write operation.
it s the only field you need to keep assuming you have a context There is some magic you don t need to care about around this just let it vf default minimum maximum flags name is the option name
SwsOpList * ff_sws_op_list_alloc(void)
static int av_bprint_is_complete(const AVBPrint *buf)
Test if the print buffer is complete (not truncated).
Filter the word “frame” indicates either a video frame or a group of audio as stored in an AVFrame structure Format for each input and each output the list of supported formats For video that means pixel format For audio that means channel sample they are references to shared objects When the negotiation mechanism computes the intersection of the formats supported at each end of a all references to both lists are replaced with a reference to the intersection And when a single format is eventually chosen for a link amongst the remaining all references to the list are updated That means that if a filter requires that its input and output have the same format amongst a supported all it has to do is use a reference to the same list of formats query_formats can leave some formats unset and return AVERROR(EAGAIN) to cause the negotiation mechanism toagain later. That can be used by filters with complex requirements to use the format negotiated on one link to set the formats supported on another. Frame references ownership and permissions
int filter_size
The number of source texels to convolve over for each row.
SwsOpList * ff_sws_op_list_duplicate(const SwsOpList *ops)
Returns a duplicate of ops, or NULL on OOM.
@ SWS_RW_PLANAR
Note: 1-component reads are either SWS_RW_PLANAR or SWS_RW_PACKED, depending on the underlying interp...
static void apply_filter_weights(SwsComps *comps, const SwsComps *prev, const SwsFilterWeights *weights)
static const char *const rw_mode_names[]
void av_bprint_init(AVBPrint *buf, unsigned size_init, unsigned size_max)
SwsComps comps_src
Source component metadata associated with pixel values from each corresponding component (in plane/me...
static SwsCompFlags merge_comp_flags(SwsCompFlags a, SwsCompFlags b)
const SwsOp * ff_sws_op_list_input(const SwsOpList *ops)
Returns the input operation for a given op list, or NULL if there is none (e.g.
int ff_sws_op_list_max_size(const SwsOpList *ops)
Returns the size of the largest pixel type used in ops.
const SwsOpBackend backend_x86
int ff_sws_op_list_append(SwsOpList *ops, SwsOp *op)
These will take over ownership of op and set it to {0}, even on failure.
SwsCompMask ff_sws_comp_mask_q4(const AVRational64 q[4])
Represents a computed filter kernel.
static char describe_comp_flags(SwsCompFlags flags)
void * av_dynarray2_add(void **tab_ptr, int *nb_ptr, size_t elem_size, const uint8_t *elem_data)
Add an element of size elem_size to a dynamic array.
static void desc_plane_order(AVBPrint *bp, int nb_planes, const uint8_t *order)
static AVRational64 av_min_q64(AVRational64 a, AVRational64 b)
int ff_sws_pixel_type_size(SwsPixelType type)
SwsCompMask ff_sws_comp_mask_needed(const SwsOp *op)
void * av_memdup(const void *p, size_t size)
Duplicate a buffer with av_malloc().
void ff_sws_op_list_print(void *log, int lev, int lev_extra, const SwsOpList *ops)
Print out the contents of an operation list.
static void print_q4(AVBPrint *bp, const AVRational64 q4[4], SwsCompMask mask)
#define SWS_COMP_TEST(mask, X)
const SwsOpBackend *const ff_sws_op_backends[]
static void print_q(AVBPrint *bp, const AVRational64 q)
#define AV_BPRINT_SIZE_AUTOMATIC
bool ff_sws_pixel_type_is_int(SwsPixelType type)
static double val(void *priv, double ch)
it s the only field you need to keep assuming you have a context There is some magic you don t need to care about around this just let it vf type
static int16_t mult(Float11 *f1, Float11 *f2)
trying all byte sequences megabyte in length and selecting the best looking sequence will yield cases to try But first
const SwsOpBackend backend_aarch64
#define SWS_OP_NEEDED(op, idx)
struct SwsReadWriteOp::@581 filter
Filter kernel to apply to each plane while sampling.
#define flags(name, subs,...)
static const struct @604 planes[]
static AVRational64 ff_sws_pixel_expand(SwsPixelType from, SwsPixelType to)
static int op(uint8_t **dst, const uint8_t *dst_end, GetByteContext *gb, int pixel, int count, int *x, int width, int linesize)
Perform decode operation.
const SwsOpBackend backend_c
Copyright (C) 2025 Niklas Haas.
#define av_assert0(cond)
assert() equivalent, that is always enabled.
int av_cmp_q64(AVRational64 a, AVRational64 b)
Compare two 64-bit rationals.
uint8_t SwsCompMask
Bit-mask of components.
const SwsOp * ff_sws_op_list_output(const SwsOpList *ops)
Returns the output operation for a given op list, or NULL if there is none.
AVRational64 av_mul_q64(AVRational64 b, AVRational64 c)
Multiply two 64-bit rationals.
bool ff_sws_op_list_is_noop(const SwsOpList *ops)
Returns whether an op list represents a true no-op operation, i.e.
#define av_unreachable(msg)
Asserts that are used as compiler optimization hints depending upon ASSERT_LEVEL and NBDEBUG.
SwsOpType
Copyright (C) 2025 Niklas Haas.
void ff_sws_op_list_remove_at(SwsOpList *ops, int index, int count)
void ff_sws_apply_op_q(const SwsOp *op, AVRational64 x[4])
Apply an operation to an AVRational64.
int src_size
Copy of the parameters used to generate this filter, for reference.
Undefined Behavior In the C some operations are like signed integer dereferencing freed accessing outside allocated Undefined Behavior must not occur in a C it is not safe even if the output of undefined operations is unused The unsafety may seem nit picking but Optimizing compilers have in fact optimized code on the assumption that no undefined Behavior occurs Optimizing code based on wrong assumptions can and has in some cases lead to effects beyond the output of computations The signed integer overflow problem in speed critical code Code which is highly optimized and works with signed integers sometimes has the problem that often the output of the computation does not c
void ff_sws_comp_mask_swizzle(SwsCompMask *mask, const SwsSwizzleOp *swiz)
static void copy(const float *p1, float *p2, const int length)
static int shift(int a, int b)
#define i(width, name, range_min, range_max)
int ff_sws_op_list_insert_at(SwsOpList *ops, int index, SwsOp *op)
uint32_t ff_sws_linear_mask(const SwsLinearOp *c)
void ff_sws_op_list_update_comps(SwsOpList *ops)
Infer + propagate known information about components.
64-bit Rational number (pair of numerator and denominator).
void * av_refstruct_ref(void *obj)
Create a new reference to an object managed via this API, i.e.
The reader does not expect b to be semantically here and if the code is changed by maybe adding a a division or other the signedness will almost certainly be mistaken To avoid this confusion a new type was SUINT is the C unsigned type but it holds a signed int to use the same example SUINT a
static void op_uninit(SwsOp *op)
char name[16]
Extra metadata about the filter, used to inform the optimizer / range tracker about the filter's beha...
void ff_sws_op_desc(AVBPrint *bp, const SwsOp *op)
Describe an operation in human-readable form.
void av_refstruct_unref(void *objp)
Decrement the reference count of the underlying object and automatically free the object if there are...
#define av_assert2(cond)
assert() equivalent, that does lie in speed critical code.
static const int weights[]
#define av_assert1(cond)
assert() equivalent, that does not lie in speed critical code.
static LevelCodes lev[4+3+3]
static double bound(const double threshold, const double val)
const SwsOpBackend backend_murder
#define FFSWAP(type, a, b)
void av_bprintf(AVBPrint *buf, const char *fmt,...)
static double av_q2d_64(AVRational64 a)
Convert an AVRational64 to a double.
static AVRational64 av_make_q64(int64_t num, int64_t den)
Create an AVRational64.
const char * ff_sws_pixel_type_name(SwsPixelType type)
static AVRational64 av_max_q64(AVRational64 a, AVRational64 b)
void av_bprint_clear(AVBPrint *buf)
Reset the string to "" but keep internal allocated data.
static void scale(int *out, const int *in, const int w, const int h, const int shift)
static void ff_sws_pack_op_decode(const SwsOp *op, uint64_t mask[4], int shift[4])
SwsReadWriteMode mode
Examples: rgba = 4x u8 packed yuv444p = 3x u8 rgb565 = 1x u16 <- use SWS_OP_UNPACK to unpack monow = ...
Helper struct for representing a list of operations.
const char * ff_sws_op_type_name(SwsOpType op)
@ SWS_FILTER_SCALE
14-bit coefficients are picked to fit comfortably within int16_t for efficient SIMD processing (e....
static uint32_t BS_FUNC() read(BSCTX *bc, unsigned int n)
Return n bits from the buffer, n has to be in the 0-32 range.
AVRational64 av_add_q64(AVRational64 b, AVRational64 c)
Add two 64-bit rationals.