3 * Copyright (c) 2001, 2002 Fabrice Bellard.
5 * This file is part of FFmpeg.
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.
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.
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
23 * @file mpegaudiodec.c
28 #include "bitstream.h"
33 * - in low precision mode, use more 16 bit multiplies in synth filter
34 * - test lsf / mpeg25 extensively.
37 #include "mpegaudio.h"
38 #include "mpegaudiodecheader.h"
42 /* WARNING: only correct for posititive numbers */
43 #define FIXR(a) ((int)((a) * FRAC_ONE + 0.5))
44 #define FRAC_RND(a) (((a) + (FRAC_ONE/2)) >> FRAC_BITS)
46 #define FIXHR(a) ((int)((a) * (1LL<<32) + 0.5))
52 /* layer 3 "granule" */
53 typedef struct GranuleDef {
58 int scalefac_compress;
63 uint8_t scalefac_scale;
64 uint8_t count1table_select;
65 int region_size[3]; /* number of huffman codes in each region */
67 int short_start, long_end; /* long/short band indexes */
68 uint8_t scale_factors[40];
69 int32_t sb_hybrid[SBLIMIT * 18]; /* 576 samples */
72 #include "mpegaudiodata.h"
73 #include "mpegaudiodectab.h"
75 static void compute_antialias_integer(MPADecodeContext *s, GranuleDef *g);
76 static void compute_antialias_float(MPADecodeContext *s, GranuleDef *g);
78 /* vlc structure for decoding layer 3 huffman tables */
79 static VLC huff_vlc[16];
80 static VLC_TYPE huff_vlc_tables[
81 0+128+128+128+130+128+154+166+
82 142+204+190+170+542+460+662+414
84 static const int huff_vlc_tables_sizes[16] = {
85 0, 128, 128, 128, 130, 128, 154, 166,
86 142, 204, 190, 170, 542, 460, 662, 414
88 static VLC huff_quad_vlc[2];
89 static VLC_TYPE huff_quad_vlc_tables[128+16][2];
90 static const int huff_quad_vlc_tables_sizes[2] = {
93 /* computed from band_size_long */
94 static uint16_t band_index_long[9][23];
95 /* XXX: free when all decoders are closed */
96 #define TABLE_4_3_SIZE (8191 + 16)*4
97 static int8_t table_4_3_exp[TABLE_4_3_SIZE];
98 static uint32_t table_4_3_value[TABLE_4_3_SIZE];
99 static uint32_t exp_table[512];
100 static uint32_t expval_table[512][16];
101 /* intensity stereo coef table */
102 static int32_t is_table[2][16];
103 static int32_t is_table_lsf[2][2][16];
104 static int32_t csa_table[8][4];
105 static float csa_table_float[8][4];
106 static int32_t mdct_win[8][36];
108 /* lower 2 bits: modulo 3, higher bits: shift */
109 static uint16_t scale_factor_modshift[64];
110 /* [i][j]: 2^(-j/3) * FRAC_ONE * 2^(i+2) / (2^(i+2) - 1) */
111 static int32_t scale_factor_mult[15][3];
112 /* mult table for layer 2 group quantization */
114 #define SCALE_GEN(v) \
115 { FIXR(1.0 * (v)), FIXR(0.7937005259 * (v)), FIXR(0.6299605249 * (v)) }
117 static const int32_t scale_factor_mult2[3][3] = {
118 SCALE_GEN(4.0 / 3.0), /* 3 steps */
119 SCALE_GEN(4.0 / 5.0), /* 5 steps */
120 SCALE_GEN(4.0 / 9.0), /* 9 steps */
123 static DECLARE_ALIGNED_16(MPA_INT, window[512]);
126 * Convert region offsets to region sizes and truncate
127 * size to big_values.
129 void ff_region_offset2size(GranuleDef *g){
131 g->region_size[2] = (576 / 2);
133 k = FFMIN(g->region_size[i], g->big_values);
134 g->region_size[i] = k - j;
139 void ff_init_short_region(MPADecodeContext *s, GranuleDef *g){
140 if (g->block_type == 2)
141 g->region_size[0] = (36 / 2);
143 if (s->sample_rate_index <= 2)
144 g->region_size[0] = (36 / 2);
145 else if (s->sample_rate_index != 8)
146 g->region_size[0] = (54 / 2);
148 g->region_size[0] = (108 / 2);
150 g->region_size[1] = (576 / 2);
153 void ff_init_long_region(MPADecodeContext *s, GranuleDef *g, int ra1, int ra2){
156 band_index_long[s->sample_rate_index][ra1 + 1] >> 1;
157 /* should not overflow */
158 l = FFMIN(ra1 + ra2 + 2, 22);
160 band_index_long[s->sample_rate_index][l] >> 1;
163 void ff_compute_band_indexes(MPADecodeContext *s, GranuleDef *g){
164 if (g->block_type == 2) {
165 if (g->switch_point) {
166 /* if switched mode, we handle the 36 first samples as
167 long blocks. For 8000Hz, we handle the 48 first
168 exponents as long blocks (XXX: check this!) */
169 if (s->sample_rate_index <= 2)
171 else if (s->sample_rate_index != 8)
174 g->long_end = 4; /* 8000 Hz */
176 g->short_start = 2 + (s->sample_rate_index != 8);
187 /* layer 1 unscaling */
188 /* n = number of bits of the mantissa minus 1 */
189 static inline int l1_unscale(int n, int mant, int scale_factor)
194 shift = scale_factor_modshift[scale_factor];
197 val = MUL64(mant + (-1 << n) + 1, scale_factor_mult[n-1][mod]);
199 /* NOTE: at this point, 1 <= shift >= 21 + 15 */
200 return (int)((val + (1LL << (shift - 1))) >> shift);
203 static inline int l2_unscale_group(int steps, int mant, int scale_factor)
207 shift = scale_factor_modshift[scale_factor];
211 val = (mant - (steps >> 1)) * scale_factor_mult2[steps >> 2][mod];
212 /* NOTE: at this point, 0 <= shift <= 21 */
214 val = (val + (1 << (shift - 1))) >> shift;
218 /* compute value^(4/3) * 2^(exponent/4). It normalized to FRAC_BITS */
219 static inline int l3_unscale(int value, int exponent)
224 e = table_4_3_exp [4*value + (exponent&3)];
225 m = table_4_3_value[4*value + (exponent&3)];
226 e -= (exponent >> 2);
230 m = (m + (1 << (e-1))) >> e;
235 /* all integer n^(4/3) computation code */
238 #define POW_FRAC_BITS 24
239 #define POW_FRAC_ONE (1 << POW_FRAC_BITS)
240 #define POW_FIX(a) ((int)((a) * POW_FRAC_ONE))
241 #define POW_MULL(a,b) (((int64_t)(a) * (int64_t)(b)) >> POW_FRAC_BITS)
243 static int dev_4_3_coefs[DEV_ORDER];
246 static int pow_mult3[3] = {
248 POW_FIX(1.25992104989487316476),
249 POW_FIX(1.58740105196819947474),
253 static void int_pow_init(void)
258 for(i=0;i<DEV_ORDER;i++) {
259 a = POW_MULL(a, POW_FIX(4.0 / 3.0) - i * POW_FIX(1.0)) / (i + 1);
260 dev_4_3_coefs[i] = a;
264 #if 0 /* unused, remove? */
265 /* return the mantissa and the binary exponent */
266 static int int_pow(int i, int *exp_ptr)
274 while (a < (1 << (POW_FRAC_BITS - 1))) {
278 a -= (1 << POW_FRAC_BITS);
280 for(j = DEV_ORDER - 1; j >= 0; j--)
281 a1 = POW_MULL(a, dev_4_3_coefs[j] + a1);
282 a = (1 << POW_FRAC_BITS) + a1;
283 /* exponent compute (exact) */
287 a = POW_MULL(a, pow_mult3[er]);
288 while (a >= 2 * POW_FRAC_ONE) {
292 /* convert to float */
293 while (a < POW_FRAC_ONE) {
297 /* now POW_FRAC_ONE <= a < 2 * POW_FRAC_ONE */
298 #if POW_FRAC_BITS > FRAC_BITS
299 a = (a + (1 << (POW_FRAC_BITS - FRAC_BITS - 1))) >> (POW_FRAC_BITS - FRAC_BITS);
300 /* correct overflow */
301 if (a >= 2 * (1 << FRAC_BITS)) {
311 static int decode_init(AVCodecContext * avctx)
313 MPADecodeContext *s = avctx->priv_data;
319 #if defined(CONFIG_MPEGAUDIO_HP) && defined(CONFIG_AUDIO_NONSHORT)
320 avctx->sample_fmt= SAMPLE_FMT_S32;
322 avctx->sample_fmt= SAMPLE_FMT_S16;
324 s->error_recognition= avctx->error_recognition;
326 if(avctx->antialias_algo != FF_AA_FLOAT)
327 s->compute_antialias= compute_antialias_integer;
329 s->compute_antialias= compute_antialias_float;
331 if (!init && !avctx->parse_only) {
334 /* scale factors table for layer 1/2 */
337 /* 1.0 (i = 3) is normalized to 2 ^ FRAC_BITS */
340 scale_factor_modshift[i] = mod | (shift << 2);
343 /* scale factor multiply for layer 1 */
347 norm = ((INT64_C(1) << n) * FRAC_ONE) / ((1 << n) - 1);
348 scale_factor_mult[i][0] = MULL(FIXR(1.0 * 2.0), norm, FRAC_BITS);
349 scale_factor_mult[i][1] = MULL(FIXR(0.7937005259 * 2.0), norm, FRAC_BITS);
350 scale_factor_mult[i][2] = MULL(FIXR(0.6299605249 * 2.0), norm, FRAC_BITS);
351 dprintf(avctx, "%d: norm=%x s=%x %x %x\n",
353 scale_factor_mult[i][0],
354 scale_factor_mult[i][1],
355 scale_factor_mult[i][2]);
358 ff_mpa_synth_init(window);
360 /* huffman decode tables */
363 const HuffTable *h = &mpa_huff_tables[i];
366 uint8_t tmp_bits [512];
367 uint16_t tmp_codes[512];
369 memset(tmp_bits , 0, sizeof(tmp_bits ));
370 memset(tmp_codes, 0, sizeof(tmp_codes));
376 for(x=0;x<xsize;x++) {
377 for(y=0;y<xsize;y++){
378 tmp_bits [(x << 5) | y | ((x&&y)<<4)]= h->bits [j ];
379 tmp_codes[(x << 5) | y | ((x&&y)<<4)]= h->codes[j++];
384 huff_vlc[i].table = huff_vlc_tables+offset;
385 huff_vlc[i].table_allocated = huff_vlc_tables_sizes[i];
386 init_vlc(&huff_vlc[i], 7, 512,
387 tmp_bits, 1, 1, tmp_codes, 2, 2,
388 INIT_VLC_USE_NEW_STATIC);
389 offset += huff_vlc_tables_sizes[i];
391 assert(offset == FF_ARRAY_ELEMS(huff_vlc_tables));
395 huff_quad_vlc[i].table = huff_quad_vlc_tables+offset;
396 huff_quad_vlc[i].table_allocated = huff_quad_vlc_tables_sizes[i];
397 init_vlc(&huff_quad_vlc[i], i == 0 ? 7 : 4, 16,
398 mpa_quad_bits[i], 1, 1, mpa_quad_codes[i], 1, 1,
399 INIT_VLC_USE_NEW_STATIC);
400 offset += huff_quad_vlc_tables_sizes[i];
402 assert(offset == FF_ARRAY_ELEMS(huff_quad_vlc_tables));
407 band_index_long[i][j] = k;
408 k += band_size_long[i][j];
410 band_index_long[i][22] = k;
413 /* compute n ^ (4/3) and store it in mantissa/exp format */
416 for(i=1;i<TABLE_4_3_SIZE;i++) {
419 f = pow((double)(i/4), 4.0 / 3.0) * pow(2, (i&3)*0.25);
421 m = (uint32_t)(fm*(1LL<<31) + 0.5);
422 e+= FRAC_BITS - 31 + 5 - 100;
424 /* normalized to FRAC_BITS */
425 table_4_3_value[i] = m;
426 table_4_3_exp[i] = -e;
428 for(i=0; i<512*16; i++){
429 int exponent= (i>>4);
430 double f= pow(i&15, 4.0 / 3.0) * pow(2, (exponent-400)*0.25 + FRAC_BITS + 5);
431 expval_table[exponent][i&15]= llrint(f);
433 exp_table[exponent]= llrint(f);
440 f = tan((double)i * M_PI / 12.0);
441 v = FIXR(f / (1.0 + f));
446 is_table[1][6 - i] = v;
450 is_table[0][i] = is_table[1][i] = 0.0;
457 e = -(j + 1) * ((i + 1) >> 1);
458 f = pow(2.0, e / 4.0);
460 is_table_lsf[j][k ^ 1][i] = FIXR(f);
461 is_table_lsf[j][k][i] = FIXR(1.0);
462 dprintf(avctx, "is_table_lsf %d %d: %x %x\n",
463 i, j, is_table_lsf[j][0][i], is_table_lsf[j][1][i]);
470 cs = 1.0 / sqrt(1.0 + ci * ci);
472 csa_table[i][0] = FIXHR(cs/4);
473 csa_table[i][1] = FIXHR(ca/4);
474 csa_table[i][2] = FIXHR(ca/4) + FIXHR(cs/4);
475 csa_table[i][3] = FIXHR(ca/4) - FIXHR(cs/4);
476 csa_table_float[i][0] = cs;
477 csa_table_float[i][1] = ca;
478 csa_table_float[i][2] = ca + cs;
479 csa_table_float[i][3] = ca - cs;
482 /* compute mdct windows */
490 d= sin(M_PI * (i + 0.5) / 36.0);
493 else if(i>=24) d= sin(M_PI * (i - 18 + 0.5) / 12.0);
497 else if(i< 12) d= sin(M_PI * (i - 6 + 0.5) / 12.0);
500 //merge last stage of imdct into the window coefficients
501 d*= 0.5 / cos(M_PI*(2*i + 19)/72);
504 mdct_win[j][i/3] = FIXHR((d / (1<<5)));
506 mdct_win[j][i ] = FIXHR((d / (1<<5)));
510 /* NOTE: we do frequency inversion adter the MDCT by changing
511 the sign of the right window coefs */
514 mdct_win[j + 4][i] = mdct_win[j][i];
515 mdct_win[j + 4][i + 1] = -mdct_win[j][i + 1];
522 if (avctx->codec_id == CODEC_ID_MP3ADU)
527 /* tab[i][j] = 1.0 / (2.0 * cos(pi*(2*k+1) / 2^(6 - j))) */
531 #define COS0_0 FIXHR(0.50060299823519630134/2)
532 #define COS0_1 FIXHR(0.50547095989754365998/2)
533 #define COS0_2 FIXHR(0.51544730992262454697/2)
534 #define COS0_3 FIXHR(0.53104259108978417447/2)
535 #define COS0_4 FIXHR(0.55310389603444452782/2)
536 #define COS0_5 FIXHR(0.58293496820613387367/2)
537 #define COS0_6 FIXHR(0.62250412303566481615/2)
538 #define COS0_7 FIXHR(0.67480834145500574602/2)
539 #define COS0_8 FIXHR(0.74453627100229844977/2)
540 #define COS0_9 FIXHR(0.83934964541552703873/2)
541 #define COS0_10 FIXHR(0.97256823786196069369/2)
542 #define COS0_11 FIXHR(1.16943993343288495515/4)
543 #define COS0_12 FIXHR(1.48416461631416627724/4)
544 #define COS0_13 FIXHR(2.05778100995341155085/8)
545 #define COS0_14 FIXHR(3.40760841846871878570/8)
546 #define COS0_15 FIXHR(10.19000812354805681150/32)
548 #define COS1_0 FIXHR(0.50241928618815570551/2)
549 #define COS1_1 FIXHR(0.52249861493968888062/2)
550 #define COS1_2 FIXHR(0.56694403481635770368/2)
551 #define COS1_3 FIXHR(0.64682178335999012954/2)
552 #define COS1_4 FIXHR(0.78815462345125022473/2)
553 #define COS1_5 FIXHR(1.06067768599034747134/4)
554 #define COS1_6 FIXHR(1.72244709823833392782/4)
555 #define COS1_7 FIXHR(5.10114861868916385802/16)
557 #define COS2_0 FIXHR(0.50979557910415916894/2)
558 #define COS2_1 FIXHR(0.60134488693504528054/2)
559 #define COS2_2 FIXHR(0.89997622313641570463/2)
560 #define COS2_3 FIXHR(2.56291544774150617881/8)
562 #define COS3_0 FIXHR(0.54119610014619698439/2)
563 #define COS3_1 FIXHR(1.30656296487637652785/4)
565 #define COS4_0 FIXHR(0.70710678118654752439/2)
567 /* butterfly operator */
568 #define BF(a, b, c, s)\
570 tmp0 = tab[a] + tab[b];\
571 tmp1 = tab[a] - tab[b];\
573 tab[b] = MULH(tmp1<<(s), c);\
576 #define BF1(a, b, c, d)\
578 BF(a, b, COS4_0, 1);\
579 BF(c, d,-COS4_0, 1);\
583 #define BF2(a, b, c, d)\
585 BF(a, b, COS4_0, 1);\
586 BF(c, d,-COS4_0, 1);\
593 #define ADD(a, b) tab[a] += tab[b]
595 /* DCT32 without 1/sqrt(2) coef zero scaling. */
596 static void dct32(int32_t *out, int32_t *tab)
601 BF( 0, 31, COS0_0 , 1);
602 BF(15, 16, COS0_15, 5);
604 BF( 0, 15, COS1_0 , 1);
605 BF(16, 31,-COS1_0 , 1);
607 BF( 7, 24, COS0_7 , 1);
608 BF( 8, 23, COS0_8 , 1);
610 BF( 7, 8, COS1_7 , 4);
611 BF(23, 24,-COS1_7 , 4);
613 BF( 0, 7, COS2_0 , 1);
614 BF( 8, 15,-COS2_0 , 1);
615 BF(16, 23, COS2_0 , 1);
616 BF(24, 31,-COS2_0 , 1);
618 BF( 3, 28, COS0_3 , 1);
619 BF(12, 19, COS0_12, 2);
621 BF( 3, 12, COS1_3 , 1);
622 BF(19, 28,-COS1_3 , 1);
624 BF( 4, 27, COS0_4 , 1);
625 BF(11, 20, COS0_11, 2);
627 BF( 4, 11, COS1_4 , 1);
628 BF(20, 27,-COS1_4 , 1);
630 BF( 3, 4, COS2_3 , 3);
631 BF(11, 12,-COS2_3 , 3);
632 BF(19, 20, COS2_3 , 3);
633 BF(27, 28,-COS2_3 , 3);
635 BF( 0, 3, COS3_0 , 1);
636 BF( 4, 7,-COS3_0 , 1);
637 BF( 8, 11, COS3_0 , 1);
638 BF(12, 15,-COS3_0 , 1);
639 BF(16, 19, COS3_0 , 1);
640 BF(20, 23,-COS3_0 , 1);
641 BF(24, 27, COS3_0 , 1);
642 BF(28, 31,-COS3_0 , 1);
647 BF( 1, 30, COS0_1 , 1);
648 BF(14, 17, COS0_14, 3);
650 BF( 1, 14, COS1_1 , 1);
651 BF(17, 30,-COS1_1 , 1);
653 BF( 6, 25, COS0_6 , 1);
654 BF( 9, 22, COS0_9 , 1);
656 BF( 6, 9, COS1_6 , 2);
657 BF(22, 25,-COS1_6 , 2);
659 BF( 1, 6, COS2_1 , 1);
660 BF( 9, 14,-COS2_1 , 1);
661 BF(17, 22, COS2_1 , 1);
662 BF(25, 30,-COS2_1 , 1);
665 BF( 2, 29, COS0_2 , 1);
666 BF(13, 18, COS0_13, 3);
668 BF( 2, 13, COS1_2 , 1);
669 BF(18, 29,-COS1_2 , 1);
671 BF( 5, 26, COS0_5 , 1);
672 BF(10, 21, COS0_10, 1);
674 BF( 5, 10, COS1_5 , 2);
675 BF(21, 26,-COS1_5 , 2);
677 BF( 2, 5, COS2_2 , 1);
678 BF(10, 13,-COS2_2 , 1);
679 BF(18, 21, COS2_2 , 1);
680 BF(26, 29,-COS2_2 , 1);
682 BF( 1, 2, COS3_1 , 2);
683 BF( 5, 6,-COS3_1 , 2);
684 BF( 9, 10, COS3_1 , 2);
685 BF(13, 14,-COS3_1 , 2);
686 BF(17, 18, COS3_1 , 2);
687 BF(21, 22,-COS3_1 , 2);
688 BF(25, 26, COS3_1 , 2);
689 BF(29, 30,-COS3_1 , 2);
736 out[ 1] = tab[16] + tab[24];
737 out[17] = tab[17] + tab[25];
738 out[ 9] = tab[18] + tab[26];
739 out[25] = tab[19] + tab[27];
740 out[ 5] = tab[20] + tab[28];
741 out[21] = tab[21] + tab[29];
742 out[13] = tab[22] + tab[30];
743 out[29] = tab[23] + tab[31];
744 out[ 3] = tab[24] + tab[20];
745 out[19] = tab[25] + tab[21];
746 out[11] = tab[26] + tab[22];
747 out[27] = tab[27] + tab[23];
748 out[ 7] = tab[28] + tab[18];
749 out[23] = tab[29] + tab[19];
750 out[15] = tab[30] + tab[17];
756 static inline int round_sample(int *sum)
759 sum1 = (*sum) >> OUT_SHIFT;
760 *sum &= (1<<OUT_SHIFT)-1;
763 else if (sum1 > OUT_MAX)
768 /* signed 16x16 -> 32 multiply add accumulate */
769 #define MACS(rt, ra, rb) MAC16(rt, ra, rb)
771 /* signed 16x16 -> 32 multiply */
772 #define MULS(ra, rb) MUL16(ra, rb)
774 #define MLSS(rt, ra, rb) MLS16(rt, ra, rb)
778 static inline int round_sample(int64_t *sum)
781 sum1 = (int)((*sum) >> OUT_SHIFT);
782 *sum &= (1<<OUT_SHIFT)-1;
785 else if (sum1 > OUT_MAX)
790 # define MULS(ra, rb) MUL64(ra, rb)
791 # define MACS(rt, ra, rb) MAC64(rt, ra, rb)
792 # define MLSS(rt, ra, rb) MLS64(rt, ra, rb)
795 #define SUM8(op, sum, w, p) \
797 op(sum, (w)[0 * 64], p[0 * 64]); \
798 op(sum, (w)[1 * 64], p[1 * 64]); \
799 op(sum, (w)[2 * 64], p[2 * 64]); \
800 op(sum, (w)[3 * 64], p[3 * 64]); \
801 op(sum, (w)[4 * 64], p[4 * 64]); \
802 op(sum, (w)[5 * 64], p[5 * 64]); \
803 op(sum, (w)[6 * 64], p[6 * 64]); \
804 op(sum, (w)[7 * 64], p[7 * 64]); \
807 #define SUM8P2(sum1, op1, sum2, op2, w1, w2, p) \
811 op1(sum1, (w1)[0 * 64], tmp);\
812 op2(sum2, (w2)[0 * 64], tmp);\
814 op1(sum1, (w1)[1 * 64], tmp);\
815 op2(sum2, (w2)[1 * 64], tmp);\
817 op1(sum1, (w1)[2 * 64], tmp);\
818 op2(sum2, (w2)[2 * 64], tmp);\
820 op1(sum1, (w1)[3 * 64], tmp);\
821 op2(sum2, (w2)[3 * 64], tmp);\
823 op1(sum1, (w1)[4 * 64], tmp);\
824 op2(sum2, (w2)[4 * 64], tmp);\
826 op1(sum1, (w1)[5 * 64], tmp);\
827 op2(sum2, (w2)[5 * 64], tmp);\
829 op1(sum1, (w1)[6 * 64], tmp);\
830 op2(sum2, (w2)[6 * 64], tmp);\
832 op1(sum1, (w1)[7 * 64], tmp);\
833 op2(sum2, (w2)[7 * 64], tmp);\
836 void ff_mpa_synth_init(MPA_INT *window)
840 /* max = 18760, max sum over all 16 coefs : 44736 */
843 v = ff_mpa_enwindow[i];
845 v = (v + (1 << (16 - WFRAC_BITS - 1))) >> (16 - WFRAC_BITS);
855 /* 32 sub band synthesis filter. Input: 32 sub band samples, Output:
857 /* XXX: optimize by avoiding ring buffer usage */
858 void ff_mpa_synth_filter(MPA_INT *synth_buf_ptr, int *synth_buf_offset,
859 MPA_INT *window, int *dither_state,
860 OUT_INT *samples, int incr,
861 int32_t sb_samples[SBLIMIT])
864 register MPA_INT *synth_buf;
865 register const MPA_INT *w, *w2, *p;
874 dct32(tmp, sb_samples);
876 offset = *synth_buf_offset;
877 synth_buf = synth_buf_ptr + offset;
882 /* NOTE: can cause a loss in precision if very high amplitude
884 v = av_clip_int16(v);
888 /* copy to avoid wrap */
889 memcpy(synth_buf + 512, synth_buf, 32 * sizeof(MPA_INT));
891 samples2 = samples + 31 * incr;
897 SUM8(MACS, sum, w, p);
899 SUM8(MLSS, sum, w + 32, p);
900 *samples = round_sample(&sum);
904 /* we calculate two samples at the same time to avoid one memory
905 access per two sample */
908 p = synth_buf + 16 + j;
909 SUM8P2(sum, MACS, sum2, MLSS, w, w2, p);
910 p = synth_buf + 48 - j;
911 SUM8P2(sum, MLSS, sum2, MLSS, w + 32, w2 + 32, p);
913 *samples = round_sample(&sum);
916 *samples2 = round_sample(&sum);
923 SUM8(MLSS, sum, w + 32, p);
924 *samples = round_sample(&sum);
927 offset = (offset - 32) & 511;
928 *synth_buf_offset = offset;
931 #define C3 FIXHR(0.86602540378443864676/2)
933 /* 0.5 / cos(pi*(2*i+1)/36) */
934 static const int icos36[9] = {
935 FIXR(0.50190991877167369479),
936 FIXR(0.51763809020504152469), //0
937 FIXR(0.55168895948124587824),
938 FIXR(0.61038729438072803416),
939 FIXR(0.70710678118654752439), //1
940 FIXR(0.87172339781054900991),
941 FIXR(1.18310079157624925896),
942 FIXR(1.93185165257813657349), //2
943 FIXR(5.73685662283492756461),
946 /* 0.5 / cos(pi*(2*i+1)/36) */
947 static const int icos36h[9] = {
948 FIXHR(0.50190991877167369479/2),
949 FIXHR(0.51763809020504152469/2), //0
950 FIXHR(0.55168895948124587824/2),
951 FIXHR(0.61038729438072803416/2),
952 FIXHR(0.70710678118654752439/2), //1
953 FIXHR(0.87172339781054900991/2),
954 FIXHR(1.18310079157624925896/4),
955 FIXHR(1.93185165257813657349/4), //2
956 // FIXHR(5.73685662283492756461),
959 /* 12 points IMDCT. We compute it "by hand" by factorizing obvious
961 static void imdct12(int *out, int *in)
963 int in0, in1, in2, in3, in4, in5, t1, t2;
966 in1= in[1*3] + in[0*3];
967 in2= in[2*3] + in[1*3];
968 in3= in[3*3] + in[2*3];
969 in4= in[4*3] + in[3*3];
970 in5= in[5*3] + in[4*3];
974 in2= MULH(2*in2, C3);
975 in3= MULH(4*in3, C3);
978 t2 = MULH(2*(in1 - in5), icos36h[4]);
988 in1 = MULH(in5 + in3, icos36h[1]);
995 in5 = MULH(2*(in5 - in3), icos36h[7]);
1003 #define C1 FIXHR(0.98480775301220805936/2)
1004 #define C2 FIXHR(0.93969262078590838405/2)
1005 #define C3 FIXHR(0.86602540378443864676/2)
1006 #define C4 FIXHR(0.76604444311897803520/2)
1007 #define C5 FIXHR(0.64278760968653932632/2)
1008 #define C6 FIXHR(0.5/2)
1009 #define C7 FIXHR(0.34202014332566873304/2)
1010 #define C8 FIXHR(0.17364817766693034885/2)
1013 /* using Lee like decomposition followed by hand coded 9 points DCT */
1014 static void imdct36(int *out, int *buf, int *in, int *win)
1016 int i, j, t0, t1, t2, t3, s0, s1, s2, s3;
1017 int tmp[18], *tmp1, *in1;
1028 //more accurate but slower
1029 int64_t t0, t1, t2, t3;
1030 t2 = in1[2*4] + in1[2*8] - in1[2*2];
1032 t3 = (in1[2*0] + (int64_t)(in1[2*6]>>1))<<32;
1033 t1 = in1[2*0] - in1[2*6];
1034 tmp1[ 6] = t1 - (t2>>1);
1037 t0 = MUL64(2*(in1[2*2] + in1[2*4]), C2);
1038 t1 = MUL64( in1[2*4] - in1[2*8] , -2*C8);
1039 t2 = MUL64(2*(in1[2*2] + in1[2*8]), -C4);
1041 tmp1[10] = (t3 - t0 - t2) >> 32;
1042 tmp1[ 2] = (t3 + t0 + t1) >> 32;
1043 tmp1[14] = (t3 + t2 - t1) >> 32;
1045 tmp1[ 4] = MULH(2*(in1[2*5] + in1[2*7] - in1[2*1]), -C3);
1046 t2 = MUL64(2*(in1[2*1] + in1[2*5]), C1);
1047 t3 = MUL64( in1[2*5] - in1[2*7] , -2*C7);
1048 t0 = MUL64(2*in1[2*3], C3);
1050 t1 = MUL64(2*(in1[2*1] + in1[2*7]), -C5);
1052 tmp1[ 0] = (t2 + t3 + t0) >> 32;
1053 tmp1[12] = (t2 + t1 - t0) >> 32;
1054 tmp1[ 8] = (t3 - t1 - t0) >> 32;
1056 t2 = in1[2*4] + in1[2*8] - in1[2*2];
1058 t3 = in1[2*0] + (in1[2*6]>>1);
1059 t1 = in1[2*0] - in1[2*6];
1060 tmp1[ 6] = t1 - (t2>>1);
1063 t0 = MULH(2*(in1[2*2] + in1[2*4]), C2);
1064 t1 = MULH( in1[2*4] - in1[2*8] , -2*C8);
1065 t2 = MULH(2*(in1[2*2] + in1[2*8]), -C4);
1067 tmp1[10] = t3 - t0 - t2;
1068 tmp1[ 2] = t3 + t0 + t1;
1069 tmp1[14] = t3 + t2 - t1;
1071 tmp1[ 4] = MULH(2*(in1[2*5] + in1[2*7] - in1[2*1]), -C3);
1072 t2 = MULH(2*(in1[2*1] + in1[2*5]), C1);
1073 t3 = MULH( in1[2*5] - in1[2*7] , -2*C7);
1074 t0 = MULH(2*in1[2*3], C3);
1076 t1 = MULH(2*(in1[2*1] + in1[2*7]), -C5);
1078 tmp1[ 0] = t2 + t3 + t0;
1079 tmp1[12] = t2 + t1 - t0;
1080 tmp1[ 8] = t3 - t1 - t0;
1093 s1 = MULH(2*(t3 + t2), icos36h[j]);
1094 s3 = MULL(t3 - t2, icos36[8 - j], FRAC_BITS);
1098 out[(9 + j)*SBLIMIT] = MULH(t1, win[9 + j]) + buf[9 + j];
1099 out[(8 - j)*SBLIMIT] = MULH(t1, win[8 - j]) + buf[8 - j];
1100 buf[9 + j] = MULH(t0, win[18 + 9 + j]);
1101 buf[8 - j] = MULH(t0, win[18 + 8 - j]);
1105 out[(9 + 8 - j)*SBLIMIT] = MULH(t1, win[9 + 8 - j]) + buf[9 + 8 - j];
1106 out[( j)*SBLIMIT] = MULH(t1, win[ j]) + buf[ j];
1107 buf[9 + 8 - j] = MULH(t0, win[18 + 9 + 8 - j]);
1108 buf[ + j] = MULH(t0, win[18 + j]);
1113 s1 = MULH(2*tmp[17], icos36h[4]);
1116 out[(9 + 4)*SBLIMIT] = MULH(t1, win[9 + 4]) + buf[9 + 4];
1117 out[(8 - 4)*SBLIMIT] = MULH(t1, win[8 - 4]) + buf[8 - 4];
1118 buf[9 + 4] = MULH(t0, win[18 + 9 + 4]);
1119 buf[8 - 4] = MULH(t0, win[18 + 8 - 4]);
1122 /* return the number of decoded frames */
1123 static int mp_decode_layer1(MPADecodeContext *s)
1125 int bound, i, v, n, ch, j, mant;
1126 uint8_t allocation[MPA_MAX_CHANNELS][SBLIMIT];
1127 uint8_t scale_factors[MPA_MAX_CHANNELS][SBLIMIT];
1129 if (s->mode == MPA_JSTEREO)
1130 bound = (s->mode_ext + 1) * 4;
1134 /* allocation bits */
1135 for(i=0;i<bound;i++) {
1136 for(ch=0;ch<s->nb_channels;ch++) {
1137 allocation[ch][i] = get_bits(&s->gb, 4);
1140 for(i=bound;i<SBLIMIT;i++) {
1141 allocation[0][i] = get_bits(&s->gb, 4);
1145 for(i=0;i<bound;i++) {
1146 for(ch=0;ch<s->nb_channels;ch++) {
1147 if (allocation[ch][i])
1148 scale_factors[ch][i] = get_bits(&s->gb, 6);
1151 for(i=bound;i<SBLIMIT;i++) {
1152 if (allocation[0][i]) {
1153 scale_factors[0][i] = get_bits(&s->gb, 6);
1154 scale_factors[1][i] = get_bits(&s->gb, 6);
1158 /* compute samples */
1160 for(i=0;i<bound;i++) {
1161 for(ch=0;ch<s->nb_channels;ch++) {
1162 n = allocation[ch][i];
1164 mant = get_bits(&s->gb, n + 1);
1165 v = l1_unscale(n, mant, scale_factors[ch][i]);
1169 s->sb_samples[ch][j][i] = v;
1172 for(i=bound;i<SBLIMIT;i++) {
1173 n = allocation[0][i];
1175 mant = get_bits(&s->gb, n + 1);
1176 v = l1_unscale(n, mant, scale_factors[0][i]);
1177 s->sb_samples[0][j][i] = v;
1178 v = l1_unscale(n, mant, scale_factors[1][i]);
1179 s->sb_samples[1][j][i] = v;
1181 s->sb_samples[0][j][i] = 0;
1182 s->sb_samples[1][j][i] = 0;
1189 static int mp_decode_layer2(MPADecodeContext *s)
1191 int sblimit; /* number of used subbands */
1192 const unsigned char *alloc_table;
1193 int table, bit_alloc_bits, i, j, ch, bound, v;
1194 unsigned char bit_alloc[MPA_MAX_CHANNELS][SBLIMIT];
1195 unsigned char scale_code[MPA_MAX_CHANNELS][SBLIMIT];
1196 unsigned char scale_factors[MPA_MAX_CHANNELS][SBLIMIT][3], *sf;
1197 int scale, qindex, bits, steps, k, l, m, b;
1199 /* select decoding table */
1200 table = ff_mpa_l2_select_table(s->bit_rate / 1000, s->nb_channels,
1201 s->sample_rate, s->lsf);
1202 sblimit = ff_mpa_sblimit_table[table];
1203 alloc_table = ff_mpa_alloc_tables[table];
1205 if (s->mode == MPA_JSTEREO)
1206 bound = (s->mode_ext + 1) * 4;
1210 dprintf(s->avctx, "bound=%d sblimit=%d\n", bound, sblimit);
1213 if( bound > sblimit ) bound = sblimit;
1215 /* parse bit allocation */
1217 for(i=0;i<bound;i++) {
1218 bit_alloc_bits = alloc_table[j];
1219 for(ch=0;ch<s->nb_channels;ch++) {
1220 bit_alloc[ch][i] = get_bits(&s->gb, bit_alloc_bits);
1222 j += 1 << bit_alloc_bits;
1224 for(i=bound;i<sblimit;i++) {
1225 bit_alloc_bits = alloc_table[j];
1226 v = get_bits(&s->gb, bit_alloc_bits);
1227 bit_alloc[0][i] = v;
1228 bit_alloc[1][i] = v;
1229 j += 1 << bit_alloc_bits;
1233 for(i=0;i<sblimit;i++) {
1234 for(ch=0;ch<s->nb_channels;ch++) {
1235 if (bit_alloc[ch][i])
1236 scale_code[ch][i] = get_bits(&s->gb, 2);
1241 for(i=0;i<sblimit;i++) {
1242 for(ch=0;ch<s->nb_channels;ch++) {
1243 if (bit_alloc[ch][i]) {
1244 sf = scale_factors[ch][i];
1245 switch(scale_code[ch][i]) {
1248 sf[0] = get_bits(&s->gb, 6);
1249 sf[1] = get_bits(&s->gb, 6);
1250 sf[2] = get_bits(&s->gb, 6);
1253 sf[0] = get_bits(&s->gb, 6);
1258 sf[0] = get_bits(&s->gb, 6);
1259 sf[2] = get_bits(&s->gb, 6);
1263 sf[0] = get_bits(&s->gb, 6);
1264 sf[2] = get_bits(&s->gb, 6);
1274 for(l=0;l<12;l+=3) {
1276 for(i=0;i<bound;i++) {
1277 bit_alloc_bits = alloc_table[j];
1278 for(ch=0;ch<s->nb_channels;ch++) {
1279 b = bit_alloc[ch][i];
1281 scale = scale_factors[ch][i][k];
1282 qindex = alloc_table[j+b];
1283 bits = ff_mpa_quant_bits[qindex];
1285 /* 3 values at the same time */
1286 v = get_bits(&s->gb, -bits);
1287 steps = ff_mpa_quant_steps[qindex];
1288 s->sb_samples[ch][k * 12 + l + 0][i] =
1289 l2_unscale_group(steps, v % steps, scale);
1291 s->sb_samples[ch][k * 12 + l + 1][i] =
1292 l2_unscale_group(steps, v % steps, scale);
1294 s->sb_samples[ch][k * 12 + l + 2][i] =
1295 l2_unscale_group(steps, v, scale);
1298 v = get_bits(&s->gb, bits);
1299 v = l1_unscale(bits - 1, v, scale);
1300 s->sb_samples[ch][k * 12 + l + m][i] = v;
1304 s->sb_samples[ch][k * 12 + l + 0][i] = 0;
1305 s->sb_samples[ch][k * 12 + l + 1][i] = 0;
1306 s->sb_samples[ch][k * 12 + l + 2][i] = 0;
1309 /* next subband in alloc table */
1310 j += 1 << bit_alloc_bits;
1312 /* XXX: find a way to avoid this duplication of code */
1313 for(i=bound;i<sblimit;i++) {
1314 bit_alloc_bits = alloc_table[j];
1315 b = bit_alloc[0][i];
1317 int mant, scale0, scale1;
1318 scale0 = scale_factors[0][i][k];
1319 scale1 = scale_factors[1][i][k];
1320 qindex = alloc_table[j+b];
1321 bits = ff_mpa_quant_bits[qindex];
1323 /* 3 values at the same time */
1324 v = get_bits(&s->gb, -bits);
1325 steps = ff_mpa_quant_steps[qindex];
1328 s->sb_samples[0][k * 12 + l + 0][i] =
1329 l2_unscale_group(steps, mant, scale0);
1330 s->sb_samples[1][k * 12 + l + 0][i] =
1331 l2_unscale_group(steps, mant, scale1);
1334 s->sb_samples[0][k * 12 + l + 1][i] =
1335 l2_unscale_group(steps, mant, scale0);
1336 s->sb_samples[1][k * 12 + l + 1][i] =
1337 l2_unscale_group(steps, mant, scale1);
1338 s->sb_samples[0][k * 12 + l + 2][i] =
1339 l2_unscale_group(steps, v, scale0);
1340 s->sb_samples[1][k * 12 + l + 2][i] =
1341 l2_unscale_group(steps, v, scale1);
1344 mant = get_bits(&s->gb, bits);
1345 s->sb_samples[0][k * 12 + l + m][i] =
1346 l1_unscale(bits - 1, mant, scale0);
1347 s->sb_samples[1][k * 12 + l + m][i] =
1348 l1_unscale(bits - 1, mant, scale1);
1352 s->sb_samples[0][k * 12 + l + 0][i] = 0;
1353 s->sb_samples[0][k * 12 + l + 1][i] = 0;
1354 s->sb_samples[0][k * 12 + l + 2][i] = 0;
1355 s->sb_samples[1][k * 12 + l + 0][i] = 0;
1356 s->sb_samples[1][k * 12 + l + 1][i] = 0;
1357 s->sb_samples[1][k * 12 + l + 2][i] = 0;
1359 /* next subband in alloc table */
1360 j += 1 << bit_alloc_bits;
1362 /* fill remaining samples to zero */
1363 for(i=sblimit;i<SBLIMIT;i++) {
1364 for(ch=0;ch<s->nb_channels;ch++) {
1365 s->sb_samples[ch][k * 12 + l + 0][i] = 0;
1366 s->sb_samples[ch][k * 12 + l + 1][i] = 0;
1367 s->sb_samples[ch][k * 12 + l + 2][i] = 0;
1375 static inline void lsf_sf_expand(int *slen,
1376 int sf, int n1, int n2, int n3)
1395 static void exponents_from_scale_factors(MPADecodeContext *s,
1399 const uint8_t *bstab, *pretab;
1400 int len, i, j, k, l, v0, shift, gain, gains[3];
1403 exp_ptr = exponents;
1404 gain = g->global_gain - 210;
1405 shift = g->scalefac_scale + 1;
1407 bstab = band_size_long[s->sample_rate_index];
1408 pretab = mpa_pretab[g->preflag];
1409 for(i=0;i<g->long_end;i++) {
1410 v0 = gain - ((g->scale_factors[i] + pretab[i]) << shift) + 400;
1416 if (g->short_start < 13) {
1417 bstab = band_size_short[s->sample_rate_index];
1418 gains[0] = gain - (g->subblock_gain[0] << 3);
1419 gains[1] = gain - (g->subblock_gain[1] << 3);
1420 gains[2] = gain - (g->subblock_gain[2] << 3);
1422 for(i=g->short_start;i<13;i++) {
1425 v0 = gains[l] - (g->scale_factors[k++] << shift) + 400;
1433 /* handle n = 0 too */
1434 static inline int get_bitsz(GetBitContext *s, int n)
1439 return get_bits(s, n);
1443 static void switch_buffer(MPADecodeContext *s, int *pos, int *end_pos, int *end_pos2){
1444 if(s->in_gb.buffer && *pos >= s->gb.size_in_bits){
1446 s->in_gb.buffer=NULL;
1447 assert((get_bits_count(&s->gb) & 7) == 0);
1448 skip_bits_long(&s->gb, *pos - *end_pos);
1450 *end_pos= *end_pos2 + get_bits_count(&s->gb) - *pos;
1451 *pos= get_bits_count(&s->gb);
1455 static int huffman_decode(MPADecodeContext *s, GranuleDef *g,
1456 int16_t *exponents, int end_pos2)
1460 int last_pos, bits_left;
1462 int end_pos= FFMIN(end_pos2, s->gb.size_in_bits);
1464 /* low frequencies (called big values) */
1467 int j, k, l, linbits;
1468 j = g->region_size[i];
1471 /* select vlc table */
1472 k = g->table_select[i];
1473 l = mpa_huff_data[k][0];
1474 linbits = mpa_huff_data[k][1];
1478 memset(&g->sb_hybrid[s_index], 0, sizeof(*g->sb_hybrid)*2*j);
1483 /* read huffcode and compute each couple */
1485 int exponent, x, y, v;
1486 int pos= get_bits_count(&s->gb);
1488 if (pos >= end_pos){
1489 // av_log(NULL, AV_LOG_ERROR, "pos: %d %d %d %d\n", pos, end_pos, end_pos2, s_index);
1490 switch_buffer(s, &pos, &end_pos, &end_pos2);
1491 // av_log(NULL, AV_LOG_ERROR, "new pos: %d %d\n", pos, end_pos);
1495 y = get_vlc2(&s->gb, vlc->table, 7, 3);
1498 g->sb_hybrid[s_index ] =
1499 g->sb_hybrid[s_index+1] = 0;
1504 exponent= exponents[s_index];
1506 dprintf(s->avctx, "region=%d n=%d x=%d y=%d exp=%d\n",
1507 i, g->region_size[i] - j, x, y, exponent);
1512 v = expval_table[ exponent ][ x ];
1513 // v = expval_table[ (exponent&3) ][ x ] >> FFMIN(0 - (exponent>>2), 31);
1515 x += get_bitsz(&s->gb, linbits);
1516 v = l3_unscale(x, exponent);
1518 if (get_bits1(&s->gb))
1520 g->sb_hybrid[s_index] = v;
1522 v = expval_table[ exponent ][ y ];
1524 y += get_bitsz(&s->gb, linbits);
1525 v = l3_unscale(y, exponent);
1527 if (get_bits1(&s->gb))
1529 g->sb_hybrid[s_index+1] = v;
1535 v = expval_table[ exponent ][ x ];
1537 x += get_bitsz(&s->gb, linbits);
1538 v = l3_unscale(x, exponent);
1540 if (get_bits1(&s->gb))
1542 g->sb_hybrid[s_index+!!y] = v;
1543 g->sb_hybrid[s_index+ !y] = 0;
1549 /* high frequencies */
1550 vlc = &huff_quad_vlc[g->count1table_select];
1552 while (s_index <= 572) {
1554 pos = get_bits_count(&s->gb);
1555 if (pos >= end_pos) {
1556 if (pos > end_pos2 && last_pos){
1557 /* some encoders generate an incorrect size for this
1558 part. We must go back into the data */
1560 skip_bits_long(&s->gb, last_pos - pos);
1561 av_log(s->avctx, AV_LOG_INFO, "overread, skip %d enddists: %d %d\n", last_pos - pos, end_pos-pos, end_pos2-pos);
1562 if(s->error_recognition >= FF_ER_COMPLIANT)
1566 // av_log(NULL, AV_LOG_ERROR, "pos2: %d %d %d %d\n", pos, end_pos, end_pos2, s_index);
1567 switch_buffer(s, &pos, &end_pos, &end_pos2);
1568 // av_log(NULL, AV_LOG_ERROR, "new pos2: %d %d %d\n", pos, end_pos, s_index);
1574 code = get_vlc2(&s->gb, vlc->table, vlc->bits, 1);
1575 dprintf(s->avctx, "t=%d code=%d\n", g->count1table_select, code);
1576 g->sb_hybrid[s_index+0]=
1577 g->sb_hybrid[s_index+1]=
1578 g->sb_hybrid[s_index+2]=
1579 g->sb_hybrid[s_index+3]= 0;
1581 static const int idxtab[16]={3,3,2,2,1,1,1,1,0,0,0,0,0,0,0,0};
1583 int pos= s_index+idxtab[code];
1584 code ^= 8>>idxtab[code];
1585 v = exp_table[ exponents[pos] ];
1586 // v = exp_table[ (exponents[pos]&3) ] >> FFMIN(0 - (exponents[pos]>>2), 31);
1587 if(get_bits1(&s->gb))
1589 g->sb_hybrid[pos] = v;
1593 /* skip extension bits */
1594 bits_left = end_pos2 - get_bits_count(&s->gb);
1595 //av_log(NULL, AV_LOG_ERROR, "left:%d buf:%p\n", bits_left, s->in_gb.buffer);
1596 if (bits_left < 0 && s->error_recognition >= FF_ER_COMPLIANT) {
1597 av_log(s->avctx, AV_LOG_ERROR, "bits_left=%d\n", bits_left);
1599 }else if(bits_left > 0 && s->error_recognition >= FF_ER_AGGRESSIVE){
1600 av_log(s->avctx, AV_LOG_ERROR, "bits_left=%d\n", bits_left);
1603 memset(&g->sb_hybrid[s_index], 0, sizeof(*g->sb_hybrid)*(576 - s_index));
1604 skip_bits_long(&s->gb, bits_left);
1606 i= get_bits_count(&s->gb);
1607 switch_buffer(s, &i, &end_pos, &end_pos2);
1612 /* Reorder short blocks from bitstream order to interleaved order. It
1613 would be faster to do it in parsing, but the code would be far more
1615 static void reorder_block(MPADecodeContext *s, GranuleDef *g)
1618 int32_t *ptr, *dst, *ptr1;
1621 if (g->block_type != 2)
1624 if (g->switch_point) {
1625 if (s->sample_rate_index != 8) {
1626 ptr = g->sb_hybrid + 36;
1628 ptr = g->sb_hybrid + 48;
1634 for(i=g->short_start;i<13;i++) {
1635 len = band_size_short[s->sample_rate_index][i];
1638 for(j=len;j>0;j--) {
1639 *dst++ = ptr[0*len];
1640 *dst++ = ptr[1*len];
1641 *dst++ = ptr[2*len];
1645 memcpy(ptr1, tmp, len * 3 * sizeof(*ptr1));
1649 #define ISQRT2 FIXR(0.70710678118654752440)
1651 static void compute_stereo(MPADecodeContext *s,
1652 GranuleDef *g0, GranuleDef *g1)
1656 int sf_max, tmp0, tmp1, sf, len, non_zero_found;
1657 int32_t (*is_tab)[16];
1658 int32_t *tab0, *tab1;
1659 int non_zero_found_short[3];
1661 /* intensity stereo */
1662 if (s->mode_ext & MODE_EXT_I_STEREO) {
1667 is_tab = is_table_lsf[g1->scalefac_compress & 1];
1671 tab0 = g0->sb_hybrid + 576;
1672 tab1 = g1->sb_hybrid + 576;
1674 non_zero_found_short[0] = 0;
1675 non_zero_found_short[1] = 0;
1676 non_zero_found_short[2] = 0;
1677 k = (13 - g1->short_start) * 3 + g1->long_end - 3;
1678 for(i = 12;i >= g1->short_start;i--) {
1679 /* for last band, use previous scale factor */
1682 len = band_size_short[s->sample_rate_index][i];
1686 if (!non_zero_found_short[l]) {
1687 /* test if non zero band. if so, stop doing i-stereo */
1688 for(j=0;j<len;j++) {
1690 non_zero_found_short[l] = 1;
1694 sf = g1->scale_factors[k + l];
1700 for(j=0;j<len;j++) {
1702 tab0[j] = MULL(tmp0, v1, FRAC_BITS);
1703 tab1[j] = MULL(tmp0, v2, FRAC_BITS);
1707 if (s->mode_ext & MODE_EXT_MS_STEREO) {
1708 /* lower part of the spectrum : do ms stereo
1710 for(j=0;j<len;j++) {
1713 tab0[j] = MULL(tmp0 + tmp1, ISQRT2, FRAC_BITS);
1714 tab1[j] = MULL(tmp0 - tmp1, ISQRT2, FRAC_BITS);
1721 non_zero_found = non_zero_found_short[0] |
1722 non_zero_found_short[1] |
1723 non_zero_found_short[2];
1725 for(i = g1->long_end - 1;i >= 0;i--) {
1726 len = band_size_long[s->sample_rate_index][i];
1729 /* test if non zero band. if so, stop doing i-stereo */
1730 if (!non_zero_found) {
1731 for(j=0;j<len;j++) {
1737 /* for last band, use previous scale factor */
1738 k = (i == 21) ? 20 : i;
1739 sf = g1->scale_factors[k];
1744 for(j=0;j<len;j++) {
1746 tab0[j] = MULL(tmp0, v1, FRAC_BITS);
1747 tab1[j] = MULL(tmp0, v2, FRAC_BITS);
1751 if (s->mode_ext & MODE_EXT_MS_STEREO) {
1752 /* lower part of the spectrum : do ms stereo
1754 for(j=0;j<len;j++) {
1757 tab0[j] = MULL(tmp0 + tmp1, ISQRT2, FRAC_BITS);
1758 tab1[j] = MULL(tmp0 - tmp1, ISQRT2, FRAC_BITS);
1763 } else if (s->mode_ext & MODE_EXT_MS_STEREO) {
1764 /* ms stereo ONLY */
1765 /* NOTE: the 1/sqrt(2) normalization factor is included in the
1767 tab0 = g0->sb_hybrid;
1768 tab1 = g1->sb_hybrid;
1769 for(i=0;i<576;i++) {
1772 tab0[i] = tmp0 + tmp1;
1773 tab1[i] = tmp0 - tmp1;
1778 static void compute_antialias_integer(MPADecodeContext *s,
1784 /* we antialias only "long" bands */
1785 if (g->block_type == 2) {
1786 if (!g->switch_point)
1788 /* XXX: check this for 8000Hz case */
1794 ptr = g->sb_hybrid + 18;
1795 for(i = n;i > 0;i--) {
1796 int tmp0, tmp1, tmp2;
1797 csa = &csa_table[0][0];
1801 tmp2= MULH(tmp0 + tmp1, csa[0+4*j]);\
1802 ptr[-1-j] = 4*(tmp2 - MULH(tmp1, csa[2+4*j]));\
1803 ptr[ j] = 4*(tmp2 + MULH(tmp0, csa[3+4*j]));
1818 static void compute_antialias_float(MPADecodeContext *s,
1824 /* we antialias only "long" bands */
1825 if (g->block_type == 2) {
1826 if (!g->switch_point)
1828 /* XXX: check this for 8000Hz case */
1834 ptr = g->sb_hybrid + 18;
1835 for(i = n;i > 0;i--) {
1837 float *csa = &csa_table_float[0][0];
1838 #define FLOAT_AA(j)\
1841 ptr[-1-j] = lrintf(tmp0 * csa[0+4*j] - tmp1 * csa[1+4*j]);\
1842 ptr[ j] = lrintf(tmp0 * csa[1+4*j] + tmp1 * csa[0+4*j]);
1857 static void compute_imdct(MPADecodeContext *s,
1859 int32_t *sb_samples,
1862 int32_t *ptr, *win, *win1, *buf, *out_ptr, *ptr1;
1864 int i, j, mdct_long_end, v, sblimit;
1866 /* find last non zero block */
1867 ptr = g->sb_hybrid + 576;
1868 ptr1 = g->sb_hybrid + 2 * 18;
1869 while (ptr >= ptr1) {
1871 v = ptr[0] | ptr[1] | ptr[2] | ptr[3] | ptr[4] | ptr[5];
1875 sblimit = ((ptr - g->sb_hybrid) / 18) + 1;
1877 if (g->block_type == 2) {
1878 /* XXX: check for 8000 Hz */
1879 if (g->switch_point)
1884 mdct_long_end = sblimit;
1889 for(j=0;j<mdct_long_end;j++) {
1890 /* apply window & overlap with previous buffer */
1891 out_ptr = sb_samples + j;
1893 if (g->switch_point && j < 2)
1896 win1 = mdct_win[g->block_type];
1897 /* select frequency inversion */
1898 win = win1 + ((4 * 36) & -(j & 1));
1899 imdct36(out_ptr, buf, ptr, win);
1900 out_ptr += 18*SBLIMIT;
1904 for(j=mdct_long_end;j<sblimit;j++) {
1905 /* select frequency inversion */
1906 win = mdct_win[2] + ((4 * 36) & -(j & 1));
1907 out_ptr = sb_samples + j;
1913 imdct12(out2, ptr + 0);
1915 *out_ptr = MULH(out2[i], win[i]) + buf[i + 6*1];
1916 buf[i + 6*2] = MULH(out2[i + 6], win[i + 6]);
1919 imdct12(out2, ptr + 1);
1921 *out_ptr = MULH(out2[i], win[i]) + buf[i + 6*2];
1922 buf[i + 6*0] = MULH(out2[i + 6], win[i + 6]);
1925 imdct12(out2, ptr + 2);
1927 buf[i + 6*0] = MULH(out2[i], win[i]) + buf[i + 6*0];
1928 buf[i + 6*1] = MULH(out2[i + 6], win[i + 6]);
1935 for(j=sblimit;j<SBLIMIT;j++) {
1937 out_ptr = sb_samples + j;
1947 /* main layer3 decoding function */
1948 static int mp_decode_layer3(MPADecodeContext *s)
1950 int nb_granules, main_data_begin, private_bits;
1951 int gr, ch, blocksplit_flag, i, j, k, n, bits_pos;
1952 GranuleDef granules[2][2], *g;
1953 int16_t exponents[576];
1955 /* read side info */
1957 main_data_begin = get_bits(&s->gb, 8);
1958 private_bits = get_bits(&s->gb, s->nb_channels);
1961 main_data_begin = get_bits(&s->gb, 9);
1962 if (s->nb_channels == 2)
1963 private_bits = get_bits(&s->gb, 3);
1965 private_bits = get_bits(&s->gb, 5);
1967 for(ch=0;ch<s->nb_channels;ch++) {
1968 granules[ch][0].scfsi = 0; /* all scale factors are transmitted */
1969 granules[ch][1].scfsi = get_bits(&s->gb, 4);
1973 for(gr=0;gr<nb_granules;gr++) {
1974 for(ch=0;ch<s->nb_channels;ch++) {
1975 dprintf(s->avctx, "gr=%d ch=%d: side_info\n", gr, ch);
1976 g = &granules[ch][gr];
1977 g->part2_3_length = get_bits(&s->gb, 12);
1978 g->big_values = get_bits(&s->gb, 9);
1979 if(g->big_values > 288){
1980 av_log(s->avctx, AV_LOG_ERROR, "big_values too big\n");
1984 g->global_gain = get_bits(&s->gb, 8);
1985 /* if MS stereo only is selected, we precompute the
1986 1/sqrt(2) renormalization factor */
1987 if ((s->mode_ext & (MODE_EXT_MS_STEREO | MODE_EXT_I_STEREO)) ==
1989 g->global_gain -= 2;
1991 g->scalefac_compress = get_bits(&s->gb, 9);
1993 g->scalefac_compress = get_bits(&s->gb, 4);
1994 blocksplit_flag = get_bits1(&s->gb);
1995 if (blocksplit_flag) {
1996 g->block_type = get_bits(&s->gb, 2);
1997 if (g->block_type == 0){
1998 av_log(s->avctx, AV_LOG_ERROR, "invalid block type\n");
2001 g->switch_point = get_bits1(&s->gb);
2003 g->table_select[i] = get_bits(&s->gb, 5);
2005 g->subblock_gain[i] = get_bits(&s->gb, 3);
2006 ff_init_short_region(s, g);
2008 int region_address1, region_address2;
2010 g->switch_point = 0;
2012 g->table_select[i] = get_bits(&s->gb, 5);
2013 /* compute huffman coded region sizes */
2014 region_address1 = get_bits(&s->gb, 4);
2015 region_address2 = get_bits(&s->gb, 3);
2016 dprintf(s->avctx, "region1=%d region2=%d\n",
2017 region_address1, region_address2);
2018 ff_init_long_region(s, g, region_address1, region_address2);
2020 ff_region_offset2size(g);
2021 ff_compute_band_indexes(s, g);
2025 g->preflag = get_bits1(&s->gb);
2026 g->scalefac_scale = get_bits1(&s->gb);
2027 g->count1table_select = get_bits1(&s->gb);
2028 dprintf(s->avctx, "block_type=%d switch_point=%d\n",
2029 g->block_type, g->switch_point);
2034 const uint8_t *ptr = s->gb.buffer + (get_bits_count(&s->gb)>>3);
2035 assert((get_bits_count(&s->gb) & 7) == 0);
2036 /* now we get bits from the main_data_begin offset */
2037 dprintf(s->avctx, "seekback: %d\n", main_data_begin);
2038 //av_log(NULL, AV_LOG_ERROR, "backstep:%d, lastbuf:%d\n", main_data_begin, s->last_buf_size);
2040 memcpy(s->last_buf + s->last_buf_size, ptr, EXTRABYTES);
2042 init_get_bits(&s->gb, s->last_buf, s->last_buf_size*8);
2043 skip_bits_long(&s->gb, 8*(s->last_buf_size - main_data_begin));
2046 for(gr=0;gr<nb_granules;gr++) {
2047 for(ch=0;ch<s->nb_channels;ch++) {
2048 g = &granules[ch][gr];
2049 if(get_bits_count(&s->gb)<0){
2050 av_log(s->avctx, AV_LOG_ERROR, "mdb:%d, lastbuf:%d skipping granule %d\n",
2051 main_data_begin, s->last_buf_size, gr);
2052 skip_bits_long(&s->gb, g->part2_3_length);
2053 memset(g->sb_hybrid, 0, sizeof(g->sb_hybrid));
2054 if(get_bits_count(&s->gb) >= s->gb.size_in_bits && s->in_gb.buffer){
2055 skip_bits_long(&s->in_gb, get_bits_count(&s->gb) - s->gb.size_in_bits);
2057 s->in_gb.buffer=NULL;
2062 bits_pos = get_bits_count(&s->gb);
2066 int slen, slen1, slen2;
2068 /* MPEG1 scale factors */
2069 slen1 = slen_table[0][g->scalefac_compress];
2070 slen2 = slen_table[1][g->scalefac_compress];
2071 dprintf(s->avctx, "slen1=%d slen2=%d\n", slen1, slen2);
2072 if (g->block_type == 2) {
2073 n = g->switch_point ? 17 : 18;
2077 g->scale_factors[j++] = get_bits(&s->gb, slen1);
2080 g->scale_factors[j++] = 0;
2084 g->scale_factors[j++] = get_bits(&s->gb, slen2);
2086 g->scale_factors[j++] = 0;
2089 g->scale_factors[j++] = 0;
2092 sc = granules[ch][0].scale_factors;
2095 n = (k == 0 ? 6 : 5);
2096 if ((g->scfsi & (0x8 >> k)) == 0) {
2097 slen = (k < 2) ? slen1 : slen2;
2100 g->scale_factors[j++] = get_bits(&s->gb, slen);
2103 g->scale_factors[j++] = 0;
2106 /* simply copy from last granule */
2108 g->scale_factors[j] = sc[j];
2113 g->scale_factors[j++] = 0;
2116 int tindex, tindex2, slen[4], sl, sf;
2118 /* LSF scale factors */
2119 if (g->block_type == 2) {
2120 tindex = g->switch_point ? 2 : 1;
2124 sf = g->scalefac_compress;
2125 if ((s->mode_ext & MODE_EXT_I_STEREO) && ch == 1) {
2126 /* intensity stereo case */
2129 lsf_sf_expand(slen, sf, 6, 6, 0);
2131 } else if (sf < 244) {
2132 lsf_sf_expand(slen, sf - 180, 4, 4, 0);
2135 lsf_sf_expand(slen, sf - 244, 3, 0, 0);
2141 lsf_sf_expand(slen, sf, 5, 4, 4);
2143 } else if (sf < 500) {
2144 lsf_sf_expand(slen, sf - 400, 5, 4, 0);
2147 lsf_sf_expand(slen, sf - 500, 3, 0, 0);
2155 n = lsf_nsf_table[tindex2][tindex][k];
2159 g->scale_factors[j++] = get_bits(&s->gb, sl);
2162 g->scale_factors[j++] = 0;
2165 /* XXX: should compute exact size */
2167 g->scale_factors[j] = 0;
2170 exponents_from_scale_factors(s, g, exponents);
2172 /* read Huffman coded residue */
2173 huffman_decode(s, g, exponents, bits_pos + g->part2_3_length);
2176 if (s->nb_channels == 2)
2177 compute_stereo(s, &granules[0][gr], &granules[1][gr]);
2179 for(ch=0;ch<s->nb_channels;ch++) {
2180 g = &granules[ch][gr];
2182 reorder_block(s, g);
2183 s->compute_antialias(s, g);
2184 compute_imdct(s, g, &s->sb_samples[ch][18 * gr][0], s->mdct_buf[ch]);
2187 if(get_bits_count(&s->gb)<0)
2188 skip_bits_long(&s->gb, -get_bits_count(&s->gb));
2189 return nb_granules * 18;
2192 static int mp_decode_frame(MPADecodeContext *s,
2193 OUT_INT *samples, const uint8_t *buf, int buf_size)
2195 int i, nb_frames, ch;
2196 OUT_INT *samples_ptr;
2198 init_get_bits(&s->gb, buf + HEADER_SIZE, (buf_size - HEADER_SIZE)*8);
2200 /* skip error protection field */
2201 if (s->error_protection)
2202 skip_bits(&s->gb, 16);
2204 dprintf(s->avctx, "frame %d:\n", s->frame_count);
2207 s->avctx->frame_size = 384;
2208 nb_frames = mp_decode_layer1(s);
2211 s->avctx->frame_size = 1152;
2212 nb_frames = mp_decode_layer2(s);
2215 s->avctx->frame_size = s->lsf ? 576 : 1152;
2217 nb_frames = mp_decode_layer3(s);
2220 if(s->in_gb.buffer){
2221 align_get_bits(&s->gb);
2222 i= (s->gb.size_in_bits - get_bits_count(&s->gb))>>3;
2223 if(i >= 0 && i <= BACKSTEP_SIZE){
2224 memmove(s->last_buf, s->gb.buffer + (get_bits_count(&s->gb)>>3), i);
2227 av_log(s->avctx, AV_LOG_ERROR, "invalid old backstep %d\n", i);
2229 s->in_gb.buffer= NULL;
2232 align_get_bits(&s->gb);
2233 assert((get_bits_count(&s->gb) & 7) == 0);
2234 i= (s->gb.size_in_bits - get_bits_count(&s->gb))>>3;
2236 if(i<0 || i > BACKSTEP_SIZE || nb_frames<0){
2238 av_log(s->avctx, AV_LOG_ERROR, "invalid new backstep %d\n", i);
2239 i= FFMIN(BACKSTEP_SIZE, buf_size - HEADER_SIZE);
2241 assert(i <= buf_size - HEADER_SIZE && i>= 0);
2242 memcpy(s->last_buf + s->last_buf_size, s->gb.buffer + buf_size - HEADER_SIZE - i, i);
2243 s->last_buf_size += i;
2248 /* apply the synthesis filter */
2249 for(ch=0;ch<s->nb_channels;ch++) {
2250 samples_ptr = samples + ch;
2251 for(i=0;i<nb_frames;i++) {
2252 ff_mpa_synth_filter(s->synth_buf[ch], &(s->synth_buf_offset[ch]),
2253 window, &s->dither_state,
2254 samples_ptr, s->nb_channels,
2255 s->sb_samples[ch][i]);
2256 samples_ptr += 32 * s->nb_channels;
2260 return nb_frames * 32 * sizeof(OUT_INT) * s->nb_channels;
2263 static int decode_frame(AVCodecContext * avctx,
2264 void *data, int *data_size,
2265 const uint8_t * buf, int buf_size)
2267 MPADecodeContext *s = avctx->priv_data;
2270 OUT_INT *out_samples = data;
2273 if(buf_size < HEADER_SIZE)
2276 header = AV_RB32(buf);
2277 if(ff_mpa_check_header(header) < 0){
2280 av_log(avctx, AV_LOG_ERROR, "Header missing skipping one byte.\n");
2284 if (ff_mpegaudio_decode_header(s, header) == 1) {
2285 /* free format: prepare to compute frame size */
2289 /* update codec info */
2290 avctx->channels = s->nb_channels;
2291 avctx->bit_rate = s->bit_rate;
2292 avctx->sub_id = s->layer;
2294 if(s->frame_size<=0 || s->frame_size > buf_size){
2295 av_log(avctx, AV_LOG_ERROR, "incomplete frame\n");
2297 }else if(s->frame_size < buf_size){
2298 av_log(avctx, AV_LOG_ERROR, "incorrect frame size\n");
2299 buf_size= s->frame_size;
2302 out_size = mp_decode_frame(s, out_samples, buf, buf_size);
2304 *data_size = out_size;
2305 avctx->sample_rate = s->sample_rate;
2306 //FIXME maybe move the other codec info stuff from above here too
2308 av_log(avctx, AV_LOG_DEBUG, "Error while decoding MPEG audio frame.\n"); //FIXME return -1 / but also return the number of bytes consumed
2313 static void flush(AVCodecContext *avctx){
2314 MPADecodeContext *s = avctx->priv_data;
2315 memset(s->synth_buf, 0, sizeof(s->synth_buf));
2316 s->last_buf_size= 0;
2319 #if CONFIG_MP3ADU_DECODER
2320 static int decode_frame_adu(AVCodecContext * avctx,
2321 void *data, int *data_size,
2322 const uint8_t * buf, int buf_size)
2324 MPADecodeContext *s = avctx->priv_data;
2327 OUT_INT *out_samples = data;
2331 // Discard too short frames
2332 if (buf_size < HEADER_SIZE) {
2338 if (len > MPA_MAX_CODED_FRAME_SIZE)
2339 len = MPA_MAX_CODED_FRAME_SIZE;
2341 // Get header and restore sync word
2342 header = AV_RB32(buf) | 0xffe00000;
2344 if (ff_mpa_check_header(header) < 0) { // Bad header, discard frame
2349 ff_mpegaudio_decode_header(s, header);
2350 /* update codec info */
2351 avctx->sample_rate = s->sample_rate;
2352 avctx->channels = s->nb_channels;
2353 avctx->bit_rate = s->bit_rate;
2354 avctx->sub_id = s->layer;
2356 s->frame_size = len;
2358 if (avctx->parse_only) {
2359 out_size = buf_size;
2361 out_size = mp_decode_frame(s, out_samples, buf, buf_size);
2364 *data_size = out_size;
2367 #endif /* CONFIG_MP3ADU_DECODER */
2369 #if CONFIG_MP3ON4_DECODER
2372 * Context for MP3On4 decoder
2374 typedef struct MP3On4DecodeContext {
2375 int frames; ///< number of mp3 frames per block (number of mp3 decoder instances)
2376 int syncword; ///< syncword patch
2377 const uint8_t *coff; ///< channels offsets in output buffer
2378 MPADecodeContext *mp3decctx[5]; ///< MPADecodeContext for every decoder instance
2379 } MP3On4DecodeContext;
2381 #include "mpeg4audio.h"
2383 /* Next 3 arrays are indexed by channel config number (passed via codecdata) */
2384 static const uint8_t mp3Frames[8] = {0,1,1,2,3,3,4,5}; /* number of mp3 decoder instances */
2385 /* offsets into output buffer, assume output order is FL FR BL BR C LFE */
2386 static const uint8_t chan_offset[8][5] = {
2391 {2,0,3}, // C FLR BS
2392 {4,0,2}, // C FLR BLRS
2393 {4,0,2,5}, // C FLR BLRS LFE
2394 {4,0,2,6,5}, // C FLR BLRS BLR LFE
2398 static int decode_init_mp3on4(AVCodecContext * avctx)
2400 MP3On4DecodeContext *s = avctx->priv_data;
2401 MPEG4AudioConfig cfg;
2404 if ((avctx->extradata_size < 2) || (avctx->extradata == NULL)) {
2405 av_log(avctx, AV_LOG_ERROR, "Codec extradata missing or too short.\n");
2409 ff_mpeg4audio_get_config(&cfg, avctx->extradata, avctx->extradata_size);
2410 if (!cfg.chan_config || cfg.chan_config > 7) {
2411 av_log(avctx, AV_LOG_ERROR, "Invalid channel config number.\n");
2414 s->frames = mp3Frames[cfg.chan_config];
2415 s->coff = chan_offset[cfg.chan_config];
2416 avctx->channels = ff_mpeg4audio_channels[cfg.chan_config];
2418 if (cfg.sample_rate < 16000)
2419 s->syncword = 0xffe00000;
2421 s->syncword = 0xfff00000;
2423 /* Init the first mp3 decoder in standard way, so that all tables get builded
2424 * We replace avctx->priv_data with the context of the first decoder so that
2425 * decode_init() does not have to be changed.
2426 * Other decoders will be initialized here copying data from the first context
2428 // Allocate zeroed memory for the first decoder context
2429 s->mp3decctx[0] = av_mallocz(sizeof(MPADecodeContext));
2430 // Put decoder context in place to make init_decode() happy
2431 avctx->priv_data = s->mp3decctx[0];
2433 // Restore mp3on4 context pointer
2434 avctx->priv_data = s;
2435 s->mp3decctx[0]->adu_mode = 1; // Set adu mode
2437 /* Create a separate codec/context for each frame (first is already ok).
2438 * Each frame is 1 or 2 channels - up to 5 frames allowed
2440 for (i = 1; i < s->frames; i++) {
2441 s->mp3decctx[i] = av_mallocz(sizeof(MPADecodeContext));
2442 s->mp3decctx[i]->compute_antialias = s->mp3decctx[0]->compute_antialias;
2443 s->mp3decctx[i]->adu_mode = 1;
2444 s->mp3decctx[i]->avctx = avctx;
2451 static int decode_close_mp3on4(AVCodecContext * avctx)
2453 MP3On4DecodeContext *s = avctx->priv_data;
2456 for (i = 0; i < s->frames; i++)
2457 if (s->mp3decctx[i])
2458 av_free(s->mp3decctx[i]);
2464 static int decode_frame_mp3on4(AVCodecContext * avctx,
2465 void *data, int *data_size,
2466 const uint8_t * buf, int buf_size)
2468 MP3On4DecodeContext *s = avctx->priv_data;
2469 MPADecodeContext *m;
2470 int fsize, len = buf_size, out_size = 0;
2472 OUT_INT *out_samples = data;
2473 OUT_INT decoded_buf[MPA_FRAME_SIZE * MPA_MAX_CHANNELS];
2474 OUT_INT *outptr, *bp;
2478 // Discard too short frames
2479 if (buf_size < HEADER_SIZE)
2482 // If only one decoder interleave is not needed
2483 outptr = s->frames == 1 ? out_samples : decoded_buf;
2485 avctx->bit_rate = 0;
2487 for (fr = 0; fr < s->frames; fr++) {
2488 fsize = AV_RB16(buf) >> 4;
2489 fsize = FFMIN3(fsize, len, MPA_MAX_CODED_FRAME_SIZE);
2490 m = s->mp3decctx[fr];
2493 header = (AV_RB32(buf) & 0x000fffff) | s->syncword; // patch header
2495 if (ff_mpa_check_header(header) < 0) // Bad header, discard block
2498 ff_mpegaudio_decode_header(m, header);
2499 out_size += mp_decode_frame(m, outptr, buf, fsize);
2504 n = m->avctx->frame_size*m->nb_channels;
2505 /* interleave output data */
2506 bp = out_samples + s->coff[fr];
2507 if(m->nb_channels == 1) {
2508 for(j = 0; j < n; j++) {
2509 *bp = decoded_buf[j];
2510 bp += avctx->channels;
2513 for(j = 0; j < n; j++) {
2514 bp[0] = decoded_buf[j++];
2515 bp[1] = decoded_buf[j];
2516 bp += avctx->channels;
2520 avctx->bit_rate += m->bit_rate;
2523 /* update codec info */
2524 avctx->sample_rate = s->mp3decctx[0]->sample_rate;
2526 *data_size = out_size;
2529 #endif /* CONFIG_MP3ON4_DECODER */
2531 #if CONFIG_MP1_DECODER
2532 AVCodec mp1_decoder =
2537 sizeof(MPADecodeContext),
2542 CODEC_CAP_PARSE_ONLY,
2544 .long_name= NULL_IF_CONFIG_SMALL("MP1 (MPEG audio layer 1)"),
2547 #if CONFIG_MP2_DECODER
2548 AVCodec mp2_decoder =
2553 sizeof(MPADecodeContext),
2558 CODEC_CAP_PARSE_ONLY,
2560 .long_name= NULL_IF_CONFIG_SMALL("MP2 (MPEG audio layer 2)"),
2563 #if CONFIG_MP3_DECODER
2564 AVCodec mp3_decoder =
2569 sizeof(MPADecodeContext),
2574 CODEC_CAP_PARSE_ONLY,
2576 .long_name= NULL_IF_CONFIG_SMALL("MP3 (MPEG audio layer 3)"),
2579 #if CONFIG_MP3ADU_DECODER
2580 AVCodec mp3adu_decoder =
2585 sizeof(MPADecodeContext),
2590 CODEC_CAP_PARSE_ONLY,
2592 .long_name= NULL_IF_CONFIG_SMALL("ADU (Application Data Unit) MP3 (MPEG audio layer 3)"),
2595 #if CONFIG_MP3ON4_DECODER
2596 AVCodec mp3on4_decoder =
2601 sizeof(MP3On4DecodeContext),
2604 decode_close_mp3on4,
2605 decode_frame_mp3on4,
2607 .long_name= NULL_IF_CONFIG_SMALL("MP3onMP4"),