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.

704 lines
23KB

  1. /**
  2. * @file vp56.c
  3. * VP5 and VP6 compatible video decoder (common features)
  4. *
  5. * Copyright (C) 2006 Aurelien Jacobs <aurel@gnuage.org>
  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 "bytestream.h"
  25. #include "vp56.h"
  26. #include "vp56data.h"
  27. void vp56_init_dequant(vp56_context_t *s, int quantizer)
  28. {
  29. s->quantizer = quantizer;
  30. s->dequant_dc = vp56_dc_dequant[quantizer] << 2;
  31. s->dequant_ac = vp56_ac_dequant[quantizer] << 2;
  32. }
  33. static int vp56_get_vectors_predictors(vp56_context_t *s, int row, int col,
  34. vp56_frame_t ref_frame)
  35. {
  36. int nb_pred = 0;
  37. vp56_mv_t vect[2] = {{0,0}, {0,0}};
  38. int pos, offset;
  39. vp56_mv_t mvp;
  40. for (pos=0; pos<12; pos++) {
  41. mvp.x = col + vp56_candidate_predictor_pos[pos][0];
  42. mvp.y = row + vp56_candidate_predictor_pos[pos][1];
  43. if (mvp.x < 0 || mvp.x >= s->mb_width ||
  44. mvp.y < 0 || mvp.y >= s->mb_height)
  45. continue;
  46. offset = mvp.x + s->mb_width*mvp.y;
  47. if (vp56_reference_frame[s->macroblocks[offset].type] != ref_frame)
  48. continue;
  49. if ((s->macroblocks[offset].mv.x == vect[0].x &&
  50. s->macroblocks[offset].mv.y == vect[0].y) ||
  51. (s->macroblocks[offset].mv.x == 0 &&
  52. s->macroblocks[offset].mv.y == 0))
  53. continue;
  54. vect[nb_pred++] = s->macroblocks[offset].mv;
  55. if (nb_pred > 1) {
  56. nb_pred = -1;
  57. break;
  58. }
  59. s->vector_candidate_pos = pos;
  60. }
  61. s->vector_candidate[0] = vect[0];
  62. s->vector_candidate[1] = vect[1];
  63. return nb_pred+1;
  64. }
  65. static void vp56_parse_mb_type_models(vp56_context_t *s)
  66. {
  67. vp56_range_coder_t *c = &s->c;
  68. vp56_model_t *model = s->modelp;
  69. int i, ctx, type;
  70. for (ctx=0; ctx<3; ctx++) {
  71. if (vp56_rac_get_prob(c, 174)) {
  72. int idx = vp56_rac_gets(c, 4);
  73. memcpy(model->mb_types_stats[ctx],
  74. vp56_pre_def_mb_type_stats[idx][ctx],
  75. sizeof(model->mb_types_stats[ctx]));
  76. }
  77. if (vp56_rac_get_prob(c, 254)) {
  78. for (type=0; type<10; type++) {
  79. for(i=0; i<2; i++) {
  80. if (vp56_rac_get_prob(c, 205)) {
  81. int delta, sign = vp56_rac_get(c);
  82. delta = vp56_rac_get_tree(c, vp56_pmbtm_tree,
  83. vp56_mb_type_model_model);
  84. if (!delta)
  85. delta = 4 * vp56_rac_gets(c, 7);
  86. model->mb_types_stats[ctx][type][i] += (delta ^ -sign) + sign;
  87. }
  88. }
  89. }
  90. }
  91. }
  92. /* compute MB type probability tables based on previous MB type */
  93. for (ctx=0; ctx<3; ctx++) {
  94. int p[10];
  95. for (type=0; type<10; type++)
  96. p[type] = 100 * model->mb_types_stats[ctx][type][1];
  97. for (type=0; type<10; type++) {
  98. int p02, p34, p0234, p17, p56, p89, p5689, p156789;
  99. /* conservative MB type probability */
  100. model->mb_type[ctx][type][0] = 255 - (255 * model->mb_types_stats[ctx][type][0]) / (1 + model->mb_types_stats[ctx][type][0] + model->mb_types_stats[ctx][type][1]);
  101. p[type] = 0; /* same MB type => weight is null */
  102. /* binary tree parsing probabilities */
  103. p02 = p[0] + p[2];
  104. p34 = p[3] + p[4];
  105. p0234 = p02 + p34;
  106. p17 = p[1] + p[7];
  107. p56 = p[5] + p[6];
  108. p89 = p[8] + p[9];
  109. p5689 = p56 + p89;
  110. p156789 = p17 + p5689;
  111. model->mb_type[ctx][type][1] = 1 + 255 * p0234/(1+p0234+p156789);
  112. model->mb_type[ctx][type][2] = 1 + 255 * p02 / (1+p0234);
  113. model->mb_type[ctx][type][3] = 1 + 255 * p17 / (1+p156789);
  114. model->mb_type[ctx][type][4] = 1 + 255 * p[0] / (1+p02);
  115. model->mb_type[ctx][type][5] = 1 + 255 * p[3] / (1+p34);
  116. model->mb_type[ctx][type][6] = 1 + 255 * p[1] / (1+p17);
  117. model->mb_type[ctx][type][7] = 1 + 255 * p56 / (1+p5689);
  118. model->mb_type[ctx][type][8] = 1 + 255 * p[5] / (1+p56);
  119. model->mb_type[ctx][type][9] = 1 + 255 * p[8] / (1+p89);
  120. /* restore initial value */
  121. p[type] = 100 * model->mb_types_stats[ctx][type][1];
  122. }
  123. }
  124. }
  125. static vp56_mb_t vp56_parse_mb_type(vp56_context_t *s,
  126. vp56_mb_t prev_type, int ctx)
  127. {
  128. uint8_t *mb_type_model = s->modelp->mb_type[ctx][prev_type];
  129. vp56_range_coder_t *c = &s->c;
  130. if (vp56_rac_get_prob(c, mb_type_model[0]))
  131. return prev_type;
  132. else
  133. return vp56_rac_get_tree(c, vp56_pmbt_tree, mb_type_model);
  134. }
  135. static void vp56_decode_4mv(vp56_context_t *s, int row, int col)
  136. {
  137. vp56_mv_t mv = {0,0};
  138. int type[4];
  139. int b;
  140. /* parse each block type */
  141. for (b=0; b<4; b++) {
  142. type[b] = vp56_rac_gets(&s->c, 2);
  143. if (type[b])
  144. type[b]++; /* only returns 0, 2, 3 or 4 (all INTER_PF) */
  145. }
  146. /* get vectors */
  147. for (b=0; b<4; b++) {
  148. switch (type[b]) {
  149. case VP56_MB_INTER_NOVEC_PF:
  150. s->mv[b] = (vp56_mv_t) {0,0};
  151. break;
  152. case VP56_MB_INTER_DELTA_PF:
  153. s->parse_vector_adjustment(s, &s->mv[b]);
  154. break;
  155. case VP56_MB_INTER_V1_PF:
  156. s->mv[b] = s->vector_candidate[0];
  157. break;
  158. case VP56_MB_INTER_V2_PF:
  159. s->mv[b] = s->vector_candidate[1];
  160. break;
  161. }
  162. mv.x += s->mv[b].x;
  163. mv.y += s->mv[b].y;
  164. }
  165. /* this is the one selected for the whole MB for prediction */
  166. s->macroblocks[row * s->mb_width + col].mv = s->mv[3];
  167. /* chroma vectors are average luma vectors */
  168. if (s->avctx->codec->id == CODEC_ID_VP5) {
  169. s->mv[4].x = s->mv[5].x = RSHIFT(mv.x,2);
  170. s->mv[4].y = s->mv[5].y = RSHIFT(mv.y,2);
  171. } else {
  172. s->mv[4] = s->mv[5] = (vp56_mv_t) {mv.x/4, mv.y/4};
  173. }
  174. }
  175. static vp56_mb_t vp56_decode_mv(vp56_context_t *s, int row, int col)
  176. {
  177. vp56_mv_t *mv, vect = {0,0};
  178. int ctx, b;
  179. ctx = vp56_get_vectors_predictors(s, row, col, VP56_FRAME_PREVIOUS);
  180. s->mb_type = vp56_parse_mb_type(s, s->mb_type, ctx);
  181. s->macroblocks[row * s->mb_width + col].type = s->mb_type;
  182. switch (s->mb_type) {
  183. case VP56_MB_INTER_V1_PF:
  184. mv = &s->vector_candidate[0];
  185. break;
  186. case VP56_MB_INTER_V2_PF:
  187. mv = &s->vector_candidate[1];
  188. break;
  189. case VP56_MB_INTER_V1_GF:
  190. vp56_get_vectors_predictors(s, row, col, VP56_FRAME_GOLDEN);
  191. mv = &s->vector_candidate[0];
  192. break;
  193. case VP56_MB_INTER_V2_GF:
  194. vp56_get_vectors_predictors(s, row, col, VP56_FRAME_GOLDEN);
  195. mv = &s->vector_candidate[1];
  196. break;
  197. case VP56_MB_INTER_DELTA_PF:
  198. s->parse_vector_adjustment(s, &vect);
  199. mv = &vect;
  200. break;
  201. case VP56_MB_INTER_DELTA_GF:
  202. vp56_get_vectors_predictors(s, row, col, VP56_FRAME_GOLDEN);
  203. s->parse_vector_adjustment(s, &vect);
  204. mv = &vect;
  205. break;
  206. case VP56_MB_INTER_4V:
  207. vp56_decode_4mv(s, row, col);
  208. return s->mb_type;
  209. default:
  210. mv = &vect;
  211. break;
  212. }
  213. s->macroblocks[row*s->mb_width + col].mv = *mv;
  214. /* same vector for all blocks */
  215. for (b=0; b<6; b++)
  216. s->mv[b] = *mv;
  217. return s->mb_type;
  218. }
  219. static void vp56_add_predictors_dc(vp56_context_t *s, vp56_frame_t ref_frame)
  220. {
  221. int idx = s->scantable.permutated[0];
  222. int i;
  223. for (i=0; i<6; i++) {
  224. vp56_ref_dc_t *ab = &s->above_blocks[s->above_block_idx[i]];
  225. vp56_ref_dc_t *lb = &s->left_block[vp56_b6to4[i]];
  226. int count = 0;
  227. int dc = 0;
  228. if (ref_frame == lb->ref_frame) {
  229. dc += lb->dc_coeff;
  230. count++;
  231. }
  232. if (ref_frame == ab->ref_frame) {
  233. dc += ab->dc_coeff;
  234. count++;
  235. }
  236. if (s->avctx->codec->id == CODEC_ID_VP5) {
  237. if (count < 2 && ref_frame == ab[-1].ref_frame) {
  238. dc += ab[-1].dc_coeff;
  239. count++;
  240. }
  241. if (count < 2 && ref_frame == ab[1].ref_frame) {
  242. dc += ab[1].dc_coeff;
  243. count++;
  244. }
  245. }
  246. if (count == 0)
  247. dc = s->prev_dc[vp56_b2p[i]][ref_frame];
  248. else if (count == 2)
  249. dc /= 2;
  250. s->block_coeff[i][idx] += dc;
  251. s->prev_dc[vp56_b2p[i]][ref_frame] = s->block_coeff[i][idx];
  252. ab->dc_coeff = s->block_coeff[i][idx];
  253. ab->ref_frame = ref_frame;
  254. lb->dc_coeff = s->block_coeff[i][idx];
  255. lb->ref_frame = ref_frame;
  256. s->block_coeff[i][idx] *= s->dequant_dc;
  257. }
  258. }
  259. static void vp56_edge_filter(vp56_context_t *s, uint8_t *yuv,
  260. int pix_inc, int line_inc, int t)
  261. {
  262. int pix2_inc = 2 * pix_inc;
  263. int i, v;
  264. for (i=0; i<12; i++) {
  265. v = (yuv[-pix2_inc] + 3*(yuv[0]-yuv[-pix_inc]) - yuv[pix_inc] + 4) >>3;
  266. v = s->adjust(v, t);
  267. yuv[-pix_inc] = av_clip_uint8(yuv[-pix_inc] + v);
  268. yuv[0] = av_clip_uint8(yuv[0] - v);
  269. yuv += line_inc;
  270. }
  271. }
  272. static void vp56_deblock_filter(vp56_context_t *s, uint8_t *yuv,
  273. int stride, int dx, int dy)
  274. {
  275. int t = vp56_filter_threshold[s->quantizer];
  276. if (dx) vp56_edge_filter(s, yuv + 10-dx , 1, stride, t);
  277. if (dy) vp56_edge_filter(s, yuv + stride*(10-dy), stride, 1, t);
  278. }
  279. static void vp56_mc(vp56_context_t *s, int b, int plane, uint8_t *src,
  280. int stride, int x, int y)
  281. {
  282. uint8_t *dst=s->framep[VP56_FRAME_CURRENT]->data[plane]+s->block_offset[b];
  283. uint8_t *src_block;
  284. int src_offset;
  285. int overlap_offset = 0;
  286. int mask = s->vp56_coord_div[b] - 1;
  287. int deblock_filtering = s->deblock_filtering;
  288. int dx;
  289. int dy;
  290. if (s->avctx->skip_loop_filter >= AVDISCARD_ALL ||
  291. (s->avctx->skip_loop_filter >= AVDISCARD_NONKEY
  292. && !s->framep[VP56_FRAME_CURRENT]->key_frame))
  293. deblock_filtering = 0;
  294. dx = s->mv[b].x / s->vp56_coord_div[b];
  295. dy = s->mv[b].y / s->vp56_coord_div[b];
  296. if (b >= 4) {
  297. x /= 2;
  298. y /= 2;
  299. }
  300. x += dx - 2;
  301. y += dy - 2;
  302. if (x<0 || x+12>=s->plane_width[plane] ||
  303. y<0 || y+12>=s->plane_height[plane]) {
  304. ff_emulated_edge_mc(s->edge_emu_buffer,
  305. src + s->block_offset[b] + (dy-2)*stride + (dx-2),
  306. stride, 12, 12, x, y,
  307. s->plane_width[plane],
  308. s->plane_height[plane]);
  309. src_block = s->edge_emu_buffer;
  310. src_offset = 2 + 2*stride;
  311. } else if (deblock_filtering) {
  312. /* only need a 12x12 block, but there is no such dsp function, */
  313. /* so copy a 16x12 block */
  314. s->dsp.put_pixels_tab[0][0](s->edge_emu_buffer,
  315. src + s->block_offset[b] + (dy-2)*stride + (dx-2),
  316. stride, 12);
  317. src_block = s->edge_emu_buffer;
  318. src_offset = 2 + 2*stride;
  319. } else {
  320. src_block = src;
  321. src_offset = s->block_offset[b] + dy*stride + dx;
  322. }
  323. if (deblock_filtering)
  324. vp56_deblock_filter(s, src_block, stride, dx&7, dy&7);
  325. if (s->mv[b].x & mask)
  326. overlap_offset += (s->mv[b].x > 0) ? 1 : -1;
  327. if (s->mv[b].y & mask)
  328. overlap_offset += (s->mv[b].y > 0) ? stride : -stride;
  329. if (overlap_offset) {
  330. if (s->filter)
  331. s->filter(s, dst, src_block, src_offset, src_offset+overlap_offset,
  332. stride, s->mv[b], mask, s->filter_selection, b<4);
  333. else
  334. s->dsp.put_no_rnd_pixels_l2[1](dst, src_block+src_offset,
  335. src_block+src_offset+overlap_offset,
  336. stride, 8);
  337. } else {
  338. s->dsp.put_pixels_tab[1][0](dst, src_block+src_offset, stride, 8);
  339. }
  340. }
  341. static void vp56_decode_mb(vp56_context_t *s, int row, int col, int is_alpha)
  342. {
  343. AVFrame *frame_current, *frame_ref;
  344. vp56_mb_t mb_type;
  345. vp56_frame_t ref_frame;
  346. int b, ab, b_max, plan, off;
  347. if (s->framep[VP56_FRAME_CURRENT]->key_frame)
  348. mb_type = VP56_MB_INTRA;
  349. else
  350. mb_type = vp56_decode_mv(s, row, col);
  351. ref_frame = vp56_reference_frame[mb_type];
  352. memset(s->block_coeff, 0, sizeof(s->block_coeff));
  353. s->parse_coeff(s);
  354. vp56_add_predictors_dc(s, ref_frame);
  355. frame_current = s->framep[VP56_FRAME_CURRENT];
  356. frame_ref = s->framep[ref_frame];
  357. ab = 6*is_alpha;
  358. b_max = 6 - 2*is_alpha;
  359. switch (mb_type) {
  360. case VP56_MB_INTRA:
  361. for (b=0; b<b_max; b++) {
  362. plan = vp56_b2p[b+ab];
  363. s->dsp.idct_put(frame_current->data[plan] + s->block_offset[b],
  364. s->stride[plan], s->block_coeff[b]);
  365. }
  366. break;
  367. case VP56_MB_INTER_NOVEC_PF:
  368. case VP56_MB_INTER_NOVEC_GF:
  369. for (b=0; b<b_max; b++) {
  370. plan = vp56_b2p[b+ab];
  371. off = s->block_offset[b];
  372. s->dsp.put_pixels_tab[1][0](frame_current->data[plan] + off,
  373. frame_ref->data[plan] + off,
  374. s->stride[plan], 8);
  375. s->dsp.idct_add(frame_current->data[plan] + off,
  376. s->stride[plan], s->block_coeff[b]);
  377. }
  378. break;
  379. case VP56_MB_INTER_DELTA_PF:
  380. case VP56_MB_INTER_V1_PF:
  381. case VP56_MB_INTER_V2_PF:
  382. case VP56_MB_INTER_DELTA_GF:
  383. case VP56_MB_INTER_4V:
  384. case VP56_MB_INTER_V1_GF:
  385. case VP56_MB_INTER_V2_GF:
  386. for (b=0; b<b_max; b++) {
  387. int x_off = b==1 || b==3 ? 8 : 0;
  388. int y_off = b==2 || b==3 ? 8 : 0;
  389. plan = vp56_b2p[b+ab];
  390. vp56_mc(s, b, plan, frame_ref->data[plan], s->stride[plan],
  391. 16*col+x_off, 16*row+y_off);
  392. s->dsp.idct_add(frame_current->data[plan] + s->block_offset[b],
  393. s->stride[plan], s->block_coeff[b]);
  394. }
  395. break;
  396. }
  397. }
  398. static int vp56_size_changed(AVCodecContext *avctx)
  399. {
  400. vp56_context_t *s = avctx->priv_data;
  401. int stride = s->framep[VP56_FRAME_CURRENT]->linesize[0];
  402. int i;
  403. s->plane_width[0] = s->plane_width[3] = avctx->coded_width;
  404. s->plane_width[1] = s->plane_width[2] = avctx->coded_width/2;
  405. s->plane_height[0] = s->plane_height[3] = avctx->coded_height;
  406. s->plane_height[1] = s->plane_height[2] = avctx->coded_height/2;
  407. for (i=0; i<4; i++)
  408. s->stride[i] = s->flip * s->framep[VP56_FRAME_CURRENT]->linesize[i];
  409. s->mb_width = (avctx->coded_width +15) / 16;
  410. s->mb_height = (avctx->coded_height+15) / 16;
  411. if (s->mb_width > 1000 || s->mb_height > 1000) {
  412. av_log(avctx, AV_LOG_ERROR, "picture too big\n");
  413. return -1;
  414. }
  415. s->above_blocks = av_realloc(s->above_blocks,
  416. (4*s->mb_width+6) * sizeof(*s->above_blocks));
  417. s->macroblocks = av_realloc(s->macroblocks,
  418. s->mb_width*s->mb_height*sizeof(*s->macroblocks));
  419. av_free(s->edge_emu_buffer_alloc);
  420. s->edge_emu_buffer_alloc = av_malloc(16*stride);
  421. s->edge_emu_buffer = s->edge_emu_buffer_alloc;
  422. if (s->flip < 0)
  423. s->edge_emu_buffer += 15 * stride;
  424. return 0;
  425. }
  426. int vp56_decode_frame(AVCodecContext *avctx, void *data, int *data_size,
  427. uint8_t *buf, int buf_size)
  428. {
  429. vp56_context_t *s = avctx->priv_data;
  430. AVFrame *const p = s->framep[VP56_FRAME_CURRENT];
  431. int is_alpha, alpha_offset;
  432. if (s->has_alpha) {
  433. alpha_offset = bytestream_get_be24(&buf);
  434. buf_size -= 3;
  435. }
  436. for (is_alpha=0; is_alpha < 1+s->has_alpha; is_alpha++) {
  437. int mb_row, mb_col, mb_row_flip, mb_offset = 0;
  438. int block, y, uv, stride_y, stride_uv;
  439. int golden_frame = 0;
  440. int res;
  441. s->modelp = &s->models[is_alpha];
  442. res = s->parse_header(s, buf, buf_size, &golden_frame);
  443. if (!res)
  444. return -1;
  445. if (!is_alpha) {
  446. p->reference = 1;
  447. if (avctx->get_buffer(avctx, p) < 0) {
  448. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  449. return -1;
  450. }
  451. if (res == 2)
  452. if (vp56_size_changed(avctx)) {
  453. avctx->release_buffer(avctx, p);
  454. return -1;
  455. }
  456. }
  457. if (p->key_frame) {
  458. p->pict_type = FF_I_TYPE;
  459. s->default_models_init(s);
  460. for (block=0; block<s->mb_height*s->mb_width; block++)
  461. s->macroblocks[block].type = VP56_MB_INTRA;
  462. } else {
  463. p->pict_type = FF_P_TYPE;
  464. vp56_parse_mb_type_models(s);
  465. s->parse_vector_models(s);
  466. s->mb_type = VP56_MB_INTER_NOVEC_PF;
  467. }
  468. s->parse_coeff_models(s);
  469. memset(s->prev_dc, 0, sizeof(s->prev_dc));
  470. s->prev_dc[1][VP56_FRAME_CURRENT] = 128;
  471. s->prev_dc[2][VP56_FRAME_CURRENT] = 128;
  472. for (block=0; block < 4*s->mb_width+6; block++) {
  473. s->above_blocks[block].ref_frame = -1;
  474. s->above_blocks[block].dc_coeff = 0;
  475. s->above_blocks[block].not_null_dc = 0;
  476. }
  477. s->above_blocks[2*s->mb_width + 2].ref_frame = 0;
  478. s->above_blocks[3*s->mb_width + 4].ref_frame = 0;
  479. stride_y = p->linesize[0];
  480. stride_uv = p->linesize[1];
  481. if (s->flip < 0)
  482. mb_offset = 7;
  483. /* main macroblocks loop */
  484. for (mb_row=0; mb_row<s->mb_height; mb_row++) {
  485. if (s->flip < 0)
  486. mb_row_flip = s->mb_height - mb_row - 1;
  487. else
  488. mb_row_flip = mb_row;
  489. for (block=0; block<4; block++) {
  490. s->left_block[block].ref_frame = -1;
  491. s->left_block[block].dc_coeff = 0;
  492. s->left_block[block].not_null_dc = 0;
  493. }
  494. memset(s->coeff_ctx, 0, sizeof(s->coeff_ctx));
  495. memset(s->coeff_ctx_last, 24, sizeof(s->coeff_ctx_last));
  496. s->above_block_idx[0] = 1;
  497. s->above_block_idx[1] = 2;
  498. s->above_block_idx[2] = 1;
  499. s->above_block_idx[3] = 2;
  500. s->above_block_idx[4] = 2*s->mb_width + 2 + 1;
  501. s->above_block_idx[5] = 3*s->mb_width + 4 + 1;
  502. s->block_offset[s->frbi] = (mb_row_flip*16 + mb_offset) * stride_y;
  503. s->block_offset[s->srbi] = s->block_offset[s->frbi] + 8*stride_y;
  504. s->block_offset[1] = s->block_offset[0] + 8;
  505. s->block_offset[3] = s->block_offset[2] + 8;
  506. s->block_offset[4] = (mb_row_flip*8 + mb_offset) * stride_uv;
  507. s->block_offset[5] = s->block_offset[4];
  508. for (mb_col=0; mb_col<s->mb_width; mb_col++) {
  509. vp56_decode_mb(s, mb_row, mb_col, is_alpha);
  510. for (y=0; y<4; y++) {
  511. s->above_block_idx[y] += 2;
  512. s->block_offset[y] += 16;
  513. }
  514. for (uv=4; uv<6; uv++) {
  515. s->above_block_idx[uv] += 1;
  516. s->block_offset[uv] += 8;
  517. }
  518. }
  519. }
  520. if (p->key_frame || golden_frame) {
  521. if (s->framep[VP56_FRAME_GOLDEN]->data[0] &&
  522. s->framep[VP56_FRAME_GOLDEN] != s->framep[VP56_FRAME_GOLDEN2])
  523. avctx->release_buffer(avctx, s->framep[VP56_FRAME_GOLDEN]);
  524. s->framep[VP56_FRAME_GOLDEN] = p;
  525. }
  526. if (s->has_alpha) {
  527. FFSWAP(AVFrame *, s->framep[VP56_FRAME_GOLDEN],
  528. s->framep[VP56_FRAME_GOLDEN2]);
  529. buf += alpha_offset;
  530. buf_size -= alpha_offset;
  531. }
  532. }
  533. if (s->framep[VP56_FRAME_PREVIOUS] == s->framep[VP56_FRAME_GOLDEN] ||
  534. s->framep[VP56_FRAME_PREVIOUS] == s->framep[VP56_FRAME_GOLDEN2]) {
  535. if (s->framep[VP56_FRAME_UNUSED] != s->framep[VP56_FRAME_GOLDEN] &&
  536. s->framep[VP56_FRAME_UNUSED] != s->framep[VP56_FRAME_GOLDEN2])
  537. FFSWAP(AVFrame *, s->framep[VP56_FRAME_PREVIOUS],
  538. s->framep[VP56_FRAME_UNUSED]);
  539. else
  540. FFSWAP(AVFrame *, s->framep[VP56_FRAME_PREVIOUS],
  541. s->framep[VP56_FRAME_UNUSED2]);
  542. } else if (s->framep[VP56_FRAME_PREVIOUS]->data[0])
  543. avctx->release_buffer(avctx, s->framep[VP56_FRAME_PREVIOUS]);
  544. FFSWAP(AVFrame *, s->framep[VP56_FRAME_CURRENT],
  545. s->framep[VP56_FRAME_PREVIOUS]);
  546. *(AVFrame*)data = *p;
  547. *data_size = sizeof(AVFrame);
  548. return buf_size;
  549. }
  550. void vp56_init(AVCodecContext *avctx, int flip, int has_alpha)
  551. {
  552. vp56_context_t *s = avctx->priv_data;
  553. int i;
  554. s->avctx = avctx;
  555. avctx->pix_fmt = has_alpha ? PIX_FMT_YUVA420P : PIX_FMT_YUV420P;
  556. if (avctx->idct_algo == FF_IDCT_AUTO)
  557. avctx->idct_algo = FF_IDCT_VP3;
  558. dsputil_init(&s->dsp, avctx);
  559. ff_init_scantable(s->dsp.idct_permutation, &s->scantable,ff_zigzag_direct);
  560. avcodec_set_dimensions(avctx, 0, 0);
  561. for (i=0; i<4; i++)
  562. s->framep[i] = &s->frames[i];
  563. s->framep[VP56_FRAME_UNUSED] = s->framep[VP56_FRAME_GOLDEN];
  564. s->framep[VP56_FRAME_UNUSED2] = s->framep[VP56_FRAME_GOLDEN2];
  565. s->edge_emu_buffer_alloc = NULL;
  566. s->above_blocks = NULL;
  567. s->macroblocks = NULL;
  568. s->quantizer = -1;
  569. s->deblock_filtering = 1;
  570. s->filter = NULL;
  571. s->has_alpha = has_alpha;
  572. if (flip) {
  573. s->flip = -1;
  574. s->frbi = 2;
  575. s->srbi = 0;
  576. } else {
  577. s->flip = 1;
  578. s->frbi = 0;
  579. s->srbi = 2;
  580. }
  581. }
  582. int vp56_free(AVCodecContext *avctx)
  583. {
  584. vp56_context_t *s = avctx->priv_data;
  585. av_free(s->above_blocks);
  586. av_free(s->macroblocks);
  587. av_free(s->edge_emu_buffer_alloc);
  588. if (s->framep[VP56_FRAME_GOLDEN]->data[0])
  589. avctx->release_buffer(avctx, s->framep[VP56_FRAME_GOLDEN]);
  590. if (s->framep[VP56_FRAME_GOLDEN2]->data[0])
  591. avctx->release_buffer(avctx, s->framep[VP56_FRAME_GOLDEN2]);
  592. if (s->framep[VP56_FRAME_PREVIOUS]->data[0])
  593. avctx->release_buffer(avctx, s->framep[VP56_FRAME_PREVIOUS]);
  594. return 0;
  595. }