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.

1575 lines
48KB

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