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.

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