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.

1692 lines
59KB

  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;
  549. int n, num;
  550. VP8Macroblock *top_mb = &mb[2];
  551. VP8Macroblock *left_mb = &mb[-1];
  552. const uint8_t *mbsplits_left = vp8_mbsplits[left_mb->partitioning],
  553. *mbsplits_top = vp8_mbsplits[top_mb->partitioning],
  554. *mbsplits_cur, *firstidx;
  555. VP56mv *top_mv = top_mb->bmv;
  556. VP56mv *left_mv = left_mb->bmv;
  557. VP56mv *cur_mv = mb->bmv;
  558. if (vp56_rac_get_prob_branchy(c, vp8_mbsplit_prob[0])) {
  559. if (vp56_rac_get_prob_branchy(c, vp8_mbsplit_prob[1])) {
  560. part_idx = VP8_SPLITMVMODE_16x8 + vp56_rac_get_prob(c, vp8_mbsplit_prob[2]);
  561. } else {
  562. part_idx = VP8_SPLITMVMODE_8x8;
  563. }
  564. } else {
  565. part_idx = VP8_SPLITMVMODE_4x4;
  566. }
  567. num = vp8_mbsplit_count[part_idx];
  568. mbsplits_cur = vp8_mbsplits[part_idx],
  569. firstidx = vp8_mbfirstidx[part_idx];
  570. mb->partitioning = part_idx;
  571. for (n = 0; n < num; n++) {
  572. int k = firstidx[n];
  573. uint32_t left, above;
  574. const uint8_t *submv_prob;
  575. if (!(k & 3))
  576. left = AV_RN32A(&left_mv[mbsplits_left[k + 3]]);
  577. else
  578. left = AV_RN32A(&cur_mv[mbsplits_cur[k - 1]]);
  579. if (k <= 3)
  580. above = AV_RN32A(&top_mv[mbsplits_top[k + 12]]);
  581. else
  582. above = AV_RN32A(&cur_mv[mbsplits_cur[k - 4]]);
  583. submv_prob = get_submv_prob(left, above);
  584. if (vp56_rac_get_prob_branchy(c, submv_prob[0])) {
  585. if (vp56_rac_get_prob_branchy(c, submv_prob[1])) {
  586. if (vp56_rac_get_prob_branchy(c, submv_prob[2])) {
  587. mb->bmv[n].y = mb->mv.y + read_mv_component(c, s->prob->mvc[0]);
  588. mb->bmv[n].x = mb->mv.x + read_mv_component(c, s->prob->mvc[1]);
  589. } else {
  590. AV_ZERO32(&mb->bmv[n]);
  591. }
  592. } else {
  593. AV_WN32A(&mb->bmv[n], above);
  594. }
  595. } else {
  596. AV_WN32A(&mb->bmv[n], left);
  597. }
  598. }
  599. return num;
  600. }
  601. static av_always_inline
  602. void decode_intra4x4_modes(VP8Context *s, VP56RangeCoder *c,
  603. int mb_x, int keyframe)
  604. {
  605. uint8_t *intra4x4 = s->intra4x4_pred_mode_mb;
  606. if (keyframe) {
  607. int x, y;
  608. uint8_t* const top = s->intra4x4_pred_mode_top + 4 * mb_x;
  609. uint8_t* const left = s->intra4x4_pred_mode_left;
  610. for (y = 0; y < 4; y++) {
  611. for (x = 0; x < 4; x++) {
  612. const uint8_t *ctx;
  613. ctx = vp8_pred4x4_prob_intra[top[x]][left[y]];
  614. *intra4x4 = vp8_rac_get_tree(c, vp8_pred4x4_tree, ctx);
  615. left[y] = top[x] = *intra4x4;
  616. intra4x4++;
  617. }
  618. }
  619. } else {
  620. int i;
  621. for (i = 0; i < 16; i++)
  622. intra4x4[i] = vp8_rac_get_tree(c, vp8_pred4x4_tree, vp8_pred4x4_prob_inter);
  623. }
  624. }
  625. static av_always_inline
  626. void decode_mb_mode(VP8Context *s, VP8Macroblock *mb, int mb_x, int mb_y, uint8_t *segment)
  627. {
  628. VP56RangeCoder *c = &s->c;
  629. if (s->segmentation.update_map)
  630. *segment = vp8_rac_get_tree(c, vp8_segmentid_tree, s->prob->segmentid);
  631. s->segment = *segment;
  632. mb->skip = s->mbskip_enabled ? vp56_rac_get_prob(c, s->prob->mbskip) : 0;
  633. if (s->keyframe) {
  634. mb->mode = vp8_rac_get_tree(c, vp8_pred16x16_tree_intra, vp8_pred16x16_prob_intra);
  635. if (mb->mode == MODE_I4x4) {
  636. decode_intra4x4_modes(s, c, mb_x, 1);
  637. } else {
  638. const uint32_t modes = vp8_pred4x4_mode[mb->mode] * 0x01010101u;
  639. AV_WN32A(s->intra4x4_pred_mode_top + 4 * mb_x, modes);
  640. AV_WN32A(s->intra4x4_pred_mode_left, modes);
  641. }
  642. s->chroma_pred_mode = vp8_rac_get_tree(c, vp8_pred8x8c_tree, vp8_pred8x8c_prob_intra);
  643. mb->ref_frame = VP56_FRAME_CURRENT;
  644. } else if (vp56_rac_get_prob_branchy(c, s->prob->intra)) {
  645. VP56mv near[2], best;
  646. uint8_t cnt[4] = { 0 };
  647. // inter MB, 16.2
  648. if (vp56_rac_get_prob_branchy(c, s->prob->last))
  649. mb->ref_frame = vp56_rac_get_prob(c, s->prob->golden) ?
  650. VP56_FRAME_GOLDEN2 /* altref */ : VP56_FRAME_GOLDEN;
  651. else
  652. mb->ref_frame = VP56_FRAME_PREVIOUS;
  653. s->ref_count[mb->ref_frame-1]++;
  654. // motion vectors, 16.3
  655. find_near_mvs(s, mb, mb_x, mb_y, near, &best, cnt);
  656. if (vp56_rac_get_prob_branchy(c, vp8_mode_contexts[cnt[0]][0])) {
  657. if (vp56_rac_get_prob_branchy(c, vp8_mode_contexts[cnt[1]][1])) {
  658. if (vp56_rac_get_prob_branchy(c, vp8_mode_contexts[cnt[2]][2])) {
  659. if (vp56_rac_get_prob_branchy(c, vp8_mode_contexts[cnt[3]][3])) {
  660. mb->mode = VP8_MVMODE_SPLIT;
  661. clamp_mv(s, &mb->mv, &mb->mv, mb_x, mb_y);
  662. mb->mv = mb->bmv[decode_splitmvs(s, c, mb) - 1];
  663. } else {
  664. mb->mode = VP8_MVMODE_NEW;
  665. clamp_mv(s, &mb->mv, &mb->mv, mb_x, mb_y);
  666. mb->mv.y += + read_mv_component(c, s->prob->mvc[0]);
  667. mb->mv.x += + read_mv_component(c, s->prob->mvc[1]);
  668. }
  669. } else {
  670. mb->mode = VP8_MVMODE_NEAR;
  671. clamp_mv(s, &mb->mv, &near[1], mb_x, mb_y);
  672. }
  673. } else {
  674. mb->mode = VP8_MVMODE_NEAREST;
  675. clamp_mv(s, &mb->mv, &near[0], mb_x, mb_y);
  676. }
  677. } else {
  678. mb->mode = VP8_MVMODE_ZERO;
  679. AV_ZERO32(&mb->mv);
  680. }
  681. if (mb->mode != VP8_MVMODE_SPLIT) {
  682. mb->partitioning = VP8_SPLITMVMODE_NONE;
  683. mb->bmv[0] = mb->mv;
  684. }
  685. } else {
  686. // intra MB, 16.1
  687. mb->mode = vp8_rac_get_tree(c, vp8_pred16x16_tree_inter, s->prob->pred16x16);
  688. if (mb->mode == MODE_I4x4)
  689. decode_intra4x4_modes(s, c, mb_x, 0);
  690. s->chroma_pred_mode = vp8_rac_get_tree(c, vp8_pred8x8c_tree, s->prob->pred8x8c);
  691. mb->ref_frame = VP56_FRAME_CURRENT;
  692. mb->partitioning = VP8_SPLITMVMODE_NONE;
  693. AV_ZERO32(&mb->bmv[0]);
  694. }
  695. }
  696. /**
  697. * @param c arithmetic bitstream reader context
  698. * @param block destination for block coefficients
  699. * @param probs probabilities to use when reading trees from the bitstream
  700. * @param i initial coeff index, 0 unless a separate DC block is coded
  701. * @param zero_nhood the initial prediction context for number of surrounding
  702. * all-zero blocks (only left/top, so 0-2)
  703. * @param qmul array holding the dc/ac dequant factor at position 0/1
  704. * @return 0 if no coeffs were decoded
  705. * otherwise, the index of the last coeff decoded plus one
  706. */
  707. static int decode_block_coeffs(VP56RangeCoder *c, DCTELEM block[16],
  708. uint8_t probs[8][3][NUM_DCT_TOKENS-1],
  709. int i, int zero_nhood, int16_t qmul[2])
  710. {
  711. uint8_t *token_prob = probs[i][zero_nhood];
  712. int nonzero = 0;
  713. int coeff;
  714. do {
  715. if (!vp56_rac_get_prob_branchy(c, token_prob[0])) // DCT_EOB
  716. return nonzero;
  717. skip_eob:
  718. if (!vp56_rac_get_prob_branchy(c, token_prob[1])) { // DCT_0
  719. if (++i == 16)
  720. return nonzero; // invalid input; blocks should end with EOB
  721. token_prob = probs[i][0];
  722. goto skip_eob;
  723. }
  724. if (!vp56_rac_get_prob_branchy(c, token_prob[2])) { // DCT_1
  725. coeff = 1;
  726. token_prob = probs[i+1][1];
  727. } else {
  728. if (!vp56_rac_get_prob_branchy(c, token_prob[3])) { // DCT 2,3,4
  729. coeff = vp56_rac_get_prob(c, token_prob[4]);
  730. if (coeff)
  731. coeff += vp56_rac_get_prob(c, token_prob[5]);
  732. coeff += 2;
  733. } else {
  734. // DCT_CAT*
  735. if (!vp56_rac_get_prob_branchy(c, token_prob[6])) {
  736. if (!vp56_rac_get_prob_branchy(c, token_prob[7])) { // DCT_CAT1
  737. coeff = 5 + vp56_rac_get_prob(c, vp8_dct_cat1_prob[0]);
  738. } else { // DCT_CAT2
  739. coeff = 7;
  740. coeff += vp56_rac_get_prob(c, vp8_dct_cat2_prob[0]) << 1;
  741. coeff += vp56_rac_get_prob(c, vp8_dct_cat2_prob[1]);
  742. }
  743. } else { // DCT_CAT3 and up
  744. int a = vp56_rac_get_prob(c, token_prob[8]);
  745. int b = vp56_rac_get_prob(c, token_prob[9+a]);
  746. int cat = (a<<1) + b;
  747. coeff = 3 + (8<<cat);
  748. coeff += vp8_rac_get_coeff(c, vp8_dct_cat_prob[cat]);
  749. }
  750. }
  751. token_prob = probs[i+1][2];
  752. }
  753. // todo: full [16] qmat? load into register?
  754. block[zigzag_scan[i]] = (vp8_rac_get(c) ? -coeff : coeff) * qmul[!!i];
  755. nonzero = ++i;
  756. } while (i < 16);
  757. return nonzero;
  758. }
  759. static av_always_inline
  760. void decode_mb_coeffs(VP8Context *s, VP56RangeCoder *c, VP8Macroblock *mb,
  761. uint8_t t_nnz[9], uint8_t l_nnz[9])
  762. {
  763. int i, x, y, luma_start = 0, luma_ctx = 3;
  764. int nnz_pred, nnz, nnz_total = 0;
  765. int segment = s->segment;
  766. int block_dc = 0;
  767. if (mb->mode != MODE_I4x4 && mb->mode != VP8_MVMODE_SPLIT) {
  768. nnz_pred = t_nnz[8] + l_nnz[8];
  769. // decode DC values and do hadamard
  770. nnz = decode_block_coeffs(c, s->block_dc, s->prob->token[1], 0, nnz_pred,
  771. s->qmat[segment].luma_dc_qmul);
  772. l_nnz[8] = t_nnz[8] = !!nnz;
  773. if (nnz) {
  774. nnz_total += nnz;
  775. block_dc = 1;
  776. if (nnz == 1)
  777. s->vp8dsp.vp8_luma_dc_wht_dc(s->block, s->block_dc);
  778. else
  779. s->vp8dsp.vp8_luma_dc_wht(s->block, s->block_dc);
  780. }
  781. luma_start = 1;
  782. luma_ctx = 0;
  783. }
  784. // luma blocks
  785. for (y = 0; y < 4; y++)
  786. for (x = 0; x < 4; x++) {
  787. nnz_pred = l_nnz[y] + t_nnz[x];
  788. nnz = decode_block_coeffs(c, s->block[y][x], s->prob->token[luma_ctx], luma_start,
  789. nnz_pred, s->qmat[segment].luma_qmul);
  790. // nnz+block_dc may be one more than the actual last index, but we don't care
  791. s->non_zero_count_cache[y][x] = nnz + block_dc;
  792. t_nnz[x] = l_nnz[y] = !!nnz;
  793. nnz_total += nnz;
  794. }
  795. // chroma blocks
  796. // TODO: what to do about dimensions? 2nd dim for luma is x,
  797. // but for chroma it's (y<<1)|x
  798. for (i = 4; i < 6; i++)
  799. for (y = 0; y < 2; y++)
  800. for (x = 0; x < 2; x++) {
  801. nnz_pred = l_nnz[i+2*y] + t_nnz[i+2*x];
  802. nnz = decode_block_coeffs(c, s->block[i][(y<<1)+x], s->prob->token[2], 0,
  803. nnz_pred, s->qmat[segment].chroma_qmul);
  804. s->non_zero_count_cache[i][(y<<1)+x] = nnz;
  805. t_nnz[i+2*x] = l_nnz[i+2*y] = !!nnz;
  806. nnz_total += nnz;
  807. }
  808. // if there were no coded coeffs despite the macroblock not being marked skip,
  809. // we MUST not do the inner loop filter and should not do IDCT
  810. // Since skip isn't used for bitstream prediction, just manually set it.
  811. if (!nnz_total)
  812. mb->skip = 1;
  813. }
  814. static av_always_inline
  815. void backup_mb_border(uint8_t *top_border, uint8_t *src_y, uint8_t *src_cb, uint8_t *src_cr,
  816. int linesize, int uvlinesize, int simple)
  817. {
  818. AV_COPY128(top_border, src_y + 15*linesize);
  819. if (!simple) {
  820. AV_COPY64(top_border+16, src_cb + 7*uvlinesize);
  821. AV_COPY64(top_border+24, src_cr + 7*uvlinesize);
  822. }
  823. }
  824. static av_always_inline
  825. void xchg_mb_border(uint8_t *top_border, uint8_t *src_y, uint8_t *src_cb, uint8_t *src_cr,
  826. int linesize, int uvlinesize, int mb_x, int mb_y, int mb_width,
  827. int simple, int xchg)
  828. {
  829. uint8_t *top_border_m1 = top_border-32; // for TL prediction
  830. src_y -= linesize;
  831. src_cb -= uvlinesize;
  832. src_cr -= uvlinesize;
  833. #define XCHG(a,b,xchg) do { \
  834. if (xchg) AV_SWAP64(b,a); \
  835. else AV_COPY64(b,a); \
  836. } while (0)
  837. XCHG(top_border_m1+8, src_y-8, xchg);
  838. XCHG(top_border, src_y, xchg);
  839. XCHG(top_border+8, src_y+8, 1);
  840. if (mb_x < mb_width-1)
  841. XCHG(top_border+32, src_y+16, 1);
  842. // only copy chroma for normal loop filter
  843. // or to initialize the top row to 127
  844. if (!simple || !mb_y) {
  845. XCHG(top_border_m1+16, src_cb-8, xchg);
  846. XCHG(top_border_m1+24, src_cr-8, xchg);
  847. XCHG(top_border+16, src_cb, 1);
  848. XCHG(top_border+24, src_cr, 1);
  849. }
  850. }
  851. static av_always_inline
  852. int check_intra_pred_mode(int mode, int mb_x, int mb_y)
  853. {
  854. if (mode == DC_PRED8x8) {
  855. if (!mb_x) {
  856. mode = mb_y ? TOP_DC_PRED8x8 : DC_128_PRED8x8;
  857. } else if (!mb_y) {
  858. mode = LEFT_DC_PRED8x8;
  859. }
  860. }
  861. return mode;
  862. }
  863. static av_always_inline
  864. void intra_predict(VP8Context *s, uint8_t *dst[3], VP8Macroblock *mb,
  865. int mb_x, int mb_y)
  866. {
  867. int x, y, mode, nnz, tr;
  868. // for the first row, we need to run xchg_mb_border to init the top edge to 127
  869. // otherwise, skip it if we aren't going to deblock
  870. if (s->deblock_filter || !mb_y)
  871. xchg_mb_border(s->top_border[mb_x+1], dst[0], dst[1], dst[2],
  872. s->linesize, s->uvlinesize, mb_x, mb_y, s->mb_width,
  873. s->filter.simple, 1);
  874. if (mb->mode < MODE_I4x4) {
  875. mode = check_intra_pred_mode(mb->mode, mb_x, mb_y);
  876. s->hpc.pred16x16[mode](dst[0], s->linesize);
  877. } else {
  878. uint8_t *ptr = dst[0];
  879. uint8_t *intra4x4 = s->intra4x4_pred_mode_mb;
  880. // all blocks on the right edge of the macroblock use bottom edge
  881. // the top macroblock for their topright edge
  882. uint8_t *tr_right = ptr - s->linesize + 16;
  883. // if we're on the right edge of the frame, said edge is extended
  884. // from the top macroblock
  885. if (mb_x == s->mb_width-1) {
  886. tr = tr_right[-1]*0x01010101;
  887. tr_right = (uint8_t *)&tr;
  888. }
  889. if (mb->skip)
  890. AV_ZERO128(s->non_zero_count_cache);
  891. for (y = 0; y < 4; y++) {
  892. uint8_t *topright = ptr + 4 - s->linesize;
  893. for (x = 0; x < 4; x++) {
  894. if (x == 3)
  895. topright = tr_right;
  896. s->hpc.pred4x4[intra4x4[x]](ptr+4*x, topright, s->linesize);
  897. nnz = s->non_zero_count_cache[y][x];
  898. if (nnz) {
  899. if (nnz == 1)
  900. s->vp8dsp.vp8_idct_dc_add(ptr+4*x, s->block[y][x], s->linesize);
  901. else
  902. s->vp8dsp.vp8_idct_add(ptr+4*x, s->block[y][x], s->linesize);
  903. }
  904. topright += 4;
  905. }
  906. ptr += 4*s->linesize;
  907. intra4x4 += 4;
  908. }
  909. }
  910. mode = check_intra_pred_mode(s->chroma_pred_mode, mb_x, mb_y);
  911. s->hpc.pred8x8[mode](dst[1], s->uvlinesize);
  912. s->hpc.pred8x8[mode](dst[2], s->uvlinesize);
  913. if (s->deblock_filter || !mb_y)
  914. xchg_mb_border(s->top_border[mb_x+1], dst[0], dst[1], dst[2],
  915. s->linesize, s->uvlinesize, mb_x, mb_y, s->mb_width,
  916. s->filter.simple, 0);
  917. }
  918. /**
  919. * Generic MC function.
  920. *
  921. * @param s VP8 decoding context
  922. * @param luma 1 for luma (Y) planes, 0 for chroma (Cb/Cr) planes
  923. * @param dst target buffer for block data at block position
  924. * @param src reference picture buffer at origin (0, 0)
  925. * @param mv motion vector (relative to block position) to get pixel data from
  926. * @param x_off horizontal position of block from origin (0, 0)
  927. * @param y_off vertical position of block from origin (0, 0)
  928. * @param block_w width of block (16, 8 or 4)
  929. * @param block_h height of block (always same as block_w)
  930. * @param width width of src/dst plane data
  931. * @param height height of src/dst plane data
  932. * @param linesize size of a single line of plane data, including padding
  933. * @param mc_func motion compensation function pointers (bilinear or sixtap MC)
  934. */
  935. static av_always_inline
  936. void vp8_mc(VP8Context *s, int luma,
  937. uint8_t *dst, uint8_t *src, const VP56mv *mv,
  938. int x_off, int y_off, int block_w, int block_h,
  939. int width, int height, int linesize,
  940. vp8_mc_func mc_func[3][3])
  941. {
  942. if (AV_RN32A(mv)) {
  943. static const uint8_t idx[8] = { 0, 1, 2, 1, 2, 1, 2, 1 };
  944. int mx = (mv->x << luma)&7, mx_idx = idx[mx];
  945. int my = (mv->y << luma)&7, my_idx = idx[my];
  946. x_off += mv->x >> (3 - luma);
  947. y_off += mv->y >> (3 - luma);
  948. // edge emulation
  949. src += y_off * linesize + x_off;
  950. if (x_off < 2 || x_off >= width - block_w - 3 ||
  951. y_off < 2 || y_off >= height - block_h - 3) {
  952. ff_emulated_edge_mc(s->edge_emu_buffer, src - 2 * linesize - 2, linesize,
  953. block_w + 5, block_h + 5,
  954. x_off - 2, y_off - 2, width, height);
  955. src = s->edge_emu_buffer + 2 + linesize * 2;
  956. }
  957. mc_func[my_idx][mx_idx](dst, linesize, src, linesize, block_h, mx, my);
  958. } else
  959. mc_func[0][0](dst, linesize, src + y_off * linesize + x_off, linesize, block_h, 0, 0);
  960. }
  961. static av_always_inline
  962. void vp8_mc_part(VP8Context *s, uint8_t *dst[3],
  963. AVFrame *ref_frame, int x_off, int y_off,
  964. int bx_off, int by_off,
  965. int block_w, int block_h,
  966. int width, int height, VP56mv *mv)
  967. {
  968. VP56mv uvmv = *mv;
  969. /* Y */
  970. vp8_mc(s, 1, dst[0] + by_off * s->linesize + bx_off,
  971. ref_frame->data[0], mv, x_off + bx_off, y_off + by_off,
  972. block_w, block_h, width, height, s->linesize,
  973. s->put_pixels_tab[block_w == 8]);
  974. /* U/V */
  975. if (s->profile == 3) {
  976. uvmv.x &= ~7;
  977. uvmv.y &= ~7;
  978. }
  979. x_off >>= 1; y_off >>= 1;
  980. bx_off >>= 1; by_off >>= 1;
  981. width >>= 1; height >>= 1;
  982. block_w >>= 1; block_h >>= 1;
  983. vp8_mc(s, 0, dst[1] + by_off * s->uvlinesize + bx_off,
  984. ref_frame->data[1], &uvmv, x_off + bx_off, y_off + by_off,
  985. block_w, block_h, width, height, s->uvlinesize,
  986. s->put_pixels_tab[1 + (block_w == 4)]);
  987. vp8_mc(s, 0, dst[2] + by_off * s->uvlinesize + bx_off,
  988. ref_frame->data[2], &uvmv, x_off + bx_off, y_off + by_off,
  989. block_w, block_h, width, height, s->uvlinesize,
  990. s->put_pixels_tab[1 + (block_w == 4)]);
  991. }
  992. /* Fetch pixels for estimated mv 4 macroblocks ahead.
  993. * Optimized for 64-byte cache lines. Inspired by ffh264 prefetch_motion. */
  994. static av_always_inline void prefetch_motion(VP8Context *s, VP8Macroblock *mb, int mb_x, int mb_y, int mb_xy, int ref)
  995. {
  996. /* Don't prefetch refs that haven't been used very often this frame. */
  997. if (s->ref_count[ref-1] > (mb_xy >> 5)) {
  998. int x_off = mb_x << 4, y_off = mb_y << 4;
  999. int mx = mb->mv.x + x_off + 8;
  1000. int my = mb->mv.y + y_off;
  1001. uint8_t **src= s->framep[ref]->data;
  1002. int off= mx + (my + (mb_x&3)*4)*s->linesize + 64;
  1003. s->dsp.prefetch(src[0]+off, s->linesize, 4);
  1004. off= (mx>>1) + ((my>>1) + (mb_x&7))*s->uvlinesize + 64;
  1005. s->dsp.prefetch(src[1]+off, src[2]-src[1], 2);
  1006. }
  1007. }
  1008. /**
  1009. * Apply motion vectors to prediction buffer, chapter 18.
  1010. */
  1011. static av_always_inline
  1012. void inter_predict(VP8Context *s, uint8_t *dst[3], VP8Macroblock *mb,
  1013. int mb_x, int mb_y)
  1014. {
  1015. int x_off = mb_x << 4, y_off = mb_y << 4;
  1016. int width = 16*s->mb_width, height = 16*s->mb_height;
  1017. AVFrame *ref = s->framep[mb->ref_frame];
  1018. VP56mv *bmv = mb->bmv;
  1019. if (mb->mode < VP8_MVMODE_SPLIT) {
  1020. vp8_mc_part(s, dst, ref, x_off, y_off,
  1021. 0, 0, 16, 16, width, height, &mb->mv);
  1022. } else switch (mb->partitioning) {
  1023. case VP8_SPLITMVMODE_4x4: {
  1024. int x, y;
  1025. VP56mv uvmv;
  1026. /* Y */
  1027. for (y = 0; y < 4; y++) {
  1028. for (x = 0; x < 4; x++) {
  1029. vp8_mc(s, 1, dst[0] + 4*y*s->linesize + x*4,
  1030. ref->data[0], &bmv[4*y + x],
  1031. 4*x + x_off, 4*y + y_off, 4, 4,
  1032. width, height, s->linesize,
  1033. s->put_pixels_tab[2]);
  1034. }
  1035. }
  1036. /* U/V */
  1037. x_off >>= 1; y_off >>= 1; width >>= 1; height >>= 1;
  1038. for (y = 0; y < 2; y++) {
  1039. for (x = 0; x < 2; x++) {
  1040. uvmv.x = mb->bmv[ 2*y * 4 + 2*x ].x +
  1041. mb->bmv[ 2*y * 4 + 2*x+1].x +
  1042. mb->bmv[(2*y+1) * 4 + 2*x ].x +
  1043. mb->bmv[(2*y+1) * 4 + 2*x+1].x;
  1044. uvmv.y = mb->bmv[ 2*y * 4 + 2*x ].y +
  1045. mb->bmv[ 2*y * 4 + 2*x+1].y +
  1046. mb->bmv[(2*y+1) * 4 + 2*x ].y +
  1047. mb->bmv[(2*y+1) * 4 + 2*x+1].y;
  1048. uvmv.x = (uvmv.x + 2 + (uvmv.x >> (INT_BIT-1))) >> 2;
  1049. uvmv.y = (uvmv.y + 2 + (uvmv.y >> (INT_BIT-1))) >> 2;
  1050. if (s->profile == 3) {
  1051. uvmv.x &= ~7;
  1052. uvmv.y &= ~7;
  1053. }
  1054. vp8_mc(s, 0, dst[1] + 4*y*s->uvlinesize + x*4,
  1055. ref->data[1], &uvmv,
  1056. 4*x + x_off, 4*y + y_off, 4, 4,
  1057. width, height, s->uvlinesize,
  1058. s->put_pixels_tab[2]);
  1059. vp8_mc(s, 0, dst[2] + 4*y*s->uvlinesize + x*4,
  1060. ref->data[2], &uvmv,
  1061. 4*x + x_off, 4*y + y_off, 4, 4,
  1062. width, height, s->uvlinesize,
  1063. s->put_pixels_tab[2]);
  1064. }
  1065. }
  1066. break;
  1067. }
  1068. case VP8_SPLITMVMODE_16x8:
  1069. vp8_mc_part(s, dst, ref, x_off, y_off,
  1070. 0, 0, 16, 8, width, height, &bmv[0]);
  1071. vp8_mc_part(s, dst, ref, x_off, y_off,
  1072. 0, 8, 16, 8, width, height, &bmv[1]);
  1073. break;
  1074. case VP8_SPLITMVMODE_8x16:
  1075. vp8_mc_part(s, dst, ref, x_off, y_off,
  1076. 0, 0, 8, 16, width, height, &bmv[0]);
  1077. vp8_mc_part(s, dst, ref, x_off, y_off,
  1078. 8, 0, 8, 16, width, height, &bmv[1]);
  1079. break;
  1080. case VP8_SPLITMVMODE_8x8:
  1081. vp8_mc_part(s, dst, ref, x_off, y_off,
  1082. 0, 0, 8, 8, width, height, &bmv[0]);
  1083. vp8_mc_part(s, dst, ref, x_off, y_off,
  1084. 8, 0, 8, 8, width, height, &bmv[1]);
  1085. vp8_mc_part(s, dst, ref, x_off, y_off,
  1086. 0, 8, 8, 8, width, height, &bmv[2]);
  1087. vp8_mc_part(s, dst, ref, x_off, y_off,
  1088. 8, 8, 8, 8, width, height, &bmv[3]);
  1089. break;
  1090. }
  1091. }
  1092. static av_always_inline void idct_mb(VP8Context *s, uint8_t *dst[3], VP8Macroblock *mb)
  1093. {
  1094. int x, y, ch;
  1095. if (mb->mode != MODE_I4x4) {
  1096. uint8_t *y_dst = dst[0];
  1097. for (y = 0; y < 4; y++) {
  1098. uint32_t nnz4 = AV_RN32A(s->non_zero_count_cache[y]);
  1099. if (nnz4) {
  1100. if (nnz4&~0x01010101) {
  1101. for (x = 0; x < 4; x++) {
  1102. int nnz = s->non_zero_count_cache[y][x];
  1103. if (nnz) {
  1104. if (nnz == 1)
  1105. s->vp8dsp.vp8_idct_dc_add(y_dst+4*x, s->block[y][x], s->linesize);
  1106. else
  1107. s->vp8dsp.vp8_idct_add(y_dst+4*x, s->block[y][x], s->linesize);
  1108. }
  1109. }
  1110. } else {
  1111. s->vp8dsp.vp8_idct_dc_add4y(y_dst, s->block[y], s->linesize);
  1112. }
  1113. }
  1114. y_dst += 4*s->linesize;
  1115. }
  1116. }
  1117. for (ch = 0; ch < 2; ch++) {
  1118. uint32_t nnz4 = AV_RN32A(s->non_zero_count_cache[4+ch]);
  1119. if (nnz4) {
  1120. uint8_t *ch_dst = dst[1+ch];
  1121. if (nnz4&~0x01010101) {
  1122. for (y = 0; y < 2; y++) {
  1123. for (x = 0; x < 2; x++) {
  1124. int nnz = s->non_zero_count_cache[4+ch][(y<<1)+x];
  1125. if (nnz) {
  1126. if (nnz == 1)
  1127. s->vp8dsp.vp8_idct_dc_add(ch_dst+4*x, s->block[4+ch][(y<<1)+x], s->uvlinesize);
  1128. else
  1129. s->vp8dsp.vp8_idct_add(ch_dst+4*x, s->block[4+ch][(y<<1)+x], s->uvlinesize);
  1130. }
  1131. }
  1132. ch_dst += 4*s->uvlinesize;
  1133. }
  1134. } else {
  1135. s->vp8dsp.vp8_idct_dc_add4uv(ch_dst, s->block[4+ch], s->uvlinesize);
  1136. }
  1137. }
  1138. }
  1139. }
  1140. static av_always_inline void filter_level_for_mb(VP8Context *s, VP8Macroblock *mb, VP8FilterStrength *f )
  1141. {
  1142. int interior_limit, filter_level;
  1143. if (s->segmentation.enabled) {
  1144. filter_level = s->segmentation.filter_level[s->segment];
  1145. if (!s->segmentation.absolute_vals)
  1146. filter_level += s->filter.level;
  1147. } else
  1148. filter_level = s->filter.level;
  1149. if (s->lf_delta.enabled) {
  1150. filter_level += s->lf_delta.ref[mb->ref_frame];
  1151. if (mb->ref_frame == VP56_FRAME_CURRENT) {
  1152. if (mb->mode == MODE_I4x4)
  1153. filter_level += s->lf_delta.mode[0];
  1154. } else {
  1155. if (mb->mode == VP8_MVMODE_ZERO)
  1156. filter_level += s->lf_delta.mode[1];
  1157. else if (mb->mode == VP8_MVMODE_SPLIT)
  1158. filter_level += s->lf_delta.mode[3];
  1159. else
  1160. filter_level += s->lf_delta.mode[2];
  1161. }
  1162. }
  1163. filter_level = av_clip(filter_level, 0, 63);
  1164. interior_limit = filter_level;
  1165. if (s->filter.sharpness) {
  1166. interior_limit >>= s->filter.sharpness > 4 ? 2 : 1;
  1167. interior_limit = FFMIN(interior_limit, 9 - s->filter.sharpness);
  1168. }
  1169. interior_limit = FFMAX(interior_limit, 1);
  1170. f->filter_level = filter_level;
  1171. f->inner_limit = interior_limit;
  1172. f->inner_filter = !mb->skip || mb->mode == MODE_I4x4 || mb->mode == VP8_MVMODE_SPLIT;
  1173. }
  1174. static av_always_inline void filter_mb(VP8Context *s, uint8_t *dst[3], VP8FilterStrength *f, int mb_x, int mb_y)
  1175. {
  1176. int mbedge_lim, bedge_lim, hev_thresh;
  1177. int filter_level = f->filter_level;
  1178. int inner_limit = f->inner_limit;
  1179. int inner_filter = f->inner_filter;
  1180. int linesize = s->linesize;
  1181. int uvlinesize = s->uvlinesize;
  1182. if (!filter_level)
  1183. return;
  1184. mbedge_lim = 2*(filter_level+2) + inner_limit;
  1185. bedge_lim = 2* filter_level + inner_limit;
  1186. hev_thresh = filter_level >= 15;
  1187. if (s->keyframe) {
  1188. if (filter_level >= 40)
  1189. hev_thresh = 2;
  1190. } else {
  1191. if (filter_level >= 40)
  1192. hev_thresh = 3;
  1193. else if (filter_level >= 20)
  1194. hev_thresh = 2;
  1195. }
  1196. if (mb_x) {
  1197. s->vp8dsp.vp8_h_loop_filter16y(dst[0], linesize,
  1198. mbedge_lim, inner_limit, hev_thresh);
  1199. s->vp8dsp.vp8_h_loop_filter8uv(dst[1], dst[2], uvlinesize,
  1200. mbedge_lim, inner_limit, hev_thresh);
  1201. }
  1202. if (inner_filter) {
  1203. s->vp8dsp.vp8_h_loop_filter16y_inner(dst[0]+ 4, linesize, bedge_lim,
  1204. inner_limit, hev_thresh);
  1205. s->vp8dsp.vp8_h_loop_filter16y_inner(dst[0]+ 8, linesize, bedge_lim,
  1206. inner_limit, hev_thresh);
  1207. s->vp8dsp.vp8_h_loop_filter16y_inner(dst[0]+12, linesize, bedge_lim,
  1208. inner_limit, hev_thresh);
  1209. s->vp8dsp.vp8_h_loop_filter8uv_inner(dst[1] + 4, dst[2] + 4,
  1210. uvlinesize, bedge_lim,
  1211. inner_limit, hev_thresh);
  1212. }
  1213. if (mb_y) {
  1214. s->vp8dsp.vp8_v_loop_filter16y(dst[0], linesize,
  1215. mbedge_lim, inner_limit, hev_thresh);
  1216. s->vp8dsp.vp8_v_loop_filter8uv(dst[1], dst[2], uvlinesize,
  1217. mbedge_lim, inner_limit, hev_thresh);
  1218. }
  1219. if (inner_filter) {
  1220. s->vp8dsp.vp8_v_loop_filter16y_inner(dst[0]+ 4*linesize,
  1221. linesize, bedge_lim,
  1222. inner_limit, hev_thresh);
  1223. s->vp8dsp.vp8_v_loop_filter16y_inner(dst[0]+ 8*linesize,
  1224. linesize, bedge_lim,
  1225. inner_limit, hev_thresh);
  1226. s->vp8dsp.vp8_v_loop_filter16y_inner(dst[0]+12*linesize,
  1227. linesize, bedge_lim,
  1228. inner_limit, hev_thresh);
  1229. s->vp8dsp.vp8_v_loop_filter8uv_inner(dst[1] + 4 * uvlinesize,
  1230. dst[2] + 4 * uvlinesize,
  1231. uvlinesize, bedge_lim,
  1232. inner_limit, hev_thresh);
  1233. }
  1234. }
  1235. static av_always_inline void filter_mb_simple(VP8Context *s, uint8_t *dst, VP8FilterStrength *f, int mb_x, int mb_y)
  1236. {
  1237. int mbedge_lim, bedge_lim;
  1238. int filter_level = f->filter_level;
  1239. int inner_limit = f->inner_limit;
  1240. int inner_filter = f->inner_filter;
  1241. int linesize = s->linesize;
  1242. if (!filter_level)
  1243. return;
  1244. mbedge_lim = 2*(filter_level+2) + inner_limit;
  1245. bedge_lim = 2* filter_level + inner_limit;
  1246. if (mb_x)
  1247. s->vp8dsp.vp8_h_loop_filter_simple(dst, linesize, mbedge_lim);
  1248. if (inner_filter) {
  1249. s->vp8dsp.vp8_h_loop_filter_simple(dst+ 4, linesize, bedge_lim);
  1250. s->vp8dsp.vp8_h_loop_filter_simple(dst+ 8, linesize, bedge_lim);
  1251. s->vp8dsp.vp8_h_loop_filter_simple(dst+12, linesize, bedge_lim);
  1252. }
  1253. if (mb_y)
  1254. s->vp8dsp.vp8_v_loop_filter_simple(dst, linesize, mbedge_lim);
  1255. if (inner_filter) {
  1256. s->vp8dsp.vp8_v_loop_filter_simple(dst+ 4*linesize, linesize, bedge_lim);
  1257. s->vp8dsp.vp8_v_loop_filter_simple(dst+ 8*linesize, linesize, bedge_lim);
  1258. s->vp8dsp.vp8_v_loop_filter_simple(dst+12*linesize, linesize, bedge_lim);
  1259. }
  1260. }
  1261. static void filter_mb_row(VP8Context *s, int mb_y)
  1262. {
  1263. VP8FilterStrength *f = s->filter_strength;
  1264. uint8_t *dst[3] = {
  1265. s->framep[VP56_FRAME_CURRENT]->data[0] + 16*mb_y*s->linesize,
  1266. s->framep[VP56_FRAME_CURRENT]->data[1] + 8*mb_y*s->uvlinesize,
  1267. s->framep[VP56_FRAME_CURRENT]->data[2] + 8*mb_y*s->uvlinesize
  1268. };
  1269. int mb_x;
  1270. for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
  1271. backup_mb_border(s->top_border[mb_x+1], dst[0], dst[1], dst[2], s->linesize, s->uvlinesize, 0);
  1272. filter_mb(s, dst, f++, mb_x, mb_y);
  1273. dst[0] += 16;
  1274. dst[1] += 8;
  1275. dst[2] += 8;
  1276. }
  1277. }
  1278. static void filter_mb_row_simple(VP8Context *s, int mb_y)
  1279. {
  1280. VP8FilterStrength *f = s->filter_strength;
  1281. uint8_t *dst = s->framep[VP56_FRAME_CURRENT]->data[0] + 16*mb_y*s->linesize;
  1282. int mb_x;
  1283. for (mb_x = 0; mb_x < s->mb_width; mb_x++) {
  1284. backup_mb_border(s->top_border[mb_x+1], dst, NULL, NULL, s->linesize, 0, 1);
  1285. filter_mb_simple(s, dst, f++, mb_x, mb_y);
  1286. dst += 16;
  1287. }
  1288. }
  1289. static int vp8_decode_frame(AVCodecContext *avctx, void *data, int *data_size,
  1290. AVPacket *avpkt)
  1291. {
  1292. VP8Context *s = avctx->priv_data;
  1293. int ret, mb_x, mb_y, i, y, referenced;
  1294. enum AVDiscard skip_thresh;
  1295. AVFrame *av_uninit(curframe);
  1296. if ((ret = decode_frame_header(s, avpkt->data, avpkt->size)) < 0)
  1297. return ret;
  1298. referenced = s->update_last || s->update_golden == VP56_FRAME_CURRENT
  1299. || s->update_altref == VP56_FRAME_CURRENT;
  1300. skip_thresh = !referenced ? AVDISCARD_NONREF :
  1301. !s->keyframe ? AVDISCARD_NONKEY : AVDISCARD_ALL;
  1302. if (avctx->skip_frame >= skip_thresh) {
  1303. s->invisible = 1;
  1304. goto skip_decode;
  1305. }
  1306. s->deblock_filter = s->filter.level && avctx->skip_loop_filter < skip_thresh;
  1307. for (i = 0; i < 4; i++)
  1308. if (&s->frames[i] != s->framep[VP56_FRAME_PREVIOUS] &&
  1309. &s->frames[i] != s->framep[VP56_FRAME_GOLDEN] &&
  1310. &s->frames[i] != s->framep[VP56_FRAME_GOLDEN2]) {
  1311. curframe = s->framep[VP56_FRAME_CURRENT] = &s->frames[i];
  1312. break;
  1313. }
  1314. if (curframe->data[0])
  1315. avctx->release_buffer(avctx, curframe);
  1316. curframe->key_frame = s->keyframe;
  1317. curframe->pict_type = s->keyframe ? FF_I_TYPE : FF_P_TYPE;
  1318. curframe->reference = referenced ? 3 : 0;
  1319. if ((ret = avctx->get_buffer(avctx, curframe))) {
  1320. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed!\n");
  1321. return ret;
  1322. }
  1323. // Given that arithmetic probabilities are updated every frame, it's quite likely
  1324. // that the values we have on a random interframe are complete junk if we didn't
  1325. // start decode on a keyframe. So just don't display anything rather than junk.
  1326. if (!s->keyframe && (!s->framep[VP56_FRAME_PREVIOUS] ||
  1327. !s->framep[VP56_FRAME_GOLDEN] ||
  1328. !s->framep[VP56_FRAME_GOLDEN2])) {
  1329. av_log(avctx, AV_LOG_WARNING, "Discarding interframe without a prior keyframe!\n");
  1330. return AVERROR_INVALIDDATA;
  1331. }
  1332. s->linesize = curframe->linesize[0];
  1333. s->uvlinesize = curframe->linesize[1];
  1334. if (!s->edge_emu_buffer)
  1335. s->edge_emu_buffer = av_malloc(21*s->linesize);
  1336. memset(s->top_nnz, 0, s->mb_width*sizeof(*s->top_nnz));
  1337. /* Zero macroblock structures for top/left prediction from outside the frame. */
  1338. memset(s->macroblocks, 0, (s->mb_width + s->mb_height*2)*sizeof(*s->macroblocks));
  1339. // top edge of 127 for intra prediction
  1340. memset(s->top_border, 127, (s->mb_width+1)*sizeof(*s->top_border));
  1341. memset(s->ref_count, 0, sizeof(s->ref_count));
  1342. if (s->keyframe)
  1343. memset(s->intra4x4_pred_mode_top, DC_PRED, s->b4_stride*4);
  1344. for (mb_y = 0; mb_y < s->mb_height; mb_y++) {
  1345. VP56RangeCoder *c = &s->coeff_partition[mb_y & (s->num_coeff_partitions-1)];
  1346. VP8Macroblock *mb = s->macroblocks + (s->mb_height - mb_y - 1)*2;
  1347. uint8_t *segment_map = s->segmentation_map + mb_y*s->mb_stride;
  1348. int mb_xy = mb_y * s->mb_stride;
  1349. uint8_t *dst[3] = {
  1350. curframe->data[0] + 16*mb_y*s->linesize,
  1351. curframe->data[1] + 8*mb_y*s->uvlinesize,
  1352. curframe->data[2] + 8*mb_y*s->uvlinesize
  1353. };
  1354. memset(s->left_nnz, 0, sizeof(s->left_nnz));
  1355. AV_WN32A(s->intra4x4_pred_mode_left, DC_PRED*0x01010101);
  1356. // left edge of 129 for intra prediction
  1357. if (!(avctx->flags & CODEC_FLAG_EMU_EDGE))
  1358. for (i = 0; i < 3; i++)
  1359. for (y = 0; y < 16>>!!i; y++)
  1360. dst[i][y*curframe->linesize[i]-1] = 129;
  1361. if (mb_y)
  1362. memset(s->top_border, 129, sizeof(*s->top_border));
  1363. for (mb_x = 0; mb_x < s->mb_width; mb_x++, mb_xy++, mb++) {
  1364. uint8_t *segment_mb = segment_map+mb_x;
  1365. /* Prefetch the current frame, 4 MBs ahead */
  1366. s->dsp.prefetch(dst[0] + (mb_x&3)*4*s->linesize + 64, s->linesize, 4);
  1367. s->dsp.prefetch(dst[1] + (mb_x&7)*s->uvlinesize + 64, dst[2] - dst[1], 2);
  1368. decode_mb_mode(s, mb, mb_x, mb_y, segment_mb);
  1369. prefetch_motion(s, mb, mb_x, mb_y, mb_xy, VP56_FRAME_PREVIOUS);
  1370. if (!mb->skip)
  1371. decode_mb_coeffs(s, c, mb, s->top_nnz[mb_x], s->left_nnz);
  1372. if (mb->mode <= MODE_I4x4)
  1373. intra_predict(s, dst, mb, mb_x, mb_y);
  1374. else
  1375. inter_predict(s, dst, mb, mb_x, mb_y);
  1376. prefetch_motion(s, mb, mb_x, mb_y, mb_xy, VP56_FRAME_GOLDEN);
  1377. if (!mb->skip) {
  1378. idct_mb(s, dst, mb);
  1379. } else {
  1380. AV_ZERO64(s->left_nnz);
  1381. AV_WN64(s->top_nnz[mb_x], 0); // array of 9, so unaligned
  1382. // Reset DC block predictors if they would exist if the mb had coefficients
  1383. if (mb->mode != MODE_I4x4 && mb->mode != VP8_MVMODE_SPLIT) {
  1384. s->left_nnz[8] = 0;
  1385. s->top_nnz[mb_x][8] = 0;
  1386. }
  1387. }
  1388. if (s->deblock_filter)
  1389. filter_level_for_mb(s, mb, &s->filter_strength[mb_x]);
  1390. prefetch_motion(s, mb, mb_x, mb_y, mb_xy, VP56_FRAME_GOLDEN2);
  1391. dst[0] += 16;
  1392. dst[1] += 8;
  1393. dst[2] += 8;
  1394. }
  1395. if (s->deblock_filter) {
  1396. if (s->filter.simple)
  1397. filter_mb_row_simple(s, mb_y);
  1398. else
  1399. filter_mb_row(s, mb_y);
  1400. }
  1401. }
  1402. skip_decode:
  1403. // if future frames don't use the updated probabilities,
  1404. // reset them to the values we saved
  1405. if (!s->update_probabilities)
  1406. s->prob[0] = s->prob[1];
  1407. // check if golden and altref are swapped
  1408. if (s->update_altref == VP56_FRAME_GOLDEN &&
  1409. s->update_golden == VP56_FRAME_GOLDEN2)
  1410. FFSWAP(AVFrame *, s->framep[VP56_FRAME_GOLDEN], s->framep[VP56_FRAME_GOLDEN2]);
  1411. else {
  1412. if (s->update_altref != VP56_FRAME_NONE)
  1413. s->framep[VP56_FRAME_GOLDEN2] = s->framep[s->update_altref];
  1414. if (s->update_golden != VP56_FRAME_NONE)
  1415. s->framep[VP56_FRAME_GOLDEN] = s->framep[s->update_golden];
  1416. }
  1417. if (s->update_last) // move cur->prev
  1418. s->framep[VP56_FRAME_PREVIOUS] = s->framep[VP56_FRAME_CURRENT];
  1419. // release no longer referenced frames
  1420. for (i = 0; i < 4; i++)
  1421. if (s->frames[i].data[0] &&
  1422. &s->frames[i] != s->framep[VP56_FRAME_CURRENT] &&
  1423. &s->frames[i] != s->framep[VP56_FRAME_PREVIOUS] &&
  1424. &s->frames[i] != s->framep[VP56_FRAME_GOLDEN] &&
  1425. &s->frames[i] != s->framep[VP56_FRAME_GOLDEN2])
  1426. avctx->release_buffer(avctx, &s->frames[i]);
  1427. if (!s->invisible) {
  1428. *(AVFrame*)data = *s->framep[VP56_FRAME_CURRENT];
  1429. *data_size = sizeof(AVFrame);
  1430. }
  1431. return avpkt->size;
  1432. }
  1433. static av_cold int vp8_decode_init(AVCodecContext *avctx)
  1434. {
  1435. VP8Context *s = avctx->priv_data;
  1436. s->avctx = avctx;
  1437. avctx->pix_fmt = PIX_FMT_YUV420P;
  1438. dsputil_init(&s->dsp, avctx);
  1439. ff_h264_pred_init(&s->hpc, CODEC_ID_VP8);
  1440. ff_vp8dsp_init(&s->vp8dsp);
  1441. // intra pred needs edge emulation among other things
  1442. if (avctx->flags&CODEC_FLAG_EMU_EDGE) {
  1443. av_log(avctx, AV_LOG_ERROR, "Edge emulation not supported\n");
  1444. return AVERROR_PATCHWELCOME;
  1445. }
  1446. return 0;
  1447. }
  1448. static av_cold int vp8_decode_free(AVCodecContext *avctx)
  1449. {
  1450. vp8_decode_flush(avctx);
  1451. return 0;
  1452. }
  1453. AVCodec vp8_decoder = {
  1454. "vp8",
  1455. AVMEDIA_TYPE_VIDEO,
  1456. CODEC_ID_VP8,
  1457. sizeof(VP8Context),
  1458. vp8_decode_init,
  1459. NULL,
  1460. vp8_decode_free,
  1461. vp8_decode_frame,
  1462. CODEC_CAP_DR1,
  1463. .flush = vp8_decode_flush,
  1464. .long_name = NULL_IF_CONFIG_SMALL("On2 VP8"),
  1465. };