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.

718 lines
24KB

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