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.

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