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.

798 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 || length > 3*SMKTREE_BITS) {
  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. res = smacker_decode_tree(gb, &tmp1, 0, 0);
  188. if (res < 0)
  189. return res;
  190. skip_bits1(gb);
  191. if(tmp1.current > 1) {
  192. res = init_vlc(&vlc[0], SMKTREE_BITS, tmp1.length,
  193. tmp1.lengths, sizeof(int), sizeof(int),
  194. tmp1.bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);
  195. if(res < 0) {
  196. av_log(smk->avctx, AV_LOG_ERROR, "Cannot build VLC table\n");
  197. return AVERROR_INVALIDDATA;
  198. }
  199. }
  200. }
  201. if (!vlc[0].table) {
  202. av_log(smk->avctx, AV_LOG_ERROR, "Skipping low bytes tree\n");
  203. }
  204. if(get_bits1(gb)){
  205. res = smacker_decode_tree(gb, &tmp2, 0, 0);
  206. if (res < 0)
  207. return res;
  208. skip_bits1(gb);
  209. if(tmp2.current > 1) {
  210. res = init_vlc(&vlc[1], SMKTREE_BITS, tmp2.length,
  211. tmp2.lengths, sizeof(int), sizeof(int),
  212. tmp2.bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);
  213. if(res < 0) {
  214. av_log(smk->avctx, AV_LOG_ERROR, "Cannot build VLC table\n");
  215. return AVERROR_INVALIDDATA;
  216. }
  217. }
  218. }
  219. if (!vlc[1].table) {
  220. av_log(smk->avctx, AV_LOG_ERROR, "Skipping high bytes tree\n");
  221. }
  222. escapes[0] = get_bits(gb, 16);
  223. escapes[1] = get_bits(gb, 16);
  224. escapes[2] = get_bits(gb, 16);
  225. last[0] = last[1] = last[2] = -1;
  226. ctx.escapes[0] = escapes[0];
  227. ctx.escapes[1] = escapes[1];
  228. ctx.escapes[2] = escapes[2];
  229. ctx.v1 = &vlc[0];
  230. ctx.v2 = &vlc[1];
  231. ctx.recode1 = tmp1.values;
  232. ctx.recode2 = tmp2.values;
  233. ctx.last = last;
  234. huff.length = ((size + 3) >> 2) + 3;
  235. huff.maxlength = 0;
  236. huff.current = 0;
  237. huff.values = av_mallocz(huff.length * sizeof(int));
  238. if (smacker_decode_bigtree(gb, &huff, &ctx) < 0)
  239. err = -1;
  240. skip_bits1(gb);
  241. if(ctx.last[0] == -1) ctx.last[0] = huff.current++;
  242. if(ctx.last[1] == -1) ctx.last[1] = huff.current++;
  243. if(ctx.last[2] == -1) ctx.last[2] = huff.current++;
  244. if(huff.current > huff.length){
  245. ctx.last[0] = ctx.last[1] = ctx.last[2] = 1;
  246. av_log(smk->avctx, AV_LOG_ERROR, "bigtree damaged\n");
  247. return AVERROR_INVALIDDATA;
  248. }
  249. *recodes = huff.values;
  250. if(vlc[0].table)
  251. ff_free_vlc(&vlc[0]);
  252. if(vlc[1].table)
  253. ff_free_vlc(&vlc[1]);
  254. av_free(tmp1.bits);
  255. av_free(tmp1.lengths);
  256. av_free(tmp1.values);
  257. av_free(tmp2.bits);
  258. av_free(tmp2.lengths);
  259. av_free(tmp2.values);
  260. return err;
  261. }
  262. static int decode_header_trees(SmackVContext *smk) {
  263. GetBitContext gb;
  264. int mmap_size, mclr_size, full_size, type_size;
  265. mmap_size = AV_RL32(smk->avctx->extradata);
  266. mclr_size = AV_RL32(smk->avctx->extradata + 4);
  267. full_size = AV_RL32(smk->avctx->extradata + 8);
  268. type_size = AV_RL32(smk->avctx->extradata + 12);
  269. init_get_bits(&gb, smk->avctx->extradata + 16, (smk->avctx->extradata_size - 16) * 8);
  270. if(!get_bits1(&gb)) {
  271. av_log(smk->avctx, AV_LOG_INFO, "Skipping MMAP tree\n");
  272. smk->mmap_tbl = av_malloc(sizeof(int) * 2);
  273. smk->mmap_tbl[0] = 0;
  274. smk->mmap_last[0] = smk->mmap_last[1] = smk->mmap_last[2] = 1;
  275. } else {
  276. if (smacker_decode_header_tree(smk, &gb, &smk->mmap_tbl, smk->mmap_last, mmap_size))
  277. return AVERROR_INVALIDDATA;
  278. }
  279. if(!get_bits1(&gb)) {
  280. av_log(smk->avctx, AV_LOG_INFO, "Skipping MCLR tree\n");
  281. smk->mclr_tbl = av_malloc(sizeof(int) * 2);
  282. smk->mclr_tbl[0] = 0;
  283. smk->mclr_last[0] = smk->mclr_last[1] = smk->mclr_last[2] = 1;
  284. } else {
  285. if (smacker_decode_header_tree(smk, &gb, &smk->mclr_tbl, smk->mclr_last, mclr_size))
  286. return AVERROR_INVALIDDATA;
  287. }
  288. if(!get_bits1(&gb)) {
  289. av_log(smk->avctx, AV_LOG_INFO, "Skipping FULL tree\n");
  290. smk->full_tbl = av_malloc(sizeof(int) * 2);
  291. smk->full_tbl[0] = 0;
  292. smk->full_last[0] = smk->full_last[1] = smk->full_last[2] = 1;
  293. } else {
  294. if (smacker_decode_header_tree(smk, &gb, &smk->full_tbl, smk->full_last, full_size))
  295. return AVERROR_INVALIDDATA;
  296. }
  297. if(!get_bits1(&gb)) {
  298. av_log(smk->avctx, AV_LOG_INFO, "Skipping TYPE tree\n");
  299. smk->type_tbl = av_malloc(sizeof(int) * 2);
  300. smk->type_tbl[0] = 0;
  301. smk->type_last[0] = smk->type_last[1] = smk->type_last[2] = 1;
  302. } else {
  303. if (smacker_decode_header_tree(smk, &gb, &smk->type_tbl, smk->type_last, type_size))
  304. return AVERROR_INVALIDDATA;
  305. }
  306. return 0;
  307. }
  308. static av_always_inline void last_reset(int *recode, int *last) {
  309. recode[last[0]] = recode[last[1]] = recode[last[2]] = 0;
  310. }
  311. /* get code and update history */
  312. static av_always_inline int smk_get_code(GetBitContext *gb, int *recode, int *last) {
  313. register int *table = recode;
  314. int v;
  315. while(*table & SMK_NODE) {
  316. if(get_bits1(gb))
  317. table += (*table) & (~SMK_NODE);
  318. table++;
  319. }
  320. v = *table;
  321. if(v != recode[last[0]]) {
  322. recode[last[2]] = recode[last[1]];
  323. recode[last[1]] = recode[last[0]];
  324. recode[last[0]] = v;
  325. }
  326. return v;
  327. }
  328. static int decode_frame(AVCodecContext *avctx, void *data, int *data_size, AVPacket *avpkt)
  329. {
  330. SmackVContext * const smk = avctx->priv_data;
  331. uint8_t *out;
  332. uint32_t *pal;
  333. GetByteContext gb2;
  334. GetBitContext gb;
  335. int blocks, blk, bw, bh;
  336. int i, ret;
  337. int stride;
  338. int flags;
  339. if (avpkt->size <= 769)
  340. return AVERROR_INVALIDDATA;
  341. smk->pic.reference = 3;
  342. smk->pic.buffer_hints = FF_BUFFER_HINTS_VALID | FF_BUFFER_HINTS_PRESERVE | FF_BUFFER_HINTS_REUSABLE;
  343. if((ret = avctx->reget_buffer(avctx, &smk->pic)) < 0){
  344. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  345. return ret;
  346. }
  347. /* make the palette available on the way out */
  348. pal = (uint32_t*)smk->pic.data[1];
  349. bytestream2_init(&gb2, avpkt->data, avpkt->size);
  350. flags = bytestream2_get_byteu(&gb2);
  351. smk->pic.palette_has_changed = flags & 1;
  352. smk->pic.key_frame = !!(flags & 2);
  353. if(smk->pic.key_frame)
  354. smk->pic.pict_type = AV_PICTURE_TYPE_I;
  355. else
  356. smk->pic.pict_type = AV_PICTURE_TYPE_P;
  357. for(i = 0; i < 256; i++)
  358. *pal++ = 0xFFU << 24 | bytestream2_get_be24u(&gb2);
  359. last_reset(smk->mmap_tbl, smk->mmap_last);
  360. last_reset(smk->mclr_tbl, smk->mclr_last);
  361. last_reset(smk->full_tbl, smk->full_last);
  362. last_reset(smk->type_tbl, smk->type_last);
  363. init_get_bits(&gb, avpkt->data + 769, (avpkt->size - 769) * 8);
  364. blk = 0;
  365. bw = avctx->width >> 2;
  366. bh = avctx->height >> 2;
  367. blocks = bw * bh;
  368. out = smk->pic.data[0];
  369. stride = smk->pic.linesize[0];
  370. while(blk < blocks) {
  371. int type, run, mode;
  372. uint16_t pix;
  373. type = smk_get_code(&gb, smk->type_tbl, smk->type_last);
  374. run = block_runs[(type >> 2) & 0x3F];
  375. switch(type & 3){
  376. case SMK_BLK_MONO:
  377. while(run-- && blk < blocks){
  378. int clr, map;
  379. int hi, lo;
  380. clr = smk_get_code(&gb, smk->mclr_tbl, smk->mclr_last);
  381. map = smk_get_code(&gb, smk->mmap_tbl, smk->mmap_last);
  382. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  383. hi = clr >> 8;
  384. lo = clr & 0xFF;
  385. for(i = 0; i < 4; i++) {
  386. if(map & 1) out[0] = hi; else out[0] = lo;
  387. if(map & 2) out[1] = hi; else out[1] = lo;
  388. if(map & 4) out[2] = hi; else out[2] = lo;
  389. if(map & 8) out[3] = hi; else out[3] = lo;
  390. map >>= 4;
  391. out += stride;
  392. }
  393. blk++;
  394. }
  395. break;
  396. case SMK_BLK_FULL:
  397. mode = 0;
  398. if(avctx->codec_tag == MKTAG('S', 'M', 'K', '4')) { // In case of Smacker v4 we have three modes
  399. if(get_bits1(&gb)) mode = 1;
  400. else if(get_bits1(&gb)) mode = 2;
  401. }
  402. while(run-- && blk < blocks){
  403. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  404. switch(mode){
  405. case 0:
  406. for(i = 0; i < 4; i++) {
  407. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  408. AV_WL16(out+2,pix);
  409. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  410. AV_WL16(out,pix);
  411. out += stride;
  412. }
  413. break;
  414. case 1:
  415. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  416. out[0] = out[1] = pix & 0xFF;
  417. out[2] = out[3] = pix >> 8;
  418. out += stride;
  419. out[0] = out[1] = pix & 0xFF;
  420. out[2] = out[3] = pix >> 8;
  421. out += stride;
  422. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  423. out[0] = out[1] = pix & 0xFF;
  424. out[2] = out[3] = pix >> 8;
  425. out += stride;
  426. out[0] = out[1] = pix & 0xFF;
  427. out[2] = out[3] = pix >> 8;
  428. out += stride;
  429. break;
  430. case 2:
  431. for(i = 0; i < 2; i++) {
  432. uint16_t pix1, pix2;
  433. pix2 = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  434. pix1 = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  435. AV_WL16(out,pix1);
  436. AV_WL16(out+2,pix2);
  437. out += stride;
  438. AV_WL16(out,pix1);
  439. AV_WL16(out+2,pix2);
  440. out += stride;
  441. }
  442. break;
  443. }
  444. blk++;
  445. }
  446. break;
  447. case SMK_BLK_SKIP:
  448. while(run-- && blk < blocks)
  449. blk++;
  450. break;
  451. case SMK_BLK_FILL:
  452. mode = type >> 8;
  453. while(run-- && blk < blocks){
  454. uint32_t col;
  455. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  456. col = mode * 0x01010101;
  457. for(i = 0; i < 4; i++) {
  458. *((uint32_t*)out) = col;
  459. out += stride;
  460. }
  461. blk++;
  462. }
  463. break;
  464. }
  465. }
  466. *data_size = sizeof(AVFrame);
  467. *(AVFrame*)data = smk->pic;
  468. /* always report that the buffer was completely consumed */
  469. return avpkt->size;
  470. }
  471. /*
  472. *
  473. * Init smacker decoder
  474. *
  475. */
  476. static av_cold int decode_init(AVCodecContext *avctx)
  477. {
  478. SmackVContext * const c = avctx->priv_data;
  479. c->avctx = avctx;
  480. avctx->pix_fmt = AV_PIX_FMT_PAL8;
  481. avcodec_get_frame_defaults(&c->pic);
  482. /* decode huffman trees from extradata */
  483. if(avctx->extradata_size < 16){
  484. av_log(avctx, AV_LOG_ERROR, "Extradata missing!\n");
  485. return AVERROR(EINVAL);
  486. }
  487. if (decode_header_trees(c))
  488. return AVERROR_INVALIDDATA;
  489. return 0;
  490. }
  491. /*
  492. *
  493. * Uninit smacker decoder
  494. *
  495. */
  496. static av_cold int decode_end(AVCodecContext *avctx)
  497. {
  498. SmackVContext * const smk = avctx->priv_data;
  499. av_freep(&smk->mmap_tbl);
  500. av_freep(&smk->mclr_tbl);
  501. av_freep(&smk->full_tbl);
  502. av_freep(&smk->type_tbl);
  503. if (smk->pic.data[0])
  504. avctx->release_buffer(avctx, &smk->pic);
  505. return 0;
  506. }
  507. typedef struct SmackerAudioContext {
  508. AVFrame frame;
  509. } SmackerAudioContext;
  510. static av_cold int smka_decode_init(AVCodecContext *avctx)
  511. {
  512. SmackerAudioContext *s = avctx->priv_data;
  513. if (avctx->channels < 1 || avctx->channels > 2) {
  514. av_log(avctx, AV_LOG_ERROR, "invalid number of channels\n");
  515. return AVERROR(EINVAL);
  516. }
  517. avctx->channel_layout = (avctx->channels==2) ? AV_CH_LAYOUT_STEREO : AV_CH_LAYOUT_MONO;
  518. avctx->sample_fmt = avctx->bits_per_coded_sample == 8 ? AV_SAMPLE_FMT_U8 : AV_SAMPLE_FMT_S16;
  519. avcodec_get_frame_defaults(&s->frame);
  520. avctx->coded_frame = &s->frame;
  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. SmackerAudioContext *s = avctx->priv_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. s->frame.nb_samples = unp_size / (avctx->channels * (bits + 1));
  569. if ((ret = avctx->get_buffer(avctx, &s->frame)) < 0) {
  570. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  571. return ret;
  572. }
  573. samples = (int16_t *)s->frame.data[0];
  574. samples8 = s->frame.data[0];
  575. // Initialize
  576. for(i = 0; i < (1 << (bits + stereo)); i++) {
  577. h[i].length = 256;
  578. h[i].maxlength = 0;
  579. h[i].current = 0;
  580. h[i].bits = av_mallocz(256 * 4);
  581. h[i].lengths = av_mallocz(256 * sizeof(int));
  582. h[i].values = av_mallocz(256 * sizeof(int));
  583. skip_bits1(&gb);
  584. res = smacker_decode_tree(&gb, &h[i], 0, 0);
  585. if (res < 0)
  586. return res;
  587. skip_bits1(&gb);
  588. if(h[i].current > 1) {
  589. res = init_vlc(&vlc[i], SMKTREE_BITS, h[i].length,
  590. h[i].lengths, sizeof(int), sizeof(int),
  591. h[i].bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);
  592. if(res < 0) {
  593. av_log(avctx, AV_LOG_ERROR, "Cannot build VLC table\n");
  594. return AVERROR_INVALIDDATA;
  595. }
  596. }
  597. }
  598. if(bits) { //decode 16-bit data
  599. for(i = stereo; i >= 0; i--)
  600. pred[i] = sign_extend(av_bswap16(get_bits(&gb, 16)), 16);
  601. for(i = 0; i <= stereo; i++)
  602. *samples++ = pred[i];
  603. for(; i < unp_size / 2; i++) {
  604. if(get_bits_left(&gb)<0)
  605. return AVERROR_INVALIDDATA;
  606. if(i & stereo) {
  607. if(vlc[2].table)
  608. res = get_vlc2(&gb, vlc[2].table, SMKTREE_BITS, 3);
  609. else
  610. res = 0;
  611. if (res < 0) {
  612. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  613. return AVERROR_INVALIDDATA;
  614. }
  615. val = h[2].values[res];
  616. if(vlc[3].table)
  617. res = get_vlc2(&gb, vlc[3].table, SMKTREE_BITS, 3);
  618. else
  619. res = 0;
  620. if (res < 0) {
  621. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  622. return AVERROR_INVALIDDATA;
  623. }
  624. val |= h[3].values[res] << 8;
  625. pred[1] += sign_extend(val, 16);
  626. *samples++ = av_clip_int16(pred[1]);
  627. } else {
  628. if(vlc[0].table)
  629. res = get_vlc2(&gb, vlc[0].table, SMKTREE_BITS, 3);
  630. else
  631. res = 0;
  632. if (res < 0) {
  633. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  634. return AVERROR_INVALIDDATA;
  635. }
  636. val = h[0].values[res];
  637. if(vlc[1].table)
  638. res = get_vlc2(&gb, vlc[1].table, SMKTREE_BITS, 3);
  639. else
  640. res = 0;
  641. if (res < 0) {
  642. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  643. return AVERROR_INVALIDDATA;
  644. }
  645. val |= h[1].values[res] << 8;
  646. pred[0] += sign_extend(val, 16);
  647. *samples++ = av_clip_int16(pred[0]);
  648. }
  649. }
  650. } else { //8-bit data
  651. for(i = stereo; i >= 0; i--)
  652. pred[i] = get_bits(&gb, 8);
  653. for(i = 0; i <= stereo; i++)
  654. *samples8++ = pred[i];
  655. for(; i < unp_size; i++) {
  656. if(get_bits_left(&gb)<0)
  657. return AVERROR_INVALIDDATA;
  658. if(i & stereo){
  659. if(vlc[1].table)
  660. res = get_vlc2(&gb, vlc[1].table, SMKTREE_BITS, 3);
  661. else
  662. res = 0;
  663. if (res < 0) {
  664. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  665. return AVERROR_INVALIDDATA;
  666. }
  667. pred[1] += sign_extend(h[1].values[res], 8);
  668. *samples8++ = av_clip_uint8(pred[1]);
  669. } else {
  670. if(vlc[0].table)
  671. res = get_vlc2(&gb, vlc[0].table, SMKTREE_BITS, 3);
  672. else
  673. res = 0;
  674. if (res < 0) {
  675. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  676. return AVERROR_INVALIDDATA;
  677. }
  678. pred[0] += sign_extend(h[0].values[res], 8);
  679. *samples8++ = av_clip_uint8(pred[0]);
  680. }
  681. }
  682. }
  683. for(i = 0; i < 4; i++) {
  684. if(vlc[i].table)
  685. ff_free_vlc(&vlc[i]);
  686. av_free(h[i].bits);
  687. av_free(h[i].lengths);
  688. av_free(h[i].values);
  689. }
  690. *got_frame_ptr = 1;
  691. *(AVFrame *)data = s->frame;
  692. return buf_size;
  693. }
  694. AVCodec ff_smacker_decoder = {
  695. .name = "smackvid",
  696. .type = AVMEDIA_TYPE_VIDEO,
  697. .id = AV_CODEC_ID_SMACKVIDEO,
  698. .priv_data_size = sizeof(SmackVContext),
  699. .init = decode_init,
  700. .close = decode_end,
  701. .decode = decode_frame,
  702. .capabilities = CODEC_CAP_DR1,
  703. .long_name = NULL_IF_CONFIG_SMALL("Smacker video"),
  704. };
  705. AVCodec ff_smackaud_decoder = {
  706. .name = "smackaud",
  707. .type = AVMEDIA_TYPE_AUDIO,
  708. .id = AV_CODEC_ID_SMACKAUDIO,
  709. .priv_data_size = sizeof(SmackerAudioContext),
  710. .init = smka_decode_init,
  711. .decode = smka_decode_frame,
  712. .capabilities = CODEC_CAP_DR1,
  713. .long_name = NULL_IF_CONFIG_SMALL("Smacker audio"),
  714. };