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.

723 lines
24KB

  1. /**
  2. * @file libavcodec/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. #include "get_bits.h"
  28. void 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 == 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[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 == 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[vp56_b2p[b]][ref_frame];
  247. else if (count == 2)
  248. dc /= 2;
  249. s->block_coeff[b][idx] += dc;
  250. s->prev_dc[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_edge_filter(VP56Context *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(VP56Context *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(VP56Context *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(VP56Context *s, int row, int col, int is_alpha)
  341. {
  342. AVFrame *frame_current, *frame_ref;
  343. VP56mb mb_type;
  344. VP56Frame ref_frame;
  345. int b, ab, b_max, plane, 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. s->dsp.clear_blocks(*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. ab = 6*is_alpha;
  357. b_max = 6 - 2*is_alpha;
  358. switch (mb_type) {
  359. case VP56_MB_INTRA:
  360. for (b=0; b<b_max; b++) {
  361. plane = vp56_b2p[b+ab];
  362. s->dsp.idct_put(frame_current->data[plane] + s->block_offset[b],
  363. s->stride[plane], s->block_coeff[b]);
  364. }
  365. break;
  366. case VP56_MB_INTER_NOVEC_PF:
  367. case VP56_MB_INTER_NOVEC_GF:
  368. for (b=0; b<b_max; b++) {
  369. plane = vp56_b2p[b+ab];
  370. off = s->block_offset[b];
  371. s->dsp.put_pixels_tab[1][0](frame_current->data[plane] + off,
  372. frame_ref->data[plane] + off,
  373. s->stride[plane], 8);
  374. s->dsp.idct_add(frame_current->data[plane] + off,
  375. s->stride[plane], s->block_coeff[b]);
  376. }
  377. break;
  378. case VP56_MB_INTER_DELTA_PF:
  379. case VP56_MB_INTER_V1_PF:
  380. case VP56_MB_INTER_V2_PF:
  381. case VP56_MB_INTER_DELTA_GF:
  382. case VP56_MB_INTER_4V:
  383. case VP56_MB_INTER_V1_GF:
  384. case VP56_MB_INTER_V2_GF:
  385. for (b=0; b<b_max; b++) {
  386. int x_off = b==1 || b==3 ? 8 : 0;
  387. int y_off = b==2 || b==3 ? 8 : 0;
  388. plane = vp56_b2p[b+ab];
  389. vp56_mc(s, b, plane, frame_ref->data[plane], s->stride[plane],
  390. 16*col+x_off, 16*row+y_off);
  391. s->dsp.idct_add(frame_current->data[plane] + s->block_offset[b],
  392. s->stride[plane], s->block_coeff[b]);
  393. }
  394. break;
  395. }
  396. }
  397. static int vp56_size_changed(AVCodecContext *avctx)
  398. {
  399. VP56Context *s = avctx->priv_data;
  400. int stride = s->framep[VP56_FRAME_CURRENT]->linesize[0];
  401. int i;
  402. s->plane_width[0] = s->plane_width[3] = avctx->coded_width;
  403. s->plane_width[1] = s->plane_width[2] = avctx->coded_width/2;
  404. s->plane_height[0] = s->plane_height[3] = avctx->coded_height;
  405. s->plane_height[1] = s->plane_height[2] = avctx->coded_height/2;
  406. for (i=0; i<4; i++)
  407. s->stride[i] = s->flip * s->framep[VP56_FRAME_CURRENT]->linesize[i];
  408. s->mb_width = (avctx->coded_width +15) / 16;
  409. s->mb_height = (avctx->coded_height+15) / 16;
  410. if (s->mb_width > 1000 || s->mb_height > 1000) {
  411. av_log(avctx, AV_LOG_ERROR, "picture too big\n");
  412. return -1;
  413. }
  414. s->qscale_table = av_realloc(s->qscale_table, s->mb_width);
  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. AVPacket *avpkt)
  428. {
  429. const uint8_t *buf = avpkt->data;
  430. VP56Context *s = avctx->priv_data;
  431. AVFrame *const p = s->framep[VP56_FRAME_CURRENT];
  432. int remaining_buf_size = avpkt->size;
  433. int is_alpha, av_uninit(alpha_offset);
  434. if (s->has_alpha) {
  435. if (remaining_buf_size < 3)
  436. return -1;
  437. alpha_offset = bytestream_get_be24(&buf);
  438. remaining_buf_size -= 3;
  439. if (remaining_buf_size < alpha_offset)
  440. return -1;
  441. }
  442. for (is_alpha=0; is_alpha < 1+s->has_alpha; is_alpha++) {
  443. int mb_row, mb_col, mb_row_flip, mb_offset = 0;
  444. int block, y, uv, stride_y, stride_uv;
  445. int golden_frame = 0;
  446. int res;
  447. s->modelp = &s->models[is_alpha];
  448. res = s->parse_header(s, buf, remaining_buf_size, &golden_frame);
  449. if (!res)
  450. return -1;
  451. if (!is_alpha) {
  452. p->reference = 1;
  453. if (avctx->get_buffer(avctx, p) < 0) {
  454. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  455. return -1;
  456. }
  457. if (res == 2)
  458. if (vp56_size_changed(avctx)) {
  459. avctx->release_buffer(avctx, p);
  460. return -1;
  461. }
  462. }
  463. if (p->key_frame) {
  464. p->pict_type = FF_I_TYPE;
  465. s->default_models_init(s);
  466. for (block=0; block<s->mb_height*s->mb_width; block++)
  467. s->macroblocks[block].type = VP56_MB_INTRA;
  468. } else {
  469. p->pict_type = FF_P_TYPE;
  470. vp56_parse_mb_type_models(s);
  471. s->parse_vector_models(s);
  472. s->mb_type = VP56_MB_INTER_NOVEC_PF;
  473. }
  474. s->parse_coeff_models(s);
  475. memset(s->prev_dc, 0, sizeof(s->prev_dc));
  476. s->prev_dc[1][VP56_FRAME_CURRENT] = 128;
  477. s->prev_dc[2][VP56_FRAME_CURRENT] = 128;
  478. for (block=0; block < 4*s->mb_width+6; block++) {
  479. s->above_blocks[block].ref_frame = VP56_FRAME_NONE;
  480. s->above_blocks[block].dc_coeff = 0;
  481. s->above_blocks[block].not_null_dc = 0;
  482. }
  483. s->above_blocks[2*s->mb_width + 2].ref_frame = VP56_FRAME_CURRENT;
  484. s->above_blocks[3*s->mb_width + 4].ref_frame = VP56_FRAME_CURRENT;
  485. stride_y = p->linesize[0];
  486. stride_uv = p->linesize[1];
  487. if (s->flip < 0)
  488. mb_offset = 7;
  489. /* main macroblocks loop */
  490. for (mb_row=0; mb_row<s->mb_height; mb_row++) {
  491. if (s->flip < 0)
  492. mb_row_flip = s->mb_height - mb_row - 1;
  493. else
  494. mb_row_flip = mb_row;
  495. for (block=0; block<4; block++) {
  496. s->left_block[block].ref_frame = VP56_FRAME_NONE;
  497. s->left_block[block].dc_coeff = 0;
  498. s->left_block[block].not_null_dc = 0;
  499. }
  500. memset(s->coeff_ctx, 0, sizeof(s->coeff_ctx));
  501. memset(s->coeff_ctx_last, 24, sizeof(s->coeff_ctx_last));
  502. s->above_block_idx[0] = 1;
  503. s->above_block_idx[1] = 2;
  504. s->above_block_idx[2] = 1;
  505. s->above_block_idx[3] = 2;
  506. s->above_block_idx[4] = 2*s->mb_width + 2 + 1;
  507. s->above_block_idx[5] = 3*s->mb_width + 4 + 1;
  508. s->block_offset[s->frbi] = (mb_row_flip*16 + mb_offset) * stride_y;
  509. s->block_offset[s->srbi] = s->block_offset[s->frbi] + 8*stride_y;
  510. s->block_offset[1] = s->block_offset[0] + 8;
  511. s->block_offset[3] = s->block_offset[2] + 8;
  512. s->block_offset[4] = (mb_row_flip*8 + mb_offset) * stride_uv;
  513. s->block_offset[5] = s->block_offset[4];
  514. for (mb_col=0; mb_col<s->mb_width; mb_col++) {
  515. vp56_decode_mb(s, mb_row, mb_col, is_alpha);
  516. for (y=0; y<4; y++) {
  517. s->above_block_idx[y] += 2;
  518. s->block_offset[y] += 16;
  519. }
  520. for (uv=4; uv<6; uv++) {
  521. s->above_block_idx[uv] += 1;
  522. s->block_offset[uv] += 8;
  523. }
  524. }
  525. }
  526. if (p->key_frame || golden_frame) {
  527. if (s->framep[VP56_FRAME_GOLDEN]->data[0] &&
  528. s->framep[VP56_FRAME_GOLDEN] != s->framep[VP56_FRAME_GOLDEN2])
  529. avctx->release_buffer(avctx, s->framep[VP56_FRAME_GOLDEN]);
  530. s->framep[VP56_FRAME_GOLDEN] = p;
  531. }
  532. if (s->has_alpha) {
  533. FFSWAP(AVFrame *, s->framep[VP56_FRAME_GOLDEN],
  534. s->framep[VP56_FRAME_GOLDEN2]);
  535. buf += alpha_offset;
  536. remaining_buf_size -= alpha_offset;
  537. }
  538. }
  539. if (s->framep[VP56_FRAME_PREVIOUS] == s->framep[VP56_FRAME_GOLDEN] ||
  540. s->framep[VP56_FRAME_PREVIOUS] == s->framep[VP56_FRAME_GOLDEN2]) {
  541. if (s->framep[VP56_FRAME_UNUSED] != s->framep[VP56_FRAME_GOLDEN] &&
  542. s->framep[VP56_FRAME_UNUSED] != s->framep[VP56_FRAME_GOLDEN2])
  543. FFSWAP(AVFrame *, s->framep[VP56_FRAME_PREVIOUS],
  544. s->framep[VP56_FRAME_UNUSED]);
  545. else
  546. FFSWAP(AVFrame *, s->framep[VP56_FRAME_PREVIOUS],
  547. s->framep[VP56_FRAME_UNUSED2]);
  548. } else if (s->framep[VP56_FRAME_PREVIOUS]->data[0])
  549. avctx->release_buffer(avctx, s->framep[VP56_FRAME_PREVIOUS]);
  550. FFSWAP(AVFrame *, s->framep[VP56_FRAME_CURRENT],
  551. s->framep[VP56_FRAME_PREVIOUS]);
  552. p->qstride = 0;
  553. p->qscale_table = s->qscale_table;
  554. p->qscale_type = FF_QSCALE_TYPE_VP56;
  555. *(AVFrame*)data = *p;
  556. *data_size = sizeof(AVFrame);
  557. return avpkt->size;
  558. }
  559. av_cold void vp56_init(AVCodecContext *avctx, int flip, int has_alpha)
  560. {
  561. VP56Context *s = avctx->priv_data;
  562. int i;
  563. s->avctx = avctx;
  564. avctx->pix_fmt = has_alpha ? PIX_FMT_YUVA420P : PIX_FMT_YUV420P;
  565. if (avctx->idct_algo == FF_IDCT_AUTO)
  566. avctx->idct_algo = FF_IDCT_VP3;
  567. dsputil_init(&s->dsp, avctx);
  568. ff_init_scantable(s->dsp.idct_permutation, &s->scantable,ff_zigzag_direct);
  569. for (i=0; i<4; i++)
  570. s->framep[i] = &s->frames[i];
  571. s->framep[VP56_FRAME_UNUSED] = s->framep[VP56_FRAME_GOLDEN];
  572. s->framep[VP56_FRAME_UNUSED2] = s->framep[VP56_FRAME_GOLDEN2];
  573. s->edge_emu_buffer_alloc = NULL;
  574. s->above_blocks = NULL;
  575. s->macroblocks = NULL;
  576. s->quantizer = -1;
  577. s->deblock_filtering = 1;
  578. s->filter = NULL;
  579. s->has_alpha = has_alpha;
  580. if (flip) {
  581. s->flip = -1;
  582. s->frbi = 2;
  583. s->srbi = 0;
  584. } else {
  585. s->flip = 1;
  586. s->frbi = 0;
  587. s->srbi = 2;
  588. }
  589. }
  590. av_cold int vp56_free(AVCodecContext *avctx)
  591. {
  592. VP56Context *s = avctx->priv_data;
  593. int pt;
  594. av_freep(&s->qscale_table);
  595. av_freep(&s->above_blocks);
  596. av_freep(&s->macroblocks);
  597. av_freep(&s->edge_emu_buffer_alloc);
  598. if (s->framep[VP56_FRAME_GOLDEN]->data[0])
  599. avctx->release_buffer(avctx, s->framep[VP56_FRAME_GOLDEN]);
  600. if (s->framep[VP56_FRAME_GOLDEN2]->data[0])
  601. avctx->release_buffer(avctx, s->framep[VP56_FRAME_GOLDEN2]);
  602. if (s->framep[VP56_FRAME_PREVIOUS]->data[0])
  603. avctx->release_buffer(avctx, s->framep[VP56_FRAME_PREVIOUS]);
  604. for (pt=0; pt < 2; pt++) {
  605. int ct, cg;
  606. free_vlc(&s->dccv_vlc[pt]);
  607. free_vlc(&s->runv_vlc[pt]);
  608. for (ct=0; ct<3; ct++)
  609. for (cg = 0; cg < 6; cg++)
  610. free_vlc(&s->ract_vlc[pt][ct][cg]);
  611. }
  612. return 0;
  613. }