Go to the documentation of this file.
49 start = bytestream2_get_le16(gb);
50 count = bytestream2_get_le16(gb);
52 if (start + count > 256)
58 for (
int i = 0;
i < count;
i++)
59 pal[start +
i] = (0xFFU << 24) | bytestream2_get_be24u(gb);
68 const int l =
frame->linesize[0];
76 for (
int y = 0; y <
frame->height; y += 2) {
77 for (
int x = 0; x <
frame->width; x += 2) {
78 int index = bytestream2_get_byteu(gb);
98 const int l =
frame->linesize[0];
111 for (
int y = 0; y <
frame->height; y += 2) {
112 for (
int x = 0; x <
frame->width; x += 2) {
113 const uint8_t *
block;
117 codes = bytestream2_get_byteu(&sb);
122 index = bytestream2_get_byte(gb);
145 const int w =
frame->width;
146 const int h =
frame->height;
147 const int l =
frame->linesize[0];
153 type = bytestream2_get_byte(gb);
160 for (
int y = 0; y <
h; y += 8) {
161 for (
int x = 0; x <
w; x += 8) {
162 int fill = bytestream2_get_byte(gb);
163 uint8_t *ddst =
dst + x;
165 for (
int by = 0; by < 8; by++) {
166 memset(ddst, fill, 8);
176 int bsize = bytestream2_get_byte(gb);
183 count = bytestream2_get_be16(gb);
186 int bsize_w, bsize_h;
188 bsize_w = bsize_h = bsize;
191 mvx = bytestream2_get_byte(gb) * bsize;
192 mvy = bytestream2_get_byte(gb) * bsize;
193 a = bytestream2_get_byte(gb);
194 b = bytestream2_get_byte(gb);
195 c = ((
a & 0x3F) << 8) +
b;
196 mx = mvx + (
c & 0x7F) - 64;
197 my = mvy + (
c >> 7) - 64;
199 if (mvy < 0 || mvy >=
h)
202 if (mvx < 0 || mvx >=
w)
205 if (my < 0 || my >=
h)
208 if (mx < 0 || mx >=
w)
211 dst =
frame->data[0] + mvx + l * mvy;
217 if (mvy >=
my && (mvy !=
my || mvx >=
mx)) {
218 src += (bsize_h - 1) * l;
219 dst += (bsize_h - 1) * l;
220 for (
int by = 0; by < bsize_h; by++) {
221 memmove(
dst,
src, bsize_w);
226 for (
int by = 0; by < bsize_h; by++) {
227 memmove(
dst,
src, bsize_w);
241 for (
int y = 0; y <
h; y++) {
248 for (
int y = 0; y <
h; y += 2) {
249 for (
int x = 0; x <
w; x += 2) {
250 int fill = bytestream2_get_byte(gb);
251 uint8_t *ddst =
dst + x;
253 fill = (fill << 8) | fill;
254 for (
int by = 0; by < 2; by++) {
265 size = bytestream2_get_le16(gb);
267 int x = bytestream2_get_byte(gb) * 4;
268 int y = bytestream2_get_byte(gb) * 4;
269 int count = bytestream2_get_byte(gb);
270 int fill = bytestream2_get_byte(gb);
273 for (
int i = 0;
i < count;
i++)
283 int count = bytestream2_get_byteu(gb);
284 int skip = count & 0x3F;
306 int bits = bytestream2_get_byte(gb);
308 for (
int i = 0;
i < 4;
i++) {
324 dst[
pos] = bytestream2_get_byte(gb);
355 const int w =
frame->width;
356 const int h =
frame->height;
357 const int l =
frame->linesize[0] / 4;
364 type = bytestream2_get_byte(gb);
371 for (
int y = 0; y + 12 <=
h; y += 12) {
372 for (
int x = 0; x + 12 <=
w; x += 12) {
373 int fill = bytestream2_get_be24(gb);
374 uint32_t *dstp =
dst + x;
376 for (
int by = 0; by < 12; by++) {
377 for (
int bx = 0; bx < 12; bx++)
389 int bsize = bytestream2_get_byte(gb);
396 count = bytestream2_get_be16(gb);
399 int bsize_w, bsize_h;
401 bsize_w = bsize_h = bsize;
404 mvx = bytestream2_get_byte(gb) * bsize;
405 mvy = bytestream2_get_byte(gb) * bsize;
406 a = bytestream2_get_byte(gb);
407 b = bytestream2_get_byte(gb);
408 c = ((
a & 0x3F) << 8) +
b;
409 mx = mvx + (
c & 0x7F) - 64;
410 my = mvy + (
c >> 7) - 64;
412 if (mvy < 0 || mvy >=
h)
415 if (mvx < 0 || mvx >=
w)
418 if (my < 0 || my >=
h)
421 if (mx < 0 || mx >=
w)
424 dst = (uint32_t *)
frame->data[0] + mvx + l * mvy;
430 if (mvy >=
my && (mvy !=
my || mvx >=
mx)) {
431 src += (bsize_h - 1) * l;
432 dst += (bsize_h - 1) * l;
433 for (
int by = 0; by < bsize_h; by++) {
434 memmove(
dst,
src, bsize_w * 4);
439 for (
int by = 0; by < bsize_h; by++) {
440 memmove(
dst,
src, bsize_w * 4);
451 osize = ((
h + 3) / 4) * ((
w + 3) / 4) + 7;
458 for (
int x = 0; x <
w; x += 4) {
459 for (
int y = 0; y <
h; y += 4) {
462 if (
bits[di >> 3] & (1 << (di & 7))) {
463 int codes = bytestream2_get_byte(gb);
465 for (
int count = 0; count < 4; count++) {
466 uint32_t *
src = (uint32_t *)
frame->data[0];
467 size_t src_size = l * (
h - 1) + (
w - 1);
468 int nv, v,
code = codes & 3;
474 bcode = bytestream2_get_byte(gb);
476 for (
int j = 0; j < 4; j++) {
494 value = bytestream2_get_byte(gb);
499 s->mv1[nv][0], 0, src_size)];
512 for (
int j = 0; j < 4; j++) {
527 v = bytestream2_get_byte(gb);
530 s->mv0[v][0], 0, src_size)];
532 dst[0] = ((v & 0x7F) << 17) | bytestream2_get_be16(gb);
563 const int w =
frame->width;
564 const int h =
frame->height;
565 const int l =
frame->linesize[0];
570 int count = bytestream2_get_byte(gb);
571 int pixel = bytestream2_get_byte(gb);
616 chunk = bytestream2_get_be32(gb);
618 case MKBETAG(
'P',
'A',
'L',
'8'):
619 for (
int y = 0; y <
frame->height; y++)
624 case MKBETAG(
'M',
'A',
'D',
'1'):
630 case MKBETAG(
'A',
'V',
'C',
'F'):
636 case MKBETAG(
'A',
'L',
'C',
'D'):
642 case MKBETAG(
'R',
'L',
'E',
'F'):
648 case MKBETAG(
'R',
'L',
'E',
'D'):
700 for (
int n = 0,
i = -4;
i < 4;
i++) {
701 for (
int j = -14; j < 2; j++) {
707 for (
int n = 0,
i = -5;
i <= 1;
i += 2) {
static av_cold int decode_close(AVCodecContext *avctx)
#define FF_CODEC_CAP_INIT_CLEANUP
The codec allows calling the close function for deallocation even if the init function returned a fai...
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
static av_always_inline void bytestream2_skipu(GetByteContext *g, unsigned int size)
void av_frame_free(AVFrame **frame)
Free the frame and any dynamically allocated objects in it, e.g.
This structure describes decoded (raw) audio or video data.
static void decode_flush(AVCodecContext *avctx)
static av_always_inline void bytestream2_skip(GetByteContext *g, unsigned int size)
uint8_t ptrdiff_t const uint8_t ptrdiff_t int intptr_t mx
AVCodec p
The public AVCodec.
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
AVFrame * av_frame_alloc(void)
Allocate an AVFrame and set its fields to default values.
#define AV_FRAME_FLAG_KEY
A flag to mark frames that are keyframes.
#define FF_CODEC_DECODE_CB(func)
#define AV_LOG_DEBUG
Stuff which is only useful for libav* developers.
#define CODEC_LONG_NAME(str)
uint8_t ptrdiff_t const uint8_t ptrdiff_t int intptr_t intptr_t my
static int decode_avcf(AVCodecContext *avctx, AVFrame *frame)
#define AVERROR_PATCHWELCOME
Not yet implemented in FFmpeg, patches welcome.
static int decode_rle(AVCodecContext *avctx, AVFrame *frame)
@ AV_PICTURE_TYPE_I
Intra.
@ AV_PIX_FMT_BGR0
packed BGR 8:8:8, 32bpp, BGRXBGRX... X=unused/undefined
static int decode_frame(AVCodecContext *avctx, AVFrame *rframe, int *got_frame, AVPacket *avpkt)
static int decode_mad1(AVCodecContext *avctx, AVFrame *frame)
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
static av_always_inline int bytestream2_get_bytes_left(GetByteContext *g)
int(* init)(AVBSFContext *ctx)
#define AV_CODEC_CAP_DR1
Codec uses get_buffer() or get_encode_buffer() for allocating buffers and supports custom allocators.
int av_frame_ref(AVFrame *dst, const AVFrame *src)
Set up a new reference to the data described by the source frame.
uint8_t ptrdiff_t const uint8_t ptrdiff_t int intptr_t intptr_t int int16_t * dst
#define MKBETAG(a, b, c, d)
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 int decode_alcd(AVCodecContext *avctx, AVFrame *frame)
int bits_per_coded_sample
bits per sample/pixel from the demuxer (needed for huffyuv).
#define i(width, name, range_min, range_max)
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 it can consider them to be part of the FIFO and delay acknowledging a status change accordingly Example code
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 value
void av_frame_unref(AVFrame *frame)
Unreference all the buffers referenced by frame and reset the frame fields.
const char * name
Name of the codec implementation.
enum AVPixelFormat pix_fmt
Pixel format, see AV_PIX_FMT_xxx.
static int decode_pal8(AVCodecContext *avctx, uint32_t *pal)
@ AV_PIX_FMT_PAL8
8 bits with AV_PIX_FMT_RGB32 palette
int ff_reget_buffer(AVCodecContext *avctx, AVFrame *frame, int flags)
Identical in function to ff_get_buffer(), except it reuses the existing buffer if available.
these buffered frames must be flushed immediately if a new input produces new the filter must not call request_frame to get more It must just process the frame or queue it The task of requesting more frames is left to the filter s request_frame method or the application If a filter has several the filter must be ready for frames arriving randomly on any input any filter with several inputs will most likely require some kind of queuing mechanism It is perfectly acceptable to have a limited queue and to drop frames when the inputs are too unbalanced request_frame For filters that do not use the this method is called when a frame is wanted on an output For a it should directly call filter_frame on the corresponding output For a if there are queued frames already one of these frames should be pushed If the filter should request a frame on one of its repeatedly until at least one frame has been pushed Return or at least make progress towards producing a frame
const FFCodec ff_argo_decoder
main external API structure.
static int decode_mad1_24(AVCodecContext *avctx, AVFrame *frame)
@ AV_PICTURE_TYPE_P
Predicted.
static av_always_inline unsigned int bytestream2_get_bufferu(GetByteContext *g, uint8_t *dst, unsigned int size)
#define avpriv_request_sample(...)
const VDPAUPixFmtMap * map
This structure stores compressed data.
int width
picture width / height.
static av_always_inline void bytestream2_init(GetByteContext *g, const uint8_t *buf, int buf_size)
The exact code depends on how similar the blocks are and how related they are to the block
#define AVERROR_INVALIDDATA
Invalid data found when processing input.
static av_cold int decode_init(AVCodecContext *avctx)
static void BS_FUNC() skip(BSCTX *bc, unsigned int n)
Skip n bits in the buffer.