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.

298 lines
10KB

  1. /**
  2. * @file vp5.c
  3. * VP5 compatible video decoder
  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 <stdlib.h>
  24. #include <string.h>
  25. #include "avcodec.h"
  26. #include "dsputil.h"
  27. #include "bitstream.h"
  28. #include "vp56.h"
  29. #include "vp56data.h"
  30. #include "vp5data.h"
  31. static int vp5_parse_header(VP56Context *s, const uint8_t *buf, int buf_size,
  32. int *golden_frame)
  33. {
  34. VP56RangeCoder *c = &s->c;
  35. int rows, cols;
  36. vp56_init_range_decoder(&s->c, buf, buf_size);
  37. s->framep[VP56_FRAME_CURRENT]->key_frame = !vp56_rac_get(c);
  38. vp56_rac_get(c);
  39. vp56_init_dequant(s, vp56_rac_gets(c, 6));
  40. if (s->framep[VP56_FRAME_CURRENT]->key_frame)
  41. {
  42. vp56_rac_gets(c, 8);
  43. if(vp56_rac_gets(c, 5) > 5)
  44. return 0;
  45. vp56_rac_gets(c, 2);
  46. if (vp56_rac_get(c)) {
  47. av_log(s->avctx, AV_LOG_ERROR, "interlacing not supported\n");
  48. return 0;
  49. }
  50. rows = vp56_rac_gets(c, 8); /* number of stored macroblock rows */
  51. cols = vp56_rac_gets(c, 8); /* number of stored macroblock cols */
  52. vp56_rac_gets(c, 8); /* number of displayed macroblock rows */
  53. vp56_rac_gets(c, 8); /* number of displayed macroblock cols */
  54. vp56_rac_gets(c, 2);
  55. if (!s->macroblocks || /* first frame */
  56. 16*cols != s->avctx->coded_width ||
  57. 16*rows != s->avctx->coded_height) {
  58. avcodec_set_dimensions(s->avctx, 16*cols, 16*rows);
  59. return 2;
  60. }
  61. }
  62. return 1;
  63. }
  64. /* Gives very similar result than the vp6 version except in a few cases */
  65. static int vp5_adjust(int v, int t)
  66. {
  67. int s2, s1 = v >> 31;
  68. v ^= s1;
  69. v -= s1;
  70. v *= v < 2*t;
  71. v -= t;
  72. s2 = v >> 31;
  73. v ^= s2;
  74. v -= s2;
  75. v = t - v;
  76. v += s1;
  77. v ^= s1;
  78. return v;
  79. }
  80. static void vp5_parse_vector_adjustment(VP56Context *s, VP56mv *vect)
  81. {
  82. VP56RangeCoder *c = &s->c;
  83. VP56Model *model = s->modelp;
  84. int comp, di;
  85. for (comp=0; comp<2; comp++) {
  86. int delta = 0;
  87. if (vp56_rac_get_prob(c, model->vector_dct[comp])) {
  88. int sign = vp56_rac_get_prob(c, model->vector_sig[comp]);
  89. di = vp56_rac_get_prob(c, model->vector_pdi[comp][0]);
  90. di |= vp56_rac_get_prob(c, model->vector_pdi[comp][1]) << 1;
  91. delta = vp56_rac_get_tree(c, vp56_pva_tree,
  92. model->vector_pdv[comp]);
  93. delta = di | (delta << 2);
  94. delta = (delta ^ -sign) + sign;
  95. }
  96. if (!comp)
  97. vect->x = delta;
  98. else
  99. vect->y = delta;
  100. }
  101. }
  102. static void vp5_parse_vector_models(VP56Context *s)
  103. {
  104. VP56RangeCoder *c = &s->c;
  105. VP56Model *model = s->modelp;
  106. int comp, node;
  107. for (comp=0; comp<2; comp++) {
  108. if (vp56_rac_get_prob(c, vp5_vmc_pct[comp][0]))
  109. model->vector_dct[comp] = vp56_rac_gets_nn(c, 7);
  110. if (vp56_rac_get_prob(c, vp5_vmc_pct[comp][1]))
  111. model->vector_sig[comp] = vp56_rac_gets_nn(c, 7);
  112. if (vp56_rac_get_prob(c, vp5_vmc_pct[comp][2]))
  113. model->vector_pdi[comp][0] = vp56_rac_gets_nn(c, 7);
  114. if (vp56_rac_get_prob(c, vp5_vmc_pct[comp][3]))
  115. model->vector_pdi[comp][1] = vp56_rac_gets_nn(c, 7);
  116. }
  117. for (comp=0; comp<2; comp++)
  118. for (node=0; node<7; node++)
  119. if (vp56_rac_get_prob(c, vp5_vmc_pct[comp][4 + node]))
  120. model->vector_pdv[comp][node] = vp56_rac_gets_nn(c, 7);
  121. }
  122. static void vp5_parse_coeff_models(VP56Context *s)
  123. {
  124. VP56RangeCoder *c = &s->c;
  125. VP56Model *model = s->modelp;
  126. uint8_t def_prob[11];
  127. int node, cg, ctx;
  128. int ct; /* code type */
  129. int pt; /* plane type (0 for Y, 1 for U or V) */
  130. memset(def_prob, 0x80, sizeof(def_prob));
  131. for (pt=0; pt<2; pt++)
  132. for (node=0; node<11; node++)
  133. if (vp56_rac_get_prob(c, vp5_dccv_pct[pt][node])) {
  134. def_prob[node] = vp56_rac_gets_nn(c, 7);
  135. model->coeff_dccv[pt][node] = def_prob[node];
  136. } else if (s->framep[VP56_FRAME_CURRENT]->key_frame) {
  137. model->coeff_dccv[pt][node] = def_prob[node];
  138. }
  139. for (ct=0; ct<3; ct++)
  140. for (pt=0; pt<2; pt++)
  141. for (cg=0; cg<6; cg++)
  142. for (node=0; node<11; node++)
  143. if (vp56_rac_get_prob(c, vp5_ract_pct[ct][pt][cg][node])) {
  144. def_prob[node] = vp56_rac_gets_nn(c, 7);
  145. model->coeff_ract[pt][ct][cg][node] = def_prob[node];
  146. } else if (s->framep[VP56_FRAME_CURRENT]->key_frame) {
  147. model->coeff_ract[pt][ct][cg][node] = def_prob[node];
  148. }
  149. /* coeff_dcct is a linear combination of coeff_dccv */
  150. for (pt=0; pt<2; pt++)
  151. for (ctx=0; ctx<36; ctx++)
  152. for (node=0; node<5; node++)
  153. 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);
  154. /* coeff_acct is a linear combination of coeff_ract */
  155. for (ct=0; ct<3; ct++)
  156. for (pt=0; pt<2; pt++)
  157. for (cg=0; cg<3; cg++)
  158. for (ctx=0; ctx<6; ctx++)
  159. for (node=0; node<5; node++)
  160. 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);
  161. }
  162. static void vp5_parse_coeff(VP56Context *s)
  163. {
  164. VP56RangeCoder *c = &s->c;
  165. VP56Model *model = s->modelp;
  166. uint8_t *permute = s->scantable.permutated;
  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. for (b=0; b<6; b++) {
  172. int ct = 1; /* code type */
  173. if (b > 3) pt = 1;
  174. ctx = 6*s->coeff_ctx[vp56_b6to4[b]][0]
  175. + s->above_blocks[s->above_block_idx[b]].not_null_dc;
  176. model1 = model->coeff_dccv[pt];
  177. model2 = model->coeff_dcct[pt][ctx];
  178. for (coeff_idx=0; coeff_idx<64; ) {
  179. if (vp56_rac_get_prob(c, model2[0])) {
  180. if (vp56_rac_get_prob(c, model2[2])) {
  181. if (vp56_rac_get_prob(c, model2[3])) {
  182. s->coeff_ctx[vp56_b6to4[b]][coeff_idx] = 4;
  183. idx = vp56_rac_get_tree(c, vp56_pc_tree, model1);
  184. sign = vp56_rac_get(c);
  185. coeff = vp56_coeff_bias[idx+5];
  186. for (i=vp56_coeff_bit_length[idx]; i>=0; i--)
  187. coeff += vp56_rac_get_prob(c, vp56_coeff_parse_table[idx][i]) << i;
  188. } else {
  189. if (vp56_rac_get_prob(c, model2[4])) {
  190. coeff = 3 + vp56_rac_get_prob(c, model1[5]);
  191. s->coeff_ctx[vp56_b6to4[b]][coeff_idx] = 3;
  192. } else {
  193. coeff = 2;
  194. s->coeff_ctx[vp56_b6to4[b]][coeff_idx] = 2;
  195. }
  196. sign = vp56_rac_get(c);
  197. }
  198. ct = 2;
  199. } else {
  200. ct = 1;
  201. s->coeff_ctx[vp56_b6to4[b]][coeff_idx] = 1;
  202. sign = vp56_rac_get(c);
  203. coeff = 1;
  204. }
  205. coeff = (coeff ^ -sign) + sign;
  206. if (coeff_idx)
  207. coeff *= s->dequant_ac;
  208. s->block_coeff[b][permute[coeff_idx]] = coeff;
  209. } else {
  210. if (ct && !vp56_rac_get_prob(c, model2[1]))
  211. break;
  212. ct = 0;
  213. s->coeff_ctx[vp56_b6to4[b]][coeff_idx] = 0;
  214. }
  215. cg = vp5_coeff_groups[++coeff_idx];
  216. ctx = s->coeff_ctx[vp56_b6to4[b]][coeff_idx];
  217. model1 = model->coeff_ract[pt][ct][cg];
  218. model2 = cg > 2 ? model1 : model->coeff_acct[pt][ct][cg][ctx];
  219. }
  220. ctx_last = FFMIN(s->coeff_ctx_last[vp56_b6to4[b]], 24);
  221. s->coeff_ctx_last[vp56_b6to4[b]] = coeff_idx;
  222. if (coeff_idx < ctx_last)
  223. for (i=coeff_idx; i<=ctx_last; i++)
  224. s->coeff_ctx[vp56_b6to4[b]][i] = 5;
  225. s->above_blocks[s->above_block_idx[b]].not_null_dc = s->coeff_ctx[vp56_b6to4[b]][0];
  226. }
  227. }
  228. static void vp5_default_models_init(VP56Context *s)
  229. {
  230. VP56Model *model = s->modelp;
  231. int i;
  232. for (i=0; i<2; i++) {
  233. model->vector_sig[i] = 0x80;
  234. model->vector_dct[i] = 0x80;
  235. model->vector_pdi[i][0] = 0x55;
  236. model->vector_pdi[i][1] = 0x80;
  237. }
  238. memcpy(model->mb_types_stats, vp56_def_mb_types_stats, sizeof(model->mb_types_stats));
  239. memset(model->vector_pdv, 0x80, sizeof(model->vector_pdv));
  240. }
  241. static av_cold int vp5_decode_init(AVCodecContext *avctx)
  242. {
  243. VP56Context *s = avctx->priv_data;
  244. vp56_init(avctx, 1, 0);
  245. s->vp56_coord_div = vp5_coord_div;
  246. s->parse_vector_adjustment = vp5_parse_vector_adjustment;
  247. s->adjust = vp5_adjust;
  248. s->parse_coeff = vp5_parse_coeff;
  249. s->default_models_init = vp5_default_models_init;
  250. s->parse_vector_models = vp5_parse_vector_models;
  251. s->parse_coeff_models = vp5_parse_coeff_models;
  252. s->parse_header = vp5_parse_header;
  253. return 0;
  254. }
  255. AVCodec vp5_decoder = {
  256. "vp5",
  257. CODEC_TYPE_VIDEO,
  258. CODEC_ID_VP5,
  259. sizeof(VP56Context),
  260. vp5_decode_init,
  261. NULL,
  262. vp56_free,
  263. vp56_decode_frame,
  264. CODEC_CAP_DR1,
  265. .long_name = NULL_IF_CONFIG_SMALL("On2 VP5"),
  266. };