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.

232 lines
6.6KB

  1. /*
  2. * Musepack demuxer
  3. * Copyright (c) 2006 Konstantin Shishkov
  4. *
  5. * This file is part of FFmpeg.
  6. *
  7. * FFmpeg is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2.1 of the License, or (at your option) any later version.
  11. *
  12. * FFmpeg is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with FFmpeg; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. #include "avformat.h"
  22. #include "bitstream.h"
  23. #define MPC_FRAMESIZE 1152
  24. #define DELAY_FRAMES 32
  25. static const int mpc_rate[4] = { 44100, 48000, 37800, 32000 };
  26. typedef struct {
  27. int64_t pos;
  28. int size, skip;
  29. }MPCFrame;
  30. typedef struct {
  31. int ver;
  32. uint32_t curframe, lastframe;
  33. uint32_t fcount;
  34. MPCFrame *frames;
  35. int curbits;
  36. int frames_noted;
  37. } MPCContext;
  38. static int mpc_probe(AVProbeData *p)
  39. {
  40. const uint8_t *d = p->buf;
  41. if (p->buf_size < 32)
  42. return 0;
  43. if (d[0] == 'M' && d[1] == 'P' && d[2] == '+' && (d[3] == 0x17 || d[3] == 0x7))
  44. return AVPROBE_SCORE_MAX;
  45. if (d[0] == 'I' && d[1] == 'D' && d[2] == '3')
  46. return AVPROBE_SCORE_MAX / 2;
  47. return 0;
  48. }
  49. static int mpc_read_header(AVFormatContext *s, AVFormatParameters *ap)
  50. {
  51. MPCContext *c = s->priv_data;
  52. AVStream *st;
  53. int t;
  54. t = get_le24(&s->pb);
  55. if(t != MKTAG('M', 'P', '+', 0)){
  56. if(t != MKTAG('I', 'D', '3', 0)){
  57. av_log(s, AV_LOG_ERROR, "Not a Musepack file\n");
  58. return -1;
  59. }
  60. /* skip ID3 tags and try again */
  61. url_fskip(&s->pb, 3);
  62. t = get_byte(&s->pb) << 21;
  63. t |= get_byte(&s->pb) << 14;
  64. t |= get_byte(&s->pb) << 7;
  65. t |= get_byte(&s->pb);
  66. av_log(s, AV_LOG_DEBUG, "Skipping %d(%X) bytes of ID3 data\n", t, t);
  67. url_fskip(&s->pb, t);
  68. if(get_le24(&s->pb) != MKTAG('M', 'P', '+', 0)){
  69. av_log(s, AV_LOG_ERROR, "Not a Musepack file\n");
  70. return -1;
  71. }
  72. }
  73. c->ver = get_byte(&s->pb);
  74. if(c->ver != 0x07 && c->ver != 0x17){
  75. av_log(s, AV_LOG_ERROR, "Can demux Musepack SV7, got version %02X\n", c->ver);
  76. return -1;
  77. }
  78. c->fcount = get_le32(&s->pb);
  79. if((int64_t)c->fcount * sizeof(MPCFrame) >= UINT_MAX){
  80. av_log(s, AV_LOG_ERROR, "Too many frames, seeking is not possible\n");
  81. return -1;
  82. }
  83. c->frames = av_malloc(c->fcount * sizeof(MPCFrame));
  84. c->curframe = 0;
  85. c->lastframe = -1;
  86. c->curbits = 8;
  87. c->frames_noted = 0;
  88. st = av_new_stream(s, 0);
  89. if (!st)
  90. return AVERROR_NOMEM;
  91. st->codec->codec_type = CODEC_TYPE_AUDIO;
  92. st->codec->codec_id = CODEC_ID_MUSEPACK7;
  93. st->codec->channels = 2;
  94. st->codec->bits_per_sample = 16;
  95. st->codec->extradata_size = 16;
  96. st->codec->extradata = av_mallocz(st->codec->extradata_size+FF_INPUT_BUFFER_PADDING_SIZE);
  97. get_buffer(&s->pb, st->codec->extradata, 16);
  98. st->codec->sample_rate = mpc_rate[st->codec->extradata[2] & 3];
  99. av_set_pts_info(st, 32, MPC_FRAMESIZE, st->codec->sample_rate);
  100. /* scan for seekpoints */
  101. s->start_time = 0;
  102. s->duration = (int64_t)c->fcount * MPC_FRAMESIZE * AV_TIME_BASE / st->codec->sample_rate;
  103. return 0;
  104. }
  105. static int mpc_read_packet(AVFormatContext *s, AVPacket *pkt)
  106. {
  107. MPCContext *c = s->priv_data;
  108. int ret, size, size2, curbits, cur = c->curframe;
  109. int64_t tmp, pos;
  110. if (c->curframe >= c->fcount)
  111. return -1;
  112. if(c->curframe != c->lastframe + 1){
  113. url_fseek(&s->pb, c->frames[c->curframe].pos, SEEK_SET);
  114. c->curbits = c->frames[c->curframe].skip;
  115. }
  116. c->lastframe = c->curframe;
  117. c->curframe++;
  118. curbits = c->curbits;
  119. pos = url_ftell(&s->pb);
  120. tmp = get_le32(&s->pb);
  121. if(curbits <= 12){
  122. size2 = (tmp >> (12 - curbits)) & 0xFFFFF;
  123. }else{
  124. tmp = (tmp << 32) | get_le32(&s->pb);
  125. size2 = (tmp >> (44 - curbits)) & 0xFFFFF;
  126. }
  127. curbits += 20;
  128. url_fseek(&s->pb, pos, SEEK_SET);
  129. size = ((size2 + curbits + 31) & ~31) >> 3;
  130. if(cur == c->frames_noted){
  131. c->frames[cur].pos = pos;
  132. c->frames[cur].size = size;
  133. c->frames[cur].skip = curbits - 20;
  134. av_add_index_entry(s->streams[0], cur, cur, size, 0, AVINDEX_KEYFRAME);
  135. c->frames_noted++;
  136. }
  137. c->curbits = (curbits + size2) & 0x1F;
  138. if (av_new_packet(pkt, size) < 0)
  139. return AVERROR_IO;
  140. pkt->data[0] = curbits;
  141. pkt->data[1] = (c->curframe > c->fcount);
  142. pkt->stream_index = 0;
  143. pkt->pts = cur;
  144. ret = get_buffer(&s->pb, pkt->data + 4, size);
  145. if(c->curbits)
  146. url_fseek(&s->pb, -4, SEEK_CUR);
  147. if(ret < size){
  148. av_free_packet(pkt);
  149. return AVERROR_IO;
  150. }
  151. pkt->size = ret + 4;
  152. return 0;
  153. }
  154. static int mpc_read_close(AVFormatContext *s)
  155. {
  156. MPCContext *c = s->priv_data;
  157. av_freep(&c->frames);
  158. return 0;
  159. }
  160. /**
  161. * Seek to the given position
  162. * If position is unknown but is within the limits of file
  163. * then packets are skipped unless desired position is reached
  164. *
  165. * Also this function makes use of the fact that timestamp == frameno
  166. */
  167. static int mpc_read_seek(AVFormatContext *s, int stream_index, int64_t timestamp, int flags)
  168. {
  169. AVStream *st = s->streams[stream_index];
  170. MPCContext *c = s->priv_data;
  171. AVPacket pkt1, *pkt = &pkt1;
  172. int ret;
  173. int index = av_index_search_timestamp(st, timestamp - DELAY_FRAMES, flags);
  174. uint32_t lastframe;
  175. /* if found, seek there */
  176. if (index >= 0){
  177. c->curframe = st->index_entries[index].pos;
  178. return 0;
  179. }
  180. /* if timestamp is out of bounds, return error */
  181. if(timestamp < 0 || timestamp >= c->fcount)
  182. return -1;
  183. timestamp -= DELAY_FRAMES;
  184. /* seek to the furthest known position and read packets until
  185. we reach desired position */
  186. lastframe = c->curframe;
  187. if(c->frames_noted) c->curframe = c->frames_noted - 1;
  188. while(c->curframe < timestamp){
  189. ret = av_read_frame(s, pkt);
  190. if (ret < 0){
  191. c->curframe = lastframe;
  192. return -1;
  193. }
  194. av_free_packet(pkt);
  195. }
  196. return 0;
  197. }
  198. AVInputFormat mpc_demuxer = {
  199. "mpc",
  200. "musepack",
  201. sizeof(MPCContext),
  202. mpc_probe,
  203. mpc_read_header,
  204. mpc_read_packet,
  205. mpc_read_close,
  206. mpc_read_seek,
  207. .extensions = "mpc",
  208. };