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
21KB

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