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.

381 lines
10KB

  1. /*
  2. * Copyright (C) 2006 Aurelien Jacobs <aurel@gnuage.org>
  3. *
  4. * This file is part of Libav.
  5. *
  6. * Libav 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. * Libav 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 Libav; 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. #ifndef AVCODEC_VP56_H
  25. #define AVCODEC_VP56_H
  26. #include "vp56data.h"
  27. #include "dsputil.h"
  28. #include "get_bits.h"
  29. #include "hpeldsp.h"
  30. #include "bytestream.h"
  31. #include "h264chroma.h"
  32. #include "videodsp.h"
  33. #include "vp3dsp.h"
  34. #include "vp56dsp.h"
  35. typedef struct vp56_context VP56Context;
  36. typedef struct VP56mv {
  37. DECLARE_ALIGNED(4, int16_t, x);
  38. int16_t y;
  39. } VP56mv;
  40. #define VP56_SIZE_CHANGE 1
  41. typedef void (*VP56ParseVectorAdjustment)(VP56Context *s,
  42. VP56mv *vect);
  43. typedef void (*VP56Filter)(VP56Context *s, uint8_t *dst, uint8_t *src,
  44. int offset1, int offset2, int stride,
  45. VP56mv mv, int mask, int select, int luma);
  46. typedef void (*VP56ParseCoeff)(VP56Context *s);
  47. typedef void (*VP56DefaultModelsInit)(VP56Context *s);
  48. typedef void (*VP56ParseVectorModels)(VP56Context *s);
  49. typedef int (*VP56ParseCoeffModels)(VP56Context *s);
  50. typedef int (*VP56ParseHeader)(VP56Context *s, const uint8_t *buf,
  51. int buf_size, int *golden_frame);
  52. typedef struct VP56RangeCoder {
  53. int high;
  54. int bits; /* stored negated (i.e. negative "bits" is a positive number of
  55. bits left) in order to eliminate a negate in cache refilling */
  56. const uint8_t *buffer;
  57. const uint8_t *end;
  58. unsigned int code_word;
  59. } VP56RangeCoder;
  60. typedef struct VP56RefDc {
  61. uint8_t not_null_dc;
  62. VP56Frame ref_frame;
  63. int16_t dc_coeff;
  64. } VP56RefDc;
  65. typedef struct VP56Macroblock {
  66. uint8_t type;
  67. VP56mv mv;
  68. } VP56Macroblock;
  69. typedef struct VP56Model {
  70. uint8_t coeff_reorder[64]; /* used in vp6 only */
  71. uint8_t coeff_index_to_pos[64]; /* used in vp6 only */
  72. uint8_t vector_sig[2]; /* delta sign */
  73. uint8_t vector_dct[2]; /* delta coding types */
  74. uint8_t vector_pdi[2][2]; /* predefined delta init */
  75. uint8_t vector_pdv[2][7]; /* predefined delta values */
  76. uint8_t vector_fdv[2][8]; /* 8 bit delta value definition */
  77. uint8_t coeff_dccv[2][11]; /* DC coeff value */
  78. uint8_t coeff_ract[2][3][6][11]; /* Run/AC coding type and AC coeff value */
  79. uint8_t coeff_acct[2][3][3][6][5];/* vp5 only AC coding type for coding group < 3 */
  80. uint8_t coeff_dcct[2][36][5]; /* DC coeff coding type */
  81. uint8_t coeff_runv[2][14]; /* run value (vp6 only) */
  82. uint8_t mb_type[3][10][10]; /* model for decoding MB type */
  83. uint8_t mb_types_stats[3][10][2];/* contextual, next MB type stats */
  84. } VP56Model;
  85. struct vp56_context {
  86. AVCodecContext *avctx;
  87. H264ChromaContext h264chroma;
  88. HpelDSPContext hdsp;
  89. VideoDSPContext vdsp;
  90. VP3DSPContext vp3dsp;
  91. VP56DSPContext vp56dsp;
  92. uint8_t idct_scantable[64];
  93. AVFrame *frames[4];
  94. uint8_t *edge_emu_buffer_alloc;
  95. uint8_t *edge_emu_buffer;
  96. VP56RangeCoder c;
  97. VP56RangeCoder cc;
  98. VP56RangeCoder *ccp;
  99. int sub_version;
  100. /* frame info */
  101. int plane_width[4];
  102. int plane_height[4];
  103. int mb_width; /* number of horizontal MB */
  104. int mb_height; /* number of vertical MB */
  105. int block_offset[6];
  106. int quantizer;
  107. uint16_t dequant_dc;
  108. uint16_t dequant_ac;
  109. /* DC predictors management */
  110. VP56RefDc *above_blocks;
  111. VP56RefDc left_block[4];
  112. int above_block_idx[6];
  113. int16_t prev_dc[3][3]; /* [plan][ref_frame] */
  114. /* blocks / macroblock */
  115. VP56mb mb_type;
  116. VP56Macroblock *macroblocks;
  117. DECLARE_ALIGNED(16, int16_t, block_coeff)[6][64];
  118. /* motion vectors */
  119. VP56mv mv[6]; /* vectors for each block in MB */
  120. VP56mv vector_candidate[2];
  121. int vector_candidate_pos;
  122. /* filtering hints */
  123. int filter_header; /* used in vp6 only */
  124. int deblock_filtering;
  125. int filter_selection;
  126. int filter_mode;
  127. int max_vector_length;
  128. int sample_variance_threshold;
  129. uint8_t coeff_ctx[4][64]; /* used in vp5 only */
  130. uint8_t coeff_ctx_last[4]; /* used in vp5 only */
  131. int has_alpha;
  132. /* upside-down flipping hints */
  133. int flip; /* are we flipping ? */
  134. int frbi; /* first row block index in MB */
  135. int srbi; /* second row block index in MB */
  136. int stride[4]; /* stride for each plan */
  137. const uint8_t *vp56_coord_div;
  138. VP56ParseVectorAdjustment parse_vector_adjustment;
  139. VP56Filter filter;
  140. VP56ParseCoeff parse_coeff;
  141. VP56DefaultModelsInit default_models_init;
  142. VP56ParseVectorModels parse_vector_models;
  143. VP56ParseCoeffModels parse_coeff_models;
  144. VP56ParseHeader parse_header;
  145. VP56Model *modelp;
  146. VP56Model models[2];
  147. /* huffman decoding */
  148. int use_huffman;
  149. GetBitContext gb;
  150. VLC dccv_vlc[2];
  151. VLC runv_vlc[2];
  152. VLC ract_vlc[2][3][6];
  153. unsigned int nb_null[2][2]; /* number of consecutive NULL DC/AC */
  154. };
  155. int ff_vp56_init(AVCodecContext *avctx, int flip, int has_alpha);
  156. int ff_vp56_free(AVCodecContext *avctx);
  157. void ff_vp56_init_dequant(VP56Context *s, int quantizer);
  158. int ff_vp56_decode_frame(AVCodecContext *avctx, void *data, int *got_frame,
  159. AVPacket *avpkt);
  160. /**
  161. * vp56 specific range coder implementation
  162. */
  163. extern const uint8_t ff_vp56_norm_shift[256];
  164. void ff_vp56_init_range_decoder(VP56RangeCoder *c, const uint8_t *buf, int buf_size);
  165. static av_always_inline unsigned int vp56_rac_renorm(VP56RangeCoder *c)
  166. {
  167. int shift = ff_vp56_norm_shift[c->high];
  168. int bits = c->bits;
  169. unsigned int code_word = c->code_word;
  170. c->high <<= shift;
  171. code_word <<= shift;
  172. bits += shift;
  173. if(bits >= 0 && c->buffer < c->end) {
  174. code_word |= bytestream_get_be16(&c->buffer) << bits;
  175. bits -= 16;
  176. }
  177. c->bits = bits;
  178. return code_word;
  179. }
  180. #if ARCH_ARM
  181. #include "arm/vp56_arith.h"
  182. #elif ARCH_X86
  183. #include "x86/vp56_arith.h"
  184. #endif
  185. #ifndef vp56_rac_get_prob
  186. #define vp56_rac_get_prob vp56_rac_get_prob
  187. static av_always_inline int vp56_rac_get_prob(VP56RangeCoder *c, uint8_t prob)
  188. {
  189. unsigned int code_word = vp56_rac_renorm(c);
  190. unsigned int low = 1 + (((c->high - 1) * prob) >> 8);
  191. unsigned int low_shift = low << 16;
  192. int bit = code_word >= low_shift;
  193. c->high = bit ? c->high - low : low;
  194. c->code_word = bit ? code_word - low_shift : code_word;
  195. return bit;
  196. }
  197. #endif
  198. #ifndef vp56_rac_get_prob_branchy
  199. // branchy variant, to be used where there's a branch based on the bit decoded
  200. static av_always_inline int vp56_rac_get_prob_branchy(VP56RangeCoder *c, int prob)
  201. {
  202. unsigned long code_word = vp56_rac_renorm(c);
  203. unsigned low = 1 + (((c->high - 1) * prob) >> 8);
  204. unsigned low_shift = low << 16;
  205. if (code_word >= low_shift) {
  206. c->high -= low;
  207. c->code_word = code_word - low_shift;
  208. return 1;
  209. }
  210. c->high = low;
  211. c->code_word = code_word;
  212. return 0;
  213. }
  214. #endif
  215. static av_always_inline int vp56_rac_get(VP56RangeCoder *c)
  216. {
  217. unsigned int code_word = vp56_rac_renorm(c);
  218. /* equiprobable */
  219. int low = (c->high + 1) >> 1;
  220. unsigned int low_shift = low << 16;
  221. int bit = code_word >= low_shift;
  222. if (bit) {
  223. c->high -= low;
  224. code_word -= low_shift;
  225. } else {
  226. c->high = low;
  227. }
  228. c->code_word = code_word;
  229. return bit;
  230. }
  231. // rounding is different than vp56_rac_get, is vp56_rac_get wrong?
  232. static av_always_inline int vp8_rac_get(VP56RangeCoder *c)
  233. {
  234. return vp56_rac_get_prob(c, 128);
  235. }
  236. static av_unused int vp56_rac_gets(VP56RangeCoder *c, int bits)
  237. {
  238. int value = 0;
  239. while (bits--) {
  240. value = (value << 1) | vp56_rac_get(c);
  241. }
  242. return value;
  243. }
  244. static av_unused int vp8_rac_get_uint(VP56RangeCoder *c, int bits)
  245. {
  246. int value = 0;
  247. while (bits--) {
  248. value = (value << 1) | vp8_rac_get(c);
  249. }
  250. return value;
  251. }
  252. // fixme: add 1 bit to all the calls to this?
  253. static av_unused int vp8_rac_get_sint(VP56RangeCoder *c, int bits)
  254. {
  255. int v;
  256. if (!vp8_rac_get(c))
  257. return 0;
  258. v = vp8_rac_get_uint(c, bits);
  259. if (vp8_rac_get(c))
  260. v = -v;
  261. return v;
  262. }
  263. // P(7)
  264. static av_unused int vp56_rac_gets_nn(VP56RangeCoder *c, int bits)
  265. {
  266. int v = vp56_rac_gets(c, 7) << 1;
  267. return v + !v;
  268. }
  269. static av_unused int vp8_rac_get_nn(VP56RangeCoder *c)
  270. {
  271. int v = vp8_rac_get_uint(c, 7) << 1;
  272. return v + !v;
  273. }
  274. static av_always_inline
  275. int vp56_rac_get_tree(VP56RangeCoder *c,
  276. const VP56Tree *tree,
  277. const uint8_t *probs)
  278. {
  279. while (tree->val > 0) {
  280. if (vp56_rac_get_prob(c, probs[tree->prob_idx]))
  281. tree += tree->val;
  282. else
  283. tree++;
  284. }
  285. return -tree->val;
  286. }
  287. /**
  288. * This is identical to vp8_rac_get_tree except for the possibility of starting
  289. * on a node other than the root node, needed for coeff decode where this is
  290. * used to save a bit after a 0 token (by disallowing EOB to immediately follow.)
  291. */
  292. static av_always_inline
  293. int vp8_rac_get_tree_with_offset(VP56RangeCoder *c, const int8_t (*tree)[2],
  294. const uint8_t *probs, int i)
  295. {
  296. do {
  297. i = tree[i][vp56_rac_get_prob(c, probs[i])];
  298. } while (i > 0);
  299. return -i;
  300. }
  301. // how probabilities are associated with decisions is different I think
  302. // well, the new scheme fits in the old but this way has one fewer branches per decision
  303. static av_always_inline
  304. int vp8_rac_get_tree(VP56RangeCoder *c, const int8_t (*tree)[2],
  305. const uint8_t *probs)
  306. {
  307. return vp8_rac_get_tree_with_offset(c, tree, probs, 0);
  308. }
  309. // DCTextra
  310. static av_always_inline int vp8_rac_get_coeff(VP56RangeCoder *c, const uint8_t *prob)
  311. {
  312. int v = 0;
  313. do {
  314. v = (v<<1) + vp56_rac_get_prob(c, *prob++);
  315. } while (*prob);
  316. return v;
  317. }
  318. #endif /* AVCODEC_VP56_H */