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.

1350 lines
45KB

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