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.

713 lines
20KB

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