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.

716 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
  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 = ctx->v1->table ? get_vlc2(gb, ctx->v1->table, SMKTREE_BITS, 3) : 0;
  124. b1 = get_bits_count(gb) - b1;
  125. b2 = get_bits_count(gb);
  126. i2 = ctx->v2->table ? get_vlc2(gb, ctx->v2->table, SMKTREE_BITS, 3) : 0;
  127. b2 = get_bits_count(gb) - b2;
  128. if (i1 < 0 || i2 < 0)
  129. return -1;
  130. val = ctx->recode1[i1] | (ctx->recode2[i2] << 8);
  131. if(val == ctx->escapes[0]) {
  132. ctx->last[0] = hc->current;
  133. val = 0;
  134. } else if(val == ctx->escapes[1]) {
  135. ctx->last[1] = hc->current;
  136. val = 0;
  137. } else if(val == ctx->escapes[2]) {
  138. ctx->last[2] = hc->current;
  139. val = 0;
  140. }
  141. hc->values[hc->current++] = val;
  142. return 1;
  143. } else { //Node
  144. int r = 0, t;
  145. t = hc->current++;
  146. r = smacker_decode_bigtree(gb, hc, ctx);
  147. if(r < 0)
  148. return r;
  149. hc->values[t] = SMK_NODE | r;
  150. r++;
  151. r += smacker_decode_bigtree(gb, hc, ctx);
  152. return r;
  153. }
  154. }
  155. /**
  156. * Store large tree as FFmpeg'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];
  164. int escapes[3];
  165. DBCtx ctx;
  166. if(size >= UINT_MAX>>4){ // (((size + 3) >> 2) + 3) << 2 must not overflow
  167. av_log(smk->avctx, AV_LOG_ERROR, "size too large\n");
  168. return -1;
  169. }
  170. tmp1.length = 256;
  171. tmp1.maxlength = 0;
  172. tmp1.current = 0;
  173. tmp1.bits = av_mallocz(256 * 4);
  174. tmp1.lengths = av_mallocz(256 * sizeof(int));
  175. tmp1.values = av_mallocz(256 * sizeof(int));
  176. tmp2.length = 256;
  177. tmp2.maxlength = 0;
  178. tmp2.current = 0;
  179. tmp2.bits = av_mallocz(256 * 4);
  180. tmp2.lengths = av_mallocz(256 * sizeof(int));
  181. tmp2.values = av_mallocz(256 * sizeof(int));
  182. memset(&vlc[0], 0, sizeof(VLC));
  183. memset(&vlc[1], 0, sizeof(VLC));
  184. if(get_bits1(gb)) {
  185. smacker_decode_tree(gb, &tmp1, 0, 0);
  186. skip_bits1(gb);
  187. res = init_vlc(&vlc[0], SMKTREE_BITS, tmp1.length,
  188. tmp1.lengths, sizeof(int), sizeof(int),
  189. tmp1.bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);
  190. if(res < 0) {
  191. av_log(smk->avctx, AV_LOG_ERROR, "Cannot build VLC table\n");
  192. return -1;
  193. }
  194. } else {
  195. av_log(smk->avctx, AV_LOG_ERROR, "Skipping low bytes tree\n");
  196. }
  197. if(get_bits1(gb)){
  198. smacker_decode_tree(gb, &tmp2, 0, 0);
  199. skip_bits1(gb);
  200. res = init_vlc(&vlc[1], SMKTREE_BITS, tmp2.length,
  201. tmp2.lengths, sizeof(int), sizeof(int),
  202. tmp2.bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);
  203. if(res < 0) {
  204. av_log(smk->avctx, AV_LOG_ERROR, "Cannot build VLC table\n");
  205. return -1;
  206. }
  207. } else {
  208. av_log(smk->avctx, AV_LOG_ERROR, "Skipping high bytes tree\n");
  209. }
  210. escapes[0] = get_bits(gb, 8);
  211. escapes[0] |= get_bits(gb, 8) << 8;
  212. escapes[1] = get_bits(gb, 8);
  213. escapes[1] |= get_bits(gb, 8) << 8;
  214. escapes[2] = get_bits(gb, 8);
  215. escapes[2] |= get_bits(gb, 8) << 8;
  216. last[0] = last[1] = last[2] = -1;
  217. ctx.escapes[0] = escapes[0];
  218. ctx.escapes[1] = escapes[1];
  219. ctx.escapes[2] = escapes[2];
  220. ctx.v1 = &vlc[0];
  221. ctx.v2 = &vlc[1];
  222. ctx.recode1 = tmp1.values;
  223. ctx.recode2 = tmp2.values;
  224. ctx.last = last;
  225. huff.length = ((size + 3) >> 2) + 3;
  226. huff.maxlength = 0;
  227. huff.current = 0;
  228. huff.values = av_mallocz(huff.length * sizeof(int));
  229. smacker_decode_bigtree(gb, &huff, &ctx);
  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. free_vlc(&vlc[0]);
  237. if(vlc[1].table)
  238. 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 0;
  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, b;
  300. b = get_bits_count(gb);
  301. while(*table & SMK_NODE) {
  302. if(get_bits1(gb))
  303. table += (*table) & (~SMK_NODE);
  304. table++;
  305. }
  306. v = *table;
  307. b = get_bits_count(gb) - b;
  308. if(v != recode[last[0]]) {
  309. recode[last[2]] = recode[last[1]];
  310. recode[last[1]] = recode[last[0]];
  311. recode[last[0]] = v;
  312. }
  313. return v;
  314. }
  315. static int decode_frame(AVCodecContext *avctx, void *data, int *data_size, AVPacket *avpkt)
  316. {
  317. const uint8_t *buf = avpkt->data;
  318. int buf_size = avpkt->size;
  319. SmackVContext * const smk = avctx->priv_data;
  320. uint8_t *out;
  321. uint32_t *pal;
  322. GetBitContext gb;
  323. int blocks, blk, bw, bh;
  324. int i;
  325. int stride;
  326. if(buf_size <= 769)
  327. return 0;
  328. smk->pic.reference = 1;
  329. smk->pic.buffer_hints = FF_BUFFER_HINTS_VALID | FF_BUFFER_HINTS_PRESERVE | FF_BUFFER_HINTS_REUSABLE;
  330. if(avctx->reget_buffer(avctx, &smk->pic) < 0){
  331. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  332. return -1;
  333. }
  334. /* make the palette available on the way out */
  335. pal = (uint32_t*)smk->pic.data[1];
  336. smk->pic.palette_has_changed = buf[0] & 1;
  337. smk->pic.key_frame = !!(buf[0] & 2);
  338. if(smk->pic.key_frame)
  339. smk->pic.pict_type = AV_PICTURE_TYPE_I;
  340. else
  341. smk->pic.pict_type = AV_PICTURE_TYPE_P;
  342. buf++;
  343. for(i = 0; i < 256; i++)
  344. *pal++ = bytestream_get_be24(&buf);
  345. buf_size -= 769;
  346. last_reset(smk->mmap_tbl, smk->mmap_last);
  347. last_reset(smk->mclr_tbl, smk->mclr_last);
  348. last_reset(smk->full_tbl, smk->full_last);
  349. last_reset(smk->type_tbl, smk->type_last);
  350. init_get_bits(&gb, buf, buf_size * 8);
  351. blk = 0;
  352. bw = avctx->width >> 2;
  353. bh = avctx->height >> 2;
  354. blocks = bw * bh;
  355. out = smk->pic.data[0];
  356. stride = smk->pic.linesize[0];
  357. while(blk < blocks) {
  358. int type, run, mode;
  359. uint16_t pix;
  360. type = smk_get_code(&gb, smk->type_tbl, smk->type_last);
  361. run = block_runs[(type >> 2) & 0x3F];
  362. switch(type & 3){
  363. case SMK_BLK_MONO:
  364. while(run-- && blk < blocks){
  365. int clr, map;
  366. int hi, lo;
  367. clr = smk_get_code(&gb, smk->mclr_tbl, smk->mclr_last);
  368. map = smk_get_code(&gb, smk->mmap_tbl, smk->mmap_last);
  369. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  370. hi = clr >> 8;
  371. lo = clr & 0xFF;
  372. for(i = 0; i < 4; i++) {
  373. if(map & 1) out[0] = hi; else out[0] = lo;
  374. if(map & 2) out[1] = hi; else out[1] = lo;
  375. if(map & 4) out[2] = hi; else out[2] = lo;
  376. if(map & 8) out[3] = hi; else out[3] = lo;
  377. map >>= 4;
  378. out += stride;
  379. }
  380. blk++;
  381. }
  382. break;
  383. case SMK_BLK_FULL:
  384. mode = 0;
  385. if(avctx->codec_tag == MKTAG('S', 'M', 'K', '4')) { // In case of Smacker v4 we have three modes
  386. if(get_bits1(&gb)) mode = 1;
  387. else if(get_bits1(&gb)) mode = 2;
  388. }
  389. while(run-- && blk < blocks){
  390. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  391. switch(mode){
  392. case 0:
  393. for(i = 0; i < 4; i++) {
  394. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  395. AV_WL16(out+2,pix);
  396. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  397. AV_WL16(out,pix);
  398. out += stride;
  399. }
  400. break;
  401. case 1:
  402. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  403. out[0] = out[1] = pix & 0xFF;
  404. out[2] = out[3] = pix >> 8;
  405. out += stride;
  406. out[0] = out[1] = pix & 0xFF;
  407. out[2] = out[3] = pix >> 8;
  408. out += stride;
  409. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  410. out[0] = out[1] = pix & 0xFF;
  411. out[2] = out[3] = pix >> 8;
  412. out += stride;
  413. out[0] = out[1] = pix & 0xFF;
  414. out[2] = out[3] = pix >> 8;
  415. out += stride;
  416. break;
  417. case 2:
  418. for(i = 0; i < 2; i++) {
  419. uint16_t pix1, pix2;
  420. pix2 = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  421. pix1 = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  422. AV_WL16(out,pix1);
  423. AV_WL16(out+2,pix2);
  424. out += stride;
  425. AV_WL16(out,pix1);
  426. AV_WL16(out+2,pix2);
  427. out += stride;
  428. }
  429. break;
  430. }
  431. blk++;
  432. }
  433. break;
  434. case SMK_BLK_SKIP:
  435. while(run-- && blk < blocks)
  436. blk++;
  437. break;
  438. case SMK_BLK_FILL:
  439. mode = type >> 8;
  440. while(run-- && blk < blocks){
  441. uint32_t col;
  442. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  443. col = mode * 0x01010101;
  444. for(i = 0; i < 4; i++) {
  445. *((uint32_t*)out) = col;
  446. out += stride;
  447. }
  448. blk++;
  449. }
  450. break;
  451. }
  452. }
  453. *data_size = sizeof(AVFrame);
  454. *(AVFrame*)data = smk->pic;
  455. /* always report that the buffer was completely consumed */
  456. return buf_size;
  457. }
  458. /*
  459. *
  460. * Init smacker decoder
  461. *
  462. */
  463. static av_cold int decode_init(AVCodecContext *avctx)
  464. {
  465. SmackVContext * const c = avctx->priv_data;
  466. c->avctx = avctx;
  467. avctx->pix_fmt = PIX_FMT_PAL8;
  468. avcodec_get_frame_defaults(&c->pic);
  469. /* decode huffman trees from extradata */
  470. if(avctx->extradata_size < 16){
  471. av_log(avctx, AV_LOG_ERROR, "Extradata missing!\n");
  472. return -1;
  473. }
  474. if (decode_header_trees(c))
  475. return -1;
  476. return 0;
  477. }
  478. /*
  479. *
  480. * Uninit smacker decoder
  481. *
  482. */
  483. static av_cold int decode_end(AVCodecContext *avctx)
  484. {
  485. SmackVContext * const smk = avctx->priv_data;
  486. av_freep(&smk->mmap_tbl);
  487. av_freep(&smk->mclr_tbl);
  488. av_freep(&smk->full_tbl);
  489. av_freep(&smk->type_tbl);
  490. if (smk->pic.data[0])
  491. avctx->release_buffer(avctx, &smk->pic);
  492. return 0;
  493. }
  494. static av_cold int smka_decode_init(AVCodecContext *avctx)
  495. {
  496. avctx->channel_layout = (avctx->channels==2) ? AV_CH_LAYOUT_STEREO : AV_CH_LAYOUT_MONO;
  497. avctx->sample_fmt = avctx->bits_per_coded_sample == 8 ? AV_SAMPLE_FMT_U8 : AV_SAMPLE_FMT_S16;
  498. return 0;
  499. }
  500. /**
  501. * Decode Smacker audio data
  502. */
  503. static int smka_decode_frame(AVCodecContext *avctx, void *data, int *data_size, AVPacket *avpkt)
  504. {
  505. const uint8_t *buf = avpkt->data;
  506. int buf_size = avpkt->size;
  507. GetBitContext gb;
  508. HuffContext h[4];
  509. VLC vlc[4];
  510. int16_t *samples = data;
  511. int8_t *samples8 = data;
  512. int val;
  513. int i, res;
  514. int unp_size;
  515. int bits, stereo;
  516. int pred[2] = {0, 0};
  517. unp_size = AV_RL32(buf);
  518. init_get_bits(&gb, buf + 4, (buf_size - 4) * 8);
  519. if(!get_bits1(&gb)){
  520. av_log(avctx, AV_LOG_INFO, "Sound: no data\n");
  521. *data_size = 0;
  522. return 1;
  523. }
  524. stereo = get_bits1(&gb);
  525. bits = get_bits1(&gb);
  526. if (unp_size & 0xC0000000 || unp_size > *data_size) {
  527. av_log(avctx, AV_LOG_ERROR, "Frame is too large to fit in buffer\n");
  528. return -1;
  529. }
  530. memset(vlc, 0, sizeof(VLC) * 4);
  531. memset(h, 0, sizeof(HuffContext) * 4);
  532. // Initialize
  533. for(i = 0; i < (1 << (bits + stereo)); i++) {
  534. h[i].length = 256;
  535. h[i].maxlength = 0;
  536. h[i].current = 0;
  537. h[i].bits = av_mallocz(256 * 4);
  538. h[i].lengths = av_mallocz(256 * sizeof(int));
  539. h[i].values = av_mallocz(256 * sizeof(int));
  540. skip_bits1(&gb);
  541. smacker_decode_tree(&gb, &h[i], 0, 0);
  542. skip_bits1(&gb);
  543. if(h[i].current > 1) {
  544. res = init_vlc(&vlc[i], SMKTREE_BITS, h[i].length,
  545. h[i].lengths, sizeof(int), sizeof(int),
  546. h[i].bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);
  547. if(res < 0) {
  548. av_log(avctx, AV_LOG_ERROR, "Cannot build VLC table\n");
  549. return -1;
  550. }
  551. }
  552. }
  553. if(bits) { //decode 16-bit data
  554. for(i = stereo; i >= 0; i--)
  555. pred[i] = av_bswap16(get_bits(&gb, 16));
  556. for(i = 0; i <= stereo; i++)
  557. *samples++ = pred[i];
  558. for(; i < unp_size / 2; i++) {
  559. if(i & stereo) {
  560. if(vlc[2].table)
  561. res = get_vlc2(&gb, vlc[2].table, SMKTREE_BITS, 3);
  562. else
  563. res = 0;
  564. val = h[2].values[res];
  565. if(vlc[3].table)
  566. res = get_vlc2(&gb, vlc[3].table, SMKTREE_BITS, 3);
  567. else
  568. res = 0;
  569. val |= h[3].values[res] << 8;
  570. pred[1] += (int16_t)val;
  571. *samples++ = pred[1];
  572. } else {
  573. if(vlc[0].table)
  574. res = get_vlc2(&gb, vlc[0].table, SMKTREE_BITS, 3);
  575. else
  576. res = 0;
  577. val = h[0].values[res];
  578. if(vlc[1].table)
  579. res = get_vlc2(&gb, vlc[1].table, SMKTREE_BITS, 3);
  580. else
  581. res = 0;
  582. val |= h[1].values[res] << 8;
  583. pred[0] += val;
  584. *samples++ = pred[0];
  585. }
  586. }
  587. } else { //8-bit data
  588. for(i = stereo; i >= 0; i--)
  589. pred[i] = get_bits(&gb, 8);
  590. for(i = 0; i <= stereo; i++)
  591. *samples8++ = pred[i];
  592. for(; i < unp_size; i++) {
  593. if(i & stereo){
  594. if(vlc[1].table)
  595. res = get_vlc2(&gb, vlc[1].table, SMKTREE_BITS, 3);
  596. else
  597. res = 0;
  598. pred[1] += (int8_t)h[1].values[res];
  599. *samples8++ = pred[1];
  600. } else {
  601. if(vlc[0].table)
  602. res = get_vlc2(&gb, vlc[0].table, SMKTREE_BITS, 3);
  603. else
  604. res = 0;
  605. pred[0] += (int8_t)h[0].values[res];
  606. *samples8++ = pred[0];
  607. }
  608. }
  609. }
  610. for(i = 0; i < 4; i++) {
  611. if(vlc[i].table)
  612. free_vlc(&vlc[i]);
  613. av_free(h[i].bits);
  614. av_free(h[i].lengths);
  615. av_free(h[i].values);
  616. }
  617. *data_size = unp_size;
  618. return buf_size;
  619. }
  620. AVCodec ff_smacker_decoder = {
  621. .name = "smackvid",
  622. .type = AVMEDIA_TYPE_VIDEO,
  623. .id = CODEC_ID_SMACKVIDEO,
  624. .priv_data_size = sizeof(SmackVContext),
  625. .init = decode_init,
  626. .close = decode_end,
  627. .decode = decode_frame,
  628. .capabilities = CODEC_CAP_DR1,
  629. .long_name = NULL_IF_CONFIG_SMALL("Smacker video"),
  630. };
  631. AVCodec ff_smackaud_decoder = {
  632. .name = "smackaud",
  633. .type = AVMEDIA_TYPE_AUDIO,
  634. .id = CODEC_ID_SMACKAUDIO,
  635. .init = smka_decode_init,
  636. .decode = smka_decode_frame,
  637. .long_name = NULL_IF_CONFIG_SMALL("Smacker audio"),
  638. };