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.

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