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.

1919 lines
61KB

  1. /*
  2. * MPEG1 encoder / MPEG2 decoder
  3. * Copyright (c) 2000,2001 Fabrice Bellard.
  4. *
  5. * This library is free software; you can redistribute it and/or
  6. * modify it under the terms of the GNU Lesser General Public
  7. * License as published by the Free Software Foundation; either
  8. * version 2 of the License, or (at your option) any later version.
  9. *
  10. * This library is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * Lesser General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU Lesser General Public
  16. * License along with this library; if not, write to the Free Software
  17. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  18. */
  19. //#define DEBUG
  20. #include "avcodec.h"
  21. #include "dsputil.h"
  22. #include "mpegvideo.h"
  23. #include "mpeg12data.h"
  24. #if 1
  25. #define PRINT_QP(a, b) {}
  26. #else
  27. #define PRINT_QP(a, b) printf(a, b)
  28. #endif
  29. /* Start codes. */
  30. #define SEQ_END_CODE 0x000001b7
  31. #define SEQ_START_CODE 0x000001b3
  32. #define GOP_START_CODE 0x000001b8
  33. #define PICTURE_START_CODE 0x00000100
  34. #define SLICE_MIN_START_CODE 0x00000101
  35. #define SLICE_MAX_START_CODE 0x000001af
  36. #define EXT_START_CODE 0x000001b5
  37. #define USER_START_CODE 0x000001b2
  38. #define DC_VLC_BITS 9
  39. #define MV_VLC_BITS 9
  40. #define MBINCR_VLC_BITS 9
  41. #define MB_PAT_VLC_BITS 9
  42. #define MB_PTYPE_VLC_BITS 6
  43. #define MB_BTYPE_VLC_BITS 6
  44. #define TEX_VLC_BITS 9
  45. static void mpeg1_encode_block(MpegEncContext *s,
  46. DCTELEM *block,
  47. int component);
  48. static void mpeg1_encode_motion(MpegEncContext *s, int val);
  49. static void mpeg1_skip_picture(MpegEncContext *s, int pict_num);
  50. static inline int mpeg1_decode_block_inter(MpegEncContext *s,
  51. DCTELEM *block,
  52. int n);
  53. static inline int mpeg1_decode_block_intra(MpegEncContext *s,
  54. DCTELEM *block,
  55. int n);
  56. static int mpeg2_decode_block_non_intra(MpegEncContext *s,
  57. DCTELEM *block,
  58. int n);
  59. static int mpeg2_decode_block_intra(MpegEncContext *s,
  60. DCTELEM *block,
  61. int n);
  62. static int mpeg_decode_motion(MpegEncContext *s, int fcode, int pred);
  63. static UINT16 mv_penalty[MAX_FCODE+1][MAX_MV*2+1];
  64. static UINT8 fcode_tab[MAX_MV*2+1];
  65. static void init_2d_vlc_rl(RLTable *rl)
  66. {
  67. int i;
  68. init_vlc(&rl->vlc, TEX_VLC_BITS, rl->n + 2,
  69. &rl->table_vlc[0][1], 4, 2,
  70. &rl->table_vlc[0][0], 4, 2);
  71. rl->rl_vlc[0]= av_malloc(rl->vlc.table_size*sizeof(RL_VLC_ELEM));
  72. for(i=0; i<rl->vlc.table_size; i++){
  73. int code= rl->vlc.table[i][0];
  74. int len = rl->vlc.table[i][1];
  75. int level, run;
  76. if(len==0){ // illegal code
  77. run= 65;
  78. level= MAX_LEVEL;
  79. }else if(len<0){ //more bits needed
  80. run= 0;
  81. level= code;
  82. }else{
  83. if(code==rl->n){ //esc
  84. run= 65;
  85. level= 0;
  86. }else if(code==rl->n+1){ //eob
  87. run= 0;
  88. level= 127;
  89. }else{
  90. run= rl->table_run [code] + 1;
  91. level= rl->table_level[code];
  92. }
  93. }
  94. rl->rl_vlc[0][i].len= len;
  95. rl->rl_vlc[0][i].level= level;
  96. rl->rl_vlc[0][i].run= run;
  97. }
  98. }
  99. static void put_header(MpegEncContext *s, int header)
  100. {
  101. align_put_bits(&s->pb);
  102. put_bits(&s->pb, 16, header>>16);
  103. put_bits(&s->pb, 16, header&0xFFFF);
  104. }
  105. /* put sequence header if needed */
  106. static void mpeg1_encode_sequence_header(MpegEncContext *s)
  107. {
  108. unsigned int vbv_buffer_size;
  109. unsigned int fps, v;
  110. int n;
  111. UINT64 time_code;
  112. if (s->picture_in_gop_number == 0) {
  113. /* mpeg1 header repeated every gop */
  114. put_header(s, SEQ_START_CODE);
  115. /* search closest frame rate */
  116. {
  117. int i, dmin, d;
  118. s->frame_rate_index = 0;
  119. dmin = 0x7fffffff;
  120. for(i=1;i<9;i++) {
  121. d = abs(s->frame_rate - frame_rate_tab[i]);
  122. if (d < dmin) {
  123. dmin = d;
  124. s->frame_rate_index = i;
  125. }
  126. }
  127. }
  128. put_bits(&s->pb, 12, s->width);
  129. put_bits(&s->pb, 12, s->height);
  130. put_bits(&s->pb, 4, 1); /* 1/1 aspect ratio */
  131. put_bits(&s->pb, 4, s->frame_rate_index);
  132. v = s->bit_rate / 400;
  133. if (v > 0x3ffff)
  134. v = 0x3ffff;
  135. put_bits(&s->pb, 18, v);
  136. put_bits(&s->pb, 1, 1); /* marker */
  137. if(s->avctx->rc_buffer_size)
  138. vbv_buffer_size = s->avctx->rc_buffer_size;
  139. else
  140. /* VBV calculation: Scaled so that a VCD has the proper VBV size of 40 kilobytes */
  141. vbv_buffer_size = (( 20 * s->bit_rate) / (1151929 / 2)) * 8 * 1024;
  142. put_bits(&s->pb, 10, (vbv_buffer_size + 16383) / 16384);
  143. put_bits(&s->pb, 1, 1); /* constrained parameter flag */
  144. put_bits(&s->pb, 1, 0); /* no custom intra matrix */
  145. put_bits(&s->pb, 1, 0); /* no custom non intra matrix */
  146. put_header(s, GOP_START_CODE);
  147. put_bits(&s->pb, 1, 0); /* do drop frame */
  148. /* time code : we must convert from the real frame rate to a
  149. fake mpeg frame rate in case of low frame rate */
  150. fps = frame_rate_tab[s->frame_rate_index];
  151. time_code = (INT64)s->fake_picture_number * FRAME_RATE_BASE;
  152. s->gop_picture_number = s->fake_picture_number;
  153. put_bits(&s->pb, 5, (UINT32)((time_code / (fps * 3600)) % 24));
  154. put_bits(&s->pb, 6, (UINT32)((time_code / (fps * 60)) % 60));
  155. put_bits(&s->pb, 1, 1);
  156. put_bits(&s->pb, 6, (UINT32)((time_code / fps) % 60));
  157. put_bits(&s->pb, 6, (UINT32)((time_code % fps) / FRAME_RATE_BASE));
  158. put_bits(&s->pb, 1, 1); /* closed gop */
  159. put_bits(&s->pb, 1, 0); /* broken link */
  160. }
  161. if (s->frame_rate < (24 * FRAME_RATE_BASE) && s->picture_number > 0) {
  162. /* insert empty P pictures to slow down to the desired
  163. frame rate. Each fake pictures takes about 20 bytes */
  164. fps = frame_rate_tab[s->frame_rate_index];
  165. n = (((INT64)s->picture_number * fps) / s->frame_rate) - 1;
  166. while (s->fake_picture_number < n) {
  167. mpeg1_skip_picture(s, s->fake_picture_number -
  168. s->gop_picture_number);
  169. s->fake_picture_number++;
  170. }
  171. }
  172. }
  173. /* insert a fake P picture */
  174. static void mpeg1_skip_picture(MpegEncContext *s, int pict_num)
  175. {
  176. unsigned int mb_incr;
  177. /* mpeg1 picture header */
  178. put_header(s, PICTURE_START_CODE);
  179. /* temporal reference */
  180. put_bits(&s->pb, 10, pict_num & 0x3ff);
  181. put_bits(&s->pb, 3, P_TYPE);
  182. put_bits(&s->pb, 16, 0xffff); /* non constant bit rate */
  183. put_bits(&s->pb, 1, 1); /* integer coordinates */
  184. put_bits(&s->pb, 3, 1); /* forward_f_code */
  185. put_bits(&s->pb, 1, 0); /* extra bit picture */
  186. /* only one slice */
  187. put_header(s, SLICE_MIN_START_CODE);
  188. put_bits(&s->pb, 5, 1); /* quantizer scale */
  189. put_bits(&s->pb, 1, 0); /* slice extra information */
  190. mb_incr = 1;
  191. put_bits(&s->pb, mbAddrIncrTable[mb_incr - 1][1],
  192. mbAddrIncrTable[mb_incr - 1][0]);
  193. /* empty macroblock */
  194. put_bits(&s->pb, 3, 1); /* motion only */
  195. /* zero motion x & y */
  196. put_bits(&s->pb, 1, 1);
  197. put_bits(&s->pb, 1, 1);
  198. /* output a number of empty slice */
  199. mb_incr = s->mb_width * s->mb_height - 1;
  200. while (mb_incr > 33) {
  201. put_bits(&s->pb, 11, 0x008);
  202. mb_incr -= 33;
  203. }
  204. put_bits(&s->pb, mbAddrIncrTable[mb_incr - 1][1],
  205. mbAddrIncrTable[mb_incr - 1][0]);
  206. /* empty macroblock */
  207. put_bits(&s->pb, 3, 1); /* motion only */
  208. /* zero motion x & y */
  209. put_bits(&s->pb, 1, 1);
  210. put_bits(&s->pb, 1, 1);
  211. }
  212. static void common_init(MpegEncContext *s)
  213. {
  214. s->y_dc_scale_table=
  215. s->c_dc_scale_table= ff_mpeg1_dc_scale_table;
  216. }
  217. void mpeg1_encode_picture_header(MpegEncContext *s, int picture_number)
  218. {
  219. mpeg1_encode_sequence_header(s);
  220. /* mpeg1 picture header */
  221. put_header(s, PICTURE_START_CODE);
  222. /* temporal reference */
  223. put_bits(&s->pb, 10, (s->fake_picture_number -
  224. s->gop_picture_number) & 0x3ff);
  225. s->fake_picture_number++;
  226. put_bits(&s->pb, 3, s->pict_type);
  227. put_bits(&s->pb, 16, 0xffff); /* non constant bit rate */
  228. if (s->pict_type == P_TYPE) {
  229. put_bits(&s->pb, 1, 0); /* half pel coordinates */
  230. put_bits(&s->pb, 3, s->f_code); /* forward_f_code */
  231. }
  232. put_bits(&s->pb, 1, 0); /* extra bit picture */
  233. /* only one slice */
  234. put_header(s, SLICE_MIN_START_CODE);
  235. put_bits(&s->pb, 5, s->qscale); /* quantizer scale */
  236. put_bits(&s->pb, 1, 0); /* slice extra information */
  237. }
  238. void mpeg1_encode_mb(MpegEncContext *s,
  239. DCTELEM block[6][64],
  240. int motion_x, int motion_y)
  241. {
  242. int mb_incr, i, cbp, mb_x, mb_y;
  243. mb_x = s->mb_x;
  244. mb_y = s->mb_y;
  245. /* compute cbp */
  246. cbp = 0;
  247. for(i=0;i<6;i++) {
  248. if (s->block_last_index[i] >= 0)
  249. cbp |= 1 << (5 - i);
  250. }
  251. /* skip macroblock, except if first or last macroblock of a slice */
  252. if ((cbp | motion_x | motion_y) == 0 &&
  253. (!((mb_x | mb_y) == 0 ||
  254. (mb_x == s->mb_width - 1 && mb_y == s->mb_height - 1)))) {
  255. s->mb_incr++;
  256. s->qscale -= s->dquant;
  257. } else {
  258. /* output mb incr */
  259. mb_incr = s->mb_incr;
  260. while (mb_incr > 33) {
  261. put_bits(&s->pb, 11, 0x008);
  262. mb_incr -= 33;
  263. }
  264. put_bits(&s->pb, mbAddrIncrTable[mb_incr - 1][1],
  265. mbAddrIncrTable[mb_incr - 1][0]);
  266. if (s->pict_type == I_TYPE) {
  267. if(s->dquant && cbp){
  268. put_bits(&s->pb, 2, 1); /* macroblock_type : macroblock_quant = 1 */
  269. put_bits(&s->pb, 5, s->qscale);
  270. }else{
  271. put_bits(&s->pb, 1, 1); /* macroblock_type : macroblock_quant = 0 */
  272. s->qscale -= s->dquant;
  273. }
  274. } else {
  275. if (s->mb_intra) {
  276. if(s->dquant && cbp){
  277. put_bits(&s->pb, 6, 0x01);
  278. put_bits(&s->pb, 5, s->qscale);
  279. }else{
  280. put_bits(&s->pb, 5, 0x03);
  281. s->qscale -= s->dquant;
  282. }
  283. } else {
  284. if (cbp != 0) {
  285. if (motion_x == 0 && motion_y == 0) {
  286. if(s->dquant){
  287. put_bits(&s->pb, 5, 1); /* macroblock_pattern & quant */
  288. put_bits(&s->pb, 5, s->qscale);
  289. }else{
  290. put_bits(&s->pb, 2, 1); /* macroblock_pattern only */
  291. }
  292. put_bits(&s->pb, mbPatTable[cbp - 1][1], mbPatTable[cbp - 1][0]);
  293. } else {
  294. if(s->dquant){
  295. put_bits(&s->pb, 5, 2); /* motion + cbp */
  296. put_bits(&s->pb, 5, s->qscale);
  297. }else{
  298. put_bits(&s->pb, 1, 1); /* motion + cbp */
  299. }
  300. mpeg1_encode_motion(s, motion_x - s->last_mv[0][0][0]);
  301. mpeg1_encode_motion(s, motion_y - s->last_mv[0][0][1]);
  302. put_bits(&s->pb, mbPatTable[cbp - 1][1], mbPatTable[cbp - 1][0]);
  303. }
  304. } else {
  305. put_bits(&s->pb, 3, 1); /* motion only */
  306. mpeg1_encode_motion(s, motion_x - s->last_mv[0][0][0]);
  307. mpeg1_encode_motion(s, motion_y - s->last_mv[0][0][1]);
  308. s->qscale -= s->dquant;
  309. }
  310. }
  311. }
  312. for(i=0;i<6;i++) {
  313. if (cbp & (1 << (5 - i))) {
  314. mpeg1_encode_block(s, block[i], i);
  315. }
  316. }
  317. s->mb_incr = 1;
  318. }
  319. s->last_mv[0][0][0] = motion_x;
  320. s->last_mv[0][0][1] = motion_y;
  321. }
  322. static void mpeg1_encode_motion(MpegEncContext *s, int val)
  323. {
  324. int code, bit_size, l, m, bits, range, sign;
  325. if (val == 0) {
  326. /* zero vector */
  327. code = 0;
  328. put_bits(&s->pb,
  329. mbMotionVectorTable[0][1],
  330. mbMotionVectorTable[0][0]);
  331. } else {
  332. bit_size = s->f_code - 1;
  333. range = 1 << bit_size;
  334. /* modulo encoding */
  335. l = 16 * range;
  336. m = 2 * l;
  337. if (val < -l) {
  338. val += m;
  339. } else if (val >= l) {
  340. val -= m;
  341. }
  342. if (val >= 0) {
  343. val--;
  344. code = (val >> bit_size) + 1;
  345. bits = val & (range - 1);
  346. sign = 0;
  347. } else {
  348. val = -val;
  349. val--;
  350. code = (val >> bit_size) + 1;
  351. bits = val & (range - 1);
  352. sign = 1;
  353. }
  354. put_bits(&s->pb,
  355. mbMotionVectorTable[code][1],
  356. mbMotionVectorTable[code][0]);
  357. put_bits(&s->pb, 1, sign);
  358. if (bit_size > 0) {
  359. put_bits(&s->pb, bit_size, bits);
  360. }
  361. }
  362. }
  363. void ff_mpeg1_encode_init(MpegEncContext *s)
  364. {
  365. static int done=0;
  366. common_init(s);
  367. if(!done){
  368. int f_code;
  369. int mv;
  370. int i;
  371. done=1;
  372. init_rl(&rl_mpeg1);
  373. for(i=0; i<64; i++)
  374. {
  375. mpeg1_max_level[0][i]= rl_mpeg1.max_level[0][i];
  376. mpeg1_index_run[0][i]= rl_mpeg1.index_run[0][i];
  377. }
  378. /* build unified dc encoding tables */
  379. for(i=-255; i<256; i++)
  380. {
  381. int adiff, index;
  382. int bits, code;
  383. int diff=i;
  384. adiff = ABS(diff);
  385. if(diff<0) diff--;
  386. index = vlc_dc_table[adiff];
  387. bits= vlc_dc_lum_bits[index] + index;
  388. code= (vlc_dc_lum_code[index]<<index) + (diff & ((1 << index) - 1));
  389. mpeg1_lum_dc_uni[i+255]= bits + (code<<8);
  390. bits= vlc_dc_chroma_bits[index] + index;
  391. code= (vlc_dc_chroma_code[index]<<index) + (diff & ((1 << index) - 1));
  392. mpeg1_chr_dc_uni[i+255]= bits + (code<<8);
  393. }
  394. for(f_code=1; f_code<=MAX_FCODE; f_code++){
  395. for(mv=-MAX_MV; mv<=MAX_MV; mv++){
  396. int len;
  397. if(mv==0) len= mbMotionVectorTable[0][1];
  398. else{
  399. int val, bit_size, range, code;
  400. bit_size = s->f_code - 1;
  401. range = 1 << bit_size;
  402. val=mv;
  403. if (val < 0)
  404. val = -val;
  405. val--;
  406. code = (val >> bit_size) + 1;
  407. if(code<17){
  408. len= mbMotionVectorTable[code][1] + 1 + bit_size;
  409. }else{
  410. len= mbMotionVectorTable[16][1] + 2 + bit_size;
  411. }
  412. }
  413. mv_penalty[f_code][mv+MAX_MV]= len;
  414. }
  415. }
  416. for(f_code=MAX_FCODE; f_code>0; f_code--){
  417. for(mv=-(8<<f_code); mv<(8<<f_code); mv++){
  418. fcode_tab[mv+MAX_MV]= f_code;
  419. }
  420. }
  421. }
  422. s->mv_penalty= mv_penalty;
  423. s->fcode_tab= fcode_tab;
  424. s->min_qcoeff=-255;
  425. s->max_qcoeff= 255;
  426. s->intra_quant_bias= 3<<(QUANT_BIAS_SHIFT-3); //(a + x*3/8)/x
  427. s->inter_quant_bias= 0;
  428. }
  429. static inline void encode_dc(MpegEncContext *s, int diff, int component)
  430. {
  431. if (component == 0) {
  432. put_bits(
  433. &s->pb,
  434. mpeg1_lum_dc_uni[diff+255]&0xFF,
  435. mpeg1_lum_dc_uni[diff+255]>>8);
  436. } else {
  437. put_bits(
  438. &s->pb,
  439. mpeg1_chr_dc_uni[diff+255]&0xFF,
  440. mpeg1_chr_dc_uni[diff+255]>>8);
  441. }
  442. }
  443. static void mpeg1_encode_block(MpegEncContext *s,
  444. DCTELEM *block,
  445. int n)
  446. {
  447. int alevel, level, last_non_zero, dc, diff, i, j, run, last_index, sign;
  448. int code, component;
  449. // RLTable *rl = &rl_mpeg1;
  450. last_index = s->block_last_index[n];
  451. /* DC coef */
  452. if (s->mb_intra) {
  453. component = (n <= 3 ? 0 : n - 4 + 1);
  454. dc = block[0]; /* overflow is impossible */
  455. diff = dc - s->last_dc[component];
  456. encode_dc(s, diff, component);
  457. s->last_dc[component] = dc;
  458. i = 1;
  459. } else {
  460. /* encode the first coefficient : needs to be done here because
  461. it is handled slightly differently */
  462. level = block[0];
  463. if (abs(level) == 1) {
  464. code = ((UINT32)level >> 31); /* the sign bit */
  465. put_bits(&s->pb, 2, code | 0x02);
  466. i = 1;
  467. } else {
  468. i = 0;
  469. last_non_zero = -1;
  470. goto next_coef;
  471. }
  472. }
  473. /* now quantify & encode AC coefs */
  474. last_non_zero = i - 1;
  475. for(;i<=last_index;i++) {
  476. j = s->intra_scantable.permutated[i];
  477. level = block[j];
  478. next_coef:
  479. #if 0
  480. if (level != 0)
  481. dprintf("level[%d]=%d\n", i, level);
  482. #endif
  483. /* encode using VLC */
  484. if (level != 0) {
  485. run = i - last_non_zero - 1;
  486. alevel= level;
  487. MASK_ABS(sign, alevel)
  488. sign&=1;
  489. // code = get_rl_index(rl, 0, run, alevel);
  490. if (alevel > mpeg1_max_level[0][run])
  491. code= 111; /*rl->n*/
  492. else
  493. code= mpeg1_index_run[0][run] + alevel - 1;
  494. if (code < 111 /* rl->n */) {
  495. /* store the vlc & sign at once */
  496. put_bits(&s->pb, mpeg1_vlc[code][1]+1, (mpeg1_vlc[code][0]<<1) + sign);
  497. } else {
  498. /* escape seems to be pretty rare <5% so i dont optimize it */
  499. put_bits(&s->pb, mpeg1_vlc[111/*rl->n*/][1], mpeg1_vlc[111/*rl->n*/][0]);
  500. /* escape: only clip in this case */
  501. put_bits(&s->pb, 6, run);
  502. if (alevel < 128) {
  503. put_bits(&s->pb, 8, level & 0xff);
  504. } else {
  505. if (level < 0) {
  506. put_bits(&s->pb, 16, 0x8001 + level + 255);
  507. } else {
  508. put_bits(&s->pb, 16, level & 0xffff);
  509. }
  510. }
  511. }
  512. last_non_zero = i;
  513. }
  514. }
  515. /* end of block */
  516. put_bits(&s->pb, 2, 0x2);
  517. }
  518. /******************************************/
  519. /* decoding */
  520. static VLC dc_lum_vlc;
  521. static VLC dc_chroma_vlc;
  522. static VLC mv_vlc;
  523. static VLC mbincr_vlc;
  524. static VLC mb_ptype_vlc;
  525. static VLC mb_btype_vlc;
  526. static VLC mb_pat_vlc;
  527. static void init_vlcs(MpegEncContext *s)
  528. {
  529. static int done = 0;
  530. if (!done) {
  531. done = 1;
  532. init_vlc(&dc_lum_vlc, DC_VLC_BITS, 12,
  533. vlc_dc_lum_bits, 1, 1,
  534. vlc_dc_lum_code, 2, 2);
  535. init_vlc(&dc_chroma_vlc, DC_VLC_BITS, 12,
  536. vlc_dc_chroma_bits, 1, 1,
  537. vlc_dc_chroma_code, 2, 2);
  538. init_vlc(&mv_vlc, MV_VLC_BITS, 17,
  539. &mbMotionVectorTable[0][1], 2, 1,
  540. &mbMotionVectorTable[0][0], 2, 1);
  541. init_vlc(&mbincr_vlc, MBINCR_VLC_BITS, 35,
  542. &mbAddrIncrTable[0][1], 2, 1,
  543. &mbAddrIncrTable[0][0], 2, 1);
  544. init_vlc(&mb_pat_vlc, MB_PAT_VLC_BITS, 63,
  545. &mbPatTable[0][1], 2, 1,
  546. &mbPatTable[0][0], 2, 1);
  547. init_vlc(&mb_ptype_vlc, MB_PTYPE_VLC_BITS, 32,
  548. &table_mb_ptype[0][1], 2, 1,
  549. &table_mb_ptype[0][0], 2, 1);
  550. init_vlc(&mb_btype_vlc, MB_BTYPE_VLC_BITS, 32,
  551. &table_mb_btype[0][1], 2, 1,
  552. &table_mb_btype[0][0], 2, 1);
  553. init_rl(&rl_mpeg1);
  554. init_rl(&rl_mpeg2);
  555. init_2d_vlc_rl(&rl_mpeg1);
  556. init_2d_vlc_rl(&rl_mpeg2);
  557. }
  558. }
  559. static inline int get_dmv(MpegEncContext *s)
  560. {
  561. if(get_bits1(&s->gb))
  562. return 1 - (get_bits1(&s->gb) << 1);
  563. else
  564. return 0;
  565. }
  566. static inline int get_qscale(MpegEncContext *s)
  567. {
  568. int qscale;
  569. if (s->mpeg2) {
  570. if (s->q_scale_type) {
  571. qscale = non_linear_qscale[get_bits(&s->gb, 5)];
  572. } else {
  573. qscale = get_bits(&s->gb, 5) << 1;
  574. }
  575. } else {
  576. /* for mpeg1, we use the generic unquant code */
  577. qscale = get_bits(&s->gb, 5);
  578. }
  579. return qscale;
  580. }
  581. /* motion type (for mpeg2) */
  582. #define MT_FIELD 1
  583. #define MT_FRAME 2
  584. #define MT_16X8 2
  585. #define MT_DMV 3
  586. static int mpeg_decode_mb(MpegEncContext *s,
  587. DCTELEM block[6][64])
  588. {
  589. int i, j, k, cbp, val, code, mb_type, motion_type;
  590. /* skip mb handling */
  591. if (s->mb_incr == 0) {
  592. /* read again increment */
  593. s->mb_incr = 1;
  594. for(;;) {
  595. code = get_vlc2(&s->gb, mbincr_vlc.table, MBINCR_VLC_BITS, 2);
  596. if (code < 0)
  597. return 1; /* error = end of slice */
  598. if (code >= 33) {
  599. if (code == 33) {
  600. s->mb_incr += 33;
  601. }
  602. /* otherwise, stuffing, nothing to do */
  603. } else {
  604. s->mb_incr += code;
  605. break;
  606. }
  607. }
  608. }
  609. if(s->mb_x==-1 /* first MB in a slice */ && s->mb_incr>1){
  610. s->mb_x+= (s->mb_incr - 1) % s->mb_width;
  611. s->mb_y+= (s->mb_incr - 1) / s->mb_width;
  612. s->mb_incr= 1;
  613. }
  614. if (++s->mb_x >= s->mb_width) {
  615. s->mb_x = 0;
  616. if (s->mb_y >= (s->mb_height - 1)){
  617. fprintf(stderr, "slice too long\n");
  618. return -1;
  619. }
  620. s->mb_y++;
  621. }
  622. dprintf("decode_mb: x=%d y=%d\n", s->mb_x, s->mb_y);
  623. if (--s->mb_incr != 0) {
  624. /* skip mb */
  625. s->mb_intra = 0;
  626. for(i=0;i<6;i++)
  627. s->block_last_index[i] = -1;
  628. s->mv_type = MV_TYPE_16X16;
  629. if (s->pict_type == P_TYPE) {
  630. /* if P type, zero motion vector is implied */
  631. s->mv_dir = MV_DIR_FORWARD;
  632. s->mv[0][0][0] = s->mv[0][0][1] = 0;
  633. s->last_mv[0][0][0] = s->last_mv[0][0][1] = 0;
  634. s->last_mv[0][1][0] = s->last_mv[0][1][1] = 0;
  635. } else {
  636. /* if B type, reuse previous vectors and directions */
  637. s->mv[0][0][0] = s->last_mv[0][0][0];
  638. s->mv[0][0][1] = s->last_mv[0][0][1];
  639. s->mv[1][0][0] = s->last_mv[1][0][0];
  640. s->mv[1][0][1] = s->last_mv[1][0][1];
  641. }
  642. s->mb_skiped = 1;
  643. return 0;
  644. }
  645. switch(s->pict_type) {
  646. default:
  647. case I_TYPE:
  648. if (get_bits1(&s->gb) == 0) {
  649. if (get_bits1(&s->gb) == 0)
  650. return -1;
  651. mb_type = MB_QUANT | MB_INTRA;
  652. } else {
  653. mb_type = MB_INTRA;
  654. }
  655. break;
  656. case P_TYPE:
  657. mb_type = get_vlc2(&s->gb, mb_ptype_vlc.table, MB_PTYPE_VLC_BITS, 1);
  658. if (mb_type < 0){
  659. fprintf(stderr, "invalid mb type in P Frame at %d %d\n", s->mb_x, s->mb_y);
  660. return -1;
  661. }
  662. break;
  663. case B_TYPE:
  664. mb_type = get_vlc2(&s->gb, mb_btype_vlc.table, MB_BTYPE_VLC_BITS, 1);
  665. if (mb_type < 0){
  666. fprintf(stderr, "invalid mb type in B Frame at %d %d\n", s->mb_x, s->mb_y);
  667. return -1;
  668. }
  669. break;
  670. }
  671. dprintf("mb_type=%x\n", mb_type);
  672. motion_type = 0; /* avoid warning */
  673. if (mb_type & (MB_FOR|MB_BACK)) {
  674. /* get additionnal motion vector type */
  675. if (s->picture_structure == PICT_FRAME && s->frame_pred_frame_dct)
  676. motion_type = MT_FRAME;
  677. else
  678. motion_type = get_bits(&s->gb, 2);
  679. }
  680. /* compute dct type */
  681. if (s->picture_structure == PICT_FRAME &&
  682. !s->frame_pred_frame_dct &&
  683. (mb_type & (MB_PAT | MB_INTRA))) {
  684. s->interlaced_dct = get_bits1(&s->gb);
  685. #ifdef DEBUG
  686. if (s->interlaced_dct)
  687. printf("interlaced_dct\n");
  688. #endif
  689. } else {
  690. s->interlaced_dct = 0; /* frame based */
  691. }
  692. if (mb_type & MB_QUANT) {
  693. s->qscale = get_qscale(s);
  694. }
  695. if (mb_type & MB_INTRA) {
  696. if (s->concealment_motion_vectors) {
  697. /* just parse them */
  698. if (s->picture_structure != PICT_FRAME)
  699. skip_bits1(&s->gb); /* field select */
  700. mpeg_decode_motion(s, s->mpeg_f_code[0][0], 0);
  701. mpeg_decode_motion(s, s->mpeg_f_code[0][1], 0);
  702. }
  703. s->mb_intra = 1;
  704. cbp = 0x3f;
  705. memset(s->last_mv, 0, sizeof(s->last_mv)); /* reset mv prediction */
  706. } else {
  707. s->mb_intra = 0;
  708. cbp = 0;
  709. }
  710. /* special case of implicit zero motion vector */
  711. if (s->pict_type == P_TYPE && !(mb_type & MB_FOR)) {
  712. s->mv_dir = MV_DIR_FORWARD;
  713. s->mv_type = MV_TYPE_16X16;
  714. s->last_mv[0][0][0] = 0;
  715. s->last_mv[0][0][1] = 0;
  716. s->last_mv[0][1][0] = 0;
  717. s->last_mv[0][1][1] = 0;
  718. s->mv[0][0][0] = 0;
  719. s->mv[0][0][1] = 0;
  720. } else if (mb_type & (MB_FOR | MB_BACK)) {
  721. /* motion vectors */
  722. s->mv_dir = 0;
  723. for(i=0;i<2;i++) {
  724. if (mb_type & (MB_FOR >> i)) {
  725. s->mv_dir |= (MV_DIR_FORWARD >> i);
  726. dprintf("motion_type=%d\n", motion_type);
  727. switch(motion_type) {
  728. case MT_FRAME: /* or MT_16X8 */
  729. if (s->picture_structure == PICT_FRAME) {
  730. /* MT_FRAME */
  731. s->mv_type = MV_TYPE_16X16;
  732. for(k=0;k<2;k++) {
  733. val = mpeg_decode_motion(s, s->mpeg_f_code[i][k],
  734. s->last_mv[i][0][k]);
  735. s->last_mv[i][0][k] = val;
  736. s->last_mv[i][1][k] = val;
  737. /* full_pel: only for mpeg1 */
  738. if (s->full_pel[i])
  739. val = val << 1;
  740. s->mv[i][0][k] = val;
  741. dprintf("mv%d: %d\n", k, val);
  742. }
  743. } else {
  744. /* MT_16X8 */
  745. s->mv_type = MV_TYPE_16X8;
  746. for(j=0;j<2;j++) {
  747. s->field_select[i][j] = get_bits1(&s->gb);
  748. for(k=0;k<2;k++) {
  749. val = mpeg_decode_motion(s, s->mpeg_f_code[i][k],
  750. s->last_mv[i][j][k]);
  751. s->last_mv[i][j][k] = val;
  752. s->mv[i][j][k] = val;
  753. }
  754. }
  755. }
  756. break;
  757. case MT_FIELD:
  758. if (s->picture_structure == PICT_FRAME) {
  759. s->mv_type = MV_TYPE_FIELD;
  760. for(j=0;j<2;j++) {
  761. s->field_select[i][j] = get_bits1(&s->gb);
  762. val = mpeg_decode_motion(s, s->mpeg_f_code[i][0],
  763. s->last_mv[i][j][0]);
  764. s->last_mv[i][j][0] = val;
  765. s->mv[i][j][0] = val;
  766. dprintf("fmx=%d\n", val);
  767. val = mpeg_decode_motion(s, s->mpeg_f_code[i][1],
  768. s->last_mv[i][j][1] >> 1);
  769. s->last_mv[i][j][1] = val << 1;
  770. s->mv[i][j][1] = val;
  771. dprintf("fmy=%d\n", val);
  772. }
  773. } else {
  774. s->mv_type = MV_TYPE_16X16;
  775. s->field_select[i][0] = get_bits1(&s->gb);
  776. for(k=0;k<2;k++) {
  777. val = mpeg_decode_motion(s, s->mpeg_f_code[i][k],
  778. s->last_mv[i][0][k]);
  779. s->last_mv[i][0][k] = val;
  780. s->last_mv[i][1][k] = val;
  781. s->mv[i][0][k] = val;
  782. }
  783. }
  784. break;
  785. case MT_DMV:
  786. {
  787. int dmx, dmy, mx, my, m;
  788. mx = mpeg_decode_motion(s, s->mpeg_f_code[i][0],
  789. s->last_mv[i][0][0]);
  790. s->last_mv[i][0][0] = mx;
  791. s->last_mv[i][1][0] = mx;
  792. dmx = get_dmv(s);
  793. my = mpeg_decode_motion(s, s->mpeg_f_code[i][1],
  794. s->last_mv[i][0][1] >> 1);
  795. dmy = get_dmv(s);
  796. s->mv_type = MV_TYPE_DMV;
  797. /* XXX: totally broken */
  798. if (s->picture_structure == PICT_FRAME) {
  799. s->last_mv[i][0][1] = my << 1;
  800. s->last_mv[i][1][1] = my << 1;
  801. m = s->top_field_first ? 1 : 3;
  802. /* top -> top pred */
  803. s->mv[i][0][0] = mx;
  804. s->mv[i][0][1] = my << 1;
  805. s->mv[i][1][0] = ((mx * m + (mx > 0)) >> 1) + dmx;
  806. s->mv[i][1][1] = ((my * m + (my > 0)) >> 1) + dmy - 1;
  807. m = 4 - m;
  808. s->mv[i][2][0] = mx;
  809. s->mv[i][2][1] = my << 1;
  810. s->mv[i][3][0] = ((mx * m + (mx > 0)) >> 1) + dmx;
  811. s->mv[i][3][1] = ((my * m + (my > 0)) >> 1) + dmy + 1;
  812. } else {
  813. s->last_mv[i][0][1] = my;
  814. s->last_mv[i][1][1] = my;
  815. s->mv[i][0][0] = mx;
  816. s->mv[i][0][1] = my;
  817. s->mv[i][1][0] = ((mx + (mx > 0)) >> 1) + dmx;
  818. s->mv[i][1][1] = ((my + (my > 0)) >> 1) + dmy - 1
  819. /* + 2 * cur_field */;
  820. }
  821. }
  822. break;
  823. }
  824. }
  825. }
  826. }
  827. if ((mb_type & MB_INTRA) && s->concealment_motion_vectors) {
  828. skip_bits1(&s->gb); /* marker */
  829. }
  830. if (mb_type & MB_PAT) {
  831. cbp = get_vlc2(&s->gb, mb_pat_vlc.table, MB_PAT_VLC_BITS, 1);
  832. if (cbp < 0){
  833. fprintf(stderr, "invalid cbp at %d %d\n", s->mb_x, s->mb_y);
  834. return -1;
  835. }
  836. cbp++;
  837. }
  838. dprintf("cbp=%x\n", cbp);
  839. if (s->mpeg2) {
  840. if (s->mb_intra) {
  841. for(i=0;i<6;i++) {
  842. if (mpeg2_decode_block_intra(s, block[i], i) < 0)
  843. return -1;
  844. }
  845. } else {
  846. for(i=0;i<6;i++) {
  847. if (cbp & 32) {
  848. if (mpeg2_decode_block_non_intra(s, block[i], i) < 0)
  849. return -1;
  850. } else {
  851. s->block_last_index[i] = -1;
  852. }
  853. cbp+=cbp;
  854. }
  855. }
  856. } else {
  857. if (s->mb_intra) {
  858. for(i=0;i<6;i++) {
  859. if (mpeg1_decode_block_intra(s, block[i], i) < 0)
  860. return -1;
  861. }
  862. }else{
  863. for(i=0;i<6;i++) {
  864. if (cbp & 32) {
  865. if (mpeg1_decode_block_inter(s, block[i], i) < 0)
  866. return -1;
  867. } else {
  868. s->block_last_index[i] = -1;
  869. }
  870. cbp+=cbp;
  871. }
  872. }
  873. }
  874. return 0;
  875. }
  876. /* as h263, but only 17 codes */
  877. static int mpeg_decode_motion(MpegEncContext *s, int fcode, int pred)
  878. {
  879. int code, sign, val, m, l, shift;
  880. code = get_vlc2(&s->gb, mv_vlc.table, MV_VLC_BITS, 2);
  881. if (code < 0) {
  882. return 0xffff;
  883. }
  884. if (code == 0) {
  885. return pred;
  886. }
  887. sign = get_bits1(&s->gb);
  888. shift = fcode - 1;
  889. val = (code - 1) << shift;
  890. if (shift > 0)
  891. val |= get_bits(&s->gb, shift);
  892. val++;
  893. if (sign)
  894. val = -val;
  895. val += pred;
  896. /* modulo decoding */
  897. l = (1 << shift) * 16;
  898. m = 2 * l;
  899. if (val < -l) {
  900. val += m;
  901. } else if (val >= l) {
  902. val -= m;
  903. }
  904. return val;
  905. }
  906. static inline int decode_dc(MpegEncContext *s, int component)
  907. {
  908. int code, diff;
  909. if (component == 0) {
  910. code = get_vlc2(&s->gb, dc_lum_vlc.table, DC_VLC_BITS, 2);
  911. } else {
  912. code = get_vlc2(&s->gb, dc_chroma_vlc.table, DC_VLC_BITS, 2);
  913. }
  914. if (code < 0){
  915. fprintf(stderr, "invalid dc code at %d %d\n", s->mb_x, s->mb_y);
  916. return 0xffff;
  917. }
  918. if (code == 0) {
  919. diff = 0;
  920. } else {
  921. diff = get_bits(&s->gb, code);
  922. if ((diff & (1 << (code - 1))) == 0)
  923. diff = (-1 << code) | (diff + 1);
  924. }
  925. return diff;
  926. }
  927. static inline int mpeg1_decode_block_intra(MpegEncContext *s,
  928. DCTELEM *block,
  929. int n)
  930. {
  931. int level, dc, diff, i, j, run;
  932. int component;
  933. RLTable *rl = &rl_mpeg1;
  934. UINT8 * const scantable= s->intra_scantable.permutated;
  935. const UINT16 *quant_matrix= s->intra_matrix;
  936. const int qscale= s->qscale;
  937. /* DC coef */
  938. component = (n <= 3 ? 0 : n - 4 + 1);
  939. diff = decode_dc(s, component);
  940. if (diff >= 0xffff)
  941. return -1;
  942. dc = s->last_dc[component];
  943. dc += diff;
  944. s->last_dc[component] = dc;
  945. block[0] = dc<<3;
  946. dprintf("dc=%d diff=%d\n", dc, diff);
  947. i = 0;
  948. {
  949. OPEN_READER(re, &s->gb);
  950. /* now quantify & encode AC coefs */
  951. for(;;) {
  952. UPDATE_CACHE(re, &s->gb);
  953. GET_RL_VLC(level, run, re, &s->gb, rl->rl_vlc[0], TEX_VLC_BITS, 2);
  954. if(level == 127){
  955. break;
  956. } else if(level != 0) {
  957. i += run;
  958. j = scantable[i];
  959. level= (level*qscale*quant_matrix[j])>>3;
  960. level= (level-1)|1;
  961. level = (level ^ SHOW_SBITS(re, &s->gb, 1)) - SHOW_SBITS(re, &s->gb, 1);
  962. LAST_SKIP_BITS(re, &s->gb, 1);
  963. } else {
  964. /* escape */
  965. run = SHOW_UBITS(re, &s->gb, 6)+1; LAST_SKIP_BITS(re, &s->gb, 6);
  966. UPDATE_CACHE(re, &s->gb);
  967. level = SHOW_SBITS(re, &s->gb, 8); SKIP_BITS(re, &s->gb, 8);
  968. if (level == -128) {
  969. level = SHOW_UBITS(re, &s->gb, 8) - 256; LAST_SKIP_BITS(re, &s->gb, 8);
  970. } else if (level == 0) {
  971. level = SHOW_UBITS(re, &s->gb, 8) ; LAST_SKIP_BITS(re, &s->gb, 8);
  972. }
  973. i += run;
  974. j = scantable[i];
  975. if(level<0){
  976. level= -level;
  977. level= (level*qscale*quant_matrix[j])>>3;
  978. level= (level-1)|1;
  979. level= -level;
  980. }else{
  981. level= (level*qscale*quant_matrix[j])>>3;
  982. level= (level-1)|1;
  983. }
  984. }
  985. if (i > 63){
  986. fprintf(stderr, "ac-tex damaged at %d %d\n", s->mb_x, s->mb_y);
  987. return -1;
  988. }
  989. block[j] = level;
  990. }
  991. CLOSE_READER(re, &s->gb);
  992. }
  993. s->block_last_index[n] = i;
  994. return 0;
  995. }
  996. static inline int mpeg1_decode_block_inter(MpegEncContext *s,
  997. DCTELEM *block,
  998. int n)
  999. {
  1000. int level, i, j, run;
  1001. RLTable *rl = &rl_mpeg1;
  1002. UINT8 * const scantable= s->intra_scantable.permutated;
  1003. const UINT16 *quant_matrix= s->inter_matrix;
  1004. const int qscale= s->qscale;
  1005. {
  1006. int v;
  1007. OPEN_READER(re, &s->gb);
  1008. i = -1;
  1009. /* special case for the first coef. no need to add a second vlc table */
  1010. UPDATE_CACHE(re, &s->gb);
  1011. v= SHOW_UBITS(re, &s->gb, 2);
  1012. if (v & 2) {
  1013. SKIP_BITS(re, &s->gb, 2);
  1014. level= (3*qscale*quant_matrix[0])>>4;
  1015. level= (level-1)|1;
  1016. if(v&1)
  1017. level= -level;
  1018. block[ scantable[0] ] = level;
  1019. i++;
  1020. }
  1021. CLOSE_READER(re, &s->gb);
  1022. }
  1023. {
  1024. OPEN_READER(re, &s->gb);
  1025. /* now quantify & encode AC coefs */
  1026. for(;;) {
  1027. UPDATE_CACHE(re, &s->gb);
  1028. GET_RL_VLC(level, run, re, &s->gb, rl->rl_vlc[0], TEX_VLC_BITS, 2);
  1029. if(level == 127){
  1030. break;
  1031. } else if(level != 0) {
  1032. i += run;
  1033. j = scantable[i];
  1034. level= ((level*2+1)*qscale*quant_matrix[j])>>4;
  1035. level= (level-1)|1;
  1036. level = (level ^ SHOW_SBITS(re, &s->gb, 1)) - SHOW_SBITS(re, &s->gb, 1);
  1037. LAST_SKIP_BITS(re, &s->gb, 1);
  1038. } else {
  1039. /* escape */
  1040. run = SHOW_UBITS(re, &s->gb, 6)+1; LAST_SKIP_BITS(re, &s->gb, 6);
  1041. UPDATE_CACHE(re, &s->gb);
  1042. level = SHOW_SBITS(re, &s->gb, 8); SKIP_BITS(re, &s->gb, 8);
  1043. if (level == -128) {
  1044. level = SHOW_UBITS(re, &s->gb, 8) - 256; LAST_SKIP_BITS(re, &s->gb, 8);
  1045. } else if (level == 0) {
  1046. level = SHOW_UBITS(re, &s->gb, 8) ; LAST_SKIP_BITS(re, &s->gb, 8);
  1047. }
  1048. i += run;
  1049. j = scantable[i];
  1050. if(level<0){
  1051. level= -level;
  1052. level= ((level*2+1)*qscale*quant_matrix[j])>>4;
  1053. level= (level-1)|1;
  1054. level= -level;
  1055. }else{
  1056. level= ((level*2+1)*qscale*quant_matrix[j])>>4;
  1057. level= (level-1)|1;
  1058. }
  1059. }
  1060. if (i > 63){
  1061. fprintf(stderr, "ac-tex damaged at %d %d\n", s->mb_x, s->mb_y);
  1062. return -1;
  1063. }
  1064. block[j] = level;
  1065. }
  1066. CLOSE_READER(re, &s->gb);
  1067. }
  1068. s->block_last_index[n] = i;
  1069. return 0;
  1070. }
  1071. /* Also does unquantization here, since I will never support mpeg2
  1072. encoding */
  1073. static int mpeg2_decode_block_non_intra(MpegEncContext *s,
  1074. DCTELEM *block,
  1075. int n)
  1076. {
  1077. int level, i, j, run;
  1078. int code;
  1079. RLTable *rl = &rl_mpeg1;
  1080. const UINT8 *scan_table;
  1081. const UINT16 *matrix;
  1082. int mismatch;
  1083. if (s->alternate_scan)
  1084. scan_table = s->intra_v_scantable.permutated;
  1085. else
  1086. scan_table = s->intra_scantable.permutated;
  1087. mismatch = 1;
  1088. {
  1089. int v;
  1090. OPEN_READER(re, &s->gb);
  1091. i = 0;
  1092. if (n < 4)
  1093. matrix = s->inter_matrix;
  1094. else
  1095. matrix = s->chroma_inter_matrix;
  1096. /* special case for the first coef. no need to add a second vlc table */
  1097. UPDATE_CACHE(re, &s->gb);
  1098. v= SHOW_UBITS(re, &s->gb, 2);
  1099. if (v & 2) {
  1100. run = 0;
  1101. level = 5 - (v << 1);
  1102. SKIP_BITS(re, &s->gb, 2);
  1103. CLOSE_READER(re, &s->gb);
  1104. goto add_coef;
  1105. }
  1106. CLOSE_READER(re, &s->gb);
  1107. }
  1108. /* now quantify & encode AC coefs */
  1109. for(;;) {
  1110. code = get_vlc2(&s->gb, rl->vlc.table, TEX_VLC_BITS, 2);
  1111. if (code < 0){
  1112. fprintf(stderr, "invalid ac code at %d %d\n", s->mb_x, s->mb_y);
  1113. return -1;
  1114. }
  1115. if (code == 112) {
  1116. break;
  1117. } else if (code == 111) {
  1118. /* escape */
  1119. run = get_bits(&s->gb, 6);
  1120. level = get_bits(&s->gb, 12);
  1121. level= (level + ((-1)<<11)) ^ ((-1)<<11); //sign extension
  1122. } else {
  1123. run = rl->table_run[code];
  1124. level = rl->table_level[code];
  1125. if (get_bits1(&s->gb))
  1126. level = -level;
  1127. }
  1128. i += run;
  1129. if (i >= 64){
  1130. fprintf(stderr, "run too long at %d %d\n", s->mb_x, s->mb_y);
  1131. return -1;
  1132. }
  1133. add_coef:
  1134. j = scan_table[i];
  1135. dprintf("%d: run=%d level=%d\n", n, run, level);
  1136. /* XXX: optimize */
  1137. if (level > 0) {
  1138. level = ((level * 2 + 1) * s->qscale * matrix[j]) >> 5;
  1139. } else {
  1140. level = ((-level * 2 + 1) * s->qscale * matrix[j]) >> 5;
  1141. level = -level;
  1142. }
  1143. /* XXX: is it really necessary to saturate since the encoder
  1144. knows whats going on ? */
  1145. mismatch ^= level;
  1146. block[j] = level;
  1147. i++;
  1148. }
  1149. block[63] ^= (mismatch & 1);
  1150. s->block_last_index[n] = i;
  1151. return 0;
  1152. }
  1153. static int mpeg2_decode_block_intra(MpegEncContext *s,
  1154. DCTELEM *block,
  1155. int n)
  1156. {
  1157. int level, dc, diff, i, j, run;
  1158. int code, component;
  1159. RLTable *rl;
  1160. const UINT8 *scan_table;
  1161. const UINT16 *matrix;
  1162. int mismatch;
  1163. if (s->alternate_scan)
  1164. scan_table = s->intra_v_scantable.permutated;
  1165. else
  1166. scan_table = s->intra_scantable.permutated;
  1167. /* DC coef */
  1168. component = (n <= 3 ? 0 : n - 4 + 1);
  1169. diff = decode_dc(s, component);
  1170. if (diff >= 0xffff)
  1171. return -1;
  1172. dc = s->last_dc[component];
  1173. dc += diff;
  1174. s->last_dc[component] = dc;
  1175. block[0] = dc << (3 - s->intra_dc_precision);
  1176. dprintf("dc=%d\n", block[0]);
  1177. mismatch = block[0] ^ 1;
  1178. i = 1;
  1179. if (s->intra_vlc_format)
  1180. rl = &rl_mpeg2;
  1181. else
  1182. rl = &rl_mpeg1;
  1183. if (n < 4)
  1184. matrix = s->intra_matrix;
  1185. else
  1186. matrix = s->chroma_intra_matrix;
  1187. /* now quantify & encode AC coefs */
  1188. for(;;) {
  1189. code = get_vlc2(&s->gb, rl->vlc.table, TEX_VLC_BITS, 2);
  1190. if (code < 0){
  1191. fprintf(stderr, "invalid ac code at %d %d\n", s->mb_x, s->mb_y);
  1192. return -1;
  1193. }
  1194. if (code == 112) {
  1195. break;
  1196. } else if (code == 111) {
  1197. /* escape */
  1198. run = get_bits(&s->gb, 6);
  1199. level = get_bits(&s->gb, 12);
  1200. level= (level + ((-1)<<11)) ^ ((-1)<<11); //sign extension
  1201. } else {
  1202. run = rl->table_run[code];
  1203. level = rl->table_level[code];
  1204. if (get_bits1(&s->gb))
  1205. level = -level;
  1206. }
  1207. i += run;
  1208. if (i >= 64){
  1209. fprintf(stderr, "run too long at %d %d\n", s->mb_x, s->mb_y);
  1210. return -1;
  1211. }
  1212. j = scan_table[i];
  1213. dprintf("%d: run=%d level=%d\n", n, run, level);
  1214. level = (level * s->qscale * matrix[j]) / 16;
  1215. /* XXX: is it really necessary to saturate since the encoder
  1216. knows whats going on ? */
  1217. mismatch ^= level;
  1218. block[j] = level;
  1219. i++;
  1220. }
  1221. block[63] ^= (mismatch & 1);
  1222. s->block_last_index[n] = i;
  1223. return 0;
  1224. }
  1225. /* compressed picture size */
  1226. #define PICTURE_BUFFER_SIZE 100000
  1227. typedef struct Mpeg1Context {
  1228. MpegEncContext mpeg_enc_ctx;
  1229. UINT32 header_state;
  1230. int start_code; /* current start code */
  1231. UINT8 buffer[PICTURE_BUFFER_SIZE];
  1232. UINT8 *buf_ptr;
  1233. int buffer_size;
  1234. int mpeg_enc_ctx_allocated; /* true if decoding context allocated */
  1235. int repeat_field; /* true if we must repeat the field */
  1236. } Mpeg1Context;
  1237. static int mpeg_decode_init(AVCodecContext *avctx)
  1238. {
  1239. Mpeg1Context *s = avctx->priv_data;
  1240. s->mpeg_enc_ctx.flags= avctx->flags;
  1241. common_init(&s->mpeg_enc_ctx);
  1242. init_vlcs(&s->mpeg_enc_ctx);
  1243. s->header_state = 0xff;
  1244. s->mpeg_enc_ctx_allocated = 0;
  1245. s->buffer_size = PICTURE_BUFFER_SIZE;
  1246. s->start_code = -1;
  1247. s->buf_ptr = s->buffer;
  1248. s->mpeg_enc_ctx.picture_number = 0;
  1249. s->repeat_field = 0;
  1250. s->mpeg_enc_ctx.codec_id= avctx->codec->id;
  1251. avctx->mbskip_table= s->mpeg_enc_ctx.mbskip_table;
  1252. return 0;
  1253. }
  1254. /* return the 8 bit start code value and update the search
  1255. state. Return -1 if no start code found */
  1256. static int find_start_code(UINT8 **pbuf_ptr, UINT8 *buf_end,
  1257. UINT32 *header_state)
  1258. {
  1259. UINT8 *buf_ptr;
  1260. unsigned int state, v;
  1261. int val;
  1262. state = *header_state;
  1263. buf_ptr = *pbuf_ptr;
  1264. while (buf_ptr < buf_end) {
  1265. v = *buf_ptr++;
  1266. if (state == 0x000001) {
  1267. state = ((state << 8) | v) & 0xffffff;
  1268. val = state;
  1269. goto found;
  1270. }
  1271. state = ((state << 8) | v) & 0xffffff;
  1272. }
  1273. val = -1;
  1274. found:
  1275. *pbuf_ptr = buf_ptr;
  1276. *header_state = state;
  1277. return val;
  1278. }
  1279. static int mpeg1_decode_picture(AVCodecContext *avctx,
  1280. UINT8 *buf, int buf_size)
  1281. {
  1282. Mpeg1Context *s1 = avctx->priv_data;
  1283. MpegEncContext *s = &s1->mpeg_enc_ctx;
  1284. int ref, f_code;
  1285. init_get_bits(&s->gb, buf, buf_size);
  1286. ref = get_bits(&s->gb, 10); /* temporal ref */
  1287. s->pict_type = get_bits(&s->gb, 3);
  1288. dprintf("pict_type=%d number=%d\n", s->pict_type, s->picture_number);
  1289. skip_bits(&s->gb, 16);
  1290. if (s->pict_type == P_TYPE || s->pict_type == B_TYPE) {
  1291. s->full_pel[0] = get_bits1(&s->gb);
  1292. f_code = get_bits(&s->gb, 3);
  1293. if (f_code == 0)
  1294. return -1;
  1295. s->mpeg_f_code[0][0] = f_code;
  1296. s->mpeg_f_code[0][1] = f_code;
  1297. }
  1298. if (s->pict_type == B_TYPE) {
  1299. s->full_pel[1] = get_bits1(&s->gb);
  1300. f_code = get_bits(&s->gb, 3);
  1301. if (f_code == 0)
  1302. return -1;
  1303. s->mpeg_f_code[1][0] = f_code;
  1304. s->mpeg_f_code[1][1] = f_code;
  1305. }
  1306. s->y_dc_scale = 8;
  1307. s->c_dc_scale = 8;
  1308. s->first_slice = 1;
  1309. return 0;
  1310. }
  1311. static void mpeg_decode_sequence_extension(MpegEncContext *s)
  1312. {
  1313. int horiz_size_ext, vert_size_ext;
  1314. int bit_rate_ext, vbv_buf_ext, low_delay;
  1315. int frame_rate_ext_n, frame_rate_ext_d;
  1316. skip_bits(&s->gb, 8); /* profil and level */
  1317. s->progressive_sequence = get_bits1(&s->gb); /* progressive_sequence */
  1318. skip_bits(&s->gb, 2); /* chroma_format */
  1319. horiz_size_ext = get_bits(&s->gb, 2);
  1320. vert_size_ext = get_bits(&s->gb, 2);
  1321. s->width |= (horiz_size_ext << 12);
  1322. s->height |= (vert_size_ext << 12);
  1323. bit_rate_ext = get_bits(&s->gb, 12); /* XXX: handle it */
  1324. s->bit_rate = ((s->bit_rate / 400) | (bit_rate_ext << 12)) * 400;
  1325. skip_bits1(&s->gb); /* marker */
  1326. vbv_buf_ext = get_bits(&s->gb, 8);
  1327. low_delay = get_bits1(&s->gb);
  1328. frame_rate_ext_n = get_bits(&s->gb, 2);
  1329. frame_rate_ext_d = get_bits(&s->gb, 5);
  1330. if (frame_rate_ext_d >= 1)
  1331. s->frame_rate = (s->frame_rate * frame_rate_ext_n) / frame_rate_ext_d;
  1332. dprintf("sequence extension\n");
  1333. s->mpeg2 = 1;
  1334. s->avctx->sub_id = 2; /* indicates mpeg2 found */
  1335. }
  1336. static void mpeg_decode_quant_matrix_extension(MpegEncContext *s)
  1337. {
  1338. int i, v, j;
  1339. dprintf("matrix extension\n");
  1340. if (get_bits1(&s->gb)) {
  1341. for(i=0;i<64;i++) {
  1342. v = get_bits(&s->gb, 8);
  1343. j = s->intra_scantable.permutated[i];
  1344. s->intra_matrix[j] = v;
  1345. s->chroma_intra_matrix[j] = v;
  1346. }
  1347. }
  1348. if (get_bits1(&s->gb)) {
  1349. for(i=0;i<64;i++) {
  1350. v = get_bits(&s->gb, 8);
  1351. j = s->intra_scantable.permutated[i];
  1352. s->inter_matrix[j] = v;
  1353. s->chroma_inter_matrix[j] = v;
  1354. }
  1355. }
  1356. if (get_bits1(&s->gb)) {
  1357. for(i=0;i<64;i++) {
  1358. v = get_bits(&s->gb, 8);
  1359. j = s->intra_scantable.permutated[i];
  1360. s->chroma_intra_matrix[j] = v;
  1361. }
  1362. }
  1363. if (get_bits1(&s->gb)) {
  1364. for(i=0;i<64;i++) {
  1365. v = get_bits(&s->gb, 8);
  1366. j = s->intra_scantable.permutated[i];
  1367. s->chroma_inter_matrix[j] = v;
  1368. }
  1369. }
  1370. }
  1371. static void mpeg_decode_picture_coding_extension(MpegEncContext *s)
  1372. {
  1373. s->full_pel[0] = s->full_pel[1] = 0;
  1374. s->mpeg_f_code[0][0] = get_bits(&s->gb, 4);
  1375. s->mpeg_f_code[0][1] = get_bits(&s->gb, 4);
  1376. s->mpeg_f_code[1][0] = get_bits(&s->gb, 4);
  1377. s->mpeg_f_code[1][1] = get_bits(&s->gb, 4);
  1378. s->intra_dc_precision = get_bits(&s->gb, 2);
  1379. s->picture_structure = get_bits(&s->gb, 2);
  1380. s->top_field_first = get_bits1(&s->gb);
  1381. s->frame_pred_frame_dct = get_bits1(&s->gb);
  1382. s->concealment_motion_vectors = get_bits1(&s->gb);
  1383. s->q_scale_type = get_bits1(&s->gb);
  1384. s->intra_vlc_format = get_bits1(&s->gb);
  1385. s->alternate_scan = get_bits1(&s->gb);
  1386. s->repeat_first_field = get_bits1(&s->gb);
  1387. s->chroma_420_type = get_bits1(&s->gb);
  1388. s->progressive_frame = get_bits1(&s->gb);
  1389. /* composite display not parsed */
  1390. dprintf("intra_dc_precision=%d\n", s->intra_dc_precision);
  1391. dprintf("picture_structure=%d\n", s->picture_structure);
  1392. dprintf("top field first=%d\n", s->top_field_first);
  1393. dprintf("repeat first field=%d\n", s->repeat_first_field);
  1394. dprintf("conceal=%d\n", s->concealment_motion_vectors);
  1395. dprintf("intra_vlc_format=%d\n", s->intra_vlc_format);
  1396. dprintf("alternate_scan=%d\n", s->alternate_scan);
  1397. dprintf("frame_pred_frame_dct=%d\n", s->frame_pred_frame_dct);
  1398. dprintf("progressive_frame=%d\n", s->progressive_frame);
  1399. }
  1400. static void mpeg_decode_extension(AVCodecContext *avctx,
  1401. UINT8 *buf, int buf_size)
  1402. {
  1403. Mpeg1Context *s1 = avctx->priv_data;
  1404. MpegEncContext *s = &s1->mpeg_enc_ctx;
  1405. int ext_type;
  1406. init_get_bits(&s->gb, buf, buf_size);
  1407. ext_type = get_bits(&s->gb, 4);
  1408. switch(ext_type) {
  1409. case 0x1:
  1410. /* sequence ext */
  1411. mpeg_decode_sequence_extension(s);
  1412. break;
  1413. case 0x3:
  1414. /* quant matrix extension */
  1415. mpeg_decode_quant_matrix_extension(s);
  1416. break;
  1417. case 0x8:
  1418. /* picture extension */
  1419. mpeg_decode_picture_coding_extension(s);
  1420. break;
  1421. }
  1422. }
  1423. /* return 1 if end of frame */
  1424. static int mpeg_decode_slice(AVCodecContext *avctx,
  1425. AVPicture *pict,
  1426. int start_code,
  1427. UINT8 *buf, int buf_size)
  1428. {
  1429. Mpeg1Context *s1 = avctx->priv_data;
  1430. MpegEncContext *s = &s1->mpeg_enc_ctx;
  1431. int ret;
  1432. start_code = (start_code - 1) & 0xff;
  1433. if (start_code >= s->mb_height){
  1434. fprintf(stderr, "slice below image (%d >= %d)\n", start_code, s->mb_height);
  1435. return -1;
  1436. }
  1437. s->last_dc[0] = 1 << (7 + s->intra_dc_precision);
  1438. s->last_dc[1] = s->last_dc[0];
  1439. s->last_dc[2] = s->last_dc[0];
  1440. memset(s->last_mv, 0, sizeof(s->last_mv));
  1441. s->mb_x = -1;
  1442. s->mb_y = start_code;
  1443. s->mb_incr = 0;
  1444. /* start frame decoding */
  1445. if (s->first_slice) {
  1446. s->first_slice = 0;
  1447. MPV_frame_start(s, avctx);
  1448. }
  1449. init_get_bits(&s->gb, buf, buf_size);
  1450. s->qscale = get_qscale(s);
  1451. /* extra slice info */
  1452. while (get_bits1(&s->gb) != 0) {
  1453. skip_bits(&s->gb, 8);
  1454. }
  1455. for(;;) {
  1456. clear_blocks(s->block[0]);
  1457. emms_c();
  1458. ret = mpeg_decode_mb(s, s->block);
  1459. dprintf("ret=%d\n", ret);
  1460. if (ret < 0)
  1461. return -1;
  1462. if (ret == 1)
  1463. break;
  1464. if(s->mb_x==0)
  1465. PRINT_QP("%s", "\n");
  1466. PRINT_QP("%2d", s->qscale);
  1467. MPV_decode_mb(s, s->block);
  1468. }
  1469. emms_c();
  1470. /* end of slice reached */
  1471. if (s->mb_x == (s->mb_width - 1) &&
  1472. s->mb_y == (s->mb_height - 1)) {
  1473. /* end of image */
  1474. UINT8 **picture;
  1475. MPV_frame_end(s);
  1476. /* XXX: incorrect reported qscale for mpeg2 */
  1477. if (s->pict_type == B_TYPE) {
  1478. picture = s->current_picture;
  1479. avctx->quality = s->qscale;
  1480. } else {
  1481. /* latency of 1 frame for I and P frames */
  1482. /* XXX: use another variable than picture_number */
  1483. if (s->picture_number == 0) {
  1484. picture = NULL;
  1485. } else {
  1486. picture = s->last_picture;
  1487. avctx->quality = s->last_qscale;
  1488. }
  1489. s->last_qscale = s->qscale;
  1490. s->picture_number++;
  1491. }
  1492. if (picture) {
  1493. pict->data[0] = picture[0];
  1494. pict->data[1] = picture[1];
  1495. pict->data[2] = picture[2];
  1496. pict->linesize[0] = s->linesize;
  1497. pict->linesize[1] = s->uvlinesize;
  1498. pict->linesize[2] = s->uvlinesize;
  1499. return 1;
  1500. } else {
  1501. return 0;
  1502. }
  1503. } else {
  1504. return 0;
  1505. }
  1506. }
  1507. static int mpeg1_decode_sequence(AVCodecContext *avctx,
  1508. UINT8 *buf, int buf_size)
  1509. {
  1510. Mpeg1Context *s1 = avctx->priv_data;
  1511. MpegEncContext *s = &s1->mpeg_enc_ctx;
  1512. int width, height, i, v, j;
  1513. init_get_bits(&s->gb, buf, buf_size);
  1514. width = get_bits(&s->gb, 12);
  1515. height = get_bits(&s->gb, 12);
  1516. skip_bits(&s->gb, 4);
  1517. s->frame_rate_index = get_bits(&s->gb, 4);
  1518. if (s->frame_rate_index == 0)
  1519. return -1;
  1520. s->bit_rate = get_bits(&s->gb, 18) * 400;
  1521. if (get_bits1(&s->gb) == 0) /* marker */
  1522. return -1;
  1523. if (width <= 0 || height <= 0 ||
  1524. (width % 2) != 0 || (height % 2) != 0)
  1525. return -1;
  1526. if (width != s->width ||
  1527. height != s->height) {
  1528. /* start new mpeg1 context decoding */
  1529. s->out_format = FMT_MPEG1;
  1530. if (s1->mpeg_enc_ctx_allocated) {
  1531. MPV_common_end(s);
  1532. }
  1533. s->width = width;
  1534. s->height = height;
  1535. avctx->has_b_frames= s->has_b_frames = 1;
  1536. s->avctx = avctx;
  1537. avctx->width = width;
  1538. avctx->height = height;
  1539. if (s->frame_rate_index >= 9) {
  1540. /* at least give a valid frame rate (some old mpeg1 have this) */
  1541. avctx->frame_rate = 25 * FRAME_RATE_BASE;
  1542. } else {
  1543. avctx->frame_rate = frame_rate_tab[s->frame_rate_index];
  1544. }
  1545. s->frame_rate = avctx->frame_rate;
  1546. avctx->bit_rate = s->bit_rate;
  1547. if (MPV_common_init(s) < 0)
  1548. return -1;
  1549. s1->mpeg_enc_ctx_allocated = 1;
  1550. }
  1551. skip_bits(&s->gb, 10); /* vbv_buffer_size */
  1552. skip_bits(&s->gb, 1);
  1553. /* get matrix */
  1554. if (get_bits1(&s->gb)) {
  1555. for(i=0;i<64;i++) {
  1556. v = get_bits(&s->gb, 8);
  1557. j = s->intra_scantable.permutated[i];
  1558. s->intra_matrix[j] = v;
  1559. s->chroma_intra_matrix[j] = v;
  1560. }
  1561. #ifdef DEBUG
  1562. dprintf("intra matrix present\n");
  1563. for(i=0;i<64;i++)
  1564. dprintf(" %d", s->intra_matrix[s->intra_scantable.permutated[i]]);
  1565. printf("\n");
  1566. #endif
  1567. } else {
  1568. for(i=0;i<64;i++) {
  1569. int j= s->idct_permutation[i];
  1570. v = ff_mpeg1_default_intra_matrix[i];
  1571. s->intra_matrix[j] = v;
  1572. s->chroma_intra_matrix[j] = v;
  1573. }
  1574. }
  1575. if (get_bits1(&s->gb)) {
  1576. for(i=0;i<64;i++) {
  1577. v = get_bits(&s->gb, 8);
  1578. j = s->intra_scantable.permutated[i];
  1579. s->inter_matrix[j] = v;
  1580. s->chroma_inter_matrix[j] = v;
  1581. }
  1582. #ifdef DEBUG
  1583. dprintf("non intra matrix present\n");
  1584. for(i=0;i<64;i++)
  1585. dprintf(" %d", s->inter_matrix[s->intra_scantable.permutated[i]]);
  1586. printf("\n");
  1587. #endif
  1588. } else {
  1589. for(i=0;i<64;i++) {
  1590. int j= s->idct_permutation[i];
  1591. v = ff_mpeg1_default_non_intra_matrix[i];
  1592. s->inter_matrix[j] = v;
  1593. s->chroma_inter_matrix[j] = v;
  1594. }
  1595. }
  1596. /* we set mpeg2 parameters so that it emulates mpeg1 */
  1597. s->progressive_sequence = 1;
  1598. s->progressive_frame = 1;
  1599. s->picture_structure = PICT_FRAME;
  1600. s->frame_pred_frame_dct = 1;
  1601. s->mpeg2 = 0;
  1602. avctx->sub_id = 1; /* indicates mpeg1 */
  1603. return 0;
  1604. }
  1605. /* handle buffering and image synchronisation */
  1606. static int mpeg_decode_frame(AVCodecContext *avctx,
  1607. void *data, int *data_size,
  1608. UINT8 *buf, int buf_size)
  1609. {
  1610. Mpeg1Context *s = avctx->priv_data;
  1611. UINT8 *buf_end, *buf_ptr, *buf_start;
  1612. int len, start_code_found, ret, code, start_code, input_size;
  1613. AVPicture *picture = data;
  1614. MpegEncContext *s2 = &s->mpeg_enc_ctx;
  1615. dprintf("fill_buffer\n");
  1616. *data_size = 0;
  1617. /* special case for last picture */
  1618. if (buf_size == 0) {
  1619. if (s2->picture_number > 0) {
  1620. picture->data[0] = s2->next_picture[0];
  1621. picture->data[1] = s2->next_picture[1];
  1622. picture->data[2] = s2->next_picture[2];
  1623. picture->linesize[0] = s2->linesize;
  1624. picture->linesize[1] = s2->uvlinesize;
  1625. picture->linesize[2] = s2->uvlinesize;
  1626. *data_size = sizeof(AVPicture);
  1627. }
  1628. return 0;
  1629. }
  1630. buf_ptr = buf;
  1631. buf_end = buf + buf_size;
  1632. #if 0
  1633. if (s->repeat_field % 2 == 1) {
  1634. s->repeat_field++;
  1635. //fprintf(stderr,"\nRepeating last frame: %d -> %d! pict: %d %d", avctx->frame_number-1, avctx->frame_number,
  1636. // s2->picture_number, s->repeat_field);
  1637. if (avctx->flags & CODEC_FLAG_REPEAT_FIELD) {
  1638. *data_size = sizeof(AVPicture);
  1639. goto the_end;
  1640. }
  1641. }
  1642. #endif
  1643. while (buf_ptr < buf_end) {
  1644. buf_start = buf_ptr;
  1645. /* find start next code */
  1646. code = find_start_code(&buf_ptr, buf_end, &s->header_state);
  1647. if (code >= 0) {
  1648. start_code_found = 1;
  1649. } else {
  1650. start_code_found = 0;
  1651. }
  1652. /* copy to buffer */
  1653. len = buf_ptr - buf_start;
  1654. if (len + (s->buf_ptr - s->buffer) > s->buffer_size) {
  1655. /* data too big : flush */
  1656. s->buf_ptr = s->buffer;
  1657. if (start_code_found)
  1658. s->start_code = code;
  1659. } else {
  1660. memcpy(s->buf_ptr, buf_start, len);
  1661. s->buf_ptr += len;
  1662. if( (s2->flags&CODEC_FLAG_NOT_TRUNCATED) && (!start_code_found)
  1663. && s->buf_ptr+4<s->buffer+s->buffer_size){
  1664. start_code_found= 1;
  1665. code= 0x1FF;
  1666. s->header_state=0xFF;
  1667. s->buf_ptr[0]=0;
  1668. s->buf_ptr[1]=0;
  1669. s->buf_ptr[2]=1;
  1670. s->buf_ptr[3]=0xFF;
  1671. s->buf_ptr+=4;
  1672. }
  1673. if (start_code_found) {
  1674. /* prepare data for next start code */
  1675. input_size = s->buf_ptr - s->buffer;
  1676. start_code = s->start_code;
  1677. s->buf_ptr = s->buffer;
  1678. s->start_code = code;
  1679. switch(start_code) {
  1680. case SEQ_START_CODE:
  1681. mpeg1_decode_sequence(avctx, s->buffer,
  1682. input_size);
  1683. break;
  1684. case PICTURE_START_CODE:
  1685. /* we have a complete image : we try to decompress it */
  1686. mpeg1_decode_picture(avctx,
  1687. s->buffer, input_size);
  1688. break;
  1689. case EXT_START_CODE:
  1690. mpeg_decode_extension(avctx,
  1691. s->buffer, input_size);
  1692. break;
  1693. default:
  1694. if (start_code >= SLICE_MIN_START_CODE &&
  1695. start_code <= SLICE_MAX_START_CODE) {
  1696. ret = mpeg_decode_slice(avctx, picture,
  1697. start_code, s->buffer, input_size);
  1698. if (ret == 1) {
  1699. /* got a picture: exit */
  1700. /* first check if we must repeat the frame */
  1701. avctx->repeat_pict = 0;
  1702. #if 0
  1703. if (s2->progressive_frame && s2->repeat_first_field) {
  1704. //fprintf(stderr,"\nRepeat this frame: %d! pict: %d",avctx->frame_number,s2->picture_number);
  1705. //s2->repeat_first_field = 0;
  1706. //s2->progressive_frame = 0;
  1707. if (++s->repeat_field > 2)
  1708. s->repeat_field = 0;
  1709. avctx->repeat_pict = 1;
  1710. }
  1711. #endif
  1712. if (s2->repeat_first_field) {
  1713. if (s2->progressive_sequence) {
  1714. if (s2->top_field_first)
  1715. avctx->repeat_pict = 4;
  1716. else
  1717. avctx->repeat_pict = 2;
  1718. } else if (s2->progressive_frame) {
  1719. avctx->repeat_pict = 1;
  1720. }
  1721. }
  1722. *data_size = sizeof(AVPicture);
  1723. goto the_end;
  1724. }else if(ret==-1){
  1725. printf("Error while decoding slice\n");
  1726. }
  1727. }
  1728. break;
  1729. }
  1730. }
  1731. }
  1732. }
  1733. the_end:
  1734. return buf_ptr - buf;
  1735. }
  1736. static int mpeg_decode_end(AVCodecContext *avctx)
  1737. {
  1738. Mpeg1Context *s = avctx->priv_data;
  1739. if (s->mpeg_enc_ctx_allocated)
  1740. MPV_common_end(&s->mpeg_enc_ctx);
  1741. return 0;
  1742. }
  1743. AVCodec mpeg_decoder = {
  1744. "mpegvideo",
  1745. CODEC_TYPE_VIDEO,
  1746. CODEC_ID_MPEG1VIDEO,
  1747. sizeof(Mpeg1Context),
  1748. mpeg_decode_init,
  1749. NULL,
  1750. mpeg_decode_end,
  1751. mpeg_decode_frame,
  1752. CODEC_CAP_DR1,
  1753. };