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.

238 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 "mpegvideo.h"
  30. #include "error_resilience.h"
  31. #include "mpeg12.h"
  32. #include "mpeg12data.h"
  33. #include "bytestream.h"
  34. #include "thread.h"
  35. uint8_t ff_mpeg12_static_rl_table_store[2][2][2*MAX_RUN + MAX_LEVEL + 3];
  36. static const uint8_t table_mb_ptype[7][2] = {
  37. { 3, 5 }, // 0x01 MB_INTRA
  38. { 1, 2 }, // 0x02 MB_PAT
  39. { 1, 3 }, // 0x08 MB_FOR
  40. { 1, 1 }, // 0x0A MB_FOR|MB_PAT
  41. { 1, 6 }, // 0x11 MB_QUANT|MB_INTRA
  42. { 1, 5 }, // 0x12 MB_QUANT|MB_PAT
  43. { 2, 5 }, // 0x1A MB_QUANT|MB_FOR|MB_PAT
  44. };
  45. static const uint8_t table_mb_btype[11][2] = {
  46. { 3, 5 }, // 0x01 MB_INTRA
  47. { 2, 3 }, // 0x04 MB_BACK
  48. { 3, 3 }, // 0x06 MB_BACK|MB_PAT
  49. { 2, 4 }, // 0x08 MB_FOR
  50. { 3, 4 }, // 0x0A MB_FOR|MB_PAT
  51. { 2, 2 }, // 0x0C MB_FOR|MB_BACK
  52. { 3, 2 }, // 0x0E MB_FOR|MB_BACK|MB_PAT
  53. { 1, 6 }, // 0x11 MB_QUANT|MB_INTRA
  54. { 2, 6 }, // 0x16 MB_QUANT|MB_BACK|MB_PAT
  55. { 3, 6 }, // 0x1A MB_QUANT|MB_FOR|MB_PAT
  56. { 2, 5 }, // 0x1E MB_QUANT|MB_FOR|MB_BACK|MB_PAT
  57. };
  58. #define INIT_2D_VLC_RL(rl, static_size)\
  59. {\
  60. static RL_VLC_ELEM rl_vlc_table[static_size];\
  61. INIT_VLC_STATIC(&rl.vlc, TEX_VLC_BITS, rl.n + 2,\
  62. &rl.table_vlc[0][1], 4, 2,\
  63. &rl.table_vlc[0][0], 4, 2, static_size);\
  64. \
  65. rl.rl_vlc[0] = rl_vlc_table;\
  66. init_2d_vlc_rl(&rl);\
  67. }
  68. static av_cold void init_2d_vlc_rl(RLTable *rl)
  69. {
  70. int i;
  71. for (i = 0; i < rl->vlc.table_size; i++) {
  72. int code = rl->vlc.table[i][0];
  73. int len = rl->vlc.table[i][1];
  74. int level, run;
  75. if (len == 0) { // illegal code
  76. run = 65;
  77. level = MAX_LEVEL;
  78. } else if (len<0) { //more bits needed
  79. run = 0;
  80. level = code;
  81. } else {
  82. if (code == rl->n) { //esc
  83. run = 65;
  84. level = 0;
  85. } else if (code == rl->n+1) { //eob
  86. run = 0;
  87. level = 127;
  88. } else {
  89. run = rl->table_run [code] + 1;
  90. level = rl->table_level[code];
  91. }
  92. }
  93. rl->rl_vlc[0][i].len = len;
  94. rl->rl_vlc[0][i].level = level;
  95. rl->rl_vlc[0][i].run = run;
  96. }
  97. }
  98. av_cold void ff_mpeg12_common_init(MpegEncContext *s)
  99. {
  100. s->y_dc_scale_table =
  101. s->c_dc_scale_table = ff_mpeg2_dc_scale_table[s->intra_dc_precision];
  102. }
  103. void ff_mpeg1_clean_buffers(MpegEncContext *s)
  104. {
  105. s->last_dc[0] = 1 << (7 + s->intra_dc_precision);
  106. s->last_dc[1] = s->last_dc[0];
  107. s->last_dc[2] = s->last_dc[0];
  108. memset(s->last_mv, 0, sizeof(s->last_mv));
  109. }
  110. /******************************************/
  111. /* decoding */
  112. VLC ff_mv_vlc;
  113. VLC ff_dc_lum_vlc;
  114. VLC ff_dc_chroma_vlc;
  115. VLC ff_mbincr_vlc;
  116. VLC ff_mb_ptype_vlc;
  117. VLC ff_mb_btype_vlc;
  118. VLC ff_mb_pat_vlc;
  119. av_cold void ff_mpeg12_init_vlcs(void)
  120. {
  121. static int done = 0;
  122. if (!done) {
  123. done = 1;
  124. INIT_VLC_STATIC(&ff_dc_lum_vlc, DC_VLC_BITS, 12,
  125. ff_mpeg12_vlc_dc_lum_bits, 1, 1,
  126. ff_mpeg12_vlc_dc_lum_code, 2, 2, 512);
  127. INIT_VLC_STATIC(&ff_dc_chroma_vlc, DC_VLC_BITS, 12,
  128. ff_mpeg12_vlc_dc_chroma_bits, 1, 1,
  129. ff_mpeg12_vlc_dc_chroma_code, 2, 2, 514);
  130. INIT_VLC_STATIC(&ff_mv_vlc, MV_VLC_BITS, 17,
  131. &ff_mpeg12_mbMotionVectorTable[0][1], 2, 1,
  132. &ff_mpeg12_mbMotionVectorTable[0][0], 2, 1, 518);
  133. INIT_VLC_STATIC(&ff_mbincr_vlc, MBINCR_VLC_BITS, 36,
  134. &ff_mpeg12_mbAddrIncrTable[0][1], 2, 1,
  135. &ff_mpeg12_mbAddrIncrTable[0][0], 2, 1, 538);
  136. INIT_VLC_STATIC(&ff_mb_pat_vlc, MB_PAT_VLC_BITS, 64,
  137. &ff_mpeg12_mbPatTable[0][1], 2, 1,
  138. &ff_mpeg12_mbPatTable[0][0], 2, 1, 512);
  139. INIT_VLC_STATIC(&ff_mb_ptype_vlc, MB_PTYPE_VLC_BITS, 7,
  140. &table_mb_ptype[0][1], 2, 1,
  141. &table_mb_ptype[0][0], 2, 1, 64);
  142. INIT_VLC_STATIC(&ff_mb_btype_vlc, MB_BTYPE_VLC_BITS, 11,
  143. &table_mb_btype[0][1], 2, 1,
  144. &table_mb_btype[0][0], 2, 1, 64);
  145. ff_rl_init(&ff_rl_mpeg1, ff_mpeg12_static_rl_table_store[0]);
  146. ff_rl_init(&ff_rl_mpeg2, ff_mpeg12_static_rl_table_store[1]);
  147. INIT_2D_VLC_RL(ff_rl_mpeg1, 680);
  148. INIT_2D_VLC_RL(ff_rl_mpeg2, 674);
  149. }
  150. }
  151. /**
  152. * Find the end of the current frame in the bitstream.
  153. * @return the position of the first byte of the next frame, or -1
  154. */
  155. int ff_mpeg1_find_frame_end(ParseContext *pc, const uint8_t *buf, int buf_size, AVCodecParserContext *s)
  156. {
  157. int i;
  158. uint32_t state = pc->state;
  159. /* EOF considered as end of frame */
  160. if (buf_size == 0)
  161. return 0;
  162. /*
  163. 0 frame start -> 1/4
  164. 1 first_SEQEXT -> 0/2
  165. 2 first field start -> 3/0
  166. 3 second_SEQEXT -> 2/0
  167. 4 searching end
  168. */
  169. for (i = 0; i < buf_size; i++) {
  170. assert(pc->frame_start_found >= 0 && pc->frame_start_found <= 4);
  171. if (pc->frame_start_found & 1) {
  172. if (state == EXT_START_CODE && (buf[i] & 0xF0) != 0x80)
  173. pc->frame_start_found--;
  174. else if (state == EXT_START_CODE + 2) {
  175. if ((buf[i] & 3) == 3)
  176. pc->frame_start_found = 0;
  177. else
  178. pc->frame_start_found = (pc->frame_start_found + 1) & 3;
  179. }
  180. state++;
  181. } else {
  182. i = avpriv_find_start_code(buf + i, buf + buf_size, &state) - buf - 1;
  183. if (pc->frame_start_found == 0 && state >= SLICE_MIN_START_CODE && state <= SLICE_MAX_START_CODE) {
  184. i++;
  185. pc->frame_start_found = 4;
  186. }
  187. if (state == SEQ_END_CODE) {
  188. pc->frame_start_found = 0;
  189. pc->state=-1;
  190. return i+1;
  191. }
  192. if (pc->frame_start_found == 2 && state == SEQ_START_CODE)
  193. pc->frame_start_found = 0;
  194. if (pc->frame_start_found < 4 && state == EXT_START_CODE)
  195. pc->frame_start_found++;
  196. if (pc->frame_start_found == 4 && (state & 0xFFFFFF00) == 0x100) {
  197. if (state < SLICE_MIN_START_CODE || state > SLICE_MAX_START_CODE) {
  198. pc->frame_start_found = 0;
  199. pc->state = -1;
  200. return i - 3;
  201. }
  202. }
  203. if (pc->frame_start_found == 0 && s && state == PICTURE_START_CODE) {
  204. ff_fetch_timestamp(s, i - 3, 1);
  205. }
  206. }
  207. }
  208. pc->state = state;
  209. return END_NOT_FOUND;
  210. }