Go to the documentation of this file.
25 #define BITSTREAM_READER_LE
34 static const int8_t
map_3bit[] = { -4, -3, -2, -1, +1, +2, +3, +4 };
64 for (
int x3 = 0; x3 < 3; x3++)
65 for (
int x2 = 0; x2 < 3; x2++)
66 for (
int x1 = 0; x1 < 3; x1++)
67 mul_3x3[x1 + x2 * 3 + x3 * 3 * 3] = x1 + (x2 << 4) + (x3 << 8);
68 for (
int x3 = 0; x3 < 5; x3++)
69 for (
int x2 = 0; x2 < 5; x2++)
70 for (
int x1 = 0; x1 < 5; x1++)
71 mul_3x5[x1 + x2 * 5 + x3 * 5 * 5] = x1 + (x2 << 4) + (x3 << 8);
72 for (
int x2 = 0; x2 < 11; x2++)
73 for (
int x1 = 0; x1 < 11; x1++)
74 mul_2x11[x1 + x2 * 11] = x1 + (x2 << 4);
92 if (
s->max_samples == 0)
93 s->max_samples = UINT64_MAX;
96 s->cols = 1 <<
s->level;
97 s->wrapbuf_len = 2 *
s->cols - 2;
98 s->block_len =
s->rows *
s->cols;
99 s->max_framesize =
s->block_len;
102 s->wrapbuf =
av_calloc(
s->wrapbuf_len,
sizeof(
int));
105 if (!
s->block || !
s->wrapbuf || !
s->ampbuf || !
s->bitstream)
108 s->midbuf =
s->ampbuf + 0x8000;
116 #define set_pos(s, r, c, idx) do { \
117 unsigned pos = ((r) << s->level) + (c); \
118 s->block[pos] = s->midbuf[(idx)]; \
125 for (
i = 0;
i <
s->rows;
i++)
139 int b, middle = 1 << (ind - 1);
141 for (
i = 0;
i <
s->rows;
i++) {
153 for (
i = 0;
i <
s->rows;
i++) {
178 for (
i = 0;
i <
s->rows;
i++) {
196 for (
i = 0;
i <
s->rows;
i++) {
200 if (
i >=
s->rows)
break;
222 for (
i = 0;
i <
s->rows;
i++) {
240 for (
i = 0;
i <
s->rows;
i++) {
274 for (
i = 0;
i <
s->rows;
i++) {
299 for (
i = 0;
i <
s->rows;
i++) {
326 for (
i = 0;
i <
s->rows;
i++) {
345 for (
i = 0;
i <
s->rows;
i++) {
354 n2 = ((
mul_3x3[
b] >> 4) & 0x0F) - 1;
355 n3 = ((
mul_3x3[
b] >> 8) & 0x0F) - 1;
374 for (
i = 0;
i <
s->rows;
i++) {
383 n2 = ((
mul_3x5[
b] >> 4) & 0x0F) - 2;
384 n3 = ((
mul_3x5[
b] >> 8) & 0x0F) - 2;
402 for (
i = 0;
i <
s->rows;
i++) {
440 for (
i = 0;
i <
s->cols;
i++) {
449 static void juggle(
int *wrap_p,
int *block_p,
unsigned sub_len,
unsigned sub_count)
453 unsigned int r0, r1, r2, r3;
455 for (
i = 0;
i < sub_len;
i++) {
459 for (j = 0; j < sub_count/2; j++) {
461 *p = r1 * 2 + (r0 + r2);
464 *p = r2 * 2 - (r1 + r3);
478 unsigned sub_count, sub_len, todo_count, step_subcount,
i;
479 int *wrap_p, *block_p, *p;
489 step_subcount = (2048 >>
s->level) - 2;
495 todo_count =
s->rows;
499 sub_count = step_subcount;
500 if (sub_count > todo_count)
501 sub_count = todo_count;
503 sub_len =
s->cols / 2;
506 juggle(wrap_p, block_p, sub_len, sub_count);
507 wrap_p += sub_len * 2;
509 for (
i = 0, p = block_p;
i < sub_count;
i++) {
514 while (sub_len > 1) {
517 juggle(wrap_p, block_p, sub_len, sub_count);
518 wrap_p += sub_len * 2;
521 if (todo_count <= step_subcount)
524 todo_count -= step_subcount;
525 block_p += step_subcount <<
s->level;
532 int pwr, count,
val,
i, x,
ret;
539 for (
i = 0, x = 0;
i < count;
i++) {
544 for (
i = 1, x = -
val;
i <= count;
i++) {
565 int ret, n, buf_size, input_buf_size;
567 if (!
pkt->
size && !
s->bitstream_size) {
572 buf_size =
FFMIN(
pkt->
size,
s->max_framesize -
s->bitstream_size);
573 input_buf_size = buf_size;
574 if (
s->bitstream_index +
s->bitstream_size + buf_size >
s->max_framesize) {
575 memmove(
s->bitstream, &
s->bitstream[
s->bitstream_index],
s->bitstream_size);
576 s->bitstream_index = 0;
579 memcpy(&
s->bitstream[
s->bitstream_index +
s->bitstream_size],
pkt->
data, buf_size);
580 buf = &
s->bitstream[
s->bitstream_index];
581 buf_size +=
s->bitstream_size;
582 s->bitstream_size = buf_size;
583 if (buf_size < s->max_framesize &&
pkt->
data) {
585 return input_buf_size;
592 s->max_samples -=
FFMIN(
frame->nb_samples,
s->max_samples);
603 int val =
s->block[n] >>
s->level;
611 if (n > buf_size &&
pkt->
data) {
612 s->bitstream_size = 0;
613 s->bitstream_index = 0;
617 if (
s->bitstream_size > 0) {
618 s->bitstream_index += n;
619 s->bitstream_size -=
FFMIN(
s->bitstream_size, n);
620 return input_buf_size;
633 s->bitstream_size = 0;
639 .
p.
name =
"interplayacm",
#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_cold void decode_init_static(void)
static int k45(InterplayACMContext *s, unsigned ind, unsigned col)
@ AV_CODEC_ID_INTERPLAY_ACM
static int decode_frame(AVCodecContext *avctx, AVFrame *frame, int *got_frame_ptr, AVPacket *pkt)
static int get_bits_count(const GetBitContext *s)
This structure describes decoded (raw) audio or video data.
static int decode_block(InterplayACMContext *s)
static const int8_t map_2bit_near[]
static int linear(InterplayACMContext *s, unsigned ind, unsigned col)
const FFCodec ff_interplay_acm_decoder
int nb_channels
Number of channels in this layout.
static void skip_bits(GetBitContext *s, int n)
static unsigned int get_bits(GetBitContext *s, int n)
Read 1-25 bits.
static const int8_t map_2bit_far[]
AVCodec p
The public AVCodec.
AVChannelLayout ch_layout
Audio channel layout.
static double val(void *priv, double ch)
static int mul_3x5[5 *5 *5]
#define set_pos(s, r, c, idx)
static int ff_thread_once(char *control, void(*routine)(void))
#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.
static int k44(InterplayACMContext *s, unsigned ind, unsigned col)
static int t15(InterplayACMContext *s, unsigned ind, unsigned col)
#define FF_CODEC_DECODE_CB(func)
static int k35(InterplayACMContext *s, unsigned ind, unsigned col)
uint64_t_TMPL AV_WL64 unsigned int_TMPL AV_WL32 unsigned int_TMPL AV_WL24 unsigned int_TMPL AV_RL16
static int k34(InterplayACMContext *s, unsigned ind, unsigned col)
#define CODEC_LONG_NAME(str)
static av_cold int decode_init(AVCodecContext *avctx)
static int mul_2x11[11 *11]
static int k12(InterplayACMContext *s, unsigned ind, unsigned col)
static av_cold int decode_close(AVCodecContext *avctx)
static unsigned int get_bits1(GetBitContext *s)
static void juggle_block(InterplayACMContext *s)
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.
static void juggle(int *wrap_p, int *block_p, unsigned sub_len, unsigned sub_count)
enum AVSampleFormat sample_fmt
audio sample format
static const filler filler_list[]
static int t27(InterplayACMContext *s, unsigned ind, unsigned col)
static int zero(InterplayACMContext *s, unsigned ind, unsigned col)
#define i(width, name, range_min, range_max)
static int k23(InterplayACMContext *s, unsigned ind, unsigned col)
uint8_t * extradata
some codecs need / can use extradata like Huffman tables.
static const int8_t map_1bit[]
@ AV_SAMPLE_FMT_S16
signed 16 bits
const char * name
Name of the codec implementation.
void * av_calloc(size_t nmemb, size_t size)
static int fill_block(InterplayACMContext *s)
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
#define AV_INPUT_BUFFER_PADDING_SIZE
uint64_t_TMPL AV_WL64 unsigned int_TMPL AV_RL32
static int t37(InterplayACMContext *s, unsigned ind, unsigned col)
main external API structure.
static int k13(InterplayACMContext *s, unsigned ind, unsigned col)
int(* filler)(InterplayACMContext *s, unsigned ind, unsigned col)
#define AV_CODEC_CAP_DELAY
Encoder or decoder requires flushing with NULL input at the end in order to give the complete and cor...
static int mul_3x3[3 *3 *3]
Filter the word “frame” indicates either a video frame or a group of audio samples
static int bad(InterplayACMContext *s, unsigned ind, unsigned col)
This structure stores compressed data.
static const int8_t map_3bit[]
#define AVERROR_INVALIDDATA
Invalid data found when processing input.
static int k24(InterplayACMContext *s, unsigned ind, unsigned col)