?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Partially revert r20233, exp2f is not available on some BSDs, DOS and AVR32.
[FFMpeg-mirror/lagarith.git] / libavcodec / mpegaudiodec.c
blob47c22791bb9c6d0f1a89d6e3ea967613522e0e53
1 /*
2 * MPEG Audio decoder
3 * Copyright (c) 2001, 2002 Fabrice Bellard
4 *
5 * This file is part of FFmpeg.
6 *
7 * FFmpeg is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
11 *
12 * FFmpeg is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with FFmpeg; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22 /**
23 * @file libavcodec/mpegaudiodec.c
24 * MPEG Audio decoder.
25 */
26
27 #include "avcodec.h"
28 #include "get_bits.h"
29 #include "dsputil.h"
30
31 /*
32 * TODO:
33 * - in low precision mode, use more 16 bit multiplies in synth filter
34 * - test lsf / mpeg25 extensively.
35 */
36
37 #include "mpegaudio.h"
38 #include "mpegaudiodecheader.h"
39
40 #include "mathops.h"
41
42 /* WARNING: only correct for posititive numbers */
43 #define FIXR(a) ((int)((a) * FRAC_ONE + 0.5))
44 #define FRAC_RND(a) (((a) + (FRAC_ONE/2)) >> FRAC_BITS)
45
46 #define FIXHR(a) ((int)((a) * (1LL<<32) + 0.5))
47
48 /****************/
49
50 #define HEADER_SIZE 4
51
52 /* layer 3 "granule" */
53 typedef struct GranuleDef {
54 uint8_t scfsi;
55 int part2_3_length;
56 int big_values;
57 int global_gain;
58 int scalefac_compress;
59 uint8_t block_type;
60 uint8_t switch_point;
61 int table_select[3];
62 int subblock_gain[3];
63 uint8_t scalefac_scale;
64 uint8_t count1table_select;
65 int region_size[3]; /* number of huffman codes in each region */
66 int preflag;
67 int short_start, long_end; /* long/short band indexes */
68 uint8_t scale_factors[40];
69 int32_t sb_hybrid[SBLIMIT * 18]; /* 576 samples */
70 } GranuleDef;
71
72 #include "mpegaudiodata.h"
73 #include "mpegaudiodectab.h"
74
75 static void compute_antialias_integer(MPADecodeContext *s, GranuleDef *g);
76 static void compute_antialias_float(MPADecodeContext *s, GranuleDef *g);
77
78 /* vlc structure for decoding layer 3 huffman tables */
79 static VLC huff_vlc[16];
80 static VLC_TYPE huff_vlc_tables[
81 0+128+128+128+130+128+154+166+
82 142+204+190+170+542+460+662+414
83 ][2];
84 static const int huff_vlc_tables_sizes[16] = {
85 0, 128, 128, 128, 130, 128, 154, 166,
86 142, 204, 190, 170, 542, 460, 662, 414
87 };
88 static VLC huff_quad_vlc[2];
89 static VLC_TYPE huff_quad_vlc_tables[128+16][2];
90 static const int huff_quad_vlc_tables_sizes[2] = {
91 128, 16
92 };
93 /* computed from band_size_long */
94 static uint16_t band_index_long[9][23];
95 /* XXX: free when all decoders are closed */
96 #define TABLE_4_3_SIZE (8191 + 16)*4
97 static int8_t table_4_3_exp[TABLE_4_3_SIZE];
98 static uint32_t table_4_3_value[TABLE_4_3_SIZE];
99 static uint32_t exp_table[512];
100 static uint32_t expval_table[512][16];
101 /* intensity stereo coef table */
102 static int32_t is_table[2][16];
103 static int32_t is_table_lsf[2][2][16];
104 static int32_t csa_table[8][4];
105 static float csa_table_float[8][4];
106 static int32_t mdct_win[8][36];
107
108 /* lower 2 bits: modulo 3, higher bits: shift */
109 static uint16_t scale_factor_modshift[64];
110 /* [i][j]: 2^(-j/3) * FRAC_ONE * 2^(i+2) / (2^(i+2) - 1) */
111 static int32_t scale_factor_mult[15][3];
112 /* mult table for layer 2 group quantization */
113
114 #define SCALE_GEN(v) \
115 { FIXR(1.0 * (v)), FIXR(0.7937005259 * (v)), FIXR(0.6299605249 * (v)) }
116
117 static const int32_t scale_factor_mult2[3][3] = {
118 SCALE_GEN(4.0 / 3.0), /* 3 steps */
119 SCALE_GEN(4.0 / 5.0), /* 5 steps */
120 SCALE_GEN(4.0 / 9.0), /* 9 steps */
121 };
122
123 static DECLARE_ALIGNED_16(MPA_INT, window[512]);
124
125 /**
126 * Convert region offsets to region sizes and truncate
127 * size to big_values.
128 */
129 void ff_region_offset2size(GranuleDef *g){
130 int i, k, j=0;
131 g->region_size[2] = (576 / 2);
132 for(i=0;i<3;i++) {
133 k = FFMIN(g->region_size[i], g->big_values);
134 g->region_size[i] = k - j;
135 j = k;
136 }
137 }
138
139 void ff_init_short_region(MPADecodeContext *s, GranuleDef *g){
140 if (g->block_type == 2)
141 g->region_size[0] = (36 / 2);
142 else {
143 if (s->sample_rate_index <= 2)
144 g->region_size[0] = (36 / 2);
145 else if (s->sample_rate_index != 8)
146 g->region_size[0] = (54 / 2);
147 else
148 g->region_size[0] = (108 / 2);
149 }
150 g->region_size[1] = (576 / 2);
151 }
152
153 void ff_init_long_region(MPADecodeContext *s, GranuleDef *g, int ra1, int ra2){
154 int l;
155 g->region_size[0] =
156 band_index_long[s->sample_rate_index][ra1 + 1] >> 1;
157 /* should not overflow */
158 l = FFMIN(ra1 + ra2 + 2, 22);
159 g->region_size[1] =
160 band_index_long[s->sample_rate_index][l] >> 1;
161 }
162
163 void ff_compute_band_indexes(MPADecodeContext *s, GranuleDef *g){
164 if (g->block_type == 2) {
165 if (g->switch_point) {
166 /* if switched mode, we handle the 36 first samples as
167 long blocks. For 8000Hz, we handle the 48 first
168 exponents as long blocks (XXX: check this!) */
169 if (s->sample_rate_index <= 2)
170 g->long_end = 8;
171 else if (s->sample_rate_index != 8)
172 g->long_end = 6;
173 else
174 g->long_end = 4; /* 8000 Hz */
175
176 g->short_start = 2 + (s->sample_rate_index != 8);
177 } else {
178 g->long_end = 0;
179 g->short_start = 0;
180 }
181 } else {
182 g->short_start = 13;
183 g->long_end = 22;
184 }
185 }
186
187 /* layer 1 unscaling */
188 /* n = number of bits of the mantissa minus 1 */
189 static inline int l1_unscale(int n, int mant, int scale_factor)
190 {
191 int shift, mod;
192 int64_t val;
193
194 shift = scale_factor_modshift[scale_factor];
195 mod = shift & 3;
196 shift >>= 2;
197 val = MUL64(mant + (-1 << n) + 1, scale_factor_mult[n-1][mod]);
198 shift += n;
199 /* NOTE: at this point, 1 <= shift >= 21 + 15 */
200 return (int)((val + (1LL << (shift - 1))) >> shift);
201 }
202
203 static inline int l2_unscale_group(int steps, int mant, int scale_factor)
204 {
205 int shift, mod, val;
206
207 shift = scale_factor_modshift[scale_factor];
208 mod = shift & 3;
209 shift >>= 2;
210
211 val = (mant - (steps >> 1)) * scale_factor_mult2[steps >> 2][mod];
212 /* NOTE: at this point, 0 <= shift <= 21 */
213 if (shift > 0)
214 val = (val + (1 << (shift - 1))) >> shift;
215 return val;
216 }
217
218 /* compute value^(4/3) * 2^(exponent/4). It normalized to FRAC_BITS */
219 static inline int l3_unscale(int value, int exponent)
220 {
221 unsigned int m;
222 int e;
223
224 e = table_4_3_exp [4*value + (exponent&3)];
225 m = table_4_3_value[4*value + (exponent&3)];
226 e -= (exponent >> 2);
227 assert(e>=1);
228 if (e > 31)
229 return 0;
230 m = (m + (1 << (e-1))) >> e;
231
232 return m;
233 }
234
235 /* all integer n^(4/3) computation code */
236 #define DEV_ORDER 13
237
238 #define POW_FRAC_BITS 24
239 #define POW_FRAC_ONE (1 << POW_FRAC_BITS)
240 #define POW_FIX(a) ((int)((a) * POW_FRAC_ONE))
241 #define POW_MULL(a,b) (((int64_t)(a) * (int64_t)(b)) >> POW_FRAC_BITS)
242
243 static int dev_4_3_coefs[DEV_ORDER];
244
245 #if 0 /* unused */
246 static int pow_mult3[3] = {
247 POW_FIX(1.0),
248 POW_FIX(1.25992104989487316476),
249 POW_FIX(1.58740105196819947474),
250 };
251 #endif
252
253 static av_cold void int_pow_init(void)
254 {
255 int i, a;
256
257 a = POW_FIX(1.0);
258 for(i=0;i<DEV_ORDER;i++) {
259 a = POW_MULL(a, POW_FIX(4.0 / 3.0) - i * POW_FIX(1.0)) / (i + 1);
260 dev_4_3_coefs[i] = a;
261 }
262 }
263
264 #if 0 /* unused, remove? */
265 /* return the mantissa and the binary exponent */
266 static int int_pow(int i, int *exp_ptr)
267 {
268 int e, er, eq, j;
269 int a, a1;
270
271 /* renormalize */
272 a = i;
273 e = POW_FRAC_BITS;
274 while (a < (1 << (POW_FRAC_BITS - 1))) {
275 a = a << 1;
276 e--;
277 }
278 a -= (1 << POW_FRAC_BITS);
279 a1 = 0;
280 for(j = DEV_ORDER - 1; j >= 0; j--)
281 a1 = POW_MULL(a, dev_4_3_coefs[j] + a1);
282 a = (1 << POW_FRAC_BITS) + a1;
283 /* exponent compute (exact) */
284 e = e * 4;
285 er = e % 3;
286 eq = e / 3;
287 a = POW_MULL(a, pow_mult3[er]);
288 while (a >= 2 * POW_FRAC_ONE) {
289 a = a >> 1;
290 eq++;
291 }
292 /* convert to float */
293 while (a < POW_FRAC_ONE) {
294 a = a << 1;
295 eq--;
296 }
297 /* now POW_FRAC_ONE <= a < 2 * POW_FRAC_ONE */
298 #if POW_FRAC_BITS > FRAC_BITS
299 a = (a + (1 << (POW_FRAC_BITS - FRAC_BITS - 1))) >> (POW_FRAC_BITS - FRAC_BITS);
300 /* correct overflow */
301 if (a >= 2 * (1 << FRAC_BITS)) {
302 a = a >> 1;
303 eq++;
304 }
305 #endif
306 *exp_ptr = eq;
307 return a;
308 }
309 #endif
310
311 static av_cold int decode_init(AVCodecContext * avctx)
312 {
313 MPADecodeContext *s = avctx->priv_data;
314 static int init=0;
315 int i, j, k;
316
317 s->avctx = avctx;
318
319 avctx->sample_fmt= OUT_FMT;
320 s->error_recognition= avctx->error_recognition;
321
322 if(avctx->antialias_algo != FF_AA_FLOAT)
323 s->compute_antialias= compute_antialias_integer;
324 else
325 s->compute_antialias= compute_antialias_float;
326
327 if (!init && !avctx->parse_only) {
328 int offset;
329
330 /* scale factors table for layer 1/2 */
331 for(i=0;i<64;i++) {
332 int shift, mod;
333 /* 1.0 (i = 3) is normalized to 2 ^ FRAC_BITS */
334 shift = (i / 3);
335 mod = i % 3;
336 scale_factor_modshift[i] = mod | (shift << 2);
337 }
338
339 /* scale factor multiply for layer 1 */
340 for(i=0;i<15;i++) {
341 int n, norm;
342 n = i + 2;
343 norm = ((INT64_C(1) << n) * FRAC_ONE) / ((1 << n) - 1);
344 scale_factor_mult[i][0] = MULL(FIXR(1.0 * 2.0), norm, FRAC_BITS);
345 scale_factor_mult[i][1] = MULL(FIXR(0.7937005259 * 2.0), norm, FRAC_BITS);
346 scale_factor_mult[i][2] = MULL(FIXR(0.6299605249 * 2.0), norm, FRAC_BITS);
347 dprintf(avctx, "%d: norm=%x s=%x %x %x\n",
348 i, norm,
349 scale_factor_mult[i][0],
350 scale_factor_mult[i][1],
351 scale_factor_mult[i][2]);
352 }
353
354 ff_mpa_synth_init(window);
355
356 /* huffman decode tables */
357 offset = 0;
358 for(i=1;i<16;i++) {
359 const HuffTable *h = &mpa_huff_tables[i];
360 int xsize, x, y;
361 uint8_t tmp_bits [512];
362 uint16_t tmp_codes[512];
363
364 memset(tmp_bits , 0, sizeof(tmp_bits ));
365 memset(tmp_codes, 0, sizeof(tmp_codes));
366
367 xsize = h->xsize;
368
369 j = 0;
370 for(x=0;x<xsize;x++) {
371 for(y=0;y<xsize;y++){
372 tmp_bits [(x << 5) | y | ((x&&y)<<4)]= h->bits [j ];
373 tmp_codes[(x << 5) | y | ((x&&y)<<4)]= h->codes[j++];
374 }
375 }
376
377 /* XXX: fail test */
378 huff_vlc[i].table = huff_vlc_tables+offset;
379 huff_vlc[i].table_allocated = huff_vlc_tables_sizes[i];
380 init_vlc(&huff_vlc[i], 7, 512,
381 tmp_bits, 1, 1, tmp_codes, 2, 2,
382 INIT_VLC_USE_NEW_STATIC);
383 offset += huff_vlc_tables_sizes[i];
384 }
385 assert(offset == FF_ARRAY_ELEMS(huff_vlc_tables));
386
387 offset = 0;
388 for(i=0;i<2;i++) {
389 huff_quad_vlc[i].table = huff_quad_vlc_tables+offset;
390 huff_quad_vlc[i].table_allocated = huff_quad_vlc_tables_sizes[i];
391 init_vlc(&huff_quad_vlc[i], i == 0 ? 7 : 4, 16,
392 mpa_quad_bits[i], 1, 1, mpa_quad_codes[i], 1, 1,
393 INIT_VLC_USE_NEW_STATIC);
394 offset += huff_quad_vlc_tables_sizes[i];
395 }
396 assert(offset == FF_ARRAY_ELEMS(huff_quad_vlc_tables));
397
398 for(i=0;i<9;i++) {
399 k = 0;
400 for(j=0;j<22;j++) {
401 band_index_long[i][j] = k;
402 k += band_size_long[i][j];
403 }
404 band_index_long[i][22] = k;
405 }
406
407 /* compute n ^ (4/3) and store it in mantissa/exp format */
408
409 int_pow_init();
410 for(i=1;i<TABLE_4_3_SIZE;i++) {
411 double value = i/4;
412 double f, fm;
413 int e, m;
414 f = value * cbrtf(value) * pow(2, (i&3)*0.25);
415 fm = frexp(f, &e);
416 m = (uint32_t)(fm*(1LL<<31) + 0.5);
417 e+= FRAC_BITS - 31 + 5 - 100;
418
419 /* normalized to FRAC_BITS */
420 table_4_3_value[i] = m;
421 table_4_3_exp[i] = -e;
422 }
423 for(i=0; i<512*16; i++){
424 double value = i & 15;
425 int exponent= (i>>4);
426 double f= value * cbrtf(value) * pow(2, (exponent-400)*0.25 + FRAC_BITS + 5);
427 expval_table[exponent][i&15]= llrint(f);
428 if((i&15)==1)
429 exp_table[exponent]= llrint(f);
430 }
431
432 for(i=0;i<7;i++) {
433 float f;
434 int v;
435 if (i != 6) {
436 f = tan((double)i * M_PI / 12.0);
437 v = FIXR(f / (1.0 + f));
438 } else {
439 v = FIXR(1.0);
440 }
441 is_table[0][i] = v;
442 is_table[1][6 - i] = v;
443 }
444 /* invalid values */
445 for(i=7;i<16;i++)
446 is_table[0][i] = is_table[1][i] = 0.0;
447
448 for(i=0;i<16;i++) {
449 double f;
450 int e, k;
451
452 for(j=0;j<2;j++) {
453 e = -(j + 1) * ((i + 1) >> 1);
454 f = pow(2.0, e / 4.0);
455 k = i & 1;
456 is_table_lsf[j][k ^ 1][i] = FIXR(f);
457 is_table_lsf[j][k][i] = FIXR(1.0);
458 dprintf(avctx, "is_table_lsf %d %d: %x %x\n",
459 i, j, is_table_lsf[j][0][i], is_table_lsf[j][1][i]);
460 }
461 }
462
463 for(i=0;i<8;i++) {
464 float ci, cs, ca;
465 ci = ci_table[i];
466 cs = 1.0 / sqrt(1.0 + ci * ci);
467 ca = cs * ci;
468 csa_table[i][0] = FIXHR(cs/4);
469 csa_table[i][1] = FIXHR(ca/4);
470 csa_table[i][2] = FIXHR(ca/4) + FIXHR(cs/4);
471 csa_table[i][3] = FIXHR(ca/4) - FIXHR(cs/4);
472 csa_table_float[i][0] = cs;
473 csa_table_float[i][1] = ca;
474 csa_table_float[i][2] = ca + cs;
475 csa_table_float[i][3] = ca - cs;
476 }
477
478 /* compute mdct windows */
479 for(i=0;i<36;i++) {
480 for(j=0; j<4; j++){
481 double d;
482
483 if(j==2 && i%3 != 1)
484 continue;
485
486 d= sin(M_PI * (i + 0.5) / 36.0);
487 if(j==1){
488 if (i>=30) d= 0;
489 else if(i>=24) d= sin(M_PI * (i - 18 + 0.5) / 12.0);
490 else if(i>=18) d= 1;
491 }else if(j==3){
492 if (i< 6) d= 0;
493 else if(i< 12) d= sin(M_PI * (i - 6 + 0.5) / 12.0);
494 else if(i< 18) d= 1;
495 }
496 //merge last stage of imdct into the window coefficients
497 d*= 0.5 / cos(M_PI*(2*i + 19)/72);
498
499 if(j==2)
500 mdct_win[j][i/3] = FIXHR((d / (1<<5)));
501 else
502 mdct_win[j][i ] = FIXHR((d / (1<<5)));
503 }
504 }
505
506 /* NOTE: we do frequency inversion adter the MDCT by changing
507 the sign of the right window coefs */
508 for(j=0;j<4;j++) {
509 for(i=0;i<36;i+=2) {
510 mdct_win[j + 4][i] = mdct_win[j][i];
511 mdct_win[j + 4][i + 1] = -mdct_win[j][i + 1];
512 }
513 }
514
515 init = 1;
516 }
517
518 if (avctx->codec_id == CODEC_ID_MP3ADU)
519 s->adu_mode = 1;
520 return 0;
521 }
522
523 /* tab[i][j] = 1.0 / (2.0 * cos(pi*(2*k+1) / 2^(6 - j))) */
524
525 /* cos(i*pi/64) */
526
527 #define COS0_0 FIXHR(0.50060299823519630134/2)
528 #define COS0_1 FIXHR(0.50547095989754365998/2)
529 #define COS0_2 FIXHR(0.51544730992262454697/2)
530 #define COS0_3 FIXHR(0.53104259108978417447/2)
531 #define COS0_4 FIXHR(0.55310389603444452782/2)
532 #define COS0_5 FIXHR(0.58293496820613387367/2)
533 #define COS0_6 FIXHR(0.62250412303566481615/2)
534 #define COS0_7 FIXHR(0.67480834145500574602/2)
535 #define COS0_8 FIXHR(0.74453627100229844977/2)
536 #define COS0_9 FIXHR(0.83934964541552703873/2)
537 #define COS0_10 FIXHR(0.97256823786196069369/2)
538 #define COS0_11 FIXHR(1.16943993343288495515/4)
539 #define COS0_12 FIXHR(1.48416461631416627724/4)
540 #define COS0_13 FIXHR(2.05778100995341155085/8)
541 #define COS0_14 FIXHR(3.40760841846871878570/8)
542 #define COS0_15 FIXHR(10.19000812354805681150/32)
543
544 #define COS1_0 FIXHR(0.50241928618815570551/2)
545 #define COS1_1 FIXHR(0.52249861493968888062/2)
546 #define COS1_2 FIXHR(0.56694403481635770368/2)
547 #define COS1_3 FIXHR(0.64682178335999012954/2)
548 #define COS1_4 FIXHR(0.78815462345125022473/2)
549 #define COS1_5 FIXHR(1.06067768599034747134/4)
550 #define COS1_6 FIXHR(1.72244709823833392782/4)
551 #define COS1_7 FIXHR(5.10114861868916385802/16)
552
553 #define COS2_0 FIXHR(0.50979557910415916894/2)
554 #define COS2_1 FIXHR(0.60134488693504528054/2)
555 #define COS2_2 FIXHR(0.89997622313641570463/2)
556 #define COS2_3 FIXHR(2.56291544774150617881/8)
557
558 #define COS3_0 FIXHR(0.54119610014619698439/2)
559 #define COS3_1 FIXHR(1.30656296487637652785/4)
560
561 #define COS4_0 FIXHR(0.70710678118654752439/2)
562
563 /* butterfly operator */
564 #define BF(a, b, c, s)\
565 {\
566 tmp0 = tab[a] + tab[b];\
567 tmp1 = tab[a] - tab[b];\
568 tab[a] = tmp0;\
569 tab[b] = MULH(tmp1<<(s), c);\
570 }
571
572 #define BF1(a, b, c, d)\
573 {\
574 BF(a, b, COS4_0, 1);\
575 BF(c, d,-COS4_0, 1);\
576 tab[c] += tab[d];\
577 }
578
579 #define BF2(a, b, c, d)\
580 {\
581 BF(a, b, COS4_0, 1);\
582 BF(c, d,-COS4_0, 1);\
583 tab[c] += tab[d];\
584 tab[a] += tab[c];\
585 tab[c] += tab[b];\
586 tab[b] += tab[d];\
587 }
588
589 #define ADD(a, b) tab[a] += tab[b]
590
591 /* DCT32 without 1/sqrt(2) coef zero scaling. */
592 static void dct32(int32_t *out, int32_t *tab)
593 {
594 int tmp0, tmp1;
595
596 /* pass 1 */
597 BF( 0, 31, COS0_0 , 1);
598 BF(15, 16, COS0_15, 5);
599 /* pass 2 */
600 BF( 0, 15, COS1_0 , 1);
601 BF(16, 31,-COS1_0 , 1);
602 /* pass 1 */
603 BF( 7, 24, COS0_7 , 1);
604 BF( 8, 23, COS0_8 , 1);
605 /* pass 2 */
606 BF( 7, 8, COS1_7 , 4);
607 BF(23, 24,-COS1_7 , 4);
608 /* pass 3 */
609 BF( 0, 7, COS2_0 , 1);
610 BF( 8, 15,-COS2_0 , 1);
611 BF(16, 23, COS2_0 , 1);
612 BF(24, 31,-COS2_0 , 1);
613 /* pass 1 */
614 BF( 3, 28, COS0_3 , 1);
615 BF(12, 19, COS0_12, 2);
616 /* pass 2 */
617 BF( 3, 12, COS1_3 , 1);
618 BF(19, 28,-COS1_3 , 1);
619 /* pass 1 */
620 BF( 4, 27, COS0_4 , 1);
621 BF(11, 20, COS0_11, 2);
622 /* pass 2 */
623 BF( 4, 11, COS1_4 , 1);
624 BF(20, 27,-COS1_4 , 1);
625 /* pass 3 */
626 BF( 3, 4, COS2_3 , 3);
627 BF(11, 12,-COS2_3 , 3);
628 BF(19, 20, COS2_3 , 3);
629 BF(27, 28,-COS2_3 , 3);
630 /* pass 4 */
631 BF( 0, 3, COS3_0 , 1);
632 BF( 4, 7,-COS3_0 , 1);
633 BF( 8, 11, COS3_0 , 1);
634 BF(12, 15,-COS3_0 , 1);
635 BF(16, 19, COS3_0 , 1);
636 BF(20, 23,-COS3_0 , 1);
637 BF(24, 27, COS3_0 , 1);
638 BF(28, 31,-COS3_0 , 1);
639
640
641
642 /* pass 1 */
643 BF( 1, 30, COS0_1 , 1);
644 BF(14, 17, COS0_14, 3);
645 /* pass 2 */
646 BF( 1, 14, COS1_1 , 1);
647 BF(17, 30,-COS1_1 , 1);
648 /* pass 1 */
649 BF( 6, 25, COS0_6 , 1);
650 BF( 9, 22, COS0_9 , 1);
651 /* pass 2 */
652 BF( 6, 9, COS1_6 , 2);
653 BF(22, 25,-COS1_6 , 2);
654 /* pass 3 */
655 BF( 1, 6, COS2_1 , 1);
656 BF( 9, 14,-COS2_1 , 1);
657 BF(17, 22, COS2_1 , 1);
658 BF(25, 30,-COS2_1 , 1);
659
660 /* pass 1 */
661 BF( 2, 29, COS0_2 , 1);
662 BF(13, 18, COS0_13, 3);
663 /* pass 2 */
664 BF( 2, 13, COS1_2 , 1);
665 BF(18, 29,-COS1_2 , 1);
666 /* pass 1 */
667 BF( 5, 26, COS0_5 , 1);
668 BF(10, 21, COS0_10, 1);
669 /* pass 2 */
670 BF( 5, 10, COS1_5 , 2);
671 BF(21, 26,-COS1_5 , 2);
672 /* pass 3 */
673 BF( 2, 5, COS2_2 , 1);
674 BF(10, 13,-COS2_2 , 1);
675 BF(18, 21, COS2_2 , 1);
676 BF(26, 29,-COS2_2 , 1);
677 /* pass 4 */
678 BF( 1, 2, COS3_1 , 2);
679 BF( 5, 6,-COS3_1 , 2);
680 BF( 9, 10, COS3_1 , 2);
681 BF(13, 14,-COS3_1 , 2);
682 BF(17, 18, COS3_1 , 2);
683 BF(21, 22,-COS3_1 , 2);
684 BF(25, 26, COS3_1 , 2);
685 BF(29, 30,-COS3_1 , 2);
686
687 /* pass 5 */
688 BF1( 0, 1, 2, 3);
689 BF2( 4, 5, 6, 7);
690 BF1( 8, 9, 10, 11);
691 BF2(12, 13, 14, 15);
692 BF1(16, 17, 18, 19);
693 BF2(20, 21, 22, 23);
694 BF1(24, 25, 26, 27);
695 BF2(28, 29, 30, 31);
696
697 /* pass 6 */
698
699 ADD( 8, 12);
700 ADD(12, 10);
701 ADD(10, 14);
702 ADD(14, 9);
703 ADD( 9, 13);
704 ADD(13, 11);
705 ADD(11, 15);
706
707 out[ 0] = tab[0];
708 out[16] = tab[1];
709 out[ 8] = tab[2];
710 out[24] = tab[3];
711 out[ 4] = tab[4];
712 out[20] = tab[5];
713 out[12] = tab[6];
714 out[28] = tab[7];
715 out[ 2] = tab[8];
716 out[18] = tab[9];
717 out[10] = tab[10];
718 out[26] = tab[11];
719 out[ 6] = tab[12];
720 out[22] = tab[13];
721 out[14] = tab[14];
722 out[30] = tab[15];
723
724 ADD(24, 28);
725 ADD(28, 26);
726 ADD(26, 30);
727 ADD(30, 25);
728 ADD(25, 29);
729 ADD(29, 27);
730 ADD(27, 31);
731
732 out[ 1] = tab[16] + tab[24];
733 out[17] = tab[17] + tab[25];
734 out[ 9] = tab[18] + tab[26];
735 out[25] = tab[19] + tab[27];
736 out[ 5] = tab[20] + tab[28];
737 out[21] = tab[21] + tab[29];
738 out[13] = tab[22] + tab[30];
739 out[29] = tab[23] + tab[31];
740 out[ 3] = tab[24] + tab[20];
741 out[19] = tab[25] + tab[21];
742 out[11] = tab[26] + tab[22];
743 out[27] = tab[27] + tab[23];
744 out[ 7] = tab[28] + tab[18];
745 out[23] = tab[29] + tab[19];
746 out[15] = tab[30] + tab[17];
747 out[31] = tab[31];
748 }
749
750 #if FRAC_BITS <= 15
751
752 static inline int round_sample(int *sum)
753 {
754 int sum1;
755 sum1 = (*sum) >> OUT_SHIFT;
756 *sum &= (1<<OUT_SHIFT)-1;
757 return av_clip(sum1, OUT_MIN, OUT_MAX);
758 }
759
760 /* signed 16x16 -> 32 multiply add accumulate */
761 #define MACS(rt, ra, rb) MAC16(rt, ra, rb)
762
763 /* signed 16x16 -> 32 multiply */
764 #define MULS(ra, rb) MUL16(ra, rb)
765
766 #define MLSS(rt, ra, rb) MLS16(rt, ra, rb)
767
768 #else
769
770 static inline int round_sample(int64_t *sum)
771 {
772 int sum1;
773 sum1 = (int)((*sum) >> OUT_SHIFT);
774 *sum &= (1<<OUT_SHIFT)-1;
775 return av_clip(sum1, OUT_MIN, OUT_MAX);
776 }
777
778 # define MULS(ra, rb) MUL64(ra, rb)
779 # define MACS(rt, ra, rb) MAC64(rt, ra, rb)
780 # define MLSS(rt, ra, rb) MLS64(rt, ra, rb)
781 #endif
782
783 #define SUM8(op, sum, w, p) \
784 { \
785 op(sum, (w)[0 * 64], (p)[0 * 64]); \
786 op(sum, (w)[1 * 64], (p)[1 * 64]); \
787 op(sum, (w)[2 * 64], (p)[2 * 64]); \
788 op(sum, (w)[3 * 64], (p)[3 * 64]); \
789 op(sum, (w)[4 * 64], (p)[4 * 64]); \
790 op(sum, (w)[5 * 64], (p)[5 * 64]); \
791 op(sum, (w)[6 * 64], (p)[6 * 64]); \
792 op(sum, (w)[7 * 64], (p)[7 * 64]); \
793 }
794
795 #define SUM8P2(sum1, op1, sum2, op2, w1, w2, p) \
796 { \
797 int tmp;\
798 tmp = p[0 * 64];\
799 op1(sum1, (w1)[0 * 64], tmp);\
800 op2(sum2, (w2)[0 * 64], tmp);\
801 tmp = p[1 * 64];\
802 op1(sum1, (w1)[1 * 64], tmp);\
803 op2(sum2, (w2)[1 * 64], tmp);\
804 tmp = p[2 * 64];\
805 op1(sum1, (w1)[2 * 64], tmp);\
806 op2(sum2, (w2)[2 * 64], tmp);\
807 tmp = p[3 * 64];\
808 op1(sum1, (w1)[3 * 64], tmp);\
809 op2(sum2, (w2)[3 * 64], tmp);\
810 tmp = p[4 * 64];\
811 op1(sum1, (w1)[4 * 64], tmp);\
812 op2(sum2, (w2)[4 * 64], tmp);\
813 tmp = p[5 * 64];\
814 op1(sum1, (w1)[5 * 64], tmp);\
815 op2(sum2, (w2)[5 * 64], tmp);\
816 tmp = p[6 * 64];\
817 op1(sum1, (w1)[6 * 64], tmp);\
818 op2(sum2, (w2)[6 * 64], tmp);\
819 tmp = p[7 * 64];\
820 op1(sum1, (w1)[7 * 64], tmp);\
821 op2(sum2, (w2)[7 * 64], tmp);\
822 }
823
824 void av_cold ff_mpa_synth_init(MPA_INT *window)
825 {
826 int i;
827
828 /* max = 18760, max sum over all 16 coefs : 44736 */
829 for(i=0;i<257;i++) {
830 int v;
831 v = ff_mpa_enwindow[i];
832 #if WFRAC_BITS < 16
833 v = (v + (1 << (16 - WFRAC_BITS - 1))) >> (16 - WFRAC_BITS);
834 #endif
835 window[i] = v;
836 if ((i & 63) != 0)
837 v = -v;
838 if (i != 0)
839 window[512 - i] = v;
840 }
841 }
842
843 /* 32 sub band synthesis filter. Input: 32 sub band samples, Output:
844 32 samples. */
845 /* XXX: optimize by avoiding ring buffer usage */
846 void ff_mpa_synth_filter(MPA_INT *synth_buf_ptr, int *synth_buf_offset,
847 MPA_INT *window, int *dither_state,
848 OUT_INT *samples, int incr,
849 int32_t sb_samples[SBLIMIT])
850 {
851 register MPA_INT *synth_buf;
852 register const MPA_INT *w, *w2, *p;
853 int j, offset;
854 OUT_INT *samples2;
855 #if FRAC_BITS <= 15
856 int32_t tmp[32];
857 int sum, sum2;
858 #else
859 int64_t sum, sum2;
860 #endif
861
862 offset = *synth_buf_offset;
863 synth_buf = synth_buf_ptr + offset;
864
865 #if FRAC_BITS <= 15
866 dct32(tmp, sb_samples);
867 for(j=0;j<32;j++) {
868 /* NOTE: can cause a loss in precision if very high amplitude
869 sound */
870 synth_buf[j] = av_clip_int16(tmp[j]);
871 }
872 #else
873 dct32(synth_buf, sb_samples);
874 #endif
875
876 /* copy to avoid wrap */
877 memcpy(synth_buf + 512, synth_buf, 32 * sizeof(MPA_INT));
878
879 samples2 = samples + 31 * incr;
880 w = window;
881 w2 = window + 31;
882
883 sum = *dither_state;
884 p = synth_buf + 16;
885 SUM8(MACS, sum, w, p);
886 p = synth_buf + 48;
887 SUM8(MLSS, sum, w + 32, p);
888 *samples = round_sample(&sum);
889 samples += incr;
890 w++;
891
892 /* we calculate two samples at the same time to avoid one memory
893 access per two sample */
894 for(j=1;j<16;j++) {
895 sum2 = 0;
896 p = synth_buf + 16 + j;
897 SUM8P2(sum, MACS, sum2, MLSS, w, w2, p);
898 p = synth_buf + 48 - j;
899 SUM8P2(sum, MLSS, sum2, MLSS, w + 32, w2 + 32, p);
900
901 *samples = round_sample(&sum);
902 samples += incr;
903 sum += sum2;
904 *samples2 = round_sample(&sum);
905 samples2 -= incr;
906 w++;
907 w2--;
908 }
909
910 p = synth_buf + 32;
911 SUM8(MLSS, sum, w + 32, p);
912 *samples = round_sample(&sum);
913 *dither_state= sum;
914
915 offset = (offset - 32) & 511;
916 *synth_buf_offset = offset;
917 }
918
919 #define C3 FIXHR(0.86602540378443864676/2)
920
921 /* 0.5 / cos(pi*(2*i+1)/36) */
922 static const int icos36[9] = {
923 FIXR(0.50190991877167369479),
924 FIXR(0.51763809020504152469), //0
925 FIXR(0.55168895948124587824),
926 FIXR(0.61038729438072803416),
927 FIXR(0.70710678118654752439), //1
928 FIXR(0.87172339781054900991),
929 FIXR(1.18310079157624925896),
930 FIXR(1.93185165257813657349), //2
931 FIXR(5.73685662283492756461),
932 };
933
934 /* 0.5 / cos(pi*(2*i+1)/36) */
935 static const int icos36h[9] = {
936 FIXHR(0.50190991877167369479/2),
937 FIXHR(0.51763809020504152469/2), //0
938 FIXHR(0.55168895948124587824/2),
939 FIXHR(0.61038729438072803416/2),
940 FIXHR(0.70710678118654752439/2), //1
941 FIXHR(0.87172339781054900991/2),
942 FIXHR(1.18310079157624925896/4),
943 FIXHR(1.93185165257813657349/4), //2
944 // FIXHR(5.73685662283492756461),
945 };
946
947 /* 12 points IMDCT. We compute it "by hand" by factorizing obvious
948 cases. */
949 static void imdct12(int *out, int *in)
950 {
951 int in0, in1, in2, in3, in4, in5, t1, t2;
952
953 in0= in[0*3];
954 in1= in[1*3] + in[0*3];
955 in2= in[2*3] + in[1*3];
956 in3= in[3*3] + in[2*3];
957 in4= in[4*3] + in[3*3];
958 in5= in[5*3] + in[4*3];
959 in5 += in3;
960 in3 += in1;
961
962 in2= MULH(2*in2, C3);
963 in3= MULH(4*in3, C3);
964
965 t1 = in0 - in4;
966 t2 = MULH(2*(in1 - in5), icos36h[4]);
967
968 out[ 7]=
969 out[10]= t1 + t2;
970 out[ 1]=
971 out[ 4]= t1 - t2;
972
973 in0 += in4>>1;
974 in4 = in0 + in2;
975 in5 += 2*in1;
976 in1 = MULH(in5 + in3, icos36h[1]);
977 out[ 8]=
978 out[ 9]= in4 + in1;
979 out[ 2]=
980 out[ 3]= in4 - in1;
981
982 in0 -= in2;
983 in5 = MULH(2*(in5 - in3), icos36h[7]);
984 out[ 0]=
985 out[ 5]= in0 - in5;
986 out[ 6]=
987 out[11]= in0 + in5;
988 }
989
990 /* cos(pi*i/18) */
991 #define C1 FIXHR(0.98480775301220805936/2)
992 #define C2 FIXHR(0.93969262078590838405/2)
993 #define C3 FIXHR(0.86602540378443864676/2)
994 #define C4 FIXHR(0.76604444311897803520/2)
995 #define C5 FIXHR(0.64278760968653932632/2)
996 #define C6 FIXHR(0.5/2)
997 #define C7 FIXHR(0.34202014332566873304/2)
998 #define C8 FIXHR(0.17364817766693034885/2)
999
1000
1001 /* using Lee like decomposition followed by hand coded 9 points DCT */
1002 static void imdct36(int *out, int *buf, int *in, int *win)
1003 {
1004 int i, j, t0, t1, t2, t3, s0, s1, s2, s3;
1005 int tmp[18], *tmp1, *in1;
1006
1007 for(i=17;i>=1;i--)
1008 in[i] += in[i-1];
1009 for(i=17;i>=3;i-=2)
1010 in[i] += in[i-2];
1011
1012 for(j=0;j<2;j++) {
1013 tmp1 = tmp + j;
1014 in1 = in + j;
1015 #if 0
1016 //more accurate but slower
1017 int64_t t0, t1, t2, t3;
1018 t2 = in1[2*4] + in1[2*8] - in1[2*2];
1019
1020 t3 = (in1[2*0] + (int64_t)(in1[2*6]>>1))<<32;
1021 t1 = in1[2*0] - in1[2*6];
1022 tmp1[ 6] = t1 - (t2>>1);
1023 tmp1[16] = t1 + t2;
1024
1025 t0 = MUL64(2*(in1[2*2] + in1[2*4]), C2);
1026 t1 = MUL64( in1[2*4] - in1[2*8] , -2*C8);
1027 t2 = MUL64(2*(in1[2*2] + in1[2*8]), -C4);
1028
1029 tmp1[10] = (t3 - t0 - t2) >> 32;
1030 tmp1[ 2] = (t3 + t0 + t1) >> 32;
1031 tmp1[14] = (t3 + t2 - t1) >> 32;
1032
1033 tmp1[ 4] = MULH(2*(in1[2*5] + in1[2*7] - in1[2*1]), -C3);
1034 t2 = MUL64(2*(in1[2*1] + in1[2*5]), C1);
1035 t3 = MUL64( in1[2*5] - in1[2*7] , -2*C7);
1036 t0 = MUL64(2*in1[2*3], C3);
1037
1038 t1 = MUL64(2*(in1[2*1] + in1[2*7]), -C5);
1039
1040 tmp1[ 0] = (t2 + t3 + t0) >> 32;
1041 tmp1[12] = (t2 + t1 - t0) >> 32;
1042 tmp1[ 8] = (t3 - t1 - t0) >> 32;
1043 #else
1044 t2 = in1[2*4] + in1[2*8] - in1[2*2];
1045
1046 t3 = in1[2*0] + (in1[2*6]>>1);
1047 t1 = in1[2*0] - in1[2*6];
1048 tmp1[ 6] = t1 - (t2>>1);
1049 tmp1[16] = t1 + t2;
1050
1051 t0 = MULH(2*(in1[2*2] + in1[2*4]), C2);
1052 t1 = MULH( in1[2*4] - in1[2*8] , -2*C8);
1053 t2 = MULH(2*(in1[2*2] + in1[2*8]), -C4);
1054
1055 tmp1[10] = t3 - t0 - t2;
1056 tmp1[ 2] = t3 + t0 + t1;
1057 tmp1[14] = t3 + t2 - t1;
1058
1059 tmp1[ 4] = MULH(2*(in1[2*5] + in1[2*7] - in1[2*1]), -C3);
1060 t2 = MULH(2*(in1[2*1] + in1[2*5]), C1);
1061 t3 = MULH( in1[2*5] - in1[2*7] , -2*C7);
1062 t0 = MULH(2*in1[2*3], C3);
1063
1064 t1 = MULH(2*(in1[2*1] + in1[2*7]), -C5);
1065
1066 tmp1[ 0] = t2 + t3 + t0;
1067 tmp1[12] = t2 + t1 - t0;
1068 tmp1[ 8] = t3 - t1 - t0;
1069 #endif
1070 }
1071
1072 i = 0;
1073 for(j=0;j<4;j++) {
1074 t0 = tmp[i];
1075 t1 = tmp[i + 2];
1076 s0 = t1 + t0;
1077 s2 = t1 - t0;
1078
1079 t2 = tmp[i + 1];
1080 t3 = tmp[i + 3];
1081 s1 = MULH(2*(t3 + t2), icos36h[j]);
1082 s3 = MULL(t3 - t2, icos36[8 - j], FRAC_BITS);
1083
1084 t0 = s0 + s1;
1085 t1 = s0 - s1;
1086 out[(9 + j)*SBLIMIT] = MULH(t1, win[9 + j]) + buf[9 + j];
1087 out[(8 - j)*SBLIMIT] = MULH(t1, win[8 - j]) + buf[8 - j];
1088 buf[9 + j] = MULH(t0, win[18 + 9 + j]);
1089 buf[8 - j] = MULH(t0, win[18 + 8 - j]);
1090
1091 t0 = s2 + s3;
1092 t1 = s2 - s3;
1093 out[(9 + 8 - j)*SBLIMIT] = MULH(t1, win[9 + 8 - j]) + buf[9 + 8 - j];
1094 out[( j)*SBLIMIT] = MULH(t1, win[ j]) + buf[ j];
1095 buf[9 + 8 - j] = MULH(t0, win[18 + 9 + 8 - j]);
1096 buf[ + j] = MULH(t0, win[18 + j]);
1097 i += 4;
1098 }
1099
1100 s0 = tmp[16];
1101 s1 = MULH(2*tmp[17], icos36h[4]);
1102 t0 = s0 + s1;
1103 t1 = s0 - s1;
1104 out[(9 + 4)*SBLIMIT] = MULH(t1, win[9 + 4]) + buf[9 + 4];
1105 out[(8 - 4)*SBLIMIT] = MULH(t1, win[8 - 4]) + buf[8 - 4];
1106 buf[9 + 4] = MULH(t0, win[18 + 9 + 4]);
1107 buf[8 - 4] = MULH(t0, win[18 + 8 - 4]);
1108 }
1109
1110 /* return the number of decoded frames */
1111 static int mp_decode_layer1(MPADecodeContext *s)
1112 {
1113 int bound, i, v, n, ch, j, mant;
1114 uint8_t allocation[MPA_MAX_CHANNELS][SBLIMIT];
1115 uint8_t scale_factors[MPA_MAX_CHANNELS][SBLIMIT];
1116
1117 if (s->mode == MPA_JSTEREO)
1118 bound = (s->mode_ext + 1) * 4;
1119 else
1120 bound = SBLIMIT;
1121
1122 /* allocation bits */
1123 for(i=0;i<bound;i++) {
1124 for(ch=0;ch<s->nb_channels;ch++) {
1125 allocation[ch][i] = get_bits(&s->gb, 4);
1126 }
1127 }
1128 for(i=bound;i<SBLIMIT;i++) {
1129 allocation[0][i] = get_bits(&s->gb, 4);
1130 }
1131
1132 /* scale factors */
1133 for(i=0;i<bound;i++) {
1134 for(ch=0;ch<s->nb_channels;ch++) {
1135 if (allocation[ch][i])
1136 scale_factors[ch][i] = get_bits(&s->gb, 6);
1137 }
1138 }
1139 for(i=bound;i<SBLIMIT;i++) {
1140 if (allocation[0][i]) {
1141 scale_factors[0][i] = get_bits(&s->gb, 6);
1142 scale_factors[1][i] = get_bits(&s->gb, 6);
1143 }
1144 }
1145
1146 /* compute samples */
1147 for(j=0;j<12;j++) {
1148 for(i=0;i<bound;i++) {
1149 for(ch=0;ch<s->nb_channels;ch++) {
1150 n = allocation[ch][i];
1151 if (n) {
1152 mant = get_bits(&s->gb, n + 1);
1153 v = l1_unscale(n, mant, scale_factors[ch][i]);
1154 } else {
1155 v = 0;
1156 }
1157 s->sb_samples[ch][j][i] = v;
1158 }
1159 }
1160 for(i=bound;i<SBLIMIT;i++) {
1161 n = allocation[0][i];
1162 if (n) {
1163 mant = get_bits(&s->gb, n + 1);
1164 v = l1_unscale(n, mant, scale_factors[0][i]);
1165 s->sb_samples[0][j][i] = v;
1166 v = l1_unscale(n, mant, scale_factors[1][i]);
1167 s->sb_samples[1][j][i] = v;
1168 } else {
1169 s->sb_samples[0][j][i] = 0;
1170 s->sb_samples[1][j][i] = 0;
1171 }
1172 }
1173 }
1174 return 12;
1175 }
1176
1177 static int mp_decode_layer2(MPADecodeContext *s)
1178 {
1179 int sblimit; /* number of used subbands */
1180 const unsigned char *alloc_table;
1181 int table, bit_alloc_bits, i, j, ch, bound, v;
1182 unsigned char bit_alloc[MPA_MAX_CHANNELS][SBLIMIT];
1183 unsigned char scale_code[MPA_MAX_CHANNELS][SBLIMIT];
1184 unsigned char scale_factors[MPA_MAX_CHANNELS][SBLIMIT][3], *sf;
1185 int scale, qindex, bits, steps, k, l, m, b;
1186
1187 /* select decoding table */
1188 table = ff_mpa_l2_select_table(s->bit_rate / 1000, s->nb_channels,
1189 s->sample_rate, s->lsf);
1190 sblimit = ff_mpa_sblimit_table[table];
1191 alloc_table = ff_mpa_alloc_tables[table];
1192
1193 if (s->mode == MPA_JSTEREO)
1194 bound = (s->mode_ext + 1) * 4;
1195 else
1196 bound = sblimit;
1197
1198 dprintf(s->avctx, "bound=%d sblimit=%d\n", bound, sblimit);
1199
1200 /* sanity check */
1201 if( bound > sblimit ) bound = sblimit;
1202
1203 /* parse bit allocation */
1204 j = 0;
1205 for(i=0;i<bound;i++) {
1206 bit_alloc_bits = alloc_table[j];
1207 for(ch=0;ch<s->nb_channels;ch++) {
1208 bit_alloc[ch][i] = get_bits(&s->gb, bit_alloc_bits);
1209 }
1210 j += 1 << bit_alloc_bits;
1211 }
1212 for(i=bound;i<sblimit;i++) {
1213 bit_alloc_bits = alloc_table[j];
1214 v = get_bits(&s->gb, bit_alloc_bits);
1215 bit_alloc[0][i] = v;
1216 bit_alloc[1][i] = v;
1217 j += 1 << bit_alloc_bits;
1218 }
1219
1220 /* scale codes */
1221 for(i=0;i<sblimit;i++) {
1222 for(ch=0;ch<s->nb_channels;ch++) {
1223 if (bit_alloc[ch][i])
1224 scale_code[ch][i] = get_bits(&s->gb, 2);
1225 }
1226 }
1227
1228 /* scale factors */
1229 for(i=0;i<sblimit;i++) {
1230 for(ch=0;ch<s->nb_channels;ch++) {
1231 if (bit_alloc[ch][i]) {
1232 sf = scale_factors[ch][i];
1233 switch(scale_code[ch][i]) {
1234 default:
1235 case 0:
1236 sf[0] = get_bits(&s->gb, 6);
1237 sf[1] = get_bits(&s->gb, 6);
1238 sf[2] = get_bits(&s->gb, 6);
1239 break;
1240 case 2:
1241 sf[0] = get_bits(&s->gb, 6);
1242 sf[1] = sf[0];
1243 sf[2] = sf[0];
1244 break;
1245 case 1:
1246 sf[0] = get_bits(&s->gb, 6);
1247 sf[2] = get_bits(&s->gb, 6);
1248 sf[1] = sf[0];
1249 break;
1250 case 3:
1251 sf[0] = get_bits(&s->gb, 6);
1252 sf[2] = get_bits(&s->gb, 6);
1253 sf[1] = sf[2];
1254 break;
1255 }
1256 }
1257 }
1258 }
1259
1260 /* samples */
1261 for(k=0;k<3;k++) {
1262 for(l=0;l<12;l+=3) {
1263 j = 0;
1264 for(i=0;i<bound;i++) {
1265 bit_alloc_bits = alloc_table[j];
1266 for(ch=0;ch<s->nb_channels;ch++) {
1267 b = bit_alloc[ch][i];
1268 if (b) {
1269 scale = scale_factors[ch][i][k];
1270 qindex = alloc_table[j+b];
1271 bits = ff_mpa_quant_bits[qindex];
1272 if (bits < 0) {
1273 /* 3 values at the same time */
1274 v = get_bits(&s->gb, -bits);
1275 steps = ff_mpa_quant_steps[qindex];
1276 s->sb_samples[ch][k * 12 + l + 0][i] =
1277 l2_unscale_group(steps, v % steps, scale);
1278 v = v / steps;
1279 s->sb_samples[ch][k * 12 + l + 1][i] =
1280 l2_unscale_group(steps, v % steps, scale);
1281 v = v / steps;
1282 s->sb_samples[ch][k * 12 + l + 2][i] =
1283 l2_unscale_group(steps, v, scale);
1284 } else {
1285 for(m=0;m<3;m++) {
1286 v = get_bits(&s->gb, bits);
1287 v = l1_unscale(bits - 1, v, scale);
1288 s->sb_samples[ch][k * 12 + l + m][i] = v;
1289 }
1290 }
1291 } else {
1292 s->sb_samples[ch][k * 12 + l + 0][i] = 0;
1293 s->sb_samples[ch][k * 12 + l + 1][i] = 0;
1294 s->sb_samples[ch][k * 12 + l + 2][i] = 0;
1295 }
1296 }
1297 /* next subband in alloc table */
1298 j += 1 << bit_alloc_bits;
1299 }
1300 /* XXX: find a way to avoid this duplication of code */
1301 for(i=bound;i<sblimit;i++) {
1302 bit_alloc_bits = alloc_table[j];
1303 b = bit_alloc[0][i];
1304 if (b) {
1305 int mant, scale0, scale1;
1306 scale0 = scale_factors[0][i][k];
1307 scale1 = scale_factors[1][i][k];
1308 qindex = alloc_table[j+b];
1309 bits = ff_mpa_quant_bits[qindex];
1310 if (bits < 0) {
1311 /* 3 values at the same time */
1312 v = get_bits(&s->gb, -bits);
1313 steps = ff_mpa_quant_steps[qindex];
1314 mant = v % steps;
1315 v = v / steps;
1316 s->sb_samples[0][k * 12 + l + 0][i] =
1317 l2_unscale_group(steps, mant, scale0);
1318 s->sb_samples[1][k * 12 + l + 0][i] =
1319 l2_unscale_group(steps, mant, scale1);
1320 mant = v % steps;
1321 v = v / steps;
1322 s->sb_samples[0][k * 12 + l + 1][i] =
1323 l2_unscale_group(steps, mant, scale0);
1324 s->sb_samples[1][k * 12 + l + 1][i] =
1325 l2_unscale_group(steps, mant, scale1);
1326 s->sb_samples[0][k * 12 + l + 2][i] =
1327 l2_unscale_group(steps, v, scale0);
1328 s->sb_samples[1][k * 12 + l + 2][i] =
1329 l2_unscale_group(steps, v, scale1);
1330 } else {
1331 for(m=0;m<3;m++) {
1332 mant = get_bits(&s->gb, bits);
1333 s->sb_samples[0][k * 12 + l + m][i] =
1334 l1_unscale(bits - 1, mant, scale0);
1335 s->sb_samples[1][k * 12 + l + m][i] =
1336 l1_unscale(bits - 1, mant, scale1);
1337 }
1338 }
1339 } else {
1340 s->sb_samples[0][k * 12 + l + 0][i] = 0;
1341 s->sb_samples[0][k * 12 + l + 1][i] = 0;
1342 s->sb_samples[0][k * 12 + l + 2][i] = 0;
1343 s->sb_samples[1][k * 12 + l + 0][i] = 0;
1344 s->sb_samples[1][k * 12 + l + 1][i] = 0;
1345 s->sb_samples[1][k * 12 + l + 2][i] = 0;
1346 }
1347 /* next subband in alloc table */
1348 j += 1 << bit_alloc_bits;
1349 }
1350 /* fill remaining samples to zero */
1351 for(i=sblimit;i<SBLIMIT;i++) {
1352 for(ch=0;ch<s->nb_channels;ch++) {
1353 s->sb_samples[ch][k * 12 + l + 0][i] = 0;
1354 s->sb_samples[ch][k * 12 + l + 1][i] = 0;
1355 s->sb_samples[ch][k * 12 + l + 2][i] = 0;
1356 }
1357 }
1358 }
1359 }
1360 return 3 * 12;
1361 }
1362
1363 static inline void lsf_sf_expand(int *slen,
1364 int sf, int n1, int n2, int n3)
1365 {
1366 if (n3) {
1367 slen[3] = sf % n3;
1368 sf /= n3;
1369 } else {
1370 slen[3] = 0;
1371 }
1372 if (n2) {
1373 slen[2] = sf % n2;
1374 sf /= n2;
1375 } else {
1376 slen[2] = 0;
1377 }
1378 slen[1] = sf % n1;
1379 sf /= n1;
1380 slen[0] = sf;
1381 }
1382
1383 static void exponents_from_scale_factors(MPADecodeContext *s,
1384 GranuleDef *g,
1385 int16_t *exponents)
1386 {
1387 const uint8_t *bstab, *pretab;
1388 int len, i, j, k, l, v0, shift, gain, gains[3];
1389 int16_t *exp_ptr;
1390
1391 exp_ptr = exponents;
1392 gain = g->global_gain - 210;
1393 shift = g->scalefac_scale + 1;
1394
1395 bstab = band_size_long[s->sample_rate_index];
1396 pretab = mpa_pretab[g->preflag];
1397 for(i=0;i<g->long_end;i++) {
1398 v0 = gain - ((g->scale_factors[i] + pretab[i]) << shift) + 400;
1399 len = bstab[i];
1400 for(j=len;j>0;j--)
1401 *exp_ptr++ = v0;
1402 }
1403
1404 if (g->short_start < 13) {
1405 bstab = band_size_short[s->sample_rate_index];
1406 gains[0] = gain - (g->subblock_gain[0] << 3);
1407 gains[1] = gain - (g->subblock_gain[1] << 3);
1408 gains[2] = gain - (g->subblock_gain[2] << 3);
1409 k = g->long_end;
1410 for(i=g->short_start;i<13;i++) {
1411 len = bstab[i];
1412 for(l=0;l<3;l++) {
1413 v0 = gains[l] - (g->scale_factors[k++] << shift) + 400;
1414 for(j=len;j>0;j--)
1415 *exp_ptr++ = v0;
1416 }
1417 }
1418 }
1419 }
1420
1421 /* handle n = 0 too */
1422 static inline int get_bitsz(GetBitContext *s, int n)
1423 {
1424 if (n == 0)
1425 return 0;
1426 else
1427 return get_bits(s, n);
1428 }
1429
1430
1431 static void switch_buffer(MPADecodeContext *s, int *pos, int *end_pos, int *end_pos2){
1432 if(s->in_gb.buffer && *pos >= s->gb.size_in_bits){
1433 s->gb= s->in_gb;
1434 s->in_gb.buffer=NULL;
1435 assert((get_bits_count(&s->gb) & 7) == 0);
1436 skip_bits_long(&s->gb, *pos - *end_pos);
1437 *end_pos2=
1438 *end_pos= *end_pos2 + get_bits_count(&s->gb) - *pos;
1439 *pos= get_bits_count(&s->gb);
1440 }
1441 }
1442
1443 static int huffman_decode(MPADecodeContext *s, GranuleDef *g,
1444 int16_t *exponents, int end_pos2)
1445 {
1446 int s_index;
1447 int i;
1448 int last_pos, bits_left;
1449 VLC *vlc;
1450 int end_pos= FFMIN(end_pos2, s->gb.size_in_bits);
1451
1452 /* low frequencies (called big values) */
1453 s_index = 0;
1454 for(i=0;i<3;i++) {
1455 int j, k, l, linbits;
1456 j = g->region_size[i];
1457 if (j == 0)
1458 continue;
1459 /* select vlc table */
1460 k = g->table_select[i];
1461 l = mpa_huff_data[k][0];
1462 linbits = mpa_huff_data[k][1];
1463 vlc = &huff_vlc[l];
1464
1465 if(!l){
1466 memset(&g->sb_hybrid[s_index], 0, sizeof(*g->sb_hybrid)*2*j);
1467 s_index += 2*j;
1468 continue;
1469 }
1470
1471 /* read huffcode and compute each couple */
1472 for(;j>0;j--) {
1473 int exponent, x, y, v;
1474 int pos= get_bits_count(&s->gb);
1475
1476 if (pos >= end_pos){
1477 // av_log(NULL, AV_LOG_ERROR, "pos: %d %d %d %d\n", pos, end_pos, end_pos2, s_index);
1478 switch_buffer(s, &pos, &end_pos, &end_pos2);
1479 // av_log(NULL, AV_LOG_ERROR, "new pos: %d %d\n", pos, end_pos);
1480 if(pos >= end_pos)
1481 break;
1482 }
1483 y = get_vlc2(&s->gb, vlc->table, 7, 3);
1484
1485 if(!y){
1486 g->sb_hybrid[s_index ] =
1487 g->sb_hybrid[s_index+1] = 0;
1488 s_index += 2;
1489 continue;
1490 }
1491
1492 exponent= exponents[s_index];
1493
1494 dprintf(s->avctx, "region=%d n=%d x=%d y=%d exp=%d\n",
1495 i, g->region_size[i] - j, x, y, exponent);
1496 if(y&16){
1497 x = y >> 5;
1498 y = y & 0x0f;
1499 if (x < 15){
1500 v = expval_table[ exponent ][ x ];
1501 // v = expval_table[ (exponent&3) ][ x ] >> FFMIN(0 - (exponent>>2), 31);
1502 }else{
1503 x += get_bitsz(&s->gb, linbits);
1504 v = l3_unscale(x, exponent);
1505 }
1506 if (get_bits1(&s->gb))
1507 v = -v;
1508 g->sb_hybrid[s_index] = v;
1509 if (y < 15){
1510 v = expval_table[ exponent ][ y ];
1511 }else{
1512 y += get_bitsz(&s->gb, linbits);
1513 v = l3_unscale(y, exponent);
1514 }
1515 if (get_bits1(&s->gb))
1516 v = -v;
1517 g->sb_hybrid[s_index+1] = v;
1518 }else{
1519 x = y >> 5;
1520 y = y & 0x0f;
1521 x += y;
1522 if (x < 15){
1523 v = expval_table[ exponent ][ x ];
1524 }else{
1525 x += get_bitsz(&s->gb, linbits);
1526 v = l3_unscale(x, exponent);
1527 }
1528 if (get_bits1(&s->gb))
1529 v = -v;
1530 g->sb_hybrid[s_index+!!y] = v;
1531 g->sb_hybrid[s_index+ !y] = 0;
1532 }
1533 s_index+=2;
1534 }
1535 }
1536
1537 /* high frequencies */
1538 vlc = &huff_quad_vlc[g->count1table_select];
1539 last_pos=0;
1540 while (s_index <= 572) {
1541 int pos, code;
1542 pos = get_bits_count(&s->gb);
1543 if (pos >= end_pos) {
1544 if (pos > end_pos2 && last_pos){
1545 /* some encoders generate an incorrect size for this
1546 part. We must go back into the data */
1547 s_index -= 4;
1548 skip_bits_long(&s->gb, last_pos - pos);
1549 av_log(s->avctx, AV_LOG_INFO, "overread, skip %d enddists: %d %d\n", last_pos - pos, end_pos-pos, end_pos2-pos);
1550 if(s->error_recognition >= FF_ER_COMPLIANT)
1551 s_index=0;
1552 break;
1553 }
1554 // av_log(NULL, AV_LOG_ERROR, "pos2: %d %d %d %d\n", pos, end_pos, end_pos2, s_index);
1555 switch_buffer(s, &pos, &end_pos, &end_pos2);
1556 // av_log(NULL, AV_LOG_ERROR, "new pos2: %d %d %d\n", pos, end_pos, s_index);
1557 if(pos >= end_pos)
1558 break;
1559 }
1560 last_pos= pos;
1561
1562 code = get_vlc2(&s->gb, vlc->table, vlc->bits, 1);
1563 dprintf(s->avctx, "t=%d code=%d\n", g->count1table_select, code);
1564 g->sb_hybrid[s_index+0]=
1565 g->sb_hybrid[s_index+1]=
1566 g->sb_hybrid[s_index+2]=
1567 g->sb_hybrid[s_index+3]= 0;
1568 while(code){
1569 static const int idxtab[16]={3,3,2,2,1,1,1,1,0,0,0,0,0,0,0,0};
1570 int v;
1571 int pos= s_index+idxtab[code];
1572 code ^= 8>>idxtab[code];
1573 v = exp_table[ exponents[pos] ];
1574 // v = exp_table[ (exponents[pos]&3) ] >> FFMIN(0 - (exponents[pos]>>2), 31);
1575 if(get_bits1(&s->gb))
1576 v = -v;
1577 g->sb_hybrid[pos] = v;
1578 }
1579 s_index+=4;
1580 }
1581 /* skip extension bits */
1582 bits_left = end_pos2 - get_bits_count(&s->gb);
1583 //av_log(NULL, AV_LOG_ERROR, "left:%d buf:%p\n", bits_left, s->in_gb.buffer);
1584 if (bits_left < 0 && s->error_recognition >= FF_ER_COMPLIANT) {
1585 av_log(s->avctx, AV_LOG_ERROR, "bits_left=%d\n", bits_left);
1586 s_index=0;
1587 }else if(bits_left > 0 && s->error_recognition >= FF_ER_AGGRESSIVE){
1588 av_log(s->avctx, AV_LOG_ERROR, "bits_left=%d\n", bits_left);
1589 s_index=0;
1590 }
1591 memset(&g->sb_hybrid[s_index], 0, sizeof(*g->sb_hybrid)*(576 - s_index));
1592 skip_bits_long(&s->gb, bits_left);
1593
1594 i= get_bits_count(&s->gb);
1595 switch_buffer(s, &i, &end_pos, &end_pos2);
1596
1597 return 0;
1598 }
1599
1600 /* Reorder short blocks from bitstream order to interleaved order. It
1601 would be faster to do it in parsing, but the code would be far more
1602 complicated */
1603 static void reorder_block(MPADecodeContext *s, GranuleDef *g)
1604 {
1605 int i, j, len;
1606 int32_t *ptr, *dst, *ptr1;
1607 int32_t tmp[576];
1608
1609 if (g->block_type != 2)
1610 return;
1611
1612 if (g->switch_point) {
1613 if (s->sample_rate_index != 8) {
1614 ptr = g->sb_hybrid + 36;
1615 } else {
1616 ptr = g->sb_hybrid + 48;
1617 }
1618 } else {
1619 ptr = g->sb_hybrid;
1620 }
1621
1622 for(i=g->short_start;i<13;i++) {
1623 len = band_size_short[s->sample_rate_index][i];
1624 ptr1 = ptr;
1625 dst = tmp;
1626 for(j=len;j>0;j--) {
1627 *dst++ = ptr[0*len];
1628 *dst++ = ptr[1*len];
1629 *dst++ = ptr[2*len];
1630 ptr++;
1631 }
1632 ptr+=2*len;
1633 memcpy(ptr1, tmp, len * 3 * sizeof(*ptr1));
1634 }
1635 }
1636
1637 #define ISQRT2 FIXR(0.70710678118654752440)
1638
1639 static void compute_stereo(MPADecodeContext *s,
1640 GranuleDef *g0, GranuleDef *g1)
1641 {
1642 int i, j, k, l;
1643 int32_t v1, v2;
1644 int sf_max, tmp0, tmp1, sf, len, non_zero_found;
1645 int32_t (*is_tab)[16];
1646 int32_t *tab0, *tab1;
1647 int non_zero_found_short[3];
1648
1649 /* intensity stereo */
1650 if (s->mode_ext & MODE_EXT_I_STEREO) {
1651 if (!s->lsf) {
1652 is_tab = is_table;
1653 sf_max = 7;
1654 } else {
1655 is_tab = is_table_lsf[g1->scalefac_compress & 1];
1656 sf_max = 16;
1657 }
1658
1659 tab0 = g0->sb_hybrid + 576;
1660 tab1 = g1->sb_hybrid + 576;
1661
1662 non_zero_found_short[0] = 0;
1663 non_zero_found_short[1] = 0;
1664 non_zero_found_short[2] = 0;
1665 k = (13 - g1->short_start) * 3 + g1->long_end - 3;
1666 for(i = 12;i >= g1->short_start;i--) {
1667 /* for last band, use previous scale factor */
1668 if (i != 11)
1669 k -= 3;
1670 len = band_size_short[s->sample_rate_index][i];
1671 for(l=2;l>=0;l--) {
1672 tab0 -= len;
1673 tab1 -= len;
1674 if (!non_zero_found_short[l]) {
1675 /* test if non zero band. if so, stop doing i-stereo */
1676 for(j=0;j<len;j++) {
1677 if (tab1[j] != 0) {
1678 non_zero_found_short[l] = 1;
1679 goto found1;
1680 }
1681 }
1682 sf = g1->scale_factors[k + l];
1683 if (sf >= sf_max)
1684 goto found1;
1685
1686 v1 = is_tab[0][sf];
1687 v2 = is_tab[1][sf];
1688 for(j=0;j<len;j++) {
1689 tmp0 = tab0[j];
1690 tab0[j] = MULL(tmp0, v1, FRAC_BITS);
1691 tab1[j] = MULL(tmp0, v2, FRAC_BITS);
1692 }
1693 } else {
1694 found1:
1695 if (s->mode_ext & MODE_EXT_MS_STEREO) {
1696 /* lower part of the spectrum : do ms stereo
1697 if enabled */
1698 for(j=0;j<len;j++) {
1699 tmp0 = tab0[j];
1700 tmp1 = tab1[j];
1701 tab0[j] = MULL(tmp0 + tmp1, ISQRT2, FRAC_BITS);
1702 tab1[j] = MULL(tmp0 - tmp1, ISQRT2, FRAC_BITS);
1703 }
1704 }
1705 }
1706 }
1707 }
1708
1709 non_zero_found = non_zero_found_short[0] |
1710 non_zero_found_short[1] |
1711 non_zero_found_short[2];
1712
1713 for(i = g1->long_end - 1;i >= 0;i--) {
1714 len = band_size_long[s->sample_rate_index][i];
1715 tab0 -= len;
1716 tab1 -= len;
1717 /* test if non zero band. if so, stop doing i-stereo */
1718 if (!non_zero_found) {
1719 for(j=0;j<len;j++) {
1720 if (tab1[j] != 0) {
1721 non_zero_found = 1;
1722 goto found2;
1723 }
1724 }
1725 /* for last band, use previous scale factor */
1726 k = (i == 21) ? 20 : i;
1727 sf = g1->scale_factors[k];
1728 if (sf >= sf_max)
1729 goto found2;
1730 v1 = is_tab[0][sf];
1731 v2 = is_tab[1][sf];
1732 for(j=0;j<len;j++) {
1733 tmp0 = tab0[j];
1734 tab0[j] = MULL(tmp0, v1, FRAC_BITS);
1735 tab1[j] = MULL(tmp0, v2, FRAC_BITS);
1736 }
1737 } else {
1738 found2:
1739 if (s->mode_ext & MODE_EXT_MS_STEREO) {
1740 /* lower part of the spectrum : do ms stereo
1741 if enabled */
1742 for(j=0;j<len;j++) {
1743 tmp0 = tab0[j];
1744 tmp1 = tab1[j];
1745 tab0[j] = MULL(tmp0 + tmp1, ISQRT2, FRAC_BITS);
1746 tab1[j] = MULL(tmp0 - tmp1, ISQRT2, FRAC_BITS);
1747 }
1748 }
1749 }
1750 }
1751 } else if (s->mode_ext & MODE_EXT_MS_STEREO) {
1752 /* ms stereo ONLY */
1753 /* NOTE: the 1/sqrt(2) normalization factor is included in the
1754 global gain */
1755 tab0 = g0->sb_hybrid;
1756 tab1 = g1->sb_hybrid;
1757 for(i=0;i<576;i++) {
1758 tmp0 = tab0[i];
1759 tmp1 = tab1[i];
1760 tab0[i] = tmp0 + tmp1;
1761 tab1[i] = tmp0 - tmp1;
1762 }
1763 }
1764 }
1765
1766 static void compute_antialias_integer(MPADecodeContext *s,
1767 GranuleDef *g)
1768 {
1769 int32_t *ptr, *csa;
1770 int n, i;
1771
1772 /* we antialias only "long" bands */
1773 if (g->block_type == 2) {
1774 if (!g->switch_point)
1775 return;
1776 /* XXX: check this for 8000Hz case */
1777 n = 1;
1778 } else {
1779 n = SBLIMIT - 1;
1780 }
1781
1782 ptr = g->sb_hybrid + 18;
1783 for(i = n;i > 0;i--) {
1784 int tmp0, tmp1, tmp2;
1785 csa = &csa_table[0][0];
1786 #define INT_AA(j) \
1787 tmp0 = ptr[-1-j];\
1788 tmp1 = ptr[ j];\
1789 tmp2= MULH(tmp0 + tmp1, csa[0+4*j]);\
1790 ptr[-1-j] = 4*(tmp2 - MULH(tmp1, csa[2+4*j]));\
1791 ptr[ j] = 4*(tmp2 + MULH(tmp0, csa[3+4*j]));
1792
1793 INT_AA(0)
1794 INT_AA(1)
1795 INT_AA(2)
1796 INT_AA(3)
1797 INT_AA(4)
1798 INT_AA(5)
1799 INT_AA(6)
1800 INT_AA(7)
1801
1802 ptr += 18;
1803 }
1804 }
1805
1806 static void compute_antialias_float(MPADecodeContext *s,
1807 GranuleDef *g)
1808 {
1809 int32_t *ptr;
1810 int n, i;
1811
1812 /* we antialias only "long" bands */
1813 if (g->block_type == 2) {
1814 if (!g->switch_point)
1815 return;
1816 /* XXX: check this for 8000Hz case */
1817 n = 1;
1818 } else {
1819 n = SBLIMIT - 1;
1820 }
1821
1822 ptr = g->sb_hybrid + 18;
1823 for(i = n;i > 0;i--) {
1824 float tmp0, tmp1;
1825 float *csa = &csa_table_float[0][0];
1826 #define FLOAT_AA(j)\
1827 tmp0= ptr[-1-j];\
1828 tmp1= ptr[ j];\
1829 ptr[-1-j] = lrintf(tmp0 * csa[0+4*j] - tmp1 * csa[1+4*j]);\
1830 ptr[ j] = lrintf(tmp0 * csa[1+4*j] + tmp1 * csa[0+4*j]);
1831
1832 FLOAT_AA(0)
1833 FLOAT_AA(1)
1834 FLOAT_AA(2)
1835 FLOAT_AA(3)
1836 FLOAT_AA(4)
1837 FLOAT_AA(5)
1838 FLOAT_AA(6)
1839 FLOAT_AA(7)
1840
1841 ptr += 18;
1842 }
1843 }
1844
1845 static void compute_imdct(MPADecodeContext *s,
1846 GranuleDef *g,
1847 int32_t *sb_samples,
1848 int32_t *mdct_buf)
1849 {
1850 int32_t *ptr, *win, *win1, *buf, *out_ptr, *ptr1;
1851 int32_t out2[12];
1852 int i, j, mdct_long_end, v, sblimit;
1853
1854 /* find last non zero block */
1855 ptr = g->sb_hybrid + 576;
1856 ptr1 = g->sb_hybrid + 2 * 18;
1857 while (ptr >= ptr1) {
1858 ptr -= 6;
1859 v = ptr[0] | ptr[1] | ptr[2] | ptr[3] | ptr[4] | ptr[5];
1860 if (v != 0)
1861 break;
1862 }
1863 sblimit = ((ptr - g->sb_hybrid) / 18) + 1;
1864
1865 if (g->block_type == 2) {
1866 /* XXX: check for 8000 Hz */
1867 if (g->switch_point)
1868 mdct_long_end = 2;
1869 else
1870 mdct_long_end = 0;
1871 } else {
1872 mdct_long_end = sblimit;
1873 }
1874
1875 buf = mdct_buf;
1876 ptr = g->sb_hybrid;
1877 for(j=0;j<mdct_long_end;j++) {
1878 /* apply window & overlap with previous buffer */
1879 out_ptr = sb_samples + j;
1880 /* select window */
1881 if (g->switch_point && j < 2)
1882 win1 = mdct_win[0];
1883 else
1884 win1 = mdct_win[g->block_type];
1885 /* select frequency inversion */
1886 win = win1 + ((4 * 36) & -(j & 1));
1887 imdct36(out_ptr, buf, ptr, win);
1888 out_ptr += 18*SBLIMIT;
1889 ptr += 18;
1890 buf += 18;
1891 }
1892 for(j=mdct_long_end;j<sblimit;j++) {
1893 /* select frequency inversion */
1894 win = mdct_win[2] + ((4 * 36) & -(j & 1));
1895 out_ptr = sb_samples + j;
1896
1897 for(i=0; i<6; i++){
1898 *out_ptr = buf[i];
1899 out_ptr += SBLIMIT;
1900 }
1901 imdct12(out2, ptr + 0);
1902 for(i=0;i<6;i++) {
1903 *out_ptr = MULH(out2[i], win[i]) + buf[i + 6*1];
1904 buf[i + 6*2] = MULH(out2[i + 6], win[i + 6]);
1905 out_ptr += SBLIMIT;
1906 }
1907 imdct12(out2, ptr + 1);
1908 for(i=0;i<6;i++) {
1909 *out_ptr = MULH(out2[i], win[i]) + buf[i + 6*2];
1910 buf[i + 6*0] = MULH(out2[i + 6], win[i + 6]);
1911 out_ptr += SBLIMIT;
1912 }
1913 imdct12(out2, ptr + 2);
1914 for(i=0;i<6;i++) {
1915 buf[i + 6*0] = MULH(out2[i], win[i]) + buf[i + 6*0];
1916 buf[i + 6*1] = MULH(out2[i + 6], win[i + 6]);
1917 buf[i + 6*2] = 0;
1918 }
1919 ptr += 18;
1920 buf += 18;
1921 }
1922 /* zero bands */
1923 for(j=sblimit;j<SBLIMIT;j++) {
1924 /* overlap */
1925 out_ptr = sb_samples + j;
1926 for(i=0;i<18;i++) {
1927 *out_ptr = buf[i];
1928 buf[i] = 0;
1929 out_ptr += SBLIMIT;
1930 }
1931 buf += 18;
1932 }
1933 }
1934
1935 /* main layer3 decoding function */
1936 static int mp_decode_layer3(MPADecodeContext *s)
1937 {
1938 int nb_granules, main_data_begin, private_bits;
1939 int gr, ch, blocksplit_flag, i, j, k, n, bits_pos;
1940 GranuleDef granules[2][2], *g;
1941 int16_t exponents[576];
1942
1943 /* read side info */
1944 if (s->lsf) {
1945 main_data_begin = get_bits(&s->gb, 8);
1946 private_bits = get_bits(&s->gb, s->nb_channels);
1947 nb_granules = 1;
1948 } else {
1949 main_data_begin = get_bits(&s->gb, 9);
1950 if (s->nb_channels == 2)
1951 private_bits = get_bits(&s->gb, 3);
1952 else
1953 private_bits = get_bits(&s->gb, 5);
1954 nb_granules = 2;
1955 for(ch=0;ch<s->nb_channels;ch++) {
1956 granules[ch][0].scfsi = 0; /* all scale factors are transmitted */
1957 granules[ch][1].scfsi = get_bits(&s->gb, 4);
1958 }
1959 }
1960
1961 for(gr=0;gr<nb_granules;gr++) {
1962 for(ch=0;ch<s->nb_channels;ch++) {
1963 dprintf(s->avctx, "gr=%d ch=%d: side_info\n", gr, ch);
1964 g = &granules[ch][gr];
1965 g->part2_3_length = get_bits(&s->gb, 12);
1966 g->big_values = get_bits(&s->gb, 9);
1967 if(g->big_values > 288){
1968 av_log(s->avctx, AV_LOG_ERROR, "big_values too big\n");
1969 return -1;
1970 }
1971
1972 g->global_gain = get_bits(&s->gb, 8);
1973 /* if MS stereo only is selected, we precompute the
1974 1/sqrt(2) renormalization factor */
1975 if ((s->mode_ext & (MODE_EXT_MS_STEREO | MODE_EXT_I_STEREO)) ==
1976 MODE_EXT_MS_STEREO)
1977 g->global_gain -= 2;
1978 if (s->lsf)
1979 g->scalefac_compress = get_bits(&s->gb, 9);
1980 else
1981 g->scalefac_compress = get_bits(&s->gb, 4);
1982 blocksplit_flag = get_bits1(&s->gb);
1983 if (blocksplit_flag) {
1984 g->block_type = get_bits(&s->gb, 2);
1985 if (g->block_type == 0){
1986 av_log(s->avctx, AV_LOG_ERROR, "invalid block type\n");
1987 return -1;
1988 }
1989 g->switch_point = get_bits1(&s->gb);
1990 for(i=0;i<2;i++)
1991 g->table_select[i] = get_bits(&s->gb, 5);
1992 for(i=0;i<3;i++)
1993 g->subblock_gain[i] = get_bits(&s->gb, 3);
1994 ff_init_short_region(s, g);
1995 } else {
1996 int region_address1, region_address2;
1997 g->block_type = 0;
1998 g->switch_point = 0;
1999 for(i=0;i<3;i++)
2000 g->table_select[i] = get_bits(&s->gb, 5);
2001 /* compute huffman coded region sizes */
2002 region_address1 = get_bits(&s->gb, 4);
2003 region_address2 = get_bits(&s->gb, 3);
2004 dprintf(s->avctx, "region1=%d region2=%d\n",
2005 region_address1, region_address2);
2006 ff_init_long_region(s, g, region_address1, region_address2);
2007 }
2008 ff_region_offset2size(g);
2009 ff_compute_band_indexes(s, g);
2010
2011 g->preflag = 0;
2012 if (!s->lsf)
2013 g->preflag = get_bits1(&s->gb);
2014 g->scalefac_scale = get_bits1(&s->gb);
2015 g->count1table_select = get_bits1(&s->gb);
2016 dprintf(s->avctx, "block_type=%d switch_point=%d\n",
2017 g->block_type, g->switch_point);
2018 }
2019 }
2020
2021 if (!s->adu_mode) {
2022 const uint8_t *ptr = s->gb.buffer + (get_bits_count(&s->gb)>>3);
2023 assert((get_bits_count(&s->gb) & 7) == 0);
2024 /* now we get bits from the main_data_begin offset */
2025 dprintf(s->avctx, "seekback: %d\n", main_data_begin);
2026 //av_log(NULL, AV_LOG_ERROR, "backstep:%d, lastbuf:%d\n", main_data_begin, s->last_buf_size);
2027
2028 memcpy(s->last_buf + s->last_buf_size, ptr, EXTRABYTES);
2029 s->in_gb= s->gb;
2030 init_get_bits(&s->gb, s->last_buf, s->last_buf_size*8);
2031 skip_bits_long(&s->gb, 8*(s->last_buf_size - main_data_begin));
2032 }
2033
2034 for(gr=0;gr<nb_granules;gr++) {
2035 for(ch=0;ch<s->nb_channels;ch++) {
2036 g = &granules[ch][gr];
2037 if(get_bits_count(&s->gb)<0){
2038 av_log(s->avctx, AV_LOG_DEBUG, "mdb:%d, lastbuf:%d skipping granule %d\n",
2039 main_data_begin, s->last_buf_size, gr);
2040 skip_bits_long(&s->gb, g->part2_3_length);
2041 memset(g->sb_hybrid, 0, sizeof(g->sb_hybrid));
2042 if(get_bits_count(&s->gb) >= s->gb.size_in_bits && s->in_gb.buffer){
2043 skip_bits_long(&s->in_gb, get_bits_count(&s->gb) - s->gb.size_in_bits);
2044 s->gb= s->in_gb;
2045 s->in_gb.buffer=NULL;
2046 }
2047 continue;
2048 }
2049
2050 bits_pos = get_bits_count(&s->gb);
2051
2052 if (!s->lsf) {
2053 uint8_t *sc;
2054 int slen, slen1, slen2;
2055
2056 /* MPEG1 scale factors */
2057 slen1 = slen_table[0][g->scalefac_compress];
2058 slen2 = slen_table[1][g->scalefac_compress];
2059 dprintf(s->avctx, "slen1=%d slen2=%d\n", slen1, slen2);
2060 if (g->block_type == 2) {
2061 n = g->switch_point ? 17 : 18;
2062 j = 0;
2063 if(slen1){
2064 for(i=0;i<n;i++)
2065 g->scale_factors[j++] = get_bits(&s->gb, slen1);
2066 }else{
2067 for(i=0;i<n;i++)
2068 g->scale_factors[j++] = 0;
2069 }
2070 if(slen2){
2071 for(i=0;i<18;i++)
2072 g->scale_factors[j++] = get_bits(&s->gb, slen2);
2073 for(i=0;i<3;i++)
2074 g->scale_factors[j++] = 0;
2075 }else{
2076 for(i=0;i<21;i++)
2077 g->scale_factors[j++] = 0;
2078 }
2079 } else {
2080 sc = granules[ch][0].scale_factors;
2081 j = 0;
2082 for(k=0;k<4;k++) {
2083 n = (k == 0 ? 6 : 5);
2084 if ((g->scfsi & (0x8 >> k)) == 0) {
2085 slen = (k < 2) ? slen1 : slen2;
2086 if(slen){
2087 for(i=0;i<n;i++)
2088 g->scale_factors[j++] = get_bits(&s->gb, slen);
2089 }else{
2090 for(i=0;i<n;i++)
2091 g->scale_factors[j++] = 0;
2092 }
2093 } else {
2094 /* simply copy from last granule */
2095 for(i=0;i<n;i++) {
2096 g->scale_factors[j] = sc[j];
2097 j++;
2098 }
2099 }
2100 }
2101 g->scale_factors[j++] = 0;
2102 }
2103 } else {
2104 int tindex, tindex2, slen[4], sl, sf;
2105
2106 /* LSF scale factors */
2107 if (g->block_type == 2) {
2108 tindex = g->switch_point ? 2 : 1;
2109 } else {
2110 tindex = 0;
2111 }
2112 sf = g->scalefac_compress;
2113 if ((s->mode_ext & MODE_EXT_I_STEREO) && ch == 1) {
2114 /* intensity stereo case */
2115 sf >>= 1;
2116 if (sf < 180) {
2117 lsf_sf_expand(slen, sf, 6, 6, 0);
2118 tindex2 = 3;
2119 } else if (sf < 244) {
2120 lsf_sf_expand(slen, sf - 180, 4, 4, 0);
2121 tindex2 = 4;
2122 } else {
2123 lsf_sf_expand(slen, sf - 244, 3, 0, 0);
2124 tindex2 = 5;
2125 }
2126 } else {
2127 /* normal case */
2128 if (sf < 400) {
2129 lsf_sf_expand(slen, sf, 5, 4, 4);
2130 tindex2 = 0;
2131 } else if (sf < 500) {
2132 lsf_sf_expand(slen, sf - 400, 5, 4, 0);
2133 tindex2 = 1;
2134 } else {
2135 lsf_sf_expand(slen, sf - 500, 3, 0, 0);
2136 tindex2 = 2;
2137 g->preflag = 1;
2138 }
2139 }
2140
2141 j = 0;
2142 for(k=0;k<4;k++) {
2143 n = lsf_nsf_table[tindex2][tindex][k];
2144 sl = slen[k];
2145 if(sl){
2146 for(i=0;i<n;i++)
2147 g->scale_factors[j++] = get_bits(&s->gb, sl);
2148 }else{
2149 for(i=0;i<n;i++)
2150 g->scale_factors[j++] = 0;
2151 }
2152 }
2153 /* XXX: should compute exact size */
2154 for(;j<40;j++)
2155 g->scale_factors[j] = 0;
2156 }
2157
2158 exponents_from_scale_factors(s, g, exponents);
2159
2160 /* read Huffman coded residue */
2161 huffman_decode(s, g, exponents, bits_pos + g->part2_3_length);
2162 } /* ch */
2163
2164 if (s->nb_channels == 2)
2165 compute_stereo(s, &granules[0][gr], &granules[1][gr]);
2166
2167 for(ch=0;ch<s->nb_channels;ch++) {
2168 g = &granules[ch][gr];
2169
2170 reorder_block(s, g);
2171 s->compute_antialias(s, g);
2172 compute_imdct(s, g, &s->sb_samples[ch][18 * gr][0], s->mdct_buf[ch]);
2173 }
2174 } /* gr */
2175 if(get_bits_count(&s->gb)<0)
2176 skip_bits_long(&s->gb, -get_bits_count(&s->gb));
2177 return nb_granules * 18;
2178 }
2179
2180 static int mp_decode_frame(MPADecodeContext *s,
2181 OUT_INT *samples, const uint8_t *buf, int buf_size)
2182 {
2183 int i, nb_frames, ch;
2184 OUT_INT *samples_ptr;
2185
2186 init_get_bits(&s->gb, buf + HEADER_SIZE, (buf_size - HEADER_SIZE)*8);
2187
2188 /* skip error protection field */
2189 if (s->error_protection)
2190 skip_bits(&s->gb, 16);
2191
2192 dprintf(s->avctx, "frame %d:\n", s->frame_count);
2193 switch(s->layer) {
2194 case 1:
2195 s->avctx->frame_size = 384;
2196 nb_frames = mp_decode_layer1(s);
2197 break;
2198 case 2:
2199 s->avctx->frame_size = 1152;
2200 nb_frames = mp_decode_layer2(s);
2201 break;
2202 case 3:
2203 s->avctx->frame_size = s->lsf ? 576 : 1152;
2204 default:
2205 nb_frames = mp_decode_layer3(s);
2206
2207 s->last_buf_size=0;
2208 if(s->in_gb.buffer){
2209 align_get_bits(&s->gb);
2210 i= (s->gb.size_in_bits - get_bits_count(&s->gb))>>3;
2211 if(i >= 0 && i <= BACKSTEP_SIZE){
2212 memmove(s->last_buf, s->gb.buffer + (get_bits_count(&s->gb)>>3), i);
2213 s->last_buf_size=i;
2214 }else
2215 av_log(s->avctx, AV_LOG_ERROR, "invalid old backstep %d\n", i);
2216 s->gb= s->in_gb;
2217 s->in_gb.buffer= NULL;
2218 }
2219
2220 align_get_bits(&s->gb);
2221 assert((get_bits_count(&s->gb) & 7) == 0);
2222 i= (s->gb.size_in_bits - get_bits_count(&s->gb))>>3;
2223
2224 if(i<0 || i > BACKSTEP_SIZE || nb_frames<0){
2225 if(i<0)
2226 av_log(s->avctx, AV_LOG_ERROR, "invalid new backstep %d\n", i);
2227 i= FFMIN(BACKSTEP_SIZE, buf_size - HEADER_SIZE);
2228 }
2229 assert(i <= buf_size - HEADER_SIZE && i>= 0);
2230 memcpy(s->last_buf + s->last_buf_size, s->gb.buffer + buf_size - HEADER_SIZE - i, i);
2231 s->last_buf_size += i;
2232
2233 break;
2234 }
2235
2236 /* apply the synthesis filter */
2237 for(ch=0;ch<s->nb_channels;ch++) {
2238 samples_ptr = samples + ch;
2239 for(i=0;i<nb_frames;i++) {
2240 ff_mpa_synth_filter(s->synth_buf[ch], &(s->synth_buf_offset[ch]),
2241 window, &s->dither_state,
2242 samples_ptr, s->nb_channels,
2243 s->sb_samples[ch][i]);
2244 samples_ptr += 32 * s->nb_channels;
2245 }
2246 }
2247
2248 return nb_frames * 32 * sizeof(OUT_INT) * s->nb_channels;
2249 }
2250
2251 static int decode_frame(AVCodecContext * avctx,
2252 void *data, int *data_size,
2253 AVPacket *avpkt)
2254 {
2255 const uint8_t *buf = avpkt->data;
2256 int buf_size = avpkt->size;
2257 MPADecodeContext *s = avctx->priv_data;
2258 uint32_t header;
2259 int out_size;
2260 OUT_INT *out_samples = data;
2261
2262 if(buf_size < HEADER_SIZE)
2263 return -1;
2264
2265 header = AV_RB32(buf);
2266 if(ff_mpa_check_header(header) < 0){
2267 av_log(avctx, AV_LOG_ERROR, "Header missing\n");
2268 return -1;
2269 }
2270
2271 if (ff_mpegaudio_decode_header((MPADecodeHeader *)s, header) == 1) {
2272 /* free format: prepare to compute frame size */
2273 s->frame_size = -1;
2274 return -1;
2275 }
2276 /* update codec info */
2277 avctx->channels = s->nb_channels;
2278 avctx->bit_rate = s->bit_rate;
2279 avctx->sub_id = s->layer;
2280
2281 if(*data_size < 1152*avctx->channels*sizeof(OUT_INT))
2282 return -1;
2283 *data_size = 0;
2284
2285 if(s->frame_size<=0 || s->frame_size > buf_size){
2286 av_log(avctx, AV_LOG_ERROR, "incomplete frame\n");
2287 return -1;
2288 }else if(s->frame_size < buf_size){
2289 av_log(avctx, AV_LOG_ERROR, "incorrect frame size\n");
2290 buf_size= s->frame_size;
2291 }
2292
2293 out_size = mp_decode_frame(s, out_samples, buf, buf_size);
2294 if(out_size>=0){
2295 *data_size = out_size;
2296 avctx->sample_rate = s->sample_rate;
2297 //FIXME maybe move the other codec info stuff from above here too
2298 }else
2299 av_log(avctx, AV_LOG_DEBUG, "Error while decoding MPEG audio frame.\n"); //FIXME return -1 / but also return the number of bytes consumed
2300 s->frame_size = 0;
2301 return buf_size;
2302 }
2303
2304 static void flush(AVCodecContext *avctx){
2305 MPADecodeContext *s = avctx->priv_data;
2306 memset(s->synth_buf, 0, sizeof(s->synth_buf));
2307 s->last_buf_size= 0;
2308 }
2309
2310 #if CONFIG_MP3ADU_DECODER
2311 static int decode_frame_adu(AVCodecContext * avctx,
2312 void *data, int *data_size,
2313 AVPacket *avpkt)
2314 {
2315 const uint8_t *buf = avpkt->data;
2316 int buf_size = avpkt->size;
2317 MPADecodeContext *s = avctx->priv_data;
2318 uint32_t header;
2319 int len, out_size;
2320 OUT_INT *out_samples = data;
2321
2322 len = buf_size;
2323
2324 // Discard too short frames
2325 if (buf_size < HEADER_SIZE) {
2326 *data_size = 0;
2327 return buf_size;
2328 }
2329
2330
2331 if (len > MPA_MAX_CODED_FRAME_SIZE)
2332 len = MPA_MAX_CODED_FRAME_SIZE;
2333
2334 // Get header and restore sync word
2335 header = AV_RB32(buf) | 0xffe00000;
2336
2337 if (ff_mpa_check_header(header) < 0) { // Bad header, discard frame
2338 *data_size = 0;
2339 return buf_size;
2340 }
2341
2342 ff_mpegaudio_decode_header((MPADecodeHeader *)s, header);
2343 /* update codec info */
2344 avctx->sample_rate = s->sample_rate;
2345 avctx->channels = s->nb_channels;
2346 avctx->bit_rate = s->bit_rate;
2347 avctx->sub_id = s->layer;
2348
2349 s->frame_size = len;
2350
2351 if (avctx->parse_only) {
2352 out_size = buf_size;
2353 } else {
2354 out_size = mp_decode_frame(s, out_samples, buf, buf_size);
2355 }
2356
2357 *data_size = out_size;
2358 return buf_size;
2359 }
2360 #endif /* CONFIG_MP3ADU_DECODER */
2361
2362 #if CONFIG_MP3ON4_DECODER
2363
2364 /**
2365 * Context for MP3On4 decoder
2366 */
2367 typedef struct MP3On4DecodeContext {
2368 int frames; ///< number of mp3 frames per block (number of mp3 decoder instances)
2369 int syncword; ///< syncword patch
2370 const uint8_t *coff; ///< channels offsets in output buffer
2371 MPADecodeContext *mp3decctx[5]; ///< MPADecodeContext for every decoder instance
2372 } MP3On4DecodeContext;
2373
2374 #include "mpeg4audio.h"
2375
2376 /* Next 3 arrays are indexed by channel config number (passed via codecdata) */
2377 static const uint8_t mp3Frames[8] = {0,1,1,2,3,3,4,5}; /* number of mp3 decoder instances */
2378 /* offsets into output buffer, assume output order is FL FR BL BR C LFE */
2379 static const uint8_t chan_offset[8][5] = {
2380 {0},
2381 {0}, // C
2382 {0}, // FLR
2383 {2,0}, // C FLR
2384 {2,0,3}, // C FLR BS
2385 {4,0,2}, // C FLR BLRS
2386 {4,0,2,5}, // C FLR BLRS LFE
2387 {4,0,2,6,5}, // C FLR BLRS BLR LFE
2388 };
2389
2390
2391 static int decode_init_mp3on4(AVCodecContext * avctx)
2392 {
2393 MP3On4DecodeContext *s = avctx->priv_data;
2394 MPEG4AudioConfig cfg;
2395 int i;
2396
2397 if ((avctx->extradata_size < 2) || (avctx->extradata == NULL)) {
2398 av_log(avctx, AV_LOG_ERROR, "Codec extradata missing or too short.\n");
2399 return -1;
2400 }
2401
2402 ff_mpeg4audio_get_config(&cfg, avctx->extradata, avctx->extradata_size);
2403 if (!cfg.chan_config || cfg.chan_config > 7) {
2404 av_log(avctx, AV_LOG_ERROR, "Invalid channel config number.\n");
2405 return -1;
2406 }
2407 s->frames = mp3Frames[cfg.chan_config];
2408 s->coff = chan_offset[cfg.chan_config];
2409 avctx->channels = ff_mpeg4audio_channels[cfg.chan_config];
2410
2411 if (cfg.sample_rate < 16000)
2412 s->syncword = 0xffe00000;
2413 else
2414 s->syncword = 0xfff00000;
2415
2416 /* Init the first mp3 decoder in standard way, so that all tables get builded
2417 * We replace avctx->priv_data with the context of the first decoder so that
2418 * decode_init() does not have to be changed.
2419 * Other decoders will be initialized here copying data from the first context
2420 */
2421 // Allocate zeroed memory for the first decoder context
2422 s->mp3decctx[0] = av_mallocz(sizeof(MPADecodeContext));
2423 // Put decoder context in place to make init_decode() happy
2424 avctx->priv_data = s->mp3decctx[0];
2425 decode_init(avctx);
2426 // Restore mp3on4 context pointer
2427 avctx->priv_data = s;
2428 s->mp3decctx[0]->adu_mode = 1; // Set adu mode
2429
2430 /* Create a separate codec/context for each frame (first is already ok).
2431 * Each frame is 1 or 2 channels - up to 5 frames allowed
2432 */
2433 for (i = 1; i < s->frames; i++) {
2434 s->mp3decctx[i] = av_mallocz(sizeof(MPADecodeContext));
2435 s->mp3decctx[i]->compute_antialias = s->mp3decctx[0]->compute_antialias;
2436 s->mp3decctx[i]->adu_mode = 1;
2437 s->mp3decctx[i]->avctx = avctx;
2438 }
2439
2440 return 0;
2441 }
2442
2443
2444 static av_cold int decode_close_mp3on4(AVCodecContext * avctx)
2445 {
2446 MP3On4DecodeContext *s = avctx->priv_data;
2447 int i;
2448
2449 for (i = 0; i < s->frames; i++)
2450 if (s->mp3decctx[i])
2451 av_free(s->mp3decctx[i]);
2452
2453 return 0;
2454 }
2455
2456
2457 static int decode_frame_mp3on4(AVCodecContext * avctx,
2458 void *data, int *data_size,
2459 AVPacket *avpkt)
2460 {
2461 const uint8_t *buf = avpkt->data;
2462 int buf_size = avpkt->size;
2463 MP3On4DecodeContext *s = avctx->priv_data;
2464 MPADecodeContext *m;
2465 int fsize, len = buf_size, out_size = 0;
2466 uint32_t header;
2467 OUT_INT *out_samples = data;
2468 OUT_INT decoded_buf[MPA_FRAME_SIZE * MPA_MAX_CHANNELS];
2469 OUT_INT *outptr, *bp;
2470 int fr, j, n;
2471
2472 if(*data_size < MPA_FRAME_SIZE * MPA_MAX_CHANNELS * s->frames * sizeof(OUT_INT))
2473 return -1;
2474
2475 *data_size = 0;
2476 // Discard too short frames
2477 if (buf_size < HEADER_SIZE)
2478 return -1;
2479
2480 // If only one decoder interleave is not needed
2481 outptr = s->frames == 1 ? out_samples : decoded_buf;
2482
2483 avctx->bit_rate = 0;
2484
2485 for (fr = 0; fr < s->frames; fr++) {
2486 fsize = AV_RB16(buf) >> 4;
2487 fsize = FFMIN3(fsize, len, MPA_MAX_CODED_FRAME_SIZE);
2488 m = s->mp3decctx[fr];
2489 assert (m != NULL);
2490
2491 header = (AV_RB32(buf) & 0x000fffff) | s->syncword; // patch header
2492
2493 if (ff_mpa_check_header(header) < 0) // Bad header, discard block
2494 break;
2495
2496 ff_mpegaudio_decode_header((MPADecodeHeader *)m, header);
2497 out_size += mp_decode_frame(m, outptr, buf, fsize);
2498 buf += fsize;
2499 len -= fsize;
2500
2501 if(s->frames > 1) {
2502 n = m->avctx->frame_size*m->nb_channels;
2503 /* interleave output data */
2504 bp = out_samples + s->coff[fr];
2505 if(m->nb_channels == 1) {
2506 for(j = 0; j < n; j++) {
2507 *bp = decoded_buf[j];
2508 bp += avctx->channels;
2509 }
2510 } else {
2511 for(j = 0; j < n; j++) {
2512 bp[0] = decoded_buf[j++];
2513 bp[1] = decoded_buf[j];
2514 bp += avctx->channels;
2515 }
2516 }
2517 }
2518 avctx->bit_rate += m->bit_rate;
2519 }
2520
2521 /* update codec info */
2522 avctx->sample_rate = s->mp3decctx[0]->sample_rate;
2523
2524 *data_size = out_size;
2525 return buf_size;
2526 }
2527 #endif /* CONFIG_MP3ON4_DECODER */
2528
2529 #if CONFIG_MP1_DECODER
2530 AVCodec mp1_decoder =
2531 {
2532 "mp1",
2533 CODEC_TYPE_AUDIO,
2534 CODEC_ID_MP1,
2535 sizeof(MPADecodeContext),
2536 decode_init,
2537 NULL,
2538 NULL,
2539 decode_frame,
2540 CODEC_CAP_PARSE_ONLY,
2541 .flush= flush,
2542 .long_name= NULL_IF_CONFIG_SMALL("MP1 (MPEG audio layer 1)"),
2543 };
2544 #endif
2545 #if CONFIG_MP2_DECODER
2546 AVCodec mp2_decoder =
2547 {
2548 "mp2",
2549 CODEC_TYPE_AUDIO,
2550 CODEC_ID_MP2,
2551 sizeof(MPADecodeContext),
2552 decode_init,
2553 NULL,
2554 NULL,
2555 decode_frame,
2556 CODEC_CAP_PARSE_ONLY,
2557 .flush= flush,
2558 .long_name= NULL_IF_CONFIG_SMALL("MP2 (MPEG audio layer 2)"),
2559 };
2560 #endif
2561 #if CONFIG_MP3_DECODER
2562 AVCodec mp3_decoder =
2563 {
2564 "mp3",
2565 CODEC_TYPE_AUDIO,
2566 CODEC_ID_MP3,
2567 sizeof(MPADecodeContext),
2568 decode_init,
2569 NULL,
2570 NULL,
2571 decode_frame,
2572 CODEC_CAP_PARSE_ONLY,
2573 .flush= flush,
2574 .long_name= NULL_IF_CONFIG_SMALL("MP3 (MPEG audio layer 3)"),
2575 };
2576 #endif
2577 #if CONFIG_MP3ADU_DECODER
2578 AVCodec mp3adu_decoder =
2579 {
2580 "mp3adu",
2581 CODEC_TYPE_AUDIO,
2582 CODEC_ID_MP3ADU,
2583 sizeof(MPADecodeContext),
2584 decode_init,
2585 NULL,
2586 NULL,
2587 decode_frame_adu,
2588 CODEC_CAP_PARSE_ONLY,
2589 .flush= flush,
2590 .long_name= NULL_IF_CONFIG_SMALL("ADU (Application Data Unit) MP3 (MPEG audio layer 3)"),
2591 };
2592 #endif
2593 #if CONFIG_MP3ON4_DECODER
2594 AVCodec mp3on4_decoder =
2595 {
2596 "mp3on4",
2597 CODEC_TYPE_AUDIO,
2598 CODEC_ID_MP3ON4,
2599 sizeof(MP3On4DecodeContext),
2600 decode_init_mp3on4,
2601 NULL,
2602 decode_close_mp3on4,
2603 decode_frame_mp3on4,
2604 .flush= flush,
2605 .long_name= NULL_IF_CONFIG_SMALL("MP3onMP4"),
2606 };
2607 #endif
ffmpeg Lagarith lossless decoder