Go to the documentation of this file.
57 #define HUFFMAN_TABLE_SIZE 64 * 1024
58 #define HUF_TOKENS 256
59 #define PALETTE_COUNT 256
71 const unsigned char *
buf;
92 for(
i = 0;
i < num_hnodes;
i++) {
97 if(hnodes[
i].count < best) {
105 hnodes[best_node].
used = 1;
119 hnode *node, *hnodes;
123 hnodes =
s->huff_nodes[prev];
128 node = &hnodes[num_hnodes];
145 s->num_huff_nodes[prev] = num_hnodes - 1;
151 int i, j, histogram_index = 0;
152 unsigned char *histograms;
164 histograms = (
unsigned char *)
s->avctx->extradata;
165 for (
i = 0;
i < 256;
i++) {
167 s->huff_nodes[
i][j].count = histograms[histogram_index++];
180 int bit_pos, node_num, dat_pos;
182 prev = bit_pos = dat_pos = 0;
183 for (y = 0; y < (
frame->linesize[0] *
s->avctx->height);
184 y +=
frame->linesize[0]) {
185 for (x = y; x < y +
s->avctx->width; x++) {
186 node_num =
s->num_huff_nodes[prev];
187 hnodes =
s->huff_nodes[prev];
191 if(dat_pos >=
s->size) {
196 v =
s->buf[dat_pos++];
199 node_num = hnodes[node_num].
children[v & 0x01];
204 frame->data[0][x] = node_num;
215 const uint8_t *buf = avpkt->
data;
216 int buf_size = avpkt->
size;
240 {
"max_pixels",
"320*240" },
245 .
p.
name =
"idcinvideo",
This structure describes decoded (raw) audio or video data.
AVCodec p
The public AVCodec.
const unsigned char * buf
hnode huff_nodes[256][HUF_TOKENS *2]
#define AV_LOG_ERROR
Something went wrong and cannot losslessly be recovered.
static av_cold void huff_build_tree(IdcinContext *s, int prev)
#define FF_CODEC_DECODE_CB(func)
const FFCodec ff_idcin_decoder
static int huff_smallest_node(hnode *hnodes, int num_hnodes)
Find the lowest probability node in a Huffman table, and mark it as being assigned to a higher probab...
#define HUFFMAN_TABLE_SIZE
int ff_get_buffer(AVCodecContext *avctx, AVFrame *frame, int flags)
Get a buffer for a frame.
#define AV_CODEC_CAP_DR1
Codec uses get_buffer() or get_encode_buffer() for allocating buffers and supports custom allocators.
#define NULL_IF_CONFIG_SMALL(x)
Return NULL if CONFIG_SMALL is true, otherwise the argument without modification.
static int idcin_decode_frame(AVCodecContext *avctx, AVFrame *frame, int *got_frame, AVPacket *avpkt)
#define i(width, name, range_min, range_max)
static const FFCodecDefault idcin_defaults[]
#define FF_CODEC_CAP_INIT_THREADSAFE
The codec does not modify any global variables in the init function, allowing to call the init functi...
const char * name
Name of the codec implementation.
enum AVPixelFormat pix_fmt
Pixel format, see AV_PIX_FMT_xxx.
@ AV_PIX_FMT_PAL8
8 bits with AV_PIX_FMT_RGB32 palette
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
main external API structure.
static av_cold int idcin_decode_init(AVCodecContext *avctx)
This structure stores compressed data.
static int idcin_decode_vlcs(IdcinContext *s, AVFrame *frame)
#define AVERROR_INVALIDDATA
Invalid data found when processing input.
int ff_copy_palette(void *dst, const AVPacket *src, void *logctx)
Check whether the side-data of src contains a palette of size AVPALETTE_SIZE; if so,...