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.

1845 lines
58KB

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