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.

1590 lines
49KB

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