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.

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