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.

1620 lines
56KB

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