| Line | Branch | Exec | 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 | #ifndef SWSCALE_OPS_INTERNAL_H | ||
| 22 | #define SWSCALE_OPS_INTERNAL_H | ||
| 23 | |||
| 24 | #include "libavutil/mem_internal.h" | ||
| 25 | |||
| 26 | #include "ops.h" | ||
| 27 | #include "ops_dispatch.h" | ||
| 28 | |||
| 29 | #define Q(N) ((AVRational64) { N, 1 }) | ||
| 30 | |||
| 31 | 5039948 | static inline void ff_sws_pack_op_decode(const SwsOp *op, uint64_t mask[4], int shift[4]) | |
| 32 | { | ||
| 33 | 5039948 | int size = 0; | |
| 34 |
2/2✓ Branch 0 taken 20159792 times.
✓ Branch 1 taken 5039948 times.
|
25199740 | for (int i = 0; i < 4; i++) |
| 35 | 20159792 | size += op->pack.pattern[i]; | |
| 36 |
2/2✓ Branch 0 taken 20159792 times.
✓ Branch 1 taken 5039948 times.
|
25199740 | for (int i = 0; i < 4; i++) { |
| 37 | 20159792 | const int bits = op->pack.pattern[i]; | |
| 38 | 20159792 | mask[i] = (UINT64_C(1) << bits) - 1; | |
| 39 |
2/2✓ Branch 0 taken 15119844 times.
✓ Branch 1 taken 5039948 times.
|
20159792 | shift[i] = (i ? shift[i - 1] : size) - bits; |
| 40 | } | ||
| 41 | 5039948 | } | |
| 42 | |||
| 43 | /** | ||
| 44 | * Split an op list into two at the given index. The split will be mediated | ||
| 45 | * by a set of planar read/write operations, plus a swizzle (if necessary) | ||
| 46 | * to re-order only used components. If a split is performed, both output | ||
| 47 | * lists will be optimized before returning. | ||
| 48 | * | ||
| 49 | * @param ops1 The first part of the split op list. Will be modified in-place. | ||
| 50 | * @param ops2 The second part of the split op list will be returned here, or | ||
| 51 | * NULL if no split was necessary. | ||
| 52 | * @param index The index of the operation to split before. The operation | ||
| 53 | * itself will be absent from `ops1` and instead moved to the | ||
| 54 | * start of `ops2`. | ||
| 55 | * | ||
| 56 | * Returnse 0 or a negative error code. | ||
| 57 | */ | ||
| 58 | int ff_sws_op_list_split_at(SwsOpList *ops1, SwsOpList **ops2, int index); | ||
| 59 | |||
| 60 | /** | ||
| 61 | * Reduce an op list into a reduced subset that operates only on a given | ||
| 62 | * subset of planes. No effect if the output is not planar, or if the plane | ||
| 63 | * mask is empty or equal to all planes. | ||
| 64 | * | ||
| 65 | * @param ops1 Updated in-place to contain only the selected planes. | ||
| 66 | * @param ops2 The removed remainder is returned here, or NULL if no-op. | ||
| 67 | * @param planes A mask of the plane indices to keep. | ||
| 68 | * | ||
| 69 | * Returns 0 or a negative error code. | ||
| 70 | */ | ||
| 71 | int ff_sws_op_list_split_planes(SwsOpList *ops1, SwsOpList **ops2, SwsCompMask planes); | ||
| 72 | |||
| 73 | #endif /* SWSCALE_OPS_INTERNAL_H */ | ||
| 74 |