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.

843 lines
26KB

  1. /*
  2. * WMA compatible decoder
  3. * Copyright (c) 2002 The FFmpeg Project
  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 Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. /**
  22. * @file libavcodec/wmadec.c
  23. * WMA compatible decoder.
  24. * This decoder handles Microsoft Windows Media Audio data, versions 1 & 2.
  25. * WMA v1 is identified by audio format 0x160 in Microsoft media files
  26. * (ASF/AVI/WAV). WMA v2 is identified by audio format 0x161.
  27. *
  28. * To use this decoder, a calling application must supply the extra data
  29. * bytes provided with the WMA data. These are the extra, codec-specific
  30. * bytes at the end of a WAVEFORMATEX data structure. Transmit these bytes
  31. * to the decoder using the extradata[_size] fields in AVCodecContext. There
  32. * should be 4 extra bytes for v1 data and 6 extra bytes for v2 data.
  33. */
  34. #include "avcodec.h"
  35. #include "wma.h"
  36. #undef NDEBUG
  37. #include <assert.h>
  38. #define EXPVLCBITS 8
  39. #define EXPMAX ((19+EXPVLCBITS-1)/EXPVLCBITS)
  40. #define HGAINVLCBITS 9
  41. #define HGAINMAX ((13+HGAINVLCBITS-1)/HGAINVLCBITS)
  42. static void wma_lsp_to_curve_init(WMACodecContext *s, int frame_len);
  43. #ifdef TRACE
  44. static void dump_shorts(WMACodecContext *s, const char *name, const short *tab, int n)
  45. {
  46. int i;
  47. tprintf(s->avctx, "%s[%d]:\n", name, n);
  48. for(i=0;i<n;i++) {
  49. if ((i & 7) == 0)
  50. tprintf(s->avctx, "%4d: ", i);
  51. tprintf(s->avctx, " %5d.0", tab[i]);
  52. if ((i & 7) == 7)
  53. tprintf(s->avctx, "\n");
  54. }
  55. }
  56. static void dump_floats(WMACodecContext *s, const char *name, int prec, const float *tab, int n)
  57. {
  58. int i;
  59. tprintf(s->avctx, "%s[%d]:\n", name, n);
  60. for(i=0;i<n;i++) {
  61. if ((i & 7) == 0)
  62. tprintf(s->avctx, "%4d: ", i);
  63. tprintf(s->avctx, " %8.*f", prec, tab[i]);
  64. if ((i & 7) == 7)
  65. tprintf(s->avctx, "\n");
  66. }
  67. if ((i & 7) != 0)
  68. tprintf(s->avctx, "\n");
  69. }
  70. #endif
  71. static int wma_decode_init(AVCodecContext * avctx)
  72. {
  73. WMACodecContext *s = avctx->priv_data;
  74. int i, flags1, flags2;
  75. uint8_t *extradata;
  76. s->avctx = avctx;
  77. /* extract flag infos */
  78. flags1 = 0;
  79. flags2 = 0;
  80. extradata = avctx->extradata;
  81. if (avctx->codec->id == CODEC_ID_WMAV1 && avctx->extradata_size >= 4) {
  82. flags1 = AV_RL16(extradata);
  83. flags2 = AV_RL16(extradata+2);
  84. } else if (avctx->codec->id == CODEC_ID_WMAV2 && avctx->extradata_size >= 6) {
  85. flags1 = AV_RL32(extradata);
  86. flags2 = AV_RL16(extradata+4);
  87. }
  88. // for(i=0; i<avctx->extradata_size; i++)
  89. // av_log(NULL, AV_LOG_ERROR, "%02X ", extradata[i]);
  90. s->use_exp_vlc = flags2 & 0x0001;
  91. s->use_bit_reservoir = flags2 & 0x0002;
  92. s->use_variable_block_len = flags2 & 0x0004;
  93. if(ff_wma_init(avctx, flags2)<0)
  94. return -1;
  95. /* init MDCT */
  96. for(i = 0; i < s->nb_block_sizes; i++)
  97. ff_mdct_init(&s->mdct_ctx[i], s->frame_len_bits - i + 1, 1, 1.0);
  98. if (s->use_noise_coding) {
  99. init_vlc(&s->hgain_vlc, HGAINVLCBITS, sizeof(ff_wma_hgain_huffbits),
  100. ff_wma_hgain_huffbits, 1, 1,
  101. ff_wma_hgain_huffcodes, 2, 2, 0);
  102. }
  103. if (s->use_exp_vlc) {
  104. init_vlc(&s->exp_vlc, EXPVLCBITS, sizeof(ff_wma_scale_huffbits), //FIXME move out of context
  105. ff_wma_scale_huffbits, 1, 1,
  106. ff_wma_scale_huffcodes, 4, 4, 0);
  107. } else {
  108. wma_lsp_to_curve_init(s, s->frame_len);
  109. }
  110. avctx->sample_fmt = SAMPLE_FMT_S16;
  111. return 0;
  112. }
  113. /**
  114. * compute x^-0.25 with an exponent and mantissa table. We use linear
  115. * interpolation to reduce the mantissa table size at a small speed
  116. * expense (linear interpolation approximately doubles the number of
  117. * bits of precision).
  118. */
  119. static inline float pow_m1_4(WMACodecContext *s, float x)
  120. {
  121. union {
  122. float f;
  123. unsigned int v;
  124. } u, t;
  125. unsigned int e, m;
  126. float a, b;
  127. u.f = x;
  128. e = u.v >> 23;
  129. m = (u.v >> (23 - LSP_POW_BITS)) & ((1 << LSP_POW_BITS) - 1);
  130. /* build interpolation scale: 1 <= t < 2. */
  131. t.v = ((u.v << LSP_POW_BITS) & ((1 << 23) - 1)) | (127 << 23);
  132. a = s->lsp_pow_m_table1[m];
  133. b = s->lsp_pow_m_table2[m];
  134. return s->lsp_pow_e_table[e] * (a + b * t.f);
  135. }
  136. static void wma_lsp_to_curve_init(WMACodecContext *s, int frame_len)
  137. {
  138. float wdel, a, b;
  139. int i, e, m;
  140. wdel = M_PI / frame_len;
  141. for(i=0;i<frame_len;i++)
  142. s->lsp_cos_table[i] = 2.0f * cos(wdel * i);
  143. /* tables for x^-0.25 computation */
  144. for(i=0;i<256;i++) {
  145. e = i - 126;
  146. s->lsp_pow_e_table[i] = pow(2.0, e * -0.25);
  147. }
  148. /* NOTE: these two tables are needed to avoid two operations in
  149. pow_m1_4 */
  150. b = 1.0;
  151. for(i=(1 << LSP_POW_BITS) - 1;i>=0;i--) {
  152. m = (1 << LSP_POW_BITS) + i;
  153. a = (float)m * (0.5 / (1 << LSP_POW_BITS));
  154. a = pow(a, -0.25);
  155. s->lsp_pow_m_table1[i] = 2 * a - b;
  156. s->lsp_pow_m_table2[i] = b - a;
  157. b = a;
  158. }
  159. #if 0
  160. for(i=1;i<20;i++) {
  161. float v, r1, r2;
  162. v = 5.0 / i;
  163. r1 = pow_m1_4(s, v);
  164. r2 = pow(v,-0.25);
  165. printf("%f^-0.25=%f e=%f\n", v, r1, r2 - r1);
  166. }
  167. #endif
  168. }
  169. /**
  170. * NOTE: We use the same code as Vorbis here
  171. * @todo optimize it further with SSE/3Dnow
  172. */
  173. static void wma_lsp_to_curve(WMACodecContext *s,
  174. float *out, float *val_max_ptr,
  175. int n, float *lsp)
  176. {
  177. int i, j;
  178. float p, q, w, v, val_max;
  179. val_max = 0;
  180. for(i=0;i<n;i++) {
  181. p = 0.5f;
  182. q = 0.5f;
  183. w = s->lsp_cos_table[i];
  184. for(j=1;j<NB_LSP_COEFS;j+=2){
  185. q *= w - lsp[j - 1];
  186. p *= w - lsp[j];
  187. }
  188. p *= p * (2.0f - w);
  189. q *= q * (2.0f + w);
  190. v = p + q;
  191. v = pow_m1_4(s, v);
  192. if (v > val_max)
  193. val_max = v;
  194. out[i] = v;
  195. }
  196. *val_max_ptr = val_max;
  197. }
  198. /**
  199. * decode exponents coded with LSP coefficients (same idea as Vorbis)
  200. */
  201. static void decode_exp_lsp(WMACodecContext *s, int ch)
  202. {
  203. float lsp_coefs[NB_LSP_COEFS];
  204. int val, i;
  205. for(i = 0; i < NB_LSP_COEFS; i++) {
  206. if (i == 0 || i >= 8)
  207. val = get_bits(&s->gb, 3);
  208. else
  209. val = get_bits(&s->gb, 4);
  210. lsp_coefs[i] = ff_wma_lsp_codebook[i][val];
  211. }
  212. wma_lsp_to_curve(s, s->exponents[ch], &s->max_exponent[ch],
  213. s->block_len, lsp_coefs);
  214. }
  215. /**
  216. * decode exponents coded with VLC codes
  217. */
  218. static int decode_exp_vlc(WMACodecContext *s, int ch)
  219. {
  220. int last_exp, n, code;
  221. const uint16_t *ptr, *band_ptr;
  222. float v, *q, max_scale, *q_end;
  223. band_ptr = s->exponent_bands[s->frame_len_bits - s->block_len_bits];
  224. ptr = band_ptr;
  225. q = s->exponents[ch];
  226. q_end = q + s->block_len;
  227. max_scale = 0;
  228. if (s->version == 1) {
  229. last_exp = get_bits(&s->gb, 5) + 10;
  230. /* XXX: use a table */
  231. v = pow(10, last_exp * (1.0 / 16.0));
  232. max_scale = v;
  233. n = *ptr++;
  234. do {
  235. *q++ = v;
  236. } while (--n);
  237. }else
  238. last_exp = 36;
  239. while (q < q_end) {
  240. code = get_vlc2(&s->gb, s->exp_vlc.table, EXPVLCBITS, EXPMAX);
  241. if (code < 0)
  242. return -1;
  243. /* NOTE: this offset is the same as MPEG4 AAC ! */
  244. last_exp += code - 60;
  245. /* XXX: use a table */
  246. v = pow(10, last_exp * (1.0 / 16.0));
  247. if (v > max_scale)
  248. max_scale = v;
  249. n = *ptr++;
  250. do {
  251. *q++ = v;
  252. } while (--n);
  253. }
  254. s->max_exponent[ch] = max_scale;
  255. return 0;
  256. }
  257. /**
  258. * Apply MDCT window and add into output.
  259. *
  260. * We ensure that when the windows overlap their squared sum
  261. * is always 1 (MDCT reconstruction rule).
  262. */
  263. static void wma_window(WMACodecContext *s, float *out)
  264. {
  265. float *in = s->output;
  266. int block_len, bsize, n;
  267. /* left part */
  268. if (s->block_len_bits <= s->prev_block_len_bits) {
  269. block_len = s->block_len;
  270. bsize = s->frame_len_bits - s->block_len_bits;
  271. s->dsp.vector_fmul_add_add(out, in, s->windows[bsize],
  272. out, 0, block_len, 1);
  273. } else {
  274. block_len = 1 << s->prev_block_len_bits;
  275. n = (s->block_len - block_len) / 2;
  276. bsize = s->frame_len_bits - s->prev_block_len_bits;
  277. s->dsp.vector_fmul_add_add(out+n, in+n, s->windows[bsize],
  278. out+n, 0, block_len, 1);
  279. memcpy(out+n+block_len, in+n+block_len, n*sizeof(float));
  280. }
  281. out += s->block_len;
  282. in += s->block_len;
  283. /* right part */
  284. if (s->block_len_bits <= s->next_block_len_bits) {
  285. block_len = s->block_len;
  286. bsize = s->frame_len_bits - s->block_len_bits;
  287. s->dsp.vector_fmul_reverse(out, in, s->windows[bsize], block_len);
  288. } else {
  289. block_len = 1 << s->next_block_len_bits;
  290. n = (s->block_len - block_len) / 2;
  291. bsize = s->frame_len_bits - s->next_block_len_bits;
  292. memcpy(out, in, n*sizeof(float));
  293. s->dsp.vector_fmul_reverse(out+n, in+n, s->windows[bsize], block_len);
  294. memset(out+n+block_len, 0, n*sizeof(float));
  295. }
  296. }
  297. /**
  298. * @return 0 if OK. 1 if last block of frame. return -1 if
  299. * unrecorrable error.
  300. */
  301. static int wma_decode_block(WMACodecContext *s)
  302. {
  303. int n, v, a, ch, bsize;
  304. int coef_nb_bits, total_gain;
  305. int nb_coefs[MAX_CHANNELS];
  306. float mdct_norm;
  307. #ifdef TRACE
  308. tprintf(s->avctx, "***decode_block: %d:%d\n", s->frame_count - 1, s->block_num);
  309. #endif
  310. /* compute current block length */
  311. if (s->use_variable_block_len) {
  312. n = av_log2(s->nb_block_sizes - 1) + 1;
  313. if (s->reset_block_lengths) {
  314. s->reset_block_lengths = 0;
  315. v = get_bits(&s->gb, n);
  316. if (v >= s->nb_block_sizes)
  317. return -1;
  318. s->prev_block_len_bits = s->frame_len_bits - v;
  319. v = get_bits(&s->gb, n);
  320. if (v >= s->nb_block_sizes)
  321. return -1;
  322. s->block_len_bits = s->frame_len_bits - v;
  323. } else {
  324. /* update block lengths */
  325. s->prev_block_len_bits = s->block_len_bits;
  326. s->block_len_bits = s->next_block_len_bits;
  327. }
  328. v = get_bits(&s->gb, n);
  329. if (v >= s->nb_block_sizes)
  330. return -1;
  331. s->next_block_len_bits = s->frame_len_bits - v;
  332. } else {
  333. /* fixed block len */
  334. s->next_block_len_bits = s->frame_len_bits;
  335. s->prev_block_len_bits = s->frame_len_bits;
  336. s->block_len_bits = s->frame_len_bits;
  337. }
  338. /* now check if the block length is coherent with the frame length */
  339. s->block_len = 1 << s->block_len_bits;
  340. if ((s->block_pos + s->block_len) > s->frame_len)
  341. return -1;
  342. if (s->nb_channels == 2) {
  343. s->ms_stereo = get_bits1(&s->gb);
  344. }
  345. v = 0;
  346. for(ch = 0; ch < s->nb_channels; ch++) {
  347. a = get_bits1(&s->gb);
  348. s->channel_coded[ch] = a;
  349. v |= a;
  350. }
  351. bsize = s->frame_len_bits - s->block_len_bits;
  352. /* if no channel coded, no need to go further */
  353. /* XXX: fix potential framing problems */
  354. if (!v)
  355. goto next;
  356. /* read total gain and extract corresponding number of bits for
  357. coef escape coding */
  358. total_gain = 1;
  359. for(;;) {
  360. a = get_bits(&s->gb, 7);
  361. total_gain += a;
  362. if (a != 127)
  363. break;
  364. }
  365. coef_nb_bits= ff_wma_total_gain_to_bits(total_gain);
  366. /* compute number of coefficients */
  367. n = s->coefs_end[bsize] - s->coefs_start;
  368. for(ch = 0; ch < s->nb_channels; ch++)
  369. nb_coefs[ch] = n;
  370. /* complex coding */
  371. if (s->use_noise_coding) {
  372. for(ch = 0; ch < s->nb_channels; ch++) {
  373. if (s->channel_coded[ch]) {
  374. int i, n, a;
  375. n = s->exponent_high_sizes[bsize];
  376. for(i=0;i<n;i++) {
  377. a = get_bits1(&s->gb);
  378. s->high_band_coded[ch][i] = a;
  379. /* if noise coding, the coefficients are not transmitted */
  380. if (a)
  381. nb_coefs[ch] -= s->exponent_high_bands[bsize][i];
  382. }
  383. }
  384. }
  385. for(ch = 0; ch < s->nb_channels; ch++) {
  386. if (s->channel_coded[ch]) {
  387. int i, n, val, code;
  388. n = s->exponent_high_sizes[bsize];
  389. val = (int)0x80000000;
  390. for(i=0;i<n;i++) {
  391. if (s->high_band_coded[ch][i]) {
  392. if (val == (int)0x80000000) {
  393. val = get_bits(&s->gb, 7) - 19;
  394. } else {
  395. code = get_vlc2(&s->gb, s->hgain_vlc.table, HGAINVLCBITS, HGAINMAX);
  396. if (code < 0)
  397. return -1;
  398. val += code - 18;
  399. }
  400. s->high_band_values[ch][i] = val;
  401. }
  402. }
  403. }
  404. }
  405. }
  406. /* exponents can be reused in short blocks. */
  407. if ((s->block_len_bits == s->frame_len_bits) ||
  408. get_bits1(&s->gb)) {
  409. for(ch = 0; ch < s->nb_channels; ch++) {
  410. if (s->channel_coded[ch]) {
  411. if (s->use_exp_vlc) {
  412. if (decode_exp_vlc(s, ch) < 0)
  413. return -1;
  414. } else {
  415. decode_exp_lsp(s, ch);
  416. }
  417. s->exponents_bsize[ch] = bsize;
  418. }
  419. }
  420. }
  421. /* parse spectral coefficients : just RLE encoding */
  422. for(ch = 0; ch < s->nb_channels; ch++) {
  423. if (s->channel_coded[ch]) {
  424. int tindex;
  425. WMACoef* ptr = &s->coefs1[ch][0];
  426. /* special VLC tables are used for ms stereo because
  427. there is potentially less energy there */
  428. tindex = (ch == 1 && s->ms_stereo);
  429. memset(ptr, 0, s->block_len * sizeof(WMACoef));
  430. ff_wma_run_level_decode(s->avctx, &s->gb, &s->coef_vlc[tindex],
  431. s->level_table[tindex], s->run_table[tindex],
  432. 0, ptr, 0, nb_coefs[ch],
  433. s->block_len, s->frame_len_bits, coef_nb_bits);
  434. }
  435. if (s->version == 1 && s->nb_channels >= 2) {
  436. align_get_bits(&s->gb);
  437. }
  438. }
  439. /* normalize */
  440. {
  441. int n4 = s->block_len / 2;
  442. mdct_norm = 1.0 / (float)n4;
  443. if (s->version == 1) {
  444. mdct_norm *= sqrt(n4);
  445. }
  446. }
  447. /* finally compute the MDCT coefficients */
  448. for(ch = 0; ch < s->nb_channels; ch++) {
  449. if (s->channel_coded[ch]) {
  450. WMACoef *coefs1;
  451. float *coefs, *exponents, mult, mult1, noise;
  452. int i, j, n, n1, last_high_band, esize;
  453. float exp_power[HIGH_BAND_MAX_SIZE];
  454. coefs1 = s->coefs1[ch];
  455. exponents = s->exponents[ch];
  456. esize = s->exponents_bsize[ch];
  457. mult = pow(10, total_gain * 0.05) / s->max_exponent[ch];
  458. mult *= mdct_norm;
  459. coefs = s->coefs[ch];
  460. if (s->use_noise_coding) {
  461. mult1 = mult;
  462. /* very low freqs : noise */
  463. for(i = 0;i < s->coefs_start; i++) {
  464. *coefs++ = s->noise_table[s->noise_index] *
  465. exponents[i<<bsize>>esize] * mult1;
  466. s->noise_index = (s->noise_index + 1) & (NOISE_TAB_SIZE - 1);
  467. }
  468. n1 = s->exponent_high_sizes[bsize];
  469. /* compute power of high bands */
  470. exponents = s->exponents[ch] +
  471. (s->high_band_start[bsize]<<bsize);
  472. last_high_band = 0; /* avoid warning */
  473. for(j=0;j<n1;j++) {
  474. n = s->exponent_high_bands[s->frame_len_bits -
  475. s->block_len_bits][j];
  476. if (s->high_band_coded[ch][j]) {
  477. float e2, v;
  478. e2 = 0;
  479. for(i = 0;i < n; i++) {
  480. v = exponents[i<<bsize>>esize];
  481. e2 += v * v;
  482. }
  483. exp_power[j] = e2 / n;
  484. last_high_band = j;
  485. tprintf(s->avctx, "%d: power=%f (%d)\n", j, exp_power[j], n);
  486. }
  487. exponents += n<<bsize;
  488. }
  489. /* main freqs and high freqs */
  490. exponents = s->exponents[ch] + (s->coefs_start<<bsize);
  491. for(j=-1;j<n1;j++) {
  492. if (j < 0) {
  493. n = s->high_band_start[bsize] -
  494. s->coefs_start;
  495. } else {
  496. n = s->exponent_high_bands[s->frame_len_bits -
  497. s->block_len_bits][j];
  498. }
  499. if (j >= 0 && s->high_band_coded[ch][j]) {
  500. /* use noise with specified power */
  501. mult1 = sqrt(exp_power[j] / exp_power[last_high_band]);
  502. /* XXX: use a table */
  503. mult1 = mult1 * pow(10, s->high_band_values[ch][j] * 0.05);
  504. mult1 = mult1 / (s->max_exponent[ch] * s->noise_mult);
  505. mult1 *= mdct_norm;
  506. for(i = 0;i < n; i++) {
  507. noise = s->noise_table[s->noise_index];
  508. s->noise_index = (s->noise_index + 1) & (NOISE_TAB_SIZE - 1);
  509. *coefs++ = noise *
  510. exponents[i<<bsize>>esize] * mult1;
  511. }
  512. exponents += n<<bsize;
  513. } else {
  514. /* coded values + small noise */
  515. for(i = 0;i < n; i++) {
  516. noise = s->noise_table[s->noise_index];
  517. s->noise_index = (s->noise_index + 1) & (NOISE_TAB_SIZE - 1);
  518. *coefs++ = ((*coefs1++) + noise) *
  519. exponents[i<<bsize>>esize] * mult;
  520. }
  521. exponents += n<<bsize;
  522. }
  523. }
  524. /* very high freqs : noise */
  525. n = s->block_len - s->coefs_end[bsize];
  526. mult1 = mult * exponents[((-1<<bsize))>>esize];
  527. for(i = 0; i < n; i++) {
  528. *coefs++ = s->noise_table[s->noise_index] * mult1;
  529. s->noise_index = (s->noise_index + 1) & (NOISE_TAB_SIZE - 1);
  530. }
  531. } else {
  532. /* XXX: optimize more */
  533. for(i = 0;i < s->coefs_start; i++)
  534. *coefs++ = 0.0;
  535. n = nb_coefs[ch];
  536. for(i = 0;i < n; i++) {
  537. *coefs++ = coefs1[i] * exponents[i<<bsize>>esize] * mult;
  538. }
  539. n = s->block_len - s->coefs_end[bsize];
  540. for(i = 0;i < n; i++)
  541. *coefs++ = 0.0;
  542. }
  543. }
  544. }
  545. #ifdef TRACE
  546. for(ch = 0; ch < s->nb_channels; ch++) {
  547. if (s->channel_coded[ch]) {
  548. dump_floats(s, "exponents", 3, s->exponents[ch], s->block_len);
  549. dump_floats(s, "coefs", 1, s->coefs[ch], s->block_len);
  550. }
  551. }
  552. #endif
  553. if (s->ms_stereo && s->channel_coded[1]) {
  554. /* nominal case for ms stereo: we do it before mdct */
  555. /* no need to optimize this case because it should almost
  556. never happen */
  557. if (!s->channel_coded[0]) {
  558. tprintf(s->avctx, "rare ms-stereo case happened\n");
  559. memset(s->coefs[0], 0, sizeof(float) * s->block_len);
  560. s->channel_coded[0] = 1;
  561. }
  562. s->dsp.butterflies_float(s->coefs[0], s->coefs[1], s->block_len);
  563. }
  564. next:
  565. for(ch = 0; ch < s->nb_channels; ch++) {
  566. int n4, index;
  567. n4 = s->block_len / 2;
  568. if(s->channel_coded[ch]){
  569. ff_imdct_calc(&s->mdct_ctx[bsize], s->output, s->coefs[ch]);
  570. }else if(!(s->ms_stereo && ch==1))
  571. memset(s->output, 0, sizeof(s->output));
  572. /* multiply by the window and add in the frame */
  573. index = (s->frame_len / 2) + s->block_pos - n4;
  574. wma_window(s, &s->frame_out[ch][index]);
  575. }
  576. /* update block number */
  577. s->block_num++;
  578. s->block_pos += s->block_len;
  579. if (s->block_pos >= s->frame_len)
  580. return 1;
  581. else
  582. return 0;
  583. }
  584. /* decode a frame of frame_len samples */
  585. static int wma_decode_frame(WMACodecContext *s, int16_t *samples)
  586. {
  587. int ret, i, n, ch, incr;
  588. int16_t *ptr;
  589. float *iptr;
  590. #ifdef TRACE
  591. tprintf(s->avctx, "***decode_frame: %d size=%d\n", s->frame_count++, s->frame_len);
  592. #endif
  593. /* read each block */
  594. s->block_num = 0;
  595. s->block_pos = 0;
  596. for(;;) {
  597. ret = wma_decode_block(s);
  598. if (ret < 0)
  599. return -1;
  600. if (ret)
  601. break;
  602. }
  603. /* convert frame to integer */
  604. n = s->frame_len;
  605. incr = s->nb_channels;
  606. for(ch = 0; ch < s->nb_channels; ch++) {
  607. ptr = samples + ch;
  608. iptr = s->frame_out[ch];
  609. for(i=0;i<n;i++) {
  610. *ptr = av_clip_int16(lrintf(*iptr++));
  611. ptr += incr;
  612. }
  613. /* prepare for next block */
  614. memmove(&s->frame_out[ch][0], &s->frame_out[ch][s->frame_len],
  615. s->frame_len * sizeof(float));
  616. }
  617. #ifdef TRACE
  618. dump_shorts(s, "samples", samples, n * s->nb_channels);
  619. #endif
  620. return 0;
  621. }
  622. static int wma_decode_superframe(AVCodecContext *avctx,
  623. void *data, int *data_size,
  624. AVPacket *avpkt)
  625. {
  626. const uint8_t *buf = avpkt->data;
  627. int buf_size = avpkt->size;
  628. WMACodecContext *s = avctx->priv_data;
  629. int nb_frames, bit_offset, i, pos, len;
  630. uint8_t *q;
  631. int16_t *samples;
  632. tprintf(avctx, "***decode_superframe:\n");
  633. if(buf_size==0){
  634. s->last_superframe_len = 0;
  635. return 0;
  636. }
  637. if (buf_size < s->block_align)
  638. return 0;
  639. buf_size = s->block_align;
  640. samples = data;
  641. init_get_bits(&s->gb, buf, buf_size*8);
  642. if (s->use_bit_reservoir) {
  643. /* read super frame header */
  644. skip_bits(&s->gb, 4); /* super frame index */
  645. nb_frames = get_bits(&s->gb, 4) - 1;
  646. if((nb_frames+1) * s->nb_channels * s->frame_len * sizeof(int16_t) > *data_size){
  647. av_log(s->avctx, AV_LOG_ERROR, "Insufficient output space\n");
  648. goto fail;
  649. }
  650. bit_offset = get_bits(&s->gb, s->byte_offset_bits + 3);
  651. if (s->last_superframe_len > 0) {
  652. // printf("skip=%d\n", s->last_bitoffset);
  653. /* add bit_offset bits to last frame */
  654. if ((s->last_superframe_len + ((bit_offset + 7) >> 3)) >
  655. MAX_CODED_SUPERFRAME_SIZE)
  656. goto fail;
  657. q = s->last_superframe + s->last_superframe_len;
  658. len = bit_offset;
  659. while (len > 7) {
  660. *q++ = (get_bits)(&s->gb, 8);
  661. len -= 8;
  662. }
  663. if (len > 0) {
  664. *q++ = (get_bits)(&s->gb, len) << (8 - len);
  665. }
  666. /* XXX: bit_offset bits into last frame */
  667. init_get_bits(&s->gb, s->last_superframe, MAX_CODED_SUPERFRAME_SIZE*8);
  668. /* skip unused bits */
  669. if (s->last_bitoffset > 0)
  670. skip_bits(&s->gb, s->last_bitoffset);
  671. /* this frame is stored in the last superframe and in the
  672. current one */
  673. if (wma_decode_frame(s, samples) < 0)
  674. goto fail;
  675. samples += s->nb_channels * s->frame_len;
  676. }
  677. /* read each frame starting from bit_offset */
  678. pos = bit_offset + 4 + 4 + s->byte_offset_bits + 3;
  679. init_get_bits(&s->gb, buf + (pos >> 3), (MAX_CODED_SUPERFRAME_SIZE - (pos >> 3))*8);
  680. len = pos & 7;
  681. if (len > 0)
  682. skip_bits(&s->gb, len);
  683. s->reset_block_lengths = 1;
  684. for(i=0;i<nb_frames;i++) {
  685. if (wma_decode_frame(s, samples) < 0)
  686. goto fail;
  687. samples += s->nb_channels * s->frame_len;
  688. }
  689. /* we copy the end of the frame in the last frame buffer */
  690. pos = get_bits_count(&s->gb) + ((bit_offset + 4 + 4 + s->byte_offset_bits + 3) & ~7);
  691. s->last_bitoffset = pos & 7;
  692. pos >>= 3;
  693. len = buf_size - pos;
  694. if (len > MAX_CODED_SUPERFRAME_SIZE || len < 0) {
  695. goto fail;
  696. }
  697. s->last_superframe_len = len;
  698. memcpy(s->last_superframe, buf + pos, len);
  699. } else {
  700. if(s->nb_channels * s->frame_len * sizeof(int16_t) > *data_size){
  701. av_log(s->avctx, AV_LOG_ERROR, "Insufficient output space\n");
  702. goto fail;
  703. }
  704. /* single frame decode */
  705. if (wma_decode_frame(s, samples) < 0)
  706. goto fail;
  707. samples += s->nb_channels * s->frame_len;
  708. }
  709. //av_log(NULL, AV_LOG_ERROR, "%d %d %d %d outbytes:%d eaten:%d\n", s->frame_len_bits, s->block_len_bits, s->frame_len, s->block_len, (int8_t *)samples - (int8_t *)data, s->block_align);
  710. *data_size = (int8_t *)samples - (int8_t *)data;
  711. return s->block_align;
  712. fail:
  713. /* when error, we reset the bit reservoir */
  714. s->last_superframe_len = 0;
  715. return -1;
  716. }
  717. AVCodec wmav1_decoder =
  718. {
  719. "wmav1",
  720. CODEC_TYPE_AUDIO,
  721. CODEC_ID_WMAV1,
  722. sizeof(WMACodecContext),
  723. wma_decode_init,
  724. NULL,
  725. ff_wma_end,
  726. wma_decode_superframe,
  727. .long_name = NULL_IF_CONFIG_SMALL("Windows Media Audio 1"),
  728. };
  729. AVCodec wmav2_decoder =
  730. {
  731. "wmav2",
  732. CODEC_TYPE_AUDIO,
  733. CODEC_ID_WMAV2,
  734. sizeof(WMACodecContext),
  735. wma_decode_init,
  736. NULL,
  737. ff_wma_end,
  738. wma_decode_superframe,
  739. .long_name = NULL_IF_CONFIG_SMALL("Windows Media Audio 2"),
  740. };