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.

1279 lines
42KB

  1. /*
  2. * RV30/40 decoder common data
  3. * Copyright (c) 2007 Mike Melanson, 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 rv34.c
  23. * RV30/40 decoder common data
  24. */
  25. #include "avcodec.h"
  26. #include "dsputil.h"
  27. #include "mpegvideo.h"
  28. #include "golomb.h"
  29. #include "rectangle.h"
  30. #include "rv34vlc.h"
  31. #include "rv34data.h"
  32. #include "rv34.h"
  33. //#define DEBUG
  34. /** translation of RV30/40 macroblock types to lavc ones */
  35. static const int rv34_mb_type_to_lavc[12] = {
  36. MB_TYPE_INTRA,
  37. MB_TYPE_INTRA16x16,
  38. MB_TYPE_16x16 | MB_TYPE_L0,
  39. MB_TYPE_8x8 | MB_TYPE_L0,
  40. MB_TYPE_16x16 | MB_TYPE_L0,
  41. MB_TYPE_16x16 | MB_TYPE_L1,
  42. MB_TYPE_SKIP,
  43. MB_TYPE_DIRECT2 | MB_TYPE_16x16,
  44. MB_TYPE_16x8 | MB_TYPE_L0,
  45. MB_TYPE_8x16 | MB_TYPE_L0,
  46. MB_TYPE_16x16 | MB_TYPE_L0L1,
  47. MB_TYPE_16x16 | MB_TYPE_L0
  48. };
  49. static RV34VLC intra_vlcs[NUM_INTRA_TABLES], inter_vlcs[NUM_INTER_TABLES];
  50. /**
  51. * @defgroup vlc RV30/40 VLC generating functions
  52. * @{
  53. */
  54. /**
  55. * Generate VLC from codeword lengths.
  56. * @param bits codeword lengths (zeroes are accepted)
  57. * @param size length of input data
  58. * @param insyms symbols for input codes (NULL for default ones)
  59. */
  60. static void rv34_gen_vlc(const uint8_t *bits, int size, VLC *vlc, const uint8_t *insyms)
  61. {
  62. int i;
  63. int counts[17] = {0}, codes[17];
  64. uint16_t cw[size], syms[size];
  65. uint8_t bits2[size];
  66. int maxbits = 0, realsize = 0;
  67. for(i = 0; i < size; i++){
  68. if(bits[i]){
  69. bits2[realsize] = bits[i];
  70. syms[realsize] = insyms ? insyms[i] : i;
  71. realsize++;
  72. maxbits = FFMAX(maxbits, bits[i]);
  73. counts[bits[i]]++;
  74. }
  75. }
  76. codes[0] = 0;
  77. for(i = 0; i < 16; i++)
  78. codes[i+1] = (codes[i] + counts[i]) << 1;
  79. for(i = 0; i < realsize; i++)
  80. cw[i] = codes[bits2[i]]++;
  81. init_vlc_sparse(vlc, FFMIN(maxbits, 9), realsize,
  82. bits2, 1, 1,
  83. cw, 2, 2,
  84. syms, 2, 2, INIT_VLC_USE_STATIC);
  85. }
  86. /**
  87. * Initialize all tables.
  88. */
  89. static void rv34_init_tables()
  90. {
  91. int i, j, k;
  92. for(i = 0; i < NUM_INTRA_TABLES; i++){
  93. for(j = 0; j < 2; j++){
  94. rv34_gen_vlc(rv34_table_intra_cbppat [i][j], CBPPAT_VLC_SIZE, &intra_vlcs[i].cbppattern[j], NULL);
  95. rv34_gen_vlc(rv34_table_intra_secondpat[i][j], OTHERBLK_VLC_SIZE, &intra_vlcs[i].second_pattern[j], NULL);
  96. rv34_gen_vlc(rv34_table_intra_thirdpat [i][j], OTHERBLK_VLC_SIZE, &intra_vlcs[i].third_pattern[j], NULL);
  97. for(k = 0; k < 4; k++)
  98. rv34_gen_vlc(rv34_table_intra_cbp[i][j+k*2], CBP_VLC_SIZE, &intra_vlcs[i].cbp[j][k], rv34_cbp_code);
  99. }
  100. for(j = 0; j < 4; j++)
  101. rv34_gen_vlc(rv34_table_intra_firstpat[i][j], FIRSTBLK_VLC_SIZE, &intra_vlcs[i].first_pattern[j], NULL);
  102. rv34_gen_vlc(rv34_intra_coeff[i], COEFF_VLC_SIZE, &intra_vlcs[i].coefficient, NULL);
  103. }
  104. for(i = 0; i < NUM_INTER_TABLES; i++){
  105. rv34_gen_vlc(rv34_inter_cbppat[i], CBPPAT_VLC_SIZE, &inter_vlcs[i].cbppattern[0], NULL);
  106. for(j = 0; j < 4; j++)
  107. rv34_gen_vlc(rv34_inter_cbp[i][j], CBP_VLC_SIZE, &inter_vlcs[i].cbp[0][j], rv34_cbp_code);
  108. for(j = 0; j < 2; j++){
  109. rv34_gen_vlc(rv34_table_inter_firstpat [i][j], FIRSTBLK_VLC_SIZE, &inter_vlcs[i].first_pattern[j], NULL);
  110. rv34_gen_vlc(rv34_table_inter_secondpat[i][j], OTHERBLK_VLC_SIZE, &inter_vlcs[i].second_pattern[j], NULL);
  111. rv34_gen_vlc(rv34_table_inter_thirdpat [i][j], OTHERBLK_VLC_SIZE, &inter_vlcs[i].third_pattern[j], NULL);
  112. }
  113. rv34_gen_vlc(rv34_inter_coeff[i], COEFF_VLC_SIZE, &inter_vlcs[i].coefficient, NULL);
  114. }
  115. }
  116. /** @} */ // vlc group
  117. /**
  118. * @defgroup transform RV30/40 inverse transform functions
  119. * @{
  120. */
  121. static av_always_inline void rv34_row_transform(int temp[16], DCTELEM *block)
  122. {
  123. int i;
  124. for(i=0; i<4; i++){
  125. const int z0= 13*(block[i+8*0] + block[i+8*2]);
  126. const int z1= 13*(block[i+8*0] - block[i+8*2]);
  127. const int z2= 7* block[i+8*1] - 17*block[i+8*3];
  128. const int z3= 17* block[i+8*1] + 7*block[i+8*3];
  129. temp[4*i+0]= z0+z3;
  130. temp[4*i+1]= z1+z2;
  131. temp[4*i+2]= z1-z2;
  132. temp[4*i+3]= z0-z3;
  133. }
  134. }
  135. /**
  136. * Real Video 3.0/4.0 inverse transform
  137. * Code is almost the same as in SVQ3, only scaling is different.
  138. */
  139. static void rv34_inv_transform(DCTELEM *block){
  140. int temp[16];
  141. int i;
  142. rv34_row_transform(temp, block);
  143. for(i=0; i<4; i++){
  144. const int z0= 13*(temp[4*0+i] + temp[4*2+i]) + 0x200;
  145. const int z1= 13*(temp[4*0+i] - temp[4*2+i]) + 0x200;
  146. const int z2= 7* temp[4*1+i] - 17*temp[4*3+i];
  147. const int z3= 17* temp[4*1+i] + 7*temp[4*3+i];
  148. block[i*8+0]= (z0 + z3)>>10;
  149. block[i*8+1]= (z1 + z2)>>10;
  150. block[i*8+2]= (z1 - z2)>>10;
  151. block[i*8+3]= (z0 - z3)>>10;
  152. }
  153. }
  154. /**
  155. * RealVideo 3.0/4.0 inverse transform for DC block
  156. *
  157. * Code is almost the same as rv34_inv_transform()
  158. * but final coefficients are multiplied by 1.5 and have no rounding.
  159. */
  160. static void rv34_inv_transform_noround(DCTELEM *block){
  161. int temp[16];
  162. int i;
  163. rv34_row_transform(temp, block);
  164. for(i=0; i<4; i++){
  165. const int z0= 13*(temp[4*0+i] + temp[4*2+i]);
  166. const int z1= 13*(temp[4*0+i] - temp[4*2+i]);
  167. const int z2= 7* temp[4*1+i] - 17*temp[4*3+i];
  168. const int z3= 17* temp[4*1+i] + 7*temp[4*3+i];
  169. block[i*8+0]= ((z0 + z3)*3)>>11;
  170. block[i*8+1]= ((z1 + z2)*3)>>11;
  171. block[i*8+2]= ((z1 - z2)*3)>>11;
  172. block[i*8+3]= ((z0 - z3)*3)>>11;
  173. }
  174. }
  175. /** @} */ // transform
  176. /**
  177. * @defgroup block RV30/40 4x4 block decoding functions
  178. * @{
  179. */
  180. /**
  181. * Decode coded block pattern.
  182. */
  183. static int rv34_decode_cbp(GetBitContext *gb, RV34VLC *vlc, int table)
  184. {
  185. int pattern, code, cbp=0;
  186. int ones;
  187. static const int cbp_masks[3] = {0x100000, 0x010000, 0x110000};
  188. static const int shifts[4] = { 0, 2, 8, 10 };
  189. int *curshift = shifts;
  190. int i, t, mask;
  191. code = get_vlc2(gb, vlc->cbppattern[table].table, 9, 2);
  192. pattern = code & 0xF;
  193. code >>= 4;
  194. ones = rv34_count_ones[pattern];
  195. for(mask = 8; mask; mask >>= 1, curshift++){
  196. if(pattern & mask)
  197. cbp |= get_vlc2(gb, vlc->cbp[table][ones].table, vlc->cbp[table][ones].bits, 1) << curshift[0];
  198. }
  199. for(i = 0; i < 4; i++){
  200. t = modulo_three_table[code][i];
  201. if(t == 1)
  202. cbp |= cbp_masks[get_bits1(gb)] << i;
  203. if(t == 2)
  204. cbp |= cbp_masks[2] << i;
  205. }
  206. return cbp;
  207. }
  208. /**
  209. * Get one coefficient value from the bistream and store it.
  210. */
  211. static inline void decode_coeff(DCTELEM *dst, int coef, int esc, GetBitContext *gb, VLC* vlc)
  212. {
  213. if(coef){
  214. if(coef == esc){
  215. coef = get_vlc2(gb, vlc->table, 9, 2);
  216. if(coef > 23){
  217. coef -= 23;
  218. coef = 22 + ((1 << coef) | get_bits(gb, coef));
  219. }
  220. coef += esc;
  221. }
  222. if(get_bits1(gb))
  223. coef = -coef;
  224. *dst = coef;
  225. }
  226. }
  227. /**
  228. * Decode 2x2 subblock of coefficients.
  229. */
  230. static inline void decode_subblock(DCTELEM *dst, int code, const int is_block2, GetBitContext *gb, VLC *vlc)
  231. {
  232. int coeffs[4];
  233. coeffs[0] = modulo_three_table[code][0];
  234. coeffs[1] = modulo_three_table[code][1];
  235. coeffs[2] = modulo_three_table[code][2];
  236. coeffs[3] = modulo_three_table[code][3];
  237. decode_coeff(dst , coeffs[0], 3, gb, vlc);
  238. if(is_block2){
  239. decode_coeff(dst+8, coeffs[1], 2, gb, vlc);
  240. decode_coeff(dst+1, coeffs[2], 2, gb, vlc);
  241. }else{
  242. decode_coeff(dst+1, coeffs[1], 2, gb, vlc);
  243. decode_coeff(dst+8, coeffs[2], 2, gb, vlc);
  244. }
  245. decode_coeff(dst+9, coeffs[3], 2, gb, vlc);
  246. }
  247. /**
  248. * Decode coefficients for 4x4 block.
  249. *
  250. * This is done by filling 2x2 subblocks with decoded coefficients
  251. * in this order (the same for subblocks and subblock coefficients):
  252. * o--o
  253. * /
  254. * /
  255. * o--o
  256. */
  257. static inline void rv34_decode_block(DCTELEM *dst, GetBitContext *gb, RV34VLC *rvlc, int fc, int sc)
  258. {
  259. int code, pattern;
  260. code = get_vlc2(gb, rvlc->first_pattern[fc].table, 9, 2);
  261. pattern = code & 0x7;
  262. code >>= 3;
  263. decode_subblock(dst, code, 0, gb, &rvlc->coefficient);
  264. if(pattern & 4){
  265. code = get_vlc2(gb, rvlc->second_pattern[sc].table, 9, 2);
  266. decode_subblock(dst + 2, code, 0, gb, &rvlc->coefficient);
  267. }
  268. if(pattern & 2){ // Looks like coefficients 1 and 2 are swapped for this block
  269. code = get_vlc2(gb, rvlc->second_pattern[sc].table, 9, 2);
  270. decode_subblock(dst + 8*2, code, 1, gb, &rvlc->coefficient);
  271. }
  272. if(pattern & 1){
  273. code = get_vlc2(gb, rvlc->third_pattern[sc].table, 9, 2);
  274. decode_subblock(dst + 8*2+2, code, 0, gb, &rvlc->coefficient);
  275. }
  276. }
  277. /**
  278. * Dequantize ordinary 4x4 block.
  279. * @todo optimize
  280. */
  281. static inline void rv34_dequant4x4(DCTELEM *block, int Qdc, int Q)
  282. {
  283. int i, j;
  284. block[0] = (block[0] * Qdc + 8) >> 4;
  285. for(i = 0; i < 4; i++)
  286. for(j = !i; j < 4; j++)
  287. block[j + i*8] = (block[j + i*8] * Q + 8) >> 4;
  288. }
  289. /**
  290. * Dequantize 4x4 block of DC values for 16x16 macroblock.
  291. * @todo optimize
  292. */
  293. static inline void rv34_dequant4x4_16x16(DCTELEM *block, int Qdc, int Q)
  294. {
  295. int i;
  296. for(i = 0; i < 3; i++)
  297. block[rv34_dezigzag[i]] = (block[rv34_dezigzag[i]] * Qdc + 8) >> 4;
  298. for(; i < 16; i++)
  299. block[rv34_dezigzag[i]] = (block[rv34_dezigzag[i]] * Q + 8) >> 4;
  300. }
  301. /** @} */ //block functions
  302. /**
  303. * @defgroup bitstream RV30/40 bitstream parsing
  304. * @{
  305. */
  306. static inline int decode210(GetBitContext *gb){
  307. if (get_bits1(gb))
  308. return 0;
  309. else
  310. return 2 - get_bits1(gb);
  311. }
  312. /**
  313. * Decode starting slice position.
  314. * @todo Maybe replace with ff_h263_decode_mba() ?
  315. */
  316. int ff_rv34_get_start_offset(GetBitContext *gb, int mb_size)
  317. {
  318. int i;
  319. for(i = 0; i < 5; i++)
  320. if(rv34_mb_max_sizes[i] > mb_size)
  321. break;
  322. return rv34_mb_bits_sizes[i];
  323. }
  324. /**
  325. * Select VLC set for decoding from current quantizer, modifier and frame type.
  326. */
  327. static inline RV34VLC* choose_vlc_set(int quant, int mod, int type)
  328. {
  329. if(mod == 2 && quant < 19) quant += 10;
  330. else if(mod && quant < 26) quant += 5;
  331. return type ? &inter_vlcs[rv34_quant_to_vlc_set[1][av_clip(quant, 0, 30)]]
  332. : &intra_vlcs[rv34_quant_to_vlc_set[0][av_clip(quant, 0, 30)]];
  333. }
  334. /**
  335. * Decode quantizer difference and return modified quantizer.
  336. */
  337. static inline int rv34_decode_dquant(GetBitContext *gb, int quant)
  338. {
  339. if(get_bits1(gb))
  340. return rv34_dquant_tab[get_bits1(gb)][quant];
  341. else
  342. return get_bits(gb, 5);
  343. }
  344. /** @} */ //bitstream functions
  345. /**
  346. * @defgroup mv motion vector related code (prediction, reconstruction, motion compensation)
  347. * @{
  348. */
  349. /** macroblock partition width in 8x8 blocks */
  350. static const uint8_t part_sizes_w[RV34_MB_TYPES] = { 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2 };
  351. /** macroblock partition height in 8x8 blocks */
  352. static const uint8_t part_sizes_h[RV34_MB_TYPES] = { 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2 };
  353. /** availability index for subblocks */
  354. static const uint8_t avail_indexes[4] = { 5, 6, 9, 10 };
  355. /**
  356. * motion vector prediction
  357. *
  358. * Motion prediction performed for the block by using median prediction of
  359. * motion vectors from the left, top and right top blocks but in corner cases
  360. * some other vectors may be used instead.
  361. */
  362. static void rv34_pred_mv(RV34DecContext *r, int block_type, int subblock_no, int dmv_no)
  363. {
  364. MpegEncContext *s = &r->s;
  365. int mv_pos = s->mb_x * 2 + s->mb_y * 2 * s->b8_stride;
  366. int A[2] = {0}, B[2], C[2];
  367. int i, j;
  368. int mx, my;
  369. int avail_index = avail_indexes[subblock_no];
  370. int c_off = part_sizes_w[block_type];
  371. mv_pos += (subblock_no & 1) + (subblock_no >> 1)*s->b8_stride;
  372. if(subblock_no == 3)
  373. c_off = -1;
  374. if(r->avail_cache[avail_index - 1]){
  375. A[0] = s->current_picture_ptr->motion_val[0][mv_pos-1][0];
  376. A[1] = s->current_picture_ptr->motion_val[0][mv_pos-1][1];
  377. }
  378. if(r->avail_cache[avail_index - 4]){
  379. B[0] = s->current_picture_ptr->motion_val[0][mv_pos-s->b8_stride][0];
  380. B[1] = s->current_picture_ptr->motion_val[0][mv_pos-s->b8_stride][1];
  381. }else{
  382. B[0] = A[0];
  383. B[1] = A[1];
  384. }
  385. if(!r->avail_cache[avail_index - 4 + c_off]){
  386. if(r->avail_cache[avail_index - 4] && (r->avail_cache[avail_index - 1] || r->rv30)){
  387. C[0] = s->current_picture_ptr->motion_val[0][mv_pos-s->b8_stride-1][0];
  388. C[1] = s->current_picture_ptr->motion_val[0][mv_pos-s->b8_stride-1][1];
  389. }else{
  390. C[0] = A[0];
  391. C[1] = A[1];
  392. }
  393. }else{
  394. C[0] = s->current_picture_ptr->motion_val[0][mv_pos-s->b8_stride+c_off][0];
  395. C[1] = s->current_picture_ptr->motion_val[0][mv_pos-s->b8_stride+c_off][1];
  396. }
  397. mx = mid_pred(A[0], B[0], C[0]);
  398. my = mid_pred(A[1], B[1], C[1]);
  399. mx += r->dmv[dmv_no][0];
  400. my += r->dmv[dmv_no][1];
  401. for(j = 0; j < part_sizes_h[block_type]; j++){
  402. for(i = 0; i < part_sizes_w[block_type]; i++){
  403. s->current_picture_ptr->motion_val[0][mv_pos + i + j*s->b8_stride][0] = mx;
  404. s->current_picture_ptr->motion_val[0][mv_pos + i + j*s->b8_stride][1] = my;
  405. }
  406. }
  407. }
  408. /**
  409. * Predict motion vector for B-frame macroblock.
  410. */
  411. static inline void rv34_pred_b_vector(int A[2], int B[2], int C[2],
  412. int A_avail, int B_avail, int C_avail,
  413. int *mx, int *my)
  414. {
  415. if(A_avail + B_avail + C_avail != 3){
  416. *mx = A[0] + B[0] + C[0];
  417. *my = A[1] + B[1] + C[1];
  418. if(A_avail + B_avail + C_avail == 2){
  419. *mx /= 2;
  420. *my /= 2;
  421. }
  422. }else{
  423. *mx = mid_pred(A[0], B[0], C[0]);
  424. *my = mid_pred(A[1], B[1], C[1]);
  425. }
  426. }
  427. /**
  428. * motion vector prediction for B-frames
  429. */
  430. static void rv34_pred_mv_b(RV34DecContext *r, int block_type, int dir)
  431. {
  432. MpegEncContext *s = &r->s;
  433. int mb_pos = s->mb_x + s->mb_y * s->mb_stride;
  434. int mv_pos = s->mb_x * 2 + s->mb_y * 2 * s->b8_stride;
  435. int A[2], B[2], C[2];
  436. int has_A = 0, has_B = 0, has_C = 0;
  437. int mx, my;
  438. int i, j;
  439. Picture *cur_pic = s->current_picture_ptr;
  440. const int mask = dir ? MB_TYPE_L1 : MB_TYPE_L0;
  441. int type = cur_pic->mb_type[mb_pos];
  442. memset(A, 0, sizeof(A));
  443. memset(B, 0, sizeof(B));
  444. memset(C, 0, sizeof(C));
  445. if((r->avail_cache[5-1] & type) & mask){
  446. A[0] = cur_pic->motion_val[dir][mv_pos - 1][0];
  447. A[1] = cur_pic->motion_val[dir][mv_pos - 1][1];
  448. has_A = 1;
  449. }
  450. if((r->avail_cache[5-4] & type) & mask){
  451. B[0] = cur_pic->motion_val[dir][mv_pos - s->b8_stride][0];
  452. B[1] = cur_pic->motion_val[dir][mv_pos - s->b8_stride][1];
  453. has_B = 1;
  454. }
  455. if((r->avail_cache[5-2] & type) & mask){
  456. C[0] = cur_pic->motion_val[dir][mv_pos - s->b8_stride + 2][0];
  457. C[1] = cur_pic->motion_val[dir][mv_pos - s->b8_stride + 2][1];
  458. has_C = 1;
  459. }else if((s->mb_x+1) == s->mb_width && (r->avail_cache[5-5] & type) & mask){
  460. C[0] = cur_pic->motion_val[dir][mv_pos - s->b8_stride - 1][0];
  461. C[1] = cur_pic->motion_val[dir][mv_pos - s->b8_stride - 1][1];
  462. has_C = 1;
  463. }
  464. rv34_pred_b_vector(A, B, C, has_A, has_B, has_C, &mx, &my);
  465. mx += r->dmv[dir][0];
  466. my += r->dmv[dir][1];
  467. //XXX add vector for bidirectionally predicted blocks
  468. for(j = 0; j < 2; j++){
  469. for(i = 0; i < 2; i++){
  470. cur_pic->motion_val[dir][mv_pos + i + j*s->b8_stride][0] = mx;
  471. cur_pic->motion_val[dir][mv_pos + i + j*s->b8_stride][1] = my;
  472. }
  473. }
  474. if(block_type == RV34_MB_B_BACKWARD || block_type == RV34_MB_B_FORWARD)
  475. fill_rectangle(cur_pic->motion_val[!dir][mv_pos], 2, 2, s->b8_stride, 0, 4);
  476. }
  477. /**
  478. * generic motion compensation function
  479. *
  480. * @param r decoder context
  481. * @param block_type type of the current block
  482. * @param xoff horizontal offset from the start of the current block
  483. * @param yoff vertical offset from the start of the current block
  484. * @param mv_off offset to the motion vector information
  485. * @param width width of the current partition in 8x8 blocks
  486. * @param height height of the current partition in 8x8 blocks
  487. */
  488. static inline void rv34_mc(RV34DecContext *r, const int block_type,
  489. const int xoff, const int yoff, int mv_off,
  490. const int width, const int height, int dir,
  491. const int thirdpel,
  492. qpel_mc_func (*qpel_mc)[16],
  493. h264_chroma_mc_func (*chroma_mc))
  494. {
  495. MpegEncContext *s = &r->s;
  496. uint8_t *Y, *U, *V, *srcY, *srcU, *srcV;
  497. int dxy, mx, my, uvmx, uvmy, src_x, src_y, uvsrc_x, uvsrc_y;
  498. int mv_pos = s->mb_x * 2 + s->mb_y * 2 * s->b8_stride + mv_off;
  499. int is16x16 = 1;
  500. if(thirdpel){
  501. #if 0 /// todo
  502. int lx, ly;
  503. mx = s->current_picture_ptr->motion_val[dir][mv_pos][0] / 3;
  504. my = s->current_picture_ptr->motion_val[dir][mv_pos][1] / 3;
  505. lx = ((s->current_picture_ptr->motion_val[dir][mv_pos][0] % 3) + 3) % 3;
  506. ly = ((s->current_picture_ptr->motion_val[dir][mv_pos][1] % 3) + 3) % 3;
  507. dxy = ly*3 + lx;
  508. uvmx =
  509. #endif
  510. mx = s->current_picture_ptr->motion_val[dir][mv_pos][0] >> 2;
  511. my = s->current_picture_ptr->motion_val[dir][mv_pos][1] >> 2;
  512. dxy = ((my & 3) << 2) | (mx & 3);
  513. uvmx = mx & 6;
  514. uvmy = my & 6;
  515. }else{
  516. mx = s->current_picture_ptr->motion_val[dir][mv_pos][0] >> 2;
  517. my = s->current_picture_ptr->motion_val[dir][mv_pos][1] >> 2;
  518. dxy = ((my & 3) << 2) | (mx & 3);
  519. uvmx = mx & 6;
  520. uvmy = my & 6;
  521. }
  522. srcY = dir ? s->next_picture_ptr->data[0] : s->last_picture_ptr->data[0];
  523. srcU = dir ? s->next_picture_ptr->data[1] : s->last_picture_ptr->data[1];
  524. srcV = dir ? s->next_picture_ptr->data[2] : s->last_picture_ptr->data[2];
  525. src_x = s->mb_x * 16 + xoff + mx;
  526. src_y = s->mb_y * 16 + yoff + my;
  527. uvsrc_x = s->mb_x * 8 + (xoff >> 1) + (mx >> 1);
  528. uvsrc_y = s->mb_y * 8 + (yoff >> 1) + (my >> 1);
  529. srcY += src_y * s->linesize + src_x;
  530. srcU += uvsrc_y * s->uvlinesize + uvsrc_x;
  531. srcV += uvsrc_y * s->uvlinesize + uvsrc_x;
  532. if( (unsigned)(src_x - !!(mx&3)*2) > s->h_edge_pos - !!(mx&3)*2 - (width <<3) - 3
  533. || (unsigned)(src_y - !!(my&3)*2) > s->v_edge_pos - !!(my&3)*2 - (height<<3) - 3){
  534. uint8_t *uvbuf= s->edge_emu_buffer + 20 * s->linesize;
  535. srcY -= 2 + 2*s->linesize;
  536. ff_emulated_edge_mc(s->edge_emu_buffer, srcY, s->linesize, (width<<3)+4, (height<<3)+4,
  537. src_x - 2, src_y - 2, s->h_edge_pos, s->v_edge_pos);
  538. srcY = s->edge_emu_buffer + 2 + 2*s->linesize;
  539. ff_emulated_edge_mc(uvbuf , srcU, s->uvlinesize, (width<<2)+1, (height<<2)+1,
  540. uvsrc_x, uvsrc_y, s->h_edge_pos >> 1, s->v_edge_pos >> 1);
  541. ff_emulated_edge_mc(uvbuf + 16, srcV, s->uvlinesize, (width<<2)+1, (height<<2)+1,
  542. uvsrc_x, uvsrc_y, s->h_edge_pos >> 1, s->v_edge_pos >> 1);
  543. srcU = uvbuf;
  544. srcV = uvbuf + 16;
  545. }
  546. Y = s->dest[0] + xoff + yoff *s->linesize;
  547. U = s->dest[1] + (xoff>>1) + (yoff>>1)*s->uvlinesize;
  548. V = s->dest[2] + (xoff>>1) + (yoff>>1)*s->uvlinesize;
  549. if(block_type == RV34_MB_P_16x8){
  550. qpel_mc[1][dxy](Y, srcY, s->linesize);
  551. Y += 8;
  552. srcY += 8;
  553. }else if(block_type == RV34_MB_P_8x16){
  554. qpel_mc[1][dxy](Y, srcY, s->linesize);
  555. Y += 8 * s->linesize;
  556. srcY += 8 * s->linesize;
  557. }
  558. is16x16 = (block_type != RV34_MB_P_8x8) && (block_type != RV34_MB_P_16x8) && (block_type != RV34_MB_P_8x16);
  559. qpel_mc[!is16x16][dxy](Y, srcY, s->linesize);
  560. chroma_mc[2-width] (U, srcU, s->uvlinesize, height*4, uvmx, uvmy);
  561. chroma_mc[2-width] (V, srcV, s->uvlinesize, height*4, uvmx, uvmy);
  562. }
  563. static void rv34_mc_1mv(RV34DecContext *r, const int block_type,
  564. const int xoff, const int yoff, int mv_off,
  565. const int width, const int height, int dir)
  566. {
  567. rv34_mc(r, block_type, xoff, yoff, mv_off, width, height, dir, r->rv30,
  568. r->s.dsp.put_h264_qpel_pixels_tab, r->s.dsp.put_h264_chroma_pixels_tab);
  569. }
  570. static void rv34_mc_2mv(RV34DecContext *r, const int block_type)
  571. {
  572. rv34_mc(r, block_type, 0, 0, 0, 2, 2, 0, r->rv30,
  573. r->s.dsp.put_h264_qpel_pixels_tab, r->s.dsp.put_h264_chroma_pixels_tab);
  574. rv34_mc(r, block_type, 0, 0, 0, 2, 2, 1, r->rv30,
  575. r->s.dsp.avg_h264_qpel_pixels_tab, r->s.dsp.avg_h264_chroma_pixels_tab);
  576. }
  577. /** number of motion vectors in each macroblock type */
  578. static const int num_mvs[RV34_MB_TYPES] = { 0, 0, 1, 4, 1, 1, 0, 0, 2, 2, 2, 1 };
  579. /**
  580. * Decode motion vector differences
  581. * and perform motion vector reconstruction and motion compensation.
  582. */
  583. static int rv34_decode_mv(RV34DecContext *r, int block_type)
  584. {
  585. MpegEncContext *s = &r->s;
  586. GetBitContext *gb = &s->gb;
  587. int i;
  588. memset(r->dmv, 0, sizeof(r->dmv));
  589. for(i = 0; i < num_mvs[block_type]; i++){
  590. r->dmv[i][0] = svq3_get_se_golomb(gb);
  591. r->dmv[i][1] = svq3_get_se_golomb(gb);
  592. }
  593. switch(block_type){
  594. case RV34_MB_TYPE_INTRA:
  595. case RV34_MB_TYPE_INTRA16x16:
  596. fill_rectangle(s->current_picture_ptr->motion_val[0][s->mb_x * 2 + s->mb_y * 2 * s->b8_stride], 2, 2, s->b8_stride, 0, 4);
  597. return 0;
  598. case RV34_MB_SKIP:
  599. if(s->pict_type == P_TYPE){
  600. fill_rectangle(s->current_picture_ptr->motion_val[0][s->mb_x * 2 + s->mb_y * 2 * s->b8_stride], 2, 2, s->b8_stride, 0, 4);
  601. rv34_mc_1mv (r, block_type, 0, 0, 0, 2, 2, 0);
  602. break;
  603. }
  604. case RV34_MB_B_DIRECT:
  605. rv34_pred_mv_b (r, RV34_MB_B_DIRECT, 0);
  606. rv34_pred_mv_b (r, RV34_MB_B_DIRECT, 1);
  607. rv34_mc_2mv (r, RV34_MB_B_DIRECT);
  608. break;
  609. case RV34_MB_P_16x16:
  610. case RV34_MB_P_MIX16x16:
  611. rv34_pred_mv(r, block_type, 0, 0);
  612. rv34_mc_1mv (r, block_type, 0, 0, 0, 2, 2, 0);
  613. break;
  614. case RV34_MB_B_FORWARD:
  615. case RV34_MB_B_BACKWARD:
  616. r->dmv[1][0] = r->dmv[0][0];
  617. r->dmv[1][1] = r->dmv[0][1];
  618. rv34_pred_mv_b (r, block_type, block_type == RV34_MB_B_BACKWARD);
  619. rv34_mc_1mv (r, block_type, 0, 0, 0, 2, 2, block_type == RV34_MB_B_BACKWARD);
  620. break;
  621. case RV34_MB_P_16x8:
  622. case RV34_MB_P_8x16:
  623. rv34_pred_mv(r, block_type, 0, 0);
  624. rv34_pred_mv(r, block_type, 1 + (block_type == RV34_MB_P_16x8), 1);
  625. if(block_type == RV34_MB_P_16x8){
  626. rv34_mc_1mv(r, block_type, 0, 0, 0, 2, 1, 0);
  627. rv34_mc_1mv(r, block_type, 0, 8, s->b8_stride, 2, 1, 0);
  628. }
  629. if(block_type == RV34_MB_P_8x16){
  630. rv34_mc_1mv(r, block_type, 0, 0, 0, 1, 2, 0);
  631. rv34_mc_1mv(r, block_type, 8, 0, 1, 1, 2, 0);
  632. }
  633. break;
  634. case RV34_MB_B_BIDIR:
  635. rv34_pred_mv_b (r, block_type, 0);
  636. rv34_pred_mv_b (r, block_type, 1);
  637. rv34_mc_2mv (r, block_type);
  638. break;
  639. case RV34_MB_P_8x8:
  640. for(i=0;i< 4;i++){
  641. rv34_pred_mv(r, block_type, i, i);
  642. rv34_mc_1mv (r, block_type, (i&1)<<3, (i&2)<<2, (i&1)+(i>>1)*s->b8_stride, 1, 1, 0);
  643. }
  644. break;
  645. }
  646. return 0;
  647. }
  648. /** @} */ // mv group
  649. /**
  650. * @defgroup recons Macroblock reconstruction functions
  651. * @{
  652. */
  653. /** mapping of RV30/40 intra prediction types to standard H.264 types */
  654. static const int ittrans[9] = {
  655. DC_PRED, VERT_PRED, HOR_PRED, DIAG_DOWN_RIGHT_PRED, DIAG_DOWN_LEFT_PRED,
  656. VERT_RIGHT_PRED, VERT_LEFT_PRED, HOR_UP_PRED, HOR_DOWN_PRED,
  657. };
  658. /** mapping of RV30/40 intra 16x16 prediction types to standard H.264 types */
  659. static const int ittrans16[4] = {
  660. DC_PRED8x8, VERT_PRED8x8, HOR_PRED8x8, PLANE_PRED8x8,
  661. };
  662. /**
  663. * Perform 4x4 intra prediction.
  664. */
  665. static void rv34_pred_4x4_block(RV34DecContext *r, uint8_t *dst, int stride, int itype, int up, int left, int down, int right)
  666. {
  667. uint8_t *prev = dst - stride + 4;
  668. uint32_t topleft;
  669. if(!up && !left)
  670. itype = DC_128_PRED;
  671. else if(!up){
  672. if(itype == VERT_PRED) itype = HOR_PRED;
  673. if(itype == DC_PRED) itype = LEFT_DC_PRED;
  674. }else if(!left){
  675. if(itype == HOR_PRED) itype = VERT_PRED;
  676. if(itype == DC_PRED) itype = TOP_DC_PRED;
  677. if(itype == DIAG_DOWN_LEFT_PRED) itype = DIAG_DOWN_LEFT_PRED_RV40_NODOWN;
  678. }
  679. if(!down){
  680. if(itype == DIAG_DOWN_LEFT_PRED) itype = DIAG_DOWN_LEFT_PRED_RV40_NODOWN;
  681. if(itype == HOR_UP_PRED) itype = HOR_UP_PRED_RV40_NODOWN;
  682. if(itype == VERT_LEFT_PRED) itype = VERT_LEFT_PRED_RV40_NODOWN;
  683. }
  684. if(!right && up){
  685. topleft = dst[-stride + 3] * 0x01010101;
  686. prev = &topleft;
  687. }
  688. r->h.pred4x4[itype](dst, prev, stride);
  689. }
  690. /** add_pixels_clamped for 4x4 block */
  691. static void rv34_add_4x4_block(uint8_t *dst, int stride, DCTELEM block[64], int off)
  692. {
  693. int x, y;
  694. for(y = 0; y < 4; y++)
  695. for(x = 0; x < 4; x++)
  696. dst[x + y*stride] = av_clip_uint8(dst[x + y*stride] + block[off + x+y*8]);
  697. }
  698. static inline int adjust_pred16(int itype, int up, int left)
  699. {
  700. if(!up && !left)
  701. itype = DC_128_PRED8x8;
  702. else if(!up){
  703. if(itype == PLANE_PRED8x8)itype = HOR_PRED8x8;
  704. if(itype == VERT_PRED8x8) itype = HOR_PRED8x8;
  705. if(itype == DC_PRED8x8) itype = LEFT_DC_PRED8x8;
  706. }else if(!left){
  707. if(itype == PLANE_PRED8x8)itype = VERT_PRED8x8;
  708. if(itype == HOR_PRED8x8) itype = VERT_PRED8x8;
  709. if(itype == DC_PRED8x8) itype = TOP_DC_PRED8x8;
  710. }
  711. return itype;
  712. }
  713. static void rv34_output_macroblock(RV34DecContext *r, int8_t *intra_types, int cbp, int is16)
  714. {
  715. MpegEncContext *s = &r->s;
  716. DSPContext *dsp = &s->dsp;
  717. int i, j;
  718. uint8_t *Y, *U, *V;
  719. int itype;
  720. int avail[6*8] = {0};
  721. int idx;
  722. // Set neighbour information.
  723. if(r->avail_cache[0])
  724. avail[0] = 1;
  725. if(r->avail_cache[1])
  726. avail[1] = avail[2] = 1;
  727. if(r->avail_cache[2])
  728. avail[3] = avail[4] = 1;
  729. if(r->avail_cache[3])
  730. avail[5] = 1;
  731. if(r->avail_cache[4])
  732. avail[8] = avail[16] = 1;
  733. if(r->avail_cache[8])
  734. avail[24] = avail[32] = 1;
  735. Y = s->dest[0];
  736. U = s->dest[1];
  737. V = s->dest[2];
  738. if(!is16){
  739. for(j = 0; j < 4; j++){
  740. idx = 9 + j*8;
  741. for(i = 0; i < 4; i++, cbp >>= 1, Y += 4, idx++){
  742. rv34_pred_4x4_block(r, Y, s->linesize, ittrans[intra_types[i]], avail[idx-8], avail[idx-1], avail[idx+7], avail[idx-7]);
  743. avail[idx] = 1;
  744. if(cbp & 1)
  745. rv34_add_4x4_block(Y, s->linesize, s->block[(i>>1)+(j&2)], (i&1)*4+(j&1)*32);
  746. }
  747. Y += s->linesize * 4 - 4*4;
  748. intra_types += s->b4_stride;
  749. }
  750. intra_types -= s->b4_stride * 4;
  751. fill_rectangle(r->avail_cache + 5, 2, 2, 4, 0, 4);
  752. for(j = 0; j < 2; j++){
  753. idx = 5 + j*4;
  754. for(i = 0; i < 2; i++, cbp >>= 1, idx++){
  755. rv34_pred_4x4_block(r, U + i*4 + j*4*s->uvlinesize, s->uvlinesize, ittrans[intra_types[i*2+j*2*s->b4_stride]], r->avail_cache[idx-4], r->avail_cache[idx-1], !i && !j, r->avail_cache[idx-3]);
  756. rv34_pred_4x4_block(r, V + i*4 + j*4*s->uvlinesize, s->uvlinesize, ittrans[intra_types[i*2+j*2*s->b4_stride]], r->avail_cache[idx-4], r->avail_cache[idx-1], !i && !j, r->avail_cache[idx-3]);
  757. r->avail_cache[idx] = 1;
  758. if(cbp & 0x01)
  759. rv34_add_4x4_block(U + i*4 + j*4*s->uvlinesize, s->uvlinesize, s->block[4], i*4+j*32);
  760. if(cbp & 0x10)
  761. rv34_add_4x4_block(V + i*4 + j*4*s->uvlinesize, s->uvlinesize, s->block[5], i*4+j*32);
  762. }
  763. }
  764. }else{
  765. itype = ittrans16[intra_types[0]];
  766. itype = adjust_pred16(itype, r->avail_cache[5-4], r->avail_cache[5-1]);
  767. r->h.pred16x16[itype](Y, s->linesize);
  768. dsp->add_pixels_clamped(s->block[0], Y, s->current_picture.linesize[0]);
  769. dsp->add_pixels_clamped(s->block[1], Y + 8, s->current_picture.linesize[0]);
  770. Y += s->current_picture.linesize[0] * 8;
  771. dsp->add_pixels_clamped(s->block[2], Y, s->current_picture.linesize[0]);
  772. dsp->add_pixels_clamped(s->block[3], Y + 8, s->current_picture.linesize[0]);
  773. itype = ittrans16[intra_types[0]];
  774. if(itype == PLANE_PRED8x8) itype = DC_PRED8x8;
  775. itype = adjust_pred16(itype, r->avail_cache[5-4], r->avail_cache[5-1]);
  776. r->h.pred8x8[itype](U, s->uvlinesize);
  777. dsp->add_pixels_clamped(s->block[4], U, s->uvlinesize);
  778. r->h.pred8x8[itype](V, s->uvlinesize);
  779. dsp->add_pixels_clamped(s->block[5], V, s->uvlinesize);
  780. }
  781. }
  782. /** @} */ // recons group
  783. /**
  784. * @addtogroup bitstream
  785. * Decode macroblock header and return CBP in case of success, -1 otherwise.
  786. */
  787. static int rv34_decode_mb_header(RV34DecContext *r, int8_t *intra_types)
  788. {
  789. MpegEncContext *s = &r->s;
  790. GetBitContext *gb = &s->gb;
  791. int mb_pos = s->mb_x + s->mb_y * s->mb_stride;
  792. int i, t;
  793. if(!r->si.type){
  794. r->is16 = get_bits1(gb);
  795. if(!r->is16 && !r->rv30){
  796. if(!get_bits1(gb))
  797. av_log(s->avctx, AV_LOG_ERROR, "Need DQUANT\n");
  798. }
  799. s->current_picture_ptr->mb_type[mb_pos] = r->is16 ? MB_TYPE_INTRA16x16 : MB_TYPE_INTRA;
  800. r->block_type = r->is16 ? RV34_MB_TYPE_INTRA16x16 : RV34_MB_TYPE_INTRA;
  801. }else{
  802. r->block_type = r->decode_mb_info(r);
  803. if(r->block_type == -1)
  804. return -1;
  805. s->current_picture_ptr->mb_type[mb_pos] = rv34_mb_type_to_lavc[r->block_type];
  806. r->mb_type[mb_pos] = r->block_type;
  807. if(r->block_type == RV34_MB_SKIP){
  808. if(s->pict_type == P_TYPE)
  809. r->mb_type[mb_pos] = RV34_MB_P_16x16;
  810. if(s->pict_type == B_TYPE)
  811. r->mb_type[mb_pos] = RV34_MB_B_DIRECT;
  812. }
  813. r->is16 = !!IS_INTRA16x16(s->current_picture_ptr->mb_type[mb_pos]);
  814. rv34_decode_mv(r, r->block_type);
  815. if(r->block_type == RV34_MB_SKIP){
  816. fill_rectangle(intra_types, 4, 4, s->b4_stride, 0, sizeof(intra_types[0]));
  817. return 0;
  818. }
  819. r->chroma_vlc = 1;
  820. r->luma_vlc = 0;
  821. }
  822. if(IS_INTRA(s->current_picture_ptr->mb_type[mb_pos])){
  823. if(r->is16){
  824. t = get_bits(gb, 2);
  825. fill_rectangle(intra_types, 4, 4, s->b4_stride, t, sizeof(intra_types[0]));
  826. r->luma_vlc = 2;
  827. }else{
  828. if(r->decode_intra_types(r, gb, intra_types) < 0)
  829. return -1;
  830. r->luma_vlc = 1;
  831. }
  832. r->chroma_vlc = 0;
  833. r->cur_vlcs = choose_vlc_set(r->si.quant, r->si.vlc_set, 0);
  834. }else{
  835. for(i = 0; i < 16; i++)
  836. intra_types[(i & 3) + (i>>2) * s->b4_stride] = 0;
  837. r->cur_vlcs = choose_vlc_set(r->si.quant, r->si.vlc_set, 1);
  838. if(r->mb_type[mb_pos] == RV34_MB_P_MIX16x16){
  839. r->is16 = 1;
  840. r->chroma_vlc = 1;
  841. r->luma_vlc = 2;
  842. r->cur_vlcs = choose_vlc_set(r->si.quant, r->si.vlc_set, 0);
  843. }
  844. }
  845. return rv34_decode_cbp(gb, r->cur_vlcs, r->is16);
  846. }
  847. /**
  848. * @addtogroup recons
  849. * @{
  850. */
  851. /**
  852. * mask for retrieving all bits in coded block pattern
  853. * corresponding to one 8x8 block
  854. */
  855. #define LUMA_CBP_BLOCK_MASK 0x303
  856. #define U_CBP_MASK 0x0F0000
  857. #define V_CBP_MASK 0xF00000
  858. static void rv34_apply_differences(RV34DecContext *r, int cbp)
  859. {
  860. static const int shifts[4] = { 0, 2, 8, 10 };
  861. MpegEncContext *s = &r->s;
  862. int i;
  863. for(i = 0; i < 4; i++)
  864. if(cbp & (LUMA_CBP_BLOCK_MASK << shifts[i]))
  865. s->dsp.add_pixels_clamped(s->block[i], s->dest[0] + (i & 1)*8 + (i&2)*4*s->linesize, s->linesize);
  866. if(cbp & U_CBP_MASK)
  867. s->dsp.add_pixels_clamped(s->block[4], s->dest[1], s->uvlinesize);
  868. if(cbp & V_CBP_MASK)
  869. s->dsp.add_pixels_clamped(s->block[5], s->dest[2], s->uvlinesize);
  870. }
  871. static int rv34_decode_macroblock(RV34DecContext *r, int8_t *intra_types)
  872. {
  873. MpegEncContext *s = &r->s;
  874. GetBitContext *gb = &s->gb;
  875. int cbp, cbp2;
  876. int i, blknum, blkoff;
  877. DCTELEM block16[64];
  878. int luma_dc_quant;
  879. int dist;
  880. int mb_pos = s->mb_x + s->mb_y * s->mb_stride;
  881. // Calculate which neighbours are available. Maybe it's worth optimizing too.
  882. memset(r->avail_cache, 0, sizeof(r->avail_cache));
  883. fill_rectangle(r->avail_cache + 5, 2, 2, 4, 1, 4);
  884. dist = (s->mb_x - s->resync_mb_x) + (s->mb_y - s->resync_mb_y) * s->mb_width;
  885. if(s->mb_x && dist)
  886. r->avail_cache[4] =
  887. r->avail_cache[8] = s->current_picture_ptr->mb_type[mb_pos - 1];
  888. if(dist >= s->mb_width)
  889. r->avail_cache[1] =
  890. r->avail_cache[2] = s->current_picture_ptr->mb_type[mb_pos - s->mb_stride];
  891. if(((s->mb_x+1) < s->mb_width) && dist >= s->mb_width - 1)
  892. r->avail_cache[3] = s->current_picture_ptr->mb_type[mb_pos - s->mb_stride + 1];
  893. if(s->mb_x && dist > s->mb_width)
  894. r->avail_cache[0] = s->current_picture_ptr->mb_type[mb_pos - s->mb_stride - 1];
  895. s->qscale = r->si.quant;
  896. cbp = cbp2 = rv34_decode_mb_header(r, intra_types);
  897. if(cbp == -1)
  898. return -1;
  899. luma_dc_quant = r->si.type ? r->luma_dc_quant_p[s->qscale] : r->luma_dc_quant_i[s->qscale];
  900. if(r->is16){
  901. memset(block16, 0, sizeof(block16));
  902. rv34_decode_block(block16, gb, r->cur_vlcs, 3, 0);
  903. rv34_dequant4x4_16x16(block16, rv34_qscale_tab[luma_dc_quant],rv34_qscale_tab[s->qscale]);
  904. rv34_inv_transform_noround(block16);
  905. }
  906. for(i = 0; i < 16; i++, cbp >>= 1){
  907. if(!r->is16 && !(cbp & 1)) continue;
  908. blknum = ((i & 2) >> 1) + ((i & 8) >> 2);
  909. blkoff = ((i & 1) << 2) + ((i & 4) << 3);
  910. if(cbp & 1)
  911. rv34_decode_block(s->block[blknum] + blkoff, gb, r->cur_vlcs, r->luma_vlc, 0);
  912. rv34_dequant4x4(s->block[blknum] + blkoff, rv34_qscale_tab[luma_dc_quant],rv34_qscale_tab[s->qscale]);
  913. if(r->is16) //FIXME: optimize
  914. s->block[blknum][blkoff] = block16[(i & 3) | ((i & 0xC) << 1)];
  915. rv34_inv_transform(s->block[blknum] + blkoff);
  916. }
  917. if(r->block_type == RV34_MB_P_MIX16x16)
  918. r->cur_vlcs = choose_vlc_set(r->si.quant, r->si.vlc_set, 1);
  919. for(; i < 24; i++, cbp >>= 1){
  920. if(!(cbp & 1)) continue;
  921. blknum = ((i & 4) >> 2) + 4;
  922. blkoff = ((i & 1) << 2) + ((i & 2) << 4);
  923. rv34_decode_block(s->block[blknum] + blkoff, gb, r->cur_vlcs, r->chroma_vlc, 1);
  924. rv34_dequant4x4(s->block[blknum] + blkoff, rv34_qscale_tab[rv34_chroma_quant[1][s->qscale]],rv34_qscale_tab[rv34_chroma_quant[0][s->qscale]]);
  925. rv34_inv_transform(s->block[blknum] + blkoff);
  926. }
  927. if(IS_INTRA(s->current_picture_ptr->mb_type[s->mb_x + s->mb_y*s->mb_stride]))
  928. rv34_output_macroblock(r, intra_types, cbp2, r->is16);
  929. else
  930. rv34_apply_differences(r, cbp2);
  931. return 0;
  932. }
  933. static int check_slice_end(RV34DecContext *r, MpegEncContext *s)
  934. {
  935. int bits;
  936. if(s->mb_y >= s->mb_height)
  937. return 1;
  938. if(!s->mb_num_left)
  939. return 1;
  940. if(r->s.mb_skip_run > 1)
  941. return 0;
  942. bits = r->bits - get_bits_count(&s->gb);
  943. if(bits < 0 || (bits < 8 && !show_bits(&s->gb, bits)))
  944. return 1;
  945. return 0;
  946. }
  947. static inline int slice_compare(SliceInfo *si1, SliceInfo *si2)
  948. {
  949. return si1->type != si2->type ||
  950. si1->start >= si2->start ||
  951. si1->width != si2->width ||
  952. si1->height != si2->height;
  953. }
  954. static int rv34_decode_slice(RV34DecContext *r, int end, uint8_t* buf, int buf_size)
  955. {
  956. MpegEncContext *s = &r->s;
  957. GetBitContext *gb = &s->gb;
  958. int mb_pos;
  959. int res;
  960. init_get_bits(&r->s.gb, buf, buf_size*8);
  961. res = r->parse_slice_header(r, gb, &r->si);
  962. if(res < 0){
  963. av_log(s->avctx, AV_LOG_ERROR, "Incorrect or unknown slice header\n");
  964. return -1;
  965. }
  966. if ((s->mb_x == 0 && s->mb_y == 0) || s->current_picture_ptr==NULL) {
  967. if(s->width != r->si.width || s->height != r->si.height){
  968. av_log(s->avctx, AV_LOG_DEBUG, "Changing dimensions to %dx%d\n", r->si.width,r->si.height);
  969. MPV_common_end(s);
  970. s->width = r->si.width;
  971. s->height = r->si.height;
  972. if(MPV_common_init(s) < 0)
  973. return -1;
  974. r->intra_types_hist = av_realloc(r->intra_types_hist, s->b4_stride * 4 * 2 * sizeof(*r->intra_types_hist));
  975. r->intra_types = r->intra_types_hist + s->b4_stride * 4;
  976. r->mb_type = av_realloc(r->mb_type, r->s.mb_stride * r->s.mb_height * sizeof(*r->mb_type));
  977. }
  978. s->pict_type = r->si.type ? r->si.type : I_TYPE;
  979. if(MPV_frame_start(s, s->avctx) < 0)
  980. return -1;
  981. ff_er_frame_start(s);
  982. s->current_picture_ptr = &s->current_picture;
  983. s->mb_x = s->mb_y = 0;
  984. }
  985. r->si.end = end;
  986. s->qscale = r->si.quant;
  987. r->bits = buf_size*8;
  988. s->mb_num_left = r->si.end - r->si.start;
  989. r->s.mb_skip_run = 0;
  990. mb_pos = s->mb_x + s->mb_y * s->mb_width;
  991. if(r->si.start != mb_pos){
  992. av_log(s->avctx, AV_LOG_ERROR, "Slice indicates MB offset %d, got %d\n", r->si.start, mb_pos);
  993. s->mb_x = r->si.start % s->mb_width;
  994. s->mb_y = r->si.start / s->mb_width;
  995. }
  996. memset(r->intra_types_hist, -1, s->b4_stride * 4 * 2 * sizeof(*r->intra_types_hist));
  997. s->first_slice_line = 1;
  998. s->resync_mb_x= s->mb_x;
  999. s->resync_mb_y= s->mb_y;
  1000. ff_init_block_index(s);
  1001. while(!check_slice_end(r, s)) {
  1002. ff_update_block_index(s);
  1003. s->dsp.clear_blocks(s->block[0]);
  1004. if(rv34_decode_macroblock(r, r->intra_types + s->mb_x * 4 + 1) < 0){
  1005. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x-1, s->mb_y, AC_ERROR|DC_ERROR|MV_ERROR);
  1006. return -1;
  1007. }
  1008. if (++s->mb_x == s->mb_width) {
  1009. s->mb_x = 0;
  1010. s->mb_y++;
  1011. ff_init_block_index(s);
  1012. memmove(r->intra_types_hist, r->intra_types, s->b4_stride * 4 * sizeof(*r->intra_types_hist));
  1013. memset(r->intra_types, -1, s->b4_stride * 4 * sizeof(*r->intra_types_hist));
  1014. }
  1015. if(s->mb_x == s->resync_mb_x)
  1016. s->first_slice_line=0;
  1017. s->mb_num_left--;
  1018. }
  1019. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x-1, s->mb_y, AC_END|DC_END|MV_END);
  1020. return (s->mb_y == s->mb_height);
  1021. }
  1022. /** @} */ // recons group end
  1023. /**
  1024. * Initialize decoder.
  1025. */
  1026. int ff_rv34_decode_init(AVCodecContext *avctx)
  1027. {
  1028. RV34DecContext *r = avctx->priv_data;
  1029. MpegEncContext *s = &r->s;
  1030. MPV_decode_defaults(s);
  1031. s->avctx= avctx;
  1032. s->out_format = FMT_H263;
  1033. s->codec_id= avctx->codec_id;
  1034. s->width = avctx->width;
  1035. s->height = avctx->height;
  1036. r->s.avctx = avctx;
  1037. avctx->flags |= CODEC_FLAG_EMU_EDGE;
  1038. r->s.flags |= CODEC_FLAG_EMU_EDGE;
  1039. avctx->pix_fmt = PIX_FMT_YUV420P;
  1040. avctx->has_b_frames = 1;
  1041. s->low_delay = 0;
  1042. if (MPV_common_init(s) < 0)
  1043. return -1;
  1044. ff_h264_pred_init(&r->h, CODEC_ID_RV40);
  1045. r->intra_types_hist = av_malloc(s->b4_stride * 4 * 2 * sizeof(*r->intra_types_hist));
  1046. r->intra_types = r->intra_types_hist + s->b4_stride * 4;
  1047. r->mb_type = av_mallocz(r->s.mb_stride * r->s.mb_height * sizeof(*r->mb_type));
  1048. if(!intra_vlcs[0].cbppattern[0].bits)
  1049. rv34_init_tables();
  1050. return 0;
  1051. }
  1052. static int get_slice_offset(AVCodecContext *avctx, uint8_t *buf, int n)
  1053. {
  1054. if(avctx->slice_count) return avctx->slice_offset[n];
  1055. else return AV_RL32(buf + n*8 - 4) == 1 ? AV_RL32(buf + n*8) : AV_RB32(buf + n*8);
  1056. }
  1057. int ff_rv34_decode_frame(AVCodecContext *avctx,
  1058. void *data, int *data_size,
  1059. uint8_t *buf, int buf_size)
  1060. {
  1061. RV34DecContext *r = avctx->priv_data;
  1062. MpegEncContext *s = &r->s;
  1063. AVFrame *pict = data;
  1064. SliceInfo si;
  1065. int i;
  1066. int slice_count;
  1067. uint8_t *slices_hdr = NULL;
  1068. int last = 0;
  1069. /* no supplementary picture */
  1070. if (buf_size == 0) {
  1071. /* special case for last picture */
  1072. if (s->low_delay==0 && s->next_picture_ptr) {
  1073. *pict= *(AVFrame*)s->next_picture_ptr;
  1074. s->next_picture_ptr= NULL;
  1075. *data_size = sizeof(AVFrame);
  1076. }
  1077. return 0;
  1078. }
  1079. if(!avctx->slice_count){
  1080. slice_count = (*buf++) + 1;
  1081. slices_hdr = buf + 4;
  1082. buf += 8 * slice_count;
  1083. }else
  1084. slice_count = avctx->slice_count;
  1085. for(i=0; i<slice_count; i++){
  1086. int offset= get_slice_offset(avctx, slices_hdr, i);
  1087. int size;
  1088. if(i+1 == slice_count)
  1089. size= buf_size - offset;
  1090. else
  1091. size= get_slice_offset(avctx, slices_hdr, i+1) - offset;
  1092. r->si.end = s->mb_width * s->mb_height;
  1093. if(i+1 < slice_count){
  1094. init_get_bits(&s->gb, buf+get_slice_offset(avctx, slices_hdr, i+1), (buf_size-get_slice_offset(avctx, slices_hdr, i+1))*8);
  1095. if(r->parse_slice_header(r, &r->s.gb, &si) < 0){
  1096. if(i+2 < slice_count)
  1097. size = get_slice_offset(avctx, slices_hdr, i+2) - offset;
  1098. else
  1099. size = buf_size - offset;
  1100. }else
  1101. r->si.end = si.start;
  1102. }
  1103. last = rv34_decode_slice(r, r->si.end, buf + offset, size);
  1104. s->mb_num_left = r->s.mb_x + r->s.mb_y*r->s.mb_width - r->si.start;
  1105. if(last)
  1106. break;
  1107. }
  1108. if(last){
  1109. if(r->loop_filter)
  1110. r->loop_filter(r);
  1111. ff_er_frame_end(s);
  1112. MPV_frame_end(s);
  1113. if (s->pict_type == B_TYPE || s->low_delay) {
  1114. *pict= *(AVFrame*)s->current_picture_ptr;
  1115. } else if (s->last_picture_ptr != NULL) {
  1116. *pict= *(AVFrame*)s->last_picture_ptr;
  1117. }
  1118. if(s->last_picture_ptr || s->low_delay){
  1119. *data_size = sizeof(AVFrame);
  1120. ff_print_debug_info(s, pict);
  1121. }
  1122. s->current_picture_ptr= NULL; //so we can detect if frame_end wasnt called (find some nicer solution...)
  1123. }
  1124. return buf_size;
  1125. }
  1126. int ff_rv34_decode_end(AVCodecContext *avctx)
  1127. {
  1128. RV34DecContext *r = avctx->priv_data;
  1129. MPV_common_end(&r->s);
  1130. av_freep(&r->intra_types_hist);
  1131. r->intra_types = NULL;
  1132. av_freep(&r->mb_type);
  1133. return 0;
  1134. }