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.

1976 lines
63KB

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