Go to the documentation of this file.
25 #define BITSTREAM_READER_LE
164 }
else if (
mode == 0) {
181 const int *quant_matrix,
int *
skip,
int *dc_level)
183 const uint8_t *scantable =
s->permutated_scantable;
186 memset(
s->wblocks, 0,
s->wblocks_size);
188 for (
int i = 0;
i < 64;
i++) {
189 int16_t *
block =
s->wblocks + scantable[
i];
191 for (
int j = 0; j <
s->blocks_w;) {
198 for (
int k = 0; k < rskip; k++)
199 block[64 * k] = *dc_level * quant_matrix[0];
211 block[0] = (
i == 0 ? *dc_level :
level) * quant_matrix[
i];
222 const int *quant_matrix,
int *
skip,
225 const uint8_t *scantable =
s->permutated_scantable;
228 memset(
s->wblocks, 0,
s->wblocks_size);
229 memset(
s->map, 0,
s->map_size);
231 for (
int i = 0;
i < 64;
i++) {
232 int16_t *
block =
s->wblocks + scantable[
i];
234 for (
int j = 0; j <
s->blocks_w;) {
258 const int *quant_matrix,
int *
skip,
int *dc_level)
260 const uint8_t *scantable =
s->permutated_scantable;
261 const int offset =
s->plus ? 0 : 1024;
262 int16_t *
block =
s->block;
265 memset(
block, 0,
sizeof(
s->block));
275 block[scantable[0]] =
offset + *dc_level * quant_matrix[0];
277 for (
int i = 1;
i < 64;) {
301 int ret,
skip = 0, dc_level = 0;
302 const int offset =
s->plus ? 0 : 1024;
309 64 *
s->blocks_w *
sizeof(*
s->wblocks));
313 for (
int y = 0; y <
s->blocks_h; y++) {
318 for (
int x = 0; x <
s->blocks_w; x++) {
320 s->idsp.idct_put(
frame->data[plane] + (
s->blocks_h - 1 - y) * 8 *
frame->linesize[plane] + x * 8,
321 frame->linesize[plane],
s->wblocks + 64 * x);
325 for (
int y = 0; y <
s->blocks_h; y++) {
326 for (
int x = 0; x <
s->blocks_w; x++) {
331 s->idsp.idct_put(
frame->data[plane] + (
s->blocks_h - 1 - y) * 8 *
frame->linesize[plane] + x * 8,
332 frame->linesize[plane],
s->block);
347 const int *quant_matrix,
int *
skip,
350 const uint8_t *scantable =
s->permutated_scantable;
351 int16_t *
block =
s->block;
354 memset(
block, 0,
sizeof(
s->block));
356 for (
int i = 0;
i < 64;) {
387 64 *
s->blocks_w *
sizeof(*
s->wblocks));
392 s->blocks_w *
sizeof(*
s->map));
396 for (
int y = 0; y <
s->blocks_h; y++) {
401 for (
int x = 0; x <
s->blocks_w; x++) {
402 int shift = plane == 0;
404 int orig_mv_x =
s->mvectors[mvpos].x;
405 int mv_x =
s->mvectors[mvpos].x / (1 + !
shift);
406 int mv_y =
s->mvectors[mvpos].y / (1 + !
shift);
407 int h =
s->avctx->coded_height >> !
shift;
408 int w =
s->avctx->coded_width >> !
shift;
411 if (orig_mv_x >= -32) {
412 if (y * 8 + mv_y < 0 || y * 8 + mv_y + 8 >
h ||
413 x * 8 + mv_x < 0 || x * 8 + mv_x + 8 >
w)
417 prev->
data[plane] + ((
s->blocks_h - 1 - y) * 8 - mv_y) * prev->
linesize[plane] + (x * 8 + mv_x),
420 s->idsp.idct(
s->wblocks + x * 64);
421 for (
int i = 0;
i < 64;
i++)
422 s->wblocks[
i + x * 64] = (
s->wblocks[
i + x * 64] + 1) & 0xFFFC;
423 s->idsp.add_pixels_clamped(&
s->wblocks[x*64],
frame->data[plane] + (
s->blocks_h - 1 - y) * 8 *
frame->linesize[plane] + x * 8,
424 frame->linesize[plane]);
427 s->idsp.idct_put(
frame->data[plane] + (
s->blocks_h - 1 - y) * 8 *
frame->linesize[plane] + x * 8,
428 frame->linesize[plane],
s->wblocks + x * 64);
432 }
else if (
s->flags & 2) {
433 for (
int y = 0; y <
s->blocks_h; y++) {
434 for (
int x = 0; x <
s->blocks_w; x++) {
435 int shift = plane == 0;
437 int orig_mv_x =
s->mvectors[mvpos].x;
438 int mv_x =
s->mvectors[mvpos].x / (1 + !
shift);
439 int mv_y =
s->mvectors[mvpos].y / (1 + !
shift);
440 int h =
s->avctx->coded_height >> !
shift;
441 int w =
s->avctx->coded_width >> !
shift;
448 if (orig_mv_x >= -32) {
449 if (y * 8 + mv_y < 0 || y * 8 + mv_y + 8 >
h ||
450 x * 8 + mv_x < 0 || x * 8 + mv_x + 8 >
w)
454 prev->
data[plane] + ((
s->blocks_h - 1 - y) * 8 - mv_y) * prev->
linesize[plane] + (x * 8 + mv_x),
457 s->idsp.idct(
s->block);
458 for (
int i = 0;
i < 64;
i++)
459 s->block[
i] = (
s->block[
i] + 1) & 0xFFFC;
460 s->idsp.add_pixels_clamped(
s->block,
frame->data[plane] + (
s->blocks_h - 1 - y) * 8 *
frame->linesize[plane] + x * 8,
461 frame->linesize[plane]);
464 s->idsp.idct_put(
frame->data[plane] + (
s->blocks_h - 1 - y) * 8 *
frame->linesize[plane] + x * 8,
465 frame->linesize[plane],
s->block);
469 }
else if (
s->flags & 1) {
471 64 *
s->blocks_w *
sizeof(*
s->wblocks));
476 s->blocks_w *
sizeof(*
s->map));
480 for (
int y = 0; y <
s->blocks_h; y++) {
485 for (
int x = 0; x <
s->blocks_w; x++) {
488 s->idsp.idct_add(
frame->data[plane] + (
s->blocks_h - 1 - y) * 8 *
frame->linesize[plane] + x * 8,
489 frame->linesize[plane],
s->wblocks + 64 * x);
493 for (
int y = 0; y <
s->blocks_h; y++) {
494 for (
int x = 0; x <
s->blocks_w; x++) {
503 s->idsp.idct_add(
frame->data[plane] + (
s->blocks_h - 1 - y) * 8 *
frame->linesize[plane] + x * 8,
504 frame->linesize[plane],
s->block);
521 double f = 1.0 -
fabs(qscale);
523 if (!
s->key_frame && (
s->flags & 2)) {
525 for (
int i = 0;
i < 64;
i++) {
530 for (
int i = 0;
i < 64;
i++) {
531 luma[
i] =
FFMAX(1, 16 - qscale * 32);
537 for (
int i = 0;
i < 64;
i++) {
542 for (
int i = 0;
i < 64;
i++) {
549 for (
int i = 0;
i < 64;
i++) {
552 s->luma_quant_matrix[
i] = luma[
pos] * ((
pos / 8) & 1 ? -1 : 1);
553 s->chroma_quant_matrix[
i] =
chroma[
pos] * ((
pos / 8) & 1 ? -1 : 1);
560 uint8_t
r = 0,
g = 0,
b = 0;
565 for (
int y = 0; y < avctx->
height; y++) {
566 for (
int x = 0; x < avctx->
width; x++) {
567 dst[x*3+0] = bytestream2_get_byteu(gbyte) +
r;
569 dst[x*3+1] = bytestream2_get_byteu(gbyte) +
g;
571 dst[x*3+2] = bytestream2_get_byteu(gbyte) +
b;
581 uint8_t **
u, uint8_t **v,
582 int ylinesize,
int ulinesize,
int vlinesize,
584 int *nx,
int *ny,
int *np,
int w,
int h)
586 uint8_t *y0dst = *y0;
587 uint8_t *y1dst = *y1;
590 int x = *nx, y = *ny,
pos = *np;
593 y0dst[2*x+0] += fill[0];
594 y0dst[2*x+1] += fill[1];
595 y1dst[2*x+0] += fill[2];
596 y1dst[2*x+1] += fill[3];
598 }
else if (
pos == 1) {
607 y0dst -= 2*ylinesize;
608 y1dst -= 2*ylinesize;
612 y0dst[2*x+0] += fill[2];
613 y0dst[2*x+1] += fill[3];
615 }
else if (
pos == 2) {
616 y1dst[2*x+0] += fill[0];
617 y1dst[2*x+1] += fill[1];
626 y0dst -= 2*ylinesize;
627 y1dst -= 2*ylinesize;
648 int runlen, y = 0, x = 0;
653 code = bytestream2_peek_le32(gbyte);
654 runlen =
code & 0xFFFFFF;
656 if (
code >> 24 == 0x77) {
659 for (
int i = 0;
i < 4;
i++)
660 fill[
i] = bytestream2_get_byte(gbyte);
665 for (
int i = 0;
i < 4;
i++) {
668 if (x >=
frame->width * 3) {
672 if (y >=
frame->height)
678 for (
int i = 0;
i < 4;
i++)
679 fill[
i] = bytestream2_get_byte(gbyte);
681 for (
int i = 0;
i < 4;
i++) {
684 if (x >=
frame->width * 3) {
688 if (y >=
frame->height)
701 uint8_t *y1dst = y0dst -
frame->linesize[0];
702 uint8_t *udst =
frame->data[1] + ((avctx->
height >> 1) - 1) *
frame->linesize[1];
703 uint8_t *vdst =
frame->data[2] + ((avctx->
height >> 1) - 1) *
frame->linesize[2];
704 int runlen, y = 0, x = 0,
pos = 0;
709 code = bytestream2_peek_le32(gbyte);
710 runlen =
code & 0xFFFFFF;
712 if (
code >> 24 == 0x77) {
715 for (
int i = 0;
i < 4;
i++)
716 fill[
i] = bytestream2_get_byte(gbyte);
731 for (
int i = 0;
i < 4;
i++)
732 fill[
i] = bytestream2_get_byte(gbyte);
751 uint8_t *y1dst = y0dst -
frame->linesize[0];
752 uint8_t *udst =
frame->data[1] + ((avctx->
height >> 1) - 1) *
frame->linesize[1];
753 uint8_t *vdst =
frame->data[2] + ((avctx->
height >> 1) - 1) *
frame->linesize[2];
754 uint8_t ly0 = 0, ly1 = 0, ly2 = 0, ly3 = 0, lu = 0, lv = 0;
756 for (
int y = 0; y < avctx->
height / 2; y++) {
757 for (
int x = 0; x < avctx->
width / 2; x++) {
758 y0dst[x*2+0] = bytestream2_get_byte(gbyte) + ly0;
760 y0dst[x*2+1] = bytestream2_get_byte(gbyte) + ly1;
762 y1dst[x*2+0] = bytestream2_get_byte(gbyte) + ly2;
764 y1dst[x*2+1] = bytestream2_get_byte(gbyte) + ly3;
766 udst[x] = bytestream2_get_byte(gbyte) + lu;
768 vdst[x] = bytestream2_get_byte(gbyte) + lv;
772 y0dst -= 2*
frame->linesize[0];
773 y1dst -= 2*
frame->linesize[0];
774 udst -=
frame->linesize[1];
775 vdst -=
frame->linesize[2];
823 nb_mvs *
sizeof(*
s->mvectors));
828 (
s->size[0] +
s->size[1] +
s->size[2]))) < 0)
831 memset(
s->mvectors, 0,
sizeof(*
s->mvectors) * nb_mvs);
833 for (
int i = 0;
i < nb_mvs;
i++) {
841 for (
int i = 0;
i < nb_mvs;
i++) {
906 if (idx < 256 && idx >= 0) {
908 }
else if (idx >= 0) {
909 get_tree_codes(codes, nodes, nodes[idx].child[0], pfx + (0 << bitpos), bitpos + 1);
910 get_tree_codes(codes, nodes, nodes[idx].child[1], pfx + (1
U << bitpos), bitpos + 1);
916 int zlcount = 0, curlen, idx, nindex, last, llast;
917 int blcounts[32] = { 0 };
923 for (
int i = 0;
i < 256;
i++) {
924 int bitlen = bitlens[
i];
925 int blcount = blcounts[bitlen];
927 zlcount += bitlen < 1;
928 syms[(bitlen << 8) + blcount] =
i;
932 for (
int i = 0;
i < 512;
i++) {
937 for (
int i = 0;
i < 256;
i++) {
938 node_idx[
i] = 257 +
i;
946 for (curlen = 1; curlen < 32; curlen++) {
947 if (blcounts[curlen] > 0) {
948 int max_zlcount = zlcount + blcounts[curlen];
950 for (
int i = 0; zlcount < 256 && zlcount < max_zlcount; zlcount++,
i++) {
951 int p = node_idx[nindex - 1 + 512];
952 int ch = syms[256 * curlen +
i];
957 if (nodes[
p].child[0] == -1) {
972 p = node_idx[nindex - 1 + 512];
974 if (nodes[
p].child[0] == -1) {
986 for (
int i = 0;
i < idx;
i++)
987 node_idx[512 +
i] = old_idx[
i];
1001 uint32_t new_codes[256];
1003 uint8_t symbols[256];
1004 uint32_t codes[256];
1011 for (
int i = 0;
i < 256;
i++) {
1013 bits[nb_codes] = bitlen[
i];
1014 codes[nb_codes] = new_codes[
i];
1015 symbols[nb_codes] =
i;
1041 if (
s->output_size > avctx->
width * avctx->
height * 9LL + 10000)
1054 for (
int i = 0;
i < count;
i++)
1057 for (
int i = 0;
i < 256;
i++) {
1062 for (
int i = 0;
i < 256;
i++)
1074 s->output[x++] =
val;
1087 unsigned compressed_size;
1096 header = bytestream2_get_le32(gbyte);
1097 s->fflags = bytestream2_get_le32(gbyte);
1098 s->bitstream_size =
s->fflags & 0x1FFFFFFF;
1101 if (avpkt->
size <
s->bitstream_size + 8)
1111 if (!
s->key_frame) {
1112 if (!
s->prev_frame->data[0]) {
1127 }
else if (!
s->dct) {
1133 w = bytestream2_get_le32(gbyte);
1134 h = bytestream2_get_le32(gbyte);
1135 if (
w == INT32_MIN ||
h == INT32_MIN)
1157 s->compression = bytestream2_get_le32(gbyte);
1158 if (
s->compression < 0 ||
s->compression > 100)
1161 for (
int i = 0;
i < 3;
i++)
1162 s->size[
i] = bytestream2_get_le32(gbyte);
1164 compressed_size =
s->output_size;
1167 compressed_size = avpkt->
size;
1170 if (
s->size[0] < 0 ||
s->size[1] < 0 ||
s->size[2] < 0 ||
1171 skip +
s->size[0] +
s->size[1] +
s->size[2] > compressed_size) {
1180 if (!
s->dct && !
s->rgb)
1182 else if (!
s->dct &&
s->rgb)
1188 s->prev_frame->height !=
frame->height)
1191 if (!(
s->flags & 2)) {
1199 }
else if (!
s->dct && !
s->rgb) {
1232 if (!
s->rgb && !
s->dct) {
1240 s->idsp.idct_permutation);
1263 s->mvectors_size = 0;
1265 s->wblocks_size = 0;
1267 s->padded_output_size = 0;
static av_always_inline int fill_pixels(uint8_t **y0, uint8_t **y1, uint8_t **u, uint8_t **v, int ylinesize, int ulinesize, int vlinesize, uint8_t *fill, int *nx, int *ny, int *np, int w, int h)
#define AV_LOG_WARNING
Something somehow does not look correct.
#define FF_CODEC_CAP_INIT_CLEANUP
The codec allows calling the close function for deallocation even if the init function returned a fai...
static int get_bits_left(GetBitContext *gb)
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 int bytestream2_get_bytes_left(const GetByteContext *g)
static double cb(void *priv, double x, double y)
static av_cold int decode_init(AVCodecContext *avctx)
static int decode_inter(AVCodecContext *avctx, GetBitContext *gb, AVFrame *frame, AVFrame *prev)
static unsigned int get_bits_long(GetBitContext *s, int n)
Read 0-32 bits.
static int get_bits_count(const GetBitContext *s)
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.
#define u(width, name, range_min, range_max)
unsigned padded_output_size
int chroma_quant_matrix[64]
static void copy_block8(uint8_t *dst, const uint8_t *src, ptrdiff_t dstStride, ptrdiff_t srcStride, int h)
@ AV_PIX_FMT_BGR24
packed RGB 8:8:8, 24bpp, BGRBGR...
int luma_quant_matrix[64]
static int decode_intra_blocks(AGMContext *s, GetBitContext *gb, const int *quant_matrix, int *skip, int *dc_level)
int ff_set_dimensions(AVCodecContext *s, int width, int height)
Check that the provided frame dimensions are valid and set them on the codec context.
static int decode_inter_block(AGMContext *s, GetBitContext *gb, const int *quant_matrix, int *skip, int *map)
#define AV_PKT_FLAG_KEY
The packet contains a keyframe.
av_cold void ff_idctdsp_init(IDCTDSPContext *c, AVCodecContext *avctx)
uint8_t * data[AV_NUM_DATA_POINTERS]
pointer to the picture/channel planes.
static void skip_bits(GetBitContext *s, int n)
av_cold void ff_permute_scantable(uint8_t dst[64], const uint8_t src[64], const uint8_t permutation[64])
static av_cold void close(AVCodecParserContext *s)
static av_always_inline void bytestream2_skip(GetByteContext *g, unsigned int size)
static unsigned int get_bits(GetBitContext *s, int n)
Read 1-25 bits.
AVCodec p
The public AVCodec.
static int decode_huffman2(AVCodecContext *avctx, int header, int size)
static double val(void *priv, double ch)
AVFrame * av_frame_alloc(void)
Allocate an AVFrame and set its fields to default values.
static int read_code(GetBitContext *gb, int *oskip, int *level, int *map, int mode)
#define AV_LOG_ERROR
Something went wrong and cannot losslessly be recovered.
static int init_get_bits8(GetBitContext *s, const uint8_t *buffer, int byte_size)
Initialize GetBitContext.
#define AV_FRAME_FLAG_KEY
A flag to mark frames that are keyframes.
#define FF_CODEC_DECODE_CB(func)
#define AV_GET_BUFFER_FLAG_REF
The decoder will keep a reference to the frame and may reuse it later.
#define AV_LOG_DEBUG
Stuff which is only useful for libav* developers.
@ AV_PIX_FMT_YUV420P
planar YUV 4:2:0, 12bpp, (1 Cr & Cb sample per 2x2 Y samples)
static av_cold int decode_close(AVCodecContext *avctx)
#define CODEC_LONG_NAME(str)
static int decode_inter_plane(AGMContext *s, GetBitContext *gb, int size, const int *quant_matrix, AVFrame *frame, AVFrame *prev, int plane)
const FFCodec ff_agm_decoder
Describe the class of an AVClass context structure.
static __device__ float fabs(float a)
#define AVERROR_PATCHWELCOME
Not yet implemented in FFmpeg, patches welcome.
static int decode_frame(AVCodecContext *avctx, AVFrame *frame, int *got_frame, AVPacket *avpkt)
static int decode_runlen_rgb(AVCodecContext *avctx, GetByteContext *gbyte, AVFrame *frame)
@ AV_PICTURE_TYPE_I
Intra.
static int decode_motion_vectors(AVCodecContext *avctx, GetBitContext *gb)
static av_always_inline int get_vlc2(GetBitContext *s, const VLCElem *table, int bits, int max_depth)
Parse a vlc code.
int ff_get_buffer(AVCodecContext *avctx, AVFrame *frame, int flags)
Get a buffer for a frame.
int(* init)(AVBSFContext *ctx)
#define AV_CODEC_CAP_DR1
Codec uses get_buffer() or get_encode_buffer() for allocating buffers and supports custom allocators.
static int decode_intra_block(AGMContext *s, GetBitContext *gb, const int *quant_matrix, int *skip, int *dc_level)
#define DECLARE_ALIGNED(n, t, v)
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
int av_frame_copy(AVFrame *dst, const AVFrame *src)
Copy the frame data from src to dst.
#define FF_CODEC_CAP_EXPORTS_CROPPING
The decoder sets the cropping fields in the output frames manually.
static av_cold void decode_flush(AVCodecContext *avctx)
static int decode_runlen(AVCodecContext *avctx, GetByteContext *gbyte, AVFrame *frame)
static const uint8_t header[24]
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 offset
int flags
A combination of AV_PKT_FLAG values.
int ff_vlc_init_sparse(VLC *vlc, int nb_bits, int nb_codes, const void *bits, int bits_wrap, int bits_size, const void *codes, int codes_wrap, int codes_size, const void *symbols, int symbols_wrap, int symbols_size, int flags)
Build VLC decoding tables suitable for use with get_vlc2().
#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
static unsigned int show_bits(GetBitContext *s, int n)
Show 1-25 bits.
void av_fast_padded_malloc(void *ptr, unsigned int *size, size_t min_size)
Same behaviour av_fast_malloc but the buffer has additional AV_INPUT_BUFFER_PADDING_SIZE at the end w...
const uint8_t ff_mjpeg_std_chrominance_quant_tbl[64]
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.
int idct_algo
IDCT algorithm, see FF_IDCT_* below.
const char * name
Name of the codec implementation.
enum AVPixelFormat pix_fmt
Pixel format, see AV_PIX_FMT_xxx.
const uint8_t ff_zigzag_direct[64]
void ff_vlc_free(VLC *vlc)
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
static int decode_intra_plane(AGMContext *s, GetBitContext *gb, int size, const int *quant_matrix, AVFrame *frame, int plane)
static const uint8_t * align_get_bits(GetBitContext *s)
const uint8_t ff_mjpeg_std_luminance_quant_tbl[64]
int av_frame_replace(AVFrame *dst, const AVFrame *src)
Ensure the destination frame refers to the same data described by the source frame,...
main external API structure.
static int decode_inter_blocks(AGMContext *s, GetBitContext *gb, const int *quant_matrix, int *skip, int *map)
static int decode_raw_intra_rgb(AVCodecContext *avctx, GetByteContext *gbyte, AVFrame *frame)
static int build_huff(const uint8_t *bitlen, VLC *vlc)
IDirect3DDxgiInterfaceAccess _COM_Outptr_ void ** p
int coded_width
Bitstream width / height, may be different from width/height e.g.
@ AV_PICTURE_TYPE_P
Predicted.
const VDPAUPixFmtMap * map
unsigned int codec_tag
fourcc (LSB first, so "ABCD" -> ('D'<<24) + ('C'<<16) + ('B'<<8) + 'A').
This structure stores compressed data.
int width
picture width / height.
uint8_t permutated_scantable[64]
static int decode_raw_intra(AVCodecContext *avctx, GetByteContext *gbyte, AVFrame *frame)
static av_always_inline void bytestream2_init(GetByteContext *g, const uint8_t *buf, int buf_size)
int linesize[AV_NUM_DATA_POINTERS]
For video, a positive or negative value, which is typically indicating the size in bytes of each pict...
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.
#define MKTAG(a, b, c, d)
static int make_new_tree(const uint8_t *bitlens, uint32_t *codes)
static void BS_FUNC() skip(BSCTX *bc, unsigned int n)
Skip n bits in the buffer.
static void get_tree_codes(uint32_t *codes, Node *nodes, int idx, uint32_t pfx, int bitpos)
static int decode_intra(AVCodecContext *avctx, GetBitContext *gb, AVFrame *frame)
static void compute_quant_matrix(AGMContext *s, double qscale)