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.

746 lines
22KB

  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. #include "mathops.h"
  33. #define 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 (hc->current + 1 >= hc->length) {
  118. av_log(NULL, AV_LOG_ERROR, "Tree size exceeded!\n");
  119. return -1;
  120. }
  121. if(!get_bits1(gb)){ //Leaf
  122. int val, i1, i2;
  123. i1 = ctx->v1->table ? get_vlc2(gb, ctx->v1->table, SMKTREE_BITS, 3) : 0;
  124. i2 = ctx->v2->table ? get_vlc2(gb, ctx->v2->table, SMKTREE_BITS, 3) : 0;
  125. if (i1 < 0 || i2 < 0)
  126. return -1;
  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, r_new, 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_new = smacker_decode_bigtree(gb, hc, ctx);
  149. if (r_new < 0)
  150. return r_new;
  151. return r + r_new;
  152. }
  153. }
  154. /**
  155. * Store large tree as Libav's vlc codes
  156. */
  157. static int smacker_decode_header_tree(SmackVContext *smk, GetBitContext *gb, int **recodes, int *last, int size)
  158. {
  159. int res;
  160. HuffContext huff;
  161. HuffContext tmp1, tmp2;
  162. VLC vlc[2] = { { 0 } };
  163. int escapes[3];
  164. DBCtx ctx;
  165. int err = 0;
  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. 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. if (smacker_decode_bigtree(gb, &huff, &ctx) < 0)
  228. err = -1;
  229. skip_bits1(gb);
  230. if(ctx.last[0] == -1) ctx.last[0] = huff.current++;
  231. if(ctx.last[1] == -1) ctx.last[1] = huff.current++;
  232. if(ctx.last[2] == -1) ctx.last[2] = huff.current++;
  233. *recodes = huff.values;
  234. if(vlc[0].table)
  235. ff_free_vlc(&vlc[0]);
  236. if(vlc[1].table)
  237. ff_free_vlc(&vlc[1]);
  238. av_free(tmp1.bits);
  239. av_free(tmp1.lengths);
  240. av_free(tmp1.values);
  241. av_free(tmp2.bits);
  242. av_free(tmp2.lengths);
  243. av_free(tmp2.values);
  244. return err;
  245. }
  246. static int decode_header_trees(SmackVContext *smk) {
  247. GetBitContext gb;
  248. int mmap_size, mclr_size, full_size, type_size;
  249. mmap_size = AV_RL32(smk->avctx->extradata);
  250. mclr_size = AV_RL32(smk->avctx->extradata + 4);
  251. full_size = AV_RL32(smk->avctx->extradata + 8);
  252. type_size = AV_RL32(smk->avctx->extradata + 12);
  253. init_get_bits(&gb, smk->avctx->extradata + 16, (smk->avctx->extradata_size - 16) * 8);
  254. if(!get_bits1(&gb)) {
  255. av_log(smk->avctx, AV_LOG_INFO, "Skipping MMAP tree\n");
  256. smk->mmap_tbl = av_malloc(sizeof(int) * 2);
  257. smk->mmap_tbl[0] = 0;
  258. smk->mmap_last[0] = smk->mmap_last[1] = smk->mmap_last[2] = 1;
  259. } else {
  260. if (smacker_decode_header_tree(smk, &gb, &smk->mmap_tbl, smk->mmap_last, mmap_size))
  261. return -1;
  262. }
  263. if(!get_bits1(&gb)) {
  264. av_log(smk->avctx, AV_LOG_INFO, "Skipping MCLR tree\n");
  265. smk->mclr_tbl = av_malloc(sizeof(int) * 2);
  266. smk->mclr_tbl[0] = 0;
  267. smk->mclr_last[0] = smk->mclr_last[1] = smk->mclr_last[2] = 1;
  268. } else {
  269. if (smacker_decode_header_tree(smk, &gb, &smk->mclr_tbl, smk->mclr_last, mclr_size))
  270. return -1;
  271. }
  272. if(!get_bits1(&gb)) {
  273. av_log(smk->avctx, AV_LOG_INFO, "Skipping FULL tree\n");
  274. smk->full_tbl = av_malloc(sizeof(int) * 2);
  275. smk->full_tbl[0] = 0;
  276. smk->full_last[0] = smk->full_last[1] = smk->full_last[2] = 1;
  277. } else {
  278. if (smacker_decode_header_tree(smk, &gb, &smk->full_tbl, smk->full_last, full_size))
  279. return -1;
  280. }
  281. if(!get_bits1(&gb)) {
  282. av_log(smk->avctx, AV_LOG_INFO, "Skipping TYPE tree\n");
  283. smk->type_tbl = av_malloc(sizeof(int) * 2);
  284. smk->type_tbl[0] = 0;
  285. smk->type_last[0] = smk->type_last[1] = smk->type_last[2] = 1;
  286. } else {
  287. if (smacker_decode_header_tree(smk, &gb, &smk->type_tbl, smk->type_last, type_size))
  288. return -1;
  289. }
  290. return 0;
  291. }
  292. static av_always_inline void last_reset(int *recode, int *last) {
  293. recode[last[0]] = recode[last[1]] = recode[last[2]] = 0;
  294. }
  295. /* get code and update history */
  296. static av_always_inline int smk_get_code(GetBitContext *gb, int *recode, int *last) {
  297. register int *table = recode;
  298. int v;
  299. while(*table & SMK_NODE) {
  300. if(get_bits1(gb))
  301. table += (*table) & (~SMK_NODE);
  302. table++;
  303. }
  304. v = *table;
  305. if(v != recode[last[0]]) {
  306. recode[last[2]] = recode[last[1]];
  307. recode[last[1]] = recode[last[0]];
  308. recode[last[0]] = v;
  309. }
  310. return v;
  311. }
  312. static int decode_frame(AVCodecContext *avctx, void *data, int *data_size, AVPacket *avpkt)
  313. {
  314. SmackVContext * const smk = avctx->priv_data;
  315. uint8_t *out;
  316. uint32_t *pal;
  317. GetByteContext gb2;
  318. GetBitContext gb;
  319. int blocks, blk, bw, bh;
  320. int i;
  321. int stride;
  322. int flags;
  323. if (avpkt->size <= 769)
  324. return 0;
  325. smk->pic.reference = 1;
  326. smk->pic.buffer_hints = FF_BUFFER_HINTS_VALID | FF_BUFFER_HINTS_PRESERVE | FF_BUFFER_HINTS_REUSABLE;
  327. if(avctx->reget_buffer(avctx, &smk->pic) < 0){
  328. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  329. return -1;
  330. }
  331. /* make the palette available on the way out */
  332. pal = (uint32_t*)smk->pic.data[1];
  333. bytestream2_init(&gb2, avpkt->data, avpkt->size);
  334. flags = bytestream2_get_byteu(&gb2);
  335. smk->pic.palette_has_changed = flags & 1;
  336. smk->pic.key_frame = !!(flags & 2);
  337. if(smk->pic.key_frame)
  338. smk->pic.pict_type = AV_PICTURE_TYPE_I;
  339. else
  340. smk->pic.pict_type = AV_PICTURE_TYPE_P;
  341. for(i = 0; i < 256; i++)
  342. *pal++ = bytestream2_get_be24u(&gb2);
  343. last_reset(smk->mmap_tbl, smk->mmap_last);
  344. last_reset(smk->mclr_tbl, smk->mclr_last);
  345. last_reset(smk->full_tbl, smk->full_last);
  346. last_reset(smk->type_tbl, smk->type_last);
  347. init_get_bits(&gb, avpkt->data + 769, (avpkt->size - 769) * 8);
  348. blk = 0;
  349. bw = avctx->width >> 2;
  350. bh = avctx->height >> 2;
  351. blocks = bw * bh;
  352. out = smk->pic.data[0];
  353. stride = smk->pic.linesize[0];
  354. while(blk < blocks) {
  355. int type, run, mode;
  356. uint16_t pix;
  357. type = smk_get_code(&gb, smk->type_tbl, smk->type_last);
  358. run = block_runs[(type >> 2) & 0x3F];
  359. switch(type & 3){
  360. case SMK_BLK_MONO:
  361. while(run-- && blk < blocks){
  362. int clr, map;
  363. int hi, lo;
  364. clr = smk_get_code(&gb, smk->mclr_tbl, smk->mclr_last);
  365. map = smk_get_code(&gb, smk->mmap_tbl, smk->mmap_last);
  366. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  367. hi = clr >> 8;
  368. lo = clr & 0xFF;
  369. for(i = 0; i < 4; i++) {
  370. if(map & 1) out[0] = hi; else out[0] = lo;
  371. if(map & 2) out[1] = hi; else out[1] = lo;
  372. if(map & 4) out[2] = hi; else out[2] = lo;
  373. if(map & 8) out[3] = hi; else out[3] = lo;
  374. map >>= 4;
  375. out += stride;
  376. }
  377. blk++;
  378. }
  379. break;
  380. case SMK_BLK_FULL:
  381. mode = 0;
  382. if(avctx->codec_tag == MKTAG('S', 'M', 'K', '4')) { // In case of Smacker v4 we have three modes
  383. if(get_bits1(&gb)) mode = 1;
  384. else if(get_bits1(&gb)) mode = 2;
  385. }
  386. while(run-- && blk < blocks){
  387. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  388. switch(mode){
  389. case 0:
  390. for(i = 0; i < 4; i++) {
  391. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  392. AV_WL16(out+2,pix);
  393. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  394. AV_WL16(out,pix);
  395. out += stride;
  396. }
  397. break;
  398. case 1:
  399. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  400. out[0] = out[1] = pix & 0xFF;
  401. out[2] = out[3] = pix >> 8;
  402. out += stride;
  403. out[0] = out[1] = pix & 0xFF;
  404. out[2] = out[3] = pix >> 8;
  405. out += stride;
  406. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  407. out[0] = out[1] = pix & 0xFF;
  408. out[2] = out[3] = pix >> 8;
  409. out += stride;
  410. out[0] = out[1] = pix & 0xFF;
  411. out[2] = out[3] = pix >> 8;
  412. out += stride;
  413. break;
  414. case 2:
  415. for(i = 0; i < 2; i++) {
  416. uint16_t pix1, pix2;
  417. pix2 = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  418. pix1 = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  419. AV_WL16(out,pix1);
  420. AV_WL16(out+2,pix2);
  421. out += stride;
  422. AV_WL16(out,pix1);
  423. AV_WL16(out+2,pix2);
  424. out += stride;
  425. }
  426. break;
  427. }
  428. blk++;
  429. }
  430. break;
  431. case SMK_BLK_SKIP:
  432. while(run-- && blk < blocks)
  433. blk++;
  434. break;
  435. case SMK_BLK_FILL:
  436. mode = type >> 8;
  437. while(run-- && blk < blocks){
  438. uint32_t col;
  439. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  440. col = mode * 0x01010101;
  441. for(i = 0; i < 4; i++) {
  442. *((uint32_t*)out) = col;
  443. out += stride;
  444. }
  445. blk++;
  446. }
  447. break;
  448. }
  449. }
  450. *data_size = sizeof(AVFrame);
  451. *(AVFrame*)data = smk->pic;
  452. /* always report that the buffer was completely consumed */
  453. return avpkt->size;
  454. }
  455. /*
  456. *
  457. * Init smacker decoder
  458. *
  459. */
  460. static av_cold int decode_init(AVCodecContext *avctx)
  461. {
  462. SmackVContext * const c = avctx->priv_data;
  463. c->avctx = avctx;
  464. avctx->pix_fmt = PIX_FMT_PAL8;
  465. /* decode huffman trees from extradata */
  466. if(avctx->extradata_size < 16){
  467. av_log(avctx, AV_LOG_ERROR, "Extradata missing!\n");
  468. return -1;
  469. }
  470. if (decode_header_trees(c))
  471. return -1;
  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. typedef struct SmackerAudioContext {
  491. AVFrame frame;
  492. } SmackerAudioContext;
  493. static av_cold int smka_decode_init(AVCodecContext *avctx)
  494. {
  495. SmackerAudioContext *s = avctx->priv_data;
  496. if (avctx->channels < 1 || avctx->channels > 2) {
  497. av_log(avctx, AV_LOG_ERROR, "invalid number of channels\n");
  498. return AVERROR(EINVAL);
  499. }
  500. avctx->channel_layout = (avctx->channels==2) ? AV_CH_LAYOUT_STEREO : AV_CH_LAYOUT_MONO;
  501. avctx->sample_fmt = avctx->bits_per_coded_sample == 8 ? AV_SAMPLE_FMT_U8 : AV_SAMPLE_FMT_S16;
  502. avcodec_get_frame_defaults(&s->frame);
  503. avctx->coded_frame = &s->frame;
  504. return 0;
  505. }
  506. /**
  507. * Decode Smacker audio data
  508. */
  509. static int smka_decode_frame(AVCodecContext *avctx, void *data,
  510. int *got_frame_ptr, AVPacket *avpkt)
  511. {
  512. SmackerAudioContext *s = avctx->priv_data;
  513. const uint8_t *buf = avpkt->data;
  514. int buf_size = avpkt->size;
  515. GetBitContext gb;
  516. HuffContext h[4] = { { 0 } };
  517. VLC vlc[4] = { { 0 } };
  518. int16_t *samples;
  519. uint8_t *samples8;
  520. int val;
  521. int i, res, ret;
  522. int unp_size;
  523. int bits, stereo;
  524. int pred[2] = {0, 0};
  525. if (buf_size <= 4) {
  526. av_log(avctx, AV_LOG_ERROR, "packet is too small\n");
  527. return AVERROR(EINVAL);
  528. }
  529. unp_size = AV_RL32(buf);
  530. init_get_bits(&gb, buf + 4, (buf_size - 4) * 8);
  531. if(!get_bits1(&gb)){
  532. av_log(avctx, AV_LOG_INFO, "Sound: no data\n");
  533. *got_frame_ptr = 0;
  534. return 1;
  535. }
  536. stereo = get_bits1(&gb);
  537. bits = get_bits1(&gb);
  538. if (stereo ^ (avctx->channels != 1)) {
  539. av_log(avctx, AV_LOG_ERROR, "channels mismatch\n");
  540. return AVERROR(EINVAL);
  541. }
  542. if (bits && avctx->sample_fmt == AV_SAMPLE_FMT_U8) {
  543. av_log(avctx, AV_LOG_ERROR, "sample format mismatch\n");
  544. return AVERROR(EINVAL);
  545. }
  546. /* get output buffer */
  547. s->frame.nb_samples = unp_size / (avctx->channels * (bits + 1));
  548. if ((ret = avctx->get_buffer(avctx, &s->frame)) < 0) {
  549. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  550. return ret;
  551. }
  552. samples = (int16_t *)s->frame.data[0];
  553. samples8 = s->frame.data[0];
  554. // Initialize
  555. for(i = 0; i < (1 << (bits + stereo)); i++) {
  556. h[i].length = 256;
  557. h[i].maxlength = 0;
  558. h[i].current = 0;
  559. h[i].bits = av_mallocz(256 * 4);
  560. h[i].lengths = av_mallocz(256 * sizeof(int));
  561. h[i].values = av_mallocz(256 * sizeof(int));
  562. skip_bits1(&gb);
  563. smacker_decode_tree(&gb, &h[i], 0, 0);
  564. skip_bits1(&gb);
  565. if(h[i].current > 1) {
  566. res = init_vlc(&vlc[i], SMKTREE_BITS, h[i].length,
  567. h[i].lengths, sizeof(int), sizeof(int),
  568. h[i].bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);
  569. if(res < 0) {
  570. av_log(avctx, AV_LOG_ERROR, "Cannot build VLC table\n");
  571. return -1;
  572. }
  573. }
  574. }
  575. if(bits) { //decode 16-bit data
  576. for(i = stereo; i >= 0; i--)
  577. pred[i] = sign_extend(av_bswap16(get_bits(&gb, 16)), 16);
  578. for(i = 0; i <= stereo; i++)
  579. *samples++ = pred[i];
  580. for(; i < unp_size / 2; i++) {
  581. if(i & stereo) {
  582. if(vlc[2].table)
  583. res = get_vlc2(&gb, vlc[2].table, SMKTREE_BITS, 3);
  584. else
  585. res = 0;
  586. val = h[2].values[res];
  587. if(vlc[3].table)
  588. res = get_vlc2(&gb, vlc[3].table, SMKTREE_BITS, 3);
  589. else
  590. res = 0;
  591. val |= h[3].values[res] << 8;
  592. pred[1] += sign_extend(val, 16);
  593. *samples++ = av_clip_int16(pred[1]);
  594. } else {
  595. if(vlc[0].table)
  596. res = get_vlc2(&gb, vlc[0].table, SMKTREE_BITS, 3);
  597. else
  598. res = 0;
  599. val = h[0].values[res];
  600. if(vlc[1].table)
  601. res = get_vlc2(&gb, vlc[1].table, SMKTREE_BITS, 3);
  602. else
  603. res = 0;
  604. val |= h[1].values[res] << 8;
  605. pred[0] += sign_extend(val, 16);
  606. *samples++ = av_clip_int16(pred[0]);
  607. }
  608. }
  609. } else { //8-bit data
  610. for(i = stereo; i >= 0; i--)
  611. pred[i] = get_bits(&gb, 8);
  612. for(i = 0; i <= stereo; i++)
  613. *samples8++ = pred[i];
  614. for(; i < unp_size; i++) {
  615. if(i & stereo){
  616. if(vlc[1].table)
  617. res = get_vlc2(&gb, vlc[1].table, SMKTREE_BITS, 3);
  618. else
  619. res = 0;
  620. pred[1] += sign_extend(h[1].values[res], 8);
  621. *samples8++ = av_clip_uint8(pred[1]);
  622. } else {
  623. if(vlc[0].table)
  624. res = get_vlc2(&gb, vlc[0].table, SMKTREE_BITS, 3);
  625. else
  626. res = 0;
  627. pred[0] += sign_extend(h[0].values[res], 8);
  628. *samples8++ = av_clip_uint8(pred[0]);
  629. }
  630. }
  631. }
  632. for(i = 0; i < 4; i++) {
  633. if(vlc[i].table)
  634. ff_free_vlc(&vlc[i]);
  635. av_free(h[i].bits);
  636. av_free(h[i].lengths);
  637. av_free(h[i].values);
  638. }
  639. *got_frame_ptr = 1;
  640. *(AVFrame *)data = s->frame;
  641. return buf_size;
  642. }
  643. AVCodec ff_smacker_decoder = {
  644. .name = "smackvid",
  645. .type = AVMEDIA_TYPE_VIDEO,
  646. .id = CODEC_ID_SMACKVIDEO,
  647. .priv_data_size = sizeof(SmackVContext),
  648. .init = decode_init,
  649. .close = decode_end,
  650. .decode = decode_frame,
  651. .capabilities = CODEC_CAP_DR1,
  652. .long_name = NULL_IF_CONFIG_SMALL("Smacker video"),
  653. };
  654. AVCodec ff_smackaud_decoder = {
  655. .name = "smackaud",
  656. .type = AVMEDIA_TYPE_AUDIO,
  657. .id = CODEC_ID_SMACKAUDIO,
  658. .priv_data_size = sizeof(SmackerAudioContext),
  659. .init = smka_decode_init,
  660. .decode = smka_decode_frame,
  661. .capabilities = CODEC_CAP_DR1,
  662. .long_name = NULL_IF_CONFIG_SMALL("Smacker audio"),
  663. };