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.

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