Go to the documentation of this file.
45 if ((ret = (x)) < 0) \
134 for (
int i = 0;
i < 4;
i++)
141 for (
int i = 0;
i < 4;
i++)
149 for (
int i = 0;
i < 4;
i++)
153 for (
int i = 0;
i < 4;
i++)
159 for (
int i = 0;
i < 4;
i++) {
166 for (
int i = 0;
i < 4;
i++)
172 for (
int i = 0;
i < 4;
i++)
177 const AVRational orig[4] = { x[0], x[1], x[2], x[3] };
178 for (
int i = 0;
i < 4;
i++)
179 x[
i] = orig[
op->swizzle.in[
i]];
185 for (
int i = 0;
i < 4;
i++) {
186 x[
i] = x[
i].
den ?
Q(x[
i].num / x[
i].den) : x[
i];
187 if (
op->convert.expand)
193 for (
int i = 0;
i < 4;
i++)
197 for (
int i = 0;
i < 4;
i++)
201 for (
int i = 0;
i < 4;
i++)
205 const AVRational orig[4] = { x[0], x[1], x[2], x[3] };
206 for (
int i = 0;
i < 4;
i++) {
208 for (
int j = 0; j < 4; j++)
215 for (
int i = 0;
i < 4;
i++)
290 const int end = ops->
num_ops - count;
331 for (
int i = 0;
i < 4;
i++) {
332 for (
int j = 0; j < 5; j++) {
343 static const struct {
374 return patterns[
i].
name;
396 return q.
num > 0 ?
"inf" : q.
num < 0 ?
"-inf" :
"nan";
397 }
else if (q.
den == 1) {
409 #define PRINTQ(q) print_q(q, (char[32]){0}, sizeof(char[32]) - 1)
422 op->comps.unused[0] ?
'X' :
'.',
423 op->comps.unused[1] ?
'X' :
'.',
424 op->comps.unused[2] ?
'X' :
'.',
425 op->comps.unused[3] ?
'X' :
'.',
440 op->rw.elems,
op->rw.packed ?
"packed" :
"planar",
457 op->pack.pattern[0],
op->pack.pattern[1],
458 op->pack.pattern[2],
op->pack.pattern[3]);
461 av_log(
log,
lev,
"%-20s: {%s %s %s %s}\n",
"SWS_OP_CLEAR",
469 op->swizzle.x,
op->swizzle.y,
op->swizzle.z,
op->swizzle.w);
472 av_log(
log,
lev,
"%-20s: %s -> %s%s\n",
"SWS_OP_CONVERT",
475 op->convert.expand ?
" (expand)" :
"");
478 av_log(
log,
lev,
"%-20s: %dx%d matrix\n",
"SWS_OP_DITHER",
479 1 <<
op->dither.size_log2, 1 <<
op->dither.size_log2);
482 av_log(
log,
lev,
"%-20s: x <= {%s %s %s %s}\n",
"SWS_OP_MIN",
489 av_log(
log,
lev,
"%-20s: {%s %s %s %s} <= x\n",
"SWS_OP_MAX",
499 "[%s %s %s %s %s]]\n",
514 if (
op->comps.min[0].den ||
op->comps.min[1].den ||
515 op->comps.min[2].den ||
op->comps.min[3].den ||
516 op->comps.max[0].den ||
op->comps.max[1].den ||
517 op->comps.max[2].den ||
op->comps.max[3].den)
519 av_log(
log,
AV_LOG_TRACE,
" min: {%s, %s, %s, %s}, max: {%s, %s, %s, %s}\n",
528 av_log(
log,
lev,
" (X = unused, + = exact, 0 = zero)\n");
552 av_log(
ctx, msg_lev,
"Backend '%s' failed to compile operations: %s\n",
555 av_log(
ctx, msg_lev,
"Uncompiled remainder:\n");
574 "block size = %d, over-read = %d, over-write = %d, cpu flags = 0x%x\n",
575 backend->
name,
out->block_size,
out->over_read,
out->over_write,
585 typedef struct SwsOpPass {
601 static void op_pass_free(
void *ptr)
608 p->comp.free(p->comp.priv);
618 SwsOpPass *p = pass->
priv;
621 const int block_size =
comp->block_size;
622 p->num_blocks = (pass->
width + block_size - 1) / block_size;
625 const int aligned_w = p->num_blocks * block_size;
626 const int safe_width = (p->num_blocks - 1) * block_size;
627 const int tail_size = pass->
width - safe_width;
628 p->tail_off_in = safe_width * p->pixel_bits_in >> 3;
629 p->tail_off_out = safe_width * p->pixel_bits_out >> 3;
630 p->tail_size_in = tail_size * p->pixel_bits_in >> 3;
631 p->tail_size_out = tail_size * p->pixel_bits_out >> 3;
632 p->memcpy_in =
false;
633 p->memcpy_out =
false;
635 for (
int i = 0;
i < p->planes_in;
i++) {
637 const int plane_w = (aligned_w + sub_x) >> sub_x;
638 const int plane_pad = (
comp->over_read + sub_x) >> sub_x;
639 const int plane_size = plane_w * p->pixel_bits_in >> 3;
640 p->memcpy_in |= plane_size + plane_pad > in->
linesize[
i];
644 for (
int i = 0;
i < p->planes_out;
i++) {
646 const int plane_w = (aligned_w + sub_x) >> sub_x;
647 const int plane_pad = (
comp->over_write + sub_x) >> sub_x;
648 const int plane_size = plane_w * p->pixel_bits_out >> 3;
649 p->memcpy_out |= plane_size + plane_pad >
out->linesize[
i];
656 const int blocks_main = p->num_blocks - p->memcpy_out;
657 for (
int i = 0;
i < 4;
i++) {
665 handle_tail(
const SwsOpPass *p,
SwsOpExec *exec,
666 const SwsImg *out_base,
const bool copy_out,
667 const SwsImg *in_base,
const bool copy_in,
673 const int tail_size_in = p->tail_size_in;
674 const int tail_size_out = p->tail_size_out;
675 const int bx = p->num_blocks - 1;
679 for (
int i = 0;
i < p->planes_in;
i++) {
680 in.
data[
i] += p->tail_off_in;
682 exec->
in[
i] = (
void *)
tmp[0][
i];
689 for (
int i = 0;
i < p->planes_out;
i++) {
690 out.data[
i] += p->tail_off_out;
699 for (
int y_end = y +
h; y < y_end; y++) {
701 for (
int i = 0;
i < p->planes_in;
i++) {
703 memcpy(
tmp[0][
i], in.
data[
i], tail_size_in);
708 comp->func(exec,
comp->priv, bx, y, p->num_blocks, y + 1);
711 for (
int i = 0;
i < p->planes_out;
i++) {
713 memcpy(
out.data[
i],
tmp[1][
i], tail_size_out);
718 for (
int i = 0;
i < 4;
i++) {
727 static void op_pass_run(
const SwsImg *out_base,
const SwsImg *in_base,
728 const int y,
const int h,
const SwsPass *pass)
730 const SwsOpPass *p = pass->
priv;
739 for (
int i = 0;
i < 4;
i++) {
761 const int last_slice = y +
h == pass->
height;
762 const bool memcpy_in = last_slice && p->memcpy_in;
763 const bool memcpy_out = p->memcpy_out;
764 const int num_blocks = p->num_blocks;
765 const int blocks_main = num_blocks - memcpy_out;
766 const int h_main =
h - memcpy_in;
769 comp->func(&exec,
comp->priv, 0, y, blocks_main, y + h_main);
773 for (
int i = 0;
i < 4;
i++) {
775 exec.
out[
i] += h_main *
out.linesize[
i];
777 comp->func(&exec,
comp->priv, 0, y + h_main, num_blocks - 1, y +
h);
782 handle_tail(p, &exec, out_base,
true, in_base,
false, y, h_main);
784 handle_tail(p, &exec, out_base, memcpy_out, in_base,
true, y + h_main, 1);
787 static int rw_planes(
const SwsOp *
op)
789 return op->rw.packed ? 1 :
op->rw.elems;
794 const int elems =
op->rw.packed ?
op->rw.elems : 1;
796 const int bits = 8 >>
op->rw.frac;
818 "and write, respectively.\n");
835 p->planes_in = rw_planes(
read);
836 p->planes_out = rw_planes(write);
841 .height =
dst.height,
842 .block_size_in = p->comp.block_size * p->pixel_bits_in >> 3,
843 .block_size_out = p->comp.block_size * p->pixel_bits_out >> 3,
852 pass->
setup = op_pass_setup;
853 pass->
free = op_pass_free;
void ff_sws_op_list_free(SwsOpList **p_ops)
#define AV_LOG_WARNING
Something somehow does not look correct.
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
Represents a single filter pass in the scaling graph.
SwsOpList * ff_sws_op_list_alloc(void)
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
SwsOpList * ff_sws_op_list_duplicate(const SwsOpList *ops)
Returns a duplicate of ops, or NULL on OOM.
static AVRational av_min_q(AVRational a, AVRational b)
static void comp(unsigned char *dst, ptrdiff_t dst_stride, unsigned char *src, ptrdiff_t src_stride, int add)
const AVPixFmtDescriptor * av_pix_fmt_desc_get(enum AVPixelFormat pix_fmt)
uint32_t ff_sws_linear_mask(const SwsLinearOp c)
AVRational av_div_q(AVRational b, AVRational c)
Divide one rational by another.
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
filter_frame For filters that do not use the this method is called when a frame is pushed to the filter s input It can be called at any time except in a reentrant way If the input frame is enough to produce output
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.
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.
#define AV_LOG_VERBOSE
Detailed information.
void(* free)(void *priv)
Optional private state and associated free() function.
Represents a view into a single field of frame data.
int ff_sws_pixel_type_size(SwsPixelType type)
static char describe_comp_flags(unsigned flags)
void * av_memdup(const void *p, size_t size)
Duplicate a buffer with av_malloc().
#define DECLARE_ALIGNED_64(t, v)
SwsPixelType
Copyright (C) 2025 Niklas Haas.
const SwsOpBackend *const ff_sws_op_backends[]
SwsPixelType ff_sws_pixel_type_to_uint(SwsPixelType type)
int(* compile)(SwsContext *ctx, SwsOpList *ops, SwsCompiledOp *out)
Compile an operation list to an implementation chain.
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
int ff_sws_ops_compile_backend(SwsContext *ctx, const SwsOpBackend *backend, const SwsOpList *ops, SwsCompiledOp *out)
Attempt to compile a list of operations using a specific backend.
static int16_t mult(Float11 *f1, Float11 *f2)
#define AV_LOG_TRACE
Extremely verbose debugging, useful for libav* development.
#define AV_LOG_ERROR
Something went wrong and cannot losslessly be recovered.
#define FF_ARRAY_ELEMS(a)
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.
static double av_q2d(AVRational a)
Convert an AVRational to a double.
const SwsOpBackend backend_c
Copyright (C) 2025 Niklas Haas.
void(* setup)(const SwsImg *out, const SwsImg *in, const SwsPass *pass)
Called once from the main thread before running the filter.
static AVRational ff_sws_pixel_expand(SwsPixelType from, SwsPixelType to)
uint8_t log2_chroma_w
Amount to shift the luma width right to find the chroma width.
Global execution context for all compiled functions.
SwsPass * ff_sws_graph_add_pass(SwsGraph *graph, enum AVPixelFormat fmt, int width, int height, SwsPass *input, int align, void *priv, sws_filter_run_t run)
Allocate and add a new pass to the filter graph.
static int rw_pixel_bits(const SwsOp *op)
Rational number (pair of numerator and denominator).
#define av_unreachable(msg)
Asserts that are used as compiler optimization hints depending upon ASSERT_LEVEL and NBDEBUG.
void ff_sws_op_list_remove_at(SwsOpList *ops, int index, int count)
static const char * print_q(const AVRational q, char buf[], int buf_len)
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_apply_op_q(const SwsOp *op, AVRational x[4])
Apply an operation to an AVRational.
static void copy(const float *p1, float *p2, const int length)
static int shift(int a, int b)
uint8_t ptrdiff_t const uint8_t ptrdiff_t int intptr_t intptr_t int int16_t * dst
#define av_err2str(errnum)
Convenience macro, the return value should be used only directly in function arguments but never stan...
int ff_sws_op_list_insert_at(SwsOpList *ops, int index, SwsOp *op)
static AVRational av_make_q(int num, int den)
Create an AVRational.
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)
and forward the test the status of outputs and forward it to the corresponding return FFERROR_NOT_READY If the filters stores internally one or a few frame for some input
void ff_sws_op_list_update_comps(SwsOpList *ops)
Infer + propagate known information about components.
void av_refstruct_unref(void *objp)
Decrement the reference count of the underlying object and automatically free the object if there are...
int ff_sws_op_list_optimize(SwsOpList *ops)
Fuse compatible and eliminate redundant operations, as well as replacing some operations with more ef...
#define av_assert2(cond)
assert() equivalent, that does lie in speed critical code.
#define i(width, name, range_min, range_max)
static AVRational av_max_q(AVRational a, AVRational b)
#define av_assert1(cond)
assert() equivalent, that does not lie in speed critical code.
#define DECLARE_ALIGNED_32(t, v)
void * av_mallocz(size_t size)
Allocate a memory block with alignment suitable for all memory accesses (including vectors if availab...
int ff_sws_ops_compile(SwsContext *ctx, const SwsOpList *ops, SwsCompiledOp *out)
Compile a list of operations using the best available backend.
static LevelCodes lev[4+3+3]
static av_const SwsImg ff_sws_img_shift(const SwsImg *base, const int y)
static int av_cmp_q(AVRational a, AVRational b)
Compare two rationals.
const SwsOpBackend backend_murder
int ff_sws_compile_pass(SwsGraph *graph, SwsOpList *ops, int flags, SwsFormat dst, SwsPass *input, SwsPass **output)
Resolves an operation list to a graph pass.
const char * ff_sws_pixel_type_name(SwsPixelType type)
AVRational av_mul_q(AVRational b, AVRational c)
Multiply two rationals.
static const char * describe_lin_mask(uint32_t mask)
Filter graph, which represents a 'baked' pixel format conversion.
Descriptor that unambiguously describes how the bits of a pixel are stored in the up to 4 data planes...
static void scale(int *out, const int *in, const int w, const int h, const int shift)
AVRational av_add_q(AVRational b, AVRational c)
Add two rationals.
static void ff_sws_pack_op_decode(const SwsOp *op, uint64_t mask[4], int shift[4])
void ff_sws_op_list_print(void *log, int lev, const SwsOpList *ops)
Print out the contents of an operation list.
Helper struct for representing a list of operations.
Main external API structure.
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.