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