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.

291 lines
10KB

  1. /*
  2. * RV30 decoder
  3. * Copyright (c) 2007 Konstantin Shishkov
  4. *
  5. * This file is part of Libav.
  6. *
  7. * Libav is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2.1 of the License, or (at your option) any later version.
  11. *
  12. * Libav is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with Libav; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. /**
  22. * @file
  23. * RV30 decoder
  24. */
  25. #include "avcodec.h"
  26. #include "mpegvideo.h"
  27. #include "golomb.h"
  28. #include "rv34.h"
  29. #include "rv30data.h"
  30. static int rv30_parse_slice_header(RV34DecContext *r, GetBitContext *gb, SliceInfo *si)
  31. {
  32. AVCodecContext *avctx = r->s.avctx;
  33. int mb_bits;
  34. int w = r->s.width, h = r->s.height;
  35. int mb_size;
  36. int rpr;
  37. memset(si, 0, sizeof(SliceInfo));
  38. if(get_bits(gb, 3))
  39. return -1;
  40. si->type = get_bits(gb, 2);
  41. if(si->type == 1) si->type = 0;
  42. if(get_bits1(gb))
  43. return -1;
  44. si->quant = get_bits(gb, 5);
  45. skip_bits1(gb);
  46. si->pts = get_bits(gb, 13);
  47. rpr = get_bits(gb, r->rpr);
  48. if(rpr){
  49. if (avctx->extradata_size < rpr * 2 + 8) {
  50. av_log(avctx, AV_LOG_ERROR,
  51. "Insufficient extradata - need at least %d bytes, got %d\n",
  52. 8 + rpr * 2, avctx->extradata_size);
  53. return AVERROR(EINVAL);
  54. }
  55. w = r->s.avctx->extradata[6 + rpr*2] << 2;
  56. h = r->s.avctx->extradata[7 + rpr*2] << 2;
  57. }
  58. si->width = w;
  59. si->height = h;
  60. mb_size = ((w + 15) >> 4) * ((h + 15) >> 4);
  61. mb_bits = ff_rv34_get_start_offset(gb, mb_size);
  62. si->start = get_bits(gb, mb_bits);
  63. skip_bits1(gb);
  64. return 0;
  65. }
  66. /**
  67. * Decode 4x4 intra types array.
  68. */
  69. static int rv30_decode_intra_types(RV34DecContext *r, GetBitContext *gb, int8_t *dst)
  70. {
  71. int i, j, k;
  72. for(i = 0; i < 4; i++, dst += r->intra_types_stride - 4){
  73. for(j = 0; j < 4; j+= 2){
  74. unsigned code = svq3_get_ue_golomb(gb) << 1;
  75. if(code >= 81*2){
  76. av_log(r->s.avctx, AV_LOG_ERROR, "Incorrect intra prediction code\n");
  77. return -1;
  78. }
  79. for(k = 0; k < 2; k++){
  80. int A = dst[-r->intra_types_stride] + 1;
  81. int B = dst[-1] + 1;
  82. *dst++ = rv30_itype_from_context[A * 90 + B * 9 + rv30_itype_code[code + k]];
  83. if(dst[-1] == 9){
  84. av_log(r->s.avctx, AV_LOG_ERROR, "Incorrect intra prediction mode\n");
  85. return -1;
  86. }
  87. }
  88. }
  89. }
  90. return 0;
  91. }
  92. /**
  93. * Decode macroblock information.
  94. */
  95. static int rv30_decode_mb_info(RV34DecContext *r)
  96. {
  97. static const int rv30_p_types[6] = { RV34_MB_SKIP, RV34_MB_P_16x16, RV34_MB_P_8x8, -1, RV34_MB_TYPE_INTRA, RV34_MB_TYPE_INTRA16x16 };
  98. static const int rv30_b_types[6] = { RV34_MB_SKIP, RV34_MB_B_DIRECT, RV34_MB_B_FORWARD, RV34_MB_B_BACKWARD, RV34_MB_TYPE_INTRA, RV34_MB_TYPE_INTRA16x16 };
  99. MpegEncContext *s = &r->s;
  100. GetBitContext *gb = &s->gb;
  101. unsigned code = svq3_get_ue_golomb(gb);
  102. if (code > 11) {
  103. av_log(s->avctx, AV_LOG_ERROR, "Incorrect MB type code\n");
  104. return -1;
  105. }
  106. if(code > 5){
  107. av_log(s->avctx, AV_LOG_ERROR, "dquant needed\n");
  108. code -= 6;
  109. }
  110. if(s->pict_type != AV_PICTURE_TYPE_B)
  111. return rv30_p_types[code];
  112. else
  113. return rv30_b_types[code];
  114. }
  115. static inline void rv30_weak_loop_filter(uint8_t *src, const int step,
  116. const int stride, const int lim)
  117. {
  118. const uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;
  119. int i, diff;
  120. for(i = 0; i < 4; i++){
  121. diff = ((src[-2*step] - src[1*step]) - (src[-1*step] - src[0*step])*4) >> 3;
  122. diff = av_clip(diff, -lim, lim);
  123. src[-1*step] = cm[src[-1*step] + diff];
  124. src[ 0*step] = cm[src[ 0*step] - diff];
  125. src += stride;
  126. }
  127. }
  128. static void rv30_loop_filter(RV34DecContext *r, int row)
  129. {
  130. MpegEncContext *s = &r->s;
  131. int mb_pos, mb_x;
  132. int i, j, k;
  133. uint8_t *Y, *C;
  134. int loc_lim, cur_lim, left_lim = 0, top_lim = 0;
  135. mb_pos = row * s->mb_stride;
  136. for(mb_x = 0; mb_x < s->mb_width; mb_x++, mb_pos++){
  137. int mbtype = s->current_picture_ptr->mb_type[mb_pos];
  138. if(IS_INTRA(mbtype) || IS_SEPARATE_DC(mbtype))
  139. r->deblock_coefs[mb_pos] = 0xFFFF;
  140. if(IS_INTRA(mbtype))
  141. r->cbp_chroma[mb_pos] = 0xFF;
  142. }
  143. /* all vertical edges are filtered first
  144. * and horizontal edges are filtered on the next iteration
  145. */
  146. mb_pos = row * s->mb_stride;
  147. for(mb_x = 0; mb_x < s->mb_width; mb_x++, mb_pos++){
  148. cur_lim = rv30_loop_filt_lim[s->current_picture_ptr->qscale_table[mb_pos]];
  149. if(mb_x)
  150. left_lim = rv30_loop_filt_lim[s->current_picture_ptr->qscale_table[mb_pos - 1]];
  151. for(j = 0; j < 16; j += 4){
  152. Y = s->current_picture_ptr->f.data[0] + mb_x*16 + (row*16 + j) * s->linesize + 4 * !mb_x;
  153. for(i = !mb_x; i < 4; i++, Y += 4){
  154. int ij = i + j;
  155. loc_lim = 0;
  156. if(r->deblock_coefs[mb_pos] & (1 << ij))
  157. loc_lim = cur_lim;
  158. else if(!i && r->deblock_coefs[mb_pos - 1] & (1 << (ij + 3)))
  159. loc_lim = left_lim;
  160. else if( i && r->deblock_coefs[mb_pos] & (1 << (ij - 1)))
  161. loc_lim = cur_lim;
  162. if(loc_lim)
  163. rv30_weak_loop_filter(Y, 1, s->linesize, loc_lim);
  164. }
  165. }
  166. for(k = 0; k < 2; k++){
  167. int cur_cbp, left_cbp = 0;
  168. cur_cbp = (r->cbp_chroma[mb_pos] >> (k*4)) & 0xF;
  169. if(mb_x)
  170. left_cbp = (r->cbp_chroma[mb_pos - 1] >> (k*4)) & 0xF;
  171. for(j = 0; j < 8; j += 4){
  172. C = s->current_picture_ptr->f.data[k + 1] + mb_x*8 + (row*8 + j) * s->uvlinesize + 4 * !mb_x;
  173. for(i = !mb_x; i < 2; i++, C += 4){
  174. int ij = i + (j >> 1);
  175. loc_lim = 0;
  176. if (cur_cbp & (1 << ij))
  177. loc_lim = cur_lim;
  178. else if(!i && left_cbp & (1 << (ij + 1)))
  179. loc_lim = left_lim;
  180. else if( i && cur_cbp & (1 << (ij - 1)))
  181. loc_lim = cur_lim;
  182. if(loc_lim)
  183. rv30_weak_loop_filter(C, 1, s->uvlinesize, loc_lim);
  184. }
  185. }
  186. }
  187. }
  188. mb_pos = row * s->mb_stride;
  189. for(mb_x = 0; mb_x < s->mb_width; mb_x++, mb_pos++){
  190. cur_lim = rv30_loop_filt_lim[s->current_picture_ptr->qscale_table[mb_pos]];
  191. if(row)
  192. top_lim = rv30_loop_filt_lim[s->current_picture_ptr->qscale_table[mb_pos - s->mb_stride]];
  193. for(j = 4*!row; j < 16; j += 4){
  194. Y = s->current_picture_ptr->f.data[0] + mb_x*16 + (row*16 + j) * s->linesize;
  195. for(i = 0; i < 4; i++, Y += 4){
  196. int ij = i + j;
  197. loc_lim = 0;
  198. if(r->deblock_coefs[mb_pos] & (1 << ij))
  199. loc_lim = cur_lim;
  200. else if(!j && r->deblock_coefs[mb_pos - s->mb_stride] & (1 << (ij + 12)))
  201. loc_lim = top_lim;
  202. else if( j && r->deblock_coefs[mb_pos] & (1 << (ij - 4)))
  203. loc_lim = cur_lim;
  204. if(loc_lim)
  205. rv30_weak_loop_filter(Y, s->linesize, 1, loc_lim);
  206. }
  207. }
  208. for(k = 0; k < 2; k++){
  209. int cur_cbp, top_cbp = 0;
  210. cur_cbp = (r->cbp_chroma[mb_pos] >> (k*4)) & 0xF;
  211. if(row)
  212. top_cbp = (r->cbp_chroma[mb_pos - s->mb_stride] >> (k*4)) & 0xF;
  213. for(j = 4*!row; j < 8; j += 4){
  214. C = s->current_picture_ptr->f.data[k+1] + mb_x*8 + (row*8 + j) * s->uvlinesize;
  215. for(i = 0; i < 2; i++, C += 4){
  216. int ij = i + (j >> 1);
  217. loc_lim = 0;
  218. if (r->cbp_chroma[mb_pos] & (1 << ij))
  219. loc_lim = cur_lim;
  220. else if(!j && top_cbp & (1 << (ij + 2)))
  221. loc_lim = top_lim;
  222. else if( j && cur_cbp & (1 << (ij - 2)))
  223. loc_lim = cur_lim;
  224. if(loc_lim)
  225. rv30_weak_loop_filter(C, s->uvlinesize, 1, loc_lim);
  226. }
  227. }
  228. }
  229. }
  230. }
  231. /**
  232. * Initialize decoder.
  233. */
  234. static av_cold int rv30_decode_init(AVCodecContext *avctx)
  235. {
  236. RV34DecContext *r = avctx->priv_data;
  237. int ret;
  238. r->rv30 = 1;
  239. if ((ret = ff_rv34_decode_init(avctx)) < 0)
  240. return ret;
  241. if(avctx->extradata_size < 2){
  242. av_log(avctx, AV_LOG_ERROR, "Extradata is too small.\n");
  243. return -1;
  244. }
  245. r->rpr = (avctx->extradata[1] & 7) >> 1;
  246. r->rpr = FFMIN(r->rpr + 1, 3);
  247. r->parse_slice_header = rv30_parse_slice_header;
  248. r->decode_intra_types = rv30_decode_intra_types;
  249. r->decode_mb_info = rv30_decode_mb_info;
  250. r->loop_filter = rv30_loop_filter;
  251. r->luma_dc_quant_i = rv30_luma_dc_quant;
  252. r->luma_dc_quant_p = rv30_luma_dc_quant;
  253. return 0;
  254. }
  255. AVCodec ff_rv30_decoder = {
  256. .name = "rv30",
  257. .long_name = NULL_IF_CONFIG_SMALL("RealVideo 3.0"),
  258. .type = AVMEDIA_TYPE_VIDEO,
  259. .id = AV_CODEC_ID_RV30,
  260. .priv_data_size = sizeof(RV34DecContext),
  261. .init = rv30_decode_init,
  262. .close = ff_rv34_decode_end,
  263. .decode = ff_rv34_decode_frame,
  264. .capabilities = CODEC_CAP_DR1 | CODEC_CAP_DELAY |
  265. CODEC_CAP_FRAME_THREADS,
  266. .flush = ff_mpeg_flush,
  267. .pix_fmts = ff_pixfmt_list_420,
  268. .init_thread_copy = ONLY_IF_THREADS_ENABLED(ff_rv34_decode_init_thread_copy),
  269. .update_thread_context = ONLY_IF_THREADS_ENABLED(ff_rv34_decode_update_thread_context),
  270. };