falkTX
/
FFmpeg
mirror of https://github.com/falkTX/FFmpeg.git
1
0
Fork 0
Code Issues 0 Releases 338 Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
56209 Commits
32 Branches
646MB
Tree: d510d70df0
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'd510d70df0'
${ noResults }
FFmpeg/libavcodec/smacker.c

821 lines
25KB
Raw Blame History 

  1. /*

  2.  * Smacker decoder

  3.  * Copyright (c) 2006 Konstantin Shishkov

  4.  *

  5.  * This file is part of FFmpeg.

  6.  *

  7.  * FFmpeg is free software; you can redistribute it and/or

  8.  * modify it under the terms of the GNU Lesser General Public

  9.  * License as published by the Free Software Foundation; either

  10.  * version 2.1 of the License, or (at your option) any later version.

  11.  *

  12.  * FFmpeg is distributed in the hope that it will be useful,

  13.  * but WITHOUT ANY WARRANTY; without even the implied warranty of

  14.  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU

  15.  * Lesser General Public License for more details.

  16.  *

  17.  * You should have received a copy of the GNU Lesser General Public

  18.  * License along with FFmpeg; if not, write to the Free Software

  19.  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA

  20.  */

  21. 

  22. /**

  23.  * @file

  24.  * Smacker decoder

  25.  */

  26. 

  27. /*

  28.  * Based on http://wiki.multimedia.cx/index.php?title=Smacker

  29.  */

  30. 

  31. #include <stdio.h>

  32. #include <stdlib.h>

  33. 

  34. #include "libavutil/channel_layout.h"

  35. #include "avcodec.h"

  36. #include "internal.h"

  37. #include "mathops.h"

  38. 

  39. #define BITSTREAM_READER_LE

  40. #include "get_bits.h"

  41. #include "bytestream.h"

  42. 

  43. #define SMKTREE_BITS 9

  44. #define SMK_NODE 0x80000000

  45. 

  46. /*

  47.  * Decoder context

  48.  */

  49. typedef struct SmackVContext {

  50.     AVCodecContext *avctx;

  51.     AVFrame *pic;

  52. 

  53.     int *mmap_tbl, *mclr_tbl, *full_tbl, *type_tbl;

  54.     int mmap_last[3], mclr_last[3], full_last[3], type_last[3];

  55. } SmackVContext;

  56. 

  57. /**

  58.  * Context used for code reconstructing

  59.  */

  60. typedef struct HuffContext {

  61.     int length;

  62.     int maxlength;

  63.     int current;

  64.     uint32_t *bits;

  65.     int *lengths;

  66.     int *values;

  67. } HuffContext;

  68. 

  69. /* common parameters used for decode_bigtree */

  70. typedef struct DBCtx {

  71.     VLC *v1, *v2;

  72.     int *recode1, *recode2;

  73.     int escapes[3];

  74.     int *last;

  75.     int lcur;

  76. } DBCtx;

  77. 

  78. /* possible runs of blocks */

  79. static const int block_runs[64] = {

  80.       1,    2,    3,    4,    5,    6,    7,    8,

  81.       9,   10,   11,   12,   13,   14,   15,   16,

  82.      17,   18,   19,   20,   21,   22,   23,   24,

  83.      25,   26,   27,   28,   29,   30,   31,   32,

  84.      33,   34,   35,   36,   37,   38,   39,   40,

  85.      41,   42,   43,   44,   45,   46,   47,   48,

  86.      49,   50,   51,   52,   53,   54,   55,   56,

  87.      57,   58,   59,  128,  256,  512, 1024, 2048 };

  88. 

  89. enum SmkBlockTypes {

  90.     SMK_BLK_MONO = 0,

  91.     SMK_BLK_FULL = 1,

  92.     SMK_BLK_SKIP = 2,

  93.     SMK_BLK_FILL = 3 };

  94. 

  95. /**

  96.  * Decode local frame tree

  97.  */

  98. static int smacker_decode_tree(GetBitContext *gb, HuffContext *hc, uint32_t prefix, int length)

  99. {

  100.     if(length > 32 || length > 3*SMKTREE_BITS) {

  101.         av_log(NULL, AV_LOG_ERROR, "length too long\n");

  102.         return AVERROR_INVALIDDATA;

  103.     }

  104.     if(!get_bits1(gb)){ //Leaf

  105.         if(hc->current >= 256){

  106.             av_log(NULL, AV_LOG_ERROR, "Tree size exceeded!\n");

  107.             return AVERROR_INVALIDDATA;

  108.         }

  109.         if(length){

  110.             hc->bits[hc->current] = prefix;

  111.             hc->lengths[hc->current] = length;

  112.         } else {

  113.             hc->bits[hc->current] = 0;

  114.             hc->lengths[hc->current] = 0;

  115.         }

  116.         hc->values[hc->current] = get_bits(gb, 8);

  117.         hc->current++;

  118.         if(hc->maxlength < length)

  119.             hc->maxlength = length;

  120.         return 0;

  121.     } else { //Node

  122.         int r;

  123.         length++;

  124.         r = smacker_decode_tree(gb, hc, prefix, length);

  125.         if(r)

  126.             return r;

  127.         return smacker_decode_tree(gb, hc, prefix | (1 << (length - 1)), length);

  128.     }

  129. }

  130. 

  131. /**

  132.  * Decode header tree

  133.  */

  134. static int smacker_decode_bigtree(GetBitContext *gb, HuffContext *hc, DBCtx *ctx)

  135. {

  136.     if (hc->current + 1 >= hc->length) {

  137.         av_log(NULL, AV_LOG_ERROR, "Tree size exceeded!\n");

  138.         return AVERROR_INVALIDDATA;

  139.     }

  140.     if(!get_bits1(gb)){ //Leaf

  141.         int val, i1, i2;

  142.         i1 = ctx->v1->table ? get_vlc2(gb, ctx->v1->table, SMKTREE_BITS, 3) : 0;

  143.         i2 = ctx->v2->table ? get_vlc2(gb, ctx->v2->table, SMKTREE_BITS, 3) : 0;

  144.         if (i1 < 0 || i2 < 0)

  145.             return AVERROR_INVALIDDATA;

  146.         val = ctx->recode1[i1] | (ctx->recode2[i2] << 8);

  147.         if(val == ctx->escapes[0]) {

  148.             ctx->last[0] = hc->current;

  149.             val = 0;

  150.         } else if(val == ctx->escapes[1]) {

  151.             ctx->last[1] = hc->current;

  152.             val = 0;

  153.         } else if(val == ctx->escapes[2]) {

  154.             ctx->last[2] = hc->current;

  155.             val = 0;

  156.         }

  157. 

  158.         hc->values[hc->current++] = val;

  159.         return 1;

  160.     } else { //Node

  161.         int r = 0, r_new, t;

  162. 

  163.         t = hc->current++;

  164.         r = smacker_decode_bigtree(gb, hc, ctx);

  165.         if(r < 0)

  166.             return r;

  167.         hc->values[t] = SMK_NODE | r;

  168.         r++;

  169.         r_new = smacker_decode_bigtree(gb, hc, ctx);

  170.         if (r_new < 0)

  171.             return r_new;

  172.         return r + r_new;

  173.     }

  174. }

  175. 

  176. /**

  177.  * Store large tree as FFmpeg's vlc codes

  178.  */

  179. static int smacker_decode_header_tree(SmackVContext *smk, GetBitContext *gb, int **recodes, int *last, int size)

  180. {

  181.     int res;

  182.     HuffContext huff;

  183.     HuffContext tmp1, tmp2;

  184.     VLC vlc[2] = { { 0 } };

  185.     int escapes[3];

  186.     DBCtx ctx;

  187.     int err = 0;

  188. 

  189.     if(size >= UINT_MAX>>4){ // (((size + 3) >> 2) + 3) << 2 must not overflow

  190.         av_log(smk->avctx, AV_LOG_ERROR, "size too large\n");

  191.         return AVERROR_INVALIDDATA;

  192.     }

  193. 

  194.     tmp1.length = 256;

  195.     tmp1.maxlength = 0;

  196.     tmp1.current = 0;

  197.     tmp1.bits = av_mallocz(256 * 4);

  198.     tmp1.lengths = av_mallocz(256 * sizeof(int));

  199.     tmp1.values = av_mallocz(256 * sizeof(int));

  200. 

  201.     tmp2.length = 256;

  202.     tmp2.maxlength = 0;

  203.     tmp2.current = 0;

  204.     tmp2.bits = av_mallocz(256 * 4);

  205.     tmp2.lengths = av_mallocz(256 * sizeof(int));

  206.     tmp2.values = av_mallocz(256 * sizeof(int));

  207.     if (!tmp1.bits || !tmp1.lengths || !tmp1.values ||

  208.         !tmp2.bits || !tmp2.lengths || !tmp2.values) {

  209.         err = AVERROR(ENOMEM);

  210.         goto error;

  211.     }

  212. 

  213.     if(get_bits1(gb)) {

  214.         res = smacker_decode_tree(gb, &tmp1, 0, 0);

  215.         if (res < 0)

  216.             return res;

  217.         skip_bits1(gb);

  218.         if(tmp1.current > 1) {

  219.             res = init_vlc(&vlc[0], SMKTREE_BITS, tmp1.length,

  220.                         tmp1.lengths, sizeof(int), sizeof(int),

  221.                         tmp1.bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);

  222.             if(res < 0) {

  223.                 av_log(smk->avctx, AV_LOG_ERROR, "Cannot build VLC table\n");

  224.                 err = res;

  225.                 goto error;

  226.             }

  227.         }

  228.     }

  229.     if (!vlc[0].table) {

  230.         av_log(smk->avctx, AV_LOG_ERROR, "Skipping low bytes tree\n");

  231.     }

  232.     if(get_bits1(gb)){

  233.         res = smacker_decode_tree(gb, &tmp2, 0, 0);

  234.         if (res < 0)

  235.             return res;

  236.         skip_bits1(gb);

  237.         if(tmp2.current > 1) {

  238.             res = init_vlc(&vlc[1], SMKTREE_BITS, tmp2.length,

  239.                         tmp2.lengths, sizeof(int), sizeof(int),

  240.                         tmp2.bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);

  241.             if(res < 0) {

  242.                 av_log(smk->avctx, AV_LOG_ERROR, "Cannot build VLC table\n");

  243.                 err = res;

  244.                 goto error;

  245.             }

  246.         }

  247.     }

  248.     if (!vlc[1].table) {

  249.         av_log(smk->avctx, AV_LOG_ERROR, "Skipping high bytes tree\n");

  250.     }

  251. 

  252.     escapes[0]  = get_bits(gb, 16);

  253.     escapes[1]  = get_bits(gb, 16);

  254.     escapes[2]  = get_bits(gb, 16);

  255. 

  256.     last[0] = last[1] = last[2] = -1;

  257. 

  258.     ctx.escapes[0] = escapes[0];

  259.     ctx.escapes[1] = escapes[1];

  260.     ctx.escapes[2] = escapes[2];

  261.     ctx.v1 = &vlc[0];

  262.     ctx.v2 = &vlc[1];

  263.     ctx.recode1 = tmp1.values;

  264.     ctx.recode2 = tmp2.values;

  265.     ctx.last = last;

  266. 

  267.     huff.length = ((size + 3) >> 2) + 4;

  268.     huff.maxlength = 0;

  269.     huff.current = 0;

  270.     huff.values = av_mallocz(huff.length * sizeof(int));

  271.     if (!huff.values) {

  272.         err = AVERROR(ENOMEM);

  273.         goto error;

  274.     }

  275. 

  276.     if (smacker_decode_bigtree(gb, &huff, &ctx) < 0)

  277.         err = -1;

  278.     skip_bits1(gb);

  279.     if(ctx.last[0] == -1) ctx.last[0] = huff.current++;

  280.     if(ctx.last[1] == -1) ctx.last[1] = huff.current++;

  281.     if(ctx.last[2] == -1) ctx.last[2] = huff.current++;

  282.     if(huff.current > huff.length){

  283.         ctx.last[0] = ctx.last[1] = ctx.last[2] = 1;

  284.         av_log(smk->avctx, AV_LOG_ERROR, "bigtree damaged\n");

  285.         return AVERROR_INVALIDDATA;

  286.     }

  287. 

  288.     *recodes = huff.values;

  289. 

  290. error:

  291.     if(vlc[0].table)

  292.         ff_free_vlc(&vlc[0]);

  293.     if(vlc[1].table)

  294.         ff_free_vlc(&vlc[1]);

  295.     av_free(tmp1.bits);

  296.     av_free(tmp1.lengths);

  297.     av_free(tmp1.values);

  298.     av_free(tmp2.bits);

  299.     av_free(tmp2.lengths);

  300.     av_free(tmp2.values);

  301. 

  302.     return err;

  303. }

  304. 

  305. static int decode_header_trees(SmackVContext *smk) {

  306.     GetBitContext gb;

  307.     int mmap_size, mclr_size, full_size, type_size, ret;

  308. 

  309.     mmap_size = AV_RL32(smk->avctx->extradata);

  310.     mclr_size = AV_RL32(smk->avctx->extradata + 4);

  311.     full_size = AV_RL32(smk->avctx->extradata + 8);

  312.     type_size = AV_RL32(smk->avctx->extradata + 12);

  313. 

  314.     init_get_bits(&gb, smk->avctx->extradata + 16, (smk->avctx->extradata_size - 16) * 8);

  315. 

  316.     if(!get_bits1(&gb)) {

  317.         av_log(smk->avctx, AV_LOG_INFO, "Skipping MMAP tree\n");

  318.         smk->mmap_tbl = av_malloc(sizeof(int) * 2);

  319.         if (!smk->mmap_tbl)

  320.             return AVERROR(ENOMEM);

  321.         smk->mmap_tbl[0] = 0;

  322.         smk->mmap_last[0] = smk->mmap_last[1] = smk->mmap_last[2] = 1;

  323.     } else {

  324.         ret = smacker_decode_header_tree(smk, &gb, &smk->mmap_tbl, smk->mmap_last, mmap_size);

  325.         if (ret < 0)

  326.             return ret;

  327.     }

  328.     if(!get_bits1(&gb)) {

  329.         av_log(smk->avctx, AV_LOG_INFO, "Skipping MCLR tree\n");

  330.         smk->mclr_tbl = av_malloc(sizeof(int) * 2);

  331.         if (!smk->mclr_tbl)

  332.             return AVERROR(ENOMEM);

  333.         smk->mclr_tbl[0] = 0;

  334.         smk->mclr_last[0] = smk->mclr_last[1] = smk->mclr_last[2] = 1;

  335.     } else {

  336.         ret = smacker_decode_header_tree(smk, &gb, &smk->mclr_tbl, smk->mclr_last, mclr_size);

  337.         if (ret < 0)

  338.             return ret;

  339.     }

  340.     if(!get_bits1(&gb)) {

  341.         av_log(smk->avctx, AV_LOG_INFO, "Skipping FULL tree\n");

  342.         smk->full_tbl = av_malloc(sizeof(int) * 2);

  343.         if (!smk->full_tbl)

  344.             return AVERROR(ENOMEM);

  345.         smk->full_tbl[0] = 0;

  346.         smk->full_last[0] = smk->full_last[1] = smk->full_last[2] = 1;

  347.     } else {

  348.         ret = smacker_decode_header_tree(smk, &gb, &smk->full_tbl, smk->full_last, full_size);

  349.         if (ret < 0)

  350.             return ret;

  351.     }

  352.     if(!get_bits1(&gb)) {

  353.         av_log(smk->avctx, AV_LOG_INFO, "Skipping TYPE tree\n");

  354.         smk->type_tbl = av_malloc(sizeof(int) * 2);

  355.         if (!smk->type_tbl)

  356.             return AVERROR(ENOMEM);

  357.         smk->type_tbl[0] = 0;

  358.         smk->type_last[0] = smk->type_last[1] = smk->type_last[2] = 1;

  359.     } else {

  360.         ret = smacker_decode_header_tree(smk, &gb, &smk->type_tbl, smk->type_last, type_size);

  361.         if (ret < 0)

  362.             return ret;

  363.     }

  364. 

  365.     return 0;

  366. }

  367. 

  368. static av_always_inline void last_reset(int *recode, int *last) {

  369.     recode[last[0]] = recode[last[1]] = recode[last[2]] = 0;

  370. }

  371. 

  372. /* get code and update history */

  373. static av_always_inline int smk_get_code(GetBitContext *gb, int *recode, int *last) {

  374.     register int *table = recode;

  375.     int v;

  376. 

  377.     while(*table & SMK_NODE) {

  378.         if(get_bits1(gb))

  379.             table += (*table) & (~SMK_NODE);

  380.         table++;

  381.     }

  382.     v = *table;

  383. 

  384.     if(v != recode[last[0]]) {

  385.         recode[last[2]] = recode[last[1]];

  386.         recode[last[1]] = recode[last[0]];

  387.         recode[last[0]] = v;

  388.     }

  389.     return v;

  390. }

  391. 

  392. static int decode_frame(AVCodecContext *avctx, void *data, int *got_frame,

  393.                         AVPacket *avpkt)

  394. {

  395.     SmackVContext * const smk = avctx->priv_data;

  396.     uint8_t *out;

  397.     uint32_t *pal;

  398.     GetByteContext gb2;

  399.     GetBitContext gb;

  400.     int blocks, blk, bw, bh;

  401.     int i, ret;

  402.     int stride;

  403.     int flags;

  404. 

  405.     if (avpkt->size <= 769)

  406.         return AVERROR_INVALIDDATA;

  407. 

  408.     if ((ret = ff_reget_buffer(avctx, smk->pic)) < 0)

  409.         return ret;

  410. 

  411.     /* make the palette available on the way out */

  412.     pal = (uint32_t*)smk->pic->data[1];

  413.     bytestream2_init(&gb2, avpkt->data, avpkt->size);

  414.     flags = bytestream2_get_byteu(&gb2);

  415.     smk->pic->palette_has_changed = flags & 1;

  416.     smk->pic->key_frame = !!(flags & 2);

  417.     if (smk->pic->key_frame)

  418.         smk->pic->pict_type = AV_PICTURE_TYPE_I;

  419.     else

  420.         smk->pic->pict_type = AV_PICTURE_TYPE_P;

  421. 

  422.     for(i = 0; i < 256; i++)

  423.         *pal++ = 0xFFU << 24 | bytestream2_get_be24u(&gb2);

  424. 

  425.     last_reset(smk->mmap_tbl, smk->mmap_last);

  426.     last_reset(smk->mclr_tbl, smk->mclr_last);

  427.     last_reset(smk->full_tbl, smk->full_last);

  428.     last_reset(smk->type_tbl, smk->type_last);

  429.     init_get_bits(&gb, avpkt->data + 769, (avpkt->size - 769) * 8);

  430. 

  431.     blk = 0;

  432.     bw = avctx->width >> 2;

  433.     bh = avctx->height >> 2;

  434.     blocks = bw * bh;

  435.     out = smk->pic->data[0];

  436.     stride = smk->pic->linesize[0];

  437.     while(blk < blocks) {

  438.         int type, run, mode;

  439.         uint16_t pix;

  440. 

  441.         type = smk_get_code(&gb, smk->type_tbl, smk->type_last);

  442.         run = block_runs[(type >> 2) & 0x3F];

  443.         switch(type & 3){

  444.         case SMK_BLK_MONO:

  445.             while(run-- && blk < blocks){

  446.                 int clr, map;

  447.                 int hi, lo;

  448.                 clr = smk_get_code(&gb, smk->mclr_tbl, smk->mclr_last);

  449.                 map = smk_get_code(&gb, smk->mmap_tbl, smk->mmap_last);

  450.                 out = smk->pic->data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;

  451.                 hi = clr >> 8;

  452.                 lo = clr & 0xFF;

  453.                 for(i = 0; i < 4; i++) {

  454.                     if(map & 1) out[0] = hi; else out[0] = lo;

  455.                     if(map & 2) out[1] = hi; else out[1] = lo;

  456.                     if(map & 4) out[2] = hi; else out[2] = lo;

  457.                     if(map & 8) out[3] = hi; else out[3] = lo;

  458.                     map >>= 4;

  459.                     out += stride;

  460.                 }

  461.                 blk++;

  462.             }

  463.             break;

  464.         case SMK_BLK_FULL:

  465.             mode = 0;

  466.             if(avctx->codec_tag == MKTAG('S', 'M', 'K', '4')) { // In case of Smacker v4 we have three modes

  467.                 if(get_bits1(&gb)) mode = 1;

  468.                 else if(get_bits1(&gb)) mode = 2;

  469.             }

  470.             while(run-- && blk < blocks){

  471.                 out = smk->pic->data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;

  472.                 switch(mode){

  473.                 case 0:

  474.                     for(i = 0; i < 4; i++) {

  475.                         pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);

  476.                         AV_WL16(out+2,pix);

  477.                         pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);

  478.                         AV_WL16(out,pix);

  479.                         out += stride;

  480.                     }

  481.                     break;

  482.                 case 1:

  483.                     pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);

  484.                     out[0] = out[1] = pix & 0xFF;

  485.                     out[2] = out[3] = pix >> 8;

  486.                     out += stride;

  487.                     out[0] = out[1] = pix & 0xFF;

  488.                     out[2] = out[3] = pix >> 8;

  489.                     out += stride;

  490.                     pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);

  491.                     out[0] = out[1] = pix & 0xFF;

  492.                     out[2] = out[3] = pix >> 8;

  493.                     out += stride;

  494.                     out[0] = out[1] = pix & 0xFF;

  495.                     out[2] = out[3] = pix >> 8;

  496.                     out += stride;

  497.                     break;

  498.                 case 2:

  499.                     for(i = 0; i < 2; i++) {

  500.                         uint16_t pix1, pix2;

  501.                         pix2 = smk_get_code(&gb, smk->full_tbl, smk->full_last);

  502.                         pix1 = smk_get_code(&gb, smk->full_tbl, smk->full_last);

  503.                         AV_WL16(out,pix1);

  504.                         AV_WL16(out+2,pix2);

  505.                         out += stride;

  506.                         AV_WL16(out,pix1);

  507.                         AV_WL16(out+2,pix2);

  508.                         out += stride;

  509.                     }

  510.                     break;

  511.                 }

  512.                 blk++;

  513.             }

  514.             break;

  515.         case SMK_BLK_SKIP:

  516.             while(run-- && blk < blocks)

  517.                 blk++;

  518.             break;

  519.         case SMK_BLK_FILL:

  520.             mode = type >> 8;

  521.             while(run-- && blk < blocks){

  522.                 uint32_t col;

  523.                 out = smk->pic->data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;

  524.                 col = mode * 0x01010101;

  525.                 for(i = 0; i < 4; i++) {

  526.                     *((uint32_t*)out) = col;

  527.                     out += stride;

  528.                 }

  529.                 blk++;

  530.             }

  531.             break;

  532.         }

  533. 

  534.     }

  535. 

  536.     if ((ret = av_frame_ref(data, smk->pic)) < 0)

  537.         return ret;

  538. 

  539.     *got_frame = 1;

  540. 

  541.     /* always report that the buffer was completely consumed */

  542.     return avpkt->size;

  543. }

  544. 

  545. 

  546. 

  547. /*

  548.  *

  549.  * Init smacker decoder

  550.  *

  551.  */

  552. static av_cold int decode_init(AVCodecContext *avctx)

  553. {

  554.     SmackVContext * const c = avctx->priv_data;

  555.     int ret;

  556. 

  557.     c->avctx = avctx;

  558. 

  559.     avctx->pix_fmt = AV_PIX_FMT_PAL8;

  560. 

  561.     /* decode huffman trees from extradata */

  562.     if(avctx->extradata_size < 16){

  563.         av_log(avctx, AV_LOG_ERROR, "Extradata missing!\n");

  564.         return AVERROR(EINVAL);

  565.     }

  566. 

  567.     ret = decode_header_trees(c);

  568.     if (ret < 0)

  569.         return ret;

  570. 

  571.     c->pic = av_frame_alloc();

  572.     if (!c->pic)

  573.         return AVERROR(ENOMEM);

  574. 

  575.     return 0;

  576. }

  577. 

  578. 

  579. 

  580. /*

  581.  *

  582.  * Uninit smacker decoder

  583.  *

  584.  */

  585. static av_cold int decode_end(AVCodecContext *avctx)

  586. {

  587.     SmackVContext * const smk = avctx->priv_data;

  588. 

  589.     av_freep(&smk->mmap_tbl);

  590.     av_freep(&smk->mclr_tbl);

  591.     av_freep(&smk->full_tbl);

  592.     av_freep(&smk->type_tbl);

  593. 

  594.     av_frame_free(&smk->pic);

  595. 

  596.     return 0;

  597. }

  598. 

  599. 

  600. static av_cold int smka_decode_init(AVCodecContext *avctx)

  601. {

  602.     if (avctx->channels < 1 || avctx->channels > 2) {

  603.         av_log(avctx, AV_LOG_ERROR, "invalid number of channels\n");

  604.         return AVERROR(EINVAL);

  605.     }

  606.     avctx->channel_layout = (avctx->channels==2) ? AV_CH_LAYOUT_STEREO : AV_CH_LAYOUT_MONO;

  607.     avctx->sample_fmt = avctx->bits_per_coded_sample == 8 ? AV_SAMPLE_FMT_U8 : AV_SAMPLE_FMT_S16;

  608. 

  609.     return 0;

  610. }

  611. 

  612. /**

  613.  * Decode Smacker audio data

  614.  */

  615. static int smka_decode_frame(AVCodecContext *avctx, void *data,

  616.                              int *got_frame_ptr, AVPacket *avpkt)

  617. {

  618.     AVFrame *frame     = data;

  619.     const uint8_t *buf = avpkt->data;

  620.     int buf_size = avpkt->size;

  621.     GetBitContext gb;

  622.     HuffContext h[4] = { { 0 } };

  623.     VLC vlc[4]       = { { 0 } };

  624.     int16_t *samples;

  625.     uint8_t *samples8;

  626.     int val;

  627.     int i, res, ret;

  628.     int unp_size;

  629.     int bits, stereo;

  630.     int pred[2] = {0, 0};

  631. 

  632.     if (buf_size <= 4) {

  633.         av_log(avctx, AV_LOG_ERROR, "packet is too small\n");

  634.         return AVERROR(EINVAL);

  635.     }

  636. 

  637.     unp_size = AV_RL32(buf);

  638. 

  639.     if (unp_size > (1U<<24)) {

  640.         av_log(avctx, AV_LOG_ERROR, "packet is too big\n");

  641.         return AVERROR_INVALIDDATA;

  642.     }

  643. 

  644.     init_get_bits(&gb, buf + 4, (buf_size - 4) * 8);

  645. 

  646.     if(!get_bits1(&gb)){

  647.         av_log(avctx, AV_LOG_INFO, "Sound: no data\n");

  648.         *got_frame_ptr = 0;

  649.         return 1;

  650.     }

  651.     stereo = get_bits1(&gb);

  652.     bits = get_bits1(&gb);

  653.     if (stereo ^ (avctx->channels != 1)) {

  654.         av_log(avctx, AV_LOG_ERROR, "channels mismatch\n");

  655.         return AVERROR(EINVAL);

  656.     }

  657.     if (bits && avctx->sample_fmt == AV_SAMPLE_FMT_U8) {

  658.         av_log(avctx, AV_LOG_ERROR, "sample format mismatch\n");

  659.         return AVERROR(EINVAL);

  660.     }

  661. 

  662.     /* get output buffer */

  663.     frame->nb_samples = unp_size / (avctx->channels * (bits + 1));

  664.     if ((ret = ff_get_buffer(avctx, frame, 0)) < 0)

  665.         return ret;

  666.     samples  = (int16_t *)frame->data[0];

  667.     samples8 =            frame->data[0];

  668. 

  669.     // Initialize

  670.     for(i = 0; i < (1 << (bits + stereo)); i++) {

  671.         h[i].length = 256;

  672.         h[i].maxlength = 0;

  673.         h[i].current = 0;

  674.         h[i].bits = av_mallocz(256 * 4);

  675.         h[i].lengths = av_mallocz(256 * sizeof(int));

  676.         h[i].values = av_mallocz(256 * sizeof(int));

  677.         if (!h[i].bits || !h[i].lengths || !h[i].values) {

  678.             ret = AVERROR(ENOMEM);

  679.             goto error;

  680.         }

  681.         skip_bits1(&gb);

  682.         if (smacker_decode_tree(&gb, &h[i], 0, 0) < 0) {

  683.             ret = AVERROR_INVALIDDATA;

  684.             goto error;

  685.         }

  686.         skip_bits1(&gb);

  687.         if(h[i].current > 1) {

  688.             res = init_vlc(&vlc[i], SMKTREE_BITS, h[i].length,

  689.                     h[i].lengths, sizeof(int), sizeof(int),

  690.                     h[i].bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);

  691.             if(res < 0) {

  692.                 av_log(avctx, AV_LOG_ERROR, "Cannot build VLC table\n");

  693.                 ret = AVERROR_INVALIDDATA;

  694.                 goto error;

  695.             }

  696.         }

  697.     }

  698.     /* this codec relies on wraparound instead of clipping audio */

  699.     if(bits) { //decode 16-bit data

  700.         for(i = stereo; i >= 0; i--)

  701.             pred[i] = sign_extend(av_bswap16(get_bits(&gb, 16)), 16);

  702.         for(i = 0; i <= stereo; i++)

  703.             *samples++ = pred[i];

  704.         for(; i < unp_size / 2; i++) {

  705.             if(get_bits_left(&gb)<0)

  706.                 return AVERROR_INVALIDDATA;

  707.             if(i & stereo) {

  708.                 if(vlc[2].table)

  709.                     res = get_vlc2(&gb, vlc[2].table, SMKTREE_BITS, 3);

  710.                 else

  711.                     res = 0;

  712.                 if (res < 0) {

  713.                     av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");

  714.                     return AVERROR_INVALIDDATA;

  715.                 }

  716.                 val  = h[2].values[res];

  717.                 if(vlc[3].table)

  718.                     res = get_vlc2(&gb, vlc[3].table, SMKTREE_BITS, 3);

  719.                 else

  720.                     res = 0;

  721.                 if (res < 0) {

  722.                     av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");

  723.                     return AVERROR_INVALIDDATA;

  724.                 }

  725.                 val |= h[3].values[res] << 8;

  726.                 pred[1] += sign_extend(val, 16);

  727.                 *samples++ = pred[1];

  728.             } else {

  729.                 if(vlc[0].table)

  730.                     res = get_vlc2(&gb, vlc[0].table, SMKTREE_BITS, 3);

  731.                 else

  732.                     res = 0;

  733.                 if (res < 0) {

  734.                     av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");

  735.                     return AVERROR_INVALIDDATA;

  736.                 }

  737.                 val  = h[0].values[res];

  738.                 if(vlc[1].table)

  739.                     res = get_vlc2(&gb, vlc[1].table, SMKTREE_BITS, 3);

  740.                 else

  741.                     res = 0;

  742.                 if (res < 0) {

  743.                     av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");

  744.                     return AVERROR_INVALIDDATA;

  745.                 }

  746.                 val |= h[1].values[res] << 8;

  747.                 pred[0] += sign_extend(val, 16);

  748.                 *samples++ = pred[0];

  749.             }

  750.         }

  751.     } else { //8-bit data

  752.         for(i = stereo; i >= 0; i--)

  753.             pred[i] = get_bits(&gb, 8);

  754.         for(i = 0; i <= stereo; i++)

  755.             *samples8++ = pred[i];

  756.         for(; i < unp_size; i++) {

  757.             if(get_bits_left(&gb)<0)

  758.                 return AVERROR_INVALIDDATA;

  759.             if(i & stereo){

  760.                 if(vlc[1].table)

  761.                     res = get_vlc2(&gb, vlc[1].table, SMKTREE_BITS, 3);

  762.                 else

  763.                     res = 0;

  764.                 if (res < 0) {

  765.                     av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");

  766.                     return AVERROR_INVALIDDATA;

  767.                 }

  768.                 pred[1] += sign_extend(h[1].values[res], 8);

  769.                 *samples8++ = pred[1];

  770.             } else {

  771.                 if(vlc[0].table)

  772.                     res = get_vlc2(&gb, vlc[0].table, SMKTREE_BITS, 3);

  773.                 else

  774.                     res = 0;

  775.                 if (res < 0) {

  776.                     av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");

  777.                     return AVERROR_INVALIDDATA;

  778.                 }

  779.                 pred[0] += sign_extend(h[0].values[res], 8);

  780.                 *samples8++ = pred[0];

  781.             }

  782.         }

  783.     }

  784. 

  785.     *got_frame_ptr = 1;

  786.     ret = buf_size;

  787. 

  788. error:

  789.     for(i = 0; i < 4; i++) {

  790.         if(vlc[i].table)

  791.             ff_free_vlc(&vlc[i]);

  792.         av_free(h[i].bits);

  793.         av_free(h[i].lengths);

  794.         av_free(h[i].values);

  795.     }

  796. 

  797.     return ret;

  798. }

  799. 

  800. AVCodec ff_smacker_decoder = {

  801.     .name           = "smackvid",

  802.     .type           = AVMEDIA_TYPE_VIDEO,

  803.     .id             = AV_CODEC_ID_SMACKVIDEO,

  804.     .priv_data_size = sizeof(SmackVContext),

  805.     .init           = decode_init,

  806.     .close          = decode_end,

  807.     .decode         = decode_frame,

  808.     .capabilities   = CODEC_CAP_DR1,

  809.     .long_name      = NULL_IF_CONFIG_SMALL("Smacker video"),

  810. };

  811. 

  812. AVCodec ff_smackaud_decoder = {

  813.     .name           = "smackaud",

  814.     .type           = AVMEDIA_TYPE_AUDIO,

  815.     .id             = AV_CODEC_ID_SMACKAUDIO,

  816.     .init           = smka_decode_init,

  817.     .decode         = smka_decode_frame,

  818.     .capabilities   = CODEC_CAP_DR1,

  819.     .long_name      = NULL_IF_CONFIG_SMALL("Smacker audio"),

  820. };