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.

1640 lines
57KB

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