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.

664 lines
21KB

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