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.

240 lines
7.5KB

  1. /*
  2. * MPEG-1/2 decoder
  3. * Copyright (c) 2000, 2001 Fabrice Bellard
  4. * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
  5. *
  6. * This file is part of Libav.
  7. *
  8. * Libav is free software; you can redistribute it and/or
  9. * modify it under the terms of the GNU Lesser General Public
  10. * License as published by the Free Software Foundation; either
  11. * version 2.1 of the License, or (at your option) any later version.
  12. *
  13. * Libav is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  16. * Lesser General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU Lesser General Public
  19. * License along with Libav; if not, write to the Free Software
  20. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  21. */
  22. /**
  23. * @file
  24. * MPEG-1/2 decoder
  25. */
  26. #include "libavutil/attributes.h"
  27. #include "internal.h"
  28. #include "avcodec.h"
  29. #include "dsputil.h"
  30. #include "mpegvideo.h"
  31. #include "error_resilience.h"
  32. #include "mpeg12.h"
  33. #include "mpeg12data.h"
  34. #include "bytestream.h"
  35. #include "xvmc_internal.h"
  36. #include "thread.h"
  37. uint8_t ff_mpeg12_static_rl_table_store[2][2][2*MAX_RUN + MAX_LEVEL + 3];
  38. static const uint8_t table_mb_ptype[7][2] = {
  39. { 3, 5 }, // 0x01 MB_INTRA
  40. { 1, 2 }, // 0x02 MB_PAT
  41. { 1, 3 }, // 0x08 MB_FOR
  42. { 1, 1 }, // 0x0A MB_FOR|MB_PAT
  43. { 1, 6 }, // 0x11 MB_QUANT|MB_INTRA
  44. { 1, 5 }, // 0x12 MB_QUANT|MB_PAT
  45. { 2, 5 }, // 0x1A MB_QUANT|MB_FOR|MB_PAT
  46. };
  47. static const uint8_t table_mb_btype[11][2] = {
  48. { 3, 5 }, // 0x01 MB_INTRA
  49. { 2, 3 }, // 0x04 MB_BACK
  50. { 3, 3 }, // 0x06 MB_BACK|MB_PAT
  51. { 2, 4 }, // 0x08 MB_FOR
  52. { 3, 4 }, // 0x0A MB_FOR|MB_PAT
  53. { 2, 2 }, // 0x0C MB_FOR|MB_BACK
  54. { 3, 2 }, // 0x0E MB_FOR|MB_BACK|MB_PAT
  55. { 1, 6 }, // 0x11 MB_QUANT|MB_INTRA
  56. { 2, 6 }, // 0x16 MB_QUANT|MB_BACK|MB_PAT
  57. { 3, 6 }, // 0x1A MB_QUANT|MB_FOR|MB_PAT
  58. { 2, 5 }, // 0x1E MB_QUANT|MB_FOR|MB_BACK|MB_PAT
  59. };
  60. #define INIT_2D_VLC_RL(rl, static_size)\
  61. {\
  62. static RL_VLC_ELEM rl_vlc_table[static_size];\
  63. INIT_VLC_STATIC(&rl.vlc, TEX_VLC_BITS, rl.n + 2,\
  64. &rl.table_vlc[0][1], 4, 2,\
  65. &rl.table_vlc[0][0], 4, 2, static_size);\
  66. \
  67. rl.rl_vlc[0] = rl_vlc_table;\
  68. init_2d_vlc_rl(&rl);\
  69. }
  70. static av_cold void init_2d_vlc_rl(RLTable *rl)
  71. {
  72. int i;
  73. for (i = 0; i < rl->vlc.table_size; i++) {
  74. int code = rl->vlc.table[i][0];
  75. int len = rl->vlc.table[i][1];
  76. int level, run;
  77. if (len == 0) { // illegal code
  78. run = 65;
  79. level = MAX_LEVEL;
  80. } else if (len<0) { //more bits needed
  81. run = 0;
  82. level = code;
  83. } else {
  84. if (code == rl->n) { //esc
  85. run = 65;
  86. level = 0;
  87. } else if (code == rl->n+1) { //eob
  88. run = 0;
  89. level = 127;
  90. } else {
  91. run = rl->table_run [code] + 1;
  92. level = rl->table_level[code];
  93. }
  94. }
  95. rl->rl_vlc[0][i].len = len;
  96. rl->rl_vlc[0][i].level = level;
  97. rl->rl_vlc[0][i].run = run;
  98. }
  99. }
  100. av_cold void ff_mpeg12_common_init(MpegEncContext *s)
  101. {
  102. s->y_dc_scale_table =
  103. s->c_dc_scale_table = ff_mpeg2_dc_scale_table[s->intra_dc_precision];
  104. }
  105. void ff_mpeg1_clean_buffers(MpegEncContext *s)
  106. {
  107. s->last_dc[0] = 1 << (7 + s->intra_dc_precision);
  108. s->last_dc[1] = s->last_dc[0];
  109. s->last_dc[2] = s->last_dc[0];
  110. memset(s->last_mv, 0, sizeof(s->last_mv));
  111. }
  112. /******************************************/
  113. /* decoding */
  114. VLC ff_mv_vlc;
  115. VLC ff_dc_lum_vlc;
  116. VLC ff_dc_chroma_vlc;
  117. VLC ff_mbincr_vlc;
  118. VLC ff_mb_ptype_vlc;
  119. VLC ff_mb_btype_vlc;
  120. VLC ff_mb_pat_vlc;
  121. av_cold void ff_mpeg12_init_vlcs(void)
  122. {
  123. static int done = 0;
  124. if (!done) {
  125. done = 1;
  126. INIT_VLC_STATIC(&ff_dc_lum_vlc, DC_VLC_BITS, 12,
  127. ff_mpeg12_vlc_dc_lum_bits, 1, 1,
  128. ff_mpeg12_vlc_dc_lum_code, 2, 2, 512);
  129. INIT_VLC_STATIC(&ff_dc_chroma_vlc, DC_VLC_BITS, 12,
  130. ff_mpeg12_vlc_dc_chroma_bits, 1, 1,
  131. ff_mpeg12_vlc_dc_chroma_code, 2, 2, 514);
  132. INIT_VLC_STATIC(&ff_mv_vlc, MV_VLC_BITS, 17,
  133. &ff_mpeg12_mbMotionVectorTable[0][1], 2, 1,
  134. &ff_mpeg12_mbMotionVectorTable[0][0], 2, 1, 518);
  135. INIT_VLC_STATIC(&ff_mbincr_vlc, MBINCR_VLC_BITS, 36,
  136. &ff_mpeg12_mbAddrIncrTable[0][1], 2, 1,
  137. &ff_mpeg12_mbAddrIncrTable[0][0], 2, 1, 538);
  138. INIT_VLC_STATIC(&ff_mb_pat_vlc, MB_PAT_VLC_BITS, 64,
  139. &ff_mpeg12_mbPatTable[0][1], 2, 1,
  140. &ff_mpeg12_mbPatTable[0][0], 2, 1, 512);
  141. INIT_VLC_STATIC(&ff_mb_ptype_vlc, MB_PTYPE_VLC_BITS, 7,
  142. &table_mb_ptype[0][1], 2, 1,
  143. &table_mb_ptype[0][0], 2, 1, 64);
  144. INIT_VLC_STATIC(&ff_mb_btype_vlc, MB_BTYPE_VLC_BITS, 11,
  145. &table_mb_btype[0][1], 2, 1,
  146. &table_mb_btype[0][0], 2, 1, 64);
  147. ff_init_rl(&ff_rl_mpeg1, ff_mpeg12_static_rl_table_store[0]);
  148. ff_init_rl(&ff_rl_mpeg2, ff_mpeg12_static_rl_table_store[1]);
  149. INIT_2D_VLC_RL(ff_rl_mpeg1, 680);
  150. INIT_2D_VLC_RL(ff_rl_mpeg2, 674);
  151. }
  152. }
  153. /**
  154. * Find the end of the current frame in the bitstream.
  155. * @return the position of the first byte of the next frame, or -1
  156. */
  157. int ff_mpeg1_find_frame_end(ParseContext *pc, const uint8_t *buf, int buf_size, AVCodecParserContext *s)
  158. {
  159. int i;
  160. uint32_t state = pc->state;
  161. /* EOF considered as end of frame */
  162. if (buf_size == 0)
  163. return 0;
  164. /*
  165. 0 frame start -> 1/4
  166. 1 first_SEQEXT -> 0/2
  167. 2 first field start -> 3/0
  168. 3 second_SEQEXT -> 2/0
  169. 4 searching end
  170. */
  171. for (i = 0; i < buf_size; i++) {
  172. assert(pc->frame_start_found >= 0 && pc->frame_start_found <= 4);
  173. if (pc->frame_start_found & 1) {
  174. if (state == EXT_START_CODE && (buf[i] & 0xF0) != 0x80)
  175. pc->frame_start_found--;
  176. else if (state == EXT_START_CODE + 2) {
  177. if ((buf[i] & 3) == 3)
  178. pc->frame_start_found = 0;
  179. else
  180. pc->frame_start_found = (pc->frame_start_found + 1) & 3;
  181. }
  182. state++;
  183. } else {
  184. i = avpriv_find_start_code(buf + i, buf + buf_size, &state) - buf - 1;
  185. if (pc->frame_start_found == 0 && state >= SLICE_MIN_START_CODE && state <= SLICE_MAX_START_CODE) {
  186. i++;
  187. pc->frame_start_found = 4;
  188. }
  189. if (state == SEQ_END_CODE) {
  190. pc->frame_start_found = 0;
  191. pc->state=-1;
  192. return i+1;
  193. }
  194. if (pc->frame_start_found == 2 && state == SEQ_START_CODE)
  195. pc->frame_start_found = 0;
  196. if (pc->frame_start_found < 4 && state == EXT_START_CODE)
  197. pc->frame_start_found++;
  198. if (pc->frame_start_found == 4 && (state & 0xFFFFFF00) == 0x100) {
  199. if (state < SLICE_MIN_START_CODE || state > SLICE_MAX_START_CODE) {
  200. pc->frame_start_found = 0;
  201. pc->state = -1;
  202. return i - 3;
  203. }
  204. }
  205. if (pc->frame_start_found == 0 && s && state == PICTURE_START_CODE) {
  206. ff_fetch_timestamp(s, i - 3, 1);
  207. }
  208. }
  209. }
  210. pc->state = state;
  211. return END_NOT_FOUND;
  212. }