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.
88458 Commits
32 Branches
800MB
Tree: bc98788dd2
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'bc98788dd2'
${ noResults }
FFmpeg/libavcodec/smacker.c

827 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. 

  36. #define BITSTREAM_READER_LE

  37. #include "avcodec.h"

  38. #include "bytestream.h"

  39. #include "get_bits.h"

  40. #include "internal.h"

  41. #include "mathops.h"

  42. 

  43. #define SMKTREE_BITS 9

  44. #define SMK_NODE 0x80000000

  45. 

  46. 

  47. typedef struct SmackVContext {

  48.     AVCodecContext *avctx;

  49.     AVFrame *pic;

  50. 

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

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

  53. } SmackVContext;

  54. 

  55. /**

  56.  * Context used for code reconstructing

  57.  */

  58. typedef struct HuffContext {

  59.     int length;

  60.     int maxlength;

  61.     int current;

  62.     uint32_t *bits;

  63.     int *lengths;

  64.     int *values;

  65. } HuffContext;

  66. 

  67. /* common parameters used for decode_bigtree */

  68. typedef struct DBCtx {

  69.     VLC *v1, *v2;

  70.     int *recode1, *recode2;

  71.     int escapes[3];

  72.     int *last;

  73.     int lcur;

  74. } DBCtx;

  75. 

  76. /* possible runs of blocks */

  77. static const int block_runs[64] = {

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

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

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

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

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

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

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

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

  86. 

  87. enum SmkBlockTypes {

  88.     SMK_BLK_MONO = 0,

  89.     SMK_BLK_FULL = 1,

  90.     SMK_BLK_SKIP = 2,

  91.     SMK_BLK_FILL = 3 };

  92. 

  93. /**

  94.  * Decode local frame tree

  95.  */

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

  97. {

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

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

  100.         return AVERROR_INVALIDDATA;

  101.     }

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

  103.         if(hc->current >= hc->length){

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

  105.             return AVERROR_INVALIDDATA;

  106.         }

  107.         if(length){

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

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

  110.         } else {

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

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

  113.         }

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

  115.         hc->current++;

  116.         if(hc->maxlength < length)

  117.             hc->maxlength = length;

  118.         return 0;

  119.     } else { //Node

  120.         int r;

  121.         length++;

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

  123.         if(r)

  124.             return r;

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

  126.     }

  127. }

  128. 

  129. /**

  130.  * Decode header tree

  131.  */

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

  133. {

  134.     if(length > 500) { // Larger length can cause segmentation faults due to too deep recursion.

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

  136.         return AVERROR_INVALIDDATA;

  137.     }

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

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

  140.         return AVERROR_INVALIDDATA;

  141.     }

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

  143.         int val, i1, i2;

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

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

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

  147.             return AVERROR_INVALIDDATA;

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

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

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

  151.             val = 0;

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

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

  154.             val = 0;

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

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

  157.             val = 0;

  158.         }

  159. 

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

  161.         return 1;

  162.     } else { //Node

  163.         int r = 0, r_new, t;

  164. 

  165.         t = hc->current++;

  166.         r = smacker_decode_bigtree(gb, hc, ctx, length + 1);

  167.         if(r < 0)

  168.             return r;

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

  170.         r++;

  171.         r_new = smacker_decode_bigtree(gb, hc, ctx, length + 1);

  172.         if (r_new < 0)

  173.             return r_new;

  174.         return r + r_new;

  175.     }

  176. }

  177. 

  178. /**

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

  180.  */

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

  182. {

  183.     int res;

  184.     HuffContext huff;

  185.     HuffContext tmp1, tmp2;

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

  187.     int escapes[3];

  188.     DBCtx ctx;

  189.     int err = 0;

  190. 

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

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

  193.         return AVERROR_INVALIDDATA;

  194.     }

  195. 

  196.     tmp1.length = 256;

  197.     tmp1.maxlength = 0;

  198.     tmp1.current = 0;

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

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

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

  202. 

  203.     tmp2.length = 256;

  204.     tmp2.maxlength = 0;

  205.     tmp2.current = 0;

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

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

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

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

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

  211.         err = AVERROR(ENOMEM);

  212.         goto error;

  213.     }

  214. 

  215.     if(get_bits1(gb)) {

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

  217.         if (res < 0) {

  218.             err = res;

  219.             goto error;

  220.         }

  221.         skip_bits1(gb);

  222.         if(tmp1.current > 1) {

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

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

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

  226.             if(res < 0) {

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

  228.                 err = res;

  229.                 goto error;

  230.             }

  231.         }

  232.     }

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

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

  235.     }

  236.     if(get_bits1(gb)){

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

  238.         if (res < 0) {

  239.             err = res;

  240.             goto error;

  241.         }

  242.         skip_bits1(gb);

  243.         if(tmp2.current > 1) {

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

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

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

  247.             if(res < 0) {

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

  249.                 err = res;

  250.                 goto error;

  251.             }

  252.         }

  253.     }

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

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

  256.     }

  257. 

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

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

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

  261. 

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

  263. 

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

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

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

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

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

  269.     ctx.recode1 = tmp1.values;

  270.     ctx.recode2 = tmp2.values;

  271.     ctx.last = last;

  272. 

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

  274.     huff.maxlength = 0;

  275.     huff.current = 0;

  276.     huff.values = av_mallocz_array(huff.length, sizeof(int));

  277.     if (!huff.values) {

  278.         err = AVERROR(ENOMEM);

  279.         goto error;

  280.     }

  281. 

  282.     res = smacker_decode_bigtree(gb, &huff, &ctx, 0);

  283.     if (res < 0)

  284.         err = res;

  285.     skip_bits1(gb);

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

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

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

  289.     if (ctx.last[0] >= huff.length ||

  290.         ctx.last[1] >= huff.length ||

  291.         ctx.last[2] >= huff.length) {

  292.         av_log(smk->avctx, AV_LOG_ERROR, "Huffman codes out of range\n");

  293.         err = AVERROR_INVALIDDATA;

  294.     }

  295. 

  296.     *recodes = huff.values;

  297. 

  298. error:

  299.     if(vlc[0].table)

  300.         ff_free_vlc(&vlc[0]);

  301.     if(vlc[1].table)

  302.         ff_free_vlc(&vlc[1]);

  303.     av_free(tmp1.bits);

  304.     av_free(tmp1.lengths);

  305.     av_free(tmp1.values);

  306.     av_free(tmp2.bits);

  307.     av_free(tmp2.lengths);

  308.     av_free(tmp2.values);

  309. 

  310.     return err;

  311. }

  312. 

  313. static int decode_header_trees(SmackVContext *smk) {

  314.     GetBitContext gb;

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

  316. 

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

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

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

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

  321. 

  322.     ret = init_get_bits8(&gb, smk->avctx->extradata + 16, smk->avctx->extradata_size - 16);

  323.     if (ret < 0)

  324.         return ret;

  325. 

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

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

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

  329.         if (!smk->mmap_tbl)

  330.             return AVERROR(ENOMEM);

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

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

  333.     } else {

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

  335.         if (ret < 0)

  336.             return ret;

  337.     }

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

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

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

  341.         if (!smk->mclr_tbl)

  342.             return AVERROR(ENOMEM);

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

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

  345.     } else {

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

  347.         if (ret < 0)

  348.             return ret;

  349.     }

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

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

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

  353.         if (!smk->full_tbl)

  354.             return AVERROR(ENOMEM);

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

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

  357.     } else {

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

  359.         if (ret < 0)

  360.             return ret;

  361.     }

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

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

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

  365.         if (!smk->type_tbl)

  366.             return AVERROR(ENOMEM);

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

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

  369.     } else {

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

  371.         if (ret < 0)

  372.             return ret;

  373.     }

  374. 

  375.     return 0;

  376. }

  377. 

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

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

  380. }

  381. 

  382. /* get code and update history */

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

  384.     register int *table = recode;

  385.     int v;

  386. 

  387.     while(*table & SMK_NODE) {

  388.         if(get_bits1(gb))

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

  390.         table++;

  391.     }

  392.     v = *table;

  393. 

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

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

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

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

  398.     }

  399.     return v;

  400. }

  401. 

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

  403.                         AVPacket *avpkt)

  404. {

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

  406.     uint8_t *out;

  407.     uint32_t *pal;

  408.     GetByteContext gb2;

  409.     GetBitContext gb;

  410.     int blocks, blk, bw, bh;

  411.     int i, ret;

  412.     int stride;

  413.     int flags;

  414. 

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

  416.         return AVERROR_INVALIDDATA;

  417. 

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

  419.         return ret;

  420. 

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

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

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

  424.     flags = bytestream2_get_byteu(&gb2);

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

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

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

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

  429.     else

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

  431. 

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

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

  434. 

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

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

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

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

  439.     if ((ret = init_get_bits8(&gb, avpkt->data + 769, avpkt->size - 769)) < 0)

  440.         return ret;

  441. 

  442.     blk = 0;

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

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

  445.     blocks = bw * bh;

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

  447.     while(blk < blocks) {

  448.         int type, run, mode;

  449.         uint16_t pix;

  450. 

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

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

  453.         switch(type & 3){

  454.         case SMK_BLK_MONO:

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

  456.                 int clr, map;

  457.                 int hi, lo;

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

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

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

  461.                 hi = clr >> 8;

  462.                 lo = clr & 0xFF;

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

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

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

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

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

  468.                     map >>= 4;

  469.                     out += stride;

  470.                 }

  471.                 blk++;

  472.             }

  473.             break;

  474.         case SMK_BLK_FULL:

  475.             mode = 0;

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

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

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

  479.             }

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

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

  482.                 switch(mode){

  483.                 case 0:

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

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

  486.                         AV_WL16(out+2,pix);

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

  488.                         AV_WL16(out,pix);

  489.                         out += stride;

  490.                     }

  491.                     break;

  492.                 case 1:

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

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

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

  496.                     out += stride;

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

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

  499.                     out += stride;

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

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

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

  503.                     out += stride;

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

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

  506.                     break;

  507.                 case 2:

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

  509.                         uint16_t pix1, pix2;

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

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

  512.                         AV_WL16(out,pix1);

  513.                         AV_WL16(out+2,pix2);

  514.                         out += stride;

  515.                         AV_WL16(out,pix1);

  516.                         AV_WL16(out+2,pix2);

  517.                         out += stride;

  518.                     }

  519.                     break;

  520.                 }

  521.                 blk++;

  522.             }

  523.             break;

  524.         case SMK_BLK_SKIP:

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

  526.                 blk++;

  527.             break;

  528.         case SMK_BLK_FILL:

  529.             mode = type >> 8;

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

  531.                 uint32_t col;

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

  533.                 col = mode * 0x01010101;

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

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

  536.                     out += stride;

  537.                 }

  538.                 blk++;

  539.             }

  540.             break;

  541.         }

  542. 

  543.     }

  544. 

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

  546.         return ret;

  547. 

  548.     *got_frame = 1;

  549. 

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

  551.     return avpkt->size;

  552. }

  553. 

  554. 

  555. static av_cold int decode_end(AVCodecContext *avctx)

  556. {

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

  558. 

  559.     av_freep(&smk->mmap_tbl);

  560.     av_freep(&smk->mclr_tbl);

  561.     av_freep(&smk->full_tbl);

  562.     av_freep(&smk->type_tbl);

  563. 

  564.     av_frame_free(&smk->pic);

  565. 

  566.     return 0;

  567. }

  568. 

  569. 

  570. static av_cold int decode_init(AVCodecContext *avctx)

  571. {

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

  573.     int ret;

  574. 

  575.     c->avctx = avctx;

  576. 

  577.     avctx->pix_fmt = AV_PIX_FMT_PAL8;

  578. 

  579.     c->pic = av_frame_alloc();

  580.     if (!c->pic)

  581.         return AVERROR(ENOMEM);

  582. 

  583.     /* decode huffman trees from extradata */

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

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

  586.         decode_end(avctx);

  587.         return AVERROR(EINVAL);

  588.     }

  589. 

  590.     ret = decode_header_trees(c);

  591.     if (ret < 0) {

  592.         decode_end(avctx);

  593.         return ret;

  594.     }

  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_INVALIDDATA;

  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_INVALIDDATA;

  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.     if ((ret = init_get_bits8(&gb, buf + 4, buf_size - 4)) < 0)

  645.         return ret;

  646. 

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

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

  649.         *got_frame_ptr = 0;

  650.         return 1;

  651.     }

  652.     stereo = get_bits1(&gb);

  653.     bits = get_bits1(&gb);

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

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

  656.         return AVERROR_INVALIDDATA;

  657.     }

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

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

  660.         return AVERROR_INVALIDDATA;

  661.     }

  662. 

  663.     /* get output buffer */

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

  665.     if (unp_size % (avctx->channels * (bits + 1))) {

  666.         av_log(avctx, AV_LOG_ERROR,

  667.                "The buffer does not contain an integer number of samples\n");

  668.         return AVERROR_INVALIDDATA;

  669.     }

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

  671.         return ret;

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

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

  674. 

  675.     // Initialize

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

  677.         h[i].length = 256;

  678.         h[i].maxlength = 0;

  679.         h[i].current = 0;

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

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

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

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

  684.             ret = AVERROR(ENOMEM);

  685.             goto error;

  686.         }

  687.         skip_bits1(&gb);

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

  689.             ret = AVERROR_INVALIDDATA;

  690.             goto error;

  691.         }

  692.         skip_bits1(&gb);

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

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

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

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

  697.             if(res < 0) {

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

  699.                 ret = AVERROR_INVALIDDATA;

  700.                 goto error;

  701.             }

  702.         }

  703.     }

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

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

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

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

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

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

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

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

  712.                 return AVERROR_INVALIDDATA;

  713.             if(i & stereo) {

  714.                 if(vlc[2].table)

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

  716.                 else

  717.                     res = 0;

  718.                 if (res < 0) {

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

  720.                     return AVERROR_INVALIDDATA;

  721.                 }

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

  723.                 if(vlc[3].table)

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

  725.                 else

  726.                     res = 0;

  727.                 if (res < 0) {

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

  729.                     return AVERROR_INVALIDDATA;

  730.                 }

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

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

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

  734.             } else {

  735.                 if(vlc[0].table)

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

  737.                 else

  738.                     res = 0;

  739.                 if (res < 0) {

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

  741.                     return AVERROR_INVALIDDATA;

  742.                 }

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

  744.                 if(vlc[1].table)

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

  746.                 else

  747.                     res = 0;

  748.                 if (res < 0) {

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

  750.                     return AVERROR_INVALIDDATA;

  751.                 }

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

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

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

  755.             }

  756.         }

  757.     } else { //8-bit data

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

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

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

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

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

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

  764.                 return AVERROR_INVALIDDATA;

  765.             if(i & stereo){

  766.                 if(vlc[1].table)

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

  768.                 else

  769.                     res = 0;

  770.                 if (res < 0) {

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

  772.                     return AVERROR_INVALIDDATA;

  773.                 }

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

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

  776.             } else {

  777.                 if(vlc[0].table)

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

  779.                 else

  780.                     res = 0;

  781.                 if (res < 0) {

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

  783.                     return AVERROR_INVALIDDATA;

  784.                 }

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

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

  787.             }

  788.         }

  789.     }

  790. 

  791.     *got_frame_ptr = 1;

  792.     ret = buf_size;

  793. 

  794. error:

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

  796.         if(vlc[i].table)

  797.             ff_free_vlc(&vlc[i]);

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

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

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

  801.     }

  802. 

  803.     return ret;

  804. }

  805. 

  806. AVCodec ff_smacker_decoder = {

  807.     .name           = "smackvid",

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

  809.     .type           = AVMEDIA_TYPE_VIDEO,

  810.     .id             = AV_CODEC_ID_SMACKVIDEO,

  811.     .priv_data_size = sizeof(SmackVContext),

  812.     .init           = decode_init,

  813.     .close          = decode_end,

  814.     .decode         = decode_frame,

  815.     .capabilities   = AV_CODEC_CAP_DR1,

  816. };

  817. 

  818. AVCodec ff_smackaud_decoder = {

  819.     .name           = "smackaud",

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

  821.     .type           = AVMEDIA_TYPE_AUDIO,

  822.     .id             = AV_CODEC_ID_SMACKAUDIO,

  823.     .init           = smka_decode_init,

  824.     .decode         = smka_decode_frame,

  825.     .capabilities   = AV_CODEC_CAP_DR1,

  826. };