rv30.c 9.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271
  1. /*
  2. * RV30 decoder
  3. * Copyright (c) 2007 Konstantin Shishkov
  4. *
  5. * This file is part of FFmpeg.
  6. *
  7. * FFmpeg 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. * FFmpeg 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 FFmpeg; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. /**
  22. * @file rv30.c
  23. * RV30 decoder
  24. */
  25. #include "avcodec.h"
  26. #include "dsputil.h"
  27. #include "mpegvideo.h"
  28. #include "golomb.h"
  29. #include "rv34.h"
  30. #include "rv30data.h"
  31. static int rv30_parse_slice_header(RV34DecContext *r, GetBitContext *gb, SliceInfo *si)
  32. {
  33. int mb_bits;
  34. int w = r->s.width, h = r->s.height;
  35. int mb_size;
  36. memset(si, 0, sizeof(SliceInfo));
  37. if(get_bits(gb, 3))
  38. return -1;
  39. si->type = get_bits(gb, 2);
  40. if(si->type == 1) si->type = 0;
  41. if(get_bits1(gb))
  42. return -1;
  43. si->quant = get_bits(gb, 5);
  44. skip_bits1(gb);
  45. si->pts = get_bits(gb, 13);
  46. skip_bits(gb, r->rpr);
  47. si->width = w;
  48. si->height = h;
  49. mb_size = ((w + 15) >> 4) * ((h + 15) >> 4);
  50. mb_bits = ff_rv34_get_start_offset(gb, mb_size);
  51. si->start = get_bits(gb, mb_bits);
  52. skip_bits1(gb);
  53. return 0;
  54. }
  55. /**
  56. * Decode 4x4 intra types array.
  57. */
  58. static int rv30_decode_intra_types(RV34DecContext *r, GetBitContext *gb, int8_t *dst)
  59. {
  60. int i, j, k;
  61. for(i = 0; i < 4; i++, dst += r->s.b4_stride - 4){
  62. for(j = 0; j < 4; j+= 2){
  63. int code = svq3_get_ue_golomb(gb) << 1;
  64. if(code >= 81*2){
  65. av_log(r->s.avctx, AV_LOG_ERROR, "Incorrect intra prediction code\n");
  66. return -1;
  67. }
  68. for(k = 0; k < 2; k++){
  69. int A = dst[-r->s.b4_stride] + 1;
  70. int B = dst[-1] + 1;
  71. *dst++ = rv30_itype_from_context[A * 90 + B * 9 + rv30_itype_code[code + k]];
  72. if(dst[-1] == 9){
  73. av_log(r->s.avctx, AV_LOG_ERROR, "Incorrect intra prediction mode\n");
  74. return -1;
  75. }
  76. }
  77. }
  78. }
  79. return 0;
  80. }
  81. /**
  82. * Decode macroblock information.
  83. */
  84. static int rv30_decode_mb_info(RV34DecContext *r)
  85. {
  86. 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 };
  87. 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 };
  88. MpegEncContext *s = &r->s;
  89. GetBitContext *gb = &s->gb;
  90. int code = svq3_get_ue_golomb(gb);
  91. if(code > 11){
  92. av_log(s->avctx, AV_LOG_ERROR, "Incorrect MB type code\n");
  93. return -1;
  94. }
  95. if(code > 5){
  96. av_log(s->avctx, AV_LOG_ERROR, "dquant needed\n");
  97. code -= 6;
  98. }
  99. if(s->pict_type != FF_B_TYPE)
  100. return rv30_p_types[code];
  101. else
  102. return rv30_b_types[code];
  103. }
  104. static inline void rv30_weak_loop_filter(uint8_t *src, const int step,
  105. const int stride, const int lim)
  106. {
  107. uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;
  108. int i, diff;
  109. for(i = 0; i < 4; i++){
  110. diff = ((src[-2*step] - src[1*step]) - (src[-1*step] - src[0*step])*4) >> 3;
  111. diff = av_clip(diff, -lim, lim);
  112. src[-1*step] = cm[src[-1*step] + diff];
  113. src[ 0*step] = cm[src[ 0*step] - diff];
  114. src += stride;
  115. }
  116. }
  117. static void rv30_loop_filter(RV34DecContext *r, int row)
  118. {
  119. MpegEncContext *s = &r->s;
  120. int mb_pos, mb_x;
  121. int i, j, k;
  122. uint8_t *Y, *C;
  123. int loc_lim, cur_lim, left_lim = 0, top_lim = 0;
  124. mb_pos = row * s->mb_stride;
  125. for(mb_x = 0; mb_x < s->mb_width; mb_x++, mb_pos++){
  126. int mbtype = s->current_picture_ptr->mb_type[mb_pos];
  127. if(IS_INTRA(mbtype) || IS_SEPARATE_DC(mbtype))
  128. r->deblock_coefs[mb_pos] = 0xFFFF;
  129. if(IS_INTRA(mbtype))
  130. r->cbp_chroma[mb_pos] = 0xFF;
  131. }
  132. /* all vertical edges are filtered first
  133. * and horizontal edges are filtered on the next iteration
  134. */
  135. mb_pos = row * s->mb_stride;
  136. for(mb_x = 0; mb_x < s->mb_width; mb_x++, mb_pos++){
  137. cur_lim = rv30_loop_filt_lim[s->current_picture_ptr->qscale_table[mb_pos]];
  138. if(mb_x)
  139. left_lim = rv30_loop_filt_lim[s->current_picture_ptr->qscale_table[mb_pos - 1]];
  140. for(j = 0; j < 16; j += 4){
  141. Y = s->current_picture_ptr->data[0] + mb_x*16 + (row*16 + j) * s->linesize + 4 * !mb_x;
  142. for(i = !mb_x; i < 4; i++, Y += 4){
  143. int ij = i + j;
  144. loc_lim = 0;
  145. if(r->deblock_coefs[mb_pos] & (1 << ij))
  146. loc_lim = cur_lim;
  147. else if(!i && r->deblock_coefs[mb_pos - 1] & (1 << (ij + 3)))
  148. loc_lim = left_lim;
  149. else if( i && r->deblock_coefs[mb_pos] & (1 << (ij - 1)))
  150. loc_lim = cur_lim;
  151. if(loc_lim)
  152. rv30_weak_loop_filter(Y, 1, s->linesize, loc_lim);
  153. }
  154. }
  155. for(k = 0; k < 2; k++){
  156. int cur_cbp, left_cbp = 0;
  157. cur_cbp = (r->cbp_chroma[mb_pos] >> (k*4)) & 0xF;
  158. if(mb_x)
  159. left_cbp = (r->cbp_chroma[mb_pos - 1] >> (k*4)) & 0xF;
  160. for(j = 0; j < 8; j += 4){
  161. C = s->current_picture_ptr->data[k+1] + mb_x*8 + (row*8 + j) * s->uvlinesize + 4 * !mb_x;
  162. for(i = !mb_x; i < 2; i++, C += 4){
  163. int ij = i + (j >> 1);
  164. loc_lim = 0;
  165. if(cur_cbp && (1 << ij))
  166. loc_lim = cur_lim;
  167. else if(!i && left_cbp & (1 << (ij + 1)))
  168. loc_lim = left_lim;
  169. else if( i && cur_cbp & (1 << (ij - 1)))
  170. loc_lim = cur_lim;
  171. if(loc_lim)
  172. rv30_weak_loop_filter(C, 1, s->uvlinesize, loc_lim);
  173. }
  174. }
  175. }
  176. }
  177. mb_pos = row * s->mb_stride;
  178. for(mb_x = 0; mb_x < s->mb_width; mb_x++, mb_pos++){
  179. cur_lim = rv30_loop_filt_lim[s->current_picture_ptr->qscale_table[mb_pos]];
  180. if(row)
  181. top_lim = rv30_loop_filt_lim[s->current_picture_ptr->qscale_table[mb_pos - s->mb_stride]];
  182. for(j = 4*!row; j < 16; j += 4){
  183. Y = s->current_picture_ptr->data[0] + mb_x*16 + (row*16 + j) * s->linesize;
  184. for(i = 0; i < 4; i++, Y += 4){
  185. int ij = i + j;
  186. loc_lim = 0;
  187. if(r->deblock_coefs[mb_pos] & (1 << ij))
  188. loc_lim = cur_lim;
  189. else if(!j && r->deblock_coefs[mb_pos - s->mb_stride] & (1 << (ij + 12)))
  190. loc_lim = top_lim;
  191. else if( j && r->deblock_coefs[mb_pos] & (1 << (ij - 4)))
  192. loc_lim = cur_lim;
  193. if(loc_lim)
  194. rv30_weak_loop_filter(Y, s->linesize, 1, loc_lim);
  195. }
  196. }
  197. for(k = 0; k < 2; k++){
  198. int cur_cbp, top_cbp = 0;
  199. cur_cbp = (r->cbp_chroma[mb_pos] >> (k*4)) & 0xF;
  200. if(row)
  201. top_cbp = (r->cbp_chroma[mb_pos - s->mb_stride] >> (k*4)) & 0xF;
  202. for(j = 4*!row; j < 8; j += 4){
  203. C = s->current_picture_ptr->data[k+1] + mb_x*8 + (row*8 + j) * s->uvlinesize;
  204. for(i = 0; i < 2; i++, C += 4){
  205. int ij = i + (j >> 1);
  206. loc_lim = 0;
  207. if(r->cbp_chroma[mb_pos] && (1 << ij))
  208. loc_lim = cur_lim;
  209. else if(!j && top_cbp & (1 << (ij + 2)))
  210. loc_lim = top_lim;
  211. else if( j && cur_cbp & (1 << (ij - 2)))
  212. loc_lim = cur_lim;
  213. if(loc_lim)
  214. rv30_weak_loop_filter(C, s->uvlinesize, 1, loc_lim);
  215. }
  216. }
  217. }
  218. }
  219. }
  220. /**
  221. * Initialize decoder.
  222. */
  223. static av_cold int rv30_decode_init(AVCodecContext *avctx)
  224. {
  225. RV34DecContext *r = avctx->priv_data;
  226. r->rv30 = 1;
  227. ff_rv34_decode_init(avctx);
  228. if(avctx->extradata_size < 2){
  229. av_log(avctx, AV_LOG_ERROR, "Extradata is too small.\n");
  230. return -1;
  231. }
  232. r->rpr = (avctx->extradata[1] & 7) >> 1;
  233. r->rpr = FFMIN(r->rpr + 1, 3);
  234. r->parse_slice_header = rv30_parse_slice_header;
  235. r->decode_intra_types = rv30_decode_intra_types;
  236. r->decode_mb_info = rv30_decode_mb_info;
  237. r->loop_filter = rv30_loop_filter;
  238. r->luma_dc_quant_i = rv30_luma_dc_quant;
  239. r->luma_dc_quant_p = rv30_luma_dc_quant;
  240. return 0;
  241. }
  242. AVCodec rv30_decoder = {
  243. "rv30",
  244. CODEC_TYPE_VIDEO,
  245. CODEC_ID_RV30,
  246. sizeof(RV34DecContext),
  247. rv30_decode_init,
  248. NULL,
  249. ff_rv34_decode_end,
  250. ff_rv34_decode_frame,
  251. CODEC_CAP_DR1 | CODEC_CAP_DELAY,
  252. .long_name = NULL_IF_CONFIG_SMALL("RealVideo 3.0"),
  253. };