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.

734 lines
22KB

  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 ALT_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(!get_bits1(gb)){ //Leaf
  87. if(hc->current >= 256){
  88. av_log(NULL, AV_LOG_ERROR, "Tree size exceeded!\n");
  89. return -1;
  90. }
  91. if(length){
  92. hc->bits[hc->current] = prefix;
  93. hc->lengths[hc->current] = length;
  94. } else {
  95. hc->bits[hc->current] = 0;
  96. hc->lengths[hc->current] = 0;
  97. }
  98. hc->values[hc->current] = get_bits(gb, 8);
  99. hc->current++;
  100. if(hc->maxlength < length)
  101. hc->maxlength = length;
  102. return 0;
  103. } else { //Node
  104. int r;
  105. length++;
  106. r = smacker_decode_tree(gb, hc, prefix, length);
  107. if(r)
  108. return r;
  109. return smacker_decode_tree(gb, hc, prefix | (1 << (length - 1)), length);
  110. }
  111. }
  112. /**
  113. * Decode header tree
  114. */
  115. static int smacker_decode_bigtree(GetBitContext *gb, HuffContext *hc, DBCtx *ctx)
  116. {
  117. if(!get_bits1(gb)){ //Leaf
  118. int val, i1, i2, b1, b2;
  119. if(hc->current >= hc->length){
  120. av_log(NULL, AV_LOG_ERROR, "Tree size exceeded!\n");
  121. return -1;
  122. }
  123. b1 = get_bits_count(gb);
  124. i1 = ctx->v1->table ? get_vlc2(gb, ctx->v1->table, SMKTREE_BITS, 3) : 0;
  125. b1 = get_bits_count(gb) - b1;
  126. b2 = get_bits_count(gb);
  127. i2 = ctx->v2->table ? get_vlc2(gb, ctx->v2->table, SMKTREE_BITS, 3) : 0;
  128. b2 = get_bits_count(gb) - b2;
  129. if (i1 < 0 || i2 < 0)
  130. return -1;
  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, 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 += smacker_decode_bigtree(gb, hc, ctx);
  153. return r;
  154. }
  155. }
  156. /**
  157. * Store large tree as FFmpeg's vlc codes
  158. */
  159. static int smacker_decode_header_tree(SmackVContext *smk, GetBitContext *gb, int **recodes, int *last, int size)
  160. {
  161. int res;
  162. HuffContext huff;
  163. HuffContext tmp1, tmp2;
  164. VLC vlc[2];
  165. int escapes[3];
  166. DBCtx ctx;
  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. memset(&vlc[0], 0, sizeof(VLC));
  184. memset(&vlc[1], 0, sizeof(VLC));
  185. if(get_bits1(gb)) {
  186. smacker_decode_tree(gb, &tmp1, 0, 0);
  187. skip_bits1(gb);
  188. res = init_vlc(&vlc[0], SMKTREE_BITS, tmp1.length,
  189. tmp1.lengths, sizeof(int), sizeof(int),
  190. tmp1.bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);
  191. if(res < 0) {
  192. av_log(smk->avctx, AV_LOG_ERROR, "Cannot build VLC table\n");
  193. return -1;
  194. }
  195. } else {
  196. av_log(smk->avctx, AV_LOG_ERROR, "Skipping low bytes tree\n");
  197. }
  198. if(get_bits1(gb)){
  199. smacker_decode_tree(gb, &tmp2, 0, 0);
  200. skip_bits1(gb);
  201. res = init_vlc(&vlc[1], SMKTREE_BITS, tmp2.length,
  202. tmp2.lengths, sizeof(int), sizeof(int),
  203. tmp2.bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);
  204. if(res < 0) {
  205. av_log(smk->avctx, AV_LOG_ERROR, "Cannot build VLC table\n");
  206. return -1;
  207. }
  208. } else {
  209. av_log(smk->avctx, AV_LOG_ERROR, "Skipping high bytes tree\n");
  210. }
  211. escapes[0] = get_bits(gb, 8);
  212. escapes[0] |= get_bits(gb, 8) << 8;
  213. escapes[1] = get_bits(gb, 8);
  214. escapes[1] |= get_bits(gb, 8) << 8;
  215. escapes[2] = get_bits(gb, 8);
  216. escapes[2] |= get_bits(gb, 8) << 8;
  217. last[0] = last[1] = last[2] = -1;
  218. ctx.escapes[0] = escapes[0];
  219. ctx.escapes[1] = escapes[1];
  220. ctx.escapes[2] = escapes[2];
  221. ctx.v1 = &vlc[0];
  222. ctx.v2 = &vlc[1];
  223. ctx.recode1 = tmp1.values;
  224. ctx.recode2 = tmp2.values;
  225. ctx.last = last;
  226. huff.length = ((size + 3) >> 2) + 3;
  227. huff.maxlength = 0;
  228. huff.current = 0;
  229. huff.values = av_mallocz(huff.length * sizeof(int));
  230. smacker_decode_bigtree(gb, &huff, &ctx);
  231. skip_bits1(gb);
  232. if(ctx.last[0] == -1) ctx.last[0] = huff.current++;
  233. if(ctx.last[1] == -1) ctx.last[1] = huff.current++;
  234. if(ctx.last[2] == -1) ctx.last[2] = huff.current++;
  235. *recodes = huff.values;
  236. if(vlc[0].table)
  237. free_vlc(&vlc[0]);
  238. if(vlc[1].table)
  239. free_vlc(&vlc[1]);
  240. av_free(tmp1.bits);
  241. av_free(tmp1.lengths);
  242. av_free(tmp1.values);
  243. av_free(tmp2.bits);
  244. av_free(tmp2.lengths);
  245. av_free(tmp2.values);
  246. return 0;
  247. }
  248. static int decode_header_trees(SmackVContext *smk) {
  249. GetBitContext gb;
  250. int mmap_size, mclr_size, full_size, type_size;
  251. mmap_size = AV_RL32(smk->avctx->extradata);
  252. mclr_size = AV_RL32(smk->avctx->extradata + 4);
  253. full_size = AV_RL32(smk->avctx->extradata + 8);
  254. type_size = AV_RL32(smk->avctx->extradata + 12);
  255. init_get_bits(&gb, smk->avctx->extradata + 16, (smk->avctx->extradata_size - 16) * 8);
  256. if(!get_bits1(&gb)) {
  257. av_log(smk->avctx, AV_LOG_INFO, "Skipping MMAP tree\n");
  258. smk->mmap_tbl = av_malloc(sizeof(int) * 2);
  259. smk->mmap_tbl[0] = 0;
  260. smk->mmap_last[0] = smk->mmap_last[1] = smk->mmap_last[2] = 1;
  261. } else {
  262. if (smacker_decode_header_tree(smk, &gb, &smk->mmap_tbl, smk->mmap_last, mmap_size))
  263. return -1;
  264. }
  265. if(!get_bits1(&gb)) {
  266. av_log(smk->avctx, AV_LOG_INFO, "Skipping MCLR tree\n");
  267. smk->mclr_tbl = av_malloc(sizeof(int) * 2);
  268. smk->mclr_tbl[0] = 0;
  269. smk->mclr_last[0] = smk->mclr_last[1] = smk->mclr_last[2] = 1;
  270. } else {
  271. if (smacker_decode_header_tree(smk, &gb, &smk->mclr_tbl, smk->mclr_last, mclr_size))
  272. return -1;
  273. }
  274. if(!get_bits1(&gb)) {
  275. av_log(smk->avctx, AV_LOG_INFO, "Skipping FULL tree\n");
  276. smk->full_tbl = av_malloc(sizeof(int) * 2);
  277. smk->full_tbl[0] = 0;
  278. smk->full_last[0] = smk->full_last[1] = smk->full_last[2] = 1;
  279. } else {
  280. if (smacker_decode_header_tree(smk, &gb, &smk->full_tbl, smk->full_last, full_size))
  281. return -1;
  282. }
  283. if(!get_bits1(&gb)) {
  284. av_log(smk->avctx, AV_LOG_INFO, "Skipping TYPE tree\n");
  285. smk->type_tbl = av_malloc(sizeof(int) * 2);
  286. smk->type_tbl[0] = 0;
  287. smk->type_last[0] = smk->type_last[1] = smk->type_last[2] = 1;
  288. } else {
  289. if (smacker_decode_header_tree(smk, &gb, &smk->type_tbl, smk->type_last, type_size))
  290. return -1;
  291. }
  292. return 0;
  293. }
  294. static av_always_inline void last_reset(int *recode, int *last) {
  295. recode[last[0]] = recode[last[1]] = recode[last[2]] = 0;
  296. }
  297. /* get code and update history */
  298. static av_always_inline int smk_get_code(GetBitContext *gb, int *recode, int *last) {
  299. register int *table = recode;
  300. int v, b;
  301. b = get_bits_count(gb);
  302. while(*table & SMK_NODE) {
  303. if(get_bits1(gb))
  304. table += (*table) & (~SMK_NODE);
  305. table++;
  306. }
  307. v = *table;
  308. b = get_bits_count(gb) - b;
  309. if(v != recode[last[0]]) {
  310. recode[last[2]] = recode[last[1]];
  311. recode[last[1]] = recode[last[0]];
  312. recode[last[0]] = v;
  313. }
  314. return v;
  315. }
  316. static int decode_frame(AVCodecContext *avctx, void *data, int *data_size, AVPacket *avpkt)
  317. {
  318. const uint8_t *buf = avpkt->data;
  319. int buf_size = avpkt->size;
  320. SmackVContext * const smk = avctx->priv_data;
  321. uint8_t *out;
  322. uint32_t *pal;
  323. GetBitContext gb;
  324. int blocks, blk, bw, bh;
  325. int i;
  326. int stride;
  327. if(buf_size <= 769)
  328. return 0;
  329. smk->pic.reference = 3;
  330. smk->pic.buffer_hints = FF_BUFFER_HINTS_VALID | FF_BUFFER_HINTS_PRESERVE | FF_BUFFER_HINTS_REUSABLE;
  331. if(avctx->reget_buffer(avctx, &smk->pic) < 0){
  332. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  333. return -1;
  334. }
  335. /* make the palette available on the way out */
  336. pal = (uint32_t*)smk->pic.data[1];
  337. smk->pic.palette_has_changed = buf[0] & 1;
  338. smk->pic.key_frame = !!(buf[0] & 2);
  339. if(smk->pic.key_frame)
  340. smk->pic.pict_type = AV_PICTURE_TYPE_I;
  341. else
  342. smk->pic.pict_type = AV_PICTURE_TYPE_P;
  343. buf++;
  344. for(i = 0; i < 256; i++)
  345. *pal++ = 0xFF << 24 | bytestream_get_be24(&buf);
  346. buf_size -= 769;
  347. last_reset(smk->mmap_tbl, smk->mmap_last);
  348. last_reset(smk->mclr_tbl, smk->mclr_last);
  349. last_reset(smk->full_tbl, smk->full_last);
  350. last_reset(smk->type_tbl, smk->type_last);
  351. init_get_bits(&gb, buf, buf_size * 8);
  352. blk = 0;
  353. bw = avctx->width >> 2;
  354. bh = avctx->height >> 2;
  355. blocks = bw * bh;
  356. out = smk->pic.data[0];
  357. stride = smk->pic.linesize[0];
  358. while(blk < blocks) {
  359. int type, run, mode;
  360. uint16_t pix;
  361. type = smk_get_code(&gb, smk->type_tbl, smk->type_last);
  362. run = block_runs[(type >> 2) & 0x3F];
  363. switch(type & 3){
  364. case SMK_BLK_MONO:
  365. while(run-- && blk < blocks){
  366. int clr, map;
  367. int hi, lo;
  368. clr = smk_get_code(&gb, smk->mclr_tbl, smk->mclr_last);
  369. map = smk_get_code(&gb, smk->mmap_tbl, smk->mmap_last);
  370. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  371. hi = clr >> 8;
  372. lo = clr & 0xFF;
  373. for(i = 0; i < 4; i++) {
  374. if(map & 1) out[0] = hi; else out[0] = lo;
  375. if(map & 2) out[1] = hi; else out[1] = lo;
  376. if(map & 4) out[2] = hi; else out[2] = lo;
  377. if(map & 8) out[3] = hi; else out[3] = lo;
  378. map >>= 4;
  379. out += stride;
  380. }
  381. blk++;
  382. }
  383. break;
  384. case SMK_BLK_FULL:
  385. mode = 0;
  386. if(avctx->codec_tag == MKTAG('S', 'M', 'K', '4')) { // In case of Smacker v4 we have three modes
  387. if(get_bits1(&gb)) mode = 1;
  388. else if(get_bits1(&gb)) mode = 2;
  389. }
  390. while(run-- && blk < blocks){
  391. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  392. switch(mode){
  393. case 0:
  394. for(i = 0; i < 4; i++) {
  395. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  396. AV_WL16(out+2,pix);
  397. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  398. AV_WL16(out,pix);
  399. out += stride;
  400. }
  401. break;
  402. case 1:
  403. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  404. out[0] = out[1] = pix & 0xFF;
  405. out[2] = out[3] = pix >> 8;
  406. out += stride;
  407. out[0] = out[1] = pix & 0xFF;
  408. out[2] = out[3] = pix >> 8;
  409. out += stride;
  410. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  411. out[0] = out[1] = pix & 0xFF;
  412. out[2] = out[3] = pix >> 8;
  413. out += stride;
  414. out[0] = out[1] = pix & 0xFF;
  415. out[2] = out[3] = pix >> 8;
  416. out += stride;
  417. break;
  418. case 2:
  419. for(i = 0; i < 2; i++) {
  420. uint16_t pix1, pix2;
  421. pix2 = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  422. pix1 = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  423. AV_WL16(out,pix1);
  424. AV_WL16(out+2,pix2);
  425. out += stride;
  426. AV_WL16(out,pix1);
  427. AV_WL16(out+2,pix2);
  428. out += stride;
  429. }
  430. break;
  431. }
  432. blk++;
  433. }
  434. break;
  435. case SMK_BLK_SKIP:
  436. while(run-- && blk < blocks)
  437. blk++;
  438. break;
  439. case SMK_BLK_FILL:
  440. mode = type >> 8;
  441. while(run-- && blk < blocks){
  442. uint32_t col;
  443. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  444. col = mode * 0x01010101;
  445. for(i = 0; i < 4; i++) {
  446. *((uint32_t*)out) = col;
  447. out += stride;
  448. }
  449. blk++;
  450. }
  451. break;
  452. }
  453. }
  454. *data_size = sizeof(AVFrame);
  455. *(AVFrame*)data = smk->pic;
  456. /* always report that the buffer was completely consumed */
  457. return buf_size;
  458. }
  459. /*
  460. *
  461. * Init smacker decoder
  462. *
  463. */
  464. static av_cold int decode_init(AVCodecContext *avctx)
  465. {
  466. SmackVContext * const c = avctx->priv_data;
  467. c->avctx = avctx;
  468. avctx->pix_fmt = PIX_FMT_PAL8;
  469. avcodec_get_frame_defaults(&c->pic);
  470. /* decode huffman trees from extradata */
  471. if(avctx->extradata_size < 16){
  472. av_log(avctx, AV_LOG_ERROR, "Extradata missing!\n");
  473. return -1;
  474. }
  475. if (decode_header_trees(c))
  476. return -1;
  477. return 0;
  478. }
  479. /*
  480. *
  481. * Uninit smacker decoder
  482. *
  483. */
  484. static av_cold int decode_end(AVCodecContext *avctx)
  485. {
  486. SmackVContext * const smk = avctx->priv_data;
  487. av_freep(&smk->mmap_tbl);
  488. av_freep(&smk->mclr_tbl);
  489. av_freep(&smk->full_tbl);
  490. av_freep(&smk->type_tbl);
  491. if (smk->pic.data[0])
  492. avctx->release_buffer(avctx, &smk->pic);
  493. return 0;
  494. }
  495. static av_cold int smka_decode_init(AVCodecContext *avctx)
  496. {
  497. if (avctx->channels < 1 || avctx->channels > 2) {
  498. av_log(avctx, AV_LOG_ERROR, "invalid number of channels\n");
  499. return AVERROR(EINVAL);
  500. }
  501. avctx->channel_layout = (avctx->channels==2) ? AV_CH_LAYOUT_STEREO : AV_CH_LAYOUT_MONO;
  502. avctx->sample_fmt = avctx->bits_per_coded_sample == 8 ? AV_SAMPLE_FMT_U8 : AV_SAMPLE_FMT_S16;
  503. return 0;
  504. }
  505. /**
  506. * Decode Smacker audio data
  507. */
  508. static int smka_decode_frame(AVCodecContext *avctx, void *data, int *data_size, AVPacket *avpkt)
  509. {
  510. const uint8_t *buf = avpkt->data;
  511. int buf_size = avpkt->size;
  512. GetBitContext gb;
  513. HuffContext h[4];
  514. VLC vlc[4];
  515. int16_t *samples = data;
  516. uint8_t *samples8 = data;
  517. int val;
  518. int i, res;
  519. int unp_size;
  520. int bits, stereo;
  521. int pred[2] = {0, 0};
  522. if (buf_size <= 4) {
  523. av_log(avctx, AV_LOG_ERROR, "packet is too small\n");
  524. return AVERROR(EINVAL);
  525. }
  526. unp_size = AV_RL32(buf);
  527. init_get_bits(&gb, buf + 4, (buf_size - 4) * 8);
  528. if(!get_bits1(&gb)){
  529. av_log(avctx, AV_LOG_INFO, "Sound: no data\n");
  530. *data_size = 0;
  531. return 1;
  532. }
  533. stereo = get_bits1(&gb);
  534. bits = get_bits1(&gb);
  535. if (unp_size & 0xC0000000 || unp_size > *data_size) {
  536. av_log(avctx, AV_LOG_ERROR, "Frame is too large to fit in buffer\n");
  537. return -1;
  538. }
  539. if (stereo ^ (avctx->channels != 1)) {
  540. av_log(avctx, AV_LOG_ERROR, "channels mismatch\n");
  541. return AVERROR(EINVAL);
  542. }
  543. if (bits && avctx->sample_fmt == AV_SAMPLE_FMT_U8) {
  544. av_log(avctx, AV_LOG_ERROR, "sample format mismatch\n");
  545. return AVERROR(EINVAL);
  546. }
  547. memset(vlc, 0, sizeof(VLC) * 4);
  548. memset(h, 0, sizeof(HuffContext) * 4);
  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] = av_bswap16(get_bits(&gb, 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. free_vlc(&vlc[i]);
  630. av_free(h[i].bits);
  631. av_free(h[i].lengths);
  632. av_free(h[i].values);
  633. }
  634. *data_size = unp_size;
  635. return buf_size;
  636. }
  637. AVCodec ff_smacker_decoder = {
  638. .name = "smackvid",
  639. .type = AVMEDIA_TYPE_VIDEO,
  640. .id = 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 = CODEC_ID_SMACKAUDIO,
  652. .init = smka_decode_init,
  653. .decode = smka_decode_frame,
  654. .long_name = NULL_IF_CONFIG_SMALL("Smacker audio"),
  655. };