3 * ported to MPlayer by Arpi <arpi@thot.banki.hu>
4 * ported to libavcodec by Nick Kurshev <nickols_k@mail.ru>
6 * Copyright (C) 2002 the xine project
7 * Copyright (C) 2002 The FFmpeg project
9 * SVQ1 Encoder (c) 2004 Mike Melanson <melanson@pcisys.net>
11 * This file is part of Libav.
13 * Libav is free software; you can redistribute it and/or
14 * modify it under the terms of the GNU Lesser General Public
15 * License as published by the Free Software Foundation; either
16 * version 2.1 of the License, or (at your option) any later version.
18 * Libav is distributed in the hope that it will be useful,
19 * but WITHOUT ANY WARRANTY; without even the implied warranty of
20 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 * Lesser General Public License for more details.
23 * You should have received a copy of the GNU Lesser General Public
24 * License along with Libav; if not, write to the Free Software
25 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
30 * Sorenson Vector Quantizer #1 (SVQ1) video codec.
31 * For more information of the SVQ1 algorithm, visit:
32 * http://www.pcisys.net/~melanson/codecs/
36 #include "bitstream.h"
43 static VLC svq1_block_type;
44 static VLC svq1_motion_component;
45 static VLC svq1_intra_multistage[6];
46 static VLC svq1_inter_multistage[6];
47 static VLC svq1_intra_mean;
48 static VLC svq1_inter_mean;
50 /* motion vector (prediction) */
51 typedef struct svq1_pmv_s {
56 typedef struct SVQ1Context {
62 int pkt_swapped_allocated;
67 int nonref; // 1 if the current frame won't be referenced
70 static const uint8_t string_table[256] = {
71 0x00, 0xD5, 0x7F, 0xAA, 0xFE, 0x2B, 0x81, 0x54,
72 0x29, 0xFC, 0x56, 0x83, 0xD7, 0x02, 0xA8, 0x7D,
73 0x52, 0x87, 0x2D, 0xF8, 0xAC, 0x79, 0xD3, 0x06,
74 0x7B, 0xAE, 0x04, 0xD1, 0x85, 0x50, 0xFA, 0x2F,
75 0xA4, 0x71, 0xDB, 0x0E, 0x5A, 0x8F, 0x25, 0xF0,
76 0x8D, 0x58, 0xF2, 0x27, 0x73, 0xA6, 0x0C, 0xD9,
77 0xF6, 0x23, 0x89, 0x5C, 0x08, 0xDD, 0x77, 0xA2,
78 0xDF, 0x0A, 0xA0, 0x75, 0x21, 0xF4, 0x5E, 0x8B,
79 0x9D, 0x48, 0xE2, 0x37, 0x63, 0xB6, 0x1C, 0xC9,
80 0xB4, 0x61, 0xCB, 0x1E, 0x4A, 0x9F, 0x35, 0xE0,
81 0xCF, 0x1A, 0xB0, 0x65, 0x31, 0xE4, 0x4E, 0x9B,
82 0xE6, 0x33, 0x99, 0x4C, 0x18, 0xCD, 0x67, 0xB2,
83 0x39, 0xEC, 0x46, 0x93, 0xC7, 0x12, 0xB8, 0x6D,
84 0x10, 0xC5, 0x6F, 0xBA, 0xEE, 0x3B, 0x91, 0x44,
85 0x6B, 0xBE, 0x14, 0xC1, 0x95, 0x40, 0xEA, 0x3F,
86 0x42, 0x97, 0x3D, 0xE8, 0xBC, 0x69, 0xC3, 0x16,
87 0xEF, 0x3A, 0x90, 0x45, 0x11, 0xC4, 0x6E, 0xBB,
88 0xC6, 0x13, 0xB9, 0x6C, 0x38, 0xED, 0x47, 0x92,
89 0xBD, 0x68, 0xC2, 0x17, 0x43, 0x96, 0x3C, 0xE9,
90 0x94, 0x41, 0xEB, 0x3E, 0x6A, 0xBF, 0x15, 0xC0,
91 0x4B, 0x9E, 0x34, 0xE1, 0xB5, 0x60, 0xCA, 0x1F,
92 0x62, 0xB7, 0x1D, 0xC8, 0x9C, 0x49, 0xE3, 0x36,
93 0x19, 0xCC, 0x66, 0xB3, 0xE7, 0x32, 0x98, 0x4D,
94 0x30, 0xE5, 0x4F, 0x9A, 0xCE, 0x1B, 0xB1, 0x64,
95 0x72, 0xA7, 0x0D, 0xD8, 0x8C, 0x59, 0xF3, 0x26,
96 0x5B, 0x8E, 0x24, 0xF1, 0xA5, 0x70, 0xDA, 0x0F,
97 0x20, 0xF5, 0x5F, 0x8A, 0xDE, 0x0B, 0xA1, 0x74,
98 0x09, 0xDC, 0x76, 0xA3, 0xF7, 0x22, 0x88, 0x5D,
99 0xD6, 0x03, 0xA9, 0x7C, 0x28, 0xFD, 0x57, 0x82,
100 0xFF, 0x2A, 0x80, 0x55, 0x01, 0xD4, 0x7E, 0xAB,
101 0x84, 0x51, 0xFB, 0x2E, 0x7A, 0xAF, 0x05, 0xD0,
102 0xAD, 0x78, 0xD2, 0x07, 0x53, 0x86, 0x2C, 0xF9
105 #define SVQ1_PROCESS_VECTOR() \
106 for (; level > 0; i++) { \
107 /* process next depth */ \
113 /* divide block if next bit set */ \
114 if (bitstream_read_bit(bc) == 0) \
116 /* add child nodes */ \
117 list[n++] = list[i]; \
118 list[n++] = list[i] + \
119 (((level & 1) ? pitch : 1) << (level / 2 + 1)); \
122 #define SVQ1_ADD_CODEBOOK() \
123 /* add codebook entries to vector */ \
124 for (j = 0; j < stages; j++) { \
125 n3 = codebook[entries[j]] ^ 0x80808080; \
126 n1 += (n3 & 0xFF00FF00) >> 8; \
127 n2 += n3 & 0x00FF00FF; \
130 /* clip to [0..255] */ \
131 if (n1 & 0xFF00FF00) { \
132 n3 = (n1 >> 15 & 0x00010001 | 0x01000100) - 0x00010001; \
134 n1 |= (~n1 >> 15 & 0x00010001 | 0x01000100) - 0x00010001; \
135 n1 &= n3 & 0x00FF00FF; \
138 if (n2 & 0xFF00FF00) { \
139 n3 = (n2 >> 15 & 0x00010001 | 0x01000100) - 0x00010001; \
141 n2 |= (~n2 >> 15 & 0x00010001 | 0x01000100) - 0x00010001; \
142 n2 &= n3 & 0x00FF00FF; \
145 #define SVQ1_CALC_CODEBOOK_ENTRIES(cbook) \
146 codebook = (const uint32_t *)cbook[level]; \
148 bit_cache = bitstream_read(bc, 4 * stages); \
149 /* calculate codebook entries for this vector */ \
150 for (j = 0; j < stages; j++) { \
151 entries[j] = (((bit_cache >> (4 * (stages - j - 1))) & 0xF) + \
152 16 * j) << (level + 1); \
154 mean -= stages * 128; \
155 n4 = mean + (mean >> 31) << 16 | (mean & 0xFFFF);
157 static int svq1_decode_block_intra(BitstreamContext *bc, uint8_t *pixels,
163 const uint32_t *codebook;
167 unsigned x, y, width, height, level;
168 uint32_t n1, n2, n3, n4;
170 /* initialize list for breadth first processing of vectors */
173 /* recursively process vector */
174 for (i = 0, m = 1, n = 1, level = 5; i < n; i++) {
175 SVQ1_PROCESS_VECTOR();
177 /* destination address and vector size */
178 dst = (uint32_t *)list[i];
179 width = 1 << ((4 + level) / 2);
180 height = 1 << ((3 + level) / 2);
182 /* get number of stages (-1 skips vector, 0 for mean only) */
183 stages = bitstream_read_vlc(bc, svq1_intra_multistage[level].table, 3, 3) - 1;
186 for (y = 0; y < height; y++)
187 memset(&dst[y * (pitch / 4)], 0, width);
188 continue; /* skip vector */
191 if ((stages > 0 && level >= 4) || stages < 0) {
193 "Error (svq1_decode_block_intra): invalid vector: stages=%i level=%i\n",
195 return AVERROR_INVALIDDATA; /* invalid vector */
198 mean = bitstream_read_vlc(bc, svq1_intra_mean.table, 8, 3);
201 for (y = 0; y < height; y++)
202 memset(&dst[y * (pitch / 4)], mean, width);
204 SVQ1_CALC_CODEBOOK_ENTRIES(ff_svq1_intra_codebooks);
206 for (y = 0; y < height; y++) {
207 for (x = 0; x < width / 4; x++, codebook++) {
212 dst[x] = n1 << 8 | n2;
222 static int svq1_decode_block_non_intra(BitstreamContext *bc, uint8_t *pixels,
228 const uint32_t *codebook;
232 int x, y, width, height, level;
233 uint32_t n1, n2, n3, n4;
235 /* initialize list for breadth first processing of vectors */
238 /* recursively process vector */
239 for (i = 0, m = 1, n = 1, level = 5; i < n; i++) {
240 SVQ1_PROCESS_VECTOR();
242 /* destination address and vector size */
243 dst = (uint32_t *)list[i];
244 width = 1 << ((4 + level) / 2);
245 height = 1 << ((3 + level) / 2);
247 /* get number of stages (-1 skips vector, 0 for mean only) */
248 stages = bitstream_read_vlc(bc, svq1_inter_multistage[level].table, 3, 2) - 1;
251 continue; /* skip vector */
253 if ((stages > 0 && level >= 4) || stages < 0) {
255 "Error (svq1_decode_block_non_intra): invalid vector: stages=%i level=%i\n",
257 return AVERROR_INVALIDDATA; /* invalid vector */
260 mean = bitstream_read_vlc(bc, svq1_inter_mean.table, 9, 3) - 256;
262 SVQ1_CALC_CODEBOOK_ENTRIES(ff_svq1_inter_codebooks);
264 for (y = 0; y < height; y++) {
265 for (x = 0; x < width / 4; x++, codebook++) {
267 /* add mean value to vector */
268 n1 = n4 + ((n3 & 0xFF00FF00) >> 8);
269 n2 = n4 + (n3 & 0x00FF00FF);
272 dst[x] = n1 << 8 | n2;
280 static int svq1_decode_motion_vector(BitstreamContext *bc, svq1_pmv *mv,
286 for (i = 0; i < 2; i++) {
287 /* get motion code */
288 diff = bitstream_read_vlc(bc, svq1_motion_component.table, 7, 2);
290 return AVERROR_INVALIDDATA;
292 if (bitstream_read_bit(bc))
296 /* add median of motion vector predictors and clip result */
298 mv->y = sign_extend(diff + mid_pred(pmv[0]->y, pmv[1]->y, pmv[2]->y), 6);
300 mv->x = sign_extend(diff + mid_pred(pmv[0]->x, pmv[1]->x, pmv[2]->x), 6);
306 static void svq1_skip_block(uint8_t *current, uint8_t *previous,
307 ptrdiff_t pitch, int x, int y)
313 src = &previous[x + y * pitch];
316 for (i = 0; i < 16; i++) {
317 memcpy(dst, src, 16);
323 static int svq1_motion_inter_block(HpelDSPContext *hdsp, BitstreamContext *bc,
324 uint8_t *current, uint8_t *previous,
325 ptrdiff_t pitch, svq1_pmv *motion, int x, int y,
326 int width, int height)
334 /* predict and decode motion vector */
340 pmv[1] = &motion[x / 8 + 2];
341 pmv[2] = &motion[x / 8 + 4];
344 result = svq1_decode_motion_vector(bc, &mv, pmv);
350 motion[x / 8 + 2].x =
351 motion[x / 8 + 3].x = mv.x;
353 motion[x / 8 + 2].y =
354 motion[x / 8 + 3].y = mv.y;
356 mv.x = av_clip(mv.x, -2 * x, 2 * (width - x - 16));
357 mv.y = av_clip(mv.y, -2 * y, 2 * (height - y - 16));
359 src = &previous[(x + (mv.x >> 1)) + (y + (mv.y >> 1)) * pitch];
362 hdsp->put_pixels_tab[0][(mv.y & 1) << 1 | (mv.x & 1)](dst, src, pitch, 16);
367 static int svq1_motion_inter_4v_block(HpelDSPContext *hdsp, BitstreamContext *bc,
368 uint8_t *current, uint8_t *previous,
369 ptrdiff_t pitch, svq1_pmv *motion, int x, int y,
370 int width, int height)
378 /* predict and decode motion vector (0) */
384 pmv[1] = &motion[(x / 8) + 2];
385 pmv[2] = &motion[(x / 8) + 4];
388 result = svq1_decode_motion_vector(bc, &mv, pmv);
393 /* predict and decode motion vector (1) */
399 pmv[1] = &motion[(x / 8) + 3];
401 result = svq1_decode_motion_vector(bc, &motion[0], pmv);
406 /* predict and decode motion vector (2) */
408 pmv[2] = &motion[(x / 8) + 1];
410 result = svq1_decode_motion_vector(bc, &motion[(x / 8) + 2], pmv);
415 /* predict and decode motion vector (3) */
416 pmv[2] = &motion[(x / 8) + 2];
417 pmv[3] = &motion[(x / 8) + 3];
419 result = svq1_decode_motion_vector(bc, pmv[3], pmv);
424 /* form predictions */
425 for (i = 0; i < 4; i++) {
426 int mvx = pmv[i]->x + (i & 1) * 16;
427 int mvy = pmv[i]->y + (i >> 1) * 16;
429 // FIXME: clipping or padding?
430 mvx = av_clip(mvx, -2 * x, 2 * (width - x - 8));
431 mvy = av_clip(mvy, -2 * y, 2 * (height - y - 8));
433 src = &previous[(x + (mvx >> 1)) + (y + (mvy >> 1)) * pitch];
436 hdsp->put_pixels_tab[1][((mvy & 1) << 1) | (mvx & 1)](dst, src, pitch, 8);
438 /* select next block */
440 current += 8 * (pitch - 1);
448 static int svq1_decode_delta_block(AVCodecContext *avctx, HpelDSPContext *hdsp,
449 BitstreamContext *bc,
450 uint8_t *current, uint8_t *previous,
451 ptrdiff_t pitch, svq1_pmv *motion, int x, int y,
452 int width, int height)
458 block_type = bitstream_read_vlc(bc, svq1_block_type.table, 2, 2);
460 /* reset motion vectors */
461 if (block_type == SVQ1_BLOCK_SKIP || block_type == SVQ1_BLOCK_INTRA) {
464 motion[x / 8 + 2].x =
465 motion[x / 8 + 2].y =
466 motion[x / 8 + 3].x =
467 motion[x / 8 + 3].y = 0;
470 switch (block_type) {
471 case SVQ1_BLOCK_SKIP:
472 svq1_skip_block(current, previous, pitch, x, y);
475 case SVQ1_BLOCK_INTER:
476 result = svq1_motion_inter_block(hdsp, bc, current, previous,
477 pitch, motion, x, y, width, height);
480 ff_dlog(avctx, "Error in svq1_motion_inter_block %i\n", result);
483 result = svq1_decode_block_non_intra(bc, current, pitch);
486 case SVQ1_BLOCK_INTER_4V:
487 result = svq1_motion_inter_4v_block(hdsp, bc, current, previous,
488 pitch, motion, x, y, width, height);
491 ff_dlog(avctx, "Error in svq1_motion_inter_4v_block %i\n", result);
494 result = svq1_decode_block_non_intra(bc, current, pitch);
497 case SVQ1_BLOCK_INTRA:
498 result = svq1_decode_block_intra(bc, current, pitch);
505 static void svq1_parse_string(BitstreamContext *bc, uint8_t *out)
510 out[0] = bitstream_read(bc, 8);
511 seed = string_table[out[0]];
513 for (i = 1; i <= out[0]; i++) {
514 out[i] = bitstream_read(bc, 8) ^ seed;
515 seed = string_table[out[i] ^ seed];
519 static int svq1_decode_frame_header(AVCodecContext *avctx, AVFrame *frame)
521 SVQ1Context *s = avctx->priv_data;
522 BitstreamContext *bc = &s->bc;
525 bitstream_skip(bc, 8); /* temporal_reference */
529 switch (bitstream_read(bc, 2)) {
531 frame->pict_type = AV_PICTURE_TYPE_I;
536 frame->pict_type = AV_PICTURE_TYPE_P;
539 av_log(avctx, AV_LOG_ERROR, "Invalid frame type.\n");
540 return AVERROR_INVALIDDATA;
543 if (frame->pict_type == AV_PICTURE_TYPE_I) {
545 if (s->frame_code == 0x50 || s->frame_code == 0x60) {
546 int csum = bitstream_read(bc, 16);
548 csum = ff_svq1_packet_checksum(bc->buffer, bc->size_in_bits >> 3,
551 ff_dlog(avctx, "%s checksum (%02x) for packet data\n",
552 (csum == 0) ? "correct" : "incorrect", csum);
555 if ((s->frame_code ^ 0x10) >= 0x50) {
558 svq1_parse_string(bc, msg);
560 av_log(avctx, AV_LOG_INFO,
561 "embedded message: \"%s\"\n", (char *)msg);
564 bitstream_skip(bc, 2);
565 bitstream_skip(bc, 2);
566 bitstream_skip(bc, 1);
568 /* load frame size */
569 frame_size_code = bitstream_read(bc, 3);
571 if (frame_size_code == 7) {
572 /* load width, height (12 bits each) */
573 s->width = bitstream_read(bc, 12);
574 s->height = bitstream_read(bc, 12);
576 if (!s->width || !s->height)
577 return AVERROR_INVALIDDATA;
579 /* get width, height from table */
580 s->width = ff_svq1_frame_size_table[frame_size_code][0];
581 s->height = ff_svq1_frame_size_table[frame_size_code][1];
586 if (bitstream_read_bit(bc) == 1) {
587 bitstream_skip(bc, 1); /* use packet checksum if (1) */
588 bitstream_skip(bc, 1); /* component checksums after image data if (1) */
590 if (bitstream_read(bc, 2) != 0)
591 return AVERROR_INVALIDDATA;
594 if (bitstream_read_bit(bc) == 1) {
595 bitstream_skip(bc, 1);
596 bitstream_skip(bc, 4);
597 bitstream_skip(bc, 1);
598 bitstream_skip(bc, 2);
600 while (bitstream_read_bit(bc) == 1)
601 bitstream_skip(bc, 8);
607 static int svq1_decode_frame(AVCodecContext *avctx, void *data,
608 int *got_frame, AVPacket *avpkt)
610 const uint8_t *buf = avpkt->data;
611 int buf_size = avpkt->size;
612 SVQ1Context *s = avctx->priv_data;
615 int result, i, x, y, width, height;
618 /* initialize bit buffer */
619 bitstream_init8(&s->bc, buf, buf_size);
621 /* decode frame header */
622 s->frame_code = bitstream_read(&s->bc, 22);
624 if ((s->frame_code & ~0x70) || !(s->frame_code & 0x60))
625 return AVERROR_INVALIDDATA;
627 /* swap some header bytes (why?) */
628 if (s->frame_code != 0x20) {
631 if (buf_size < 9 * 4) {
632 av_log(avctx, AV_LOG_ERROR, "Input packet too small\n");
633 return AVERROR_INVALIDDATA;
636 av_fast_padded_malloc(&s->pkt_swapped,
637 &s->pkt_swapped_allocated,
640 return AVERROR(ENOMEM);
642 memcpy(s->pkt_swapped, buf, buf_size);
643 buf = s->pkt_swapped;
645 src = (uint32_t *)(s->pkt_swapped + 4);
647 for (i = 0; i < 4; i++)
648 src[i] = ((src[i] << 16) | (src[i] >> 16)) ^ src[7 - i];
650 bitstream_init8(&s->bc, buf, buf_size);
651 bitstream_skip(&s->bc, 22);
654 result = svq1_decode_frame_header(avctx, cur);
657 ff_dlog(avctx, "Error in svq1_decode_frame_header %i\n", result);
661 result = ff_set_dimensions(avctx, s->width, s->height);
665 if ((avctx->skip_frame >= AVDISCARD_NONREF && s->nonref) ||
666 (avctx->skip_frame >= AVDISCARD_NONKEY &&
667 cur->pict_type != AV_PICTURE_TYPE_I) ||
668 avctx->skip_frame >= AVDISCARD_ALL)
671 result = ff_get_buffer(avctx, cur, s->nonref ? 0 : AV_GET_BUFFER_FLAG_REF);
675 pmv = av_malloc((FFALIGN(s->width, 16) / 8 + 3) * sizeof(*pmv));
677 return AVERROR(ENOMEM);
679 /* decode y, u and v components */
680 for (i = 0; i < 3; i++) {
681 int linesize = cur->linesize[i];
683 width = FFALIGN(s->width, 16);
684 height = FFALIGN(s->height, 16);
686 if (avctx->flags & AV_CODEC_FLAG_GRAY)
688 width = FFALIGN(s->width / 4, 16);
689 height = FFALIGN(s->height / 4, 16);
692 current = cur->data[i];
694 if (cur->pict_type == AV_PICTURE_TYPE_I) {
696 for (y = 0; y < height; y += 16) {
697 for (x = 0; x < width; x += 16) {
698 result = svq1_decode_block_intra(&s->bc, ¤t[x],
701 av_log(avctx, AV_LOG_INFO,
702 "Error in svq1_decode_block %i (keyframe)\n",
707 current += 16 * linesize;
711 uint8_t *previous = s->prev->data[i];
713 s->prev->width != s->width || s->prev->height != s->height) {
714 av_log(avctx, AV_LOG_ERROR, "Missing reference frame.\n");
715 result = AVERROR_INVALIDDATA;
719 memset(pmv, 0, ((width / 8) + 3) * sizeof(svq1_pmv));
721 for (y = 0; y < height; y += 16) {
722 for (x = 0; x < width; x += 16) {
723 result = svq1_decode_delta_block(avctx, &s->hdsp,
726 pmv, x, y, width, height);
729 "Error in svq1_decode_delta_block %i\n",
738 current += 16 * linesize;
744 av_frame_unref(s->prev);
745 result = av_frame_ref(s->prev, cur);
758 static av_cold int svq1_decode_init(AVCodecContext *avctx)
760 SVQ1Context *s = avctx->priv_data;
764 s->prev = av_frame_alloc();
766 return AVERROR(ENOMEM);
768 s->width = avctx->width + 3 & ~3;
769 s->height = avctx->height + 3 & ~3;
770 avctx->pix_fmt = AV_PIX_FMT_YUV410P;
772 ff_hpeldsp_init(&s->hdsp, avctx->flags);
774 INIT_VLC_STATIC(&svq1_block_type, 2, 4,
775 &ff_svq1_block_type_vlc[0][1], 2, 1,
776 &ff_svq1_block_type_vlc[0][0], 2, 1, 6);
778 INIT_VLC_STATIC(&svq1_motion_component, 7, 33,
779 &ff_mvtab[0][1], 2, 1,
780 &ff_mvtab[0][0], 2, 1, 176);
782 for (i = 0; i < 6; i++) {
783 static const uint8_t sizes[2][6] = { { 14, 10, 14, 18, 16, 18 },
784 { 10, 10, 14, 14, 14, 16 } };
785 static VLC_TYPE table[168][2];
786 svq1_intra_multistage[i].table = &table[offset];
787 svq1_intra_multistage[i].table_allocated = sizes[0][i];
788 offset += sizes[0][i];
789 init_vlc(&svq1_intra_multistage[i], 3, 8,
790 &ff_svq1_intra_multistage_vlc[i][0][1], 2, 1,
791 &ff_svq1_intra_multistage_vlc[i][0][0], 2, 1,
792 INIT_VLC_USE_NEW_STATIC);
793 svq1_inter_multistage[i].table = &table[offset];
794 svq1_inter_multistage[i].table_allocated = sizes[1][i];
795 offset += sizes[1][i];
796 init_vlc(&svq1_inter_multistage[i], 3, 8,
797 &ff_svq1_inter_multistage_vlc[i][0][1], 2, 1,
798 &ff_svq1_inter_multistage_vlc[i][0][0], 2, 1,
799 INIT_VLC_USE_NEW_STATIC);
802 INIT_VLC_STATIC(&svq1_intra_mean, 8, 256,
803 &ff_svq1_intra_mean_vlc[0][1], 4, 2,
804 &ff_svq1_intra_mean_vlc[0][0], 4, 2, 632);
806 INIT_VLC_STATIC(&svq1_inter_mean, 9, 512,
807 &ff_svq1_inter_mean_vlc[0][1], 4, 2,
808 &ff_svq1_inter_mean_vlc[0][0], 4, 2, 1434);
813 static av_cold int svq1_decode_end(AVCodecContext *avctx)
815 SVQ1Context *s = avctx->priv_data;
817 av_frame_free(&s->prev);
818 av_freep(&s->pkt_swapped);
823 static void svq1_flush(AVCodecContext *avctx)
825 SVQ1Context *s = avctx->priv_data;
827 av_frame_unref(s->prev);
830 AVCodec ff_svq1_decoder = {
832 .long_name = NULL_IF_CONFIG_SMALL("Sorenson Vector Quantizer 1 / Sorenson Video 1 / SVQ1"),
833 .type = AVMEDIA_TYPE_VIDEO,
834 .id = AV_CODEC_ID_SVQ1,
835 .priv_data_size = sizeof(SVQ1Context),
836 .init = svq1_decode_init,
837 .close = svq1_decode_end,
838 .decode = svq1_decode_frame,
839 .capabilities = AV_CODEC_CAP_DR1,
841 .pix_fmts = (const enum AVPixelFormat[]) { AV_PIX_FMT_YUV410P,