mpegaudiodec.c 80.3 KB
Newer Older
F
Fabrice Bellard 已提交
1 2
/*
 * MPEG Audio decoder
F
Fabrice Bellard 已提交
3
 * Copyright (c) 2001, 2002 Fabrice Bellard.
F
Fabrice Bellard 已提交
4
 *
5 6 7
 * This file is part of FFmpeg.
 *
 * FFmpeg is free software; you can redistribute it and/or
F
Fabrice Bellard 已提交
8 9
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
10
 * version 2.1 of the License, or (at your option) any later version.
F
Fabrice Bellard 已提交
11
 *
12
 * FFmpeg is distributed in the hope that it will be useful,
F
Fabrice Bellard 已提交
13
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
F
Fabrice Bellard 已提交
14 15
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
F
Fabrice Bellard 已提交
16
 *
F
Fabrice Bellard 已提交
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
F
Fabrice Bellard 已提交
20
 */
M
Michael Niedermayer 已提交
21 22 23 24

/**
 * @file mpegaudiodec.c
 * MPEG Audio decoder.
25
 */
M
Michael Niedermayer 已提交
26

27
//#define DEBUG
F
Fabrice Bellard 已提交
28
#include "avcodec.h"
29
#include "bitstream.h"
30
#include "dsputil.h"
F
Fabrice Bellard 已提交
31 32

/*
33 34 35
 * TODO:
 *  - in low precision mode, use more 16 bit multiplies in synth filter
 *  - test lsf / mpeg25 extensively.
F
Fabrice Bellard 已提交
36 37
 */

38 39
/* define USE_HIGHPRECISION to have a bit exact (but slower) mpeg
   audio decoder */
40
#ifdef CONFIG_MPEGAUDIO_HP
41
#   define USE_HIGHPRECISION
42
#endif
43

R
Roberto Togni 已提交
44
#include "mpegaudio.h"
45
#include "mpegaudiodecheader.h"
46

L
Luca Barbato 已提交
47 48
#include "mathops.h"

49 50 51 52
/* WARNING: only correct for posititive numbers */
#define FIXR(a)   ((int)((a) * FRAC_ONE + 0.5))
#define FRAC_RND(a) (((a) + (FRAC_ONE/2)) >> FRAC_BITS)

M
Michael Niedermayer 已提交
53 54
#define FIXHR(a) ((int)((a) * (1LL<<32) + 0.5))

55 56
/****************/

F
Fabrice Bellard 已提交
57 58
#define HEADER_SIZE 4

59 60 61 62 63 64 65 66 67
/**
 * Context for MP3On4 decoder
 */
typedef struct MP3On4DecodeContext {
    int frames;   ///< number of mp3 frames per block (number of mp3 decoder instances)
    int chan_cfg; ///< channel config number
    MPADecodeContext *mp3decctx[5]; ///< MPADecodeContext for every decoder instance
} MP3On4DecodeContext;

68 69
/* layer 3 "granule" */
typedef struct GranuleDef {
70
    uint8_t scfsi;
71 72 73 74
    int part2_3_length;
    int big_values;
    int global_gain;
    int scalefac_compress;
75 76
    uint8_t block_type;
    uint8_t switch_point;
77 78
    int table_select[3];
    int subblock_gain[3];
79 80
    uint8_t scalefac_scale;
    uint8_t count1table_select;
81 82 83
    int region_size[3]; /* number of huffman codes in each region */
    int preflag;
    int short_start, long_end; /* long/short band indexes */
84 85
    uint8_t scale_factors[40];
    int32_t sb_hybrid[SBLIMIT * 18]; /* 576 samples */
86
} GranuleDef;
F
Fabrice Bellard 已提交
87

88 89 90
#define MODE_EXT_MS_STEREO 2
#define MODE_EXT_I_STEREO  1

91
#include "mpegaudiodata.h"
92 93
#include "mpegaudiodectab.h"

94 95 96
static void compute_antialias_integer(MPADecodeContext *s, GranuleDef *g);
static void compute_antialias_float(MPADecodeContext *s, GranuleDef *g);

97
/* vlc structure for decoding layer 3 huffman tables */
98
static VLC huff_vlc[16];
99 100
static VLC huff_quad_vlc[2];
/* computed from band_size_long */
101
static uint16_t band_index_long[9][23];
102
/* XXX: free when all decoders are closed */
103
#define TABLE_4_3_SIZE (8191 + 16)*4
104 105
static int8_t  table_4_3_exp[TABLE_4_3_SIZE];
static uint32_t table_4_3_value[TABLE_4_3_SIZE];
106
static uint32_t exp_table[512];
107
static uint32_t expval_table[512][16];
108
/* intensity stereo coef table */
109 110
static int32_t is_table[2][16];
static int32_t is_table_lsf[2][2][16];
111 112
static int32_t csa_table[8][4];
static float csa_table_float[8][4];
113
static int32_t mdct_win[8][36];
114 115

/* lower 2 bits: modulo 3, higher bits: shift */
116
static uint16_t scale_factor_modshift[64];
117
/* [i][j]:  2^(-j/3) * FRAC_ONE * 2^(i+2) / (2^(i+2) - 1) */
118
static int32_t scale_factor_mult[15][3];
119 120 121 122 123
/* mult table for layer 2 group quantization */

#define SCALE_GEN(v) \
{ FIXR(1.0 * (v)), FIXR(0.7937005259 * (v)), FIXR(0.6299605249 * (v)) }

M
Michael Niedermayer 已提交
124
static const int32_t scale_factor_mult2[3][3] = {
125 126 127
    SCALE_GEN(4.0 / 3.0), /* 3 steps */
    SCALE_GEN(4.0 / 5.0), /* 5 steps */
    SCALE_GEN(4.0 / 9.0), /* 9 steps */
128 129
};

130
static DECLARE_ALIGNED_16(MPA_INT, window[512]);
131

132 133 134 135 136
/* layer 1 unscaling */
/* n = number of bits of the mantissa minus 1 */
static inline int l1_unscale(int n, int mant, int scale_factor)
{
    int shift, mod;
137
    int64_t val;
138 139 140 141 142 143

    shift = scale_factor_modshift[scale_factor];
    mod = shift & 3;
    shift >>= 2;
    val = MUL64(mant + (-1 << n) + 1, scale_factor_mult[n-1][mod]);
    shift += n;
144 145
    /* NOTE: at this point, 1 <= shift >= 21 + 15 */
    return (int)((val + (1LL << (shift - 1))) >> shift);
146 147 148 149 150 151 152 153 154
}

static inline int l2_unscale_group(int steps, int mant, int scale_factor)
{
    int shift, mod, val;

    shift = scale_factor_modshift[scale_factor];
    mod = shift & 3;
    shift >>= 2;
155 156 157 158 159 160

    val = (mant - (steps >> 1)) * scale_factor_mult2[steps >> 2][mod];
    /* NOTE: at this point, 0 <= shift <= 21 */
    if (shift > 0)
        val = (val + (1 << (shift - 1))) >> shift;
    return val;
161 162 163 164 165 166 167 168
}

/* compute value^(4/3) * 2^(exponent/4). It normalized to FRAC_BITS */
static inline int l3_unscale(int value, int exponent)
{
    unsigned int m;
    int e;

169 170 171 172
    e = table_4_3_exp  [4*value + (exponent&3)];
    m = table_4_3_value[4*value + (exponent&3)];
    e -= (exponent >> 2);
    assert(e>=1);
173
    if (e > 31)
174
        return 0;
175
    m = (m + (1 << (e-1))) >> e;
176

177 178 179
    return m;
}

180 181 182 183 184 185
/* all integer n^(4/3) computation code */
#define DEV_ORDER 13

#define POW_FRAC_BITS 24
#define POW_FRAC_ONE    (1 << POW_FRAC_BITS)
#define POW_FIX(a)   ((int)((a) * POW_FRAC_ONE))
186
#define POW_MULL(a,b) (((int64_t)(a) * (int64_t)(b)) >> POW_FRAC_BITS)
187 188 189

static int dev_4_3_coefs[DEV_ORDER];

190
#if 0 /* unused */
191 192 193 194 195
static int pow_mult3[3] = {
    POW_FIX(1.0),
    POW_FIX(1.25992104989487316476),
    POW_FIX(1.58740105196819947474),
};
196
#endif
197 198 199 200 201 202 203 204 205 206 207 208

static void int_pow_init(void)
{
    int i, a;

    a = POW_FIX(1.0);
    for(i=0;i<DEV_ORDER;i++) {
        a = POW_MULL(a, POW_FIX(4.0 / 3.0) - i * POW_FIX(1.0)) / (i + 1);
        dev_4_3_coefs[i] = a;
    }
}

209
#if 0 /* unused, remove? */
210 211 212 213 214
/* return the mantissa and the binary exponent */
static int int_pow(int i, int *exp_ptr)
{
    int e, er, eq, j;
    int a, a1;
215

216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241
    /* renormalize */
    a = i;
    e = POW_FRAC_BITS;
    while (a < (1 << (POW_FRAC_BITS - 1))) {
        a = a << 1;
        e--;
    }
    a -= (1 << POW_FRAC_BITS);
    a1 = 0;
    for(j = DEV_ORDER - 1; j >= 0; j--)
        a1 = POW_MULL(a, dev_4_3_coefs[j] + a1);
    a = (1 << POW_FRAC_BITS) + a1;
    /* exponent compute (exact) */
    e = e * 4;
    er = e % 3;
    eq = e / 3;
    a = POW_MULL(a, pow_mult3[er]);
    while (a >= 2 * POW_FRAC_ONE) {
        a = a >> 1;
        eq++;
    }
    /* convert to float */
    while (a < POW_FRAC_ONE) {
        a = a << 1;
        eq--;
    }
242
    /* now POW_FRAC_ONE <= a < 2 * POW_FRAC_ONE */
243
#if POW_FRAC_BITS > FRAC_BITS
244 245 246 247 248 249 250
    a = (a + (1 << (POW_FRAC_BITS - FRAC_BITS - 1))) >> (POW_FRAC_BITS - FRAC_BITS);
    /* correct overflow */
    if (a >= 2 * (1 << FRAC_BITS)) {
        a = a >> 1;
        eq++;
    }
#endif
251 252 253
    *exp_ptr = eq;
    return a;
}
254
#endif
F
Fabrice Bellard 已提交
255 256 257 258

static int decode_init(AVCodecContext * avctx)
{
    MPADecodeContext *s = avctx->priv_data;
259
    static int init=0;
260
    int i, j, k;
F
Fabrice Bellard 已提交
261

M
Michel Bardiaux 已提交
262 263
    s->avctx = avctx;

264
#if defined(USE_HIGHPRECISION) && defined(CONFIG_AUDIO_NONSHORT)
265 266 267
    avctx->sample_fmt= SAMPLE_FMT_S32;
#else
    avctx->sample_fmt= SAMPLE_FMT_S16;
268
#endif
269
    s->error_resilience= avctx->error_resilience;
270

M
Michael Niedermayer 已提交
271
    if(avctx->antialias_algo != FF_AA_FLOAT)
M
10l  
Michael Niedermayer 已提交
272 273 274 275
        s->compute_antialias= compute_antialias_integer;
    else
        s->compute_antialias= compute_antialias_float;

276
    if (!init && !avctx->parse_only) {
277 278 279 280
        /* scale factors table for layer 1/2 */
        for(i=0;i<64;i++) {
            int shift, mod;
            /* 1.0 (i = 3) is normalized to 2 ^ FRAC_BITS */
281
            shift = (i / 3);
282 283 284 285 286 287 288 289
            mod = i % 3;
            scale_factor_modshift[i] = mod | (shift << 2);
        }

        /* scale factor multiply for layer 1 */
        for(i=0;i<15;i++) {
            int n, norm;
            n = i + 2;
290
            norm = ((INT64_C(1) << n) * FRAC_ONE) / ((1 << n) - 1);
291 292 293
            scale_factor_mult[i][0] = MULL(FIXR(1.0 * 2.0), norm);
            scale_factor_mult[i][1] = MULL(FIXR(0.7937005259 * 2.0), norm);
            scale_factor_mult[i][2] = MULL(FIXR(0.6299605249 * 2.0), norm);
M
Michel Bardiaux 已提交
294
            dprintf(avctx, "%d: norm=%x s=%x %x %x\n",
295
                    i, norm,
296 297 298 299
                    scale_factor_mult[i][0],
                    scale_factor_mult[i][1],
                    scale_factor_mult[i][2]);
        }
300

301
        ff_mpa_synth_init(window);
302

303 304 305
        /* huffman decode tables */
        for(i=1;i<16;i++) {
            const HuffTable *h = &mpa_huff_tables[i];
306
            int xsize, x, y;
307
            unsigned int n;
M
Michael Niedermayer 已提交
308 309
            uint8_t  tmp_bits [512];
            uint16_t tmp_codes[512];
M
Michael Niedermayer 已提交
310 311 312

            memset(tmp_bits , 0, sizeof(tmp_bits ));
            memset(tmp_codes, 0, sizeof(tmp_codes));
313 314 315

            xsize = h->xsize;
            n = xsize * xsize;
316

317 318
            j = 0;
            for(x=0;x<xsize;x++) {
M
Michael Niedermayer 已提交
319
                for(y=0;y<xsize;y++){
M
Michael Niedermayer 已提交
320 321
                    tmp_bits [(x << 5) | y | ((x&&y)<<4)]= h->bits [j  ];
                    tmp_codes[(x << 5) | y | ((x&&y)<<4)]= h->codes[j++];
M
Michael Niedermayer 已提交
322
                }
323
            }
M
Michael Niedermayer 已提交
324 325

            /* XXX: fail test */
M
Michael Niedermayer 已提交
326
            init_vlc(&huff_vlc[i], 7, 512,
M
Michael Niedermayer 已提交
327
                     tmp_bits, 1, 1, tmp_codes, 2, 2, 1);
328 329
        }
        for(i=0;i<2;i++) {
330
            init_vlc(&huff_quad_vlc[i], i == 0 ? 7 : 4, 16,
331
                     mpa_quad_bits[i], 1, 1, mpa_quad_codes[i], 1, 1, 1);
332 333 334 335 336 337 338 339 340 341 342
        }

        for(i=0;i<9;i++) {
            k = 0;
            for(j=0;j<22;j++) {
                band_index_long[i][j] = k;
                k += band_size_long[i][j];
            }
            band_index_long[i][22] = k;
        }

343
        /* compute n ^ (4/3) and store it in mantissa/exp format */
344

345
        int_pow_init();
346
        for(i=1;i<TABLE_4_3_SIZE;i++) {
347
            double f, fm;
348
            int e, m;
349 350
            f = pow((double)(i/4), 4.0 / 3.0) * pow(2, (i&3)*0.25);
            fm = frexp(f, &e);
351
            m = (uint32_t)(fm*(1LL<<31) + 0.5);
352
            e+= FRAC_BITS - 31 + 5 - 100;
353

354 355
            /* normalized to FRAC_BITS */
            table_4_3_value[i] = m;
356 357
//            av_log(NULL, AV_LOG_DEBUG, "%d %d %f\n", i, m, pow((double)i, 4.0 / 3.0));
            table_4_3_exp[i] = -e;
358
        }
359
        for(i=0; i<512*16; i++){
360 361
            int exponent= (i>>4);
            double f= pow(i&15, 4.0 / 3.0) * pow(2, (exponent-400)*0.25 + FRAC_BITS + 5);
362
            expval_table[exponent][i&15]= llrint(f);
363
            if((i&15)==1)
364
                exp_table[exponent]= llrint(f);
365
        }
366

367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392
        for(i=0;i<7;i++) {
            float f;
            int v;
            if (i != 6) {
                f = tan((double)i * M_PI / 12.0);
                v = FIXR(f / (1.0 + f));
            } else {
                v = FIXR(1.0);
            }
            is_table[0][i] = v;
            is_table[1][6 - i] = v;
        }
        /* invalid values */
        for(i=7;i<16;i++)
            is_table[0][i] = is_table[1][i] = 0.0;

        for(i=0;i<16;i++) {
            double f;
            int e, k;

            for(j=0;j<2;j++) {
                e = -(j + 1) * ((i + 1) >> 1);
                f = pow(2.0, e / 4.0);
                k = i & 1;
                is_table_lsf[j][k ^ 1][i] = FIXR(f);
                is_table_lsf[j][k][i] = FIXR(1.0);
M
Michel Bardiaux 已提交
393
                dprintf(avctx, "is_table_lsf %d %d: %x %x\n",
394 395 396 397 398 399 400 401 402
                        i, j, is_table_lsf[j][0][i], is_table_lsf[j][1][i]);
            }
        }

        for(i=0;i<8;i++) {
            float ci, cs, ca;
            ci = ci_table[i];
            cs = 1.0 / sqrt(1.0 + ci * ci);
            ca = cs * ci;
M
Michael Niedermayer 已提交
403 404 405
            csa_table[i][0] = FIXHR(cs/4);
            csa_table[i][1] = FIXHR(ca/4);
            csa_table[i][2] = FIXHR(ca/4) + FIXHR(cs/4);
406
            csa_table[i][3] = FIXHR(ca/4) - FIXHR(cs/4);
407 408 409
            csa_table_float[i][0] = cs;
            csa_table_float[i][1] = ca;
            csa_table_float[i][2] = ca + cs;
410
            csa_table_float[i][3] = ca - cs;
411
//            printf("%d %d %d %d\n", FIX(cs), FIX(cs-1), FIX(ca), FIX(cs)-FIX(ca));
M
Michael Niedermayer 已提交
412
//            av_log(NULL, AV_LOG_DEBUG,"%f %f %f %f\n", cs, ca, ca+cs, ca-cs);
413 414 415 416
        }

        /* compute mdct windows */
        for(i=0;i<36;i++) {
M
Michael Niedermayer 已提交
417 418
            for(j=0; j<4; j++){
                double d;
419

M
Michael Niedermayer 已提交
420 421
                if(j==2 && i%3 != 1)
                    continue;
422

M
Michael Niedermayer 已提交
423 424 425 426 427 428 429 430 431 432 433
                d= sin(M_PI * (i + 0.5) / 36.0);
                if(j==1){
                    if     (i>=30) d= 0;
                    else if(i>=24) d= sin(M_PI * (i - 18 + 0.5) / 12.0);
                    else if(i>=18) d= 1;
                }else if(j==3){
                    if     (i<  6) d= 0;
                    else if(i< 12) d= sin(M_PI * (i -  6 + 0.5) / 12.0);
                    else if(i< 18) d= 1;
                }
                //merge last stage of imdct into the window coefficients
M
Michael Niedermayer 已提交
434 435 436 437 438 439
                d*= 0.5 / cos(M_PI*(2*i + 19)/72);

                if(j==2)
                    mdct_win[j][i/3] = FIXHR((d / (1<<5)));
                else
                    mdct_win[j][i  ] = FIXHR((d / (1<<5)));
M
Michael Niedermayer 已提交
440 441
//                av_log(NULL, AV_LOG_DEBUG, "%2d %d %f\n", i,j,d / (1<<5));
            }
442 443 444 445 446 447 448 449 450 451 452 453 454
        }

        /* NOTE: we do frequency inversion adter the MDCT by changing
           the sign of the right window coefs */
        for(j=0;j<4;j++) {
            for(i=0;i<36;i+=2) {
                mdct_win[j + 4][i] = mdct_win[j][i];
                mdct_win[j + 4][i + 1] = -mdct_win[j][i + 1];
            }
        }

#if defined(DEBUG)
        for(j=0;j<8;j++) {
S
Steve L'Homme 已提交
455
            av_log(avctx, AV_LOG_DEBUG, "win%d=\n", j);
456
            for(i=0;i<36;i++)
S
Steve L'Homme 已提交
457 458
                av_log(avctx, AV_LOG_DEBUG, "%f, ", (double)mdct_win[j][i] / FRAC_ONE);
            av_log(avctx, AV_LOG_DEBUG, "\n");
459 460
        }
#endif
F
Fabrice Bellard 已提交
461 462 463
        init = 1;
    }

464 465 466
#ifdef DEBUG
    s->frame_count = 0;
#endif
R
Roberto Togni 已提交
467 468
    if (avctx->codec_id == CODEC_ID_MP3ADU)
        s->adu_mode = 1;
F
Fabrice Bellard 已提交
469 470 471
    return 0;
}

472
/* tab[i][j] = 1.0 / (2.0 * cos(pi*(2*k+1) / 2^(6 - j))) */
473 474 475

/* cos(i*pi/64) */

476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510
#define COS0_0  FIXHR(0.50060299823519630134/2)
#define COS0_1  FIXHR(0.50547095989754365998/2)
#define COS0_2  FIXHR(0.51544730992262454697/2)
#define COS0_3  FIXHR(0.53104259108978417447/2)
#define COS0_4  FIXHR(0.55310389603444452782/2)
#define COS0_5  FIXHR(0.58293496820613387367/2)
#define COS0_6  FIXHR(0.62250412303566481615/2)
#define COS0_7  FIXHR(0.67480834145500574602/2)
#define COS0_8  FIXHR(0.74453627100229844977/2)
#define COS0_9  FIXHR(0.83934964541552703873/2)
#define COS0_10 FIXHR(0.97256823786196069369/2)
#define COS0_11 FIXHR(1.16943993343288495515/4)
#define COS0_12 FIXHR(1.48416461631416627724/4)
#define COS0_13 FIXHR(2.05778100995341155085/8)
#define COS0_14 FIXHR(3.40760841846871878570/8)
#define COS0_15 FIXHR(10.19000812354805681150/32)

#define COS1_0 FIXHR(0.50241928618815570551/2)
#define COS1_1 FIXHR(0.52249861493968888062/2)
#define COS1_2 FIXHR(0.56694403481635770368/2)
#define COS1_3 FIXHR(0.64682178335999012954/2)
#define COS1_4 FIXHR(0.78815462345125022473/2)
#define COS1_5 FIXHR(1.06067768599034747134/4)
#define COS1_6 FIXHR(1.72244709823833392782/4)
#define COS1_7 FIXHR(5.10114861868916385802/16)

#define COS2_0 FIXHR(0.50979557910415916894/2)
#define COS2_1 FIXHR(0.60134488693504528054/2)
#define COS2_2 FIXHR(0.89997622313641570463/2)
#define COS2_3 FIXHR(2.56291544774150617881/8)

#define COS3_0 FIXHR(0.54119610014619698439/2)
#define COS3_1 FIXHR(1.30656296487637652785/4)

#define COS4_0 FIXHR(0.70710678118654752439/2)
511 512

/* butterfly operator */
513
#define BF(a, b, c, s)\
514 515 516 517
{\
    tmp0 = tab[a] + tab[b];\
    tmp1 = tab[a] - tab[b];\
    tab[a] = tmp0;\
518
    tab[b] = MULH(tmp1<<(s), c);\
519 520 521 522
}

#define BF1(a, b, c, d)\
{\
523 524
    BF(a, b, COS4_0, 1);\
    BF(c, d,-COS4_0, 1);\
525 526 527 528 529
    tab[c] += tab[d];\
}

#define BF2(a, b, c, d)\
{\
530 531
    BF(a, b, COS4_0, 1);\
    BF(c, d,-COS4_0, 1);\
532 533 534 535 536 537 538 539 540
    tab[c] += tab[d];\
    tab[a] += tab[c];\
    tab[c] += tab[b];\
    tab[b] += tab[d];\
}

#define ADD(a, b) tab[a] += tab[b]

/* DCT32 without 1/sqrt(2) coef zero scaling. */
541
static void dct32(int32_t *out, int32_t *tab)
542 543 544 545
{
    int tmp0, tmp1;

    /* pass 1 */
546 547
    BF( 0, 31, COS0_0 , 1);
    BF(15, 16, COS0_15, 5);
548
    /* pass 2 */
549 550
    BF( 0, 15, COS1_0 , 1);
    BF(16, 31,-COS1_0 , 1);
551
    /* pass 1 */
552 553
    BF( 7, 24, COS0_7 , 1);
    BF( 8, 23, COS0_8 , 1);
554
    /* pass 2 */
555 556
    BF( 7,  8, COS1_7 , 4);
    BF(23, 24,-COS1_7 , 4);
557
    /* pass 3 */
558 559 560 561
    BF( 0,  7, COS2_0 , 1);
    BF( 8, 15,-COS2_0 , 1);
    BF(16, 23, COS2_0 , 1);
    BF(24, 31,-COS2_0 , 1);
562
    /* pass 1 */
563 564
    BF( 3, 28, COS0_3 , 1);
    BF(12, 19, COS0_12, 2);
565
    /* pass 2 */
566 567
    BF( 3, 12, COS1_3 , 1);
    BF(19, 28,-COS1_3 , 1);
568
    /* pass 1 */
569 570
    BF( 4, 27, COS0_4 , 1);
    BF(11, 20, COS0_11, 2);
571
    /* pass 2 */
572 573
    BF( 4, 11, COS1_4 , 1);
    BF(20, 27,-COS1_4 , 1);
574
    /* pass 3 */
575 576 577 578
    BF( 3,  4, COS2_3 , 3);
    BF(11, 12,-COS2_3 , 3);
    BF(19, 20, COS2_3 , 3);
    BF(27, 28,-COS2_3 , 3);
579
    /* pass 4 */
580 581 582 583 584 585 586 587
    BF( 0,  3, COS3_0 , 1);
    BF( 4,  7,-COS3_0 , 1);
    BF( 8, 11, COS3_0 , 1);
    BF(12, 15,-COS3_0 , 1);
    BF(16, 19, COS3_0 , 1);
    BF(20, 23,-COS3_0 , 1);
    BF(24, 27, COS3_0 , 1);
    BF(28, 31,-COS3_0 , 1);
588

589 590 591


    /* pass 1 */
592 593
    BF( 1, 30, COS0_1 , 1);
    BF(14, 17, COS0_14, 3);
594
    /* pass 2 */
595 596
    BF( 1, 14, COS1_1 , 1);
    BF(17, 30,-COS1_1 , 1);
597
    /* pass 1 */
598 599
    BF( 6, 25, COS0_6 , 1);
    BF( 9, 22, COS0_9 , 1);
600
    /* pass 2 */
601 602
    BF( 6,  9, COS1_6 , 2);
    BF(22, 25,-COS1_6 , 2);
603
    /* pass 3 */
604 605 606 607
    BF( 1,  6, COS2_1 , 1);
    BF( 9, 14,-COS2_1 , 1);
    BF(17, 22, COS2_1 , 1);
    BF(25, 30,-COS2_1 , 1);
608

609
    /* pass 1 */
610 611
    BF( 2, 29, COS0_2 , 1);
    BF(13, 18, COS0_13, 3);
612
    /* pass 2 */
613 614
    BF( 2, 13, COS1_2 , 1);
    BF(18, 29,-COS1_2 , 1);
615
    /* pass 1 */
616 617
    BF( 5, 26, COS0_5 , 1);
    BF(10, 21, COS0_10, 1);
618
    /* pass 2 */
619 620
    BF( 5, 10, COS1_5 , 2);
    BF(21, 26,-COS1_5 , 2);
621
    /* pass 3 */
622 623 624 625
    BF( 2,  5, COS2_2 , 1);
    BF(10, 13,-COS2_2 , 1);
    BF(18, 21, COS2_2 , 1);
    BF(26, 29,-COS2_2 , 1);
626
    /* pass 4 */
627 628 629 630 631 632 633 634
    BF( 1,  2, COS3_1 , 2);
    BF( 5,  6,-COS3_1 , 2);
    BF( 9, 10, COS3_1 , 2);
    BF(13, 14,-COS3_1 , 2);
    BF(17, 18, COS3_1 , 2);
    BF(21, 22,-COS3_1 , 2);
    BF(25, 26, COS3_1 , 2);
    BF(29, 30,-COS3_1 , 2);
635

636
    /* pass 5 */
637 638 639
    BF1( 0,  1,  2,  3);
    BF2( 4,  5,  6,  7);
    BF1( 8,  9, 10, 11);
640 641 642 643 644
    BF2(12, 13, 14, 15);
    BF1(16, 17, 18, 19);
    BF2(20, 21, 22, 23);
    BF1(24, 25, 26, 27);
    BF2(28, 29, 30, 31);
645

646
    /* pass 6 */
647

648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671
    ADD( 8, 12);
    ADD(12, 10);
    ADD(10, 14);
    ADD(14,  9);
    ADD( 9, 13);
    ADD(13, 11);
    ADD(11, 15);

    out[ 0] = tab[0];
    out[16] = tab[1];
    out[ 8] = tab[2];
    out[24] = tab[3];
    out[ 4] = tab[4];
    out[20] = tab[5];
    out[12] = tab[6];
    out[28] = tab[7];
    out[ 2] = tab[8];
    out[18] = tab[9];
    out[10] = tab[10];
    out[26] = tab[11];
    out[ 6] = tab[12];
    out[22] = tab[13];
    out[14] = tab[14];
    out[30] = tab[15];
672

673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700
    ADD(24, 28);
    ADD(28, 26);
    ADD(26, 30);
    ADD(30, 25);
    ADD(25, 29);
    ADD(29, 27);
    ADD(27, 31);

    out[ 1] = tab[16] + tab[24];
    out[17] = tab[17] + tab[25];
    out[ 9] = tab[18] + tab[26];
    out[25] = tab[19] + tab[27];
    out[ 5] = tab[20] + tab[28];
    out[21] = tab[21] + tab[29];
    out[13] = tab[22] + tab[30];
    out[29] = tab[23] + tab[31];
    out[ 3] = tab[24] + tab[20];
    out[19] = tab[25] + tab[21];
    out[11] = tab[26] + tab[22];
    out[27] = tab[27] + tab[23];
    out[ 7] = tab[28] + tab[18];
    out[23] = tab[29] + tab[19];
    out[15] = tab[30] + tab[17];
    out[31] = tab[31];
}

#if FRAC_BITS <= 15

701
static inline int round_sample(int *sum)
702 703
{
    int sum1;
704 705
    sum1 = (*sum) >> OUT_SHIFT;
    *sum &= (1<<OUT_SHIFT)-1;
706 707 708 709
    if (sum1 < OUT_MIN)
        sum1 = OUT_MIN;
    else if (sum1 > OUT_MAX)
        sum1 = OUT_MAX;
710
    return sum1;
711 712
}

L
Luca Barbato 已提交
713 714
/* signed 16x16 -> 32 multiply add accumulate */
#define MACS(rt, ra, rb) MAC16(rt, ra, rb)
S
Siarhei Siamashka 已提交
715

L
Luca Barbato 已提交
716 717
/* signed 16x16 -> 32 multiply */
#define MULS(ra, rb) MUL16(ra, rb)
718

719 720
#else

721
static inline int round_sample(int64_t *sum)
722 723
{
    int sum1;
724 725
    sum1 = (int)((*sum) >> OUT_SHIFT);
    *sum &= (1<<OUT_SHIFT)-1;
726 727 728 729
    if (sum1 < OUT_MIN)
        sum1 = OUT_MIN;
    else if (sum1 > OUT_MAX)
        sum1 = OUT_MAX;
730
    return sum1;
731 732
}

733
#   define MULS(ra, rb) MUL64(ra, rb)
734 735 736
#endif

#define SUM8(sum, op, w, p) \
737
{                                               \
738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774
    sum op MULS((w)[0 * 64], p[0 * 64]);\
    sum op MULS((w)[1 * 64], p[1 * 64]);\
    sum op MULS((w)[2 * 64], p[2 * 64]);\
    sum op MULS((w)[3 * 64], p[3 * 64]);\
    sum op MULS((w)[4 * 64], p[4 * 64]);\
    sum op MULS((w)[5 * 64], p[5 * 64]);\
    sum op MULS((w)[6 * 64], p[6 * 64]);\
    sum op MULS((w)[7 * 64], p[7 * 64]);\
}

#define SUM8P2(sum1, op1, sum2, op2, w1, w2, p) \
{                                               \
    int tmp;\
    tmp = p[0 * 64];\
    sum1 op1 MULS((w1)[0 * 64], tmp);\
    sum2 op2 MULS((w2)[0 * 64], tmp);\
    tmp = p[1 * 64];\
    sum1 op1 MULS((w1)[1 * 64], tmp);\
    sum2 op2 MULS((w2)[1 * 64], tmp);\
    tmp = p[2 * 64];\
    sum1 op1 MULS((w1)[2 * 64], tmp);\
    sum2 op2 MULS((w2)[2 * 64], tmp);\
    tmp = p[3 * 64];\
    sum1 op1 MULS((w1)[3 * 64], tmp);\
    sum2 op2 MULS((w2)[3 * 64], tmp);\
    tmp = p[4 * 64];\
    sum1 op1 MULS((w1)[4 * 64], tmp);\
    sum2 op2 MULS((w2)[4 * 64], tmp);\
    tmp = p[5 * 64];\
    sum1 op1 MULS((w1)[5 * 64], tmp);\
    sum2 op2 MULS((w2)[5 * 64], tmp);\
    tmp = p[6 * 64];\
    sum1 op1 MULS((w1)[6 * 64], tmp);\
    sum2 op2 MULS((w2)[6 * 64], tmp);\
    tmp = p[7 * 64];\
    sum1 op1 MULS((w1)[7 * 64], tmp);\
    sum2 op2 MULS((w2)[7 * 64], tmp);\
775 776
}

777 778 779 780 781 782 783
void ff_mpa_synth_init(MPA_INT *window)
{
    int i;

    /* max = 18760, max sum over all 16 coefs : 44736 */
    for(i=0;i<257;i++) {
        int v;
784
        v = ff_mpa_enwindow[i];
785 786 787 788 789 790 791 792
#if WFRAC_BITS < 16
        v = (v + (1 << (16 - WFRAC_BITS - 1))) >> (16 - WFRAC_BITS);
#endif
        window[i] = v;
        if ((i & 63) != 0)
            v = -v;
        if (i != 0)
            window[512 - i] = v;
793
    }
794
}
795 796 797 798

/* 32 sub band synthesis filter. Input: 32 sub band samples, Output:
   32 samples. */
/* XXX: optimize by avoiding ring buffer usage */
799
void ff_mpa_synth_filter(MPA_INT *synth_buf_ptr, int *synth_buf_offset,
800
                         MPA_INT *window, int *dither_state,
801
                         OUT_INT *samples, int incr,
802
                         int32_t sb_samples[SBLIMIT])
803
{
804
    int32_t tmp[32];
805
    register MPA_INT *synth_buf;
A
Alex Beregszaszi 已提交
806
    register const MPA_INT *w, *w2, *p;
807
    int j, offset, v;
808
    OUT_INT *samples2;
809
#if FRAC_BITS <= 15
810
    int sum, sum2;
811
#else
812
    int64_t sum, sum2;
813
#endif
814

815
    dct32(tmp, sb_samples);
816

817 818
    offset = *synth_buf_offset;
    synth_buf = synth_buf_ptr + offset;
819 820 821 822

    for(j=0;j<32;j++) {
        v = tmp[j];
#if FRAC_BITS <= 15
823 824
        /* NOTE: can cause a loss in precision if very high amplitude
           sound */
825 826 827 828 829 830 831 832 833 834
        if (v > 32767)
            v = 32767;
        else if (v < -32768)
            v = -32768;
#endif
        synth_buf[j] = v;
    }
    /* copy to avoid wrap */
    memcpy(synth_buf + 512, synth_buf, 32 * sizeof(MPA_INT));

835
    samples2 = samples + 31 * incr;
836
    w = window;
837 838
    w2 = window + 31;

839
    sum = *dither_state;
840 841 842 843
    p = synth_buf + 16;
    SUM8(sum, +=, w, p);
    p = synth_buf + 48;
    SUM8(sum, -=, w + 32, p);
844
    *samples = round_sample(&sum);
845
    samples += incr;
846 847
    w++;

848 849 850 851 852 853 854 855 856
    /* we calculate two samples at the same time to avoid one memory
       access per two sample */
    for(j=1;j<16;j++) {
        sum2 = 0;
        p = synth_buf + 16 + j;
        SUM8P2(sum, +=, sum2, -=, w, w2, p);
        p = synth_buf + 48 - j;
        SUM8P2(sum, -=, sum2, -=, w + 32, w2 + 32, p);

857
        *samples = round_sample(&sum);
858
        samples += incr;
859 860
        sum += sum2;
        *samples2 = round_sample(&sum);
861
        samples2 -= incr;
862
        w++;
863
        w2--;
864
    }
865

866 867
    p = synth_buf + 32;
    SUM8(sum, -=, w + 32, p);
868
    *samples = round_sample(&sum);
869
    *dither_state= sum;
870

871
    offset = (offset - 32) & 511;
872
    *synth_buf_offset = offset;
873 874
}

M
Michael Niedermayer 已提交
875 876 877 878 879 880 881 882 883 884 885 886 887 888
#define C3 FIXHR(0.86602540378443864676/2)

/* 0.5 / cos(pi*(2*i+1)/36) */
static const int icos36[9] = {
    FIXR(0.50190991877167369479),
    FIXR(0.51763809020504152469), //0
    FIXR(0.55168895948124587824),
    FIXR(0.61038729438072803416),
    FIXR(0.70710678118654752439), //1
    FIXR(0.87172339781054900991),
    FIXR(1.18310079157624925896),
    FIXR(1.93185165257813657349), //2
    FIXR(5.73685662283492756461),
};
889

M
Michael Niedermayer 已提交
890 891 892 893 894 895 896 897 898 899 900 901 902
/* 0.5 / cos(pi*(2*i+1)/36) */
static const int icos36h[9] = {
    FIXHR(0.50190991877167369479/2),
    FIXHR(0.51763809020504152469/2), //0
    FIXHR(0.55168895948124587824/2),
    FIXHR(0.61038729438072803416/2),
    FIXHR(0.70710678118654752439/2), //1
    FIXHR(0.87172339781054900991/2),
    FIXHR(1.18310079157624925896/4),
    FIXHR(1.93185165257813657349/4), //2
//    FIXHR(5.73685662283492756461),
};

903 904 905 906
/* 12 points IMDCT. We compute it "by hand" by factorizing obvious
   cases. */
static void imdct12(int *out, int *in)
{
M
Michael Niedermayer 已提交
907
    int in0, in1, in2, in3, in4, in5, t1, t2;
908 909 910 911 912 913 914

    in0= in[0*3];
    in1= in[1*3] + in[0*3];
    in2= in[2*3] + in[1*3];
    in3= in[3*3] + in[2*3];
    in4= in[4*3] + in[3*3];
    in5= in[5*3] + in[4*3];
M
Michael Niedermayer 已提交
915 916 917 918
    in5 += in3;
    in3 += in1;

    in2= MULH(2*in2, C3);
M
Michael Niedermayer 已提交
919
    in3= MULH(4*in3, C3);
920

M
Michael Niedermayer 已提交
921
    t1 = in0 - in4;
M
Michael Niedermayer 已提交
922
    t2 = MULH(2*(in1 - in5), icos36h[4]);
M
Michael Niedermayer 已提交
923

924
    out[ 7]=
M
Michael Niedermayer 已提交
925 926 927 928 929 930
    out[10]= t1 + t2;
    out[ 1]=
    out[ 4]= t1 - t2;

    in0 += in4>>1;
    in4 = in0 + in2;
M
Michael Niedermayer 已提交
931 932
    in5 += 2*in1;
    in1 = MULH(in5 + in3, icos36h[1]);
933
    out[ 8]=
M
Michael Niedermayer 已提交
934
    out[ 9]= in4 + in1;
M
Michael Niedermayer 已提交
935
    out[ 2]=
M
Michael Niedermayer 已提交
936
    out[ 3]= in4 - in1;
937

M
Michael Niedermayer 已提交
938
    in0 -= in2;
M
Michael Niedermayer 已提交
939
    in5 = MULH(2*(in5 - in3), icos36h[7]);
M
Michael Niedermayer 已提交
940
    out[ 0]=
M
Michael Niedermayer 已提交
941
    out[ 5]= in0 - in5;
M
Michael Niedermayer 已提交
942
    out[ 6]=
M
Michael Niedermayer 已提交
943
    out[11]= in0 + in5;
944 945 946
}

/* cos(pi*i/18) */
M
Michael Niedermayer 已提交
947 948 949 950 951 952 953 954 955
#define C1 FIXHR(0.98480775301220805936/2)
#define C2 FIXHR(0.93969262078590838405/2)
#define C3 FIXHR(0.86602540378443864676/2)
#define C4 FIXHR(0.76604444311897803520/2)
#define C5 FIXHR(0.64278760968653932632/2)
#define C6 FIXHR(0.5/2)
#define C7 FIXHR(0.34202014332566873304/2)
#define C8 FIXHR(0.17364817766693034885/2)

956 957

/* using Lee like decomposition followed by hand coded 9 points DCT */
M
Michael Niedermayer 已提交
958
static void imdct36(int *out, int *buf, int *in, int *win)
959 960 961 962 963 964 965 966 967 968 969 970
{
    int i, j, t0, t1, t2, t3, s0, s1, s2, s3;
    int tmp[18], *tmp1, *in1;

    for(i=17;i>=1;i--)
        in[i] += in[i-1];
    for(i=17;i>=3;i-=2)
        in[i] += in[i-2];

    for(j=0;j<2;j++) {
        tmp1 = tmp + j;
        in1 = in + j;
M
Michael Niedermayer 已提交
971 972 973 974
#if 0
//more accurate but slower
        int64_t t0, t1, t2, t3;
        t2 = in1[2*4] + in1[2*8] - in1[2*2];
975

M
Michael Niedermayer 已提交
976 977 978 979 980 981 982 983
        t3 = (in1[2*0] + (int64_t)(in1[2*6]>>1))<<32;
        t1 = in1[2*0] - in1[2*6];
        tmp1[ 6] = t1 - (t2>>1);
        tmp1[16] = t1 + t2;

        t0 = MUL64(2*(in1[2*2] + in1[2*4]),    C2);
        t1 = MUL64(   in1[2*4] - in1[2*8] , -2*C8);
        t2 = MUL64(2*(in1[2*2] + in1[2*8]),   -C4);
984

M
Michael Niedermayer 已提交
985 986 987
        tmp1[10] = (t3 - t0 - t2) >> 32;
        tmp1[ 2] = (t3 + t0 + t1) >> 32;
        tmp1[14] = (t3 + t2 - t1) >> 32;
988

M
Michael Niedermayer 已提交
989 990 991 992 993 994 995 996 997 998 999 1000
        tmp1[ 4] = MULH(2*(in1[2*5] + in1[2*7] - in1[2*1]), -C3);
        t2 = MUL64(2*(in1[2*1] + in1[2*5]),    C1);
        t3 = MUL64(   in1[2*5] - in1[2*7] , -2*C7);
        t0 = MUL64(2*in1[2*3], C3);

        t1 = MUL64(2*(in1[2*1] + in1[2*7]),   -C5);

        tmp1[ 0] = (t2 + t3 + t0) >> 32;
        tmp1[12] = (t2 + t1 - t0) >> 32;
        tmp1[ 8] = (t3 - t1 - t0) >> 32;
#else
        t2 = in1[2*4] + in1[2*8] - in1[2*2];
1001

M
Michael Niedermayer 已提交
1002 1003 1004 1005 1006 1007 1008 1009
        t3 = in1[2*0] + (in1[2*6]>>1);
        t1 = in1[2*0] - in1[2*6];
        tmp1[ 6] = t1 - (t2>>1);
        tmp1[16] = t1 + t2;

        t0 = MULH(2*(in1[2*2] + in1[2*4]),    C2);
        t1 = MULH(   in1[2*4] - in1[2*8] , -2*C8);
        t2 = MULH(2*(in1[2*2] + in1[2*8]),   -C4);
1010

M
Michael Niedermayer 已提交
1011 1012 1013
        tmp1[10] = t3 - t0 - t2;
        tmp1[ 2] = t3 + t0 + t1;
        tmp1[14] = t3 + t2 - t1;
1014

M
Michael Niedermayer 已提交
1015 1016 1017 1018
        tmp1[ 4] = MULH(2*(in1[2*5] + in1[2*7] - in1[2*1]), -C3);
        t2 = MULH(2*(in1[2*1] + in1[2*5]),    C1);
        t3 = MULH(   in1[2*5] - in1[2*7] , -2*C7);
        t0 = MULH(2*in1[2*3], C3);
1019

M
Michael Niedermayer 已提交
1020 1021 1022 1023 1024 1025
        t1 = MULH(2*(in1[2*1] + in1[2*7]),   -C5);

        tmp1[ 0] = t2 + t3 + t0;
        tmp1[12] = t2 + t1 - t0;
        tmp1[ 8] = t3 - t1 - t0;
#endif
1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036
    }

    i = 0;
    for(j=0;j<4;j++) {
        t0 = tmp[i];
        t1 = tmp[i + 2];
        s0 = t1 + t0;
        s2 = t1 - t0;

        t2 = tmp[i + 1];
        t3 = tmp[i + 3];
M
Michael Niedermayer 已提交
1037
        s1 = MULH(2*(t3 + t2), icos36h[j]);
1038
        s3 = MULL(t3 - t2, icos36[8 - j]);
1039

1040 1041
        t0 = s0 + s1;
        t1 = s0 - s1;
M
Michael Niedermayer 已提交
1042
        out[(9 + j)*SBLIMIT] =  MULH(t1, win[9 + j]) + buf[9 + j];
M
Michael Niedermayer 已提交
1043 1044 1045
        out[(8 - j)*SBLIMIT] =  MULH(t1, win[8 - j]) + buf[8 - j];
        buf[9 + j] = MULH(t0, win[18 + 9 + j]);
        buf[8 - j] = MULH(t0, win[18 + 8 - j]);
1046

1047 1048
        t0 = s2 + s3;
        t1 = s2 - s3;
M
Michael Niedermayer 已提交
1049
        out[(9 + 8 - j)*SBLIMIT] =  MULH(t1, win[9 + 8 - j]) + buf[9 + 8 - j];
M
Michael Niedermayer 已提交
1050 1051 1052
        out[(        j)*SBLIMIT] =  MULH(t1, win[        j]) + buf[        j];
        buf[9 + 8 - j] = MULH(t0, win[18 + 9 + 8 - j]);
        buf[      + j] = MULH(t0, win[18         + j]);
1053 1054 1055 1056
        i += 4;
    }

    s0 = tmp[16];
M
Michael Niedermayer 已提交
1057
    s1 = MULH(2*tmp[17], icos36h[4]);
1058 1059
    t0 = s0 + s1;
    t1 = s0 - s1;
M
Michael Niedermayer 已提交
1060
    out[(9 + 4)*SBLIMIT] =  MULH(t1, win[9 + 4]) + buf[9 + 4];
M
Michael Niedermayer 已提交
1061 1062 1063
    out[(8 - 4)*SBLIMIT] =  MULH(t1, win[8 - 4]) + buf[8 - 4];
    buf[9 + 4] = MULH(t0, win[18 + 9 + 4]);
    buf[8 - 4] = MULH(t0, win[18 + 8 - 4]);
1064 1065 1066 1067
}

/* return the number of decoded frames */
static int mp_decode_layer1(MPADecodeContext *s)
F
Fabrice Bellard 已提交
1068
{
1069
    int bound, i, v, n, ch, j, mant;
1070 1071
    uint8_t allocation[MPA_MAX_CHANNELS][SBLIMIT];
    uint8_t scale_factors[MPA_MAX_CHANNELS][SBLIMIT];
1072

1073
    if (s->mode == MPA_JSTEREO)
1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100
        bound = (s->mode_ext + 1) * 4;
    else
        bound = SBLIMIT;

    /* allocation bits */
    for(i=0;i<bound;i++) {
        for(ch=0;ch<s->nb_channels;ch++) {
            allocation[ch][i] = get_bits(&s->gb, 4);
        }
    }
    for(i=bound;i<SBLIMIT;i++) {
        allocation[0][i] = get_bits(&s->gb, 4);
    }

    /* scale factors */
    for(i=0;i<bound;i++) {
        for(ch=0;ch<s->nb_channels;ch++) {
            if (allocation[ch][i])
                scale_factors[ch][i] = get_bits(&s->gb, 6);
        }
    }
    for(i=bound;i<SBLIMIT;i++) {
        if (allocation[0][i]) {
            scale_factors[0][i] = get_bits(&s->gb, 6);
            scale_factors[1][i] = get_bits(&s->gb, 6);
        }
    }
1101

1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141
    /* compute samples */
    for(j=0;j<12;j++) {
        for(i=0;i<bound;i++) {
            for(ch=0;ch<s->nb_channels;ch++) {
                n = allocation[ch][i];
                if (n) {
                    mant = get_bits(&s->gb, n + 1);
                    v = l1_unscale(n, mant, scale_factors[ch][i]);
                } else {
                    v = 0;
                }
                s->sb_samples[ch][j][i] = v;
            }
        }
        for(i=bound;i<SBLIMIT;i++) {
            n = allocation[0][i];
            if (n) {
                mant = get_bits(&s->gb, n + 1);
                v = l1_unscale(n, mant, scale_factors[0][i]);
                s->sb_samples[0][j][i] = v;
                v = l1_unscale(n, mant, scale_factors[1][i]);
                s->sb_samples[1][j][i] = v;
            } else {
                s->sb_samples[0][j][i] = 0;
                s->sb_samples[1][j][i] = 0;
            }
        }
    }
    return 12;
}

static int mp_decode_layer2(MPADecodeContext *s)
{
    int sblimit; /* number of used subbands */
    const unsigned char *alloc_table;
    int table, bit_alloc_bits, i, j, ch, bound, v;
    unsigned char bit_alloc[MPA_MAX_CHANNELS][SBLIMIT];
    unsigned char scale_code[MPA_MAX_CHANNELS][SBLIMIT];
    unsigned char scale_factors[MPA_MAX_CHANNELS][SBLIMIT][3], *sf;
    int scale, qindex, bits, steps, k, l, m, b;
F
Fabrice Bellard 已提交
1142

1143
    /* select decoding table */
1144
    table = ff_mpa_l2_select_table(s->bit_rate / 1000, s->nb_channels,
1145
                            s->sample_rate, s->lsf);
1146 1147
    sblimit = ff_mpa_sblimit_table[table];
    alloc_table = ff_mpa_alloc_tables[table];
1148

1149
    if (s->mode == MPA_JSTEREO)
1150 1151 1152 1153
        bound = (s->mode_ext + 1) * 4;
    else
        bound = sblimit;

M
Michel Bardiaux 已提交
1154
    dprintf(s->avctx, "bound=%d sblimit=%d\n", bound, sblimit);
1155 1156 1157 1158

    /* sanity check */
    if( bound > sblimit ) bound = sblimit;

1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173
    /* parse bit allocation */
    j = 0;
    for(i=0;i<bound;i++) {
        bit_alloc_bits = alloc_table[j];
        for(ch=0;ch<s->nb_channels;ch++) {
            bit_alloc[ch][i] = get_bits(&s->gb, bit_alloc_bits);
        }
        j += 1 << bit_alloc_bits;
    }
    for(i=bound;i<sblimit;i++) {
        bit_alloc_bits = alloc_table[j];
        v = get_bits(&s->gb, bit_alloc_bits);
        bit_alloc[0][i] = v;
        bit_alloc[1][i] = v;
        j += 1 << bit_alloc_bits;
F
Fabrice Bellard 已提交
1174
    }
1175 1176 1177 1178 1179

#ifdef DEBUG
    {
        for(ch=0;ch<s->nb_channels;ch++) {
            for(i=0;i<sblimit;i++)
M
Michel Bardiaux 已提交
1180 1181
                dprintf(s->avctx, " %d", bit_alloc[ch][i]);
            dprintf(s->avctx, "\n");
1182 1183 1184 1185 1186 1187 1188
        }
    }
#endif

    /* scale codes */
    for(i=0;i<sblimit;i++) {
        for(ch=0;ch<s->nb_channels;ch++) {
1189
            if (bit_alloc[ch][i])
1190 1191 1192
                scale_code[ch][i] = get_bits(&s->gb, 2);
        }
    }
1193

1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230
    /* scale factors */
    for(i=0;i<sblimit;i++) {
        for(ch=0;ch<s->nb_channels;ch++) {
            if (bit_alloc[ch][i]) {
                sf = scale_factors[ch][i];
                switch(scale_code[ch][i]) {
                default:
                case 0:
                    sf[0] = get_bits(&s->gb, 6);
                    sf[1] = get_bits(&s->gb, 6);
                    sf[2] = get_bits(&s->gb, 6);
                    break;
                case 2:
                    sf[0] = get_bits(&s->gb, 6);
                    sf[1] = sf[0];
                    sf[2] = sf[0];
                    break;
                case 1:
                    sf[0] = get_bits(&s->gb, 6);
                    sf[2] = get_bits(&s->gb, 6);
                    sf[1] = sf[0];
                    break;
                case 3:
                    sf[0] = get_bits(&s->gb, 6);
                    sf[2] = get_bits(&s->gb, 6);
                    sf[1] = sf[2];
                    break;
                }
            }
        }
    }

#ifdef DEBUG
    for(ch=0;ch<s->nb_channels;ch++) {
        for(i=0;i<sblimit;i++) {
            if (bit_alloc[ch][i]) {
                sf = scale_factors[ch][i];
M
Michel Bardiaux 已提交
1231
                dprintf(s->avctx, " %d %d %d", sf[0], sf[1], sf[2]);
1232
            } else {
M
Michel Bardiaux 已提交
1233
                dprintf(s->avctx, " -");
1234 1235
            }
        }
M
Michel Bardiaux 已提交
1236
        dprintf(s->avctx, "\n");
1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250
    }
#endif

    /* samples */
    for(k=0;k<3;k++) {
        for(l=0;l<12;l+=3) {
            j = 0;
            for(i=0;i<bound;i++) {
                bit_alloc_bits = alloc_table[j];
                for(ch=0;ch<s->nb_channels;ch++) {
                    b = bit_alloc[ch][i];
                    if (b) {
                        scale = scale_factors[ch][i][k];
                        qindex = alloc_table[j+b];
1251
                        bits = ff_mpa_quant_bits[qindex];
1252 1253 1254
                        if (bits < 0) {
                            /* 3 values at the same time */
                            v = get_bits(&s->gb, -bits);
1255
                            steps = ff_mpa_quant_steps[qindex];
1256
                            s->sb_samples[ch][k * 12 + l + 0][i] =
1257 1258
                                l2_unscale_group(steps, v % steps, scale);
                            v = v / steps;
1259
                            s->sb_samples[ch][k * 12 + l + 1][i] =
1260 1261
                                l2_unscale_group(steps, v % steps, scale);
                            v = v / steps;
1262
                            s->sb_samples[ch][k * 12 + l + 2][i] =
1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277
                                l2_unscale_group(steps, v, scale);
                        } else {
                            for(m=0;m<3;m++) {
                                v = get_bits(&s->gb, bits);
                                v = l1_unscale(bits - 1, v, scale);
                                s->sb_samples[ch][k * 12 + l + m][i] = v;
                            }
                        }
                    } else {
                        s->sb_samples[ch][k * 12 + l + 0][i] = 0;
                        s->sb_samples[ch][k * 12 + l + 1][i] = 0;
                        s->sb_samples[ch][k * 12 + l + 2][i] = 0;
                    }
                }
                /* next subband in alloc table */
1278
                j += 1 << bit_alloc_bits;
1279 1280 1281 1282 1283 1284 1285 1286 1287 1288
            }
            /* XXX: find a way to avoid this duplication of code */
            for(i=bound;i<sblimit;i++) {
                bit_alloc_bits = alloc_table[j];
                b = bit_alloc[0][i];
                if (b) {
                    int mant, scale0, scale1;
                    scale0 = scale_factors[0][i][k];
                    scale1 = scale_factors[1][i][k];
                    qindex = alloc_table[j+b];
1289
                    bits = ff_mpa_quant_bits[qindex];
1290 1291 1292
                    if (bits < 0) {
                        /* 3 values at the same time */
                        v = get_bits(&s->gb, -bits);
1293
                        steps = ff_mpa_quant_steps[qindex];
1294 1295
                        mant = v % steps;
                        v = v / steps;
1296
                        s->sb_samples[0][k * 12 + l + 0][i] =
1297
                            l2_unscale_group(steps, mant, scale0);
1298
                        s->sb_samples[1][k * 12 + l + 0][i] =
1299 1300 1301
                            l2_unscale_group(steps, mant, scale1);
                        mant = v % steps;
                        v = v / steps;
1302
                        s->sb_samples[0][k * 12 + l + 1][i] =
1303
                            l2_unscale_group(steps, mant, scale0);
1304
                        s->sb_samples[1][k * 12 + l + 1][i] =
1305
                            l2_unscale_group(steps, mant, scale1);
1306
                        s->sb_samples[0][k * 12 + l + 2][i] =
1307
                            l2_unscale_group(steps, v, scale0);
1308
                        s->sb_samples[1][k * 12 + l + 2][i] =
1309 1310 1311 1312
                            l2_unscale_group(steps, v, scale1);
                    } else {
                        for(m=0;m<3;m++) {
                            mant = get_bits(&s->gb, bits);
1313
                            s->sb_samples[0][k * 12 + l + m][i] =
1314
                                l1_unscale(bits - 1, mant, scale0);
1315
                            s->sb_samples[1][k * 12 + l + m][i] =
1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327
                                l1_unscale(bits - 1, mant, scale1);
                        }
                    }
                } else {
                    s->sb_samples[0][k * 12 + l + 0][i] = 0;
                    s->sb_samples[0][k * 12 + l + 1][i] = 0;
                    s->sb_samples[0][k * 12 + l + 2][i] = 0;
                    s->sb_samples[1][k * 12 + l + 0][i] = 0;
                    s->sb_samples[1][k * 12 + l + 1][i] = 0;
                    s->sb_samples[1][k * 12 + l + 2][i] = 0;
                }
                /* next subband in alloc table */
1328
                j += 1 << bit_alloc_bits;
1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340
            }
            /* fill remaining samples to zero */
            for(i=sblimit;i<SBLIMIT;i++) {
                for(ch=0;ch<s->nb_channels;ch++) {
                    s->sb_samples[ch][k * 12 + l + 0][i] = 0;
                    s->sb_samples[ch][k * 12 + l + 1][i] = 0;
                    s->sb_samples[ch][k * 12 + l + 2][i] = 0;
                }
            }
        }
    }
    return 3 * 12;
F
Fabrice Bellard 已提交
1341 1342
}

1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362
static inline void lsf_sf_expand(int *slen,
                                 int sf, int n1, int n2, int n3)
{
    if (n3) {
        slen[3] = sf % n3;
        sf /= n3;
    } else {
        slen[3] = 0;
    }
    if (n2) {
        slen[2] = sf % n2;
        sf /= n2;
    } else {
        slen[2] = 0;
    }
    slen[1] = sf % n1;
    sf /= n1;
    slen[0] = sf;
}

1363
static void exponents_from_scale_factors(MPADecodeContext *s,
1364
                                         GranuleDef *g,
1365
                                         int16_t *exponents)
1366
{
1367
    const uint8_t *bstab, *pretab;
1368
    int len, i, j, k, l, v0, shift, gain, gains[3];
1369
    int16_t *exp_ptr;
1370 1371 1372 1373 1374 1375 1376 1377

    exp_ptr = exponents;
    gain = g->global_gain - 210;
    shift = g->scalefac_scale + 1;

    bstab = band_size_long[s->sample_rate_index];
    pretab = mpa_pretab[g->preflag];
    for(i=0;i<g->long_end;i++) {
1378
        v0 = gain - ((g->scale_factors[i] + pretab[i]) << shift) + 400;
1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392
        len = bstab[i];
        for(j=len;j>0;j--)
            *exp_ptr++ = v0;
    }

    if (g->short_start < 13) {
        bstab = band_size_short[s->sample_rate_index];
        gains[0] = gain - (g->subblock_gain[0] << 3);
        gains[1] = gain - (g->subblock_gain[1] << 3);
        gains[2] = gain - (g->subblock_gain[2] << 3);
        k = g->long_end;
        for(i=g->short_start;i<13;i++) {
            len = bstab[i];
            for(l=0;l<3;l++) {
1393
                v0 = gains[l] - (g->scale_factors[k++] << shift) + 400;
1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409
                for(j=len;j>0;j--)
                *exp_ptr++ = v0;
            }
        }
    }
}

/* handle n = 0 too */
static inline int get_bitsz(GetBitContext *s, int n)
{
    if (n == 0)
        return 0;
    else
        return get_bits(s, n);
}

M
Michael Niedermayer 已提交
1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422

static void switch_buffer(MPADecodeContext *s, int *pos, int *end_pos, int *end_pos2){
    if(s->in_gb.buffer && *pos >= s->gb.size_in_bits){
        s->gb= s->in_gb;
        s->in_gb.buffer=NULL;
        assert((get_bits_count(&s->gb) & 7) == 0);
        skip_bits_long(&s->gb, *pos - *end_pos);
        *end_pos2=
        *end_pos= *end_pos2 + get_bits_count(&s->gb) - *pos;
        *pos= get_bits_count(&s->gb);
    }
}

1423
static int huffman_decode(MPADecodeContext *s, GranuleDef *g,
1424
                          int16_t *exponents, int end_pos2)
1425 1426
{
    int s_index;
1427
    int i;
1428
    int last_pos, bits_left;
1429
    VLC *vlc;
1430
    int end_pos= FFMIN(end_pos2, s->gb.size_in_bits);
1431 1432 1433 1434

    /* low frequencies (called big values) */
    s_index = 0;
    for(i=0;i<3;i++) {
1435
        int j, k, l, linbits;
1436 1437 1438 1439 1440 1441 1442 1443 1444
        j = g->region_size[i];
        if (j == 0)
            continue;
        /* select vlc table */
        k = g->table_select[i];
        l = mpa_huff_data[k][0];
        linbits = mpa_huff_data[k][1];
        vlc = &huff_vlc[l];

1445
        if(!l){
1446
            memset(&g->sb_hybrid[s_index], 0, sizeof(*g->sb_hybrid)*2*j);
1447 1448 1449 1450
            s_index += 2*j;
            continue;
        }

1451 1452
        /* read huffcode and compute each couple */
        for(;j>0;j--) {
1453
            int exponent, x, y, v;
1454 1455 1456 1457
            int pos= get_bits_count(&s->gb);

            if (pos >= end_pos){
//                av_log(NULL, AV_LOG_ERROR, "pos: %d %d %d %d\n", pos, end_pos, end_pos2, s_index);
M
Michael Niedermayer 已提交
1458
                switch_buffer(s, &pos, &end_pos, &end_pos2);
1459 1460 1461 1462
//                av_log(NULL, AV_LOG_ERROR, "new pos: %d %d\n", pos, end_pos);
                if(pos >= end_pos)
                    break;
            }
1463
            y = get_vlc2(&s->gb, vlc->table, 7, 3);
1464 1465 1466 1467 1468 1469 1470 1471

            if(!y){
                g->sb_hybrid[s_index  ] =
                g->sb_hybrid[s_index+1] = 0;
                s_index += 2;
                continue;
            }

1472
            exponent= exponents[s_index];
1473

M
Michel Bardiaux 已提交
1474
            dprintf(s->avctx, "region=%d n=%d x=%d y=%d exp=%d\n",
1475
                    i, g->region_size[i] - j, x, y, exponent);
M
Michael Niedermayer 已提交
1476 1477 1478
            if(y&16){
                x = y >> 5;
                y = y & 0x0f;
1479
                if (x < 15){
1480 1481
                    v = expval_table[ exponent ][ x ];
//                      v = expval_table[ (exponent&3) ][ x ] >> FFMIN(0 - (exponent>>2), 31);
1482 1483
                }else{
                    x += get_bitsz(&s->gb, linbits);
1484
                    v = l3_unscale(x, exponent);
1485
                }
1486 1487
                if (get_bits1(&s->gb))
                    v = -v;
M
Michael Niedermayer 已提交
1488
                g->sb_hybrid[s_index] = v;
1489
                if (y < 15){
1490
                    v = expval_table[ exponent ][ y ];
1491 1492
                }else{
                    y += get_bitsz(&s->gb, linbits);
1493
                    v = l3_unscale(y, exponent);
1494
                }
1495 1496
                if (get_bits1(&s->gb))
                    v = -v;
M
Michael Niedermayer 已提交
1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510
                g->sb_hybrid[s_index+1] = v;
            }else{
                x = y >> 5;
                y = y & 0x0f;
                x += y;
                if (x < 15){
                    v = expval_table[ exponent ][ x ];
                }else{
                    x += get_bitsz(&s->gb, linbits);
                    v = l3_unscale(x, exponent);
                }
                if (get_bits1(&s->gb))
                    v = -v;
                g->sb_hybrid[s_index+!!y] = v;
M
Michael Niedermayer 已提交
1511
                g->sb_hybrid[s_index+ !y] = 0;
1512
            }
M
Michael Niedermayer 已提交
1513
            s_index+=2;
1514 1515
        }
    }
1516

1517 1518
    /* high frequencies */
    vlc = &huff_quad_vlc[g->count1table_select];
1519
    last_pos=0;
1520
    while (s_index <= 572) {
1521
        int pos, code;
1522 1523
        pos = get_bits_count(&s->gb);
        if (pos >= end_pos) {
M
Michael Niedermayer 已提交
1524 1525 1526 1527 1528 1529
            if (pos > end_pos2 && last_pos){
                /* some encoders generate an incorrect size for this
                   part. We must go back into the data */
                s_index -= 4;
                skip_bits_long(&s->gb, last_pos - pos);
                av_log(NULL, AV_LOG_INFO, "overread, skip %d enddists: %d %d\n", last_pos - pos, end_pos-pos, end_pos2-pos);
1530 1531
                if(s->error_resilience >= FF_ER_COMPLIANT)
                    s_index=0;
M
Michael Niedermayer 已提交
1532 1533
                break;
            }
1534
//                av_log(NULL, AV_LOG_ERROR, "pos2: %d %d %d %d\n", pos, end_pos, end_pos2, s_index);
M
Michael Niedermayer 已提交
1535
            switch_buffer(s, &pos, &end_pos, &end_pos2);
1536 1537 1538
//                av_log(NULL, AV_LOG_ERROR, "new pos2: %d %d %d\n", pos, end_pos, s_index);
            if(pos >= end_pos)
                break;
1539
        }
1540
        last_pos= pos;
1541

1542
        code = get_vlc2(&s->gb, vlc->table, vlc->bits, 1);
M
Michel Bardiaux 已提交
1543
        dprintf(s->avctx, "t=%d code=%d\n", g->count1table_select, code);
1544 1545 1546 1547 1548
        g->sb_hybrid[s_index+0]=
        g->sb_hybrid[s_index+1]=
        g->sb_hybrid[s_index+2]=
        g->sb_hybrid[s_index+3]= 0;
        while(code){
1549
            static const int idxtab[16]={3,3,2,2,1,1,1,1,0,0,0,0,0,0,0,0};
1550
            int v;
1551 1552
            int pos= s_index+idxtab[code];
            code ^= 8>>idxtab[code];
1553 1554
            v = exp_table[ exponents[pos] ];
//            v = exp_table[ (exponents[pos]&3) ] >> FFMIN(0 - (exponents[pos]>>2), 31);
1555 1556 1557
            if(get_bits1(&s->gb))
                v = -v;
            g->sb_hybrid[pos] = v;
1558
        }
1559
        s_index+=4;
1560
    }
1561
    /* skip extension bits */
1562
    bits_left = end_pos2 - get_bits_count(&s->gb);
1563
//av_log(NULL, AV_LOG_ERROR, "left:%d buf:%p\n", bits_left, s->in_gb.buffer);
1564
    if (bits_left < 0/* || bits_left > 500*/) {
1565
        av_log(NULL, AV_LOG_ERROR, "bits_left=%d\n", bits_left);
1566 1567 1568 1569
        s_index=0;
    }else if(bits_left > 0 && s->error_resilience >= FF_ER_AGGRESSIVE){
        av_log(NULL, AV_LOG_ERROR, "bits_left=%d\n", bits_left);
        s_index=0;
1570
    }
1571
    memset(&g->sb_hybrid[s_index], 0, sizeof(*g->sb_hybrid)*(576 - s_index));
1572 1573
    skip_bits_long(&s->gb, bits_left);

1574
    i= get_bits_count(&s->gb);
M
Michael Niedermayer 已提交
1575
    switch_buffer(s, &i, &end_pos, &end_pos2);
1576

F
Fabrice Bellard 已提交
1577 1578 1579
    return 0;
}

1580 1581 1582 1583 1584
/* Reorder short blocks from bitstream order to interleaved order. It
   would be faster to do it in parsing, but the code would be far more
   complicated */
static void reorder_block(MPADecodeContext *s, GranuleDef *g)
{
1585
    int i, j, len;
1586 1587
    int32_t *ptr, *dst, *ptr1;
    int32_t tmp[576];
1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600

    if (g->block_type != 2)
        return;

    if (g->switch_point) {
        if (s->sample_rate_index != 8) {
            ptr = g->sb_hybrid + 36;
        } else {
            ptr = g->sb_hybrid + 48;
        }
    } else {
        ptr = g->sb_hybrid;
    }
1601

1602 1603 1604
    for(i=g->short_start;i<13;i++) {
        len = band_size_short[s->sample_rate_index][i];
        ptr1 = ptr;
1605 1606 1607 1608 1609 1610
        dst = tmp;
        for(j=len;j>0;j--) {
            *dst++ = ptr[0*len];
            *dst++ = ptr[1*len];
            *dst++ = ptr[2*len];
            ptr++;
1611
        }
1612 1613
        ptr+=2*len;
        memcpy(ptr1, tmp, len * 3 * sizeof(*ptr1));
1614 1615 1616 1617 1618 1619 1620 1621 1622
    }
}

#define ISQRT2 FIXR(0.70710678118654752440)

static void compute_stereo(MPADecodeContext *s,
                           GranuleDef *g0, GranuleDef *g1)
{
    int i, j, k, l;
1623
    int32_t v1, v2;
1624
    int sf_max, tmp0, tmp1, sf, len, non_zero_found;
1625 1626
    int32_t (*is_tab)[16];
    int32_t *tab0, *tab1;
1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637
    int non_zero_found_short[3];

    /* intensity stereo */
    if (s->mode_ext & MODE_EXT_I_STEREO) {
        if (!s->lsf) {
            is_tab = is_table;
            sf_max = 7;
        } else {
            is_tab = is_table_lsf[g1->scalefac_compress & 1];
            sf_max = 16;
        }
1638

1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688
        tab0 = g0->sb_hybrid + 576;
        tab1 = g1->sb_hybrid + 576;

        non_zero_found_short[0] = 0;
        non_zero_found_short[1] = 0;
        non_zero_found_short[2] = 0;
        k = (13 - g1->short_start) * 3 + g1->long_end - 3;
        for(i = 12;i >= g1->short_start;i--) {
            /* for last band, use previous scale factor */
            if (i != 11)
                k -= 3;
            len = band_size_short[s->sample_rate_index][i];
            for(l=2;l>=0;l--) {
                tab0 -= len;
                tab1 -= len;
                if (!non_zero_found_short[l]) {
                    /* test if non zero band. if so, stop doing i-stereo */
                    for(j=0;j<len;j++) {
                        if (tab1[j] != 0) {
                            non_zero_found_short[l] = 1;
                            goto found1;
                        }
                    }
                    sf = g1->scale_factors[k + l];
                    if (sf >= sf_max)
                        goto found1;

                    v1 = is_tab[0][sf];
                    v2 = is_tab[1][sf];
                    for(j=0;j<len;j++) {
                        tmp0 = tab0[j];
                        tab0[j] = MULL(tmp0, v1);
                        tab1[j] = MULL(tmp0, v2);
                    }
                } else {
                found1:
                    if (s->mode_ext & MODE_EXT_MS_STEREO) {
                        /* lower part of the spectrum : do ms stereo
                           if enabled */
                        for(j=0;j<len;j++) {
                            tmp0 = tab0[j];
                            tmp1 = tab1[j];
                            tab0[j] = MULL(tmp0 + tmp1, ISQRT2);
                            tab1[j] = MULL(tmp0 - tmp1, ISQRT2);
                        }
                    }
                }
            }
        }

1689 1690
        non_zero_found = non_zero_found_short[0] |
            non_zero_found_short[1] |
1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745
            non_zero_found_short[2];

        for(i = g1->long_end - 1;i >= 0;i--) {
            len = band_size_long[s->sample_rate_index][i];
            tab0 -= len;
            tab1 -= len;
            /* test if non zero band. if so, stop doing i-stereo */
            if (!non_zero_found) {
                for(j=0;j<len;j++) {
                    if (tab1[j] != 0) {
                        non_zero_found = 1;
                        goto found2;
                    }
                }
                /* for last band, use previous scale factor */
                k = (i == 21) ? 20 : i;
                sf = g1->scale_factors[k];
                if (sf >= sf_max)
                    goto found2;
                v1 = is_tab[0][sf];
                v2 = is_tab[1][sf];
                for(j=0;j<len;j++) {
                    tmp0 = tab0[j];
                    tab0[j] = MULL(tmp0, v1);
                    tab1[j] = MULL(tmp0, v2);
                }
            } else {
            found2:
                if (s->mode_ext & MODE_EXT_MS_STEREO) {
                    /* lower part of the spectrum : do ms stereo
                       if enabled */
                    for(j=0;j<len;j++) {
                        tmp0 = tab0[j];
                        tmp1 = tab1[j];
                        tab0[j] = MULL(tmp0 + tmp1, ISQRT2);
                        tab1[j] = MULL(tmp0 - tmp1, ISQRT2);
                    }
                }
            }
        }
    } else if (s->mode_ext & MODE_EXT_MS_STEREO) {
        /* ms stereo ONLY */
        /* NOTE: the 1/sqrt(2) normalization factor is included in the
           global gain */
        tab0 = g0->sb_hybrid;
        tab1 = g1->sb_hybrid;
        for(i=0;i<576;i++) {
            tmp0 = tab0[i];
            tmp1 = tab1[i];
            tab0[i] = tmp0 + tmp1;
            tab1[i] = tmp0 - tmp1;
        }
    }
}

1746
static void compute_antialias_integer(MPADecodeContext *s,
1747 1748
                              GranuleDef *g)
{
M
Michael Niedermayer 已提交
1749 1750
    int32_t *ptr, *csa;
    int n, i;
1751 1752 1753 1754 1755 1756 1757 1758 1759 1760

    /* we antialias only "long" bands */
    if (g->block_type == 2) {
        if (!g->switch_point)
            return;
        /* XXX: check this for 8000Hz case */
        n = 1;
    } else {
        n = SBLIMIT - 1;
    }
1761

1762 1763
    ptr = g->sb_hybrid + 18;
    for(i = n;i > 0;i--) {
M
Michael Niedermayer 已提交
1764 1765 1766
        int tmp0, tmp1, tmp2;
        csa = &csa_table[0][0];
#define INT_AA(j) \
1767 1768
            tmp0 = ptr[-1-j];\
            tmp1 = ptr[   j];\
M
Michael Niedermayer 已提交
1769
            tmp2= MULH(tmp0 + tmp1, csa[0+4*j]);\
1770 1771
            ptr[-1-j] = 4*(tmp2 - MULH(tmp1, csa[2+4*j]));\
            ptr[   j] = 4*(tmp2 + MULH(tmp0, csa[3+4*j]));
M
Michael Niedermayer 已提交
1772 1773 1774 1775 1776 1777 1778 1779 1780

        INT_AA(0)
        INT_AA(1)
        INT_AA(2)
        INT_AA(3)
        INT_AA(4)
        INT_AA(5)
        INT_AA(6)
        INT_AA(7)
1781 1782

        ptr += 18;
1783 1784 1785 1786 1787 1788
    }
}

static void compute_antialias_float(MPADecodeContext *s,
                              GranuleDef *g)
{
M
Michael Niedermayer 已提交
1789 1790
    int32_t *ptr;
    int n, i;
1791 1792 1793 1794 1795 1796 1797 1798 1799 1800

    /* we antialias only "long" bands */
    if (g->block_type == 2) {
        if (!g->switch_point)
            return;
        /* XXX: check this for 8000Hz case */
        n = 1;
    } else {
        n = SBLIMIT - 1;
    }
1801

1802 1803
    ptr = g->sb_hybrid + 18;
    for(i = n;i > 0;i--) {
M
Michael Niedermayer 已提交
1804
        float tmp0, tmp1;
1805
        float *csa = &csa_table_float[0][0];
M
Michael Niedermayer 已提交
1806 1807 1808 1809 1810
#define FLOAT_AA(j)\
        tmp0= ptr[-1-j];\
        tmp1= ptr[   j];\
        ptr[-1-j] = lrintf(tmp0 * csa[0+4*j] - tmp1 * csa[1+4*j]);\
        ptr[   j] = lrintf(tmp0 * csa[1+4*j] + tmp1 * csa[0+4*j]);
1811

M
Michael Niedermayer 已提交
1812 1813 1814 1815 1816 1817 1818 1819 1820
        FLOAT_AA(0)
        FLOAT_AA(1)
        FLOAT_AA(2)
        FLOAT_AA(3)
        FLOAT_AA(4)
        FLOAT_AA(5)
        FLOAT_AA(6)
        FLOAT_AA(7)

1821
        ptr += 18;
1822 1823 1824 1825
    }
}

static void compute_imdct(MPADecodeContext *s,
1826
                          GranuleDef *g,
1827 1828
                          int32_t *sb_samples,
                          int32_t *mdct_buf)
1829
{
M
Michael Niedermayer 已提交
1830
    int32_t *ptr, *win, *win1, *buf, *out_ptr, *ptr1;
1831
    int32_t out2[12];
M
Michael Niedermayer 已提交
1832
    int i, j, mdct_long_end, v, sblimit;
1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866

    /* find last non zero block */
    ptr = g->sb_hybrid + 576;
    ptr1 = g->sb_hybrid + 2 * 18;
    while (ptr >= ptr1) {
        ptr -= 6;
        v = ptr[0] | ptr[1] | ptr[2] | ptr[3] | ptr[4] | ptr[5];
        if (v != 0)
            break;
    }
    sblimit = ((ptr - g->sb_hybrid) / 18) + 1;

    if (g->block_type == 2) {
        /* XXX: check for 8000 Hz */
        if (g->switch_point)
            mdct_long_end = 2;
        else
            mdct_long_end = 0;
    } else {
        mdct_long_end = sblimit;
    }

    buf = mdct_buf;
    ptr = g->sb_hybrid;
    for(j=0;j<mdct_long_end;j++) {
        /* apply window & overlap with previous buffer */
        out_ptr = sb_samples + j;
        /* select window */
        if (g->switch_point && j < 2)
            win1 = mdct_win[0];
        else
            win1 = mdct_win[g->block_type];
        /* select frequency inversion */
        win = win1 + ((4 * 36) & -(j & 1));
M
Michael Niedermayer 已提交
1867 1868
        imdct36(out_ptr, buf, ptr, win);
        out_ptr += 18*SBLIMIT;
1869 1870 1871 1872 1873 1874 1875
        ptr += 18;
        buf += 18;
    }
    for(j=mdct_long_end;j<sblimit;j++) {
        /* select frequency inversion */
        win = mdct_win[2] + ((4 * 36) & -(j & 1));
        out_ptr = sb_samples + j;
1876

M
Michael Niedermayer 已提交
1877 1878 1879 1880 1881 1882 1883 1884
        for(i=0; i<6; i++){
            *out_ptr = buf[i];
            out_ptr += SBLIMIT;
        }
        imdct12(out2, ptr + 0);
        for(i=0;i<6;i++) {
            *out_ptr = MULH(out2[i], win[i]) + buf[i + 6*1];
            buf[i + 6*2] = MULH(out2[i + 6], win[i + 6]);
1885 1886
            out_ptr += SBLIMIT;
        }
M
Michael Niedermayer 已提交
1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898
        imdct12(out2, ptr + 1);
        for(i=0;i<6;i++) {
            *out_ptr = MULH(out2[i], win[i]) + buf[i + 6*2];
            buf[i + 6*0] = MULH(out2[i + 6], win[i + 6]);
            out_ptr += SBLIMIT;
        }
        imdct12(out2, ptr + 2);
        for(i=0;i<6;i++) {
            buf[i + 6*0] = MULH(out2[i], win[i]) + buf[i + 6*0];
            buf[i + 6*1] = MULH(out2[i + 6], win[i + 6]);
            buf[i + 6*2] = 0;
        }
1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914
        ptr += 18;
        buf += 18;
    }
    /* zero bands */
    for(j=sblimit;j<SBLIMIT;j++) {
        /* overlap */
        out_ptr = sb_samples + j;
        for(i=0;i<18;i++) {
            *out_ptr = buf[i];
            buf[i] = 0;
            out_ptr += SBLIMIT;
        }
        buf += 18;
    }
}

F
Fabrice Bellard 已提交
1915
#if defined(DEBUG)
1916
void sample_dump(int fnum, int32_t *tab, int n)
1917 1918 1919
{
    static FILE *files[16], *f;
    char buf[512];
1920
    int i;
1921
    int32_t v;
1922

1923 1924
    f = files[fnum];
    if (!f) {
1925 1926
        snprintf(buf, sizeof(buf), "/tmp/out%d.%s.pcm",
                fnum,
1927 1928 1929 1930 1931 1932
#ifdef USE_HIGHPRECISION
                "hp"
#else
                "lp"
#endif
                );
1933 1934 1935 1936 1937
        f = fopen(buf, "w");
        if (!f)
            return;
        files[fnum] = f;
    }
1938

1939 1940
    if (fnum == 0) {
        static int pos = 0;
1941
        av_log(NULL, AV_LOG_DEBUG, "pos=%d\n", pos);
1942
        for(i=0;i<n;i++) {
1943
            av_log(NULL, AV_LOG_DEBUG, " %0.4f", (double)tab[i] / FRAC_ONE);
1944
            if ((i % 18) == 17)
1945
                av_log(NULL, AV_LOG_DEBUG, "\n");
1946 1947 1948
        }
        pos += n;
    }
1949 1950 1951
    for(i=0;i<n;i++) {
        /* normalize to 23 frac bits */
        v = tab[i] << (23 - FRAC_BITS);
1952
        fwrite(&v, 1, sizeof(int32_t), f);
1953
    }
1954 1955 1956 1957 1958 1959 1960 1961
}
#endif


/* main layer3 decoding function */
static int mp_decode_layer3(MPADecodeContext *s)
{
    int nb_granules, main_data_begin, private_bits;
1962
    int gr, ch, blocksplit_flag, i, j, k, n, bits_pos;
1963
    GranuleDef granules[2][2], *g;
1964
    int16_t exponents[576];
1965 1966 1967 1968

    /* read side info */
    if (s->lsf) {
        main_data_begin = get_bits(&s->gb, 8);
M
Michael Niedermayer 已提交
1969
        private_bits = get_bits(&s->gb, s->nb_channels);
1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982
        nb_granules = 1;
    } else {
        main_data_begin = get_bits(&s->gb, 9);
        if (s->nb_channels == 2)
            private_bits = get_bits(&s->gb, 3);
        else
            private_bits = get_bits(&s->gb, 5);
        nb_granules = 2;
        for(ch=0;ch<s->nb_channels;ch++) {
            granules[ch][0].scfsi = 0; /* all scale factors are transmitted */
            granules[ch][1].scfsi = get_bits(&s->gb, 4);
        }
    }
1983

1984 1985
    for(gr=0;gr<nb_granules;gr++) {
        for(ch=0;ch<s->nb_channels;ch++) {
M
Michel Bardiaux 已提交
1986
            dprintf(s->avctx, "gr=%d ch=%d: side_info\n", gr, ch);
1987 1988 1989
            g = &granules[ch][gr];
            g->part2_3_length = get_bits(&s->gb, 12);
            g->big_values = get_bits(&s->gb, 9);
1990
            if(g->big_values > 288){
M
Michel Bardiaux 已提交
1991
                av_log(s->avctx, AV_LOG_ERROR, "big_values too big\n");
1992 1993 1994
                return -1;
            }

1995 1996 1997
            g->global_gain = get_bits(&s->gb, 8);
            /* if MS stereo only is selected, we precompute the
               1/sqrt(2) renormalization factor */
1998
            if ((s->mode_ext & (MODE_EXT_MS_STEREO | MODE_EXT_I_STEREO)) ==
1999 2000 2001 2002 2003 2004 2005 2006 2007
                MODE_EXT_MS_STEREO)
                g->global_gain -= 2;
            if (s->lsf)
                g->scalefac_compress = get_bits(&s->gb, 9);
            else
                g->scalefac_compress = get_bits(&s->gb, 4);
            blocksplit_flag = get_bits(&s->gb, 1);
            if (blocksplit_flag) {
                g->block_type = get_bits(&s->gb, 2);
2008 2009
                if (g->block_type == 0){
                    av_log(NULL, AV_LOG_ERROR, "invalid block type\n");
2010
                    return -1;
2011
                }
2012 2013 2014
                g->switch_point = get_bits(&s->gb, 1);
                for(i=0;i<2;i++)
                    g->table_select[i] = get_bits(&s->gb, 5);
2015
                for(i=0;i<3;i++)
2016 2017 2018 2019 2020
                    g->subblock_gain[i] = get_bits(&s->gb, 3);
                /* compute huffman coded region sizes */
                if (g->block_type == 2)
                    g->region_size[0] = (36 / 2);
                else {
2021
                    if (s->sample_rate_index <= 2)
2022
                        g->region_size[0] = (36 / 2);
2023
                    else if (s->sample_rate_index != 8)
2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037
                        g->region_size[0] = (54 / 2);
                    else
                        g->region_size[0] = (108 / 2);
                }
                g->region_size[1] = (576 / 2);
            } else {
                int region_address1, region_address2, l;
                g->block_type = 0;
                g->switch_point = 0;
                for(i=0;i<3;i++)
                    g->table_select[i] = get_bits(&s->gb, 5);
                /* compute huffman coded region sizes */
                region_address1 = get_bits(&s->gb, 4);
                region_address2 = get_bits(&s->gb, 3);
M
Michel Bardiaux 已提交
2038
                dprintf(s->avctx, "region1=%d region2=%d\n",
2039
                        region_address1, region_address2);
2040
                g->region_size[0] =
2041 2042 2043 2044 2045
                    band_index_long[s->sample_rate_index][region_address1 + 1] >> 1;
                l = region_address1 + region_address2 + 2;
                /* should not overflow */
                if (l > 22)
                    l = 22;
2046
                g->region_size[1] =
2047 2048 2049 2050 2051 2052 2053
                    band_index_long[s->sample_rate_index][l] >> 1;
            }
            /* convert region offsets to region sizes and truncate
               size to big_values */
            g->region_size[2] = (576 / 2);
            j = 0;
            for(i=0;i<3;i++) {
M
Michael Niedermayer 已提交
2054
                k = FFMIN(g->region_size[i], g->big_values);
2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070
                g->region_size[i] = k - j;
                j = k;
            }

            /* compute band indexes */
            if (g->block_type == 2) {
                if (g->switch_point) {
                    /* if switched mode, we handle the 36 first samples as
                       long blocks.  For 8000Hz, we handle the 48 first
                       exponents as long blocks (XXX: check this!) */
                    if (s->sample_rate_index <= 2)
                        g->long_end = 8;
                    else if (s->sample_rate_index != 8)
                        g->long_end = 6;
                    else
                        g->long_end = 4; /* 8000 Hz */
2071

M
Michael Niedermayer 已提交
2072
                    g->short_start = 2 + (s->sample_rate_index != 8);
2073 2074 2075 2076 2077 2078 2079 2080
                } else {
                    g->long_end = 0;
                    g->short_start = 0;
                }
            } else {
                g->short_start = 13;
                g->long_end = 22;
            }
2081

2082 2083 2084 2085 2086
            g->preflag = 0;
            if (!s->lsf)
                g->preflag = get_bits(&s->gb, 1);
            g->scalefac_scale = get_bits(&s->gb, 1);
            g->count1table_select = get_bits(&s->gb, 1);
M
Michel Bardiaux 已提交
2087
            dprintf(s->avctx, "block_type=%d switch_point=%d\n",
2088 2089 2090 2091
                    g->block_type, g->switch_point);
        }
    }

R
Roberto Togni 已提交
2092
  if (!s->adu_mode) {
2093
    const uint8_t *ptr = s->gb.buffer + (get_bits_count(&s->gb)>>3);
M
Michael Niedermayer 已提交
2094
    assert((get_bits_count(&s->gb) & 7) == 0);
2095
    /* now we get bits from the main_data_begin offset */
M
Michel Bardiaux 已提交
2096
    dprintf(s->avctx, "seekback: %d\n", main_data_begin);
2097 2098 2099 2100
//av_log(NULL, AV_LOG_ERROR, "backstep:%d, lastbuf:%d\n", main_data_begin, s->last_buf_size);

    memcpy(s->last_buf + s->last_buf_size, ptr, EXTRABYTES);
    s->in_gb= s->gb;
2101 2102
        init_get_bits(&s->gb, s->last_buf, s->last_buf_size*8);
        skip_bits_long(&s->gb, 8*(s->last_buf_size - main_data_begin));
R
Roberto Togni 已提交
2103
  }
2104 2105 2106 2107

    for(gr=0;gr<nb_granules;gr++) {
        for(ch=0;ch<s->nb_channels;ch++) {
            g = &granules[ch][gr];
2108
            if(get_bits_count(&s->gb)<0){
D
typos  
Diego Biurrun 已提交
2109
                av_log(NULL, AV_LOG_ERROR, "mdb:%d, lastbuf:%d skipping granule %d\n",
2110 2111 2112 2113 2114 2115 2116 2117 2118 2119
                                            main_data_begin, s->last_buf_size, gr);
                skip_bits_long(&s->gb, g->part2_3_length);
                memset(g->sb_hybrid, 0, sizeof(g->sb_hybrid));
                if(get_bits_count(&s->gb) >= s->gb.size_in_bits && s->in_gb.buffer){
                    skip_bits_long(&s->in_gb, get_bits_count(&s->gb) - s->gb.size_in_bits);
                    s->gb= s->in_gb;
                    s->in_gb.buffer=NULL;
                }
                continue;
            }
2120

2121
            bits_pos = get_bits_count(&s->gb);
2122

2123
            if (!s->lsf) {
2124
                uint8_t *sc;
2125 2126 2127 2128 2129
                int slen, slen1, slen2;

                /* MPEG1 scale factors */
                slen1 = slen_table[0][g->scalefac_compress];
                slen2 = slen_table[1][g->scalefac_compress];
M
Michel Bardiaux 已提交
2130
                dprintf(s->avctx, "slen1=%d slen2=%d\n", slen1, slen2);
2131 2132 2133
                if (g->block_type == 2) {
                    n = g->switch_point ? 17 : 18;
                    j = 0;
2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149
                    if(slen1){
                        for(i=0;i<n;i++)
                            g->scale_factors[j++] = get_bits(&s->gb, slen1);
                    }else{
                        for(i=0;i<n;i++)
                            g->scale_factors[j++] = 0;
                    }
                    if(slen2){
                        for(i=0;i<18;i++)
                            g->scale_factors[j++] = get_bits(&s->gb, slen2);
                        for(i=0;i<3;i++)
                            g->scale_factors[j++] = 0;
                    }else{
                        for(i=0;i<21;i++)
                            g->scale_factors[j++] = 0;
                    }
2150 2151 2152 2153 2154 2155 2156
                } else {
                    sc = granules[ch][0].scale_factors;
                    j = 0;
                    for(k=0;k<4;k++) {
                        n = (k == 0 ? 6 : 5);
                        if ((g->scfsi & (0x8 >> k)) == 0) {
                            slen = (k < 2) ? slen1 : slen2;
2157 2158 2159 2160 2161 2162 2163
                            if(slen){
                                for(i=0;i<n;i++)
                                    g->scale_factors[j++] = get_bits(&s->gb, slen);
                            }else{
                                for(i=0;i<n;i++)
                                    g->scale_factors[j++] = 0;
                            }
2164 2165 2166 2167 2168 2169 2170 2171 2172 2173
                        } else {
                            /* simply copy from last granule */
                            for(i=0;i<n;i++) {
                                g->scale_factors[j] = sc[j];
                                j++;
                            }
                        }
                    }
                    g->scale_factors[j++] = 0;
                }
F
Fabrice Bellard 已提交
2174
#if defined(DEBUG)
2175
                {
M
Michel Bardiaux 已提交
2176
                    dprintf(s->avctx, "scfsi=%x gr=%d ch=%d scale_factors:\n",
2177 2178
                           g->scfsi, gr, ch);
                    for(i=0;i<j;i++)
M
Michel Bardiaux 已提交
2179 2180
                        dprintf(s->avctx, " %d", g->scale_factors[i]);
                    dprintf(s->avctx, "\n");
2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224
                }
#endif
            } else {
                int tindex, tindex2, slen[4], sl, sf;

                /* LSF scale factors */
                if (g->block_type == 2) {
                    tindex = g->switch_point ? 2 : 1;
                } else {
                    tindex = 0;
                }
                sf = g->scalefac_compress;
                if ((s->mode_ext & MODE_EXT_I_STEREO) && ch == 1) {
                    /* intensity stereo case */
                    sf >>= 1;
                    if (sf < 180) {
                        lsf_sf_expand(slen, sf, 6, 6, 0);
                        tindex2 = 3;
                    } else if (sf < 244) {
                        lsf_sf_expand(slen, sf - 180, 4, 4, 0);
                        tindex2 = 4;
                    } else {
                        lsf_sf_expand(slen, sf - 244, 3, 0, 0);
                        tindex2 = 5;
                    }
                } else {
                    /* normal case */
                    if (sf < 400) {
                        lsf_sf_expand(slen, sf, 5, 4, 4);
                        tindex2 = 0;
                    } else if (sf < 500) {
                        lsf_sf_expand(slen, sf - 400, 5, 4, 0);
                        tindex2 = 1;
                    } else {
                        lsf_sf_expand(slen, sf - 500, 3, 0, 0);
                        tindex2 = 2;
                        g->preflag = 1;
                    }
                }

                j = 0;
                for(k=0;k<4;k++) {
                    n = lsf_nsf_table[tindex2][tindex][k];
                    sl = slen[k];
M
Michael Niedermayer 已提交
2225
                    if(sl){
2226 2227 2228 2229 2230 2231
                        for(i=0;i<n;i++)
                            g->scale_factors[j++] = get_bits(&s->gb, sl);
                    }else{
                        for(i=0;i<n;i++)
                            g->scale_factors[j++] = 0;
                    }
2232 2233 2234 2235
                }
                /* XXX: should compute exact size */
                for(;j<40;j++)
                    g->scale_factors[j] = 0;
F
Fabrice Bellard 已提交
2236
#if defined(DEBUG)
2237
                {
M
Michel Bardiaux 已提交
2238
                    dprintf(s->avctx, "gr=%d ch=%d scale_factors:\n",
2239 2240
                           gr, ch);
                    for(i=0;i<40;i++)
M
Michel Bardiaux 已提交
2241 2242
                        dprintf(s->avctx, " %d", g->scale_factors[i]);
                    dprintf(s->avctx, "\n");
2243 2244 2245 2246 2247 2248 2249
                }
#endif
            }

            exponents_from_scale_factors(s, g, exponents);

            /* read Huffman coded residue */
2250
            huffman_decode(s, g, exponents, bits_pos + g->part2_3_length);
F
Fabrice Bellard 已提交
2251 2252
#if defined(DEBUG)
            sample_dump(0, g->sb_hybrid, 576);
2253 2254 2255 2256 2257 2258 2259 2260 2261 2262
#endif
        } /* ch */

        if (s->nb_channels == 2)
            compute_stereo(s, &granules[0][gr], &granules[1][gr]);

        for(ch=0;ch<s->nb_channels;ch++) {
            g = &granules[ch][gr];

            reorder_block(s, g);
F
Fabrice Bellard 已提交
2263
#if defined(DEBUG)
2264 2265
            sample_dump(0, g->sb_hybrid, 576);
#endif
2266
            s->compute_antialias(s, g);
2267
#if defined(DEBUG)
2268 2269
            sample_dump(1, g->sb_hybrid, 576);
#endif
2270
            compute_imdct(s, g, &s->sb_samples[ch][18 * gr][0], s->mdct_buf[ch]);
2271
#if defined(DEBUG)
2272 2273 2274 2275
            sample_dump(2, &s->sb_samples[ch][18 * gr][0], 576);
#endif
        }
    } /* gr */
2276 2277
    if(get_bits_count(&s->gb)<0)
        skip_bits_long(&s->gb, -get_bits_count(&s->gb));
2278 2279 2280
    return nb_granules * 18;
}

2281
static int mp_decode_frame(MPADecodeContext *s,
2282
                           OUT_INT *samples, const uint8_t *buf, int buf_size)
2283 2284
{
    int i, nb_frames, ch;
2285
    OUT_INT *samples_ptr;
2286

2287
    init_get_bits(&s->gb, buf + HEADER_SIZE, (buf_size - HEADER_SIZE)*8);
2288

2289 2290 2291 2292
    /* skip error protection field */
    if (s->error_protection)
        get_bits(&s->gb, 16);

M
Michel Bardiaux 已提交
2293
    dprintf(s->avctx, "frame %d:\n", s->frame_count);
2294 2295 2296 2297 2298 2299 2300 2301 2302 2303
    switch(s->layer) {
    case 1:
        nb_frames = mp_decode_layer1(s);
        break;
    case 2:
        nb_frames = mp_decode_layer2(s);
        break;
    case 3:
    default:
        nb_frames = mp_decode_layer3(s);
2304

M
Michael Niedermayer 已提交
2305 2306 2307 2308
        s->last_buf_size=0;
        if(s->in_gb.buffer){
            align_get_bits(&s->gb);
            i= (s->gb.size_in_bits - get_bits_count(&s->gb))>>3;
M
Michael Niedermayer 已提交
2309
            if(i >= 0 && i <= BACKSTEP_SIZE){
M
Michael Niedermayer 已提交
2310 2311
                memmove(s->last_buf, s->gb.buffer + (get_bits_count(&s->gb)>>3), i);
                s->last_buf_size=i;
M
Michael Niedermayer 已提交
2312 2313
            }else
                av_log(NULL, AV_LOG_ERROR, "invalid old backstep %d\n", i);
2314
            s->gb= s->in_gb;
2315
            s->in_gb.buffer= NULL;
M
Michael Niedermayer 已提交
2316 2317
        }

2318 2319
        align_get_bits(&s->gb);
        assert((get_bits_count(&s->gb) & 7) == 0);
M
Michael Niedermayer 已提交
2320 2321
        i= (s->gb.size_in_bits - get_bits_count(&s->gb))>>3;

M
Michael Niedermayer 已提交
2322 2323 2324 2325
        if(i<0 || i > BACKSTEP_SIZE || nb_frames<0){
            av_log(NULL, AV_LOG_ERROR, "invalid new backstep %d\n", i);
            i= FFMIN(BACKSTEP_SIZE, buf_size - HEADER_SIZE);
        }
M
Michael Niedermayer 已提交
2326
        assert(i <= buf_size - HEADER_SIZE && i>= 0);
M
Michael Niedermayer 已提交
2327
        memcpy(s->last_buf + s->last_buf_size, s->gb.buffer + buf_size - HEADER_SIZE - i, i);
M
Michael Niedermayer 已提交
2328
        s->last_buf_size += i;
2329

2330 2331 2332 2333 2334 2335
        break;
    }
#if defined(DEBUG)
    for(i=0;i<nb_frames;i++) {
        for(ch=0;ch<s->nb_channels;ch++) {
            int j;
M
Michel Bardiaux 已提交
2336
            dprintf(s->avctx, "%d-%d:", i, ch);
2337
            for(j=0;j<SBLIMIT;j++)
M
Michel Bardiaux 已提交
2338 2339
                dprintf(s->avctx, " %0.6f", (double)s->sb_samples[ch][i][j] / FRAC_ONE);
            dprintf(s->avctx, "\n");
2340 2341 2342 2343 2344 2345 2346
        }
    }
#endif
    /* apply the synthesis filter */
    for(ch=0;ch<s->nb_channels;ch++) {
        samples_ptr = samples + ch;
        for(i=0;i<nb_frames;i++) {
2347
            ff_mpa_synth_filter(s->synth_buf[ch], &(s->synth_buf_offset[ch]),
2348 2349
                         window, &s->dither_state,
                         samples_ptr, s->nb_channels,
2350 2351 2352 2353 2354
                         s->sb_samples[ch][i]);
            samples_ptr += 32 * s->nb_channels;
        }
    }
#ifdef DEBUG
2355
    s->frame_count++;
2356
#endif
2357
    return nb_frames * 32 * sizeof(OUT_INT) * s->nb_channels;
2358 2359
}

F
Fabrice Bellard 已提交
2360
static int decode_frame(AVCodecContext * avctx,
2361 2362
                        void *data, int *data_size,
                        uint8_t * buf, int buf_size)
F
Fabrice Bellard 已提交
2363 2364
{
    MPADecodeContext *s = avctx->priv_data;
2365
    uint32_t header;
2366
    int out_size;
2367
    OUT_INT *out_samples = data;
F
Fabrice Bellard 已提交
2368

2369 2370 2371 2372
retry:
    if(buf_size < HEADER_SIZE)
        return -1;

R
Ramiro Polla 已提交
2373
    header = AV_RB32(buf);
2374 2375 2376
    if(ff_mpa_check_header(header) < 0){
        buf++;
//        buf_size--;
D
Diego Biurrun 已提交
2377
        av_log(avctx, AV_LOG_ERROR, "Header missing skipping one byte.\n");
2378 2379 2380
        goto retry;
    }

2381
    if (ff_mpegaudio_decode_header(s, header) == 1) {
2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404
        /* free format: prepare to compute frame size */
        s->frame_size = -1;
        return -1;
    }
    /* update codec info */
    avctx->channels = s->nb_channels;
    avctx->bit_rate = s->bit_rate;
    avctx->sub_id = s->layer;
    switch(s->layer) {
    case 1:
        avctx->frame_size = 384;
        break;
    case 2:
        avctx->frame_size = 1152;
        break;
    case 3:
        if (s->lsf)
            avctx->frame_size = 576;
        else
            avctx->frame_size = 1152;
        break;
    }

2405
    if(s->frame_size<=0 || s->frame_size > buf_size){
2406 2407
        av_log(avctx, AV_LOG_ERROR, "incomplete frame\n");
        return -1;
2408 2409
    }else if(s->frame_size < buf_size){
        av_log(avctx, AV_LOG_ERROR, "incorrect frame size\n");
2410
        buf_size= s->frame_size;
F
Fabrice Bellard 已提交
2411
    }
2412 2413

    out_size = mp_decode_frame(s, out_samples, buf, buf_size);
2414
    if(out_size>=0){
2415
        *data_size = out_size;
2416 2417 2418
        avctx->sample_rate = s->sample_rate;
        //FIXME maybe move the other codec info stuff from above here too
    }else
D
Diego Biurrun 已提交
2419
        av_log(avctx, AV_LOG_DEBUG, "Error while decoding MPEG audio frame.\n"); //FIXME return -1 / but also return the number of bytes consumed
2420 2421
    s->frame_size = 0;
    return buf_size;
F
Fabrice Bellard 已提交
2422 2423
}

2424 2425 2426 2427 2428
static void flush(AVCodecContext *avctx){
    MPADecodeContext *s = avctx->priv_data;
    s->last_buf_size= 0;
}

2429
#ifdef CONFIG_MP3ADU_DECODER
R
Roberto Togni 已提交
2430
static int decode_frame_adu(AVCodecContext * avctx,
2431 2432
                        void *data, int *data_size,
                        uint8_t * buf, int buf_size)
R
Roberto Togni 已提交
2433 2434 2435 2436
{
    MPADecodeContext *s = avctx->priv_data;
    uint32_t header;
    int len, out_size;
2437
    OUT_INT *out_samples = data;
R
Roberto Togni 已提交
2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451

    len = buf_size;

    // Discard too short frames
    if (buf_size < HEADER_SIZE) {
        *data_size = 0;
        return buf_size;
    }


    if (len > MPA_MAX_CODED_FRAME_SIZE)
        len = MPA_MAX_CODED_FRAME_SIZE;

    // Get header and restore sync word
R
Ramiro Polla 已提交
2452
    header = AV_RB32(buf) | 0xffe00000;
R
Roberto Togni 已提交
2453

2454
    if (ff_mpa_check_header(header) < 0) { // Bad header, discard frame
R
Roberto Togni 已提交
2455 2456 2457 2458
        *data_size = 0;
        return buf_size;
    }

2459
    ff_mpegaudio_decode_header(s, header);
R
Roberto Togni 已提交
2460 2461 2462 2463 2464 2465 2466 2467 2468
    /* update codec info */
    avctx->sample_rate = s->sample_rate;
    avctx->channels = s->nb_channels;
    avctx->bit_rate = s->bit_rate;
    avctx->sub_id = s->layer;

    avctx->frame_size=s->frame_size = len;

    if (avctx->parse_only) {
2469
        out_size = buf_size;
R
Roberto Togni 已提交
2470
    } else {
2471
        out_size = mp_decode_frame(s, out_samples, buf, buf_size);
R
Roberto Togni 已提交
2472 2473 2474 2475 2476
    }

    *data_size = out_size;
    return buf_size;
}
2477
#endif /* CONFIG_MP3ADU_DECODER */
R
Roberto Togni 已提交
2478

2479
#ifdef CONFIG_MP3ON4_DECODER
2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535
/* Next 3 arrays are indexed by channel config number (passed via codecdata) */
static int mp3Frames[16] = {0,1,1,2,3,3,4,5,2};   /* number of mp3 decoder instances */
static int mp3Channels[16] = {0,1,2,3,4,5,6,8,4}; /* total output channels */
/* offsets into output buffer, assume output order is FL FR BL BR C LFE */
static int chan_offset[9][5] = {
    {0},
    {0},            // C
    {0},            // FLR
    {2,0},          // C FLR
    {2,0,3},        // C FLR BS
    {4,0,2},        // C FLR BLRS
    {4,0,2,5},      // C FLR BLRS LFE
    {4,0,2,6,5},    // C FLR BLRS BLR LFE
    {0,2}           // FLR BLRS
};


static int decode_init_mp3on4(AVCodecContext * avctx)
{
    MP3On4DecodeContext *s = avctx->priv_data;
    int i;

    if ((avctx->extradata_size < 2) || (avctx->extradata == NULL)) {
        av_log(avctx, AV_LOG_ERROR, "Codec extradata missing or too short.\n");
        return -1;
    }

    s->chan_cfg = (((unsigned char *)avctx->extradata)[1] >> 3) & 0x0f;
    s->frames = mp3Frames[s->chan_cfg];
    if(!s->frames) {
        av_log(avctx, AV_LOG_ERROR, "Invalid channel config number.\n");
        return -1;
    }
    avctx->channels = mp3Channels[s->chan_cfg];

    /* Init the first mp3 decoder in standard way, so that all tables get builded
     * We replace avctx->priv_data with the context of the first decoder so that
     * decode_init() does not have to be changed.
     * Other decoders will be inited here copying data from the first context
     */
    // Allocate zeroed memory for the first decoder context
    s->mp3decctx[0] = av_mallocz(sizeof(MPADecodeContext));
    // Put decoder context in place to make init_decode() happy
    avctx->priv_data = s->mp3decctx[0];
    decode_init(avctx);
    // Restore mp3on4 context pointer
    avctx->priv_data = s;
    s->mp3decctx[0]->adu_mode = 1; // Set adu mode

    /* Create a separate codec/context for each frame (first is already ok).
     * Each frame is 1 or 2 channels - up to 5 frames allowed
     */
    for (i = 1; i < s->frames; i++) {
        s->mp3decctx[i] = av_mallocz(sizeof(MPADecodeContext));
        s->mp3decctx[i]->compute_antialias = s->mp3decctx[0]->compute_antialias;
        s->mp3decctx[i]->adu_mode = 1;
M
Michel Bardiaux 已提交
2536
        s->mp3decctx[i]->avctx = avctx;
2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556
    }

    return 0;
}


static int decode_close_mp3on4(AVCodecContext * avctx)
{
    MP3On4DecodeContext *s = avctx->priv_data;
    int i;

    for (i = 0; i < s->frames; i++)
        if (s->mp3decctx[i])
            av_free(s->mp3decctx[i]);

    return 0;
}


static int decode_frame_mp3on4(AVCodecContext * avctx,
2557 2558
                        void *data, int *data_size,
                        uint8_t * buf, int buf_size)
2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596
{
    MP3On4DecodeContext *s = avctx->priv_data;
    MPADecodeContext *m;
    int len, out_size = 0;
    uint32_t header;
    OUT_INT *out_samples = data;
    OUT_INT decoded_buf[MPA_FRAME_SIZE * MPA_MAX_CHANNELS];
    OUT_INT *outptr, *bp;
    int fsize;
    unsigned char *start2 = buf, *start;
    int fr, i, j, n;
    int off = avctx->channels;
    int *coff = chan_offset[s->chan_cfg];

    len = buf_size;

    // Discard too short frames
    if (buf_size < HEADER_SIZE) {
        *data_size = 0;
        return buf_size;
    }

    // If only one decoder interleave is not needed
    outptr = s->frames == 1 ? out_samples : decoded_buf;

    for (fr = 0; fr < s->frames; fr++) {
        start = start2;
        fsize = (start[0] << 4) | (start[1] >> 4);
        start2 += fsize;
        if (fsize > len)
            fsize = len;
        len -= fsize;
        if (fsize > MPA_MAX_CODED_FRAME_SIZE)
            fsize = MPA_MAX_CODED_FRAME_SIZE;
        m = s->mp3decctx[fr];
        assert (m != NULL);

        // Get header
R
Ramiro Polla 已提交
2597
        header = AV_RB32(start) | 0xfff00000;
2598 2599 2600 2601 2602 2603

        if (ff_mpa_check_header(header) < 0) { // Bad header, discard block
            *data_size = 0;
            return buf_size;
        }

2604
        ff_mpegaudio_decode_header(m, header);
2605
        mp_decode_frame(m, decoded_buf, start, fsize);
2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636

        n = MPA_FRAME_SIZE * m->nb_channels;
        out_size += n * sizeof(OUT_INT);
        if(s->frames > 1) {
            /* interleave output data */
            bp = out_samples + coff[fr];
            if(m->nb_channels == 1) {
                for(j = 0; j < n; j++) {
                    *bp = decoded_buf[j];
                    bp += off;
                }
            } else {
                for(j = 0; j < n; j++) {
                    bp[0] = decoded_buf[j++];
                    bp[1] = decoded_buf[j];
                    bp += off;
                }
            }
        }
    }

    /* update codec info */
    avctx->sample_rate = s->mp3decctx[0]->sample_rate;
    avctx->frame_size= buf_size;
    avctx->bit_rate = 0;
    for (i = 0; i < s->frames; i++)
        avctx->bit_rate += s->mp3decctx[i]->bit_rate;

    *data_size = out_size;
    return buf_size;
}
2637
#endif /* CONFIG_MP3ON4_DECODER */
2638

2639
#ifdef CONFIG_MP2_DECODER
2640
AVCodec mp2_decoder =
F
Fabrice Bellard 已提交
2641
{
2642
    "mp2",
F
Fabrice Bellard 已提交
2643 2644 2645 2646 2647 2648 2649
    CODEC_TYPE_AUDIO,
    CODEC_ID_MP2,
    sizeof(MPADecodeContext),
    decode_init,
    NULL,
    NULL,
    decode_frame,
2650
    CODEC_CAP_PARSE_ONLY,
F
Fabrice Bellard 已提交
2651
};
2652 2653
#endif
#ifdef CONFIG_MP3_DECODER
2654 2655 2656 2657
AVCodec mp3_decoder =
{
    "mp3",
    CODEC_TYPE_AUDIO,
F
Fabrice Bellard 已提交
2658
    CODEC_ID_MP3,
2659 2660 2661 2662 2663
    sizeof(MPADecodeContext),
    decode_init,
    NULL,
    NULL,
    decode_frame,
2664
    CODEC_CAP_PARSE_ONLY,
2665
    .flush= flush,
2666
};
2667 2668
#endif
#ifdef CONFIG_MP3ADU_DECODER
R
Roberto Togni 已提交
2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679
AVCodec mp3adu_decoder =
{
    "mp3adu",
    CODEC_TYPE_AUDIO,
    CODEC_ID_MP3ADU,
    sizeof(MPADecodeContext),
    decode_init,
    NULL,
    NULL,
    decode_frame_adu,
    CODEC_CAP_PARSE_ONLY,
2680
    .flush= flush,
R
Roberto Togni 已提交
2681
};
2682 2683
#endif
#ifdef CONFIG_MP3ON4_DECODER
2684 2685 2686 2687 2688 2689 2690 2691 2692 2693
AVCodec mp3on4_decoder =
{
    "mp3on4",
    CODEC_TYPE_AUDIO,
    CODEC_ID_MP3ON4,
    sizeof(MP3On4DecodeContext),
    decode_init_mp3on4,
    NULL,
    decode_close_mp3on4,
    decode_frame_mp3on4,
2694
    .flush= flush,
2695
};
2696
#endif