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.

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