Go to the documentation of this file.
33 #define TOP 0x01000000
42 rc->
code = bytestream2_get_be32(gb);
50 for (j = 0; j < 4096; j++) {
51 if (
s->pixel_model[
comp][j].total_freq != 256) {
52 for (
i = 0;
i < 256;
i++)
53 s->pixel_model[
comp][j].freq[
i] = 1;
55 s->pixel_model[
comp][j].lookup[
i] = 16;
56 s->pixel_model[
comp][j].total_freq = 256;
61 for (j = 0; j < 6; j++) {
62 uint32_t *p =
s->run_model[j];
63 for (
i = 0;
i < 256;
i++)
68 for (j = 0; j < 6; j++) {
69 uint32_t *
op =
s->op_model[j];
70 for (
i = 0;
i < 6;
i++)
75 for (
i = 0;
i < 256;
i++) {
76 s->range_model[
i] = 1;
77 s->count_model[
i] = 1;
79 s->range_model[256] = 256;
80 s->count_model[256] = 256;
82 for (
i = 0;
i < 5;
i++) {
87 for (j = 0; j < 4; j++) {
88 for (
i = 0;
i < 16;
i++) {
89 s->sxy_model[j][
i] = 1;
91 s->sxy_model[j][16] = 16;
94 for (
i = 0;
i < 512;
i++) {
95 s->mv_model[0][
i] = 1;
96 s->mv_model[1][
i] = 1;
98 s->mv_model[0][512] = 512;
99 s->mv_model[1][512] = 512;
108 uint32_t
byte = bytestream2_get_byteu(gb);
138 t = rc->
range * (uint64_t)cumFreq / total_freq;
141 rc->
range = rc->
range * (uint64_t)(freq + cumFreq) / total_freq - (t + 1);
144 uint32_t
byte = bytestream2_get_byteu(gb);
158 *freq = total_freq * (uint64_t)(rc->
code - rc->
code1) / rc->
range;
167 uint32_t totfr = cnt[maxc];
169 uint32_t
c = 0, cumfr = 0, cnt_c = 0;
172 if ((
ret =
s->get_freq(rc, totfr, &
value)) < 0)
177 if (
value >= cumfr + cnt_c)
187 if ((
ret =
s->decode(gb, rc, cumfr, cnt_c, totfr)) < 0)
190 cnt[
c] = cnt_c +
step;
194 for (
i = 0;
i < maxc;
i++) {
195 uint32_t nc = (cnt[
i] >> 1) + 1;
211 uint32_t totfr =
pixel->total_freq;
212 uint32_t
value, x = 0, cumfr = 0, cnt_x = 0;
213 int i, j,
ret,
c, cnt_c;
215 if ((
ret =
s->get_freq(rc, totfr, &
value)) < 0)
219 cnt_x =
pixel->lookup[x];
220 if (
value >= cumfr + cnt_x)
231 if (
value >= cumfr + cnt_c)
237 if (x >= 16 ||
c >= 256) {
241 if ((
ret =
s->decode(gb, rc, cumfr, cnt_c, totfr)) < 0)
249 for (
i = 0;
i < 256;
i++) {
250 uint32_t nc = (
pixel->freq[
i] >> 1) + 1;
254 for (
i = 0;
i < 16;
i++) {
256 uint32_t i16_17 =
i << 4;
257 for (j = 0; j < 16; j++)
258 sum +=
pixel->freq[i16_17 + j];
262 pixel->total_freq = totfr;
264 *rval =
c &
s->cbits;
272 const int cxshift =
s->cxshift;
279 *cx1 = (*cx << 6) & 0xFC0;
285 *cx1 = (*cx << 6) & 0xFC0;
291 *cx1 = (*cx << 6) & 0xFC0;
301 int cx = 0, cx1 = 0, k = 0;
302 int run, off, y = 0, x = 0,
ret;
303 uint32_t clr = 0,
r,
g,
b, backstep = linesize - avctx->
width;
304 uint32_t lx, ly, ptype;
310 while (k < avctx->
width + 1) {
321 clr = (
b << 16) + (
g << 8) +
r;
327 dst[y * linesize + x] = clr;
331 if (x >= avctx->
width) {
349 clr = (
b << 16) + (
g << 8) +
r;
360 dst, linesize, &lx, &ly,
361 backstep, off, &cx, &cx1);
370 uint32_t *dst,
int linesize,
371 uint32_t *prev,
int plinesize)
376 int backstep = linesize - avctx->
width;
378 if (bytestream2_get_byte(gb) == 0)
398 memset(
s->blocks, 0,
sizeof(*
s->blocks) *
s->nbcount);
410 while (min < s->nbcount &&
count-- > 0) {
411 s->blocks[
min++] = fill;
419 for (y = 0; y <
s->nby; y++) {
420 for (x = 0; x <
s->nbx; x++) {
421 int sy1 = 0, sy2 = 16, sx1 = 0, sx2 = 16;
423 if (
s->blocks[y *
s->nbx + x] == 0)
426 if (((
s->blocks[y *
s->nbx + x] - 1) & 1) > 0) {
437 if (((
s->blocks[y *
s->nbx + x] - 1) & 2) > 0) {
438 int i, j, by = y * 16, bx = x * 16;
449 if (by + mvy + sy1 < 0 || bx + mvx + sx1 < 0 ||
450 by + mvy + sy1 >= avctx->
height || bx + mvx + sx1 >= avctx->
width)
453 for (
i = 0;
i < sy2 - sy1 && (by + sy1 +
i) < avctx->
height && (by + mvy + sy1 +
i) < avctx->
height;
i++) {
454 for (j = 0; j < sx2 - sx1 && (bx + sx1 + j) < avctx->
width && (bx + mvx + sx1 + j) < avctx->
width; j++) {
455 dst[(by +
i + sy1) * linesize + bx + sx1 + j] = prev[(by + mvy + sy1 +
i) * plinesize + bx + sx1 + mvx + j];
459 int run, bx = x * 16 + sx1, by = y * 16 + sy1;
460 uint32_t
r,
g,
b, clr, ptype = 0;
462 for (; by < y * 16 + sy2 && by < avctx->
height;) {
471 clr = (
b << 16) + (
g << 8) +
r;
482 dst, prev, linesize, plinesize, &bx, &by,
483 backstep, sx1, sx2, &cx, &cx1);
512 type = bytestream2_peek_byte(gb);
518 frame->key_frame = 1;
520 s->current_frame->linesize[0] / 4);
521 }
else if (
type == 18) {
525 frame->key_frame = 1;
527 s->current_frame->linesize[0] / 4);
528 }
else if (
type == 34) {
529 frame->key_frame = 1;
532 s->current_frame->linesize[0] / 4);
533 }
else if (
type == 17 ||
type == 33) {
534 uint32_t clr, *dst = (uint32_t *)
s->current_frame->data[0];
537 frame->key_frame = 1;
540 uint16_t
value = bytestream2_get_le16(gb);
546 clr = (
r << 16) + (
g << 8) +
b;
548 clr = bytestream2_get_le24(gb);
550 for (y = 0; y < avctx->
height; y++) {
553 dst +=
s->current_frame->linesize[0] / 4;
555 }
else if (
type == 0 ||
type == 1) {
556 frame->key_frame = 0;
558 if (
s->version == 1 ||
s->version == 2)
560 s->current_frame->linesize[0] / 4,
561 (uint32_t *)
s->last_frame->data[0],
562 s->last_frame->linesize[0] / 4);
565 s->current_frame->linesize[0] / 4,
566 (uint32_t *)
s->last_frame->data[0],
567 s->last_frame->linesize[0] / 4);
593 for (y = 0; y < avctx->
height; y++) {
595 if (!(((uintptr_t)dst) & 7)) {
596 uint64_t *dst64 = (uint64_t *)dst;
598 for (x = 0; x <
w; x++) {
599 dst64[x] = (dst64[x] << 3) & 0xFCFCFCFCFCFCFCFCULL;
604 for (; x < avctx->
width * 4; x++) {
605 dst[x] = dst[x] << 3;
607 dst +=
frame->linesize[0];
616 frame->linesize[0] *= -1;
641 s->nbx = (avctx->
width + 15) / 16;
642 s->nby = (avctx->
height + 15) / 16;
643 s->nbcount =
s->nbx *
s->nby;
650 if (!
s->last_frame || !
s->current_frame)
#define FF_CODEC_CAP_INIT_THREADSAFE
The codec does not modify any global variables in the init function, allowing to call the init functi...
static av_cold int init(AVCodecContext *avctx)
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
#define FFSWAP(type, a, b)
static void comp(unsigned char *dst, ptrdiff_t dst_stride, unsigned char *src, ptrdiff_t src_stride, int add)
static av_cold int decode_close(AVCodecContext *avctx)
void av_frame_free(AVFrame **frame)
Free the frame and any dynamically allocated objects in it, e.g.
static int get_freq0(RangeCoder *rc, uint32_t total_freq, uint32_t *freq)
This structure describes decoded (raw) audio or video data.
trying all byte sequences megabyte in length and selecting the best looking sequence will yield cases to try But a word about which is also called distortion Distortion can be quantified by almost any quality measurement one chooses the sum of squared differences is used but more complex methods that consider psychovisual effects can be used as well It makes no difference in this discussion First step
int ff_reget_buffer(AVCodecContext *avctx, AVFrame *frame)
Identical in function to av_frame_make_writable(), except it uses ff_get_buffer() to allocate the buf...
static av_always_inline unsigned int bytestream2_get_bytes_left(GetByteContext *g)
static av_always_inline void bytestream2_skip(GetByteContext *g, unsigned int size)
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_LOG_ERROR
Something went wrong and cannot losslessly be recovered.
static int decompress_p(AVCodecContext *avctx, uint32_t *dst, int linesize, uint32_t *prev, int plinesize)
void av_memcpy_backptr(uint8_t *dst, int back, int cnt)
Overlapping memcpy() implementation.
static int op(uint8_t **dst, const uint8_t *dst_end, GetByteContext *gb, int pixel, int count, int *x, int width, int linesize)
Perform decode operation.
static int decode_run_i(AVCodecContext *avctx, uint32_t ptype, int run, int *px, int *py, uint32_t clr, uint32_t *dst, int linesize, uint32_t *plx, uint32_t *ply, uint32_t backstep, int off, int *cx, int *cx1)
static av_cold int decode_init(AVCodecContext *avctx)
#define AVERROR_PATCHWELCOME
Not yet implemented in FFmpeg, patches welcome.
@ AV_PICTURE_TYPE_I
Intra.
static int get_freq(RangeCoder *rc, uint32_t total_freq, uint32_t *freq)
@ AV_PIX_FMT_BGR0
packed BGR 8:8:8, 32bpp, BGRXBGRX... X=unused/undefined
static void reinit_tables(SCPRContext *s)
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 int decode_frame(AVCodecContext *avctx, void *data, int *got_frame, AVPacket *avpkt)
static int decompress_i(AVCodecContext *avctx, uint32_t *dst, int linesize)
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() 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.
int av_frame_ref(AVFrame *dst, const AVFrame *src)
Set up a new reference to the data described by the source frame.
int av_frame_copy(AVFrame *dst, const AVFrame *src)
Copy the frame data from src to dst.
static int decode_run_p(AVCodecContext *avctx, uint32_t ptype, int run, int x, int y, uint32_t clr, uint32_t *dst, uint32_t *prev, int linesize, int plinesize, uint32_t *bx, uint32_t *by, uint32_t backstep, int sx1, int sx2, int *cx, int *cx1)
static int decode_value(SCPRContext *s, uint32_t *cnt, uint32_t maxc, uint32_t step, uint32_t *rval)
@ AV_PIX_FMT_RGB0
packed RGB 8:8:8, 32bpp, RGBXRGBX... X=unused/undefined
static int decode_units(SCPRContext *s, uint32_t *r, uint32_t *g, uint32_t *b, int *cx, int *cx1)
static int decompress_i3(AVCodecContext *avctx, uint32_t *dst, int linesize)
int bits_per_coded_sample
bits per sample/pixel from the demuxer (needed for huffyuv).
#define i(width, name, range_min, range_max)
#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 decode_unit(SCPRContext *s, PixelModel *pixel, uint32_t step, uint32_t *rval)
#define av_malloc_array(a, b)
static int decompress_p3(AVCodecContext *avctx, uint32_t *dst, int linesize, uint32_t *prev, int plinesize)
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
const char * name
Name of the codec implementation.
enum AVPixelFormat pix_fmt
Pixel format, see AV_PIX_FMT_xxx.
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 decode0(GetByteContext *gb, RangeCoder *rc, uint32_t cumFreq, uint32_t freq, uint32_t total_freq)
static int decode(GetByteContext *gb, RangeCoder *rc, uint32_t cumFreq, uint32_t freq, uint32_t total_freq)
main external API structure.
@ AV_PICTURE_TYPE_P
Predicted.
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)
#define AVERROR_INVALIDDATA
Invalid data found when processing input.
static void init_rangecoder(RangeCoder *rc, GetByteContext *gb)