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.

736 lines
22KB

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