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.

1340 lines
44KB

  1. /*
  2. * Bink video decoder
  3. * Copyright (c) 2009 Konstantin Shishkov
  4. * Copyright (C) 2011 Peter Ross <pross@xvid.org>
  5. *
  6. * This file is part of Libav.
  7. *
  8. * Libav is free software; you can redistribute it and/or
  9. * modify it under the terms of the GNU Lesser General Public
  10. * License as published by the Free Software Foundation; either
  11. * version 2.1 of the License, or (at your option) any later version.
  12. *
  13. * Libav is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  16. * Lesser General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU Lesser General Public
  19. * License along with Libav; if not, write to the Free Software
  20. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  21. */
  22. #include "libavutil/imgutils.h"
  23. #include "avcodec.h"
  24. #include "dsputil.h"
  25. #include "binkdata.h"
  26. #include "mathops.h"
  27. #define ALT_BITSTREAM_READER_LE
  28. #include "get_bits.h"
  29. #define BINK_FLAG_ALPHA 0x00100000
  30. #define BINK_FLAG_GRAY 0x00020000
  31. static VLC bink_trees[16];
  32. /**
  33. * IDs for different data types used in old version of Bink video codec
  34. */
  35. enum OldSources {
  36. BINKB_SRC_BLOCK_TYPES = 0, ///< 8x8 block types
  37. BINKB_SRC_COLORS, ///< pixel values used for different block types
  38. BINKB_SRC_PATTERN, ///< 8-bit values for 2-colour pattern fill
  39. BINKB_SRC_X_OFF, ///< X components of motion value
  40. BINKB_SRC_Y_OFF, ///< Y components of motion value
  41. BINKB_SRC_INTRA_DC, ///< DC values for intrablocks with DCT
  42. BINKB_SRC_INTER_DC, ///< DC values for interblocks with DCT
  43. BINKB_SRC_INTRA_Q, ///< quantizer values for intrablocks with DCT
  44. BINKB_SRC_INTER_Q, ///< quantizer values for interblocks with DCT
  45. BINKB_SRC_INTER_COEFS, ///< number of coefficients for residue blocks
  46. BINKB_NB_SRC
  47. };
  48. static const int binkb_bundle_sizes[BINKB_NB_SRC] = {
  49. 4, 8, 8, 5, 5, 11, 11, 4, 4, 7
  50. };
  51. static const int binkb_bundle_signed[BINKB_NB_SRC] = {
  52. 0, 0, 0, 1, 1, 0, 1, 0, 0, 0
  53. };
  54. static uint32_t binkb_intra_quant[16][64];
  55. static uint32_t binkb_inter_quant[16][64];
  56. /**
  57. * IDs for different data types used in Bink video codec
  58. */
  59. enum Sources {
  60. BINK_SRC_BLOCK_TYPES = 0, ///< 8x8 block types
  61. BINK_SRC_SUB_BLOCK_TYPES, ///< 16x16 block types (a subset of 8x8 block types)
  62. BINK_SRC_COLORS, ///< pixel values used for different block types
  63. BINK_SRC_PATTERN, ///< 8-bit values for 2-colour pattern fill
  64. BINK_SRC_X_OFF, ///< X components of motion value
  65. BINK_SRC_Y_OFF, ///< Y components of motion value
  66. BINK_SRC_INTRA_DC, ///< DC values for intrablocks with DCT
  67. BINK_SRC_INTER_DC, ///< DC values for interblocks with DCT
  68. BINK_SRC_RUN, ///< run lengths for special fill block
  69. BINK_NB_SRC
  70. };
  71. /**
  72. * data needed to decode 4-bit Huffman-coded value
  73. */
  74. typedef struct Tree {
  75. int vlc_num; ///< tree number (in bink_trees[])
  76. uint8_t syms[16]; ///< leaf value to symbol mapping
  77. } Tree;
  78. #define GET_HUFF(gb, tree) (tree).syms[get_vlc2(gb, bink_trees[(tree).vlc_num].table,\
  79. bink_trees[(tree).vlc_num].bits, 1)]
  80. /**
  81. * data structure used for decoding single Bink data type
  82. */
  83. typedef struct Bundle {
  84. int len; ///< length of number of entries to decode (in bits)
  85. Tree tree; ///< Huffman tree-related data
  86. uint8_t *data; ///< buffer for decoded symbols
  87. uint8_t *data_end; ///< buffer end
  88. uint8_t *cur_dec; ///< pointer to the not yet decoded part of the buffer
  89. uint8_t *cur_ptr; ///< pointer to the data that is not read from buffer yet
  90. } Bundle;
  91. /*
  92. * Decoder context
  93. */
  94. typedef struct BinkContext {
  95. AVCodecContext *avctx;
  96. DSPContext dsp;
  97. AVFrame pic, last;
  98. int version; ///< internal Bink file version
  99. int has_alpha;
  100. int swap_planes;
  101. ScanTable scantable; ///< permutated scantable for DCT coeffs decoding
  102. Bundle bundle[BINKB_NB_SRC]; ///< bundles for decoding all data types
  103. Tree col_high[16]; ///< trees for decoding high nibble in "colours" data type
  104. int col_lastval; ///< value of last decoded high nibble in "colours" data type
  105. } BinkContext;
  106. /**
  107. * Bink video block types
  108. */
  109. enum BlockTypes {
  110. SKIP_BLOCK = 0, ///< skipped block
  111. SCALED_BLOCK, ///< block has size 16x16
  112. MOTION_BLOCK, ///< block is copied from previous frame with some offset
  113. RUN_BLOCK, ///< block is composed from runs of colours with custom scan order
  114. RESIDUE_BLOCK, ///< motion block with some difference added
  115. INTRA_BLOCK, ///< intra DCT block
  116. FILL_BLOCK, ///< block is filled with single colour
  117. INTER_BLOCK, ///< motion block with DCT applied to the difference
  118. PATTERN_BLOCK, ///< block is filled with two colours following custom pattern
  119. RAW_BLOCK, ///< uncoded 8x8 block
  120. };
  121. /**
  122. * Initialize length length in all bundles.
  123. *
  124. * @param c decoder context
  125. * @param width plane width
  126. * @param bw plane width in 8x8 blocks
  127. */
  128. static void init_lengths(BinkContext *c, int width, int bw)
  129. {
  130. c->bundle[BINK_SRC_BLOCK_TYPES].len = av_log2((width >> 3) + 511) + 1;
  131. c->bundle[BINK_SRC_SUB_BLOCK_TYPES].len = av_log2((width >> 4) + 511) + 1;
  132. c->bundle[BINK_SRC_COLORS].len = av_log2(bw*64 + 511) + 1;
  133. c->bundle[BINK_SRC_INTRA_DC].len =
  134. c->bundle[BINK_SRC_INTER_DC].len =
  135. c->bundle[BINK_SRC_X_OFF].len =
  136. c->bundle[BINK_SRC_Y_OFF].len = av_log2((width >> 3) + 511) + 1;
  137. c->bundle[BINK_SRC_PATTERN].len = av_log2((bw << 3) + 511) + 1;
  138. c->bundle[BINK_SRC_RUN].len = av_log2(bw*48 + 511) + 1;
  139. }
  140. /**
  141. * Allocate memory for bundles.
  142. *
  143. * @param c decoder context
  144. */
  145. static av_cold void init_bundles(BinkContext *c)
  146. {
  147. int bw, bh, blocks;
  148. int i;
  149. bw = (c->avctx->width + 7) >> 3;
  150. bh = (c->avctx->height + 7) >> 3;
  151. blocks = bw * bh;
  152. for (i = 0; i < BINKB_NB_SRC; i++) {
  153. c->bundle[i].data = av_malloc(blocks * 64);
  154. c->bundle[i].data_end = c->bundle[i].data + blocks * 64;
  155. }
  156. }
  157. /**
  158. * Free memory used by bundles.
  159. *
  160. * @param c decoder context
  161. */
  162. static av_cold void free_bundles(BinkContext *c)
  163. {
  164. int i;
  165. for (i = 0; i < BINKB_NB_SRC; i++)
  166. av_freep(&c->bundle[i].data);
  167. }
  168. /**
  169. * Merge two consequent lists of equal size depending on bits read.
  170. *
  171. * @param gb context for reading bits
  172. * @param dst buffer where merged list will be written to
  173. * @param src pointer to the head of the first list (the second lists starts at src+size)
  174. * @param size input lists size
  175. */
  176. static void merge(GetBitContext *gb, uint8_t *dst, uint8_t *src, int size)
  177. {
  178. uint8_t *src2 = src + size;
  179. int size2 = size;
  180. do {
  181. if (!get_bits1(gb)) {
  182. *dst++ = *src++;
  183. size--;
  184. } else {
  185. *dst++ = *src2++;
  186. size2--;
  187. }
  188. } while (size && size2);
  189. while (size--)
  190. *dst++ = *src++;
  191. while (size2--)
  192. *dst++ = *src2++;
  193. }
  194. /**
  195. * Read information about Huffman tree used to decode data.
  196. *
  197. * @param gb context for reading bits
  198. * @param tree pointer for storing tree data
  199. */
  200. static void read_tree(GetBitContext *gb, Tree *tree)
  201. {
  202. uint8_t tmp1[16], tmp2[16], *in = tmp1, *out = tmp2;
  203. int i, t, len;
  204. tree->vlc_num = get_bits(gb, 4);
  205. if (!tree->vlc_num) {
  206. for (i = 0; i < 16; i++)
  207. tree->syms[i] = i;
  208. return;
  209. }
  210. if (get_bits1(gb)) {
  211. len = get_bits(gb, 3);
  212. memset(tmp1, 0, sizeof(tmp1));
  213. for (i = 0; i <= len; i++) {
  214. tree->syms[i] = get_bits(gb, 4);
  215. tmp1[tree->syms[i]] = 1;
  216. }
  217. for (i = 0; i < 16 && len < 16 - 1; i++)
  218. if (!tmp1[i])
  219. tree->syms[++len] = i;
  220. } else {
  221. len = get_bits(gb, 2);
  222. for (i = 0; i < 16; i++)
  223. in[i] = i;
  224. for (i = 0; i <= len; i++) {
  225. int size = 1 << i;
  226. for (t = 0; t < 16; t += size << 1)
  227. merge(gb, out + t, in + t, size);
  228. FFSWAP(uint8_t*, in, out);
  229. }
  230. memcpy(tree->syms, in, 16);
  231. }
  232. }
  233. /**
  234. * Prepare bundle for decoding data.
  235. *
  236. * @param gb context for reading bits
  237. * @param c decoder context
  238. * @param bundle_num number of the bundle to initialize
  239. */
  240. static void read_bundle(GetBitContext *gb, BinkContext *c, int bundle_num)
  241. {
  242. int i;
  243. if (bundle_num == BINK_SRC_COLORS) {
  244. for (i = 0; i < 16; i++)
  245. read_tree(gb, &c->col_high[i]);
  246. c->col_lastval = 0;
  247. }
  248. if (bundle_num != BINK_SRC_INTRA_DC && bundle_num != BINK_SRC_INTER_DC)
  249. read_tree(gb, &c->bundle[bundle_num].tree);
  250. c->bundle[bundle_num].cur_dec =
  251. c->bundle[bundle_num].cur_ptr = c->bundle[bundle_num].data;
  252. }
  253. /**
  254. * common check before starting decoding bundle data
  255. *
  256. * @param gb context for reading bits
  257. * @param b bundle
  258. * @param t variable where number of elements to decode will be stored
  259. */
  260. #define CHECK_READ_VAL(gb, b, t) \
  261. if (!b->cur_dec || (b->cur_dec > b->cur_ptr)) \
  262. return 0; \
  263. t = get_bits(gb, b->len); \
  264. if (!t) { \
  265. b->cur_dec = NULL; \
  266. return 0; \
  267. } \
  268. static int read_runs(AVCodecContext *avctx, GetBitContext *gb, Bundle *b)
  269. {
  270. int t, v;
  271. const uint8_t *dec_end;
  272. CHECK_READ_VAL(gb, b, t);
  273. dec_end = b->cur_dec + t;
  274. if (dec_end > b->data_end) {
  275. av_log(avctx, AV_LOG_ERROR, "Run value went out of bounds\n");
  276. return -1;
  277. }
  278. if (get_bits1(gb)) {
  279. v = get_bits(gb, 4);
  280. memset(b->cur_dec, v, t);
  281. b->cur_dec += t;
  282. } else {
  283. while (b->cur_dec < dec_end)
  284. *b->cur_dec++ = GET_HUFF(gb, b->tree);
  285. }
  286. return 0;
  287. }
  288. static int read_motion_values(AVCodecContext *avctx, GetBitContext *gb, Bundle *b)
  289. {
  290. int t, sign, v;
  291. const uint8_t *dec_end;
  292. CHECK_READ_VAL(gb, b, t);
  293. dec_end = b->cur_dec + t;
  294. if (dec_end > b->data_end) {
  295. av_log(avctx, AV_LOG_ERROR, "Too many motion values\n");
  296. return -1;
  297. }
  298. if (get_bits1(gb)) {
  299. v = get_bits(gb, 4);
  300. if (v) {
  301. sign = -get_bits1(gb);
  302. v = (v ^ sign) - sign;
  303. }
  304. memset(b->cur_dec, v, t);
  305. b->cur_dec += t;
  306. } else {
  307. while (b->cur_dec < dec_end) {
  308. v = GET_HUFF(gb, b->tree);
  309. if (v) {
  310. sign = -get_bits1(gb);
  311. v = (v ^ sign) - sign;
  312. }
  313. *b->cur_dec++ = v;
  314. }
  315. }
  316. return 0;
  317. }
  318. static const uint8_t bink_rlelens[4] = { 4, 8, 12, 32 };
  319. static int read_block_types(AVCodecContext *avctx, GetBitContext *gb, Bundle *b)
  320. {
  321. int t, v;
  322. int last = 0;
  323. const uint8_t *dec_end;
  324. CHECK_READ_VAL(gb, b, t);
  325. dec_end = b->cur_dec + t;
  326. if (dec_end > b->data_end) {
  327. av_log(avctx, AV_LOG_ERROR, "Too many block type values\n");
  328. return -1;
  329. }
  330. if (get_bits1(gb)) {
  331. v = get_bits(gb, 4);
  332. memset(b->cur_dec, v, t);
  333. b->cur_dec += t;
  334. } else {
  335. while (b->cur_dec < dec_end) {
  336. v = GET_HUFF(gb, b->tree);
  337. if (v < 12) {
  338. last = v;
  339. *b->cur_dec++ = v;
  340. } else {
  341. int run = bink_rlelens[v - 12];
  342. if (dec_end - b->cur_dec < run)
  343. return -1;
  344. memset(b->cur_dec, last, run);
  345. b->cur_dec += run;
  346. }
  347. }
  348. }
  349. return 0;
  350. }
  351. static int read_patterns(AVCodecContext *avctx, GetBitContext *gb, Bundle *b)
  352. {
  353. int t, v;
  354. const uint8_t *dec_end;
  355. CHECK_READ_VAL(gb, b, t);
  356. dec_end = b->cur_dec + t;
  357. if (dec_end > b->data_end) {
  358. av_log(avctx, AV_LOG_ERROR, "Too many pattern values\n");
  359. return -1;
  360. }
  361. while (b->cur_dec < dec_end) {
  362. v = GET_HUFF(gb, b->tree);
  363. v |= GET_HUFF(gb, b->tree) << 4;
  364. *b->cur_dec++ = v;
  365. }
  366. return 0;
  367. }
  368. static int read_colors(GetBitContext *gb, Bundle *b, BinkContext *c)
  369. {
  370. int t, sign, v;
  371. const uint8_t *dec_end;
  372. CHECK_READ_VAL(gb, b, t);
  373. dec_end = b->cur_dec + t;
  374. if (dec_end > b->data_end) {
  375. av_log(c->avctx, AV_LOG_ERROR, "Too many color values\n");
  376. return -1;
  377. }
  378. if (get_bits1(gb)) {
  379. c->col_lastval = GET_HUFF(gb, c->col_high[c->col_lastval]);
  380. v = GET_HUFF(gb, b->tree);
  381. v = (c->col_lastval << 4) | v;
  382. if (c->version < 'i') {
  383. sign = ((int8_t) v) >> 7;
  384. v = ((v & 0x7F) ^ sign) - sign;
  385. v += 0x80;
  386. }
  387. memset(b->cur_dec, v, t);
  388. b->cur_dec += t;
  389. } else {
  390. while (b->cur_dec < dec_end) {
  391. c->col_lastval = GET_HUFF(gb, c->col_high[c->col_lastval]);
  392. v = GET_HUFF(gb, b->tree);
  393. v = (c->col_lastval << 4) | v;
  394. if (c->version < 'i') {
  395. sign = ((int8_t) v) >> 7;
  396. v = ((v & 0x7F) ^ sign) - sign;
  397. v += 0x80;
  398. }
  399. *b->cur_dec++ = v;
  400. }
  401. }
  402. return 0;
  403. }
  404. /** number of bits used to store first DC value in bundle */
  405. #define DC_START_BITS 11
  406. static int read_dcs(AVCodecContext *avctx, GetBitContext *gb, Bundle *b,
  407. int start_bits, int has_sign)
  408. {
  409. int i, j, len, len2, bsize, sign, v, v2;
  410. int16_t *dst = (int16_t*)b->cur_dec;
  411. int16_t *dst_end = (int16_t*)b->data_end;
  412. CHECK_READ_VAL(gb, b, len);
  413. v = get_bits(gb, start_bits - has_sign);
  414. if (v && has_sign) {
  415. sign = -get_bits1(gb);
  416. v = (v ^ sign) - sign;
  417. }
  418. if (dst_end - dst < 1)
  419. return -1;
  420. *dst++ = v;
  421. len--;
  422. for (i = 0; i < len; i += 8) {
  423. len2 = FFMIN(len - i, 8);
  424. if (dst_end - dst < len2)
  425. return -1;
  426. bsize = get_bits(gb, 4);
  427. if (bsize) {
  428. for (j = 0; j < len2; j++) {
  429. v2 = get_bits(gb, bsize);
  430. if (v2) {
  431. sign = -get_bits1(gb);
  432. v2 = (v2 ^ sign) - sign;
  433. }
  434. v += v2;
  435. *dst++ = v;
  436. if (v < -32768 || v > 32767) {
  437. av_log(avctx, AV_LOG_ERROR, "DC value went out of bounds: %d\n", v);
  438. return -1;
  439. }
  440. }
  441. } else {
  442. for (j = 0; j < len2; j++)
  443. *dst++ = v;
  444. }
  445. }
  446. b->cur_dec = (uint8_t*)dst;
  447. return 0;
  448. }
  449. /**
  450. * Retrieve next value from bundle.
  451. *
  452. * @param c decoder context
  453. * @param bundle bundle number
  454. */
  455. static inline int get_value(BinkContext *c, int bundle)
  456. {
  457. int ret;
  458. if (bundle < BINK_SRC_X_OFF || bundle == BINK_SRC_RUN)
  459. return *c->bundle[bundle].cur_ptr++;
  460. if (bundle == BINK_SRC_X_OFF || bundle == BINK_SRC_Y_OFF)
  461. return (int8_t)*c->bundle[bundle].cur_ptr++;
  462. ret = *(int16_t*)c->bundle[bundle].cur_ptr;
  463. c->bundle[bundle].cur_ptr += 2;
  464. return ret;
  465. }
  466. static void binkb_init_bundle(BinkContext *c, int bundle_num)
  467. {
  468. c->bundle[bundle_num].cur_dec =
  469. c->bundle[bundle_num].cur_ptr = c->bundle[bundle_num].data;
  470. c->bundle[bundle_num].len = 13;
  471. }
  472. static void binkb_init_bundles(BinkContext *c)
  473. {
  474. int i;
  475. for (i = 0; i < BINKB_NB_SRC; i++)
  476. binkb_init_bundle(c, i);
  477. }
  478. static int binkb_read_bundle(BinkContext *c, GetBitContext *gb, int bundle_num)
  479. {
  480. const int bits = binkb_bundle_sizes[bundle_num];
  481. const int mask = 1 << (bits - 1);
  482. const int issigned = binkb_bundle_signed[bundle_num];
  483. Bundle *b = &c->bundle[bundle_num];
  484. int i, len;
  485. CHECK_READ_VAL(gb, b, len);
  486. if (b->data_end - b->cur_dec < len * (1 + (bits > 8)))
  487. return -1;
  488. if (bits <= 8) {
  489. if (!issigned) {
  490. for (i = 0; i < len; i++)
  491. *b->cur_dec++ = get_bits(gb, bits);
  492. } else {
  493. for (i = 0; i < len; i++)
  494. *b->cur_dec++ = get_bits(gb, bits) - mask;
  495. }
  496. } else {
  497. int16_t *dst = (int16_t*)b->cur_dec;
  498. if (!issigned) {
  499. for (i = 0; i < len; i++)
  500. *dst++ = get_bits(gb, bits);
  501. } else {
  502. for (i = 0; i < len; i++)
  503. *dst++ = get_bits(gb, bits) - mask;
  504. }
  505. b->cur_dec = (uint8_t*)dst;
  506. }
  507. return 0;
  508. }
  509. static inline int binkb_get_value(BinkContext *c, int bundle_num)
  510. {
  511. int16_t ret;
  512. const int bits = binkb_bundle_sizes[bundle_num];
  513. if (bits <= 8) {
  514. int val = *c->bundle[bundle_num].cur_ptr++;
  515. return binkb_bundle_signed[bundle_num] ? (int8_t)val : val;
  516. }
  517. ret = *(int16_t*)c->bundle[bundle_num].cur_ptr;
  518. c->bundle[bundle_num].cur_ptr += 2;
  519. return ret;
  520. }
  521. /**
  522. * Read 8x8 block of DCT coefficients.
  523. *
  524. * @param gb context for reading bits
  525. * @param block place for storing coefficients
  526. * @param scan scan order table
  527. * @param quant_matrices quantization matrices
  528. * @return 0 for success, negative value in other cases
  529. */
  530. static int read_dct_coeffs(GetBitContext *gb, DCTELEM block[64], const uint8_t *scan,
  531. const uint32_t quant_matrices[16][64], int q)
  532. {
  533. int coef_list[128];
  534. int mode_list[128];
  535. int i, t, mask, bits, ccoef, mode, sign;
  536. int list_start = 64, list_end = 64, list_pos;
  537. int coef_count = 0;
  538. int coef_idx[64];
  539. int quant_idx;
  540. const uint32_t *quant;
  541. coef_list[list_end] = 4; mode_list[list_end++] = 0;
  542. coef_list[list_end] = 24; mode_list[list_end++] = 0;
  543. coef_list[list_end] = 44; mode_list[list_end++] = 0;
  544. coef_list[list_end] = 1; mode_list[list_end++] = 3;
  545. coef_list[list_end] = 2; mode_list[list_end++] = 3;
  546. coef_list[list_end] = 3; mode_list[list_end++] = 3;
  547. bits = get_bits(gb, 4) - 1;
  548. for (mask = 1 << bits; bits >= 0; mask >>= 1, bits--) {
  549. list_pos = list_start;
  550. while (list_pos < list_end) {
  551. if (!(mode_list[list_pos] | coef_list[list_pos]) || !get_bits1(gb)) {
  552. list_pos++;
  553. continue;
  554. }
  555. ccoef = coef_list[list_pos];
  556. mode = mode_list[list_pos];
  557. switch (mode) {
  558. case 0:
  559. coef_list[list_pos] = ccoef + 4;
  560. mode_list[list_pos] = 1;
  561. case 2:
  562. if (mode == 2) {
  563. coef_list[list_pos] = 0;
  564. mode_list[list_pos++] = 0;
  565. }
  566. for (i = 0; i < 4; i++, ccoef++) {
  567. if (get_bits1(gb)) {
  568. coef_list[--list_start] = ccoef;
  569. mode_list[ list_start] = 3;
  570. } else {
  571. int t;
  572. if (!bits) {
  573. t = 1 - (get_bits1(gb) << 1);
  574. } else {
  575. t = get_bits(gb, bits) | mask;
  576. sign = -get_bits1(gb);
  577. t = (t ^ sign) - sign;
  578. }
  579. block[scan[ccoef]] = t;
  580. coef_idx[coef_count++] = ccoef;
  581. }
  582. }
  583. break;
  584. case 1:
  585. mode_list[list_pos] = 2;
  586. for (i = 0; i < 3; i++) {
  587. ccoef += 4;
  588. coef_list[list_end] = ccoef;
  589. mode_list[list_end++] = 2;
  590. }
  591. break;
  592. case 3:
  593. if (!bits) {
  594. t = 1 - (get_bits1(gb) << 1);
  595. } else {
  596. t = get_bits(gb, bits) | mask;
  597. sign = -get_bits1(gb);
  598. t = (t ^ sign) - sign;
  599. }
  600. block[scan[ccoef]] = t;
  601. coef_idx[coef_count++] = ccoef;
  602. coef_list[list_pos] = 0;
  603. mode_list[list_pos++] = 0;
  604. break;
  605. }
  606. }
  607. }
  608. if (q == -1) {
  609. quant_idx = get_bits(gb, 4);
  610. } else {
  611. quant_idx = q;
  612. }
  613. quant = quant_matrices[quant_idx];
  614. block[0] = (block[0] * quant[0]) >> 11;
  615. for (i = 0; i < coef_count; i++) {
  616. int idx = coef_idx[i];
  617. block[scan[idx]] = (block[scan[idx]] * quant[idx]) >> 11;
  618. }
  619. return 0;
  620. }
  621. /**
  622. * Read 8x8 block with residue after motion compensation.
  623. *
  624. * @param gb context for reading bits
  625. * @param block place to store read data
  626. * @param masks_count number of masks to decode
  627. * @return 0 on success, negative value in other cases
  628. */
  629. static int read_residue(GetBitContext *gb, DCTELEM block[64], int masks_count)
  630. {
  631. int coef_list[128];
  632. int mode_list[128];
  633. int i, sign, mask, ccoef, mode;
  634. int list_start = 64, list_end = 64, list_pos;
  635. int nz_coeff[64];
  636. int nz_coeff_count = 0;
  637. coef_list[list_end] = 4; mode_list[list_end++] = 0;
  638. coef_list[list_end] = 24; mode_list[list_end++] = 0;
  639. coef_list[list_end] = 44; mode_list[list_end++] = 0;
  640. coef_list[list_end] = 0; mode_list[list_end++] = 2;
  641. for (mask = 1 << get_bits(gb, 3); mask; mask >>= 1) {
  642. for (i = 0; i < nz_coeff_count; i++) {
  643. if (!get_bits1(gb))
  644. continue;
  645. if (block[nz_coeff[i]] < 0)
  646. block[nz_coeff[i]] -= mask;
  647. else
  648. block[nz_coeff[i]] += mask;
  649. masks_count--;
  650. if (masks_count < 0)
  651. return 0;
  652. }
  653. list_pos = list_start;
  654. while (list_pos < list_end) {
  655. if (!(coef_list[list_pos] | mode_list[list_pos]) || !get_bits1(gb)) {
  656. list_pos++;
  657. continue;
  658. }
  659. ccoef = coef_list[list_pos];
  660. mode = mode_list[list_pos];
  661. switch (mode) {
  662. case 0:
  663. coef_list[list_pos] = ccoef + 4;
  664. mode_list[list_pos] = 1;
  665. case 2:
  666. if (mode == 2) {
  667. coef_list[list_pos] = 0;
  668. mode_list[list_pos++] = 0;
  669. }
  670. for (i = 0; i < 4; i++, ccoef++) {
  671. if (get_bits1(gb)) {
  672. coef_list[--list_start] = ccoef;
  673. mode_list[ list_start] = 3;
  674. } else {
  675. nz_coeff[nz_coeff_count++] = bink_scan[ccoef];
  676. sign = -get_bits1(gb);
  677. block[bink_scan[ccoef]] = (mask ^ sign) - sign;
  678. masks_count--;
  679. if (masks_count < 0)
  680. return 0;
  681. }
  682. }
  683. break;
  684. case 1:
  685. mode_list[list_pos] = 2;
  686. for (i = 0; i < 3; i++) {
  687. ccoef += 4;
  688. coef_list[list_end] = ccoef;
  689. mode_list[list_end++] = 2;
  690. }
  691. break;
  692. case 3:
  693. nz_coeff[nz_coeff_count++] = bink_scan[ccoef];
  694. sign = -get_bits1(gb);
  695. block[bink_scan[ccoef]] = (mask ^ sign) - sign;
  696. coef_list[list_pos] = 0;
  697. mode_list[list_pos++] = 0;
  698. masks_count--;
  699. if (masks_count < 0)
  700. return 0;
  701. break;
  702. }
  703. }
  704. }
  705. return 0;
  706. }
  707. /**
  708. * Copy 8x8 block from source to destination, where src and dst may be overlapped
  709. */
  710. static inline void put_pixels8x8_overlapped(uint8_t *dst, uint8_t *src, int stride)
  711. {
  712. uint8_t tmp[64];
  713. int i;
  714. for (i = 0; i < 8; i++)
  715. memcpy(tmp + i*8, src + i*stride, 8);
  716. for (i = 0; i < 8; i++)
  717. memcpy(dst + i*stride, tmp + i*8, 8);
  718. }
  719. static int binkb_decode_plane(BinkContext *c, GetBitContext *gb, int plane_idx,
  720. int is_key, int is_chroma)
  721. {
  722. int blk;
  723. int i, j, bx, by;
  724. uint8_t *dst, *ref, *ref_start, *ref_end;
  725. int v, col[2];
  726. const uint8_t *scan;
  727. int xoff, yoff;
  728. LOCAL_ALIGNED_16(DCTELEM, block, [64]);
  729. int coordmap[64];
  730. int ybias = is_key ? -15 : 0;
  731. int qp;
  732. const int stride = c->pic.linesize[plane_idx];
  733. int bw = is_chroma ? (c->avctx->width + 15) >> 4 : (c->avctx->width + 7) >> 3;
  734. int bh = is_chroma ? (c->avctx->height + 15) >> 4 : (c->avctx->height + 7) >> 3;
  735. binkb_init_bundles(c);
  736. ref_start = c->pic.data[plane_idx];
  737. ref_end = c->pic.data[plane_idx] + (bh * c->pic.linesize[plane_idx] + bw) * 8;
  738. for (i = 0; i < 64; i++)
  739. coordmap[i] = (i & 7) + (i >> 3) * stride;
  740. for (by = 0; by < bh; by++) {
  741. for (i = 0; i < BINKB_NB_SRC; i++) {
  742. if (binkb_read_bundle(c, gb, i) < 0)
  743. return -1;
  744. }
  745. dst = c->pic.data[plane_idx] + 8*by*stride;
  746. for (bx = 0; bx < bw; bx++, dst += 8) {
  747. blk = binkb_get_value(c, BINKB_SRC_BLOCK_TYPES);
  748. switch (blk) {
  749. case 0:
  750. break;
  751. case 1:
  752. scan = bink_patterns[get_bits(gb, 4)];
  753. i = 0;
  754. do {
  755. int mode, run;
  756. mode = get_bits1(gb);
  757. run = get_bits(gb, binkb_runbits[i]) + 1;
  758. i += run;
  759. if (i > 64) {
  760. av_log(c->avctx, AV_LOG_ERROR, "Run went out of bounds\n");
  761. return -1;
  762. }
  763. if (mode) {
  764. v = binkb_get_value(c, BINKB_SRC_COLORS);
  765. for (j = 0; j < run; j++)
  766. dst[coordmap[*scan++]] = v;
  767. } else {
  768. for (j = 0; j < run; j++)
  769. dst[coordmap[*scan++]] = binkb_get_value(c, BINKB_SRC_COLORS);
  770. }
  771. } while (i < 63);
  772. if (i == 63)
  773. dst[coordmap[*scan++]] = binkb_get_value(c, BINKB_SRC_COLORS);
  774. break;
  775. case 2:
  776. c->dsp.clear_block(block);
  777. block[0] = binkb_get_value(c, BINKB_SRC_INTRA_DC);
  778. qp = binkb_get_value(c, BINKB_SRC_INTRA_Q);
  779. read_dct_coeffs(gb, block, c->scantable.permutated, binkb_intra_quant, qp);
  780. c->dsp.idct_put(dst, stride, block);
  781. break;
  782. case 3:
  783. xoff = binkb_get_value(c, BINKB_SRC_X_OFF);
  784. yoff = binkb_get_value(c, BINKB_SRC_Y_OFF) + ybias;
  785. ref = dst + xoff + yoff * stride;
  786. if (ref < ref_start || ref + 8*stride > ref_end) {
  787. av_log(c->avctx, AV_LOG_WARNING, "Reference block is out of bounds\n");
  788. } else if (ref + 8*stride < dst || ref >= dst + 8*stride) {
  789. c->dsp.put_pixels_tab[1][0](dst, ref, stride, 8);
  790. } else {
  791. put_pixels8x8_overlapped(dst, ref, stride);
  792. }
  793. c->dsp.clear_block(block);
  794. v = binkb_get_value(c, BINKB_SRC_INTER_COEFS);
  795. read_residue(gb, block, v);
  796. c->dsp.add_pixels8(dst, block, stride);
  797. break;
  798. case 4:
  799. xoff = binkb_get_value(c, BINKB_SRC_X_OFF);
  800. yoff = binkb_get_value(c, BINKB_SRC_Y_OFF) + ybias;
  801. ref = dst + xoff + yoff * stride;
  802. if (ref < ref_start || ref + 8 * stride > ref_end) {
  803. av_log(c->avctx, AV_LOG_WARNING, "Reference block is out of bounds\n");
  804. } else if (ref + 8*stride < dst || ref >= dst + 8*stride) {
  805. c->dsp.put_pixels_tab[1][0](dst, ref, stride, 8);
  806. } else {
  807. put_pixels8x8_overlapped(dst, ref, stride);
  808. }
  809. c->dsp.clear_block(block);
  810. block[0] = binkb_get_value(c, BINKB_SRC_INTER_DC);
  811. qp = binkb_get_value(c, BINKB_SRC_INTER_Q);
  812. read_dct_coeffs(gb, block, c->scantable.permutated, binkb_inter_quant, qp);
  813. c->dsp.idct_add(dst, stride, block);
  814. break;
  815. case 5:
  816. v = binkb_get_value(c, BINKB_SRC_COLORS);
  817. c->dsp.fill_block_tab[1](dst, v, stride, 8);
  818. break;
  819. case 6:
  820. for (i = 0; i < 2; i++)
  821. col[i] = binkb_get_value(c, BINKB_SRC_COLORS);
  822. for (i = 0; i < 8; i++) {
  823. v = binkb_get_value(c, BINKB_SRC_PATTERN);
  824. for (j = 0; j < 8; j++, v >>= 1)
  825. dst[i*stride + j] = col[v & 1];
  826. }
  827. break;
  828. case 7:
  829. xoff = binkb_get_value(c, BINKB_SRC_X_OFF);
  830. yoff = binkb_get_value(c, BINKB_SRC_Y_OFF) + ybias;
  831. ref = dst + xoff + yoff * stride;
  832. if (ref < ref_start || ref + 8 * stride > ref_end) {
  833. av_log(c->avctx, AV_LOG_WARNING, "Reference block is out of bounds\n");
  834. } else if (ref + 8*stride < dst || ref >= dst + 8*stride) {
  835. c->dsp.put_pixels_tab[1][0](dst, ref, stride, 8);
  836. } else {
  837. put_pixels8x8_overlapped(dst, ref, stride);
  838. }
  839. break;
  840. case 8:
  841. for (i = 0; i < 8; i++)
  842. memcpy(dst + i*stride, c->bundle[BINKB_SRC_COLORS].cur_ptr + i*8, 8);
  843. c->bundle[BINKB_SRC_COLORS].cur_ptr += 64;
  844. break;
  845. default:
  846. av_log(c->avctx, AV_LOG_ERROR, "Unknown block type %d\n", blk);
  847. return -1;
  848. }
  849. }
  850. }
  851. if (get_bits_count(gb) & 0x1F) //next plane data starts at 32-bit boundary
  852. skip_bits_long(gb, 32 - (get_bits_count(gb) & 0x1F));
  853. return 0;
  854. }
  855. static int bink_decode_plane(BinkContext *c, GetBitContext *gb, int plane_idx,
  856. int is_chroma)
  857. {
  858. int blk;
  859. int i, j, bx, by;
  860. uint8_t *dst, *prev, *ref, *ref_start, *ref_end;
  861. int v, col[2];
  862. const uint8_t *scan;
  863. int xoff, yoff;
  864. LOCAL_ALIGNED_16(DCTELEM, block, [64]);
  865. LOCAL_ALIGNED_16(uint8_t, ublock, [64]);
  866. int coordmap[64];
  867. const int stride = c->pic.linesize[plane_idx];
  868. int bw = is_chroma ? (c->avctx->width + 15) >> 4 : (c->avctx->width + 7) >> 3;
  869. int bh = is_chroma ? (c->avctx->height + 15) >> 4 : (c->avctx->height + 7) >> 3;
  870. int width = c->avctx->width >> is_chroma;
  871. init_lengths(c, FFMAX(width, 8), bw);
  872. for (i = 0; i < BINK_NB_SRC; i++)
  873. read_bundle(gb, c, i);
  874. ref_start = c->last.data[plane_idx] ? c->last.data[plane_idx]
  875. : c->pic.data[plane_idx];
  876. ref_end = ref_start
  877. + (bw - 1 + c->last.linesize[plane_idx] * (bh - 1)) * 8;
  878. for (i = 0; i < 64; i++)
  879. coordmap[i] = (i & 7) + (i >> 3) * stride;
  880. for (by = 0; by < bh; by++) {
  881. if (read_block_types(c->avctx, gb, &c->bundle[BINK_SRC_BLOCK_TYPES]) < 0)
  882. return -1;
  883. if (read_block_types(c->avctx, gb, &c->bundle[BINK_SRC_SUB_BLOCK_TYPES]) < 0)
  884. return -1;
  885. if (read_colors(gb, &c->bundle[BINK_SRC_COLORS], c) < 0)
  886. return -1;
  887. if (read_patterns(c->avctx, gb, &c->bundle[BINK_SRC_PATTERN]) < 0)
  888. return -1;
  889. if (read_motion_values(c->avctx, gb, &c->bundle[BINK_SRC_X_OFF]) < 0)
  890. return -1;
  891. if (read_motion_values(c->avctx, gb, &c->bundle[BINK_SRC_Y_OFF]) < 0)
  892. return -1;
  893. if (read_dcs(c->avctx, gb, &c->bundle[BINK_SRC_INTRA_DC], DC_START_BITS, 0) < 0)
  894. return -1;
  895. if (read_dcs(c->avctx, gb, &c->bundle[BINK_SRC_INTER_DC], DC_START_BITS, 1) < 0)
  896. return -1;
  897. if (read_runs(c->avctx, gb, &c->bundle[BINK_SRC_RUN]) < 0)
  898. return -1;
  899. if (by == bh)
  900. break;
  901. dst = c->pic.data[plane_idx] + 8*by*stride;
  902. prev = (c->last.data[plane_idx] ? c->last.data[plane_idx]
  903. : c->pic.data[plane_idx]) + 8*by*stride;
  904. for (bx = 0; bx < bw; bx++, dst += 8, prev += 8) {
  905. blk = get_value(c, BINK_SRC_BLOCK_TYPES);
  906. // 16x16 block type on odd line means part of the already decoded block, so skip it
  907. if ((by & 1) && blk == SCALED_BLOCK) {
  908. bx++;
  909. dst += 8;
  910. prev += 8;
  911. continue;
  912. }
  913. switch (blk) {
  914. case SKIP_BLOCK:
  915. c->dsp.put_pixels_tab[1][0](dst, prev, stride, 8);
  916. break;
  917. case SCALED_BLOCK:
  918. blk = get_value(c, BINK_SRC_SUB_BLOCK_TYPES);
  919. switch (blk) {
  920. case RUN_BLOCK:
  921. scan = bink_patterns[get_bits(gb, 4)];
  922. i = 0;
  923. do {
  924. int run = get_value(c, BINK_SRC_RUN) + 1;
  925. i += run;
  926. if (i > 64) {
  927. av_log(c->avctx, AV_LOG_ERROR, "Run went out of bounds\n");
  928. return -1;
  929. }
  930. if (get_bits1(gb)) {
  931. v = get_value(c, BINK_SRC_COLORS);
  932. for (j = 0; j < run; j++)
  933. ublock[*scan++] = v;
  934. } else {
  935. for (j = 0; j < run; j++)
  936. ublock[*scan++] = get_value(c, BINK_SRC_COLORS);
  937. }
  938. } while (i < 63);
  939. if (i == 63)
  940. ublock[*scan++] = get_value(c, BINK_SRC_COLORS);
  941. break;
  942. case INTRA_BLOCK:
  943. c->dsp.clear_block(block);
  944. block[0] = get_value(c, BINK_SRC_INTRA_DC);
  945. read_dct_coeffs(gb, block, c->scantable.permutated, bink_intra_quant, -1);
  946. c->dsp.idct(block);
  947. c->dsp.put_pixels_nonclamped(block, ublock, 8);
  948. break;
  949. case FILL_BLOCK:
  950. v = get_value(c, BINK_SRC_COLORS);
  951. c->dsp.fill_block_tab[0](dst, v, stride, 16);
  952. break;
  953. case PATTERN_BLOCK:
  954. for (i = 0; i < 2; i++)
  955. col[i] = get_value(c, BINK_SRC_COLORS);
  956. for (j = 0; j < 8; j++) {
  957. v = get_value(c, BINK_SRC_PATTERN);
  958. for (i = 0; i < 8; i++, v >>= 1)
  959. ublock[i + j*8] = col[v & 1];
  960. }
  961. break;
  962. case RAW_BLOCK:
  963. for (j = 0; j < 8; j++)
  964. for (i = 0; i < 8; i++)
  965. ublock[i + j*8] = get_value(c, BINK_SRC_COLORS);
  966. break;
  967. default:
  968. av_log(c->avctx, AV_LOG_ERROR, "Incorrect 16x16 block type %d\n", blk);
  969. return -1;
  970. }
  971. if (blk != FILL_BLOCK)
  972. c->dsp.scale_block(ublock, dst, stride);
  973. bx++;
  974. dst += 8;
  975. prev += 8;
  976. break;
  977. case MOTION_BLOCK:
  978. xoff = get_value(c, BINK_SRC_X_OFF);
  979. yoff = get_value(c, BINK_SRC_Y_OFF);
  980. ref = prev + xoff + yoff * stride;
  981. if (ref < ref_start || ref > ref_end) {
  982. av_log(c->avctx, AV_LOG_ERROR, "Copy out of bounds @%d, %d\n",
  983. bx*8 + xoff, by*8 + yoff);
  984. return -1;
  985. }
  986. c->dsp.put_pixels_tab[1][0](dst, ref, stride, 8);
  987. break;
  988. case RUN_BLOCK:
  989. scan = bink_patterns[get_bits(gb, 4)];
  990. i = 0;
  991. do {
  992. int run = get_value(c, BINK_SRC_RUN) + 1;
  993. i += run;
  994. if (i > 64) {
  995. av_log(c->avctx, AV_LOG_ERROR, "Run went out of bounds\n");
  996. return -1;
  997. }
  998. if (get_bits1(gb)) {
  999. v = get_value(c, BINK_SRC_COLORS);
  1000. for (j = 0; j < run; j++)
  1001. dst[coordmap[*scan++]] = v;
  1002. } else {
  1003. for (j = 0; j < run; j++)
  1004. dst[coordmap[*scan++]] = get_value(c, BINK_SRC_COLORS);
  1005. }
  1006. } while (i < 63);
  1007. if (i == 63)
  1008. dst[coordmap[*scan++]] = get_value(c, BINK_SRC_COLORS);
  1009. break;
  1010. case RESIDUE_BLOCK:
  1011. xoff = get_value(c, BINK_SRC_X_OFF);
  1012. yoff = get_value(c, BINK_SRC_Y_OFF);
  1013. ref = prev + xoff + yoff * stride;
  1014. if (ref < ref_start || ref > ref_end) {
  1015. av_log(c->avctx, AV_LOG_ERROR, "Copy out of bounds @%d, %d\n",
  1016. bx*8 + xoff, by*8 + yoff);
  1017. return -1;
  1018. }
  1019. c->dsp.put_pixels_tab[1][0](dst, ref, stride, 8);
  1020. c->dsp.clear_block(block);
  1021. v = get_bits(gb, 7);
  1022. read_residue(gb, block, v);
  1023. c->dsp.add_pixels8(dst, block, stride);
  1024. break;
  1025. case INTRA_BLOCK:
  1026. c->dsp.clear_block(block);
  1027. block[0] = get_value(c, BINK_SRC_INTRA_DC);
  1028. read_dct_coeffs(gb, block, c->scantable.permutated, bink_intra_quant, -1);
  1029. c->dsp.idct_put(dst, stride, block);
  1030. break;
  1031. case FILL_BLOCK:
  1032. v = get_value(c, BINK_SRC_COLORS);
  1033. c->dsp.fill_block_tab[1](dst, v, stride, 8);
  1034. break;
  1035. case INTER_BLOCK:
  1036. xoff = get_value(c, BINK_SRC_X_OFF);
  1037. yoff = get_value(c, BINK_SRC_Y_OFF);
  1038. ref = prev + xoff + yoff * stride;
  1039. c->dsp.put_pixels_tab[1][0](dst, ref, stride, 8);
  1040. c->dsp.clear_block(block);
  1041. block[0] = get_value(c, BINK_SRC_INTER_DC);
  1042. read_dct_coeffs(gb, block, c->scantable.permutated, bink_inter_quant, -1);
  1043. c->dsp.idct_add(dst, stride, block);
  1044. break;
  1045. case PATTERN_BLOCK:
  1046. for (i = 0; i < 2; i++)
  1047. col[i] = get_value(c, BINK_SRC_COLORS);
  1048. for (i = 0; i < 8; i++) {
  1049. v = get_value(c, BINK_SRC_PATTERN);
  1050. for (j = 0; j < 8; j++, v >>= 1)
  1051. dst[i*stride + j] = col[v & 1];
  1052. }
  1053. break;
  1054. case RAW_BLOCK:
  1055. for (i = 0; i < 8; i++)
  1056. memcpy(dst + i*stride, c->bundle[BINK_SRC_COLORS].cur_ptr + i*8, 8);
  1057. c->bundle[BINK_SRC_COLORS].cur_ptr += 64;
  1058. break;
  1059. default:
  1060. av_log(c->avctx, AV_LOG_ERROR, "Unknown block type %d\n", blk);
  1061. return -1;
  1062. }
  1063. }
  1064. }
  1065. if (get_bits_count(gb) & 0x1F) //next plane data starts at 32-bit boundary
  1066. skip_bits_long(gb, 32 - (get_bits_count(gb) & 0x1F));
  1067. return 0;
  1068. }
  1069. static int decode_frame(AVCodecContext *avctx, void *data, int *data_size, AVPacket *pkt)
  1070. {
  1071. BinkContext * const c = avctx->priv_data;
  1072. GetBitContext gb;
  1073. int plane, plane_idx;
  1074. int bits_count = pkt->size << 3;
  1075. if (c->version > 'b') {
  1076. if(c->pic.data[0])
  1077. avctx->release_buffer(avctx, &c->pic);
  1078. if(avctx->get_buffer(avctx, &c->pic) < 0){
  1079. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  1080. return -1;
  1081. }
  1082. } else {
  1083. if(avctx->reget_buffer(avctx, &c->pic) < 0){
  1084. av_log(avctx, AV_LOG_ERROR, "reget_buffer() failed\n");
  1085. return -1;
  1086. }
  1087. }
  1088. init_get_bits(&gb, pkt->data, bits_count);
  1089. if (c->has_alpha) {
  1090. if (c->version >= 'i')
  1091. skip_bits_long(&gb, 32);
  1092. if (bink_decode_plane(c, &gb, 3, 0) < 0)
  1093. return -1;
  1094. }
  1095. if (c->version >= 'i')
  1096. skip_bits_long(&gb, 32);
  1097. for (plane = 0; plane < 3; plane++) {
  1098. plane_idx = (!plane || !c->swap_planes) ? plane : (plane ^ 3);
  1099. if (c->version > 'b') {
  1100. if (bink_decode_plane(c, &gb, plane_idx, !!plane) < 0)
  1101. return -1;
  1102. } else {
  1103. if (binkb_decode_plane(c, &gb, plane_idx, !pkt->pts, !!plane) < 0)
  1104. return -1;
  1105. }
  1106. if (get_bits_count(&gb) >= bits_count)
  1107. break;
  1108. }
  1109. emms_c();
  1110. *data_size = sizeof(AVFrame);
  1111. *(AVFrame*)data = c->pic;
  1112. if (c->version > 'b')
  1113. FFSWAP(AVFrame, c->pic, c->last);
  1114. /* always report that the buffer was completely consumed */
  1115. return pkt->size;
  1116. }
  1117. /**
  1118. * Caclulate quantization tables for version b
  1119. */
  1120. static av_cold void binkb_calc_quant(void)
  1121. {
  1122. uint8_t inv_bink_scan[64];
  1123. double s[64];
  1124. int i, j;
  1125. for (j = 0; j < 8; j++) {
  1126. for (i = 0; i < 8; i++) {
  1127. if (j && j != 4)
  1128. if (i && i != 4)
  1129. s[j*8 + i] = cos(j * M_PI/16.0) * cos(i * M_PI/16.0) * 2.0;
  1130. else
  1131. s[j*8 + i] = cos(j * M_PI/16.0) * sqrt(2.0);
  1132. else
  1133. if (i && i != 4)
  1134. s[j*8 + i] = cos(i * M_PI/16.0) * sqrt(2.0);
  1135. else
  1136. s[j*8 + i] = 1.0;
  1137. }
  1138. }
  1139. for (i = 0; i < 64; i++)
  1140. inv_bink_scan[bink_scan[i]] = i;
  1141. for (j = 0; j < 16; j++) {
  1142. for (i = 0; i < 64; i++) {
  1143. int k = inv_bink_scan[i];
  1144. if (s[i] == 1.0) {
  1145. binkb_intra_quant[j][k] = (1L << 12) * binkb_intra_seed[i] *
  1146. binkb_num[j]/binkb_den[j];
  1147. binkb_inter_quant[j][k] = (1L << 12) * binkb_inter_seed[i] *
  1148. binkb_num[j]/binkb_den[j];
  1149. } else {
  1150. binkb_intra_quant[j][k] = (1L << 12) * binkb_intra_seed[i] * s[i] *
  1151. binkb_num[j]/(double)binkb_den[j];
  1152. binkb_inter_quant[j][k] = (1L << 12) * binkb_inter_seed[i] * s[i] *
  1153. binkb_num[j]/(double)binkb_den[j];
  1154. }
  1155. }
  1156. }
  1157. }
  1158. static av_cold int decode_init(AVCodecContext *avctx)
  1159. {
  1160. BinkContext * const c = avctx->priv_data;
  1161. static VLC_TYPE table[16 * 128][2];
  1162. static int binkb_initialised = 0;
  1163. int i;
  1164. int flags;
  1165. c->version = avctx->codec_tag >> 24;
  1166. if (avctx->extradata_size < 4) {
  1167. av_log(avctx, AV_LOG_ERROR, "Extradata missing or too short\n");
  1168. return -1;
  1169. }
  1170. flags = AV_RL32(avctx->extradata);
  1171. c->has_alpha = flags & BINK_FLAG_ALPHA;
  1172. c->swap_planes = c->version >= 'h';
  1173. if (!bink_trees[15].table) {
  1174. for (i = 0; i < 16; i++) {
  1175. const int maxbits = bink_tree_lens[i][15];
  1176. bink_trees[i].table = table + i*128;
  1177. bink_trees[i].table_allocated = 1 << maxbits;
  1178. init_vlc(&bink_trees[i], maxbits, 16,
  1179. bink_tree_lens[i], 1, 1,
  1180. bink_tree_bits[i], 1, 1, INIT_VLC_USE_NEW_STATIC | INIT_VLC_LE);
  1181. }
  1182. }
  1183. c->avctx = avctx;
  1184. c->pic.data[0] = NULL;
  1185. if (av_image_check_size(avctx->width, avctx->height, 0, avctx) < 0) {
  1186. return 1;
  1187. }
  1188. avctx->pix_fmt = c->has_alpha ? PIX_FMT_YUVA420P : PIX_FMT_YUV420P;
  1189. avctx->idct_algo = FF_IDCT_BINK;
  1190. dsputil_init(&c->dsp, avctx);
  1191. ff_init_scantable(c->dsp.idct_permutation, &c->scantable, bink_scan);
  1192. init_bundles(c);
  1193. if (c->version == 'b') {
  1194. if (!binkb_initialised) {
  1195. binkb_calc_quant();
  1196. binkb_initialised = 1;
  1197. }
  1198. }
  1199. return 0;
  1200. }
  1201. static av_cold int decode_end(AVCodecContext *avctx)
  1202. {
  1203. BinkContext * const c = avctx->priv_data;
  1204. if (c->pic.data[0])
  1205. avctx->release_buffer(avctx, &c->pic);
  1206. if (c->last.data[0])
  1207. avctx->release_buffer(avctx, &c->last);
  1208. free_bundles(c);
  1209. return 0;
  1210. }
  1211. AVCodec ff_bink_decoder = {
  1212. "binkvideo",
  1213. AVMEDIA_TYPE_VIDEO,
  1214. CODEC_ID_BINKVIDEO,
  1215. sizeof(BinkContext),
  1216. decode_init,
  1217. NULL,
  1218. decode_end,
  1219. decode_frame,
  1220. .long_name = NULL_IF_CONFIG_SMALL("Bink video"),
  1221. };