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.

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