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.

799 lines
24KB

  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. * @file
  23. * Smacker decoder
  24. */
  25. /*
  26. * Based on http://wiki.multimedia.cx/index.php?title=Smacker
  27. */
  28. #include <stdio.h>
  29. #include <stdlib.h>
  30. #include "libavutil/channel_layout.h"
  31. #include "avcodec.h"
  32. #include "internal.h"
  33. #include "mathops.h"
  34. #define BITSTREAM_READER_LE
  35. #include "get_bits.h"
  36. #include "bytestream.h"
  37. #define SMKTREE_BITS 9
  38. #define SMK_NODE 0x80000000
  39. /*
  40. * Decoder context
  41. */
  42. typedef struct SmackVContext {
  43. AVCodecContext *avctx;
  44. AVFrame pic;
  45. int *mmap_tbl, *mclr_tbl, *full_tbl, *type_tbl;
  46. int mmap_last[3], mclr_last[3], full_last[3], type_last[3];
  47. } SmackVContext;
  48. /**
  49. * Context used for code reconstructing
  50. */
  51. typedef struct HuffContext {
  52. int length;
  53. int maxlength;
  54. int current;
  55. uint32_t *bits;
  56. int *lengths;
  57. int *values;
  58. } HuffContext;
  59. /* common parameters used for decode_bigtree */
  60. typedef struct DBCtx {
  61. VLC *v1, *v2;
  62. int *recode1, *recode2;
  63. int escapes[3];
  64. int *last;
  65. int lcur;
  66. } DBCtx;
  67. /* possible runs of blocks */
  68. static const int block_runs[64] = {
  69. 1, 2, 3, 4, 5, 6, 7, 8,
  70. 9, 10, 11, 12, 13, 14, 15, 16,
  71. 17, 18, 19, 20, 21, 22, 23, 24,
  72. 25, 26, 27, 28, 29, 30, 31, 32,
  73. 33, 34, 35, 36, 37, 38, 39, 40,
  74. 41, 42, 43, 44, 45, 46, 47, 48,
  75. 49, 50, 51, 52, 53, 54, 55, 56,
  76. 57, 58, 59, 128, 256, 512, 1024, 2048 };
  77. enum SmkBlockTypes {
  78. SMK_BLK_MONO = 0,
  79. SMK_BLK_FULL = 1,
  80. SMK_BLK_SKIP = 2,
  81. SMK_BLK_FILL = 3 };
  82. /**
  83. * Decode local frame tree
  84. */
  85. static int smacker_decode_tree(GetBitContext *gb, HuffContext *hc, uint32_t prefix, int length)
  86. {
  87. if(length > 32 || length > 3*SMKTREE_BITS) {
  88. av_log(NULL, AV_LOG_ERROR, "length too long\n");
  89. return AVERROR_INVALIDDATA;
  90. }
  91. if(!get_bits1(gb)){ //Leaf
  92. if(hc->current >= 256){
  93. av_log(NULL, AV_LOG_ERROR, "Tree size exceeded!\n");
  94. return AVERROR_INVALIDDATA;
  95. }
  96. if(length){
  97. hc->bits[hc->current] = prefix;
  98. hc->lengths[hc->current] = length;
  99. } else {
  100. hc->bits[hc->current] = 0;
  101. hc->lengths[hc->current] = 0;
  102. }
  103. hc->values[hc->current] = get_bits(gb, 8);
  104. hc->current++;
  105. if(hc->maxlength < length)
  106. hc->maxlength = length;
  107. return 0;
  108. } else { //Node
  109. int r;
  110. length++;
  111. r = smacker_decode_tree(gb, hc, prefix, length);
  112. if(r)
  113. return r;
  114. return smacker_decode_tree(gb, hc, prefix | (1 << (length - 1)), length);
  115. }
  116. }
  117. /**
  118. * Decode header tree
  119. */
  120. static int smacker_decode_bigtree(GetBitContext *gb, HuffContext *hc, DBCtx *ctx)
  121. {
  122. if (hc->current + 1 >= hc->length) {
  123. av_log(NULL, AV_LOG_ERROR, "Tree size exceeded!\n");
  124. return AVERROR_INVALIDDATA;
  125. }
  126. if(!get_bits1(gb)){ //Leaf
  127. int val, i1, i2;
  128. i1 = ctx->v1->table ? get_vlc2(gb, ctx->v1->table, SMKTREE_BITS, 3) : 0;
  129. i2 = ctx->v2->table ? get_vlc2(gb, ctx->v2->table, SMKTREE_BITS, 3) : 0;
  130. if (i1 < 0 || i2 < 0)
  131. return AVERROR_INVALIDDATA;
  132. val = ctx->recode1[i1] | (ctx->recode2[i2] << 8);
  133. if(val == ctx->escapes[0]) {
  134. ctx->last[0] = hc->current;
  135. val = 0;
  136. } else if(val == ctx->escapes[1]) {
  137. ctx->last[1] = hc->current;
  138. val = 0;
  139. } else if(val == ctx->escapes[2]) {
  140. ctx->last[2] = hc->current;
  141. val = 0;
  142. }
  143. hc->values[hc->current++] = val;
  144. return 1;
  145. } else { //Node
  146. int r = 0, r_new, t;
  147. t = hc->current++;
  148. r = smacker_decode_bigtree(gb, hc, ctx);
  149. if(r < 0)
  150. return r;
  151. hc->values[t] = SMK_NODE | r;
  152. r++;
  153. r_new = smacker_decode_bigtree(gb, hc, ctx);
  154. if (r_new < 0)
  155. return r_new;
  156. return r + r_new;
  157. }
  158. }
  159. /**
  160. * Store large tree as FFmpeg's vlc codes
  161. */
  162. static int smacker_decode_header_tree(SmackVContext *smk, GetBitContext *gb, int **recodes, int *last, int size)
  163. {
  164. int res;
  165. HuffContext huff;
  166. HuffContext tmp1, tmp2;
  167. VLC vlc[2] = { { 0 } };
  168. int escapes[3];
  169. DBCtx ctx;
  170. int err = 0;
  171. if(size >= UINT_MAX>>4){ // (((size + 3) >> 2) + 3) << 2 must not overflow
  172. av_log(smk->avctx, AV_LOG_ERROR, "size too large\n");
  173. return AVERROR_INVALIDDATA;
  174. }
  175. tmp1.length = 256;
  176. tmp1.maxlength = 0;
  177. tmp1.current = 0;
  178. tmp1.bits = av_mallocz(256 * 4);
  179. tmp1.lengths = av_mallocz(256 * sizeof(int));
  180. tmp1.values = av_mallocz(256 * sizeof(int));
  181. tmp2.length = 256;
  182. tmp2.maxlength = 0;
  183. tmp2.current = 0;
  184. tmp2.bits = av_mallocz(256 * 4);
  185. tmp2.lengths = av_mallocz(256 * sizeof(int));
  186. tmp2.values = av_mallocz(256 * sizeof(int));
  187. if(get_bits1(gb)) {
  188. res = smacker_decode_tree(gb, &tmp1, 0, 0);
  189. if (res < 0)
  190. return res;
  191. skip_bits1(gb);
  192. if(tmp1.current > 1) {
  193. res = init_vlc(&vlc[0], SMKTREE_BITS, tmp1.length,
  194. tmp1.lengths, sizeof(int), sizeof(int),
  195. tmp1.bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);
  196. if(res < 0) {
  197. av_log(smk->avctx, AV_LOG_ERROR, "Cannot build VLC table\n");
  198. return AVERROR_INVALIDDATA;
  199. }
  200. }
  201. }
  202. if (!vlc[0].table) {
  203. av_log(smk->avctx, AV_LOG_ERROR, "Skipping low bytes tree\n");
  204. }
  205. if(get_bits1(gb)){
  206. res = smacker_decode_tree(gb, &tmp2, 0, 0);
  207. if (res < 0)
  208. return res;
  209. skip_bits1(gb);
  210. if(tmp2.current > 1) {
  211. res = init_vlc(&vlc[1], SMKTREE_BITS, tmp2.length,
  212. tmp2.lengths, sizeof(int), sizeof(int),
  213. tmp2.bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);
  214. if(res < 0) {
  215. av_log(smk->avctx, AV_LOG_ERROR, "Cannot build VLC table\n");
  216. return AVERROR_INVALIDDATA;
  217. }
  218. }
  219. }
  220. if (!vlc[1].table) {
  221. av_log(smk->avctx, AV_LOG_ERROR, "Skipping high bytes tree\n");
  222. }
  223. escapes[0] = get_bits(gb, 16);
  224. escapes[1] = get_bits(gb, 16);
  225. escapes[2] = get_bits(gb, 16);
  226. last[0] = last[1] = last[2] = -1;
  227. ctx.escapes[0] = escapes[0];
  228. ctx.escapes[1] = escapes[1];
  229. ctx.escapes[2] = escapes[2];
  230. ctx.v1 = &vlc[0];
  231. ctx.v2 = &vlc[1];
  232. ctx.recode1 = tmp1.values;
  233. ctx.recode2 = tmp2.values;
  234. ctx.last = last;
  235. huff.length = ((size + 3) >> 2) + 4;
  236. huff.maxlength = 0;
  237. huff.current = 0;
  238. huff.values = av_mallocz(huff.length * sizeof(int));
  239. if (!huff.values)
  240. return AVERROR(ENOMEM);
  241. if (smacker_decode_bigtree(gb, &huff, &ctx) < 0)
  242. err = -1;
  243. skip_bits1(gb);
  244. if(ctx.last[0] == -1) ctx.last[0] = huff.current++;
  245. if(ctx.last[1] == -1) ctx.last[1] = huff.current++;
  246. if(ctx.last[2] == -1) ctx.last[2] = huff.current++;
  247. if(huff.current > huff.length){
  248. ctx.last[0] = ctx.last[1] = ctx.last[2] = 1;
  249. av_log(smk->avctx, AV_LOG_ERROR, "bigtree damaged\n");
  250. return AVERROR_INVALIDDATA;
  251. }
  252. *recodes = huff.values;
  253. if(vlc[0].table)
  254. ff_free_vlc(&vlc[0]);
  255. if(vlc[1].table)
  256. ff_free_vlc(&vlc[1]);
  257. av_free(tmp1.bits);
  258. av_free(tmp1.lengths);
  259. av_free(tmp1.values);
  260. av_free(tmp2.bits);
  261. av_free(tmp2.lengths);
  262. av_free(tmp2.values);
  263. return err;
  264. }
  265. static int decode_header_trees(SmackVContext *smk) {
  266. GetBitContext gb;
  267. int mmap_size, mclr_size, full_size, type_size, ret;
  268. mmap_size = AV_RL32(smk->avctx->extradata);
  269. mclr_size = AV_RL32(smk->avctx->extradata + 4);
  270. full_size = AV_RL32(smk->avctx->extradata + 8);
  271. type_size = AV_RL32(smk->avctx->extradata + 12);
  272. init_get_bits(&gb, smk->avctx->extradata + 16, (smk->avctx->extradata_size - 16) * 8);
  273. if(!get_bits1(&gb)) {
  274. av_log(smk->avctx, AV_LOG_INFO, "Skipping MMAP tree\n");
  275. smk->mmap_tbl = av_malloc(sizeof(int) * 2);
  276. smk->mmap_tbl[0] = 0;
  277. smk->mmap_last[0] = smk->mmap_last[1] = smk->mmap_last[2] = 1;
  278. } else {
  279. ret = smacker_decode_header_tree(smk, &gb, &smk->mmap_tbl, smk->mmap_last, mmap_size);
  280. if (ret < 0)
  281. return ret;
  282. }
  283. if(!get_bits1(&gb)) {
  284. av_log(smk->avctx, AV_LOG_INFO, "Skipping MCLR tree\n");
  285. smk->mclr_tbl = av_malloc(sizeof(int) * 2);
  286. smk->mclr_tbl[0] = 0;
  287. smk->mclr_last[0] = smk->mclr_last[1] = smk->mclr_last[2] = 1;
  288. } else {
  289. ret = smacker_decode_header_tree(smk, &gb, &smk->mclr_tbl, smk->mclr_last, mclr_size);
  290. if (ret < 0)
  291. return ret;
  292. }
  293. if(!get_bits1(&gb)) {
  294. av_log(smk->avctx, AV_LOG_INFO, "Skipping FULL tree\n");
  295. smk->full_tbl = av_malloc(sizeof(int) * 2);
  296. smk->full_tbl[0] = 0;
  297. smk->full_last[0] = smk->full_last[1] = smk->full_last[2] = 1;
  298. } else {
  299. ret = smacker_decode_header_tree(smk, &gb, &smk->full_tbl, smk->full_last, full_size);
  300. if (ret < 0)
  301. return ret;
  302. }
  303. if(!get_bits1(&gb)) {
  304. av_log(smk->avctx, AV_LOG_INFO, "Skipping TYPE tree\n");
  305. smk->type_tbl = av_malloc(sizeof(int) * 2);
  306. smk->type_tbl[0] = 0;
  307. smk->type_last[0] = smk->type_last[1] = smk->type_last[2] = 1;
  308. } else {
  309. ret = smacker_decode_header_tree(smk, &gb, &smk->type_tbl, smk->type_last, type_size);
  310. if (ret < 0)
  311. return ret;
  312. }
  313. return 0;
  314. }
  315. static av_always_inline void last_reset(int *recode, int *last) {
  316. recode[last[0]] = recode[last[1]] = recode[last[2]] = 0;
  317. }
  318. /* get code and update history */
  319. static av_always_inline int smk_get_code(GetBitContext *gb, int *recode, int *last) {
  320. register int *table = recode;
  321. int v;
  322. while(*table & SMK_NODE) {
  323. if(get_bits1(gb))
  324. table += (*table) & (~SMK_NODE);
  325. table++;
  326. }
  327. v = *table;
  328. if(v != recode[last[0]]) {
  329. recode[last[2]] = recode[last[1]];
  330. recode[last[1]] = recode[last[0]];
  331. recode[last[0]] = v;
  332. }
  333. return v;
  334. }
  335. static int decode_frame(AVCodecContext *avctx, void *data, int *got_frame,
  336. AVPacket *avpkt)
  337. {
  338. SmackVContext * const smk = avctx->priv_data;
  339. uint8_t *out;
  340. uint32_t *pal;
  341. GetByteContext gb2;
  342. GetBitContext gb;
  343. int blocks, blk, bw, bh;
  344. int i, ret;
  345. int stride;
  346. int flags;
  347. if (avpkt->size <= 769)
  348. return AVERROR_INVALIDDATA;
  349. if ((ret = ff_reget_buffer(avctx, &smk->pic)) < 0)
  350. return ret;
  351. /* make the palette available on the way out */
  352. pal = (uint32_t*)smk->pic.data[1];
  353. bytestream2_init(&gb2, avpkt->data, avpkt->size);
  354. flags = bytestream2_get_byteu(&gb2);
  355. smk->pic.palette_has_changed = flags & 1;
  356. smk->pic.key_frame = !!(flags & 2);
  357. if(smk->pic.key_frame)
  358. smk->pic.pict_type = AV_PICTURE_TYPE_I;
  359. else
  360. smk->pic.pict_type = AV_PICTURE_TYPE_P;
  361. for(i = 0; i < 256; i++)
  362. *pal++ = 0xFFU << 24 | bytestream2_get_be24u(&gb2);
  363. last_reset(smk->mmap_tbl, smk->mmap_last);
  364. last_reset(smk->mclr_tbl, smk->mclr_last);
  365. last_reset(smk->full_tbl, smk->full_last);
  366. last_reset(smk->type_tbl, smk->type_last);
  367. init_get_bits(&gb, avpkt->data + 769, (avpkt->size - 769) * 8);
  368. blk = 0;
  369. bw = avctx->width >> 2;
  370. bh = avctx->height >> 2;
  371. blocks = bw * bh;
  372. out = smk->pic.data[0];
  373. stride = smk->pic.linesize[0];
  374. while(blk < blocks) {
  375. int type, run, mode;
  376. uint16_t pix;
  377. type = smk_get_code(&gb, smk->type_tbl, smk->type_last);
  378. run = block_runs[(type >> 2) & 0x3F];
  379. switch(type & 3){
  380. case SMK_BLK_MONO:
  381. while(run-- && blk < blocks){
  382. int clr, map;
  383. int hi, lo;
  384. clr = smk_get_code(&gb, smk->mclr_tbl, smk->mclr_last);
  385. map = smk_get_code(&gb, smk->mmap_tbl, smk->mmap_last);
  386. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  387. hi = clr >> 8;
  388. lo = clr & 0xFF;
  389. for(i = 0; i < 4; i++) {
  390. if(map & 1) out[0] = hi; else out[0] = lo;
  391. if(map & 2) out[1] = hi; else out[1] = lo;
  392. if(map & 4) out[2] = hi; else out[2] = lo;
  393. if(map & 8) out[3] = hi; else out[3] = lo;
  394. map >>= 4;
  395. out += stride;
  396. }
  397. blk++;
  398. }
  399. break;
  400. case SMK_BLK_FULL:
  401. mode = 0;
  402. if(avctx->codec_tag == MKTAG('S', 'M', 'K', '4')) { // In case of Smacker v4 we have three modes
  403. if(get_bits1(&gb)) mode = 1;
  404. else if(get_bits1(&gb)) mode = 2;
  405. }
  406. while(run-- && blk < blocks){
  407. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  408. switch(mode){
  409. case 0:
  410. for(i = 0; i < 4; i++) {
  411. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  412. AV_WL16(out+2,pix);
  413. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  414. AV_WL16(out,pix);
  415. out += stride;
  416. }
  417. break;
  418. case 1:
  419. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  420. out[0] = out[1] = pix & 0xFF;
  421. out[2] = out[3] = pix >> 8;
  422. out += stride;
  423. out[0] = out[1] = pix & 0xFF;
  424. out[2] = out[3] = pix >> 8;
  425. out += stride;
  426. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  427. out[0] = out[1] = pix & 0xFF;
  428. out[2] = out[3] = pix >> 8;
  429. out += stride;
  430. out[0] = out[1] = pix & 0xFF;
  431. out[2] = out[3] = pix >> 8;
  432. out += stride;
  433. break;
  434. case 2:
  435. for(i = 0; i < 2; i++) {
  436. uint16_t pix1, pix2;
  437. pix2 = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  438. pix1 = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  439. AV_WL16(out,pix1);
  440. AV_WL16(out+2,pix2);
  441. out += stride;
  442. AV_WL16(out,pix1);
  443. AV_WL16(out+2,pix2);
  444. out += stride;
  445. }
  446. break;
  447. }
  448. blk++;
  449. }
  450. break;
  451. case SMK_BLK_SKIP:
  452. while(run-- && blk < blocks)
  453. blk++;
  454. break;
  455. case SMK_BLK_FILL:
  456. mode = type >> 8;
  457. while(run-- && blk < blocks){
  458. uint32_t col;
  459. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  460. col = mode * 0x01010101;
  461. for(i = 0; i < 4; i++) {
  462. *((uint32_t*)out) = col;
  463. out += stride;
  464. }
  465. blk++;
  466. }
  467. break;
  468. }
  469. }
  470. if ((ret = av_frame_ref(data, &smk->pic)) < 0)
  471. return ret;
  472. *got_frame = 1;
  473. /* always report that the buffer was completely consumed */
  474. return avpkt->size;
  475. }
  476. /*
  477. *
  478. * Init smacker decoder
  479. *
  480. */
  481. static av_cold int decode_init(AVCodecContext *avctx)
  482. {
  483. SmackVContext * const c = avctx->priv_data;
  484. int ret;
  485. c->avctx = avctx;
  486. avctx->pix_fmt = AV_PIX_FMT_PAL8;
  487. avcodec_get_frame_defaults(&c->pic);
  488. /* decode huffman trees from extradata */
  489. if(avctx->extradata_size < 16){
  490. av_log(avctx, AV_LOG_ERROR, "Extradata missing!\n");
  491. return AVERROR(EINVAL);
  492. }
  493. ret = decode_header_trees(c);
  494. if (ret < 0)
  495. return ret;
  496. return 0;
  497. }
  498. /*
  499. *
  500. * Uninit smacker decoder
  501. *
  502. */
  503. static av_cold int decode_end(AVCodecContext *avctx)
  504. {
  505. SmackVContext * const smk = avctx->priv_data;
  506. av_freep(&smk->mmap_tbl);
  507. av_freep(&smk->mclr_tbl);
  508. av_freep(&smk->full_tbl);
  509. av_freep(&smk->type_tbl);
  510. av_frame_unref(&smk->pic);
  511. return 0;
  512. }
  513. static av_cold int smka_decode_init(AVCodecContext *avctx)
  514. {
  515. if (avctx->channels < 1 || avctx->channels > 2) {
  516. av_log(avctx, AV_LOG_ERROR, "invalid number of channels\n");
  517. return AVERROR(EINVAL);
  518. }
  519. avctx->channel_layout = (avctx->channels==2) ? AV_CH_LAYOUT_STEREO : AV_CH_LAYOUT_MONO;
  520. avctx->sample_fmt = avctx->bits_per_coded_sample == 8 ? AV_SAMPLE_FMT_U8 : AV_SAMPLE_FMT_S16;
  521. return 0;
  522. }
  523. /**
  524. * Decode Smacker audio data
  525. */
  526. static int smka_decode_frame(AVCodecContext *avctx, void *data,
  527. int *got_frame_ptr, AVPacket *avpkt)
  528. {
  529. AVFrame *frame = data;
  530. const uint8_t *buf = avpkt->data;
  531. int buf_size = avpkt->size;
  532. GetBitContext gb;
  533. HuffContext h[4] = { { 0 } };
  534. VLC vlc[4] = { { 0 } };
  535. int16_t *samples;
  536. uint8_t *samples8;
  537. int val;
  538. int i, res, ret;
  539. int unp_size;
  540. int bits, stereo;
  541. int pred[2] = {0, 0};
  542. if (buf_size <= 4) {
  543. av_log(avctx, AV_LOG_ERROR, "packet is too small\n");
  544. return AVERROR(EINVAL);
  545. }
  546. unp_size = AV_RL32(buf);
  547. if (unp_size > (1U<<24)) {
  548. av_log(avctx, AV_LOG_ERROR, "packet is too big\n");
  549. return AVERROR_INVALIDDATA;
  550. }
  551. init_get_bits(&gb, buf + 4, (buf_size - 4) * 8);
  552. if(!get_bits1(&gb)){
  553. av_log(avctx, AV_LOG_INFO, "Sound: no data\n");
  554. *got_frame_ptr = 0;
  555. return 1;
  556. }
  557. stereo = get_bits1(&gb);
  558. bits = get_bits1(&gb);
  559. if (stereo ^ (avctx->channels != 1)) {
  560. av_log(avctx, AV_LOG_ERROR, "channels mismatch\n");
  561. return AVERROR(EINVAL);
  562. }
  563. if (bits && avctx->sample_fmt == AV_SAMPLE_FMT_U8) {
  564. av_log(avctx, AV_LOG_ERROR, "sample format mismatch\n");
  565. return AVERROR(EINVAL);
  566. }
  567. /* get output buffer */
  568. frame->nb_samples = unp_size / (avctx->channels * (bits + 1));
  569. if ((ret = ff_get_buffer(avctx, frame, 0)) < 0)
  570. return ret;
  571. samples = (int16_t *)frame->data[0];
  572. samples8 = frame->data[0];
  573. // Initialize
  574. for(i = 0; i < (1 << (bits + stereo)); i++) {
  575. h[i].length = 256;
  576. h[i].maxlength = 0;
  577. h[i].current = 0;
  578. h[i].bits = av_mallocz(256 * 4);
  579. h[i].lengths = av_mallocz(256 * sizeof(int));
  580. h[i].values = av_mallocz(256 * sizeof(int));
  581. skip_bits1(&gb);
  582. if (smacker_decode_tree(&gb, &h[i], 0, 0) < 0) {
  583. for (; i >= 0; i--) {
  584. if (vlc[i].table)
  585. ff_free_vlc(&vlc[i]);
  586. av_free(h[i].bits);
  587. av_free(h[i].lengths);
  588. av_free(h[i].values);
  589. }
  590. return AVERROR_INVALIDDATA;
  591. }
  592. skip_bits1(&gb);
  593. if(h[i].current > 1) {
  594. res = init_vlc(&vlc[i], SMKTREE_BITS, h[i].length,
  595. h[i].lengths, sizeof(int), sizeof(int),
  596. h[i].bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);
  597. if(res < 0) {
  598. av_log(avctx, AV_LOG_ERROR, "Cannot build VLC table\n");
  599. return AVERROR_INVALIDDATA;
  600. }
  601. }
  602. }
  603. /* this codec relies on wraparound instead of clipping audio */
  604. if(bits) { //decode 16-bit data
  605. for(i = stereo; i >= 0; i--)
  606. pred[i] = sign_extend(av_bswap16(get_bits(&gb, 16)), 16);
  607. for(i = 0; i <= stereo; i++)
  608. *samples++ = pred[i];
  609. for(; i < unp_size / 2; i++) {
  610. if(get_bits_left(&gb)<0)
  611. return AVERROR_INVALIDDATA;
  612. if(i & stereo) {
  613. if(vlc[2].table)
  614. res = get_vlc2(&gb, vlc[2].table, SMKTREE_BITS, 3);
  615. else
  616. res = 0;
  617. if (res < 0) {
  618. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  619. return AVERROR_INVALIDDATA;
  620. }
  621. val = h[2].values[res];
  622. if(vlc[3].table)
  623. res = get_vlc2(&gb, vlc[3].table, SMKTREE_BITS, 3);
  624. else
  625. res = 0;
  626. if (res < 0) {
  627. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  628. return AVERROR_INVALIDDATA;
  629. }
  630. val |= h[3].values[res] << 8;
  631. pred[1] += sign_extend(val, 16);
  632. *samples++ = pred[1];
  633. } else {
  634. if(vlc[0].table)
  635. res = get_vlc2(&gb, vlc[0].table, SMKTREE_BITS, 3);
  636. else
  637. res = 0;
  638. if (res < 0) {
  639. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  640. return AVERROR_INVALIDDATA;
  641. }
  642. val = h[0].values[res];
  643. if(vlc[1].table)
  644. res = get_vlc2(&gb, vlc[1].table, SMKTREE_BITS, 3);
  645. else
  646. res = 0;
  647. if (res < 0) {
  648. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  649. return AVERROR_INVALIDDATA;
  650. }
  651. val |= h[1].values[res] << 8;
  652. pred[0] += sign_extend(val, 16);
  653. *samples++ = pred[0];
  654. }
  655. }
  656. } else { //8-bit data
  657. for(i = stereo; i >= 0; i--)
  658. pred[i] = get_bits(&gb, 8);
  659. for(i = 0; i <= stereo; i++)
  660. *samples8++ = pred[i];
  661. for(; i < unp_size; i++) {
  662. if(get_bits_left(&gb)<0)
  663. return AVERROR_INVALIDDATA;
  664. if(i & stereo){
  665. if(vlc[1].table)
  666. res = get_vlc2(&gb, vlc[1].table, SMKTREE_BITS, 3);
  667. else
  668. res = 0;
  669. if (res < 0) {
  670. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  671. return AVERROR_INVALIDDATA;
  672. }
  673. pred[1] += sign_extend(h[1].values[res], 8);
  674. *samples8++ = pred[1];
  675. } else {
  676. if(vlc[0].table)
  677. res = get_vlc2(&gb, vlc[0].table, SMKTREE_BITS, 3);
  678. else
  679. res = 0;
  680. if (res < 0) {
  681. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  682. return AVERROR_INVALIDDATA;
  683. }
  684. pred[0] += sign_extend(h[0].values[res], 8);
  685. *samples8++ = pred[0];
  686. }
  687. }
  688. }
  689. for(i = 0; i < 4; i++) {
  690. if(vlc[i].table)
  691. ff_free_vlc(&vlc[i]);
  692. av_free(h[i].bits);
  693. av_free(h[i].lengths);
  694. av_free(h[i].values);
  695. }
  696. *got_frame_ptr = 1;
  697. return buf_size;
  698. }
  699. AVCodec ff_smacker_decoder = {
  700. .name = "smackvid",
  701. .type = AVMEDIA_TYPE_VIDEO,
  702. .id = AV_CODEC_ID_SMACKVIDEO,
  703. .priv_data_size = sizeof(SmackVContext),
  704. .init = decode_init,
  705. .close = decode_end,
  706. .decode = decode_frame,
  707. .capabilities = CODEC_CAP_DR1,
  708. .long_name = NULL_IF_CONFIG_SMALL("Smacker video"),
  709. };
  710. AVCodec ff_smackaud_decoder = {
  711. .name = "smackaud",
  712. .type = AVMEDIA_TYPE_AUDIO,
  713. .id = AV_CODEC_ID_SMACKAUDIO,
  714. .init = smka_decode_init,
  715. .decode = smka_decode_frame,
  716. .capabilities = CODEC_CAP_DR1,
  717. .long_name = NULL_IF_CONFIG_SMALL("Smacker audio"),
  718. };