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