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.

1681 lines
58KB

  1. /**
  2. * VP8 compatible video decoder
  3. *
  4. * Copyright (C) 2010 David Conrad
  5. * Copyright (C) 2010 Ronald S. Bultje
  6. * Copyright (C) 2010 Jason Garrett-Glaser
  7. *
  8. * This file is part of FFmpeg.
  9. *
  10. * FFmpeg is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU Lesser General Public
  12. * License as published by the Free Software Foundation; either
  13. * version 2.1 of the License, or (at your option) any later version.
  14. *
  15. * FFmpeg is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  18. * Lesser General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU Lesser General Public
  21. * License along with FFmpeg; if not, write to the Free Software
  22. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  23. */
  24. #include "avcodec.h"
  25. #include "vp56.h"
  26. #include "vp8data.h"
  27. #include "vp8dsp.h"
  28. #include "h264pred.h"
  29. #include "rectangle.h"
  30. typedef struct {
  31. uint8_t filter_level;
  32. uint8_t inner_limit;
  33. uint8_t inner_filter;
  34. } VP8FilterStrength;
  35. typedef struct {
  36. uint8_t skip;
  37. // todo: make it possible to check for at least (i4x4 or split_mv)
  38. // in one op. are others needed?
  39. uint8_t mode;
  40. uint8_t ref_frame;
  41. uint8_t partitioning;
  42. VP56mv mv;
  43. VP56mv bmv[16];
  44. } VP8Macroblock;
  45. typedef struct {
  46. AVCodecContext *avctx;
  47. DSPContext dsp;
  48. VP8DSPContext vp8dsp;
  49. H264PredContext hpc;
  50. vp8_mc_func put_pixels_tab[3][3][3];
  51. AVFrame frames[4];
  52. AVFrame *framep[4];
  53. uint8_t *edge_emu_buffer;
  54. VP56RangeCoder c; ///< header context, includes mb modes and motion vectors
  55. int profile;
  56. int mb_width; /* number of horizontal MB */
  57. int mb_height; /* number of vertical MB */
  58. int linesize;
  59. int uvlinesize;
  60. int keyframe;
  61. int invisible;
  62. int update_last; ///< update VP56_FRAME_PREVIOUS with the current one
  63. int update_golden; ///< VP56_FRAME_NONE if not updated, or which frame to copy if so
  64. int update_altref;
  65. int deblock_filter;
  66. /**
  67. * If this flag is not set, all the probability updates
  68. * are discarded after this frame is decoded.
  69. */
  70. int update_probabilities;
  71. /**
  72. * All coefficients are contained in separate arith coding contexts.
  73. * There can be 1, 2, 4, or 8 of these after the header context.
  74. */
  75. int num_coeff_partitions;
  76. VP56RangeCoder coeff_partition[8];
  77. VP8Macroblock *macroblocks;
  78. VP8Macroblock *macroblocks_base;
  79. VP8FilterStrength *filter_strength;
  80. int mb_stride;
  81. uint8_t *intra4x4_pred_mode_top;
  82. uint8_t intra4x4_pred_mode_left[4];
  83. uint8_t *segmentation_map;
  84. int b4_stride;
  85. /**
  86. * Cache of the top row needed for intra prediction
  87. * 16 for luma, 8 for each chroma plane
  88. */
  89. uint8_t (*top_border)[16+8+8];
  90. /**
  91. * For coeff decode, we need to know whether the above block had non-zero
  92. * coefficients. This means for each macroblock, we need data for 4 luma
  93. * blocks, 2 u blocks, 2 v blocks, and the luma dc block, for a total of 9
  94. * per macroblock. We keep the last row in top_nnz.
  95. */
  96. uint8_t (*top_nnz)[9];
  97. DECLARE_ALIGNED(8, uint8_t, left_nnz)[9];
  98. /**
  99. * This is the index plus one of the last non-zero coeff
  100. * for each of the blocks in the current macroblock.
  101. * So, 0 -> no coeffs
  102. * 1 -> dc-only (special transform)
  103. * 2+-> full transform
  104. */
  105. DECLARE_ALIGNED(16, uint8_t, non_zero_count_cache)[6][4];
  106. DECLARE_ALIGNED(16, DCTELEM, block)[6][4][16];
  107. DECLARE_ALIGNED(16, DCTELEM, block_dc)[16];
  108. uint8_t intra4x4_pred_mode_mb[16];
  109. int chroma_pred_mode; ///< 8x8c pred mode of the current macroblock
  110. int segment; ///< segment of the current macroblock
  111. int mbskip_enabled;
  112. int sign_bias[4]; ///< one state [0, 1] per ref frame type
  113. int ref_count[3];
  114. /**
  115. * Base parameters for segmentation, i.e. per-macroblock parameters.
  116. * These must be kept unchanged even if segmentation is not used for
  117. * a frame, since the values persist between interframes.
  118. */
  119. struct {
  120. int enabled;
  121. int absolute_vals;
  122. int update_map;
  123. int8_t base_quant[4];
  124. int8_t filter_level[4]; ///< base loop filter level
  125. } segmentation;
  126. /**
  127. * Macroblocks can have one of 4 different quants in a frame when
  128. * segmentation is enabled.
  129. * If segmentation is disabled, only the first segment's values are used.
  130. */
  131. struct {
  132. // [0] - DC qmul [1] - AC qmul
  133. int16_t luma_qmul[2];
  134. int16_t luma_dc_qmul[2]; ///< luma dc-only block quant
  135. int16_t chroma_qmul[2];
  136. } qmat[4];
  137. struct {
  138. int simple;
  139. int level;
  140. int sharpness;
  141. } filter;
  142. struct {
  143. int enabled; ///< whether each mb can have a different strength based on mode/ref
  144. /**
  145. * filter strength adjustment for the following macroblock modes:
  146. * [0] - i4x4
  147. * [1] - zero mv
  148. * [2] - inter modes except for zero or split mv
  149. * [3] - split mv
  150. * i16x16 modes never have any adjustment
  151. */
  152. int8_t mode[4];
  153. /**
  154. * filter strength adjustment for macroblocks that reference:
  155. * [0] - intra / VP56_FRAME_CURRENT
  156. * [1] - VP56_FRAME_PREVIOUS
  157. * [2] - VP56_FRAME_GOLDEN
  158. * [3] - altref / VP56_FRAME_GOLDEN2
  159. */
  160. int8_t ref[4];
  161. } lf_delta;
  162. /**
  163. * These are all of the updatable probabilities for binary decisions.
  164. * They are only implictly reset on keyframes, making it quite likely
  165. * for an interframe to desync if a prior frame's header was corrupt
  166. * or missing outright!
  167. */
  168. struct {
  169. uint8_t segmentid[3];
  170. uint8_t mbskip;
  171. uint8_t intra;
  172. uint8_t last;
  173. uint8_t golden;
  174. uint8_t pred16x16[4];
  175. uint8_t pred8x8c[3];
  176. /* Padded to allow overreads */
  177. uint8_t token[4][17][3][NUM_DCT_TOKENS-1];
  178. uint8_t mvc[2][19];
  179. } prob[2];
  180. } VP8Context;
  181. static void vp8_decode_flush(AVCodecContext *avctx)
  182. {
  183. VP8Context *s = avctx->priv_data;
  184. int i;
  185. for (i = 0; i < 4; i++)
  186. if (s->frames[i].data[0])
  187. avctx->release_buffer(avctx, &s->frames[i]);
  188. memset(s->framep, 0, sizeof(s->framep));
  189. av_freep(&s->macroblocks_base);
  190. av_freep(&s->filter_strength);
  191. av_freep(&s->intra4x4_pred_mode_top);
  192. av_freep(&s->top_nnz);
  193. av_freep(&s->edge_emu_buffer);
  194. av_freep(&s->top_border);
  195. av_freep(&s->segmentation_map);
  196. s->macroblocks = NULL;
  197. }
  198. static int update_dimensions(VP8Context *s, int width, int height)
  199. {
  200. if (avcodec_check_dimensions(s->avctx, width, height))
  201. return AVERROR_INVALIDDATA;
  202. vp8_decode_flush(s->avctx);
  203. avcodec_set_dimensions(s->avctx, width, height);
  204. s->mb_width = (s->avctx->coded_width +15) / 16;
  205. s->mb_height = (s->avctx->coded_height+15) / 16;
  206. // we allocate a border around the top/left of intra4x4 modes
  207. // this is 4 blocks for intra4x4 to keep 4-byte alignment for fill_rectangle
  208. s->mb_stride = s->mb_width+1;
  209. s->b4_stride = 4*s->mb_stride;
  210. s->macroblocks_base = av_mallocz((s->mb_stride+s->mb_height*2+2)*sizeof(*s->macroblocks));
  211. s->filter_strength = av_mallocz(s->mb_stride*sizeof(*s->filter_strength));
  212. s->intra4x4_pred_mode_top = av_mallocz(s->b4_stride*4);
  213. s->top_nnz = av_mallocz(s->mb_width*sizeof(*s->top_nnz));
  214. s->top_border = av_mallocz((s->mb_width+1)*sizeof(*s->top_border));
  215. s->segmentation_map = av_mallocz(s->mb_stride*s->mb_height);
  216. if (!s->macroblocks_base || !s->filter_strength || !s->intra4x4_pred_mode_top ||
  217. !s->top_nnz || !s->top_border || !s->segmentation_map)
  218. return AVERROR(ENOMEM);
  219. s->macroblocks = s->macroblocks_base + 1;
  220. return 0;
  221. }
  222. static void parse_segment_info(VP8Context *s)
  223. {
  224. VP56RangeCoder *c = &s->c;
  225. int i;
  226. s->segmentation.update_map = vp8_rac_get(c);
  227. if (vp8_rac_get(c)) { // update segment feature data
  228. s->segmentation.absolute_vals = vp8_rac_get(c);
  229. for (i = 0; i < 4; i++)
  230. s->segmentation.base_quant[i] = vp8_rac_get_sint(c, 7);
  231. for (i = 0; i < 4; i++)
  232. s->segmentation.filter_level[i] = vp8_rac_get_sint(c, 6);
  233. }
  234. if (s->segmentation.update_map)
  235. for (i = 0; i < 3; i++)
  236. s->prob->segmentid[i] = vp8_rac_get(c) ? vp8_rac_get_uint(c, 8) : 255;
  237. }
  238. static void update_lf_deltas(VP8Context *s)
  239. {
  240. VP56RangeCoder *c = &s->c;
  241. int i;
  242. for (i = 0; i < 4; i++)
  243. s->lf_delta.ref[i] = vp8_rac_get_sint(c, 6);
  244. for (i = 0; i < 4; i++)
  245. s->lf_delta.mode[i] = vp8_rac_get_sint(c, 6);
  246. }
  247. static int setup_partitions(VP8Context *s, const uint8_t *buf, int buf_size)
  248. {
  249. const uint8_t *sizes = buf;
  250. int i;
  251. s->num_coeff_partitions = 1 << vp8_rac_get_uint(&s->c, 2);
  252. buf += 3*(s->num_coeff_partitions-1);
  253. buf_size -= 3*(s->num_coeff_partitions-1);
  254. if (buf_size < 0)
  255. return -1;
  256. for (i = 0; i < s->num_coeff_partitions-1; i++) {
  257. int size = AV_RL24(sizes + 3*i);
  258. if (buf_size - size < 0)
  259. return -1;
  260. vp56_init_range_decoder(&s->coeff_partition[i], buf, size);
  261. buf += size;
  262. buf_size -= size;
  263. }
  264. vp56_init_range_decoder(&s->coeff_partition[i], buf, buf_size);
  265. return 0;
  266. }
  267. static void get_quants(VP8Context *s)
  268. {
  269. VP56RangeCoder *c = &s->c;
  270. int i, base_qi;
  271. int yac_qi = vp8_rac_get_uint(c, 7);
  272. int ydc_delta = vp8_rac_get_sint(c, 4);
  273. int y2dc_delta = vp8_rac_get_sint(c, 4);
  274. int y2ac_delta = vp8_rac_get_sint(c, 4);
  275. int uvdc_delta = vp8_rac_get_sint(c, 4);
  276. int uvac_delta = vp8_rac_get_sint(c, 4);
  277. for (i = 0; i < 4; i++) {
  278. if (s->segmentation.enabled) {
  279. base_qi = s->segmentation.base_quant[i];
  280. if (!s->segmentation.absolute_vals)
  281. base_qi += yac_qi;
  282. } else
  283. base_qi = yac_qi;
  284. s->qmat[i].luma_qmul[0] = vp8_dc_qlookup[av_clip(base_qi + ydc_delta , 0, 127)];
  285. s->qmat[i].luma_qmul[1] = vp8_ac_qlookup[av_clip(base_qi , 0, 127)];
  286. s->qmat[i].luma_dc_qmul[0] = 2 * vp8_dc_qlookup[av_clip(base_qi + y2dc_delta, 0, 127)];
  287. s->qmat[i].luma_dc_qmul[1] = 155 * vp8_ac_qlookup[av_clip(base_qi + y2ac_delta, 0, 127)] / 100;
  288. s->qmat[i].chroma_qmul[0] = vp8_dc_qlookup[av_clip(base_qi + uvdc_delta, 0, 127)];
  289. s->qmat[i].chroma_qmul[1] = vp8_ac_qlookup[av_clip(base_qi + uvac_delta, 0, 127)];
  290. s->qmat[i].luma_dc_qmul[1] = FFMAX(s->qmat[i].luma_dc_qmul[1], 8);
  291. s->qmat[i].chroma_qmul[0] = FFMIN(s->qmat[i].chroma_qmul[0], 132);
  292. }
  293. }
  294. /**
  295. * Determine which buffers golden and altref should be updated with after this frame.
  296. * The spec isn't clear here, so I'm going by my understanding of what libvpx does
  297. *
  298. * Intra frames update all 3 references
  299. * Inter frames update VP56_FRAME_PREVIOUS if the update_last flag is set
  300. * If the update (golden|altref) flag is set, it's updated with the current frame
  301. * if update_last is set, and VP56_FRAME_PREVIOUS otherwise.
  302. * If the flag is not set, the number read means:
  303. * 0: no update
  304. * 1: VP56_FRAME_PREVIOUS
  305. * 2: update golden with altref, or update altref with golden
  306. */
  307. static VP56Frame ref_to_update(VP8Context *s, int update, VP56Frame ref)
  308. {
  309. VP56RangeCoder *c = &s->c;
  310. if (update)
  311. return VP56_FRAME_CURRENT;
  312. switch (vp8_rac_get_uint(c, 2)) {
  313. case 1:
  314. return VP56_FRAME_PREVIOUS;
  315. case 2:
  316. return (ref == VP56_FRAME_GOLDEN) ? VP56_FRAME_GOLDEN2 : VP56_FRAME_GOLDEN;
  317. }
  318. return VP56_FRAME_NONE;
  319. }
  320. static void update_refs(VP8Context *s)
  321. {
  322. VP56RangeCoder *c = &s->c;
  323. int update_golden = vp8_rac_get(c);
  324. int update_altref = vp8_rac_get(c);
  325. s->update_golden = ref_to_update(s, update_golden, VP56_FRAME_GOLDEN);
  326. s->update_altref = ref_to_update(s, update_altref, VP56_FRAME_GOLDEN2);
  327. }
  328. static int decode_frame_header(VP8Context *s, const uint8_t *buf, int buf_size)
  329. {
  330. VP56RangeCoder *c = &s->c;
  331. int header_size, hscale, vscale, i, j, k, l, m, ret;
  332. int width = s->avctx->width;
  333. int height = s->avctx->height;
  334. s->keyframe = !(buf[0] & 1);
  335. s->profile = (buf[0]>>1) & 7;
  336. s->invisible = !(buf[0] & 0x10);
  337. header_size = AV_RL24(buf) >> 5;
  338. buf += 3;
  339. buf_size -= 3;
  340. if (s->profile > 3)
  341. av_log(s->avctx, AV_LOG_WARNING, "Unknown profile %d\n", s->profile);
  342. if (!s->profile)
  343. memcpy(s->put_pixels_tab, s->vp8dsp.put_vp8_epel_pixels_tab, sizeof(s->put_pixels_tab));
  344. else // profile 1-3 use bilinear, 4+ aren't defined so whatever
  345. memcpy(s->put_pixels_tab, s->vp8dsp.put_vp8_bilinear_pixels_tab, sizeof(s->put_pixels_tab));
  346. if (header_size > buf_size - 7*s->keyframe) {
  347. av_log(s->avctx, AV_LOG_ERROR, "Header size larger than data provided\n");
  348. return AVERROR_INVALIDDATA;
  349. }
  350. if (s->keyframe) {
  351. if (AV_RL24(buf) != 0x2a019d) {
  352. av_log(s->avctx, AV_LOG_ERROR, "Invalid start code 0x%x\n", AV_RL24(buf));
  353. return AVERROR_INVALIDDATA;
  354. }
  355. width = AV_RL16(buf+3) & 0x3fff;
  356. height = AV_RL16(buf+5) & 0x3fff;
  357. hscale = buf[4] >> 6;
  358. vscale = buf[6] >> 6;
  359. buf += 7;
  360. buf_size -= 7;
  361. if (hscale || vscale)
  362. av_log_missing_feature(s->avctx, "Upscaling", 1);
  363. s->update_golden = s->update_altref = VP56_FRAME_CURRENT;
  364. for (i = 0; i < 4; i++)
  365. for (j = 0; j < 16; j++)
  366. memcpy(s->prob->token[i][j], vp8_token_default_probs[i][vp8_coeff_band[j]],
  367. sizeof(s->prob->token[i][j]));
  368. memcpy(s->prob->pred16x16, vp8_pred16x16_prob_inter, sizeof(s->prob->pred16x16));
  369. memcpy(s->prob->pred8x8c , vp8_pred8x8c_prob_inter , sizeof(s->prob->pred8x8c));
  370. memcpy(s->prob->mvc , vp8_mv_default_prob , sizeof(s->prob->mvc));
  371. memset(&s->segmentation, 0, sizeof(s->segmentation));
  372. }
  373. if (!s->macroblocks_base || /* first frame */
  374. width != s->avctx->width || height != s->avctx->height) {
  375. if ((ret = update_dimensions(s, width, height) < 0))
  376. return ret;
  377. }
  378. vp56_init_range_decoder(c, buf, header_size);
  379. buf += header_size;
  380. buf_size -= header_size;
  381. if (s->keyframe) {
  382. if (vp8_rac_get(c))
  383. av_log(s->avctx, AV_LOG_WARNING, "Unspecified colorspace\n");
  384. vp8_rac_get(c); // whether we can skip clamping in dsp functions
  385. }
  386. if ((s->segmentation.enabled = vp8_rac_get(c)))
  387. parse_segment_info(s);
  388. else
  389. s->segmentation.update_map = 0; // FIXME: move this to some init function?
  390. s->filter.simple = vp8_rac_get(c);
  391. s->filter.level = vp8_rac_get_uint(c, 6);
  392. s->filter.sharpness = vp8_rac_get_uint(c, 3);
  393. if ((s->lf_delta.enabled = vp8_rac_get(c)))
  394. if (vp8_rac_get(c))
  395. update_lf_deltas(s);
  396. if (setup_partitions(s, buf, buf_size)) {
  397. av_log(s->avctx, AV_LOG_ERROR, "Invalid partitions\n");
  398. return AVERROR_INVALIDDATA;
  399. }
  400. get_quants(s);
  401. if (!s->keyframe) {
  402. update_refs(s);
  403. s->sign_bias[VP56_FRAME_GOLDEN] = vp8_rac_get(c);
  404. s->sign_bias[VP56_FRAME_GOLDEN2 /* altref */] = vp8_rac_get(c);
  405. }
  406. // if we aren't saving this frame's probabilities for future frames,
  407. // make a copy of the current probabilities
  408. if (!(s->update_probabilities = vp8_rac_get(c)))
  409. s->prob[1] = s->prob[0];
  410. s->update_last = s->keyframe || vp8_rac_get(c);
  411. for (i = 0; i < 4; i++)
  412. for (j = 0; j < 8; j++)
  413. for (k = 0; k < 3; k++)
  414. for (l = 0; l < NUM_DCT_TOKENS-1; l++)
  415. if (vp56_rac_get_prob_branchy(c, vp8_token_update_probs[i][j][k][l])) {
  416. int prob = vp8_rac_get_uint(c, 8);
  417. for (m = 0; m < 16; m++)
  418. if (vp8_coeff_band[m] == j)
  419. s->prob->token[i][m][k][l] = prob;
  420. }
  421. if ((s->mbskip_enabled = vp8_rac_get(c)))
  422. s->prob->mbskip = vp8_rac_get_uint(c, 8);
  423. if (!s->keyframe) {
  424. s->prob->intra = vp8_rac_get_uint(c, 8);
  425. s->prob->last = vp8_rac_get_uint(c, 8);
  426. s->prob->golden = vp8_rac_get_uint(c, 8);
  427. if (vp8_rac_get(c))
  428. for (i = 0; i < 4; i++)
  429. s->prob->pred16x16[i] = vp8_rac_get_uint(c, 8);
  430. if (vp8_rac_get(c))
  431. for (i = 0; i < 3; i++)
  432. s->prob->pred8x8c[i] = vp8_rac_get_uint(c, 8);
  433. // 17.2 MV probability update
  434. for (i = 0; i < 2; i++)
  435. for (j = 0; j < 19; j++)
  436. if (vp56_rac_get_prob_branchy(c, vp8_mv_update_prob[i][j]))
  437. s->prob->mvc[i][j] = vp8_rac_get_nn(c);
  438. }
  439. return 0;
  440. }
  441. static av_always_inline
  442. void clamp_mv(VP8Context *s, VP56mv *dst, const VP56mv *src, int mb_x, int mb_y)
  443. {
  444. #define MARGIN (16 << 2)
  445. dst->x = av_clip(src->x, -((mb_x << 6) + MARGIN),
  446. ((s->mb_width - 1 - mb_x) << 6) + MARGIN);
  447. dst->y = av_clip(src->y, -((mb_y << 6) + MARGIN),
  448. ((s->mb_height - 1 - mb_y) << 6) + MARGIN);
  449. }
  450. static av_always_inline
  451. void find_near_mvs(VP8Context *s, VP8Macroblock *mb, int mb_x, int mb_y,
  452. VP56mv near[2], VP56mv *best, uint8_t cnt[4])
  453. {
  454. VP8Macroblock *mb_edge[3] = { mb + 2 /* top */,
  455. mb - 1 /* left */,
  456. mb + 1 /* top-left */ };
  457. enum { EDGE_TOP, EDGE_LEFT, EDGE_TOPLEFT };
  458. VP56mv near_mv[4] = {{ 0 }};
  459. enum { CNT_ZERO, CNT_NEAREST, CNT_NEAR, CNT_SPLITMV };
  460. int idx = CNT_ZERO;
  461. int best_idx = CNT_ZERO;
  462. int cur_sign_bias = s->sign_bias[mb->ref_frame];
  463. int *sign_bias = s->sign_bias;
  464. /* Process MB on top, left and top-left */
  465. #define MV_EDGE_CHECK(n)\
  466. {\
  467. VP8Macroblock *edge = mb_edge[n];\
  468. int edge_ref = edge->ref_frame;\
  469. if (edge_ref != VP56_FRAME_CURRENT) {\
  470. uint32_t mv = AV_RN32A(&edge->mv);\
  471. if (mv) {\
  472. if (cur_sign_bias != sign_bias[edge_ref]) {\
  473. /* SWAR negate of the values in mv. */\
  474. mv = ~mv;\
  475. mv = ((mv&0x7fff7fff) + 0x00010001) ^ (mv&0x80008000);\
  476. }\
  477. if (!n || mv != AV_RN32A(&near_mv[idx]))\
  478. AV_WN32A(&near_mv[++idx], mv);\
  479. cnt[idx] += 1 + (n != 2);\
  480. } else\
  481. cnt[CNT_ZERO] += 1 + (n != 2);\
  482. }\
  483. }
  484. MV_EDGE_CHECK(0)
  485. MV_EDGE_CHECK(1)
  486. MV_EDGE_CHECK(2)
  487. /* If we have three distinct MVs, merge first and last if they're the same */
  488. if (cnt[CNT_SPLITMV] && AV_RN32A(&near_mv[1+EDGE_TOP]) == AV_RN32A(&near_mv[1+EDGE_TOPLEFT]))
  489. cnt[CNT_NEAREST] += 1;
  490. cnt[CNT_SPLITMV] = ((mb_edge[EDGE_LEFT]->mode == VP8_MVMODE_SPLIT) +
  491. (mb_edge[EDGE_TOP]->mode == VP8_MVMODE_SPLIT)) * 2 +
  492. (mb_edge[EDGE_TOPLEFT]->mode == VP8_MVMODE_SPLIT);
  493. /* Swap near and nearest if necessary */
  494. if (cnt[CNT_NEAR] > cnt[CNT_NEAREST]) {
  495. FFSWAP(uint8_t, cnt[CNT_NEAREST], cnt[CNT_NEAR]);
  496. FFSWAP( VP56mv, near_mv[CNT_NEAREST], near_mv[CNT_NEAR]);
  497. }
  498. /* Choose the best mv out of 0,0 and the nearest mv */
  499. if (cnt[CNT_NEAREST] >= cnt[CNT_ZERO])
  500. best_idx = CNT_NEAREST;
  501. mb->mv = near_mv[best_idx];
  502. near[0] = near_mv[CNT_NEAREST];
  503. near[1] = near_mv[CNT_NEAR];
  504. }
  505. /**
  506. * Motion vector coding, 17.1.
  507. */
  508. static int read_mv_component(VP56RangeCoder *c, const uint8_t *p)
  509. {
  510. int bit, x = 0;
  511. if (vp56_rac_get_prob_branchy(c, p[0])) {
  512. int i;
  513. for (i = 0; i < 3; i++)
  514. x += vp56_rac_get_prob(c, p[9 + i]) << i;
  515. for (i = 9; i > 3; i--)
  516. x += vp56_rac_get_prob(c, p[9 + i]) << i;
  517. if (!(x & 0xFFF0) || vp56_rac_get_prob(c, p[12]))
  518. x += 8;
  519. } else {
  520. // small_mvtree
  521. const uint8_t *ps = p+2;
  522. bit = vp56_rac_get_prob(c, *ps);
  523. ps += 1 + 3*bit;
  524. x += 4*bit;
  525. bit = vp56_rac_get_prob(c, *ps);
  526. ps += 1 + bit;
  527. x += 2*bit;
  528. x += vp56_rac_get_prob(c, *ps);
  529. }
  530. return (x && vp56_rac_get_prob(c, p[1])) ? -x : x;
  531. }
  532. static av_always_inline
  533. const uint8_t *get_submv_prob(uint32_t left, uint32_t top)
  534. {
  535. if (left == top)
  536. return vp8_submv_prob[4-!!left];
  537. if (!top)
  538. return vp8_submv_prob[2];
  539. return vp8_submv_prob[1-!!left];
  540. }
  541. /**
  542. * Split motion vector prediction, 16.4.
  543. * @returns the number of motion vectors parsed (2, 4 or 16)
  544. */
  545. static av_always_inline
  546. int decode_splitmvs(VP8Context *s, VP56RangeCoder *c, VP8Macroblock *mb)
  547. {
  548. int part_idx = mb->partitioning =
  549. vp8_rac_get_tree(c, vp8_mbsplit_tree, vp8_mbsplit_prob);
  550. int n, num = vp8_mbsplit_count[part_idx];
  551. VP8Macroblock *top_mb = &mb[2];
  552. VP8Macroblock *left_mb = &mb[-1];
  553. const uint8_t *mbsplits_left = vp8_mbsplits[left_mb->partitioning],
  554. *mbsplits_top = vp8_mbsplits[top_mb->partitioning],
  555. *mbsplits_cur = vp8_mbsplits[part_idx],
  556. *firstidx = vp8_mbfirstidx[part_idx];
  557. VP56mv *top_mv = top_mb->bmv;
  558. VP56mv *left_mv = left_mb->bmv;
  559. VP56mv *cur_mv = mb->bmv;
  560. for (n = 0; n < num; n++) {
  561. int k = firstidx[n];
  562. uint32_t left, above;
  563. const uint8_t *submv_prob;
  564. if (!(k & 3))
  565. left = AV_RN32A(&left_mv[mbsplits_left[k + 3]]);
  566. else
  567. left = AV_RN32A(&cur_mv[mbsplits_cur[k - 1]]);
  568. if (k <= 3)
  569. above = AV_RN32A(&top_mv[mbsplits_top[k + 12]]);
  570. else
  571. above = AV_RN32A(&cur_mv[mbsplits_cur[k - 4]]);
  572. submv_prob = get_submv_prob(left, above);
  573. switch (vp8_rac_get_tree(c, vp8_submv_ref_tree, submv_prob)) {
  574. case VP8_SUBMVMODE_NEW4X4:
  575. mb->bmv[n].y = mb->mv.y + read_mv_component(c, s->prob->mvc[0]);
  576. mb->bmv[n].x = mb->mv.x + read_mv_component(c, s->prob->mvc[1]);
  577. break;
  578. case VP8_SUBMVMODE_ZERO4X4:
  579. AV_ZERO32(&mb->bmv[n]);
  580. break;
  581. case VP8_SUBMVMODE_LEFT4X4:
  582. AV_WN32A(&mb->bmv[n], left);
  583. break;
  584. case VP8_SUBMVMODE_TOP4X4:
  585. AV_WN32A(&mb->bmv[n], above);
  586. break;
  587. }
  588. }
  589. return num;
  590. }
  591. static av_always_inline
  592. void decode_intra4x4_modes(VP8Context *s, VP56RangeCoder *c,
  593. int mb_x, int keyframe)
  594. {
  595. uint8_t *intra4x4 = s->intra4x4_pred_mode_mb;
  596. if (keyframe) {
  597. int x, y;
  598. uint8_t* const top = s->intra4x4_pred_mode_top + 4 * mb_x;
  599. uint8_t* const left = s->intra4x4_pred_mode_left;
  600. for (y = 0; y < 4; y++) {
  601. for (x = 0; x < 4; x++) {
  602. const uint8_t *ctx;
  603. ctx = vp8_pred4x4_prob_intra[top[x]][left[y]];
  604. *intra4x4 = vp8_rac_get_tree(c, vp8_pred4x4_tree, ctx);
  605. left[y] = top[x] = *intra4x4;
  606. intra4x4++;
  607. }
  608. }
  609. } else {
  610. int i;
  611. for (i = 0; i < 16; i++)
  612. intra4x4[i] = vp8_rac_get_tree(c, vp8_pred4x4_tree, vp8_pred4x4_prob_inter);
  613. }
  614. }
  615. static av_always_inline
  616. void decode_mb_mode(VP8Context *s, VP8Macroblock *mb, int mb_x, int mb_y, uint8_t *segment)
  617. {
  618. VP56RangeCoder *c = &s->c;
  619. if (s->segmentation.update_map)
  620. *segment = vp8_rac_get_tree(c, vp8_segmentid_tree, s->prob->segmentid);
  621. s->segment = *segment;
  622. mb->skip = s->mbskip_enabled ? vp56_rac_get_prob(c, s->prob->mbskip) : 0;
  623. if (s->keyframe) {
  624. mb->mode = vp8_rac_get_tree(c, vp8_pred16x16_tree_intra, vp8_pred16x16_prob_intra);
  625. if (mb->mode == MODE_I4x4) {
  626. decode_intra4x4_modes(s, c, mb_x, 1);
  627. } else {
  628. const uint32_t modes = vp8_pred4x4_mode[mb->mode] * 0x01010101u;
  629. AV_WN32A(s->intra4x4_pred_mode_top + 4 * mb_x, modes);
  630. AV_WN32A(s->intra4x4_pred_mode_left, modes);
  631. }
  632. s->chroma_pred_mode = vp8_rac_get_tree(c, vp8_pred8x8c_tree, vp8_pred8x8c_prob_intra);
  633. mb->ref_frame = VP56_FRAME_CURRENT;
  634. } else if (vp56_rac_get_prob_branchy(c, s->prob->intra)) {
  635. VP56mv near[2], best;
  636. uint8_t cnt[4] = { 0 };
  637. uint8_t p[4];
  638. // inter MB, 16.2
  639. if (vp56_rac_get_prob_branchy(c, s->prob->last))
  640. mb->ref_frame = vp56_rac_get_prob(c, s->prob->golden) ?
  641. VP56_FRAME_GOLDEN2 /* altref */ : VP56_FRAME_GOLDEN;
  642. else
  643. mb->ref_frame = VP56_FRAME_PREVIOUS;
  644. s->ref_count[mb->ref_frame-1]++;
  645. // motion vectors, 16.3
  646. find_near_mvs(s, mb, mb_x, mb_y, near, &best, cnt);
  647. p[0] = vp8_mode_contexts[cnt[0]][0];
  648. p[1] = vp8_mode_contexts[cnt[1]][1];
  649. p[2] = vp8_mode_contexts[cnt[2]][2];
  650. p[3] = vp8_mode_contexts[cnt[3]][3];
  651. mb->mode = vp8_rac_get_tree(c, vp8_pred16x16_tree_mvinter, p);
  652. switch (mb->mode) {
  653. case VP8_MVMODE_SPLIT:
  654. clamp_mv(s, &mb->mv, &mb->mv, mb_x, mb_y);
  655. mb->mv = mb->bmv[decode_splitmvs(s, c, mb) - 1];
  656. break;
  657. case VP8_MVMODE_ZERO:
  658. AV_ZERO32(&mb->mv);
  659. break;
  660. case VP8_MVMODE_NEAREST:
  661. clamp_mv(s, &mb->mv, &near[0], mb_x, mb_y);
  662. break;
  663. case VP8_MVMODE_NEAR:
  664. clamp_mv(s, &mb->mv, &near[1], mb_x, mb_y);
  665. break;
  666. case VP8_MVMODE_NEW:
  667. clamp_mv(s, &mb->mv, &mb->mv, mb_x, mb_y);
  668. mb->mv.y += + read_mv_component(c, s->prob->mvc[0]);
  669. mb->mv.x += + read_mv_component(c, s->prob->mvc[1]);
  670. break;
  671. }
  672. if (mb->mode != VP8_MVMODE_SPLIT) {
  673. mb->partitioning = VP8_SPLITMVMODE_NONE;
  674. mb->bmv[0] = mb->mv;
  675. }
  676. } else {
  677. // intra MB, 16.1
  678. mb->mode = vp8_rac_get_tree(c, vp8_pred16x16_tree_inter, s->prob->pred16x16);
  679. if (mb->mode == MODE_I4x4)
  680. decode_intra4x4_modes(s, c, mb_x, 0);
  681. s->chroma_pred_mode = vp8_rac_get_tree(c, vp8_pred8x8c_tree, s->prob->pred8x8c);
  682. mb->ref_frame = VP56_FRAME_CURRENT;
  683. mb->partitioning = VP8_SPLITMVMODE_NONE;
  684. AV_ZERO32(&mb->bmv[0]);
  685. }
  686. }
  687. /**
  688. * @param c arithmetic bitstream reader context
  689. * @param block destination for block coefficients
  690. * @param probs probabilities to use when reading trees from the bitstream
  691. * @param i initial coeff index, 0 unless a separate DC block is coded
  692. * @param zero_nhood the initial prediction context for number of surrounding
  693. * all-zero blocks (only left/top, so 0-2)
  694. * @param qmul array holding the dc/ac dequant factor at position 0/1
  695. * @return 0 if no coeffs were decoded
  696. * otherwise, the index of the last coeff decoded plus one
  697. */
  698. static int decode_block_coeffs(VP56RangeCoder *c, DCTELEM block[16],
  699. uint8_t probs[8][3][NUM_DCT_TOKENS-1],
  700. int i, int zero_nhood, int16_t qmul[2])
  701. {
  702. uint8_t *token_prob = probs[i][zero_nhood];
  703. int nonzero = 0;
  704. int coeff;
  705. do {
  706. if (!vp56_rac_get_prob_branchy(c, token_prob[0])) // DCT_EOB
  707. return nonzero;
  708. skip_eob:
  709. if (!vp56_rac_get_prob_branchy(c, token_prob[1])) { // DCT_0
  710. if (++i == 16)
  711. return nonzero; // invalid input; blocks should end with EOB
  712. token_prob = probs[i][0];
  713. goto skip_eob;
  714. }
  715. if (!vp56_rac_get_prob_branchy(c, token_prob[2])) { // DCT_1
  716. coeff = 1;
  717. token_prob = probs[i+1][1];
  718. } else {
  719. if (!vp56_rac_get_prob_branchy(c, token_prob[3])) { // DCT 2,3,4
  720. coeff = vp56_rac_get_prob(c, token_prob[4]);
  721. if (coeff)
  722. coeff += vp56_rac_get_prob(c, token_prob[5]);
  723. coeff += 2;
  724. } else {
  725. // DCT_CAT*
  726. if (!vp56_rac_get_prob_branchy(c, token_prob[6])) {
  727. if (!vp56_rac_get_prob_branchy(c, token_prob[7])) { // DCT_CAT1
  728. coeff = 5 + vp56_rac_get_prob(c, vp8_dct_cat1_prob[0]);
  729. } else { // DCT_CAT2
  730. coeff = 7;
  731. coeff += vp56_rac_get_prob(c, vp8_dct_cat2_prob[0]) << 1;
  732. coeff += vp56_rac_get_prob(c, vp8_dct_cat2_prob[1]);
  733. }
  734. } else { // DCT_CAT3 and up
  735. int a = vp56_rac_get_prob(c, token_prob[8]);
  736. int b = vp56_rac_get_prob(c, token_prob[9+a]);
  737. int cat = (a<<1) + b;
  738. coeff = 3 + (8<<cat);
  739. coeff += vp8_rac_get_coeff(c, vp8_dct_cat_prob[cat]);
  740. }
  741. }
  742. token_prob = probs[i+1][2];
  743. }
  744. // todo: full [16] qmat? load into register?
  745. block[zigzag_scan[i]] = (vp8_rac_get(c) ? -coeff : coeff) * qmul[!!i];
  746. nonzero = ++i;
  747. } while (i < 16);
  748. return nonzero;
  749. }
  750. static av_always_inline
  751. void decode_mb_coeffs(VP8Context *s, VP56RangeCoder *c, VP8Macroblock *mb,
  752. uint8_t t_nnz[9], uint8_t l_nnz[9])
  753. {
  754. int i, x, y, luma_start = 0, luma_ctx = 3;
  755. int nnz_pred, nnz, nnz_total = 0;
  756. int segment = s->segment;
  757. int block_dc = 0;
  758. if (mb->mode != MODE_I4x4 && mb->mode != VP8_MVMODE_SPLIT) {
  759. nnz_pred = t_nnz[8] + l_nnz[8];
  760. // decode DC values and do hadamard
  761. nnz = decode_block_coeffs(c, s->block_dc, s->prob->token[1], 0, nnz_pred,
  762. s->qmat[segment].luma_dc_qmul);
  763. l_nnz[8] = t_nnz[8] = !!nnz;
  764. if (nnz) {
  765. nnz_total += nnz;
  766. block_dc = 1;
  767. if (nnz == 1)
  768. s->vp8dsp.vp8_luma_dc_wht_dc(s->block, s->block_dc);
  769. else
  770. s->vp8dsp.vp8_luma_dc_wht(s->block, s->block_dc);
  771. }
  772. luma_start = 1;
  773. luma_ctx = 0;
  774. }
  775. // luma blocks
  776. for (y = 0; y < 4; y++)
  777. for (x = 0; x < 4; x++) {
  778. nnz_pred = l_nnz[y] + t_nnz[x];
  779. nnz = decode_block_coeffs(c, s->block[y][x], s->prob->token[luma_ctx], luma_start,
  780. nnz_pred, s->qmat[segment].luma_qmul);
  781. // nnz+block_dc may be one more than the actual last index, but we don't care
  782. s->non_zero_count_cache[y][x] = nnz + block_dc;
  783. t_nnz[x] = l_nnz[y] = !!nnz;
  784. nnz_total += nnz;
  785. }
  786. // chroma blocks
  787. // TODO: what to do about dimensions? 2nd dim for luma is x,
  788. // but for chroma it's (y<<1)|x
  789. for (i = 4; i < 6; i++)
  790. for (y = 0; y < 2; y++)
  791. for (x = 0; x < 2; x++) {
  792. nnz_pred = l_nnz[i+2*y] + t_nnz[i+2*x];
  793. nnz = decode_block_coeffs(c, s->block[i][(y<<1)+x], s->prob->token[2], 0,
  794. nnz_pred, s->qmat[segment].chroma_qmul);
  795. s->non_zero_count_cache[i][(y<<1)+x] = nnz;
  796. t_nnz[i+2*x] = l_nnz[i+2*y] = !!nnz;
  797. nnz_total += nnz;
  798. }
  799. // if there were no coded coeffs despite the macroblock not being marked skip,
  800. // we MUST not do the inner loop filter and should not do IDCT
  801. // Since skip isn't used for bitstream prediction, just manually set it.
  802. if (!nnz_total)
  803. mb->skip = 1;
  804. }
  805. static av_always_inline
  806. void backup_mb_border(uint8_t *top_border, uint8_t *src_y, uint8_t *src_cb, uint8_t *src_cr,
  807. int linesize, int uvlinesize, int simple)
  808. {
  809. AV_COPY128(top_border, src_y + 15*linesize);
  810. if (!simple) {
  811. AV_COPY64(top_border+16, src_cb + 7*uvlinesize);
  812. AV_COPY64(top_border+24, src_cr + 7*uvlinesize);
  813. }
  814. }
  815. static av_always_inline
  816. void xchg_mb_border(uint8_t *top_border, uint8_t *src_y, uint8_t *src_cb, uint8_t *src_cr,
  817. int linesize, int uvlinesize, int mb_x, int mb_y, int mb_width,
  818. int simple, int xchg)
  819. {
  820. uint8_t *top_border_m1 = top_border-32; // for TL prediction
  821. src_y -= linesize;
  822. src_cb -= uvlinesize;
  823. src_cr -= uvlinesize;
  824. #define XCHG(a,b,xchg) do { \
  825. if (xchg) AV_SWAP64(b,a); \
  826. else AV_COPY64(b,a); \
  827. } while (0)
  828. XCHG(top_border_m1+8, src_y-8, xchg);
  829. XCHG(top_border, src_y, xchg);
  830. XCHG(top_border+8, src_y+8, 1);
  831. if (mb_x < mb_width-1)
  832. XCHG(top_border+32, src_y+16, 1);
  833. // only copy chroma for normal loop filter
  834. // or to initialize the top row to 127
  835. if (!simple || !mb_y) {
  836. XCHG(top_border_m1+16, src_cb-8, xchg);
  837. XCHG(top_border_m1+24, src_cr-8, xchg);
  838. XCHG(top_border+16, src_cb, 1);
  839. XCHG(top_border+24, src_cr, 1);
  840. }
  841. }
  842. static av_always_inline
  843. int check_intra_pred_mode(int mode, int mb_x, int mb_y)
  844. {
  845. if (mode == DC_PRED8x8) {
  846. if (!mb_x) {
  847. mode = mb_y ? TOP_DC_PRED8x8 : DC_128_PRED8x8;
  848. } else if (!mb_y) {
  849. mode = LEFT_DC_PRED8x8;
  850. }
  851. }
  852. return mode;
  853. }
  854. static av_always_inline
  855. void intra_predict(VP8Context *s, uint8_t *dst[3], VP8Macroblock *mb,
  856. int mb_x, int mb_y)
  857. {
  858. int x, y, mode, nnz, tr;
  859. // for the first row, we need to run xchg_mb_border to init the top edge to 127
  860. // otherwise, skip it if we aren't going to deblock
  861. if (s->deblock_filter || !mb_y)
  862. xchg_mb_border(s->top_border[mb_x+1], dst[0], dst[1], dst[2],
  863. s->linesize, s->uvlinesize, mb_x, mb_y, s->mb_width,
  864. s->filter.simple, 1);
  865. if (mb->mode < MODE_I4x4) {
  866. mode = check_intra_pred_mode(mb->mode, mb_x, mb_y);
  867. s->hpc.pred16x16[mode](dst[0], s->linesize);
  868. } else {
  869. uint8_t *ptr = dst[0];
  870. uint8_t *intra4x4 = s->intra4x4_pred_mode_mb;
  871. // all blocks on the right edge of the macroblock use bottom edge
  872. // the top macroblock for their topright edge
  873. uint8_t *tr_right = ptr - s->linesize + 16;
  874. // if we're on the right edge of the frame, said edge is extended
  875. // from the top macroblock
  876. if (mb_x == s->mb_width-1) {
  877. tr = tr_right[-1]*0x01010101;
  878. tr_right = (uint8_t *)&tr;
  879. }
  880. if (mb->skip)
  881. AV_ZERO128(s->non_zero_count_cache);
  882. for (y = 0; y < 4; y++) {
  883. uint8_t *topright = ptr + 4 - s->linesize;
  884. for (x = 0; x < 4; x++) {
  885. if (x == 3)
  886. topright = tr_right;
  887. s->hpc.pred4x4[intra4x4[x]](ptr+4*x, topright, s->linesize);
  888. nnz = s->non_zero_count_cache[y][x];
  889. if (nnz) {
  890. if (nnz == 1)
  891. s->vp8dsp.vp8_idct_dc_add(ptr+4*x, s->block[y][x], s->linesize);
  892. else
  893. s->vp8dsp.vp8_idct_add(ptr+4*x, s->block[y][x], s->linesize);
  894. }
  895. topright += 4;
  896. }
  897. ptr += 4*s->linesize;
  898. intra4x4 += 4;
  899. }
  900. }
  901. mode = check_intra_pred_mode(s->chroma_pred_mode, mb_x, mb_y);
  902. s->hpc.pred8x8[mode](dst[1], s->uvlinesize);
  903. s->hpc.pred8x8[mode](dst[2], s->uvlinesize);
  904. if (s->deblock_filter || !mb_y)
  905. xchg_mb_border(s->top_border[mb_x+1], dst[0], dst[1], dst[2],
  906. s->linesize, s->uvlinesize, mb_x, mb_y, s->mb_width,
  907. s->filter.simple, 0);
  908. }
  909. /**
  910. * Generic MC function.
  911. *
  912. * @param s VP8 decoding context
  913. * @param luma 1 for luma (Y) planes, 0 for chroma (Cb/Cr) planes
  914. * @param dst target buffer for block data at block position
  915. * @param src reference picture buffer at origin (0, 0)
  916. * @param mv motion vector (relative to block position) to get pixel data from
  917. * @param x_off horizontal position of block from origin (0, 0)
  918. * @param y_off vertical position of block from origin (0, 0)
  919. * @param block_w width of block (16, 8 or 4)
  920. * @param block_h height of block (always same as block_w)
  921. * @param width width of src/dst plane data
  922. * @param height height of src/dst plane data
  923. * @param linesize size of a single line of plane data, including padding
  924. * @param mc_func motion compensation function pointers (bilinear or sixtap MC)
  925. */
  926. static av_always_inline
  927. void vp8_mc(VP8Context *s, int luma,
  928. uint8_t *dst, uint8_t *src, const VP56mv *mv,
  929. int x_off, int y_off, int block_w, int block_h,
  930. int width, int height, int linesize,
  931. vp8_mc_func mc_func[3][3])
  932. {
  933. if (AV_RN32A(mv)) {
  934. static const uint8_t idx[8] = { 0, 1, 2, 1, 2, 1, 2, 1 };
  935. int mx = (mv->x << luma)&7, mx_idx = idx[mx];
  936. int my = (mv->y << luma)&7, my_idx = idx[my];
  937. x_off += mv->x >> (3 - luma);
  938. y_off += mv->y >> (3 - luma);
  939. // edge emulation
  940. src += y_off * linesize + x_off;
  941. if (x_off < 2 || x_off >= width - block_w - 3 ||
  942. y_off < 2 || y_off >= height - block_h - 3) {
  943. ff_emulated_edge_mc(s->edge_emu_buffer, src - 2 * linesize - 2, linesize,
  944. block_w + 5, block_h + 5,
  945. x_off - 2, y_off - 2, width, height);
  946. src = s->edge_emu_buffer + 2 + linesize * 2;
  947. }
  948. mc_func[my_idx][mx_idx](dst, linesize, src, linesize, block_h, mx, my);
  949. } else
  950. mc_func[0][0](dst, linesize, src + y_off * linesize + x_off, linesize, block_h, 0, 0);
  951. }
  952. static av_always_inline
  953. void vp8_mc_part(VP8Context *s, uint8_t *dst[3],
  954. AVFrame *ref_frame, int x_off, int y_off,
  955. int bx_off, int by_off,
  956. int block_w, int block_h,
  957. int width, int height, VP56mv *mv)
  958. {
  959. VP56mv uvmv = *mv;
  960. /* Y */
  961. vp8_mc(s, 1, dst[0] + by_off * s->linesize + bx_off,
  962. ref_frame->data[0], mv, x_off + bx_off, y_off + by_off,
  963. block_w, block_h, width, height, s->linesize,
  964. s->put_pixels_tab[block_w == 8]);
  965. /* U/V */
  966. if (s->profile == 3) {
  967. uvmv.x &= ~7;
  968. uvmv.y &= ~7;
  969. }
  970. x_off >>= 1; y_off >>= 1;
  971. bx_off >>= 1; by_off >>= 1;
  972. width >>= 1; height >>= 1;
  973. block_w >>= 1; block_h >>= 1;
  974. vp8_mc(s, 0, dst[1] + by_off * s->uvlinesize + bx_off,
  975. ref_frame->data[1], &uvmv, x_off + bx_off, y_off + by_off,
  976. block_w, block_h, width, height, s->uvlinesize,
  977. s->put_pixels_tab[1 + (block_w == 4)]);
  978. vp8_mc(s, 0, dst[2] + by_off * s->uvlinesize + bx_off,
  979. ref_frame->data[2], &uvmv, x_off + bx_off, y_off + by_off,
  980. block_w, block_h, width, height, s->uvlinesize,
  981. s->put_pixels_tab[1 + (block_w == 4)]);
  982. }
  983. /* Fetch pixels for estimated mv 4 macroblocks ahead.
  984. * Optimized for 64-byte cache lines. Inspired by ffh264 prefetch_motion. */
  985. static av_always_inline void prefetch_motion(VP8Context *s, VP8Macroblock *mb, int mb_x, int mb_y, int mb_xy, int ref)
  986. {
  987. /* Don't prefetch refs that haven't been used very often this frame. */
  988. if (s->ref_count[ref-1] > (mb_xy >> 5)) {
  989. int x_off = mb_x << 4, y_off = mb_y << 4;
  990. int mx = mb->mv.x + x_off + 8;
  991. int my = mb->mv.y + y_off;
  992. uint8_t **src= s->framep[ref]->data;
  993. int off= mx + (my + (mb_x&3)*4)*s->linesize + 64;
  994. s->dsp.prefetch(src[0]+off, s->linesize, 4);
  995. off= (mx>>1) + ((my>>1) + (mb_x&7))*s->uvlinesize + 64;
  996. s->dsp.prefetch(src[1]+off, src[2]-src[1], 2);
  997. }
  998. }
  999. /**
  1000. * Apply motion vectors to prediction buffer, chapter 18.
  1001. */
  1002. static av_always_inline
  1003. void inter_predict(VP8Context *s, uint8_t *dst[3], VP8Macroblock *mb,
  1004. int mb_x, int mb_y)
  1005. {
  1006. int x_off = mb_x << 4, y_off = mb_y << 4;
  1007. int width = 16*s->mb_width, height = 16*s->mb_height;
  1008. AVFrame *ref = s->framep[mb->ref_frame];
  1009. VP56mv *bmv = mb->bmv;
  1010. if (mb->mode < VP8_MVMODE_SPLIT) {
  1011. vp8_mc_part(s, dst, ref, x_off, y_off,
  1012. 0, 0, 16, 16, width, height, &mb->mv);
  1013. } else switch (mb->partitioning) {
  1014. case VP8_SPLITMVMODE_4x4: {
  1015. int x, y;
  1016. VP56mv uvmv;
  1017. /* Y */
  1018. for (y = 0; y < 4; y++) {
  1019. for (x = 0; x < 4; x++) {
  1020. vp8_mc(s, 1, dst[0] + 4*y*s->linesize + x*4,
  1021. ref->data[0], &bmv[4*y + x],
  1022. 4*x + x_off, 4*y + y_off, 4, 4,
  1023. width, height, s->linesize,
  1024. s->put_pixels_tab[2]);
  1025. }
  1026. }
  1027. /* U/V */
  1028. x_off >>= 1; y_off >>= 1; width >>= 1; height >>= 1;
  1029. for (y = 0; y < 2; y++) {
  1030. for (x = 0; x < 2; x++) {
  1031. uvmv.x = mb->bmv[ 2*y * 4 + 2*x ].x +
  1032. mb->bmv[ 2*y * 4 + 2*x+1].x +
  1033. mb->bmv[(2*y+1) * 4 + 2*x ].x +
  1034. mb->bmv[(2*y+1) * 4 + 2*x+1].x;
  1035. uvmv.y = mb->bmv[ 2*y * 4 + 2*x ].y +
  1036. mb->bmv[ 2*y * 4 + 2*x+1].y +
  1037. mb->bmv[(2*y+1) * 4 + 2*x ].y +
  1038. mb->bmv[(2*y+1) * 4 + 2*x+1].y;
  1039. uvmv.x = (uvmv.x + 2 + (uvmv.x >> (INT_BIT-1))) >> 2;
  1040. uvmv.y = (uvmv.y + 2 + (uvmv.y >> (INT_BIT-1))) >> 2;
  1041. if (s->profile == 3) {
  1042. uvmv.x &= ~7;
  1043. uvmv.y &= ~7;
  1044. }
  1045. vp8_mc(s, 0, dst[1] + 4*y*s->uvlinesize + x*4,
  1046. ref->data[1], &uvmv,
  1047. 4*x + x_off, 4*y + y_off, 4, 4,
  1048. width, height, s->uvlinesize,
  1049. s->put_pixels_tab[2]);
  1050. vp8_mc(s, 0, dst[2] + 4*y*s->uvlinesize + x*4,
  1051. ref->data[2], &uvmv,
  1052. 4*x + x_off, 4*y + y_off, 4, 4,
  1053. width, height, s->uvlinesize,
  1054. s->put_pixels_tab[2]);
  1055. }
  1056. }
  1057. break;
  1058. }
  1059. case VP8_SPLITMVMODE_16x8:
  1060. vp8_mc_part(s, dst, ref, x_off, y_off,
  1061. 0, 0, 16, 8, width, height, &bmv[0]);
  1062. vp8_mc_part(s, dst, ref, x_off, y_off,
  1063. 0, 8, 16, 8, width, height, &bmv[1]);
  1064. break;
  1065. case VP8_SPLITMVMODE_8x16:
  1066. vp8_mc_part(s, dst, ref, x_off, y_off,
  1067. 0, 0, 8, 16, width, height, &bmv[0]);
  1068. vp8_mc_part(s, dst, ref, x_off, y_off,
  1069. 8, 0, 8, 16, width, height, &bmv[1]);
  1070. break;
  1071. case VP8_SPLITMVMODE_8x8:
  1072. vp8_mc_part(s, dst, ref, x_off, y_off,
  1073. 0, 0, 8, 8, width, height, &bmv[0]);
  1074. vp8_mc_part(s, dst, ref, x_off, y_off,
  1075. 8, 0, 8, 8, width, height, &bmv[1]);
  1076. vp8_mc_part(s, dst, ref, x_off, y_off,
  1077. 0, 8, 8, 8, width, height, &bmv[2]);
  1078. vp8_mc_part(s, dst, ref, x_off, y_off,
  1079. 8, 8, 8, 8, width, height, &bmv[3]);
  1080. break;
  1081. }
  1082. }
  1083. static av_always_inline void idct_mb(VP8Context *s, uint8_t *dst[3], VP8Macroblock *mb)
  1084. {
  1085. int x, y, ch;
  1086. if (mb->mode != MODE_I4x4) {
  1087. uint8_t *y_dst = dst[0];
  1088. for (y = 0; y < 4; y++) {
  1089. uint32_t nnz4 = AV_RN32A(s->non_zero_count_cache[y]);
  1090. if (nnz4) {
  1091. if (nnz4&~0x01010101) {
  1092. for (x = 0; x < 4; x++) {
  1093. int nnz = s->non_zero_count_cache[y][x];
  1094. if (nnz) {
  1095. if (nnz == 1)
  1096. s->vp8dsp.vp8_idct_dc_add(y_dst+4*x, s->block[y][x], s->linesize);
  1097. else
  1098. s->vp8dsp.vp8_idct_add(y_dst+4*x, s->block[y][x], s->linesize);
  1099. }
  1100. }
  1101. } else {
  1102. s->vp8dsp.vp8_idct_dc_add4y(y_dst, s->block[y], s->linesize);
  1103. }
  1104. }
  1105. y_dst += 4*s->linesize;
  1106. }
  1107. }
  1108. for (ch = 0; ch < 2; ch++) {
  1109. uint32_t nnz4 = AV_RN32A(s->non_zero_count_cache[4+ch]);
  1110. if (nnz4) {
  1111. uint8_t *ch_dst = dst[1+ch];
  1112. if (nnz4&~0x01010101) {
  1113. for (y = 0; y < 2; y++) {
  1114. for (x = 0; x < 2; x++) {
  1115. int nnz = s->non_zero_count_cache[4+ch][(y<<1)+x];
  1116. if (nnz) {
  1117. if (nnz == 1)
  1118. s->vp8dsp.vp8_idct_dc_add(ch_dst+4*x, s->block[4+ch][(y<<1)+x], s->uvlinesize);
  1119. else
  1120. s->vp8dsp.vp8_idct_add(ch_dst+4*x, s->block[4+ch][(y<<1)+x], s->uvlinesize);
  1121. }
  1122. }
  1123. ch_dst += 4*s->uvlinesize;
  1124. }
  1125. } else {
  1126. s->vp8dsp.vp8_idct_dc_add4uv(ch_dst, s->block[4+ch], s->uvlinesize);
  1127. }
  1128. }
  1129. }
  1130. }
  1131. static av_always_inline void filter_level_for_mb(VP8Context *s, VP8Macroblock *mb, VP8FilterStrength *f )
  1132. {
  1133. int interior_limit, filter_level;
  1134. if (s->segmentation.enabled) {
  1135. filter_level = s->segmentation.filter_level[s->segment];
  1136. if (!s->segmentation.absolute_vals)
  1137. filter_level += s->filter.level;
  1138. } else
  1139. filter_level = s->filter.level;
  1140. if (s->lf_delta.enabled) {
  1141. filter_level += s->lf_delta.ref[mb->ref_frame];
  1142. if (mb->ref_frame == VP56_FRAME_CURRENT) {
  1143. if (mb->mode == MODE_I4x4)
  1144. filter_level += s->lf_delta.mode[0];
  1145. } else {
  1146. if (mb->mode == VP8_MVMODE_ZERO)
  1147. filter_level += s->lf_delta.mode[1];
  1148. else if (mb->mode == VP8_MVMODE_SPLIT)
  1149. filter_level += s->lf_delta.mode[3];
  1150. else
  1151. filter_level += s->lf_delta.mode[2];
  1152. }
  1153. }
  1154. filter_level = av_clip(filter_level, 0, 63);
  1155. interior_limit = filter_level;
  1156. if (s->filter.sharpness) {
  1157. interior_limit >>= s->filter.sharpness > 4 ? 2 : 1;
  1158. interior_limit = FFMIN(interior_limit, 9 - s->filter.sharpness);
  1159. }
  1160. interior_limit = FFMAX(interior_limit, 1);
  1161. f->filter_level = filter_level;
  1162. f->inner_limit = interior_limit;
  1163. f->inner_filter = !mb->skip || mb->mode == MODE_I4x4 || mb->mode == VP8_MVMODE_SPLIT;
  1164. }
  1165. static av_always_inline void filter_mb(VP8Context *s, uint8_t *dst[3], VP8FilterStrength *f, int mb_x, int mb_y)
  1166. {
  1167. int mbedge_lim, bedge_lim, hev_thresh;
  1168. int filter_level = f->filter_level;
  1169. int inner_limit = f->inner_limit;
  1170. int inner_filter = f->inner_filter;
  1171. int linesize = s->linesize;
  1172. int uvlinesize = s->uvlinesize;
  1173. if (!filter_level)
  1174. return;
  1175. mbedge_lim = 2*(filter_level+2) + inner_limit;
  1176. bedge_lim = 2* filter_level + inner_limit;
  1177. hev_thresh = filter_level >= 15;
  1178. if (s->keyframe) {
  1179. if (filter_level >= 40)
  1180. hev_thresh = 2;
  1181. } else {
  1182. if (filter_level >= 40)
  1183. hev_thresh = 3;
  1184. else if (filter_level >= 20)
  1185. hev_thresh = 2;
  1186. }
  1187. if (mb_x) {
  1188. s->vp8dsp.vp8_h_loop_filter16y(dst[0], linesize,
  1189. mbedge_lim, inner_limit, hev_thresh);
  1190. s->vp8dsp.vp8_h_loop_filter8uv(dst[1], dst[2], uvlinesize,
  1191. mbedge_lim, inner_limit, hev_thresh);
  1192. }
  1193. if (inner_filter) {
  1194. s->vp8dsp.vp8_h_loop_filter16y_inner(dst[0]+ 4, linesize, bedge_lim,
  1195. inner_limit, hev_thresh);
  1196. s->vp8dsp.vp8_h_loop_filter16y_inner(dst[0]+ 8, linesize, bedge_lim,
  1197. inner_limit, hev_thresh);
  1198. s->vp8dsp.vp8_h_loop_filter16y_inner(dst[0]+12, linesize, bedge_lim,
  1199. inner_limit, hev_thresh);
  1200. s->vp8dsp.vp8_h_loop_filter8uv_inner(dst[1] + 4, dst[2] + 4,
  1201. uvlinesize, bedge_lim,
  1202. inner_limit, hev_thresh);
  1203. }
  1204. if (mb_y) {
  1205. s->vp8dsp.vp8_v_loop_filter16y(dst[0], linesize,
  1206. mbedge_lim, inner_limit, hev_thresh);
  1207. s->vp8dsp.vp8_v_loop_filter8uv(dst[1], dst[2], uvlinesize,
  1208. mbedge_lim, inner_limit, hev_thresh);
  1209. }
  1210. if (inner_filter) {
  1211. s->vp8dsp.vp8_v_loop_filter16y_inner(dst[0]+ 4*linesize,
  1212. linesize, bedge_lim,
  1213. inner_limit, hev_thresh);
  1214. s->vp8dsp.vp8_v_loop_filter16y_inner(dst[0]+ 8*linesize,
  1215. linesize, bedge_lim,
  1216. inner_limit, hev_thresh);
  1217. s->vp8dsp.vp8_v_loop_filter16y_inner(dst[0]+12*linesize,
  1218. linesize, bedge_lim,
  1219. inner_limit, hev_thresh);
  1220. s->vp8dsp.vp8_v_loop_filter8uv_inner(dst[1] + 4 * uvlinesize,
  1221. dst[2] + 4 * uvlinesize,
  1222. uvlinesize, bedge_lim,
  1223. inner_limit, hev_thresh);
  1224. }
  1225. }
  1226. static av_always_inline void filter_mb_simple(VP8Context *s, uint8_t *dst, VP8FilterStrength *f, int mb_x, int mb_y)
  1227. {
  1228. int mbedge_lim, bedge_lim;
  1229. int filter_level = f->filter_level;
  1230. int inner_limit = f->inner_limit;
  1231. int inner_filter = f->inner_filter;
  1232. int linesize = s->linesize;
  1233. if (!filter_level)
  1234. return;
  1235. mbedge_lim = 2*(filter_level+2) + inner_limit;
  1236. bedge_lim = 2* filter_level + inner_limit;
  1237. if (mb_x)
  1238. s->vp8dsp.vp8_h_loop_filter_simple(dst, linesize, mbedge_lim);
  1239. if (inner_filter) {
  1240. s->vp8dsp.vp8_h_loop_filter_simple(dst+ 4, linesize, bedge_lim);
  1241. s->vp8dsp.vp8_h_loop_filter_simple(dst+ 8, linesize, bedge_lim);
  1242. s->vp8dsp.vp8_h_loop_filter_simple(dst+12, linesize, bedge_lim);
  1243. }
  1244. if (mb_y)
  1245. s->vp8dsp.vp8_v_loop_filter_simple(dst, linesize, mbedge_lim);
  1246. if (inner_filter) {
  1247. s->vp8dsp.vp8_v_loop_filter_simple(dst+ 4*linesize, linesize, bedge_lim);
  1248. s->vp8dsp.vp8_v_loop_filter_simple(dst+ 8*linesize, linesize, bedge_lim);
  1249. s->vp8dsp.vp8_v_loop_filter_simple(dst+12*linesize, linesize, bedge_lim);
  1250. }
  1251. }
  1252. static void filter_mb_row(VP8Context *s, int mb_y)
  1253. {
  1254. VP8FilterStrength *f = s->filter_strength;
  1255. uint8_t *dst[3] = {
  1256. s->framep[VP56_FRAME_CURRENT]->data[0] + 16*mb_y*s->linesize,
  1257. s->framep[VP56_FRAME_CURRENT]->data[1] + 8*mb_y*s->uvlinesize,
  1258. s->framep[VP56_FRAME_CURRENT]->data[2] + 8*mb_y*s->uvlinesize
  1259. };
  1260. int mb_x;
  1261. for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
  1262. backup_mb_border(s->top_border[mb_x+1], dst[0], dst[1], dst[2], s->linesize, s->uvlinesize, 0);
  1263. filter_mb(s, dst, f++, mb_x, mb_y);
  1264. dst[0] += 16;
  1265. dst[1] += 8;
  1266. dst[2] += 8;
  1267. }
  1268. }
  1269. static void filter_mb_row_simple(VP8Context *s, int mb_y)
  1270. {
  1271. VP8FilterStrength *f = s->filter_strength;
  1272. uint8_t *dst = s->framep[VP56_FRAME_CURRENT]->data[0] + 16*mb_y*s->linesize;
  1273. int mb_x;
  1274. for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
  1275. backup_mb_border(s->top_border[mb_x+1], dst, NULL, NULL, s->linesize, 0, 1);
  1276. filter_mb_simple(s, dst, f++, mb_x, mb_y);
  1277. dst += 16;
  1278. }
  1279. }
  1280. static int vp8_decode_frame(AVCodecContext *avctx, void *data, int *data_size,
  1281. AVPacket *avpkt)
  1282. {
  1283. VP8Context *s = avctx->priv_data;
  1284. int ret, mb_x, mb_y, i, y, referenced;
  1285. enum AVDiscard skip_thresh;
  1286. AVFrame *av_uninit(curframe);
  1287. if ((ret = decode_frame_header(s, avpkt->data, avpkt->size)) < 0)
  1288. return ret;
  1289. referenced = s->update_last || s->update_golden == VP56_FRAME_CURRENT
  1290. || s->update_altref == VP56_FRAME_CURRENT;
  1291. skip_thresh = !referenced ? AVDISCARD_NONREF :
  1292. !s->keyframe ? AVDISCARD_NONKEY : AVDISCARD_ALL;
  1293. if (avctx->skip_frame >= skip_thresh) {
  1294. s->invisible = 1;
  1295. goto skip_decode;
  1296. }
  1297. s->deblock_filter = s->filter.level && avctx->skip_loop_filter < skip_thresh;
  1298. for (i = 0; i < 4; i++)
  1299. if (&s->frames[i] != s->framep[VP56_FRAME_PREVIOUS] &&
  1300. &s->frames[i] != s->framep[VP56_FRAME_GOLDEN] &&
  1301. &s->frames[i] != s->framep[VP56_FRAME_GOLDEN2]) {
  1302. curframe = s->framep[VP56_FRAME_CURRENT] = &s->frames[i];
  1303. break;
  1304. }
  1305. if (curframe->data[0])
  1306. avctx->release_buffer(avctx, curframe);
  1307. curframe->key_frame = s->keyframe;
  1308. curframe->pict_type = s->keyframe ? FF_I_TYPE : FF_P_TYPE;
  1309. curframe->reference = referenced ? 3 : 0;
  1310. if ((ret = avctx->get_buffer(avctx, curframe))) {
  1311. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed!\n");
  1312. return ret;
  1313. }
  1314. // Given that arithmetic probabilities are updated every frame, it's quite likely
  1315. // that the values we have on a random interframe are complete junk if we didn't
  1316. // start decode on a keyframe. So just don't display anything rather than junk.
  1317. if (!s->keyframe && (!s->framep[VP56_FRAME_PREVIOUS] ||
  1318. !s->framep[VP56_FRAME_GOLDEN] ||
  1319. !s->framep[VP56_FRAME_GOLDEN2])) {
  1320. av_log(avctx, AV_LOG_WARNING, "Discarding interframe without a prior keyframe!\n");
  1321. return AVERROR_INVALIDDATA;
  1322. }
  1323. s->linesize = curframe->linesize[0];
  1324. s->uvlinesize = curframe->linesize[1];
  1325. if (!s->edge_emu_buffer)
  1326. s->edge_emu_buffer = av_malloc(21*s->linesize);
  1327. memset(s->top_nnz, 0, s->mb_width*sizeof(*s->top_nnz));
  1328. /* Zero macroblock structures for top/left prediction from outside the frame. */
  1329. memset(s->macroblocks, 0, (s->mb_width + s->mb_height*2)*sizeof(*s->macroblocks));
  1330. // top edge of 127 for intra prediction
  1331. memset(s->top_border, 127, (s->mb_width+1)*sizeof(*s->top_border));
  1332. memset(s->ref_count, 0, sizeof(s->ref_count));
  1333. if (s->keyframe)
  1334. memset(s->intra4x4_pred_mode_top, DC_PRED, s->b4_stride*4);
  1335. for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
  1336. VP56RangeCoder *c = &s->coeff_partition[mb_y & (s->num_coeff_partitions-1)];
  1337. VP8Macroblock *mb = s->macroblocks + (s->mb_height - mb_y - 1)*2;
  1338. uint8_t *segment_map = s->segmentation_map + mb_y*s->mb_stride;
  1339. int mb_xy = mb_y * s->mb_stride;
  1340. uint8_t *dst[3] = {
  1341. curframe->data[0] + 16*mb_y*s->linesize,
  1342. curframe->data[1] + 8*mb_y*s->uvlinesize,
  1343. curframe->data[2] + 8*mb_y*s->uvlinesize
  1344. };
  1345. memset(s->left_nnz, 0, sizeof(s->left_nnz));
  1346. AV_WN32A(s->intra4x4_pred_mode_left, DC_PRED*0x01010101);
  1347. // left edge of 129 for intra prediction
  1348. if (!(avctx->flags & CODEC_FLAG_EMU_EDGE))
  1349. for (i = 0; i < 3; i++)
  1350. for (y = 0; y < 16>>!!i; y++)
  1351. dst[i][y*curframe->linesize[i]-1] = 129;
  1352. if (mb_y)
  1353. memset(s->top_border, 129, sizeof(*s->top_border));
  1354. for (mb_x = 0; mb_x < s->mb_width; mb_x++, mb_xy++, mb++) {
  1355. uint8_t *segment_mb = segment_map+mb_x;
  1356. /* Prefetch the current frame, 4 MBs ahead */
  1357. s->dsp.prefetch(dst[0] + (mb_x&3)*4*s->linesize + 64, s->linesize, 4);
  1358. s->dsp.prefetch(dst[1] + (mb_x&7)*s->uvlinesize + 64, dst[2] - dst[1], 2);
  1359. decode_mb_mode(s, mb, mb_x, mb_y, segment_mb);
  1360. prefetch_motion(s, mb, mb_x, mb_y, mb_xy, VP56_FRAME_PREVIOUS);
  1361. if (!mb->skip)
  1362. decode_mb_coeffs(s, c, mb, s->top_nnz[mb_x], s->left_nnz);
  1363. if (mb->mode <= MODE_I4x4)
  1364. intra_predict(s, dst, mb, mb_x, mb_y);
  1365. else
  1366. inter_predict(s, dst, mb, mb_x, mb_y);
  1367. prefetch_motion(s, mb, mb_x, mb_y, mb_xy, VP56_FRAME_GOLDEN);
  1368. if (!mb->skip) {
  1369. idct_mb(s, dst, mb);
  1370. } else {
  1371. AV_ZERO64(s->left_nnz);
  1372. AV_WN64(s->top_nnz[mb_x], 0); // array of 9, so unaligned
  1373. // Reset DC block predictors if they would exist if the mb had coefficients
  1374. if (mb->mode != MODE_I4x4 && mb->mode != VP8_MVMODE_SPLIT) {
  1375. s->left_nnz[8] = 0;
  1376. s->top_nnz[mb_x][8] = 0;
  1377. }
  1378. }
  1379. if (s->deblock_filter)
  1380. filter_level_for_mb(s, mb, &s->filter_strength[mb_x]);
  1381. prefetch_motion(s, mb, mb_x, mb_y, mb_xy, VP56_FRAME_GOLDEN2);
  1382. dst[0] += 16;
  1383. dst[1] += 8;
  1384. dst[2] += 8;
  1385. }
  1386. if (s->deblock_filter) {
  1387. if (s->filter.simple)
  1388. filter_mb_row_simple(s, mb_y);
  1389. else
  1390. filter_mb_row(s, mb_y);
  1391. }
  1392. }
  1393. skip_decode:
  1394. // if future frames don't use the updated probabilities,
  1395. // reset them to the values we saved
  1396. if (!s->update_probabilities)
  1397. s->prob[0] = s->prob[1];
  1398. // check if golden and altref are swapped
  1399. if (s->update_altref == VP56_FRAME_GOLDEN &&
  1400. s->update_golden == VP56_FRAME_GOLDEN2)
  1401. FFSWAP(AVFrame *, s->framep[VP56_FRAME_GOLDEN], s->framep[VP56_FRAME_GOLDEN2]);
  1402. else {
  1403. if (s->update_altref != VP56_FRAME_NONE)
  1404. s->framep[VP56_FRAME_GOLDEN2] = s->framep[s->update_altref];
  1405. if (s->update_golden != VP56_FRAME_NONE)
  1406. s->framep[VP56_FRAME_GOLDEN] = s->framep[s->update_golden];
  1407. }
  1408. if (s->update_last) // move cur->prev
  1409. s->framep[VP56_FRAME_PREVIOUS] = s->framep[VP56_FRAME_CURRENT];
  1410. // release no longer referenced frames
  1411. for (i = 0; i < 4; i++)
  1412. if (s->frames[i].data[0] &&
  1413. &s->frames[i] != s->framep[VP56_FRAME_CURRENT] &&
  1414. &s->frames[i] != s->framep[VP56_FRAME_PREVIOUS] &&
  1415. &s->frames[i] != s->framep[VP56_FRAME_GOLDEN] &&
  1416. &s->frames[i] != s->framep[VP56_FRAME_GOLDEN2])
  1417. avctx->release_buffer(avctx, &s->frames[i]);
  1418. if (!s->invisible) {
  1419. *(AVFrame*)data = *s->framep[VP56_FRAME_CURRENT];
  1420. *data_size = sizeof(AVFrame);
  1421. }
  1422. return avpkt->size;
  1423. }
  1424. static av_cold int vp8_decode_init(AVCodecContext *avctx)
  1425. {
  1426. VP8Context *s = avctx->priv_data;
  1427. s->avctx = avctx;
  1428. avctx->pix_fmt = PIX_FMT_YUV420P;
  1429. dsputil_init(&s->dsp, avctx);
  1430. ff_h264_pred_init(&s->hpc, CODEC_ID_VP8);
  1431. ff_vp8dsp_init(&s->vp8dsp);
  1432. // intra pred needs edge emulation among other things
  1433. if (avctx->flags&CODEC_FLAG_EMU_EDGE) {
  1434. av_log(avctx, AV_LOG_ERROR, "Edge emulation not supported\n");
  1435. return AVERROR_PATCHWELCOME;
  1436. }
  1437. return 0;
  1438. }
  1439. static av_cold int vp8_decode_free(AVCodecContext *avctx)
  1440. {
  1441. vp8_decode_flush(avctx);
  1442. return 0;
  1443. }
  1444. AVCodec vp8_decoder = {
  1445. "vp8",
  1446. AVMEDIA_TYPE_VIDEO,
  1447. CODEC_ID_VP8,
  1448. sizeof(VP8Context),
  1449. vp8_decode_init,
  1450. NULL,
  1451. vp8_decode_free,
  1452. vp8_decode_frame,
  1453. CODEC_CAP_DR1,
  1454. .flush = vp8_decode_flush,
  1455. .long_name = NULL_IF_CONFIG_SMALL("On2 VP8"),
  1456. };