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.

295 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 "golomb_legacy.h"
  27. #include "mpegutils.h"
  28. #include "mpegvideo.h"
  29. #include "rv34.h"
  30. #include "rv30data.h"
  31. static int rv30_parse_slice_header(RV34DecContext *r, GetBitContext *gb, SliceInfo *si)
  32. {
  33. AVCodecContext *avctx = r->s.avctx;
  34. int mb_bits;
  35. int w = r->s.width, h = r->s.height;
  36. int mb_size;
  37. int rpr;
  38. memset(si, 0, sizeof(SliceInfo));
  39. if(get_bits(gb, 3))
  40. return -1;
  41. si->type = get_bits(gb, 2);
  42. if(si->type == 1) si->type = 0;
  43. if(get_bits1(gb))
  44. return -1;
  45. si->quant = get_bits(gb, 5);
  46. skip_bits1(gb);
  47. si->pts = get_bits(gb, 13);
  48. rpr = get_bits(gb, r->rpr);
  49. if(rpr){
  50. if (avctx->extradata_size < rpr * 2 + 8) {
  51. av_log(avctx, AV_LOG_ERROR,
  52. "Insufficient extradata - need at least %d bytes, got %d\n",
  53. 8 + rpr * 2, avctx->extradata_size);
  54. return AVERROR(EINVAL);
  55. }
  56. w = r->s.avctx->extradata[6 + rpr*2] << 2;
  57. h = r->s.avctx->extradata[7 + rpr*2] << 2;
  58. }
  59. si->width = w;
  60. si->height = h;
  61. mb_size = ((w + 15) >> 4) * ((h + 15) >> 4);
  62. mb_bits = ff_rv34_get_start_offset(gb, mb_size);
  63. si->start = get_bits(gb, mb_bits);
  64. skip_bits1(gb);
  65. return 0;
  66. }
  67. /**
  68. * Decode 4x4 intra types array.
  69. */
  70. static int rv30_decode_intra_types(RV34DecContext *r, GetBitContext *gb, int8_t *dst)
  71. {
  72. int i, j, k;
  73. for(i = 0; i < 4; i++, dst += r->intra_types_stride - 4){
  74. for(j = 0; j < 4; j+= 2){
  75. unsigned code = get_interleaved_ue_golomb(gb) << 1;
  76. if(code >= 81*2){
  77. av_log(r->s.avctx, AV_LOG_ERROR, "Incorrect intra prediction code\n");
  78. return -1;
  79. }
  80. for(k = 0; k < 2; k++){
  81. int A = dst[-r->intra_types_stride] + 1;
  82. int B = dst[-1] + 1;
  83. *dst++ = rv30_itype_from_context[A * 90 + B * 9 + rv30_itype_code[code + k]];
  84. if(dst[-1] == 9){
  85. av_log(r->s.avctx, AV_LOG_ERROR, "Incorrect intra prediction mode\n");
  86. return -1;
  87. }
  88. }
  89. }
  90. }
  91. return 0;
  92. }
  93. /**
  94. * Decode macroblock information.
  95. */
  96. static int rv30_decode_mb_info(RV34DecContext *r)
  97. {
  98. 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 };
  99. 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 };
  100. MpegEncContext *s = &r->s;
  101. GetBitContext *gb = &s->gb;
  102. unsigned code = get_interleaved_ue_golomb(gb);
  103. if (code > 11) {
  104. av_log(s->avctx, AV_LOG_ERROR, "Incorrect MB type code\n");
  105. return -1;
  106. }
  107. if(code > 5){
  108. av_log(s->avctx, AV_LOG_ERROR, "dquant needed\n");
  109. code -= 6;
  110. }
  111. if(s->pict_type != AV_PICTURE_TYPE_B)
  112. return rv30_p_types[code];
  113. else
  114. return rv30_b_types[code];
  115. }
  116. static inline void rv30_weak_loop_filter(uint8_t *src, const int step,
  117. const int stride, const int lim)
  118. {
  119. const uint8_t *cm = ff_crop_tab + MAX_NEG_CROP;
  120. int i, diff;
  121. for(i = 0; i < 4; i++){
  122. diff = ((src[-2*step] - src[1*step]) - (src[-1*step] - src[0*step])*4) >> 3;
  123. diff = av_clip(diff, -lim, lim);
  124. src[-1*step] = cm[src[-1*step] + diff];
  125. src[ 0*step] = cm[src[ 0*step] - diff];
  126. src += stride;
  127. }
  128. }
  129. static void rv30_loop_filter(RV34DecContext *r, int row)
  130. {
  131. MpegEncContext *s = &r->s;
  132. int mb_pos, mb_x;
  133. int i, j, k;
  134. uint8_t *Y, *C;
  135. int loc_lim, cur_lim, left_lim = 0, top_lim = 0;
  136. mb_pos = row * s->mb_stride;
  137. for(mb_x = 0; mb_x < s->mb_width; mb_x++, mb_pos++){
  138. int mbtype = s->current_picture_ptr->mb_type[mb_pos];
  139. if(IS_INTRA(mbtype) || IS_SEPARATE_DC(mbtype))
  140. r->deblock_coefs[mb_pos] = 0xFFFF;
  141. if(IS_INTRA(mbtype))
  142. r->cbp_chroma[mb_pos] = 0xFF;
  143. }
  144. /* all vertical edges are filtered first
  145. * and horizontal edges are filtered on the next iteration
  146. */
  147. mb_pos = row * s->mb_stride;
  148. for(mb_x = 0; mb_x < s->mb_width; mb_x++, mb_pos++){
  149. cur_lim = rv30_loop_filt_lim[s->current_picture_ptr->qscale_table[mb_pos]];
  150. if(mb_x)
  151. left_lim = rv30_loop_filt_lim[s->current_picture_ptr->qscale_table[mb_pos - 1]];
  152. for(j = 0; j < 16; j += 4){
  153. Y = s->current_picture_ptr->f->data[0] + mb_x*16 + (row*16 + j) * s->linesize + 4 * !mb_x;
  154. for(i = !mb_x; i < 4; i++, Y += 4){
  155. int ij = i + j;
  156. loc_lim = 0;
  157. if(r->deblock_coefs[mb_pos] & (1 << ij))
  158. loc_lim = cur_lim;
  159. else if(!i && r->deblock_coefs[mb_pos - 1] & (1 << (ij + 3)))
  160. loc_lim = left_lim;
  161. else if( i && r->deblock_coefs[mb_pos] & (1 << (ij - 1)))
  162. loc_lim = cur_lim;
  163. if(loc_lim)
  164. rv30_weak_loop_filter(Y, 1, s->linesize, loc_lim);
  165. }
  166. }
  167. for(k = 0; k < 2; k++){
  168. int cur_cbp, left_cbp = 0;
  169. cur_cbp = (r->cbp_chroma[mb_pos] >> (k*4)) & 0xF;
  170. if(mb_x)
  171. left_cbp = (r->cbp_chroma[mb_pos - 1] >> (k*4)) & 0xF;
  172. for(j = 0; j < 8; j += 4){
  173. C = s->current_picture_ptr->f->data[k + 1] + mb_x*8 + (row*8 + j) * s->uvlinesize + 4 * !mb_x;
  174. for(i = !mb_x; i < 2; i++, C += 4){
  175. int ij = i + (j >> 1);
  176. loc_lim = 0;
  177. if (cur_cbp & (1 << ij))
  178. loc_lim = cur_lim;
  179. else if(!i && left_cbp & (1 << (ij + 1)))
  180. loc_lim = left_lim;
  181. else if( i && cur_cbp & (1 << (ij - 1)))
  182. loc_lim = cur_lim;
  183. if(loc_lim)
  184. rv30_weak_loop_filter(C, 1, s->uvlinesize, loc_lim);
  185. }
  186. }
  187. }
  188. }
  189. mb_pos = row * s->mb_stride;
  190. for(mb_x = 0; mb_x < s->mb_width; mb_x++, mb_pos++){
  191. cur_lim = rv30_loop_filt_lim[s->current_picture_ptr->qscale_table[mb_pos]];
  192. if(row)
  193. top_lim = rv30_loop_filt_lim[s->current_picture_ptr->qscale_table[mb_pos - s->mb_stride]];
  194. for(j = 4*!row; j < 16; j += 4){
  195. Y = s->current_picture_ptr->f->data[0] + mb_x*16 + (row*16 + j) * s->linesize;
  196. for(i = 0; i < 4; i++, Y += 4){
  197. int ij = i + j;
  198. loc_lim = 0;
  199. if(r->deblock_coefs[mb_pos] & (1 << ij))
  200. loc_lim = cur_lim;
  201. else if(!j && r->deblock_coefs[mb_pos - s->mb_stride] & (1 << (ij + 12)))
  202. loc_lim = top_lim;
  203. else if( j && r->deblock_coefs[mb_pos] & (1 << (ij - 4)))
  204. loc_lim = cur_lim;
  205. if(loc_lim)
  206. rv30_weak_loop_filter(Y, s->linesize, 1, loc_lim);
  207. }
  208. }
  209. for(k = 0; k < 2; k++){
  210. int cur_cbp, top_cbp = 0;
  211. cur_cbp = (r->cbp_chroma[mb_pos] >> (k*4)) & 0xF;
  212. if(row)
  213. top_cbp = (r->cbp_chroma[mb_pos - s->mb_stride] >> (k*4)) & 0xF;
  214. for(j = 4*!row; j < 8; j += 4){
  215. C = s->current_picture_ptr->f->data[k+1] + mb_x*8 + (row*8 + j) * s->uvlinesize;
  216. for(i = 0; i < 2; i++, C += 4){
  217. int ij = i + (j >> 1);
  218. loc_lim = 0;
  219. if (r->cbp_chroma[mb_pos] & (1 << ij))
  220. loc_lim = cur_lim;
  221. else if(!j && top_cbp & (1 << (ij + 2)))
  222. loc_lim = top_lim;
  223. else if( j && cur_cbp & (1 << (ij - 2)))
  224. loc_lim = cur_lim;
  225. if(loc_lim)
  226. rv30_weak_loop_filter(C, s->uvlinesize, 1, loc_lim);
  227. }
  228. }
  229. }
  230. }
  231. }
  232. /**
  233. * Initialize decoder.
  234. */
  235. static av_cold int rv30_decode_init(AVCodecContext *avctx)
  236. {
  237. RV34DecContext *r = avctx->priv_data;
  238. int ret;
  239. r->rv30 = 1;
  240. if ((ret = ff_rv34_decode_init(avctx)) < 0)
  241. return ret;
  242. if(avctx->extradata_size < 2){
  243. av_log(avctx, AV_LOG_ERROR, "Extradata is too small.\n");
  244. return -1;
  245. }
  246. r->rpr = (avctx->extradata[1] & 7) >> 1;
  247. r->rpr = FFMIN(r->rpr + 1, 3);
  248. r->parse_slice_header = rv30_parse_slice_header;
  249. r->decode_intra_types = rv30_decode_intra_types;
  250. r->decode_mb_info = rv30_decode_mb_info;
  251. r->loop_filter = rv30_loop_filter;
  252. r->luma_dc_quant_i = rv30_luma_dc_quant;
  253. r->luma_dc_quant_p = rv30_luma_dc_quant;
  254. return 0;
  255. }
  256. AVCodec ff_rv30_decoder = {
  257. .name = "rv30",
  258. .long_name = NULL_IF_CONFIG_SMALL("RealVideo 3.0"),
  259. .type = AVMEDIA_TYPE_VIDEO,
  260. .id = AV_CODEC_ID_RV30,
  261. .priv_data_size = sizeof(RV34DecContext),
  262. .init = rv30_decode_init,
  263. .close = ff_rv34_decode_end,
  264. .decode = ff_rv34_decode_frame,
  265. .capabilities = AV_CODEC_CAP_DR1 | AV_CODEC_CAP_DELAY |
  266. AV_CODEC_CAP_FRAME_THREADS,
  267. .flush = ff_mpeg_flush,
  268. .pix_fmts = (const enum AVPixelFormat[]) {
  269. AV_PIX_FMT_YUV420P,
  270. AV_PIX_FMT_NONE
  271. },
  272. .init_thread_copy = ONLY_IF_THREADS_ENABLED(ff_rv34_decode_init_thread_copy),
  273. .update_thread_context = ONLY_IF_THREADS_ENABLED(ff_rv34_decode_update_thread_context),
  274. };