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.

1329 lines
43KB

  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 FFmpeg.
  7. *
  8. * FFmpeg 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. * FFmpeg 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 FFmpeg; 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; 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. do {
  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. } while (b->cur_dec < dec_end);
  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. do {
  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. memset(b->cur_dec, last, run);
  343. b->cur_dec += run;
  344. }
  345. } while (b->cur_dec < dec_end);
  346. }
  347. return 0;
  348. }
  349. static int read_patterns(AVCodecContext *avctx, GetBitContext *gb, Bundle *b)
  350. {
  351. int t, v;
  352. const uint8_t *dec_end;
  353. CHECK_READ_VAL(gb, b, t);
  354. dec_end = b->cur_dec + t;
  355. if (dec_end > b->data_end) {
  356. av_log(avctx, AV_LOG_ERROR, "Too many pattern values\n");
  357. return -1;
  358. }
  359. while (b->cur_dec < dec_end) {
  360. v = GET_HUFF(gb, b->tree);
  361. v |= GET_HUFF(gb, b->tree) << 4;
  362. *b->cur_dec++ = v;
  363. }
  364. return 0;
  365. }
  366. static int read_colors(GetBitContext *gb, Bundle *b, BinkContext *c)
  367. {
  368. int t, sign, v;
  369. const uint8_t *dec_end;
  370. CHECK_READ_VAL(gb, b, t);
  371. dec_end = b->cur_dec + t;
  372. if (dec_end > b->data_end) {
  373. av_log(c->avctx, AV_LOG_ERROR, "Too many color values\n");
  374. return -1;
  375. }
  376. if (get_bits1(gb)) {
  377. c->col_lastval = GET_HUFF(gb, c->col_high[c->col_lastval]);
  378. v = GET_HUFF(gb, b->tree);
  379. v = (c->col_lastval << 4) | v;
  380. if (c->version < 'i') {
  381. sign = ((int8_t) v) >> 7;
  382. v = ((v & 0x7F) ^ sign) - sign;
  383. v += 0x80;
  384. }
  385. memset(b->cur_dec, v, t);
  386. b->cur_dec += t;
  387. } else {
  388. while (b->cur_dec < dec_end) {
  389. c->col_lastval = GET_HUFF(gb, c->col_high[c->col_lastval]);
  390. v = GET_HUFF(gb, b->tree);
  391. v = (c->col_lastval << 4) | v;
  392. if (c->version < 'i') {
  393. sign = ((int8_t) v) >> 7;
  394. v = ((v & 0x7F) ^ sign) - sign;
  395. v += 0x80;
  396. }
  397. *b->cur_dec++ = v;
  398. }
  399. }
  400. return 0;
  401. }
  402. /** number of bits used to store first DC value in bundle */
  403. #define DC_START_BITS 11
  404. static int read_dcs(AVCodecContext *avctx, GetBitContext *gb, Bundle *b,
  405. int start_bits, int has_sign)
  406. {
  407. int i, j, len, len2, bsize, sign, v, v2;
  408. int16_t *dst = (int16_t*)b->cur_dec;
  409. CHECK_READ_VAL(gb, b, len);
  410. v = get_bits(gb, start_bits - has_sign);
  411. if (v && has_sign) {
  412. sign = -get_bits1(gb);
  413. v = (v ^ sign) - sign;
  414. }
  415. *dst++ = v;
  416. len--;
  417. for (i = 0; i < len; i += 8) {
  418. len2 = FFMIN(len - i, 8);
  419. bsize = get_bits(gb, 4);
  420. if (bsize) {
  421. for (j = 0; j < len2; j++) {
  422. v2 = get_bits(gb, bsize);
  423. if (v2) {
  424. sign = -get_bits1(gb);
  425. v2 = (v2 ^ sign) - sign;
  426. }
  427. v += v2;
  428. *dst++ = v;
  429. if (v < -32768 || v > 32767) {
  430. av_log(avctx, AV_LOG_ERROR, "DC value went out of bounds: %d\n", v);
  431. return -1;
  432. }
  433. }
  434. } else {
  435. for (j = 0; j < len2; j++)
  436. *dst++ = v;
  437. }
  438. }
  439. b->cur_dec = (uint8_t*)dst;
  440. return 0;
  441. }
  442. /**
  443. * Retrieve next value from bundle.
  444. *
  445. * @param c decoder context
  446. * @param bundle bundle number
  447. */
  448. static inline int get_value(BinkContext *c, int bundle)
  449. {
  450. int ret;
  451. if (bundle < BINK_SRC_X_OFF || bundle == BINK_SRC_RUN)
  452. return *c->bundle[bundle].cur_ptr++;
  453. if (bundle == BINK_SRC_X_OFF || bundle == BINK_SRC_Y_OFF)
  454. return (int8_t)*c->bundle[bundle].cur_ptr++;
  455. ret = *(int16_t*)c->bundle[bundle].cur_ptr;
  456. c->bundle[bundle].cur_ptr += 2;
  457. return ret;
  458. }
  459. static void binkb_init_bundle(BinkContext *c, int bundle_num)
  460. {
  461. c->bundle[bundle_num].cur_dec =
  462. c->bundle[bundle_num].cur_ptr = c->bundle[bundle_num].data;
  463. c->bundle[bundle_num].len = 13;
  464. }
  465. static void binkb_init_bundles(BinkContext *c)
  466. {
  467. int i;
  468. for (i = 0; i < BINKB_NB_SRC; i++)
  469. binkb_init_bundle(c, i);
  470. }
  471. static int binkb_read_bundle(BinkContext *c, GetBitContext *gb, int bundle_num)
  472. {
  473. const int bits = binkb_bundle_sizes[bundle_num];
  474. const int mask = 1 << (bits - 1);
  475. const int issigned = binkb_bundle_signed[bundle_num];
  476. Bundle *b = &c->bundle[bundle_num];
  477. int i, len;
  478. CHECK_READ_VAL(gb, b, len);
  479. if (bits <= 8) {
  480. if (!issigned) {
  481. for (i = 0; i < len; i++)
  482. *b->cur_dec++ = get_bits(gb, bits);
  483. } else {
  484. for (i = 0; i < len; i++)
  485. *b->cur_dec++ = get_bits(gb, bits) - mask;
  486. }
  487. } else {
  488. int16_t *dst = (int16_t*)b->cur_dec;
  489. if (!issigned) {
  490. for (i = 0; i < len; i++)
  491. *dst++ = get_bits(gb, bits);
  492. } else {
  493. for (i = 0; i < len; i++)
  494. *dst++ = get_bits(gb, bits) - mask;
  495. }
  496. b->cur_dec = (uint8_t*)dst;
  497. }
  498. return 0;
  499. }
  500. static inline int binkb_get_value(BinkContext *c, int bundle_num)
  501. {
  502. int16_t ret;
  503. const int bits = binkb_bundle_sizes[bundle_num];
  504. if (bits <= 8) {
  505. int val = *c->bundle[bundle_num].cur_ptr++;
  506. return binkb_bundle_signed[bundle_num] ? (int8_t)val : val;
  507. }
  508. ret = *(int16_t*)c->bundle[bundle_num].cur_ptr;
  509. c->bundle[bundle_num].cur_ptr += 2;
  510. return ret;
  511. }
  512. /**
  513. * Read 8x8 block of DCT coefficients.
  514. *
  515. * @param gb context for reading bits
  516. * @param block place for storing coefficients
  517. * @param scan scan order table
  518. * @param quant_matrices quantization matrices
  519. * @return 0 for success, negative value in other cases
  520. */
  521. static int read_dct_coeffs(GetBitContext *gb, DCTELEM block[64], const uint8_t *scan,
  522. const uint32_t quant_matrices[16][64], int q)
  523. {
  524. int coef_list[128];
  525. int mode_list[128];
  526. int i, t, mask, bits, ccoef, mode, sign;
  527. int list_start = 64, list_end = 64, list_pos;
  528. int coef_count = 0;
  529. int coef_idx[64];
  530. int quant_idx;
  531. const uint32_t *quant;
  532. coef_list[list_end] = 4; mode_list[list_end++] = 0;
  533. coef_list[list_end] = 24; mode_list[list_end++] = 0;
  534. coef_list[list_end] = 44; mode_list[list_end++] = 0;
  535. coef_list[list_end] = 1; mode_list[list_end++] = 3;
  536. coef_list[list_end] = 2; mode_list[list_end++] = 3;
  537. coef_list[list_end] = 3; mode_list[list_end++] = 3;
  538. bits = get_bits(gb, 4) - 1;
  539. for (mask = 1 << bits; bits >= 0; mask >>= 1, bits--) {
  540. list_pos = list_start;
  541. while (list_pos < list_end) {
  542. if (!(mode_list[list_pos] | coef_list[list_pos]) || !get_bits1(gb)) {
  543. list_pos++;
  544. continue;
  545. }
  546. ccoef = coef_list[list_pos];
  547. mode = mode_list[list_pos];
  548. switch (mode) {
  549. case 0:
  550. coef_list[list_pos] = ccoef + 4;
  551. mode_list[list_pos] = 1;
  552. case 2:
  553. if (mode == 2) {
  554. coef_list[list_pos] = 0;
  555. mode_list[list_pos++] = 0;
  556. }
  557. for (i = 0; i < 4; i++, ccoef++) {
  558. if (get_bits1(gb)) {
  559. coef_list[--list_start] = ccoef;
  560. mode_list[ list_start] = 3;
  561. } else {
  562. int t;
  563. if (!bits) {
  564. t = 1 - (get_bits1(gb) << 1);
  565. } else {
  566. t = get_bits(gb, bits) | mask;
  567. sign = -get_bits1(gb);
  568. t = (t ^ sign) - sign;
  569. }
  570. block[scan[ccoef]] = t;
  571. coef_idx[coef_count++] = ccoef;
  572. }
  573. }
  574. break;
  575. case 1:
  576. mode_list[list_pos] = 2;
  577. for (i = 0; i < 3; i++) {
  578. ccoef += 4;
  579. coef_list[list_end] = ccoef;
  580. mode_list[list_end++] = 2;
  581. }
  582. break;
  583. case 3:
  584. if (!bits) {
  585. t = 1 - (get_bits1(gb) << 1);
  586. } else {
  587. t = get_bits(gb, bits) | mask;
  588. sign = -get_bits1(gb);
  589. t = (t ^ sign) - sign;
  590. }
  591. block[scan[ccoef]] = t;
  592. coef_idx[coef_count++] = ccoef;
  593. coef_list[list_pos] = 0;
  594. mode_list[list_pos++] = 0;
  595. break;
  596. }
  597. }
  598. }
  599. if (q == -1) {
  600. quant_idx = get_bits(gb, 4);
  601. } else {
  602. quant_idx = q;
  603. }
  604. quant = quant_matrices[quant_idx];
  605. block[0] = (block[0] * quant[0]) >> 11;
  606. for (i = 0; i < coef_count; i++) {
  607. int idx = coef_idx[i];
  608. block[scan[idx]] = (block[scan[idx]] * quant[idx]) >> 11;
  609. }
  610. return 0;
  611. }
  612. /**
  613. * Read 8x8 block with residue after motion compensation.
  614. *
  615. * @param gb context for reading bits
  616. * @param block place to store read data
  617. * @param masks_count number of masks to decode
  618. * @return 0 on success, negative value in other cases
  619. */
  620. static int read_residue(GetBitContext *gb, DCTELEM block[64], int masks_count)
  621. {
  622. int coef_list[128];
  623. int mode_list[128];
  624. int i, sign, mask, ccoef, mode;
  625. int list_start = 64, list_end = 64, list_pos;
  626. int nz_coeff[64];
  627. int nz_coeff_count = 0;
  628. coef_list[list_end] = 4; mode_list[list_end++] = 0;
  629. coef_list[list_end] = 24; mode_list[list_end++] = 0;
  630. coef_list[list_end] = 44; mode_list[list_end++] = 0;
  631. coef_list[list_end] = 0; mode_list[list_end++] = 2;
  632. for (mask = 1 << get_bits(gb, 3); mask; mask >>= 1) {
  633. for (i = 0; i < nz_coeff_count; i++) {
  634. if (!get_bits1(gb))
  635. continue;
  636. if (block[nz_coeff[i]] < 0)
  637. block[nz_coeff[i]] -= mask;
  638. else
  639. block[nz_coeff[i]] += mask;
  640. masks_count--;
  641. if (masks_count < 0)
  642. return 0;
  643. }
  644. list_pos = list_start;
  645. while (list_pos < list_end) {
  646. if (!(coef_list[list_pos] | mode_list[list_pos]) || !get_bits1(gb)) {
  647. list_pos++;
  648. continue;
  649. }
  650. ccoef = coef_list[list_pos];
  651. mode = mode_list[list_pos];
  652. switch (mode) {
  653. case 0:
  654. coef_list[list_pos] = ccoef + 4;
  655. mode_list[list_pos] = 1;
  656. case 2:
  657. if (mode == 2) {
  658. coef_list[list_pos] = 0;
  659. mode_list[list_pos++] = 0;
  660. }
  661. for (i = 0; i < 4; i++, ccoef++) {
  662. if (get_bits1(gb)) {
  663. coef_list[--list_start] = ccoef;
  664. mode_list[ list_start] = 3;
  665. } else {
  666. nz_coeff[nz_coeff_count++] = bink_scan[ccoef];
  667. sign = -get_bits1(gb);
  668. block[bink_scan[ccoef]] = (mask ^ sign) - sign;
  669. masks_count--;
  670. if (masks_count < 0)
  671. return 0;
  672. }
  673. }
  674. break;
  675. case 1:
  676. mode_list[list_pos] = 2;
  677. for (i = 0; i < 3; i++) {
  678. ccoef += 4;
  679. coef_list[list_end] = ccoef;
  680. mode_list[list_end++] = 2;
  681. }
  682. break;
  683. case 3:
  684. nz_coeff[nz_coeff_count++] = bink_scan[ccoef];
  685. sign = -get_bits1(gb);
  686. block[bink_scan[ccoef]] = (mask ^ sign) - sign;
  687. coef_list[list_pos] = 0;
  688. mode_list[list_pos++] = 0;
  689. masks_count--;
  690. if (masks_count < 0)
  691. return 0;
  692. break;
  693. }
  694. }
  695. }
  696. return 0;
  697. }
  698. /**
  699. * Copy 8x8 block from source to destination, where src and dst may be overlapped
  700. */
  701. static inline void put_pixels8x8_overlapped(uint8_t *dst, uint8_t *src, int stride)
  702. {
  703. uint8_t tmp[64];
  704. int i;
  705. for (i = 0; i < 8; i++)
  706. memcpy(tmp + i*8, src + i*stride, 8);
  707. for (i = 0; i < 8; i++)
  708. memcpy(dst + i*stride, tmp + i*8, 8);
  709. }
  710. static int binkb_decode_plane(BinkContext *c, GetBitContext *gb, int plane_idx,
  711. int is_key, int is_chroma)
  712. {
  713. int blk;
  714. int i, j, bx, by;
  715. uint8_t *dst, *ref, *ref_start, *ref_end;
  716. int v, col[2];
  717. const uint8_t *scan;
  718. int xoff, yoff;
  719. LOCAL_ALIGNED_16(DCTELEM, block, [64]);
  720. int coordmap[64];
  721. int ybias = is_key ? -15 : 0;
  722. int qp;
  723. const int stride = c->pic.linesize[plane_idx];
  724. int bw = is_chroma ? (c->avctx->width + 15) >> 4 : (c->avctx->width + 7) >> 3;
  725. int bh = is_chroma ? (c->avctx->height + 15) >> 4 : (c->avctx->height + 7) >> 3;
  726. binkb_init_bundles(c);
  727. ref_start = c->pic.data[plane_idx];
  728. ref_end = c->pic.data[plane_idx] + (bh * c->pic.linesize[plane_idx] + bw) * 8;
  729. for (i = 0; i < 64; i++)
  730. coordmap[i] = (i & 7) + (i >> 3) * stride;
  731. for (by = 0; by < bh; by++) {
  732. for (i = 0; i < BINKB_NB_SRC; i++) {
  733. if (binkb_read_bundle(c, gb, i) < 0)
  734. return -1;
  735. }
  736. dst = c->pic.data[plane_idx] + 8*by*stride;
  737. for (bx = 0; bx < bw; bx++, dst += 8) {
  738. blk = binkb_get_value(c, BINKB_SRC_BLOCK_TYPES);
  739. switch (blk) {
  740. case 0:
  741. break;
  742. case 1:
  743. scan = bink_patterns[get_bits(gb, 4)];
  744. i = 0;
  745. do {
  746. int mode, run;
  747. mode = get_bits1(gb);
  748. run = get_bits(gb, binkb_runbits[i]) + 1;
  749. i += run;
  750. if (i > 64) {
  751. av_log(c->avctx, AV_LOG_ERROR, "Run went out of bounds\n");
  752. return -1;
  753. }
  754. if (mode) {
  755. v = binkb_get_value(c, BINKB_SRC_COLORS);
  756. for (j = 0; j < run; j++)
  757. dst[coordmap[*scan++]] = v;
  758. } else {
  759. for (j = 0; j < run; j++)
  760. dst[coordmap[*scan++]] = binkb_get_value(c, BINKB_SRC_COLORS);
  761. }
  762. } while (i < 63);
  763. if (i == 63)
  764. dst[coordmap[*scan++]] = binkb_get_value(c, BINKB_SRC_COLORS);
  765. break;
  766. case 2:
  767. c->dsp.clear_block(block);
  768. block[0] = binkb_get_value(c, BINKB_SRC_INTRA_DC);
  769. qp = binkb_get_value(c, BINKB_SRC_INTRA_Q);
  770. read_dct_coeffs(gb, block, c->scantable.permutated, binkb_intra_quant, qp);
  771. c->dsp.idct_put(dst, stride, block);
  772. break;
  773. case 3:
  774. xoff = binkb_get_value(c, BINKB_SRC_X_OFF);
  775. yoff = binkb_get_value(c, BINKB_SRC_Y_OFF) + ybias;
  776. ref = dst + xoff + yoff * stride;
  777. if (ref < ref_start || ref + 8*stride > ref_end) {
  778. av_log(c->avctx, AV_LOG_WARNING, "Reference block is out of bounds\n");
  779. } else if (ref + 8*stride < dst || ref >= dst + 8*stride) {
  780. c->dsp.put_pixels_tab[1][0](dst, ref, stride, 8);
  781. } else {
  782. put_pixels8x8_overlapped(dst, ref, stride);
  783. }
  784. c->dsp.clear_block(block);
  785. v = binkb_get_value(c, BINKB_SRC_INTER_COEFS);
  786. read_residue(gb, block, v);
  787. c->dsp.add_pixels8(dst, block, stride);
  788. break;
  789. case 4:
  790. xoff = binkb_get_value(c, BINKB_SRC_X_OFF);
  791. yoff = binkb_get_value(c, BINKB_SRC_Y_OFF) + ybias;
  792. ref = dst + xoff + yoff * stride;
  793. if (ref < ref_start || ref + 8 * stride > ref_end) {
  794. av_log(c->avctx, AV_LOG_WARNING, "Reference block is out of bounds\n");
  795. } else if (ref + 8*stride < dst || ref >= dst + 8*stride) {
  796. c->dsp.put_pixels_tab[1][0](dst, ref, stride, 8);
  797. } else {
  798. put_pixels8x8_overlapped(dst, ref, stride);
  799. }
  800. c->dsp.clear_block(block);
  801. block[0] = binkb_get_value(c, BINKB_SRC_INTER_DC);
  802. qp = binkb_get_value(c, BINKB_SRC_INTER_Q);
  803. read_dct_coeffs(gb, block, c->scantable.permutated, binkb_inter_quant, qp);
  804. c->dsp.idct_add(dst, stride, block);
  805. break;
  806. case 5:
  807. v = binkb_get_value(c, BINKB_SRC_COLORS);
  808. c->dsp.fill_block_tab[1](dst, v, stride, 8);
  809. break;
  810. case 6:
  811. for (i = 0; i < 2; i++)
  812. col[i] = binkb_get_value(c, BINKB_SRC_COLORS);
  813. for (i = 0; i < 8; i++) {
  814. v = binkb_get_value(c, BINKB_SRC_PATTERN);
  815. for (j = 0; j < 8; j++, v >>= 1)
  816. dst[i*stride + j] = col[v & 1];
  817. }
  818. break;
  819. case 7:
  820. xoff = binkb_get_value(c, BINKB_SRC_X_OFF);
  821. yoff = binkb_get_value(c, BINKB_SRC_Y_OFF) + ybias;
  822. ref = dst + xoff + yoff * stride;
  823. if (ref < ref_start || ref + 8 * stride > ref_end) {
  824. av_log(c->avctx, AV_LOG_WARNING, "Reference block is out of bounds\n");
  825. } else if (ref + 8*stride < dst || ref >= dst + 8*stride) {
  826. c->dsp.put_pixels_tab[1][0](dst, ref, stride, 8);
  827. } else {
  828. put_pixels8x8_overlapped(dst, ref, stride);
  829. }
  830. break;
  831. case 8:
  832. for (i = 0; i < 8; i++)
  833. memcpy(dst + i*stride, c->bundle[BINKB_SRC_COLORS].cur_ptr + i*8, 8);
  834. c->bundle[BINKB_SRC_COLORS].cur_ptr += 64;
  835. break;
  836. default:
  837. av_log(c->avctx, AV_LOG_ERROR, "Unknown block type %d\n", blk);
  838. return -1;
  839. }
  840. }
  841. }
  842. if (get_bits_count(gb) & 0x1F) //next plane data starts at 32-bit boundary
  843. skip_bits_long(gb, 32 - (get_bits_count(gb) & 0x1F));
  844. return 0;
  845. }
  846. static int bink_decode_plane(BinkContext *c, GetBitContext *gb, int plane_idx,
  847. int is_chroma)
  848. {
  849. int blk;
  850. int i, j, bx, by;
  851. uint8_t *dst, *prev, *ref, *ref_start, *ref_end;
  852. int v, col[2];
  853. const uint8_t *scan;
  854. int xoff, yoff;
  855. LOCAL_ALIGNED_16(DCTELEM, block, [64]);
  856. LOCAL_ALIGNED_16(uint8_t, ublock, [64]);
  857. int coordmap[64];
  858. const int stride = c->pic.linesize[plane_idx];
  859. int bw = is_chroma ? (c->avctx->width + 15) >> 4 : (c->avctx->width + 7) >> 3;
  860. int bh = is_chroma ? (c->avctx->height + 15) >> 4 : (c->avctx->height + 7) >> 3;
  861. int width = c->avctx->width >> is_chroma;
  862. init_lengths(c, FFMAX(width, 8), bw);
  863. for (i = 0; i < BINK_NB_SRC; i++)
  864. read_bundle(gb, c, i);
  865. ref_start = c->last.data[plane_idx];
  866. ref_end = c->last.data[plane_idx]
  867. + (bw - 1 + c->last.linesize[plane_idx] * (bh - 1)) * 8;
  868. for (i = 0; i < 64; i++)
  869. coordmap[i] = (i & 7) + (i >> 3) * stride;
  870. for (by = 0; by < bh; by++) {
  871. if (read_block_types(c->avctx, gb, &c->bundle[BINK_SRC_BLOCK_TYPES]) < 0)
  872. return -1;
  873. if (read_block_types(c->avctx, gb, &c->bundle[BINK_SRC_SUB_BLOCK_TYPES]) < 0)
  874. return -1;
  875. if (read_colors(gb, &c->bundle[BINK_SRC_COLORS], c) < 0)
  876. return -1;
  877. if (read_patterns(c->avctx, gb, &c->bundle[BINK_SRC_PATTERN]) < 0)
  878. return -1;
  879. if (read_motion_values(c->avctx, gb, &c->bundle[BINK_SRC_X_OFF]) < 0)
  880. return -1;
  881. if (read_motion_values(c->avctx, gb, &c->bundle[BINK_SRC_Y_OFF]) < 0)
  882. return -1;
  883. if (read_dcs(c->avctx, gb, &c->bundle[BINK_SRC_INTRA_DC], DC_START_BITS, 0) < 0)
  884. return -1;
  885. if (read_dcs(c->avctx, gb, &c->bundle[BINK_SRC_INTER_DC], DC_START_BITS, 1) < 0)
  886. return -1;
  887. if (read_runs(c->avctx, gb, &c->bundle[BINK_SRC_RUN]) < 0)
  888. return -1;
  889. if (by == bh)
  890. break;
  891. dst = c->pic.data[plane_idx] + 8*by*stride;
  892. prev = c->last.data[plane_idx] + 8*by*stride;
  893. for (bx = 0; bx < bw; bx++, dst += 8, prev += 8) {
  894. blk = get_value(c, BINK_SRC_BLOCK_TYPES);
  895. // 16x16 block type on odd line means part of the already decoded block, so skip it
  896. if ((by & 1) && blk == SCALED_BLOCK) {
  897. bx++;
  898. dst += 8;
  899. prev += 8;
  900. continue;
  901. }
  902. switch (blk) {
  903. case SKIP_BLOCK:
  904. c->dsp.put_pixels_tab[1][0](dst, prev, stride, 8);
  905. break;
  906. case SCALED_BLOCK:
  907. blk = get_value(c, BINK_SRC_SUB_BLOCK_TYPES);
  908. switch (blk) {
  909. case RUN_BLOCK:
  910. scan = bink_patterns[get_bits(gb, 4)];
  911. i = 0;
  912. do {
  913. int run = get_value(c, BINK_SRC_RUN) + 1;
  914. i += run;
  915. if (i > 64) {
  916. av_log(c->avctx, AV_LOG_ERROR, "Run went out of bounds\n");
  917. return -1;
  918. }
  919. if (get_bits1(gb)) {
  920. v = get_value(c, BINK_SRC_COLORS);
  921. for (j = 0; j < run; j++)
  922. ublock[*scan++] = v;
  923. } else {
  924. for (j = 0; j < run; j++)
  925. ublock[*scan++] = get_value(c, BINK_SRC_COLORS);
  926. }
  927. } while (i < 63);
  928. if (i == 63)
  929. ublock[*scan++] = get_value(c, BINK_SRC_COLORS);
  930. break;
  931. case INTRA_BLOCK:
  932. c->dsp.clear_block(block);
  933. block[0] = get_value(c, BINK_SRC_INTRA_DC);
  934. read_dct_coeffs(gb, block, c->scantable.permutated, bink_intra_quant, -1);
  935. c->dsp.idct(block);
  936. c->dsp.put_pixels_nonclamped(block, ublock, 8);
  937. break;
  938. case FILL_BLOCK:
  939. v = get_value(c, BINK_SRC_COLORS);
  940. c->dsp.fill_block_tab[0](dst, v, stride, 16);
  941. break;
  942. case PATTERN_BLOCK:
  943. for (i = 0; i < 2; i++)
  944. col[i] = get_value(c, BINK_SRC_COLORS);
  945. for (j = 0; j < 8; j++) {
  946. v = get_value(c, BINK_SRC_PATTERN);
  947. for (i = 0; i < 8; i++, v >>= 1)
  948. ublock[i + j*8] = col[v & 1];
  949. }
  950. break;
  951. case RAW_BLOCK:
  952. for (j = 0; j < 8; j++)
  953. for (i = 0; i < 8; i++)
  954. ublock[i + j*8] = get_value(c, BINK_SRC_COLORS);
  955. break;
  956. default:
  957. av_log(c->avctx, AV_LOG_ERROR, "Incorrect 16x16 block type %d\n", blk);
  958. return -1;
  959. }
  960. if (blk != FILL_BLOCK)
  961. c->dsp.scale_block(ublock, dst, stride);
  962. bx++;
  963. dst += 8;
  964. prev += 8;
  965. break;
  966. case MOTION_BLOCK:
  967. xoff = get_value(c, BINK_SRC_X_OFF);
  968. yoff = get_value(c, BINK_SRC_Y_OFF);
  969. ref = prev + xoff + yoff * stride;
  970. if (ref < ref_start || ref > ref_end) {
  971. av_log(c->avctx, AV_LOG_ERROR, "Copy out of bounds @%d, %d\n",
  972. bx*8 + xoff, by*8 + yoff);
  973. return -1;
  974. }
  975. c->dsp.put_pixels_tab[1][0](dst, ref, stride, 8);
  976. break;
  977. case RUN_BLOCK:
  978. scan = bink_patterns[get_bits(gb, 4)];
  979. i = 0;
  980. do {
  981. int run = get_value(c, BINK_SRC_RUN) + 1;
  982. i += run;
  983. if (i > 64) {
  984. av_log(c->avctx, AV_LOG_ERROR, "Run went out of bounds\n");
  985. return -1;
  986. }
  987. if (get_bits1(gb)) {
  988. v = get_value(c, BINK_SRC_COLORS);
  989. for (j = 0; j < run; j++)
  990. dst[coordmap[*scan++]] = v;
  991. } else {
  992. for (j = 0; j < run; j++)
  993. dst[coordmap[*scan++]] = get_value(c, BINK_SRC_COLORS);
  994. }
  995. } while (i < 63);
  996. if (i == 63)
  997. dst[coordmap[*scan++]] = get_value(c, BINK_SRC_COLORS);
  998. break;
  999. case RESIDUE_BLOCK:
  1000. xoff = get_value(c, BINK_SRC_X_OFF);
  1001. yoff = get_value(c, BINK_SRC_Y_OFF);
  1002. ref = prev + xoff + yoff * stride;
  1003. if (ref < ref_start || ref > ref_end) {
  1004. av_log(c->avctx, AV_LOG_ERROR, "Copy out of bounds @%d, %d\n",
  1005. bx*8 + xoff, by*8 + yoff);
  1006. return -1;
  1007. }
  1008. c->dsp.put_pixels_tab[1][0](dst, ref, stride, 8);
  1009. c->dsp.clear_block(block);
  1010. v = get_bits(gb, 7);
  1011. read_residue(gb, block, v);
  1012. c->dsp.add_pixels8(dst, block, stride);
  1013. break;
  1014. case INTRA_BLOCK:
  1015. c->dsp.clear_block(block);
  1016. block[0] = get_value(c, BINK_SRC_INTRA_DC);
  1017. read_dct_coeffs(gb, block, c->scantable.permutated, bink_intra_quant, -1);
  1018. c->dsp.idct_put(dst, stride, block);
  1019. break;
  1020. case FILL_BLOCK:
  1021. v = get_value(c, BINK_SRC_COLORS);
  1022. c->dsp.fill_block_tab[1](dst, v, stride, 8);
  1023. break;
  1024. case INTER_BLOCK:
  1025. xoff = get_value(c, BINK_SRC_X_OFF);
  1026. yoff = get_value(c, BINK_SRC_Y_OFF);
  1027. ref = prev + xoff + yoff * stride;
  1028. c->dsp.put_pixels_tab[1][0](dst, ref, stride, 8);
  1029. c->dsp.clear_block(block);
  1030. block[0] = get_value(c, BINK_SRC_INTER_DC);
  1031. read_dct_coeffs(gb, block, c->scantable.permutated, bink_inter_quant, -1);
  1032. c->dsp.idct_add(dst, stride, block);
  1033. break;
  1034. case PATTERN_BLOCK:
  1035. for (i = 0; i < 2; i++)
  1036. col[i] = get_value(c, BINK_SRC_COLORS);
  1037. for (i = 0; i < 8; i++) {
  1038. v = get_value(c, BINK_SRC_PATTERN);
  1039. for (j = 0; j < 8; j++, v >>= 1)
  1040. dst[i*stride + j] = col[v & 1];
  1041. }
  1042. break;
  1043. case RAW_BLOCK:
  1044. for (i = 0; i < 8; i++)
  1045. memcpy(dst + i*stride, c->bundle[BINK_SRC_COLORS].cur_ptr + i*8, 8);
  1046. c->bundle[BINK_SRC_COLORS].cur_ptr += 64;
  1047. break;
  1048. default:
  1049. av_log(c->avctx, AV_LOG_ERROR, "Unknown block type %d\n", blk);
  1050. return -1;
  1051. }
  1052. }
  1053. }
  1054. if (get_bits_count(gb) & 0x1F) //next plane data starts at 32-bit boundary
  1055. skip_bits_long(gb, 32 - (get_bits_count(gb) & 0x1F));
  1056. return 0;
  1057. }
  1058. static int decode_frame(AVCodecContext *avctx, void *data, int *data_size, AVPacket *pkt)
  1059. {
  1060. BinkContext * const c = avctx->priv_data;
  1061. GetBitContext gb;
  1062. int plane, plane_idx;
  1063. int bits_count = pkt->size << 3;
  1064. if (c->version > 'b') {
  1065. if(c->pic.data[0])
  1066. avctx->release_buffer(avctx, &c->pic);
  1067. if(avctx->get_buffer(avctx, &c->pic) < 0){
  1068. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  1069. return -1;
  1070. }
  1071. } else {
  1072. if(avctx->reget_buffer(avctx, &c->pic) < 0){
  1073. av_log(avctx, AV_LOG_ERROR, "reget_buffer() failed\n");
  1074. return -1;
  1075. }
  1076. }
  1077. init_get_bits(&gb, pkt->data, bits_count);
  1078. if (c->has_alpha) {
  1079. if (c->version >= 'i')
  1080. skip_bits_long(&gb, 32);
  1081. if (bink_decode_plane(c, &gb, 3, 0) < 0)
  1082. return -1;
  1083. }
  1084. if (c->version >= 'i')
  1085. skip_bits_long(&gb, 32);
  1086. for (plane = 0; plane < 3; plane++) {
  1087. plane_idx = (!plane || !c->swap_planes) ? plane : (plane ^ 3);
  1088. if (c->version > 'b') {
  1089. if (bink_decode_plane(c, &gb, plane_idx, !!plane) < 0)
  1090. return -1;
  1091. } else {
  1092. if (binkb_decode_plane(c, &gb, plane_idx, !pkt->pts, !!plane) < 0)
  1093. return -1;
  1094. }
  1095. if (get_bits_count(&gb) >= bits_count)
  1096. break;
  1097. }
  1098. emms_c();
  1099. *data_size = sizeof(AVFrame);
  1100. *(AVFrame*)data = c->pic;
  1101. if (c->version > 'b')
  1102. FFSWAP(AVFrame, c->pic, c->last);
  1103. /* always report that the buffer was completely consumed */
  1104. return pkt->size;
  1105. }
  1106. /**
  1107. * Caclulate quantization tables for version b
  1108. */
  1109. static av_cold void binkb_calc_quant()
  1110. {
  1111. uint8_t inv_bink_scan[64];
  1112. double s[64];
  1113. int i, j;
  1114. for (j = 0; j < 8; j++) {
  1115. for (i = 0; i < 8; i++) {
  1116. if (j && j != 4)
  1117. if (i && i != 4)
  1118. s[j*8 + i] = cos(j * M_PI/16.0) * cos(i * M_PI/16.0) * 2.0;
  1119. else
  1120. s[j*8 + i] = cos(j * M_PI/16.0) * sqrt(2.0);
  1121. else
  1122. if (i && i != 4)
  1123. s[j*8 + i] = cos(i * M_PI/16.0) * sqrt(2.0);
  1124. else
  1125. s[j*8 + i] = 1.0;
  1126. }
  1127. }
  1128. for (i = 0; i < 64; i++)
  1129. inv_bink_scan[bink_scan[i]] = i;
  1130. for (j = 0; j < 16; j++) {
  1131. for (i = 0; i < 64; i++) {
  1132. int k = inv_bink_scan[i];
  1133. if (s[i] == 1.0) {
  1134. binkb_intra_quant[j][k] = (1L << 12) * binkb_intra_seed[i] *
  1135. binkb_num[j]/binkb_den[j];
  1136. binkb_inter_quant[j][k] = (1L << 12) * binkb_inter_seed[i] *
  1137. binkb_num[j]/binkb_den[j];
  1138. } else {
  1139. binkb_intra_quant[j][k] = (1L << 12) * binkb_intra_seed[i] * s[i] *
  1140. binkb_num[j]/(double)binkb_den[j];
  1141. binkb_inter_quant[j][k] = (1L << 12) * binkb_inter_seed[i] * s[i] *
  1142. binkb_num[j]/(double)binkb_den[j];
  1143. }
  1144. }
  1145. }
  1146. }
  1147. static av_cold int decode_init(AVCodecContext *avctx)
  1148. {
  1149. BinkContext * const c = avctx->priv_data;
  1150. static VLC_TYPE table[16 * 128][2];
  1151. static int binkb_initialised = 0;
  1152. int i;
  1153. int flags;
  1154. c->version = avctx->codec_tag >> 24;
  1155. if (avctx->extradata_size < 4) {
  1156. av_log(avctx, AV_LOG_ERROR, "Extradata missing or too short\n");
  1157. return -1;
  1158. }
  1159. flags = AV_RL32(avctx->extradata);
  1160. c->has_alpha = flags & BINK_FLAG_ALPHA;
  1161. c->swap_planes = c->version >= 'h';
  1162. if (!bink_trees[15].table) {
  1163. for (i = 0; i < 16; i++) {
  1164. const int maxbits = bink_tree_lens[i][15];
  1165. bink_trees[i].table = table + i*128;
  1166. bink_trees[i].table_allocated = 1 << maxbits;
  1167. init_vlc(&bink_trees[i], maxbits, 16,
  1168. bink_tree_lens[i], 1, 1,
  1169. bink_tree_bits[i], 1, 1, INIT_VLC_USE_NEW_STATIC | INIT_VLC_LE);
  1170. }
  1171. }
  1172. c->avctx = avctx;
  1173. c->pic.data[0] = NULL;
  1174. if (av_image_check_size(avctx->width, avctx->height, 0, avctx) < 0) {
  1175. return 1;
  1176. }
  1177. avctx->pix_fmt = c->has_alpha ? PIX_FMT_YUVA420P : PIX_FMT_YUV420P;
  1178. avctx->idct_algo = FF_IDCT_BINK;
  1179. dsputil_init(&c->dsp, avctx);
  1180. ff_init_scantable(c->dsp.idct_permutation, &c->scantable, bink_scan);
  1181. init_bundles(c);
  1182. if (c->version == 'b') {
  1183. if (!binkb_initialised) {
  1184. binkb_calc_quant();
  1185. binkb_initialised = 1;
  1186. }
  1187. }
  1188. return 0;
  1189. }
  1190. static av_cold int decode_end(AVCodecContext *avctx)
  1191. {
  1192. BinkContext * const c = avctx->priv_data;
  1193. if (c->pic.data[0])
  1194. avctx->release_buffer(avctx, &c->pic);
  1195. if (c->last.data[0])
  1196. avctx->release_buffer(avctx, &c->last);
  1197. free_bundles(c);
  1198. return 0;
  1199. }
  1200. AVCodec ff_bink_decoder = {
  1201. "binkvideo",
  1202. AVMEDIA_TYPE_VIDEO,
  1203. CODEC_ID_BINKVIDEO,
  1204. sizeof(BinkContext),
  1205. decode_init,
  1206. NULL,
  1207. decode_end,
  1208. decode_frame,
  1209. .long_name = NULL_IF_CONFIG_SMALL("Bink video"),
  1210. };