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.

784 lines
24KB

  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. #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(length > 32) {
  87. av_log(NULL, AV_LOG_ERROR, "length too long\n");
  88. return -1;
  89. }
  90. if(!get_bits1(gb)){ //Leaf
  91. if(hc->current >= 256){
  92. av_log(NULL, AV_LOG_ERROR, "Tree size exceeded!\n");
  93. return -1;
  94. }
  95. if(length){
  96. hc->bits[hc->current] = prefix;
  97. hc->lengths[hc->current] = length;
  98. } else {
  99. hc->bits[hc->current] = 0;
  100. hc->lengths[hc->current] = 0;
  101. }
  102. hc->values[hc->current] = get_bits(gb, 8);
  103. hc->current++;
  104. if(hc->maxlength < length)
  105. hc->maxlength = length;
  106. return 0;
  107. } else { //Node
  108. int r;
  109. length++;
  110. r = smacker_decode_tree(gb, hc, prefix, length);
  111. if(r)
  112. return r;
  113. return smacker_decode_tree(gb, hc, prefix | (1 << (length - 1)), length);
  114. }
  115. }
  116. /**
  117. * Decode header tree
  118. */
  119. static int smacker_decode_bigtree(GetBitContext *gb, HuffContext *hc, DBCtx *ctx)
  120. {
  121. if (hc->current + 1 >= hc->length) {
  122. av_log(NULL, AV_LOG_ERROR, "Tree size exceeded!\n");
  123. return -1;
  124. }
  125. if(!get_bits1(gb)){ //Leaf
  126. int val, i1, i2;
  127. i1 = ctx->v1->table ? get_vlc2(gb, ctx->v1->table, SMKTREE_BITS, 3) : 0;
  128. i2 = ctx->v2->table ? get_vlc2(gb, ctx->v2->table, SMKTREE_BITS, 3) : 0;
  129. if (i1 < 0 || i2 < 0)
  130. return -1;
  131. val = ctx->recode1[i1] | (ctx->recode2[i2] << 8);
  132. if(val == ctx->escapes[0]) {
  133. ctx->last[0] = hc->current;
  134. val = 0;
  135. } else if(val == ctx->escapes[1]) {
  136. ctx->last[1] = hc->current;
  137. val = 0;
  138. } else if(val == ctx->escapes[2]) {
  139. ctx->last[2] = hc->current;
  140. val = 0;
  141. }
  142. hc->values[hc->current++] = val;
  143. return 1;
  144. } else { //Node
  145. int r = 0, r_new, t;
  146. t = hc->current++;
  147. r = smacker_decode_bigtree(gb, hc, ctx);
  148. if(r < 0)
  149. return r;
  150. hc->values[t] = SMK_NODE | r;
  151. r++;
  152. r_new = smacker_decode_bigtree(gb, hc, ctx);
  153. if (r_new < 0)
  154. return r_new;
  155. return r + r_new;
  156. }
  157. }
  158. /**
  159. * Store large tree as FFmpeg's vlc codes
  160. */
  161. static int smacker_decode_header_tree(SmackVContext *smk, GetBitContext *gb, int **recodes, int *last, int size)
  162. {
  163. int res;
  164. HuffContext huff;
  165. HuffContext tmp1, tmp2;
  166. VLC vlc[2] = { { 0 } };
  167. int escapes[3];
  168. DBCtx ctx;
  169. int err = 0;
  170. if(size >= UINT_MAX>>4){ // (((size + 3) >> 2) + 3) << 2 must not overflow
  171. av_log(smk->avctx, AV_LOG_ERROR, "size too large\n");
  172. return -1;
  173. }
  174. tmp1.length = 256;
  175. tmp1.maxlength = 0;
  176. tmp1.current = 0;
  177. tmp1.bits = av_mallocz(256 * 4);
  178. tmp1.lengths = av_mallocz(256 * sizeof(int));
  179. tmp1.values = av_mallocz(256 * sizeof(int));
  180. tmp2.length = 256;
  181. tmp2.maxlength = 0;
  182. tmp2.current = 0;
  183. tmp2.bits = av_mallocz(256 * 4);
  184. tmp2.lengths = av_mallocz(256 * sizeof(int));
  185. tmp2.values = av_mallocz(256 * sizeof(int));
  186. if(get_bits1(gb)) {
  187. smacker_decode_tree(gb, &tmp1, 0, 0);
  188. skip_bits1(gb);
  189. res = init_vlc(&vlc[0], SMKTREE_BITS, tmp1.length,
  190. tmp1.lengths, sizeof(int), sizeof(int),
  191. tmp1.bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);
  192. if(res < 0) {
  193. av_log(smk->avctx, AV_LOG_ERROR, "Cannot build VLC table\n");
  194. return -1;
  195. }
  196. } else {
  197. av_log(smk->avctx, AV_LOG_ERROR, "Skipping low bytes tree\n");
  198. }
  199. if(get_bits1(gb)){
  200. smacker_decode_tree(gb, &tmp2, 0, 0);
  201. skip_bits1(gb);
  202. res = init_vlc(&vlc[1], SMKTREE_BITS, tmp2.length,
  203. tmp2.lengths, sizeof(int), sizeof(int),
  204. tmp2.bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);
  205. if(res < 0) {
  206. av_log(smk->avctx, AV_LOG_ERROR, "Cannot build VLC table\n");
  207. return -1;
  208. }
  209. } else {
  210. av_log(smk->avctx, AV_LOG_ERROR, "Skipping high bytes tree\n");
  211. }
  212. escapes[0] = get_bits(gb, 8);
  213. escapes[0] |= get_bits(gb, 8) << 8;
  214. escapes[1] = get_bits(gb, 8);
  215. escapes[1] |= get_bits(gb, 8) << 8;
  216. escapes[2] = get_bits(gb, 8);
  217. escapes[2] |= get_bits(gb, 8) << 8;
  218. last[0] = last[1] = last[2] = -1;
  219. ctx.escapes[0] = escapes[0];
  220. ctx.escapes[1] = escapes[1];
  221. ctx.escapes[2] = escapes[2];
  222. ctx.v1 = &vlc[0];
  223. ctx.v2 = &vlc[1];
  224. ctx.recode1 = tmp1.values;
  225. ctx.recode2 = tmp2.values;
  226. ctx.last = last;
  227. huff.length = ((size + 3) >> 2) + 3;
  228. huff.maxlength = 0;
  229. huff.current = 0;
  230. huff.values = av_mallocz(huff.length * sizeof(int));
  231. if (smacker_decode_bigtree(gb, &huff, &ctx) < 0)
  232. err = -1;
  233. skip_bits1(gb);
  234. if(ctx.last[0] == -1) ctx.last[0] = huff.current++;
  235. if(ctx.last[1] == -1) ctx.last[1] = huff.current++;
  236. if(ctx.last[2] == -1) ctx.last[2] = huff.current++;
  237. if(huff.current > huff.length){
  238. ctx.last[0] = ctx.last[1] = ctx.last[2] = 1;
  239. av_log(smk->avctx, AV_LOG_ERROR, "bigtree damaged\n");
  240. return -1;
  241. }
  242. *recodes = huff.values;
  243. if(vlc[0].table)
  244. ff_free_vlc(&vlc[0]);
  245. if(vlc[1].table)
  246. ff_free_vlc(&vlc[1]);
  247. av_free(tmp1.bits);
  248. av_free(tmp1.lengths);
  249. av_free(tmp1.values);
  250. av_free(tmp2.bits);
  251. av_free(tmp2.lengths);
  252. av_free(tmp2.values);
  253. return err;
  254. }
  255. static int decode_header_trees(SmackVContext *smk) {
  256. GetBitContext gb;
  257. int mmap_size, mclr_size, full_size, type_size;
  258. mmap_size = AV_RL32(smk->avctx->extradata);
  259. mclr_size = AV_RL32(smk->avctx->extradata + 4);
  260. full_size = AV_RL32(smk->avctx->extradata + 8);
  261. type_size = AV_RL32(smk->avctx->extradata + 12);
  262. init_get_bits(&gb, smk->avctx->extradata + 16, (smk->avctx->extradata_size - 16) * 8);
  263. if(!get_bits1(&gb)) {
  264. av_log(smk->avctx, AV_LOG_INFO, "Skipping MMAP tree\n");
  265. smk->mmap_tbl = av_malloc(sizeof(int) * 2);
  266. smk->mmap_tbl[0] = 0;
  267. smk->mmap_last[0] = smk->mmap_last[1] = smk->mmap_last[2] = 1;
  268. } else {
  269. if (smacker_decode_header_tree(smk, &gb, &smk->mmap_tbl, smk->mmap_last, mmap_size))
  270. return -1;
  271. }
  272. if(!get_bits1(&gb)) {
  273. av_log(smk->avctx, AV_LOG_INFO, "Skipping MCLR tree\n");
  274. smk->mclr_tbl = av_malloc(sizeof(int) * 2);
  275. smk->mclr_tbl[0] = 0;
  276. smk->mclr_last[0] = smk->mclr_last[1] = smk->mclr_last[2] = 1;
  277. } else {
  278. if (smacker_decode_header_tree(smk, &gb, &smk->mclr_tbl, smk->mclr_last, mclr_size))
  279. return -1;
  280. }
  281. if(!get_bits1(&gb)) {
  282. av_log(smk->avctx, AV_LOG_INFO, "Skipping FULL tree\n");
  283. smk->full_tbl = av_malloc(sizeof(int) * 2);
  284. smk->full_tbl[0] = 0;
  285. smk->full_last[0] = smk->full_last[1] = smk->full_last[2] = 1;
  286. } else {
  287. if (smacker_decode_header_tree(smk, &gb, &smk->full_tbl, smk->full_last, full_size))
  288. return -1;
  289. }
  290. if(!get_bits1(&gb)) {
  291. av_log(smk->avctx, AV_LOG_INFO, "Skipping TYPE tree\n");
  292. smk->type_tbl = av_malloc(sizeof(int) * 2);
  293. smk->type_tbl[0] = 0;
  294. smk->type_last[0] = smk->type_last[1] = smk->type_last[2] = 1;
  295. } else {
  296. if (smacker_decode_header_tree(smk, &gb, &smk->type_tbl, smk->type_last, type_size))
  297. return -1;
  298. }
  299. return 0;
  300. }
  301. static av_always_inline void last_reset(int *recode, int *last) {
  302. recode[last[0]] = recode[last[1]] = recode[last[2]] = 0;
  303. }
  304. /* get code and update history */
  305. static av_always_inline int smk_get_code(GetBitContext *gb, int *recode, int *last) {
  306. register int *table = recode;
  307. int v;
  308. while(*table & SMK_NODE) {
  309. if(get_bits1(gb))
  310. table += (*table) & (~SMK_NODE);
  311. table++;
  312. }
  313. v = *table;
  314. if(v != recode[last[0]]) {
  315. recode[last[2]] = recode[last[1]];
  316. recode[last[1]] = recode[last[0]];
  317. recode[last[0]] = v;
  318. }
  319. return v;
  320. }
  321. static int decode_frame(AVCodecContext *avctx, void *data, int *data_size, AVPacket *avpkt)
  322. {
  323. SmackVContext * const smk = avctx->priv_data;
  324. uint8_t *out;
  325. uint32_t *pal;
  326. GetByteContext gb2;
  327. GetBitContext gb;
  328. int blocks, blk, bw, bh;
  329. int i;
  330. int stride;
  331. int flags;
  332. if (avpkt->size <= 769)
  333. return 0;
  334. smk->pic.reference = 3;
  335. smk->pic.buffer_hints = FF_BUFFER_HINTS_VALID | FF_BUFFER_HINTS_PRESERVE | FF_BUFFER_HINTS_REUSABLE;
  336. if(avctx->reget_buffer(avctx, &smk->pic) < 0){
  337. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  338. return -1;
  339. }
  340. /* make the palette available on the way out */
  341. pal = (uint32_t*)smk->pic.data[1];
  342. bytestream2_init(&gb2, avpkt->data, avpkt->size);
  343. flags = bytestream2_get_byteu(&gb2);
  344. smk->pic.palette_has_changed = flags & 1;
  345. smk->pic.key_frame = !!(flags & 2);
  346. if(smk->pic.key_frame)
  347. smk->pic.pict_type = AV_PICTURE_TYPE_I;
  348. else
  349. smk->pic.pict_type = AV_PICTURE_TYPE_P;
  350. for(i = 0; i < 256; i++)
  351. *pal++ = 0xFF << 24 | bytestream2_get_be24u(&gb2);
  352. last_reset(smk->mmap_tbl, smk->mmap_last);
  353. last_reset(smk->mclr_tbl, smk->mclr_last);
  354. last_reset(smk->full_tbl, smk->full_last);
  355. last_reset(smk->type_tbl, smk->type_last);
  356. init_get_bits(&gb, avpkt->data + 769, (avpkt->size - 769) * 8);
  357. blk = 0;
  358. bw = avctx->width >> 2;
  359. bh = avctx->height >> 2;
  360. blocks = bw * bh;
  361. out = smk->pic.data[0];
  362. stride = smk->pic.linesize[0];
  363. while(blk < blocks) {
  364. int type, run, mode;
  365. uint16_t pix;
  366. type = smk_get_code(&gb, smk->type_tbl, smk->type_last);
  367. run = block_runs[(type >> 2) & 0x3F];
  368. switch(type & 3){
  369. case SMK_BLK_MONO:
  370. while(run-- && blk < blocks){
  371. int clr, map;
  372. int hi, lo;
  373. clr = smk_get_code(&gb, smk->mclr_tbl, smk->mclr_last);
  374. map = smk_get_code(&gb, smk->mmap_tbl, smk->mmap_last);
  375. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  376. hi = clr >> 8;
  377. lo = clr & 0xFF;
  378. for(i = 0; i < 4; i++) {
  379. if(map & 1) out[0] = hi; else out[0] = lo;
  380. if(map & 2) out[1] = hi; else out[1] = lo;
  381. if(map & 4) out[2] = hi; else out[2] = lo;
  382. if(map & 8) out[3] = hi; else out[3] = lo;
  383. map >>= 4;
  384. out += stride;
  385. }
  386. blk++;
  387. }
  388. break;
  389. case SMK_BLK_FULL:
  390. mode = 0;
  391. if(avctx->codec_tag == MKTAG('S', 'M', 'K', '4')) { // In case of Smacker v4 we have three modes
  392. if(get_bits1(&gb)) mode = 1;
  393. else if(get_bits1(&gb)) mode = 2;
  394. }
  395. while(run-- && blk < blocks){
  396. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  397. switch(mode){
  398. case 0:
  399. for(i = 0; i < 4; i++) {
  400. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  401. AV_WL16(out+2,pix);
  402. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  403. AV_WL16(out,pix);
  404. out += stride;
  405. }
  406. break;
  407. case 1:
  408. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  409. out[0] = out[1] = pix & 0xFF;
  410. out[2] = out[3] = pix >> 8;
  411. out += stride;
  412. out[0] = out[1] = pix & 0xFF;
  413. out[2] = out[3] = pix >> 8;
  414. out += stride;
  415. pix = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  416. out[0] = out[1] = pix & 0xFF;
  417. out[2] = out[3] = pix >> 8;
  418. out += stride;
  419. out[0] = out[1] = pix & 0xFF;
  420. out[2] = out[3] = pix >> 8;
  421. out += stride;
  422. break;
  423. case 2:
  424. for(i = 0; i < 2; i++) {
  425. uint16_t pix1, pix2;
  426. pix2 = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  427. pix1 = smk_get_code(&gb, smk->full_tbl, smk->full_last);
  428. AV_WL16(out,pix1);
  429. AV_WL16(out+2,pix2);
  430. out += stride;
  431. AV_WL16(out,pix1);
  432. AV_WL16(out+2,pix2);
  433. out += stride;
  434. }
  435. break;
  436. }
  437. blk++;
  438. }
  439. break;
  440. case SMK_BLK_SKIP:
  441. while(run-- && blk < blocks)
  442. blk++;
  443. break;
  444. case SMK_BLK_FILL:
  445. mode = type >> 8;
  446. while(run-- && blk < blocks){
  447. uint32_t col;
  448. out = smk->pic.data[0] + (blk / bw) * (stride * 4) + (blk % bw) * 4;
  449. col = mode * 0x01010101;
  450. for(i = 0; i < 4; i++) {
  451. *((uint32_t*)out) = col;
  452. out += stride;
  453. }
  454. blk++;
  455. }
  456. break;
  457. }
  458. }
  459. *data_size = sizeof(AVFrame);
  460. *(AVFrame*)data = smk->pic;
  461. /* always report that the buffer was completely consumed */
  462. return avpkt->size;
  463. }
  464. /*
  465. *
  466. * Init smacker decoder
  467. *
  468. */
  469. static av_cold int decode_init(AVCodecContext *avctx)
  470. {
  471. SmackVContext * const c = avctx->priv_data;
  472. c->avctx = avctx;
  473. avctx->pix_fmt = PIX_FMT_PAL8;
  474. avcodec_get_frame_defaults(&c->pic);
  475. /* decode huffman trees from extradata */
  476. if(avctx->extradata_size < 16){
  477. av_log(avctx, AV_LOG_ERROR, "Extradata missing!\n");
  478. return -1;
  479. }
  480. if (decode_header_trees(c))
  481. return -1;
  482. return 0;
  483. }
  484. /*
  485. *
  486. * Uninit smacker decoder
  487. *
  488. */
  489. static av_cold int decode_end(AVCodecContext *avctx)
  490. {
  491. SmackVContext * const smk = avctx->priv_data;
  492. av_freep(&smk->mmap_tbl);
  493. av_freep(&smk->mclr_tbl);
  494. av_freep(&smk->full_tbl);
  495. av_freep(&smk->type_tbl);
  496. if (smk->pic.data[0])
  497. avctx->release_buffer(avctx, &smk->pic);
  498. return 0;
  499. }
  500. typedef struct SmackerAudioContext {
  501. AVFrame frame;
  502. } SmackerAudioContext;
  503. static av_cold int smka_decode_init(AVCodecContext *avctx)
  504. {
  505. SmackerAudioContext *s = avctx->priv_data;
  506. if (avctx->channels < 1 || avctx->channels > 2) {
  507. av_log(avctx, AV_LOG_ERROR, "invalid number of channels\n");
  508. return AVERROR(EINVAL);
  509. }
  510. avctx->channel_layout = (avctx->channels==2) ? AV_CH_LAYOUT_STEREO : AV_CH_LAYOUT_MONO;
  511. avctx->sample_fmt = avctx->bits_per_coded_sample == 8 ? AV_SAMPLE_FMT_U8 : AV_SAMPLE_FMT_S16;
  512. avcodec_get_frame_defaults(&s->frame);
  513. avctx->coded_frame = &s->frame;
  514. return 0;
  515. }
  516. /**
  517. * Decode Smacker audio data
  518. */
  519. static int smka_decode_frame(AVCodecContext *avctx, void *data,
  520. int *got_frame_ptr, AVPacket *avpkt)
  521. {
  522. SmackerAudioContext *s = avctx->priv_data;
  523. const uint8_t *buf = avpkt->data;
  524. int buf_size = avpkt->size;
  525. GetBitContext gb;
  526. HuffContext h[4] = { { 0 } };
  527. VLC vlc[4] = { { 0 } };
  528. int16_t *samples;
  529. uint8_t *samples8;
  530. int val;
  531. int i, res, ret;
  532. int unp_size;
  533. int bits, stereo;
  534. int pred[2] = {0, 0};
  535. if (buf_size <= 4) {
  536. av_log(avctx, AV_LOG_ERROR, "packet is too small\n");
  537. return AVERROR(EINVAL);
  538. }
  539. unp_size = AV_RL32(buf);
  540. init_get_bits(&gb, buf + 4, (buf_size - 4) * 8);
  541. if(!get_bits1(&gb)){
  542. av_log(avctx, AV_LOG_INFO, "Sound: no data\n");
  543. *got_frame_ptr = 0;
  544. return 1;
  545. }
  546. stereo = get_bits1(&gb);
  547. bits = get_bits1(&gb);
  548. if (stereo ^ (avctx->channels != 1)) {
  549. av_log(avctx, AV_LOG_ERROR, "channels mismatch\n");
  550. return AVERROR(EINVAL);
  551. }
  552. if (bits && avctx->sample_fmt == AV_SAMPLE_FMT_U8) {
  553. av_log(avctx, AV_LOG_ERROR, "sample format mismatch\n");
  554. return AVERROR(EINVAL);
  555. }
  556. /* get output buffer */
  557. s->frame.nb_samples = unp_size / (avctx->channels * (bits + 1));
  558. if ((ret = avctx->get_buffer(avctx, &s->frame)) < 0) {
  559. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  560. return ret;
  561. }
  562. samples = (int16_t *)s->frame.data[0];
  563. samples8 = s->frame.data[0];
  564. // Initialize
  565. for(i = 0; i < (1 << (bits + stereo)); i++) {
  566. h[i].length = 256;
  567. h[i].maxlength = 0;
  568. h[i].current = 0;
  569. h[i].bits = av_mallocz(256 * 4);
  570. h[i].lengths = av_mallocz(256 * sizeof(int));
  571. h[i].values = av_mallocz(256 * sizeof(int));
  572. skip_bits1(&gb);
  573. smacker_decode_tree(&gb, &h[i], 0, 0);
  574. skip_bits1(&gb);
  575. if(h[i].current > 1) {
  576. res = init_vlc(&vlc[i], SMKTREE_BITS, h[i].length,
  577. h[i].lengths, sizeof(int), sizeof(int),
  578. h[i].bits, sizeof(uint32_t), sizeof(uint32_t), INIT_VLC_LE);
  579. if(res < 0) {
  580. av_log(avctx, AV_LOG_ERROR, "Cannot build VLC table\n");
  581. return -1;
  582. }
  583. }
  584. }
  585. if(bits) { //decode 16-bit data
  586. for(i = stereo; i >= 0; i--)
  587. pred[i] = sign_extend(av_bswap16(get_bits(&gb, 16)), 16);
  588. for(i = 0; i <= stereo; i++)
  589. *samples++ = pred[i];
  590. for(; i < unp_size / 2; i++) {
  591. if(get_bits_left(&gb)<0)
  592. return -1;
  593. if(i & stereo) {
  594. if(vlc[2].table)
  595. res = get_vlc2(&gb, vlc[2].table, SMKTREE_BITS, 3);
  596. else
  597. res = 0;
  598. if (res < 0) {
  599. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  600. return AVERROR_INVALIDDATA;
  601. }
  602. val = h[2].values[res];
  603. if(vlc[3].table)
  604. res = get_vlc2(&gb, vlc[3].table, SMKTREE_BITS, 3);
  605. else
  606. res = 0;
  607. if (res < 0) {
  608. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  609. return AVERROR_INVALIDDATA;
  610. }
  611. val |= h[3].values[res] << 8;
  612. pred[1] += sign_extend(val, 16);
  613. *samples++ = av_clip_int16(pred[1]);
  614. } else {
  615. if(vlc[0].table)
  616. res = get_vlc2(&gb, vlc[0].table, SMKTREE_BITS, 3);
  617. else
  618. res = 0;
  619. if (res < 0) {
  620. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  621. return AVERROR_INVALIDDATA;
  622. }
  623. val = h[0].values[res];
  624. if(vlc[1].table)
  625. res = get_vlc2(&gb, vlc[1].table, SMKTREE_BITS, 3);
  626. else
  627. res = 0;
  628. if (res < 0) {
  629. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  630. return AVERROR_INVALIDDATA;
  631. }
  632. val |= h[1].values[res] << 8;
  633. pred[0] += sign_extend(val, 16);
  634. *samples++ = av_clip_int16(pred[0]);
  635. }
  636. }
  637. } else { //8-bit data
  638. for(i = stereo; i >= 0; i--)
  639. pred[i] = get_bits(&gb, 8);
  640. for(i = 0; i <= stereo; i++)
  641. *samples8++ = pred[i];
  642. for(; i < unp_size; i++) {
  643. if(get_bits_left(&gb)<0)
  644. return -1;
  645. if(i & stereo){
  646. if(vlc[1].table)
  647. res = get_vlc2(&gb, vlc[1].table, SMKTREE_BITS, 3);
  648. else
  649. res = 0;
  650. if (res < 0) {
  651. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  652. return AVERROR_INVALIDDATA;
  653. }
  654. pred[1] += sign_extend(h[1].values[res], 8);
  655. *samples8++ = av_clip_uint8(pred[1]);
  656. } else {
  657. if(vlc[0].table)
  658. res = get_vlc2(&gb, vlc[0].table, SMKTREE_BITS, 3);
  659. else
  660. res = 0;
  661. if (res < 0) {
  662. av_log(avctx, AV_LOG_ERROR, "invalid vlc\n");
  663. return AVERROR_INVALIDDATA;
  664. }
  665. pred[0] += sign_extend(h[0].values[res], 8);
  666. *samples8++ = av_clip_uint8(pred[0]);
  667. }
  668. }
  669. }
  670. for(i = 0; i < 4; i++) {
  671. if(vlc[i].table)
  672. ff_free_vlc(&vlc[i]);
  673. av_free(h[i].bits);
  674. av_free(h[i].lengths);
  675. av_free(h[i].values);
  676. }
  677. *got_frame_ptr = 1;
  678. *(AVFrame *)data = s->frame;
  679. return buf_size;
  680. }
  681. AVCodec ff_smacker_decoder = {
  682. .name = "smackvid",
  683. .type = AVMEDIA_TYPE_VIDEO,
  684. .id = AV_CODEC_ID_SMACKVIDEO,
  685. .priv_data_size = sizeof(SmackVContext),
  686. .init = decode_init,
  687. .close = decode_end,
  688. .decode = decode_frame,
  689. .capabilities = CODEC_CAP_DR1,
  690. .long_name = NULL_IF_CONFIG_SMALL("Smacker video"),
  691. };
  692. AVCodec ff_smackaud_decoder = {
  693. .name = "smackaud",
  694. .type = AVMEDIA_TYPE_AUDIO,
  695. .id = AV_CODEC_ID_SMACKAUDIO,
  696. .priv_data_size = sizeof(SmackerAudioContext),
  697. .init = smka_decode_init,
  698. .decode = smka_decode_frame,
  699. .capabilities = CODEC_CAP_DR1,
  700. .long_name = NULL_IF_CONFIG_SMALL("Smacker audio"),
  701. };