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.

720 lines
21KB

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