vp5.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317
  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 compatible video decoder
  23. */
  24. #include <string.h>
  25. #include "avcodec.h"
  26. #include "codec_internal.h"
  27. #include "decode.h"
  28. #include "vp56.h"
  29. #include "vp56data.h"
  30. #include "vp5data.h"
  31. #include "vpx_rac.h"
  32. static int vp5_parse_header(VP56Context *s, const uint8_t *buf, int buf_size)
  33. {
  34. VPXRangeCoder *c = &s->c;
  35. int rows, cols;
  36. int ret;
  37. ret = ff_vpx_init_range_decoder(&s->c, buf, buf_size);
  38. if (ret < 0)
  39. return ret;
  40. if (!vpx_rac_get(c))
  41. s->frames[VP56_FRAME_CURRENT]->flags |= AV_FRAME_FLAG_KEY;
  42. else
  43. s->frames[VP56_FRAME_CURRENT]->flags &= ~AV_FRAME_FLAG_KEY;
  44. vpx_rac_get(c);
  45. ff_vp56_init_dequant(s, vp56_rac_gets(c, 6));
  46. if (s->frames[VP56_FRAME_CURRENT]->flags & AV_FRAME_FLAG_KEY)
  47. {
  48. int render_x, render_y;
  49. vp56_rac_gets(c, 8);
  50. if(vp56_rac_gets(c, 5) > 5)
  51. return AVERROR_INVALIDDATA;
  52. vp56_rac_gets(c, 2);
  53. s->interlaced = vp56_rac_gets(c, 1);
  54. rows = vp56_rac_gets(c, 8); /* number of stored macroblock rows */
  55. cols = vp56_rac_gets(c, 8); /* number of stored macroblock cols */
  56. if (!rows || !cols) {
  57. av_log(s->avctx, AV_LOG_ERROR, "Invalid size %dx%d\n",
  58. cols << 4, rows << 4);
  59. return AVERROR_INVALIDDATA;
  60. }
  61. render_y = vp56_rac_gets(c, 8); /* number of displayed macroblock rows */
  62. render_x = vp56_rac_gets(c, 8); /* number of displayed macroblock cols */
  63. if (render_x == 0 || render_x > cols ||
  64. render_y == 0 || render_y > rows)
  65. return AVERROR_INVALIDDATA;
  66. vp56_rac_gets(c, 2);
  67. if (!s->macroblocks || /* first frame */
  68. 16*cols != s->avctx->coded_width ||
  69. 16*rows != s->avctx->coded_height) {
  70. int ret = ff_set_dimensions(s->avctx, 16 * cols, 16 * rows);
  71. if (ret < 0)
  72. return ret;
  73. return VP56_SIZE_CHANGE;
  74. }
  75. } else if (!s->macroblocks)
  76. return AVERROR_INVALIDDATA;
  77. return 0;
  78. }
  79. static void vp5_parse_vector_adjustment(VP56Context *s, VP56mv *vect)
  80. {
  81. VPXRangeCoder *c = &s->c;
  82. VP56Model *model = s->modelp;
  83. int comp, di;
  84. for (comp=0; comp<2; comp++) {
  85. int delta = 0;
  86. if (vpx_rac_get_prob_branchy(c, model->vector_dct[comp])) {
  87. int sign = vpx_rac_get_prob(c, model->vector_sig[comp]);
  88. di = vpx_rac_get_prob(c, model->vector_pdi[comp][0]);
  89. di |= vpx_rac_get_prob(c, model->vector_pdi[comp][1]) << 1;
  90. delta = vp56_rac_get_tree(c, ff_vp56_pva_tree,
  91. model->vector_pdv[comp]);
  92. delta = di | (delta << 2);
  93. delta = (delta ^ -sign) + sign;
  94. }
  95. if (!comp)
  96. vect->x = delta;
  97. else
  98. vect->y = delta;
  99. }
  100. }
  101. static void vp5_parse_vector_models(VP56Context *s)
  102. {
  103. VPXRangeCoder *c = &s->c;
  104. VP56Model *model = s->modelp;
  105. int comp, node;
  106. for (comp=0; comp<2; comp++) {
  107. if (vpx_rac_get_prob_branchy(c, vp5_vmc_pct[comp][0]))
  108. model->vector_dct[comp] = vp56_rac_gets_nn(c, 7);
  109. if (vpx_rac_get_prob_branchy(c, vp5_vmc_pct[comp][1]))
  110. model->vector_sig[comp] = vp56_rac_gets_nn(c, 7);
  111. if (vpx_rac_get_prob_branchy(c, vp5_vmc_pct[comp][2]))
  112. model->vector_pdi[comp][0] = vp56_rac_gets_nn(c, 7);
  113. if (vpx_rac_get_prob_branchy(c, vp5_vmc_pct[comp][3]))
  114. model->vector_pdi[comp][1] = vp56_rac_gets_nn(c, 7);
  115. }
  116. for (comp=0; comp<2; comp++)
  117. for (node=0; node<7; node++)
  118. if (vpx_rac_get_prob_branchy(c, vp5_vmc_pct[comp][4 + node]))
  119. model->vector_pdv[comp][node] = vp56_rac_gets_nn(c, 7);
  120. }
  121. static int vp5_parse_coeff_models(VP56Context *s)
  122. {
  123. VPXRangeCoder *c = &s->c;
  124. VP56Model *model = s->modelp;
  125. uint8_t def_prob[11];
  126. int node, cg, ctx;
  127. int ct; /* code type */
  128. int pt; /* plane type (0 for Y, 1 for U or V) */
  129. memset(def_prob, 0x80, sizeof(def_prob));
  130. for (pt=0; pt<2; pt++)
  131. for (node=0; node<11; node++)
  132. if (vpx_rac_get_prob_branchy(c, vp5_dccv_pct[pt][node])) {
  133. def_prob[node] = vp56_rac_gets_nn(c, 7);
  134. model->coeff_dccv[pt][node] = def_prob[node];
  135. } else if (s->frames[VP56_FRAME_CURRENT]->flags & AV_FRAME_FLAG_KEY) {
  136. model->coeff_dccv[pt][node] = def_prob[node];
  137. }
  138. for (ct=0; ct<3; ct++)
  139. for (pt=0; pt<2; pt++)
  140. for (cg=0; cg<6; cg++)
  141. for (node=0; node<11; node++)
  142. if (vpx_rac_get_prob_branchy(c, vp5_ract_pct[ct][pt][cg][node])) {
  143. def_prob[node] = vp56_rac_gets_nn(c, 7);
  144. model->coeff_ract[pt][ct][cg][node] = def_prob[node];
  145. } else if (s->frames[VP56_FRAME_CURRENT]->flags & AV_FRAME_FLAG_KEY) {
  146. model->coeff_ract[pt][ct][cg][node] = def_prob[node];
  147. }
  148. /* coeff_dcct is a linear combination of coeff_dccv */
  149. for (pt=0; pt<2; pt++)
  150. for (ctx=0; ctx<36; ctx++)
  151. for (node=0; node<5; node++)
  152. model->coeff_dcct[pt][ctx][node] = av_clip(((model->coeff_dccv[pt][node] * vp5_dccv_lc[node][ctx][0] + 128) >> 8) + vp5_dccv_lc[node][ctx][1], 1, 254);
  153. /* coeff_acct is a linear combination of coeff_ract */
  154. for (ct=0; ct<3; ct++)
  155. for (pt=0; pt<2; pt++)
  156. for (cg=0; cg<3; cg++)
  157. for (ctx=0; ctx<6; ctx++)
  158. for (node=0; node<5; node++)
  159. model->coeff_acct[pt][ct][cg][ctx][node] = av_clip(((model->coeff_ract[pt][ct][cg][node] * vp5_ract_lc[ct][cg][node][ctx][0] + 128) >> 8) + vp5_ract_lc[ct][cg][node][ctx][1], 1, 254);
  160. return 0;
  161. }
  162. static int vp5_parse_coeff(VP56Context *s)
  163. {
  164. VPXRangeCoder *c = &s->c;
  165. VP56Model *model = s->modelp;
  166. uint8_t *permute = s->idct_scantable;
  167. uint8_t *model1, *model2;
  168. int coeff, sign, coeff_idx;
  169. int b, i, cg, idx, ctx, ctx_last;
  170. int pt = 0; /* plane type (0 for Y, 1 for U or V) */
  171. if (vpx_rac_is_end(c)) {
  172. av_log(s->avctx, AV_LOG_ERROR, "End of AC stream reached in vp5_parse_coeff\n");
  173. return AVERROR_INVALIDDATA;
  174. }
  175. for (b=0; b<6; b++) {
  176. int ct = 1; /* code type */
  177. if (b > 3) pt = 1;
  178. ctx = 6*s->coeff_ctx[ff_vp56_b6to4[b]][0]
  179. + s->above_blocks[s->above_block_idx[b]].not_null_dc;
  180. model1 = model->coeff_dccv[pt];
  181. model2 = model->coeff_dcct[pt][ctx];
  182. coeff_idx = 0;
  183. for (;;) {
  184. if (vpx_rac_get_prob_branchy(c, model2[0])) {
  185. if (vpx_rac_get_prob_branchy(c, model2[2])) {
  186. if (vpx_rac_get_prob_branchy(c, model2[3])) {
  187. s->coeff_ctx[ff_vp56_b6to4[b]][coeff_idx] = 4;
  188. idx = vp56_rac_get_tree(c, ff_vp56_pc_tree, model1);
  189. sign = vpx_rac_get(c);
  190. coeff = ff_vp56_coeff_bias[idx+5];
  191. for (i=ff_vp56_coeff_bit_length[idx]; i>=0; i--)
  192. coeff += vpx_rac_get_prob(c, ff_vp56_coeff_parse_table[idx][i]) << i;
  193. } else {
  194. if (vpx_rac_get_prob_branchy(c, model2[4])) {
  195. coeff = 3 + vpx_rac_get_prob(c, model1[5]);
  196. s->coeff_ctx[ff_vp56_b6to4[b]][coeff_idx] = 3;
  197. } else {
  198. coeff = 2;
  199. s->coeff_ctx[ff_vp56_b6to4[b]][coeff_idx] = 2;
  200. }
  201. sign = vpx_rac_get(c);
  202. }
  203. ct = 2;
  204. } else {
  205. ct = 1;
  206. s->coeff_ctx[ff_vp56_b6to4[b]][coeff_idx] = 1;
  207. sign = vpx_rac_get(c);
  208. coeff = 1;
  209. }
  210. coeff = (coeff ^ -sign) + sign;
  211. if (coeff_idx)
  212. coeff *= s->dequant_ac;
  213. s->block_coeff[b][permute[coeff_idx]] = coeff;
  214. } else {
  215. if (ct && !vpx_rac_get_prob_branchy(c, model2[1]))
  216. break;
  217. ct = 0;
  218. s->coeff_ctx[ff_vp56_b6to4[b]][coeff_idx] = 0;
  219. }
  220. coeff_idx++;
  221. if (coeff_idx >= 64)
  222. break;
  223. cg = vp5_coeff_groups[coeff_idx];
  224. ctx = s->coeff_ctx[ff_vp56_b6to4[b]][coeff_idx];
  225. model1 = model->coeff_ract[pt][ct][cg];
  226. model2 = cg > 2 ? model1 : model->coeff_acct[pt][ct][cg][ctx];
  227. }
  228. ctx_last = FFMIN(s->coeff_ctx_last[ff_vp56_b6to4[b]], 24);
  229. s->coeff_ctx_last[ff_vp56_b6to4[b]] = coeff_idx;
  230. if (coeff_idx < ctx_last)
  231. for (i=coeff_idx; i<=ctx_last; i++)
  232. s->coeff_ctx[ff_vp56_b6to4[b]][i] = 5;
  233. s->above_blocks[s->above_block_idx[b]].not_null_dc = s->coeff_ctx[ff_vp56_b6to4[b]][0];
  234. s->idct_selector[b] = 63;
  235. }
  236. return 0;
  237. }
  238. static void vp5_default_models_init(VP56Context *s)
  239. {
  240. VP56Model *model = s->modelp;
  241. int i;
  242. for (i=0; i<2; i++) {
  243. model->vector_sig[i] = 0x80;
  244. model->vector_dct[i] = 0x80;
  245. model->vector_pdi[i][0] = 0x55;
  246. model->vector_pdi[i][1] = 0x80;
  247. }
  248. memcpy(model->mb_types_stats, ff_vp56_def_mb_types_stats, sizeof(model->mb_types_stats));
  249. memset(model->vector_pdv, 0x80, sizeof(model->vector_pdv));
  250. }
  251. static av_cold int vp5_decode_init(AVCodecContext *avctx)
  252. {
  253. VP56Context *s = avctx->priv_data;
  254. int ret;
  255. if ((ret = ff_vp56_init_context(avctx, s, 1, 0)) < 0)
  256. return ret;
  257. ff_vp5dsp_init(&s->vp56dsp);
  258. s->vp56_coord_div = vp5_coord_div;
  259. s->parse_vector_adjustment = vp5_parse_vector_adjustment;
  260. s->parse_coeff = vp5_parse_coeff;
  261. s->default_models_init = vp5_default_models_init;
  262. s->parse_vector_models = vp5_parse_vector_models;
  263. s->parse_coeff_models = vp5_parse_coeff_models;
  264. s->parse_header = vp5_parse_header;
  265. return 0;
  266. }
  267. static av_cold int vp56_free(AVCodecContext *avctx)
  268. {
  269. VP56Context *const s = avctx->priv_data;
  270. return ff_vp56_free_context(s);
  271. }
  272. const FFCodec ff_vp5_decoder = {
  273. .p.name = "vp5",
  274. CODEC_LONG_NAME("On2 VP5"),
  275. .p.type = AVMEDIA_TYPE_VIDEO,
  276. .p.id = AV_CODEC_ID_VP5,
  277. .priv_data_size = sizeof(VP56Context),
  278. .init = vp5_decode_init,
  279. .close = vp56_free,
  280. FF_CODEC_DECODE_CB(ff_vp56_decode_frame),
  281. .p.capabilities = AV_CODEC_CAP_DR1,
  282. .caps_internal = FF_CODEC_CAP_INIT_CLEANUP,
  283. };