comparison mpegaudiodec.c @ 82:46ee548e47e4 libavcodec

added completely new mpeg audio decoder (integer only, free format support, lsf/mpeg25 support, high/low precision support, simpler code)
author glantau
date Sat, 15 Sep 2001 22:40:28 +0000
parents 986e461dc072
children 3073d4ea6ee5
comparison
equal deleted inserted replaced
81:f239f4c7dfa6 82:46ee548e47e4
14 * 14 *
15 * You should have received a copy of the GNU General Public License 15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software 16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 17 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
18 */ 18 */
19 #include <stdlib.h> 19 //#define DEBUG
20 #include <stdio.h>
21 #include <string.h>
22 #include "avcodec.h" 20 #include "avcodec.h"
23 #include "mpglib/mpg123.h" 21 #include <math.h>
22 #include "mpegaudio.h"
24 23
25 /* 24 /*
26 * TODO: 25 * TODO:
27 * - add free format 26 * - in low precision mode, use more 16 bit multiplies in synth filter
28 * - do not rely anymore on mpglib (first step: implement dct64 and decoding filter) 27 * - test lsf / mpeg25 extensively.
29 */ 28 */
29
30 /* define USE_HIGHPRECISION to have a bit exact (but slower) mpeg
31 audio decoder */
32 //#define USE_HIGHPRECISION
33
34 #ifdef USE_HIGHPRECISION
35 #define FRAC_BITS 23 /* fractional bits for sb_samples and dct */
36 #define WFRAC_BITS 16 /* fractional bits for window */
37 #else
38 #define FRAC_BITS 15 /* fractional bits for sb_samples and dct */
39 #define WFRAC_BITS 14 /* fractional bits for window */
40 #endif
41
42 #define FRAC_ONE (1 << FRAC_BITS)
43
44 #define MULL(a,b) (((INT64)(a) * (INT64)(b)) >> FRAC_BITS)
45 #define MUL64(a,b) ((INT64)(a) * (INT64)(b))
46 #define FIX(a) ((int)((a) * FRAC_ONE))
47 /* WARNING: only correct for posititive numbers */
48 #define FIXR(a) ((int)((a) * FRAC_ONE + 0.5))
49 #define FRAC_RND(a) (((a) + (FRAC_ONE/2)) >> FRAC_BITS)
50
51 #if FRAC_BITS <= 15
52 typedef INT16 MPA_INT;
53 #else
54 typedef INT32 MPA_INT;
55 #endif
56
57 /****************/
30 58
31 #define HEADER_SIZE 4 59 #define HEADER_SIZE 4
32 #define BACKSTEP_SIZE 512 60 #define BACKSTEP_SIZE 512
33 61
34 typedef struct MPADecodeContext { 62 typedef struct MPADecodeContext {
35 struct mpstr mpstr; 63 UINT8 inbuf1[2][MPA_MAX_CODED_FRAME_SIZE + BACKSTEP_SIZE]; /* input buffer */
36 UINT8 inbuf1[2][MAXFRAMESIZE + BACKSTEP_SIZE]; /* input buffer */
37 int inbuf_index; 64 int inbuf_index;
38 UINT8 *inbuf_ptr, *inbuf; 65 UINT8 *inbuf_ptr, *inbuf;
39 int frame_size; 66 int frame_size;
67 int free_format_frame_size; /* frame size in case of free format
68 (zero if currently unknown) */
69 /* next header (used in free format parsing) */
70 UINT32 free_format_next_header;
40 int error_protection; 71 int error_protection;
41 int layer; 72 int layer;
42 int sample_rate; 73 int sample_rate;
74 int sample_rate_index; /* between 0 and 8 */
43 int bit_rate; 75 int bit_rate;
44 int old_frame_size; 76 int old_frame_size;
45 GetBitContext gb; 77 GetBitContext gb;
78 int nb_channels;
79 int mode;
80 int mode_ext;
81 int lsf;
82 MPA_INT synth_buf[MPA_MAX_CHANNELS][512 * 2];
83 int synth_buf_offset[MPA_MAX_CHANNELS];
84 INT32 sb_samples[MPA_MAX_CHANNELS][36][SBLIMIT];
85 INT32 mdct_buf[MPA_MAX_CHANNELS][SBLIMIT * 18]; /* previous samples, for layer 3 MDCT */
86 #ifdef DEBUG
87 int frame_count;
88 #endif
46 } MPADecodeContext; 89 } MPADecodeContext;
47 90
48 /* XXX: suppress that mess */ 91 /* layer 3 "granule" */
49 struct mpstr *gmp; 92 typedef struct GranuleDef {
50 GetBitContext *gmp_gb; 93 UINT8 scfsi;
51 static MPADecodeContext *gmp_s; 94 int part2_3_length;
52 95 int big_values;
53 /* XXX: merge constants with encoder */ 96 int global_gain;
54 static const unsigned short mp_bitrate_tab[2][3][15] = { 97 int scalefac_compress;
55 { {0, 32, 64, 96, 128, 160, 192, 224, 256, 288, 320, 352, 384, 416, 448 }, 98 UINT8 block_type;
56 {0, 32, 48, 56, 64, 80, 96, 112, 128, 160, 192, 224, 256, 320, 384 }, 99 UINT8 switch_point;
57 {0, 32, 40, 48, 56, 64, 80, 96, 112, 128, 160, 192, 224, 256, 320 } }, 100 int table_select[3];
58 { {0, 32, 48, 56, 64, 80, 96, 112, 128, 144, 160, 176, 192, 224, 256}, 101 int subblock_gain[3];
59 {0, 8, 16, 24, 32, 40, 48, 56, 64, 80, 96, 112, 128, 144, 160}, 102 UINT8 scalefac_scale;
60 {0, 8, 16, 24, 32, 40, 48, 56, 64, 80, 96, 112, 128, 144, 160} 103 UINT8 count1table_select;
61 } 104 int region_size[3]; /* number of huffman codes in each region */
105 int preflag;
106 int short_start, long_end; /* long/short band indexes */
107 UINT8 scale_factors[40];
108 INT32 sb_hybrid[SBLIMIT * 18]; /* 576 samples */
109 } GranuleDef;
110
111 #define MODE_EXT_MS_STEREO 2
112 #define MODE_EXT_I_STEREO 1
113
114 /* layer 3 huffman tables */
115 typedef struct HuffTable {
116 int xsize;
117 const UINT8 *bits;
118 const UINT16 *codes;
119 } HuffTable;
120
121 #include "mpegaudiodectab.h"
122
123 /* vlc structure for decoding layer 3 huffman tables */
124 static VLC huff_vlc[16];
125 static UINT8 *huff_code_table[16];
126 static VLC huff_quad_vlc[2];
127 /* computed from band_size_long */
128 static UINT16 band_index_long[9][23];
129 /* XXX: free when all decoders are closed */
130 #define TABLE_4_3_SIZE (8191 + 16)
131 static UINT8 *table_4_3_exp;
132 #if FRAC_BITS <= 15
133 static UINT16 *table_4_3_value;
134 #else
135 static UINT32 *table_4_3_value;
136 #endif
137 /* intensity stereo coef table */
138 static INT32 is_table[2][16];
139 static INT32 is_table_lsf[2][2][16];
140 static INT32 csa_table[8][2];
141 static INT32 mdct_win[8][36];
142
143 /* lower 2 bits: modulo 3, higher bits: shift */
144 static UINT16 scale_factor_modshift[64];
145 /* [i][j]: 2^(-j/3) * FRAC_ONE * 2^(i+2) / (2^(i+2) - 1) */
146 static INT32 scale_factor_mult[15][3];
147 /* mult table for layer 2 group quantization */
148
149 #define SCALE_GEN(v) \
150 { FIXR(1.0 * (v)), FIXR(0.7937005259 * (v)), FIXR(0.6299605249 * (v)) }
151
152 static INT32 scale_factor_mult2[3][3] = {
153 SCALE_GEN(1.0 / 3.0), /* 3 steps */
154 SCALE_GEN(1.0 / 5.0), /* 5 steps */
155 SCALE_GEN(1.0 / 9.0), /* 9 steps */
62 }; 156 };
63 157
64 static unsigned short mp_freq_tab[3] = { 44100, 48000, 32000 }; 158 /* 2^(n/4) */
159 static UINT32 scale_factor_mult3[4] = {
160 FIXR(1.0),
161 FIXR(1.18920711500272106671),
162 FIXR(1.41421356237309504880),
163 FIXR(1.68179283050742908605),
164 };
165
166 static MPA_INT window[512];
167
168 /* layer 1 unscaling */
169 /* n = number of bits of the mantissa minus 1 */
170 static inline int l1_unscale(int n, int mant, int scale_factor)
171 {
172 int shift, mod;
173 INT64 val;
174
175 shift = scale_factor_modshift[scale_factor];
176 mod = shift & 3;
177 shift >>= 2;
178 val = MUL64(mant + (-1 << n) + 1, scale_factor_mult[n-1][mod]);
179 shift += n;
180 return (int)((val + (1 << (shift - 1))) >> shift);
181 }
182
183 static inline int l2_unscale_group(int steps, int mant, int scale_factor)
184 {
185 int shift, mod, val;
186
187 shift = scale_factor_modshift[scale_factor];
188 mod = shift & 3;
189 shift >>= 2;
190 /* XXX: store the result directly */
191 val = (2 * (mant - (steps >> 1))) * scale_factor_mult2[steps >> 2][mod];
192 return (val + (1 << (shift - 1))) >> shift;
193 }
194
195 /* compute value^(4/3) * 2^(exponent/4). It normalized to FRAC_BITS */
196 static inline int l3_unscale(int value, int exponent)
197 {
198 #if FRAC_BITS <= 15
199 unsigned int m;
200 #else
201 UINT64 m;
202 #endif
203 int e;
204
205 e = table_4_3_exp[value];
206 e += (exponent >> 2);
207 e = FRAC_BITS - e;
208 #if FRAC_BITS <= 15
209 if (e > 31)
210 e = 31;
211 #endif
212 m = table_4_3_value[value];
213 #if FRAC_BITS <= 15
214 m = (m * scale_factor_mult3[exponent & 3]);
215 m = (m + (1 << (e-1))) >> e;
216 return m;
217 #else
218 m = MUL64(m, scale_factor_mult3[exponent & 3]);
219 m = (m + (UINT64_C(1) << (e-1))) >> e;
220 return m;
221 #endif
222 }
223
65 224
66 static int decode_init(AVCodecContext * avctx) 225 static int decode_init(AVCodecContext * avctx)
67 { 226 {
68 MPADecodeContext *s = avctx->priv_data; 227 MPADecodeContext *s = avctx->priv_data;
69 struct mpstr *mp = &s->mpstr;
70 static int init; 228 static int init;
71 229 int i, j, k;
72 mp->fr.single = -1;
73 mp->synth_bo = 1;
74 230
75 if(!init) { 231 if(!init) {
232 /* scale factors table for layer 1/2 */
233 for(i=0;i<64;i++) {
234 int shift, mod;
235 /* 1.0 (i = 3) is normalized to 2 ^ FRAC_BITS */
236 shift = (i / 3) - 1;
237 mod = i % 3;
238 #if FRAC_BITS <= 15
239 if (shift > 31)
240 shift = 31;
241 #endif
242 scale_factor_modshift[i] = mod | (shift << 2);
243 }
244
245 /* scale factor multiply for layer 1 */
246 for(i=0;i<15;i++) {
247 int n, norm;
248 n = i + 2;
249 norm = ((INT64_C(1) << n) * FRAC_ONE) / ((1 << n) - 1);
250 scale_factor_mult[i][0] = MULL(FIXR(1.0), norm);
251 scale_factor_mult[i][1] = MULL(FIXR(0.7937005259), norm);
252 scale_factor_mult[i][2] = MULL(FIXR(0.6299605249), norm);
253 dprintf("%d: norm=%x s=%x %x %x\n",
254 i, norm,
255 scale_factor_mult[i][0],
256 scale_factor_mult[i][1],
257 scale_factor_mult[i][2]);
258 }
259
260 /* window */
261 /* max = 18760, max sum over all 16 coefs : 44736 */
262 for(i=0;i<257;i++) {
263 int v;
264 v = mpa_enwindow[i];
265 #if WFRAC_BITS < 16
266 v = (v + (1 << (16 - WFRAC_BITS - 1))) >> (16 - WFRAC_BITS);
267 #endif
268 window[i] = v;
269 if ((i & 63) != 0)
270 v = -v;
271 if (i != 0)
272 window[512 - i] = v;
273 }
274
275 /* huffman decode tables */
276 huff_code_table[0] = NULL;
277 for(i=1;i<16;i++) {
278 const HuffTable *h = &mpa_huff_tables[i];
279 int xsize, n, x, y;
280 UINT8 *code_table;
281
282 xsize = h->xsize;
283 n = xsize * xsize;
284 /* XXX: fail test */
285 init_vlc(&huff_vlc[i], 8, n,
286 h->bits, 1, 1, h->codes, 2, 2);
287
288 code_table = av_mallocz(n);
289 j = 0;
290 for(x=0;x<xsize;x++) {
291 for(y=0;y<xsize;y++)
292 code_table[j++] = (x << 4) | y;
293 }
294 huff_code_table[i] = code_table;
295 }
296 for(i=0;i<2;i++) {
297 init_vlc(&huff_quad_vlc[i], i == 0 ? 7 : 4, 16,
298 mpa_quad_bits[i], 1, 1, mpa_quad_codes[i], 1, 1);
299 }
300
301 for(i=0;i<9;i++) {
302 k = 0;
303 for(j=0;j<22;j++) {
304 band_index_long[i][j] = k;
305 k += band_size_long[i][j];
306 }
307 band_index_long[i][22] = k;
308 }
309
310 /* compute n ^ (4/3) and store it in mantissa/exp format */
311 table_4_3_exp = av_mallocz(TABLE_4_3_SIZE *
312 sizeof(table_4_3_exp[0]));
313 if (!table_4_3_exp)
314 return -1;
315 table_4_3_value = av_mallocz(TABLE_4_3_SIZE *
316 sizeof(table_4_3_value[0]));
317 if (!table_4_3_value) {
318 free(table_4_3_exp);
319 return -1;
320 }
321
322 for(i=1;i<TABLE_4_3_SIZE;i++) {
323 double f, fm;
324 int e, m;
325 f = pow((double)i, 4.0 / 3.0);
326 fm = frexp(f, &e);
327 m = FIXR(2 * fm);
328 #if FRAC_BITS <= 15
329 if ((unsigned short)m != m)
330 m = 65535;
331 #endif
332 /* normalized to FRAC_BITS */
333 table_4_3_value[i] = m;
334 table_4_3_exp[i] = e - 1;
335 }
336
337
338 for(i=0;i<7;i++) {
339 float f;
340 int v;
341 if (i != 6) {
342 f = tan((double)i * M_PI / 12.0);
343 v = FIXR(f / (1.0 + f));
344 } else {
345 v = FIXR(1.0);
346 }
347 is_table[0][i] = v;
348 is_table[1][6 - i] = v;
349 }
350 /* invalid values */
351 for(i=7;i<16;i++)
352 is_table[0][i] = is_table[1][i] = 0.0;
353
354 for(i=0;i<16;i++) {
355 double f;
356 int e, k;
357
358 for(j=0;j<2;j++) {
359 e = -(j + 1) * ((i + 1) >> 1);
360 f = pow(2.0, e / 4.0);
361 k = i & 1;
362 is_table_lsf[j][k ^ 1][i] = FIXR(f);
363 is_table_lsf[j][k][i] = FIXR(1.0);
364 dprintf("is_table_lsf %d %d: %x %x\n",
365 i, j, is_table_lsf[j][0][i], is_table_lsf[j][1][i]);
366 }
367 }
368
369 for(i=0;i<8;i++) {
370 float ci, cs, ca;
371 ci = ci_table[i];
372 cs = 1.0 / sqrt(1.0 + ci * ci);
373 ca = cs * ci;
374 csa_table[i][0] = FIX(cs);
375 csa_table[i][1] = FIX(ca);
376 }
377
378 /* compute mdct windows */
379 for(i=0;i<36;i++) {
380 int v;
381 v = FIXR(sin(M_PI * (i + 0.5) / 36.0));
382 mdct_win[0][i] = v;
383 mdct_win[1][i] = v;
384 mdct_win[3][i] = v;
385 }
386 for(i=0;i<6;i++) {
387 mdct_win[1][18 + i] = FIXR(1.0);
388 mdct_win[1][24 + i] = FIXR(sin(M_PI * ((i + 6) + 0.5) / 12.0));
389 mdct_win[1][30 + i] = FIXR(0.0);
390
391 mdct_win[3][i] = FIXR(0.0);
392 mdct_win[3][6 + i] = FIXR(sin(M_PI * (i + 0.5) / 12.0));
393 mdct_win[3][12 + i] = FIXR(1.0);
394 }
395
396 for(i=0;i<12;i++)
397 mdct_win[2][i] = FIXR(sin(M_PI * (i + 0.5) / 12.0));
398
399 /* NOTE: we do frequency inversion adter the MDCT by changing
400 the sign of the right window coefs */
401 for(j=0;j<4;j++) {
402 for(i=0;i<36;i+=2) {
403 mdct_win[j + 4][i] = mdct_win[j][i];
404 mdct_win[j + 4][i + 1] = -mdct_win[j][i + 1];
405 }
406 }
407
408 #if defined(DEBUG)
409 for(j=0;j<8;j++) {
410 printf("win%d=\n", j);
411 for(i=0;i<36;i++)
412 printf("%f, ", (double)mdct_win[j][i] / FRAC_ONE);
413 printf("\n");
414 }
415 #endif
76 init = 1; 416 init = 1;
77 make_decode_tables(32767);
78 init_layer2();
79 init_layer3(SBLIMIT);
80 } 417 }
81 418
82 s->inbuf_index = 0; 419 s->inbuf_index = 0;
83 s->inbuf = &s->inbuf1[s->inbuf_index][BACKSTEP_SIZE]; 420 s->inbuf = &s->inbuf1[s->inbuf_index][BACKSTEP_SIZE];
84 s->inbuf_ptr = s->inbuf; 421 s->inbuf_ptr = s->inbuf;
85 422 #ifdef DEBUG
423 s->frame_count = 0;
424 #endif
86 return 0; 425 return 0;
426 }
427
428 /* tab[i][j] = 1.0 / (2.0 * cos(pi*(2*k+1) / 2^(6 - j))) */;
429
430 /* cos(i*pi/64) */
431
432 #define COS0_0 FIXR(0.50060299823519630134)
433 #define COS0_1 FIXR(0.50547095989754365998)
434 #define COS0_2 FIXR(0.51544730992262454697)
435 #define COS0_3 FIXR(0.53104259108978417447)
436 #define COS0_4 FIXR(0.55310389603444452782)
437 #define COS0_5 FIXR(0.58293496820613387367)
438 #define COS0_6 FIXR(0.62250412303566481615)
439 #define COS0_7 FIXR(0.67480834145500574602)
440 #define COS0_8 FIXR(0.74453627100229844977)
441 #define COS0_9 FIXR(0.83934964541552703873)
442 #define COS0_10 FIXR(0.97256823786196069369)
443 #define COS0_11 FIXR(1.16943993343288495515)
444 #define COS0_12 FIXR(1.48416461631416627724)
445 #define COS0_13 FIXR(2.05778100995341155085)
446 #define COS0_14 FIXR(3.40760841846871878570)
447 #define COS0_15 FIXR(10.19000812354805681150)
448
449 #define COS1_0 FIXR(0.50241928618815570551)
450 #define COS1_1 FIXR(0.52249861493968888062)
451 #define COS1_2 FIXR(0.56694403481635770368)
452 #define COS1_3 FIXR(0.64682178335999012954)
453 #define COS1_4 FIXR(0.78815462345125022473)
454 #define COS1_5 FIXR(1.06067768599034747134)
455 #define COS1_6 FIXR(1.72244709823833392782)
456 #define COS1_7 FIXR(5.10114861868916385802)
457
458 #define COS2_0 FIXR(0.50979557910415916894)
459 #define COS2_1 FIXR(0.60134488693504528054)
460 #define COS2_2 FIXR(0.89997622313641570463)
461 #define COS2_3 FIXR(2.56291544774150617881)
462
463 #define COS3_0 FIXR(0.54119610014619698439)
464 #define COS3_1 FIXR(1.30656296487637652785)
465
466 #define COS4_0 FIXR(0.70710678118654752439)
467
468 /* butterfly operator */
469 #define BF(a, b, c)\
470 {\
471 tmp0 = tab[a] + tab[b];\
472 tmp1 = tab[a] - tab[b];\
473 tab[a] = tmp0;\
474 tab[b] = MULL(tmp1, c);\
475 }
476
477 #define BF1(a, b, c, d)\
478 {\
479 BF(a, b, COS4_0);\
480 BF(c, d, -COS4_0);\
481 tab[c] += tab[d];\
482 }
483
484 #define BF2(a, b, c, d)\
485 {\
486 BF(a, b, COS4_0);\
487 BF(c, d, -COS4_0);\
488 tab[c] += tab[d];\
489 tab[a] += tab[c];\
490 tab[c] += tab[b];\
491 tab[b] += tab[d];\
492 }
493
494 #define ADD(a, b) tab[a] += tab[b]
495
496 /* DCT32 without 1/sqrt(2) coef zero scaling. */
497 static void dct32(INT32 *out, INT32 *tab)
498 {
499 int tmp0, tmp1;
500
501 /* pass 1 */
502 BF(0, 31, COS0_0);
503 BF(1, 30, COS0_1);
504 BF(2, 29, COS0_2);
505 BF(3, 28, COS0_3);
506 BF(4, 27, COS0_4);
507 BF(5, 26, COS0_5);
508 BF(6, 25, COS0_6);
509 BF(7, 24, COS0_7);
510 BF(8, 23, COS0_8);
511 BF(9, 22, COS0_9);
512 BF(10, 21, COS0_10);
513 BF(11, 20, COS0_11);
514 BF(12, 19, COS0_12);
515 BF(13, 18, COS0_13);
516 BF(14, 17, COS0_14);
517 BF(15, 16, COS0_15);
518
519 /* pass 2 */
520 BF(0, 15, COS1_0);
521 BF(1, 14, COS1_1);
522 BF(2, 13, COS1_2);
523 BF(3, 12, COS1_3);
524 BF(4, 11, COS1_4);
525 BF(5, 10, COS1_5);
526 BF(6, 9, COS1_6);
527 BF(7, 8, COS1_7);
528
529 BF(16, 31, -COS1_0);
530 BF(17, 30, -COS1_1);
531 BF(18, 29, -COS1_2);
532 BF(19, 28, -COS1_3);
533 BF(20, 27, -COS1_4);
534 BF(21, 26, -COS1_5);
535 BF(22, 25, -COS1_6);
536 BF(23, 24, -COS1_7);
537
538 /* pass 3 */
539 BF(0, 7, COS2_0);
540 BF(1, 6, COS2_1);
541 BF(2, 5, COS2_2);
542 BF(3, 4, COS2_3);
543
544 BF(8, 15, -COS2_0);
545 BF(9, 14, -COS2_1);
546 BF(10, 13, -COS2_2);
547 BF(11, 12, -COS2_3);
548
549 BF(16, 23, COS2_0);
550 BF(17, 22, COS2_1);
551 BF(18, 21, COS2_2);
552 BF(19, 20, COS2_3);
553
554 BF(24, 31, -COS2_0);
555 BF(25, 30, -COS2_1);
556 BF(26, 29, -COS2_2);
557 BF(27, 28, -COS2_3);
558
559 /* pass 4 */
560 BF(0, 3, COS3_0);
561 BF(1, 2, COS3_1);
562
563 BF(4, 7, -COS3_0);
564 BF(5, 6, -COS3_1);
565
566 BF(8, 11, COS3_0);
567 BF(9, 10, COS3_1);
568
569 BF(12, 15, -COS3_0);
570 BF(13, 14, -COS3_1);
571
572 BF(16, 19, COS3_0);
573 BF(17, 18, COS3_1);
574
575 BF(20, 23, -COS3_0);
576 BF(21, 22, -COS3_1);
577
578 BF(24, 27, COS3_0);
579 BF(25, 26, COS3_1);
580
581 BF(28, 31, -COS3_0);
582 BF(29, 30, -COS3_1);
583
584 /* pass 5 */
585 BF1(0, 1, 2, 3);
586 BF2(4, 5, 6, 7);
587 BF1(8, 9, 10, 11);
588 BF2(12, 13, 14, 15);
589 BF1(16, 17, 18, 19);
590 BF2(20, 21, 22, 23);
591 BF1(24, 25, 26, 27);
592 BF2(28, 29, 30, 31);
593
594 /* pass 6 */
595
596 ADD( 8, 12);
597 ADD(12, 10);
598 ADD(10, 14);
599 ADD(14, 9);
600 ADD( 9, 13);
601 ADD(13, 11);
602 ADD(11, 15);
603
604 out[ 0] = tab[0];
605 out[16] = tab[1];
606 out[ 8] = tab[2];
607 out[24] = tab[3];
608 out[ 4] = tab[4];
609 out[20] = tab[5];
610 out[12] = tab[6];
611 out[28] = tab[7];
612 out[ 2] = tab[8];
613 out[18] = tab[9];
614 out[10] = tab[10];
615 out[26] = tab[11];
616 out[ 6] = tab[12];
617 out[22] = tab[13];
618 out[14] = tab[14];
619 out[30] = tab[15];
620
621 ADD(24, 28);
622 ADD(28, 26);
623 ADD(26, 30);
624 ADD(30, 25);
625 ADD(25, 29);
626 ADD(29, 27);
627 ADD(27, 31);
628
629 out[ 1] = tab[16] + tab[24];
630 out[17] = tab[17] + tab[25];
631 out[ 9] = tab[18] + tab[26];
632 out[25] = tab[19] + tab[27];
633 out[ 5] = tab[20] + tab[28];
634 out[21] = tab[21] + tab[29];
635 out[13] = tab[22] + tab[30];
636 out[29] = tab[23] + tab[31];
637 out[ 3] = tab[24] + tab[20];
638 out[19] = tab[25] + tab[21];
639 out[11] = tab[26] + tab[22];
640 out[27] = tab[27] + tab[23];
641 out[ 7] = tab[28] + tab[18];
642 out[23] = tab[29] + tab[19];
643 out[15] = tab[30] + tab[17];
644 out[31] = tab[31];
645 }
646
647 #define OUT_SHIFT (WFRAC_BITS + FRAC_BITS - 15)
648
649 #if FRAC_BITS <= 15
650
651 #define OUT_SAMPLE(sum)\
652 {\
653 int sum1;\
654 sum1 = (sum + (1 << (OUT_SHIFT - 1))) >> OUT_SHIFT;\
655 if (sum1 < -32768)\
656 sum1 = -32768;\
657 else if (sum1 > 32767)\
658 sum1 = 32767;\
659 *samples = sum1;\
660 samples += incr;\
661 }
662
663 #define SUM8(off, op) \
664 { \
665 sum op w[0 * 64 + off] * p[0 * 64];\
666 sum op w[1 * 64 + off] * p[1 * 64];\
667 sum op w[2 * 64 + off] * p[2 * 64];\
668 sum op w[3 * 64 + off] * p[3 * 64];\
669 sum op w[4 * 64 + off] * p[4 * 64];\
670 sum op w[5 * 64 + off] * p[5 * 64];\
671 sum op w[6 * 64 + off] * p[6 * 64];\
672 sum op w[7 * 64 + off] * p[7 * 64];\
673 }
674
675 #else
676
677 #define OUT_SAMPLE(sum)\
678 {\
679 int sum1;\
680 sum1 = (int)((sum + (INT64_C(1) << (OUT_SHIFT - 1))) >> OUT_SHIFT);\
681 if (sum1 < -32768)\
682 sum1 = -32768;\
683 else if (sum1 > 32767)\
684 sum1 = 32767;\
685 *samples = sum1;\
686 samples += incr;\
687 }
688
689 #define SUM8(off, op) \
690 { \
691 sum op MUL64(w[0 * 64 + off], p[0 * 64]);\
692 sum op MUL64(w[1 * 64 + off], p[1 * 64]);\
693 sum op MUL64(w[2 * 64 + off], p[2 * 64]);\
694 sum op MUL64(w[3 * 64 + off], p[3 * 64]);\
695 sum op MUL64(w[4 * 64 + off], p[4 * 64]);\
696 sum op MUL64(w[5 * 64 + off], p[5 * 64]);\
697 sum op MUL64(w[6 * 64 + off], p[6 * 64]);\
698 sum op MUL64(w[7 * 64 + off], p[7 * 64]);\
699 }
700
701 #endif
702
703 /* 32 sub band synthesis filter. Input: 32 sub band samples, Output:
704 32 samples. */
705 /* XXX: optimize by avoiding ring buffer usage */
706 static void synth_filter(MPADecodeContext *s1,
707 int ch, INT16 *samples, int incr,
708 INT32 sb_samples[SBLIMIT])
709 {
710 INT32 tmp[32];
711 register MPA_INT *synth_buf, *p;
712 register MPA_INT *w;
713 int j, offset, v;
714 #if FRAC_BITS <= 15
715 int sum;
716 #else
717 INT64 sum;
718 #endif
719
720 dct32(tmp, sb_samples);
721
722 offset = s1->synth_buf_offset[ch];
723 synth_buf = s1->synth_buf[ch] + offset;
724
725 for(j=0;j<32;j++) {
726 v = tmp[j];
727 #if FRAC_BITS <= 15
728 if (v > 32767)
729 v = 32767;
730 else if (v < -32768)
731 v = -32768;
732 #endif
733 synth_buf[j] = v;
734 }
735 /* copy to avoid wrap */
736 memcpy(synth_buf + 512, synth_buf, 32 * sizeof(MPA_INT));
737
738 w = window;
739 for(j=0;j<16;j++) {
740 sum = 0;
741 p = synth_buf + 16 + j; /* 0-15 */
742 SUM8(0, +=);
743 p = synth_buf + 48 - j; /* 32-47 */
744 SUM8(32, -=);
745 OUT_SAMPLE(sum);
746 w++;
747 }
748
749 p = synth_buf + 32; /* 48 */
750 sum = 0;
751 SUM8(32, -=);
752 OUT_SAMPLE(sum);
753 w++;
754
755 for(j=17;j<32;j++) {
756 sum = 0;
757 p = synth_buf + 48 - j; /* 17-31 */
758 SUM8(0, -=);
759 p = synth_buf + 16 + j; /* 49-63 */
760 SUM8(32, -=);
761 OUT_SAMPLE(sum);
762 w++;
763 }
764 offset = (offset - 32) & 511;
765 s1->synth_buf_offset[ch] = offset;
766 }
767
768 /* cos(pi*i/24) */
769 #define C1 FIXR(0.99144486137381041114)
770 #define C3 FIXR(0.92387953251128675612)
771 #define C5 FIXR(0.79335334029123516458)
772 #define C7 FIXR(0.60876142900872063941)
773 #define C9 FIXR(0.38268343236508977173)
774 #define C11 FIXR(0.13052619222005159154)
775
776 /* 12 points IMDCT. We compute it "by hand" by factorizing obvious
777 cases. */
778 static void imdct12(int *out, int *in)
779 {
780 int tmp;
781 INT64 in1_3, in1_9, in4_3, in4_9;
782
783 in1_3 = MUL64(in[1], C3);
784 in1_9 = MUL64(in[1], C9);
785 in4_3 = MUL64(in[4], C3);
786 in4_9 = MUL64(in[4], C9);
787
788 tmp = FRAC_RND(MUL64(in[0], C7) - in1_3 - MUL64(in[2], C11) +
789 MUL64(in[3], C1) - in4_9 - MUL64(in[5], C5));
790 out[0] = tmp;
791 out[5] = -tmp;
792 tmp = FRAC_RND(MUL64(in[0] - in[3], C9) - in1_3 +
793 MUL64(in[2] + in[5], C3) - in4_9);
794 out[1] = tmp;
795 out[4] = -tmp;
796 tmp = FRAC_RND(MUL64(in[0], C11) - in1_9 + MUL64(in[2], C7) -
797 MUL64(in[3], C5) + in4_3 - MUL64(in[5], C1));
798 out[2] = tmp;
799 out[3] = -tmp;
800 tmp = FRAC_RND(MUL64(-in[0], C5) + in1_9 + MUL64(in[2], C1) +
801 MUL64(in[3], C11) - in4_3 - MUL64(in[5], C7));
802 out[6] = tmp;
803 out[11] = tmp;
804 tmp = FRAC_RND(MUL64(-in[0] + in[3], C3) - in1_9 +
805 MUL64(in[2] + in[5], C9) + in4_3);
806 out[7] = tmp;
807 out[10] = tmp;
808 tmp = FRAC_RND(-MUL64(in[0], C1) - in1_3 - MUL64(in[2], C5) -
809 MUL64(in[3], C7) - in4_9 - MUL64(in[5], C11));
810 out[8] = tmp;
811 out[9] = tmp;
812 }
813
814 #undef C1
815 #undef C3
816 #undef C5
817 #undef C7
818 #undef C9
819 #undef C11
820
821 /* cos(pi*i/18) */
822 #define C1 FIXR(0.98480775301220805936)
823 #define C2 FIXR(0.93969262078590838405)
824 #define C3 FIXR(0.86602540378443864676)
825 #define C4 FIXR(0.76604444311897803520)
826 #define C5 FIXR(0.64278760968653932632)
827 #define C6 FIXR(0.5)
828 #define C7 FIXR(0.34202014332566873304)
829 #define C8 FIXR(0.17364817766693034885)
830
831 /* 0.5 / cos(pi*(2*i+1)/36) */
832 static const int icos36[9] = {
833 FIXR(0.50190991877167369479),
834 FIXR(0.51763809020504152469),
835 FIXR(0.55168895948124587824),
836 FIXR(0.61038729438072803416),
837 FIXR(0.70710678118654752439),
838 FIXR(0.87172339781054900991),
839 FIXR(1.18310079157624925896),
840 FIXR(1.93185165257813657349),
841 FIXR(5.73685662283492756461),
842 };
843
844 static const int icos72[18] = {
845 /* 0.5 / cos(pi*(2*i+19)/72) */
846 FIXR(0.74009361646113053152),
847 FIXR(0.82133981585229078570),
848 FIXR(0.93057949835178895673),
849 FIXR(1.08284028510010010928),
850 FIXR(1.30656296487637652785),
851 FIXR(1.66275476171152078719),
852 FIXR(2.31011315767264929558),
853 FIXR(3.83064878777019433457),
854 FIXR(11.46279281302667383546),
855
856 /* 0.5 / cos(pi*(2*(i + 18) +19)/72) */
857 FIXR(-0.67817085245462840086),
858 FIXR(-0.63023620700513223342),
859 FIXR(-0.59284452371708034528),
860 FIXR(-0.56369097343317117734),
861 FIXR(-0.54119610014619698439),
862 FIXR(-0.52426456257040533932),
863 FIXR(-0.51213975715725461845),
864 FIXR(-0.50431448029007636036),
865 FIXR(-0.50047634258165998492),
866 };
867
868 /* using Lee like decomposition followed by hand coded 9 points DCT */
869 static void imdct36(int *out, int *in)
870 {
871 int i, j, t0, t1, t2, t3, s0, s1, s2, s3;
872 int tmp[18], *tmp1, *in1;
873 INT64 in3_3, in6_6;
874
875 for(i=17;i>=1;i--)
876 in[i] += in[i-1];
877 for(i=17;i>=3;i-=2)
878 in[i] += in[i-2];
879
880 for(j=0;j<2;j++) {
881 tmp1 = tmp + j;
882 in1 = in + j;
883
884 in3_3 = MUL64(in1[2*3], C3);
885 in6_6 = MUL64(in1[2*6], C6);
886
887 tmp1[0] = FRAC_RND(MUL64(in1[2*1], C1) + in3_3 +
888 MUL64(in1[2*5], C5) + MUL64(in1[2*7], C7));
889 tmp1[2] = in1[2*0] + FRAC_RND(MUL64(in1[2*2], C2) +
890 MUL64(in1[2*4], C4) + in6_6 +
891 MUL64(in1[2*8], C8));
892 tmp1[4] = FRAC_RND(MUL64(in1[2*1] - in1[2*5] - in1[2*7], C3));
893 tmp1[6] = FRAC_RND(MUL64(in1[2*2] - in1[2*4] - in1[2*8], C6)) -
894 in1[2*6] + in1[2*0];
895 tmp1[8] = FRAC_RND(MUL64(in1[2*1], C5) - in3_3 -
896 MUL64(in1[2*5], C7) + MUL64(in1[2*7], C1));
897 tmp1[10] = in1[2*0] + FRAC_RND(MUL64(-in1[2*2], C8) -
898 MUL64(in1[2*4], C2) + in6_6 +
899 MUL64(in1[2*8], C4));
900 tmp1[12] = FRAC_RND(MUL64(in1[2*1], C7) - in3_3 +
901 MUL64(in1[2*5], C1) -
902 MUL64(in1[2*7], C5));
903 tmp1[14] = in1[2*0] + FRAC_RND(MUL64(-in1[2*2], C4) +
904 MUL64(in1[2*4], C8) + in6_6 -
905 MUL64(in1[2*8], C2));
906 tmp1[16] = in1[2*0] - in1[2*2] + in1[2*4] - in1[2*6] + in1[2*8];
907 }
908
909 i = 0;
910 for(j=0;j<4;j++) {
911 t0 = tmp[i];
912 t1 = tmp[i + 2];
913 s0 = t1 + t0;
914 s2 = t1 - t0;
915
916 t2 = tmp[i + 1];
917 t3 = tmp[i + 3];
918 s1 = MULL(t3 + t2, icos36[j]);
919 s3 = MULL(t3 - t2, icos36[8 - j]);
920
921 t0 = MULL(s0 + s1, icos72[9 + 8 - j]);
922 t1 = MULL(s0 - s1, icos72[8 - j]);
923 out[18 + 9 + j] = t0;
924 out[18 + 8 - j] = t0;
925 out[9 + j] = -t1;
926 out[8 - j] = t1;
927
928 t0 = MULL(s2 + s3, icos72[9+j]);
929 t1 = MULL(s2 - s3, icos72[j]);
930 out[18 + 9 + (8 - j)] = t0;
931 out[18 + j] = t0;
932 out[9 + (8 - j)] = -t1;
933 out[j] = t1;
934 i += 4;
935 }
936
937 s0 = tmp[16];
938 s1 = MULL(tmp[17], icos36[4]);
939 t0 = MULL(s0 + s1, icos72[9 + 4]);
940 t1 = MULL(s0 - s1, icos72[4]);
941 out[18 + 9 + 4] = t0;
942 out[18 + 8 - 4] = t0;
943 out[9 + 4] = -t1;
944 out[8 - 4] = t1;
87 } 945 }
88 946
89 /* fast header check for resync */ 947 /* fast header check for resync */
90 static int check_header(UINT32 header) 948 static int check_header(UINT32 header)
91 { 949 {
93 if ((header & 0xffe00000) != 0xffe00000) 951 if ((header & 0xffe00000) != 0xffe00000)
94 return -1; 952 return -1;
95 /* layer check */ 953 /* layer check */
96 if (((header >> 17) & 3) == 0) 954 if (((header >> 17) & 3) == 0)
97 return -1; 955 return -1;
98 /* bit rate : currently no free format supported */ 956 /* bit rate */
99 if (((header >> 12) & 0xf) == 0xf || 957 if (((header >> 12) & 0xf) == 0xf)
100 ((header >> 12) & 0xf) == 0x0)
101 return -1; 958 return -1;
102 /* frequency */ 959 /* frequency */
103 if (((header >> 10) & 3) == 3) 960 if (((header >> 10) & 3) == 3)
104 return -1; 961 return -1;
105 return 0; 962 return 0;
106 } 963 }
107 964
965 /* header + layer + bitrate + freq + lsf/mpeg25 */
966 #define SAME_HEADER_MASK \
967 (0xffe00000 | (3 << 17) | (0xf << 12) | (3 << 10) | (3 << 19))
968
108 /* header decoding. MUST check the header before because no 969 /* header decoding. MUST check the header before because no
109 consistency check is done there */ 970 consistency check is done there. Return 1 if free format found and
110 static void decode_header(MPADecodeContext *s, UINT32 header) 971 that the frame size must be computed externally */
111 { 972 static int decode_header(MPADecodeContext *s, UINT32 header)
112 struct frame *fr = &s->mpstr.fr; 973 {
113 int sample_rate, frame_size; 974 int sample_rate, frame_size, mpeg25, padding;
114 975 int sample_rate_index, bitrate_index;
115 if (header & (1<<20)) { 976 if (header & (1<<20)) {
116 fr->lsf = (header & (1<<19)) ? 0 : 1; 977 s->lsf = (header & (1<<19)) ? 0 : 1;
117 fr->mpeg25 = 0; 978 mpeg25 = 0;
118 } else { 979 } else {
119 fr->lsf = 1; 980 s->lsf = 1;
120 fr->mpeg25 = 1; 981 mpeg25 = 1;
121 } 982 }
122 983
123 s->layer = 4 - ((header >> 17) & 3); 984 s->layer = 4 - ((header >> 17) & 3);
124 /* extract frequency */ 985 /* extract frequency */
125 fr->sampling_frequency = ((header >> 10) & 3); 986 sample_rate_index = (header >> 10) & 3;
126 sample_rate = mp_freq_tab[fr->sampling_frequency] >> (fr->lsf + fr->mpeg25); 987 sample_rate = mpa_freq_tab[sample_rate_index] >> (s->lsf + mpeg25);
127 fr->sampling_frequency += 3 * (fr->lsf + fr->mpeg25); 988 sample_rate_index += 3 * (s->lsf + mpeg25);
128 989 s->sample_rate_index = sample_rate_index;
129 s->error_protection = ((header>>16) & 1) ^ 1; 990 s->error_protection = ((header >> 16) & 1) ^ 1;
130 991
131 fr->bitrate_index = ((header>>12)&0xf); 992 bitrate_index = (header >> 12) & 0xf;
132 fr->padding = ((header>>9)&0x1); 993 padding = (header >> 9) & 1;
133 fr->extension = ((header>>8)&0x1); 994 //extension = (header >> 8) & 1;
134 fr->mode = ((header>>6)&0x3); 995 s->mode = (header >> 6) & 3;
135 fr->mode_ext = ((header>>4)&0x3); 996 s->mode_ext = (header >> 4) & 3;
136 fr->copyright = ((header>>3)&0x1); 997 //copyright = (header >> 3) & 1;
137 fr->original = ((header>>2)&0x1); 998 //original = (header >> 2) & 1;
138 fr->emphasis = header & 0x3; 999 //emphasis = header & 3;
139 1000
140 fr->stereo = (fr->mode == MPG_MD_MONO) ? 1 : 2; 1001 if (s->mode == MPA_MONO)
141 1002 s->nb_channels = 1;
142 1003 else
143 frame_size = mp_bitrate_tab[fr->lsf][s->layer - 1][fr->bitrate_index]; 1004 s->nb_channels = 2;
144 s->bit_rate = frame_size * 1000; 1005
145 switch(s->layer) { 1006 if (bitrate_index != 0) {
146 case 1: 1007 frame_size = mpa_bitrate_tab[s->lsf][s->layer - 1][bitrate_index];
147 frame_size = (frame_size * 12000) / sample_rate; 1008 s->bit_rate = frame_size * 1000;
148 frame_size = ((frame_size + fr->padding) << 2); 1009 switch(s->layer) {
149 break; 1010 case 1:
150 case 2: 1011 frame_size = (frame_size * 12000) / sample_rate;
151 frame_size = (frame_size * 144000) / sample_rate; 1012 frame_size = (frame_size + padding) * 4;
152 frame_size += fr->padding; 1013 break;
153 break; 1014 case 2:
154 case 3: 1015 frame_size = (frame_size * 144000) / sample_rate;
155 frame_size = (frame_size * 144000) / (sample_rate << fr->lsf); 1016 frame_size += padding;
156 frame_size += fr->padding; 1017 break;
157 break; 1018 default:
158 } 1019 case 3:
159 s->frame_size = frame_size; 1020 frame_size = (frame_size * 144000) / (sample_rate << s->lsf);
1021 frame_size += padding;
1022 break;
1023 }
1024 s->frame_size = frame_size;
1025 } else {
1026 /* if no frame size computed, signal it */
1027 if (!s->free_format_frame_size)
1028 return 1;
1029 /* free format: compute bitrate and real frame size from the
1030 frame size we extracted by reading the bitstream */
1031 s->frame_size = s->free_format_frame_size;
1032 switch(s->layer) {
1033 case 1:
1034 s->frame_size += padding * 4;
1035 s->bit_rate = (s->frame_size * sample_rate) / 48000;
1036 break;
1037 case 2:
1038 s->frame_size += padding;
1039 s->bit_rate = (s->frame_size * sample_rate) / 144000;
1040 break;
1041 default:
1042 case 3:
1043 s->frame_size += padding;
1044 s->bit_rate = (s->frame_size * (sample_rate << s->lsf)) / 144000;
1045 break;
1046 }
1047 }
160 s->sample_rate = sample_rate; 1048 s->sample_rate = sample_rate;
161 1049
162 #if 0 1050 #ifdef DEBUG
163 printf("layer%d, %d Hz, %d kbits/s, %s\n", 1051 printf("layer%d, %d Hz, %d kbits/s, ",
164 s->layer, s->sample_rate, s->bit_rate, fr->stereo ? "stereo" : "mono"); 1052 s->layer, s->sample_rate, s->bit_rate);
165 #endif 1053 if (s->nb_channels == 2) {
1054 if (s->layer == 3) {
1055 if (s->mode_ext & MODE_EXT_MS_STEREO)
1056 printf("ms-");
1057 if (s->mode_ext & MODE_EXT_I_STEREO)
1058 printf("i-");
1059 }
1060 printf("stereo");
1061 } else {
1062 printf("mono");
1063 }
1064 printf("\n");
1065 #endif
1066 return 0;
1067 }
1068
1069 /* return the number of decoded frames */
1070 static int mp_decode_layer1(MPADecodeContext *s)
1071 {
1072 int bound, i, v, n, ch, j, mant;
1073 UINT8 allocation[MPA_MAX_CHANNELS][SBLIMIT];
1074 UINT8 scale_factors[MPA_MAX_CHANNELS][SBLIMIT];
1075
1076 if (s->mode == MPA_JSTEREO)
1077 bound = (s->mode_ext + 1) * 4;
1078 else
1079 bound = SBLIMIT;
1080
1081 /* allocation bits */
1082 for(i=0;i<bound;i++) {
1083 for(ch=0;ch<s->nb_channels;ch++) {
1084 allocation[ch][i] = get_bits(&s->gb, 4);
1085 }
1086 }
1087 for(i=bound;i<SBLIMIT;i++) {
1088 allocation[0][i] = get_bits(&s->gb, 4);
1089 }
1090
1091 /* scale factors */
1092 for(i=0;i<bound;i++) {
1093 for(ch=0;ch<s->nb_channels;ch++) {
1094 if (allocation[ch][i])
1095 scale_factors[ch][i] = get_bits(&s->gb, 6);
1096 }
1097 }
1098 for(i=bound;i<SBLIMIT;i++) {
1099 if (allocation[0][i]) {
1100 scale_factors[0][i] = get_bits(&s->gb, 6);
1101 scale_factors[1][i] = get_bits(&s->gb, 6);
1102 }
1103 }
1104
1105 /* compute samples */
1106 for(j=0;j<12;j++) {
1107 for(i=0;i<bound;i++) {
1108 for(ch=0;ch<s->nb_channels;ch++) {
1109 n = allocation[ch][i];
1110 if (n) {
1111 mant = get_bits(&s->gb, n + 1);
1112 v = l1_unscale(n, mant, scale_factors[ch][i]);
1113 } else {
1114 v = 0;
1115 }
1116 s->sb_samples[ch][j][i] = v;
1117 }
1118 }
1119 for(i=bound;i<SBLIMIT;i++) {
1120 n = allocation[0][i];
1121 if (n) {
1122 mant = get_bits(&s->gb, n + 1);
1123 v = l1_unscale(n, mant, scale_factors[0][i]);
1124 s->sb_samples[0][j][i] = v;
1125 v = l1_unscale(n, mant, scale_factors[1][i]);
1126 s->sb_samples[1][j][i] = v;
1127 } else {
1128 s->sb_samples[0][j][i] = 0;
1129 s->sb_samples[1][j][i] = 0;
1130 }
1131 }
1132 }
1133 return 12;
1134 }
1135
1136 /* bitrate is in kb/s */
1137 int l2_select_table(int bitrate, int nb_channels, int freq, int lsf)
1138 {
1139 int ch_bitrate, table;
1140
1141 ch_bitrate = bitrate / nb_channels;
1142 if (!lsf) {
1143 if ((freq == 48000 && ch_bitrate >= 56) ||
1144 (ch_bitrate >= 56 && ch_bitrate <= 80))
1145 table = 0;
1146 else if (freq != 48000 && ch_bitrate >= 96)
1147 table = 1;
1148 else if (freq != 32000 && ch_bitrate <= 48)
1149 table = 2;
1150 else
1151 table = 3;
1152 } else {
1153 table = 4;
1154 }
1155 return table;
1156 }
1157
1158 static int mp_decode_layer2(MPADecodeContext *s)
1159 {
1160 int sblimit; /* number of used subbands */
1161 const unsigned char *alloc_table;
1162 int table, bit_alloc_bits, i, j, ch, bound, v;
1163 unsigned char bit_alloc[MPA_MAX_CHANNELS][SBLIMIT];
1164 unsigned char scale_code[MPA_MAX_CHANNELS][SBLIMIT];
1165 unsigned char scale_factors[MPA_MAX_CHANNELS][SBLIMIT][3], *sf;
1166 int scale, qindex, bits, steps, k, l, m, b;
1167
1168 /* select decoding table */
1169 table = l2_select_table(s->bit_rate / 1000, s->nb_channels,
1170 s->sample_rate, s->lsf);
1171 sblimit = sblimit_table[table];
1172 alloc_table = alloc_tables[table];
1173
1174 if (s->mode == MPA_JSTEREO)
1175 bound = (s->mode_ext + 1) * 4;
1176 else
1177 bound = sblimit;
1178
1179 dprintf("bound=%d sblimit=%d\n", bound, sblimit);
1180 /* parse bit allocation */
1181 j = 0;
1182 for(i=0;i<bound;i++) {
1183 bit_alloc_bits = alloc_table[j];
1184 for(ch=0;ch<s->nb_channels;ch++) {
1185 bit_alloc[ch][i] = get_bits(&s->gb, bit_alloc_bits);
1186 }
1187 j += 1 << bit_alloc_bits;
1188 }
1189 for(i=bound;i<sblimit;i++) {
1190 bit_alloc_bits = alloc_table[j];
1191 v = get_bits(&s->gb, bit_alloc_bits);
1192 bit_alloc[0][i] = v;
1193 bit_alloc[1][i] = v;
1194 j += 1 << bit_alloc_bits;
1195 }
1196
1197 #ifdef DEBUG
1198 {
1199 for(ch=0;ch<s->nb_channels;ch++) {
1200 for(i=0;i<sblimit;i++)
1201 printf(" %d", bit_alloc[ch][i]);
1202 printf("\n");
1203 }
1204 }
1205 #endif
1206
1207 /* scale codes */
1208 for(i=0;i<sblimit;i++) {
1209 for(ch=0;ch<s->nb_channels;ch++) {
1210 if (bit_alloc[ch][i])
1211 scale_code[ch][i] = get_bits(&s->gb, 2);
1212 }
1213 }
1214
1215 /* scale factors */
1216 for(i=0;i<sblimit;i++) {
1217 for(ch=0;ch<s->nb_channels;ch++) {
1218 if (bit_alloc[ch][i]) {
1219 sf = scale_factors[ch][i];
1220 switch(scale_code[ch][i]) {
1221 default:
1222 case 0:
1223 sf[0] = get_bits(&s->gb, 6);
1224 sf[1] = get_bits(&s->gb, 6);
1225 sf[2] = get_bits(&s->gb, 6);
1226 break;
1227 case 2:
1228 sf[0] = get_bits(&s->gb, 6);
1229 sf[1] = sf[0];
1230 sf[2] = sf[0];
1231 break;
1232 case 1:
1233 sf[0] = get_bits(&s->gb, 6);
1234 sf[2] = get_bits(&s->gb, 6);
1235 sf[1] = sf[0];
1236 break;
1237 case 3:
1238 sf[0] = get_bits(&s->gb, 6);
1239 sf[2] = get_bits(&s->gb, 6);
1240 sf[1] = sf[2];
1241 break;
1242 }
1243 }
1244 }
1245 }
1246
1247 #ifdef DEBUG
1248 for(ch=0;ch<s->nb_channels;ch++) {
1249 for(i=0;i<sblimit;i++) {
1250 if (bit_alloc[ch][i]) {
1251 sf = scale_factors[ch][i];
1252 printf(" %d %d %d", sf[0], sf[1], sf[2]);
1253 } else {
1254 printf(" -");
1255 }
1256 }
1257 printf("\n");
1258 }
1259 #endif
1260
1261 /* samples */
1262 for(k=0;k<3;k++) {
1263 for(l=0;l<12;l+=3) {
1264 j = 0;
1265 for(i=0;i<bound;i++) {
1266 bit_alloc_bits = alloc_table[j];
1267 for(ch=0;ch<s->nb_channels;ch++) {
1268 b = bit_alloc[ch][i];
1269 if (b) {
1270 scale = scale_factors[ch][i][k];
1271 qindex = alloc_table[j+b];
1272 bits = quant_bits[qindex];
1273 if (bits < 0) {
1274 /* 3 values at the same time */
1275 v = get_bits(&s->gb, -bits);
1276 steps = quant_steps[qindex];
1277 s->sb_samples[ch][k * 12 + l + 0][i] =
1278 l2_unscale_group(steps, v % steps, scale);
1279 v = v / steps;
1280 s->sb_samples[ch][k * 12 + l + 1][i] =
1281 l2_unscale_group(steps, v % steps, scale);
1282 v = v / steps;
1283 s->sb_samples[ch][k * 12 + l + 2][i] =
1284 l2_unscale_group(steps, v, scale);
1285 } else {
1286 for(m=0;m<3;m++) {
1287 v = get_bits(&s->gb, bits);
1288 v = l1_unscale(bits - 1, v, scale);
1289 s->sb_samples[ch][k * 12 + l + m][i] = v;
1290 }
1291 }
1292 } else {
1293 s->sb_samples[ch][k * 12 + l + 0][i] = 0;
1294 s->sb_samples[ch][k * 12 + l + 1][i] = 0;
1295 s->sb_samples[ch][k * 12 + l + 2][i] = 0;
1296 }
1297 }
1298 /* next subband in alloc table */
1299 j += 1 << bit_alloc_bits;
1300 }
1301 /* XXX: find a way to avoid this duplication of code */
1302 for(i=bound;i<sblimit;i++) {
1303 bit_alloc_bits = alloc_table[j];
1304 b = bit_alloc[0][i];
1305 if (b) {
1306 int mant, scale0, scale1;
1307 scale0 = scale_factors[0][i][k];
1308 scale1 = scale_factors[1][i][k];
1309 qindex = alloc_table[j+b];
1310 bits = quant_bits[qindex];
1311 if (bits < 0) {
1312 /* 3 values at the same time */
1313 v = get_bits(&s->gb, -bits);
1314 steps = quant_steps[qindex];
1315 mant = v % steps;
1316 v = v / steps;
1317 s->sb_samples[0][k * 12 + l + 0][i] =
1318 l2_unscale_group(steps, mant, scale0);
1319 s->sb_samples[1][k * 12 + l + 0][i] =
1320 l2_unscale_group(steps, mant, scale1);
1321 mant = v % steps;
1322 v = v / steps;
1323 s->sb_samples[0][k * 12 + l + 1][i] =
1324 l2_unscale_group(steps, mant, scale0);
1325 s->sb_samples[1][k * 12 + l + 1][i] =
1326 l2_unscale_group(steps, mant, scale1);
1327 s->sb_samples[0][k * 12 + l + 2][i] =
1328 l2_unscale_group(steps, v, scale0);
1329 s->sb_samples[1][k * 12 + l + 2][i] =
1330 l2_unscale_group(steps, v, scale1);
1331 } else {
1332 for(m=0;m<3;m++) {
1333 mant = get_bits(&s->gb, bits);
1334 s->sb_samples[0][k * 12 + l + m][i] =
1335 l1_unscale(bits - 1, mant, scale0);
1336 s->sb_samples[1][k * 12 + l + m][i] =
1337 l1_unscale(bits - 1, mant, scale1);
1338 }
1339 }
1340 } else {
1341 s->sb_samples[0][k * 12 + l + 0][i] = 0;
1342 s->sb_samples[0][k * 12 + l + 1][i] = 0;
1343 s->sb_samples[0][k * 12 + l + 2][i] = 0;
1344 s->sb_samples[1][k * 12 + l + 0][i] = 0;
1345 s->sb_samples[1][k * 12 + l + 1][i] = 0;
1346 s->sb_samples[1][k * 12 + l + 2][i] = 0;
1347 }
1348 /* next subband in alloc table */
1349 j += 1 << bit_alloc_bits;
1350 }
1351 /* fill remaining samples to zero */
1352 for(i=sblimit;i<SBLIMIT;i++) {
1353 for(ch=0;ch<s->nb_channels;ch++) {
1354 s->sb_samples[ch][k * 12 + l + 0][i] = 0;
1355 s->sb_samples[ch][k * 12 + l + 1][i] = 0;
1356 s->sb_samples[ch][k * 12 + l + 2][i] = 0;
1357 }
1358 }
1359 }
1360 }
1361 return 3 * 12;
1362 }
1363
1364 /*
1365 * Seek back in the stream for backstep bytes (at most 511 bytes)
1366 */
1367 static void seek_to_maindata(MPADecodeContext *s, long backstep)
1368 {
1369 UINT8 *ptr;
1370
1371 /* compute current position in stream */
1372 ptr = s->gb.buf_ptr - (s->gb.bit_cnt >> 3);
1373 /* copy old data before current one */
1374 ptr -= backstep;
1375 memcpy(ptr, s->inbuf1[s->inbuf_index ^ 1] +
1376 BACKSTEP_SIZE + s->old_frame_size - backstep, backstep);
1377 /* init get bits again */
1378 init_get_bits(&s->gb, ptr, s->frame_size + backstep);
1379
1380 /* prepare next buffer */
1381 s->inbuf_index ^= 1;
1382 s->inbuf = &s->inbuf1[s->inbuf_index][BACKSTEP_SIZE];
1383 s->old_frame_size = s->frame_size;
1384 }
1385
1386 static inline void lsf_sf_expand(int *slen,
1387 int sf, int n1, int n2, int n3)
1388 {
1389 if (n3) {
1390 slen[3] = sf % n3;
1391 sf /= n3;
1392 } else {
1393 slen[3] = 0;
1394 }
1395 if (n2) {
1396 slen[2] = sf % n2;
1397 sf /= n2;
1398 } else {
1399 slen[2] = 0;
1400 }
1401 slen[1] = sf % n1;
1402 sf /= n1;
1403 slen[0] = sf;
1404 }
1405
1406 static void exponents_from_scale_factors(MPADecodeContext *s,
1407 GranuleDef *g,
1408 INT16 *exponents)
1409 {
1410 const UINT8 *bstab, *pretab;
1411 int len, i, j, k, l, v0, shift, gain, gains[3];
1412 INT16 *exp_ptr;
1413
1414 exp_ptr = exponents;
1415 gain = g->global_gain - 210;
1416 shift = g->scalefac_scale + 1;
1417
1418 bstab = band_size_long[s->sample_rate_index];
1419 pretab = mpa_pretab[g->preflag];
1420 for(i=0;i<g->long_end;i++) {
1421 v0 = gain - ((g->scale_factors[i] + pretab[i]) << shift);
1422 len = bstab[i];
1423 for(j=len;j>0;j--)
1424 *exp_ptr++ = v0;
1425 }
1426
1427 if (g->short_start < 13) {
1428 bstab = band_size_short[s->sample_rate_index];
1429 gains[0] = gain - (g->subblock_gain[0] << 3);
1430 gains[1] = gain - (g->subblock_gain[1] << 3);
1431 gains[2] = gain - (g->subblock_gain[2] << 3);
1432 k = g->long_end;
1433 for(i=g->short_start;i<13;i++) {
1434 len = bstab[i];
1435 for(l=0;l<3;l++) {
1436 v0 = gains[l] - (g->scale_factors[k++] << shift);
1437 for(j=len;j>0;j--)
1438 *exp_ptr++ = v0;
1439 }
1440 }
1441 }
1442 }
1443
1444 /* handle n = 0 too */
1445 static inline int get_bitsz(GetBitContext *s, int n)
1446 {
1447 if (n == 0)
1448 return 0;
1449 else
1450 return get_bits(s, n);
1451 }
1452
1453 static int huffman_decode(MPADecodeContext *s, GranuleDef *g,
1454 INT16 *exponents, int end_pos)
1455 {
1456 int s_index;
1457 int linbits, code, x, y, l, v, i, j, k, pos;
1458 UINT8 *last_buf_ptr;
1459 UINT32 last_bit_buf;
1460 int last_bit_cnt;
1461 VLC *vlc;
1462 UINT8 *code_table;
1463
1464 /* low frequencies (called big values) */
1465 s_index = 0;
1466 for(i=0;i<3;i++) {
1467 j = g->region_size[i];
1468 if (j == 0)
1469 continue;
1470 /* select vlc table */
1471 k = g->table_select[i];
1472 l = mpa_huff_data[k][0];
1473 linbits = mpa_huff_data[k][1];
1474 vlc = &huff_vlc[l];
1475 code_table = huff_code_table[l];
1476
1477 /* read huffcode and compute each couple */
1478 for(;j>0;j--) {
1479 if (get_bits_count(&s->gb) >= end_pos)
1480 break;
1481 if (code_table) {
1482 code = get_vlc(&s->gb, vlc);
1483 if (code < 0)
1484 return -1;
1485 y = code_table[code];
1486 x = y >> 4;
1487 y = y & 0x0f;
1488 } else {
1489 x = 0;
1490 y = 0;
1491 }
1492 dprintf("region=%d n=%d x=%d y=%d exp=%d\n",
1493 i, g->region_size[i] - j, x, y, exponents[s_index]);
1494 if (x) {
1495 if (x == 15)
1496 x += get_bitsz(&s->gb, linbits);
1497 v = l3_unscale(x, exponents[s_index]);
1498 if (get_bits1(&s->gb))
1499 v = -v;
1500 } else {
1501 v = 0;
1502 }
1503 g->sb_hybrid[s_index++] = v;
1504 if (y) {
1505 if (y == 15)
1506 y += get_bitsz(&s->gb, linbits);
1507 v = l3_unscale(y, exponents[s_index]);
1508 if (get_bits1(&s->gb))
1509 v = -v;
1510 } else {
1511 v = 0;
1512 }
1513 g->sb_hybrid[s_index++] = v;
1514 }
1515 }
1516
1517 /* high frequencies */
1518 vlc = &huff_quad_vlc[g->count1table_select];
1519 last_buf_ptr = NULL;
1520 last_bit_buf = 0;
1521 last_bit_cnt = 0;
1522 while (s_index <= 572) {
1523 pos = get_bits_count(&s->gb);
1524 if (pos >= end_pos) {
1525 if (pos > end_pos && last_buf_ptr != NULL) {
1526 /* some encoders generate an incorrect size for this
1527 part. We must go back into the data */
1528 s_index -= 4;
1529 s->gb.buf_ptr = last_buf_ptr;
1530 s->gb.bit_buf = last_bit_buf;
1531 s->gb.bit_cnt = last_bit_cnt;
1532 }
1533 break;
1534 }
1535 last_buf_ptr = s->gb.buf_ptr;
1536 last_bit_buf = s->gb.bit_buf;
1537 last_bit_cnt = s->gb.bit_cnt;
1538
1539 code = get_vlc(&s->gb, vlc);
1540 dprintf("t=%d code=%d\n", g->count1table_select, code);
1541 if (code < 0)
1542 return -1;
1543 for(i=0;i<4;i++) {
1544 if (code & (8 >> i)) {
1545 /* non zero value. Could use a hand coded function for
1546 'one' value */
1547 v = l3_unscale(1, exponents[s_index]);
1548 if(get_bits1(&s->gb))
1549 v = -v;
1550 } else {
1551 v = 0;
1552 }
1553 g->sb_hybrid[s_index++] = v;
1554 }
1555 }
1556 while (s_index < 576)
1557 g->sb_hybrid[s_index++] = 0;
1558 return 0;
1559 }
1560
1561 /* Reorder short blocks from bitstream order to interleaved order. It
1562 would be faster to do it in parsing, but the code would be far more
1563 complicated */
1564 static void reorder_block(MPADecodeContext *s, GranuleDef *g)
1565 {
1566 int i, j, k, len;
1567 INT32 *ptr, *dst, *ptr1;
1568 INT32 tmp[576];
1569
1570 if (g->block_type != 2)
1571 return;
1572
1573 if (g->switch_point) {
1574 if (s->sample_rate_index != 8) {
1575 ptr = g->sb_hybrid + 36;
1576 } else {
1577 ptr = g->sb_hybrid + 48;
1578 }
1579 } else {
1580 ptr = g->sb_hybrid;
1581 }
1582
1583 for(i=g->short_start;i<13;i++) {
1584 len = band_size_short[s->sample_rate_index][i];
1585 ptr1 = ptr;
1586 for(k=0;k<3;k++) {
1587 dst = tmp + k;
1588 for(j=len;j>0;j--) {
1589 *dst = *ptr++;
1590 dst += 3;
1591 }
1592 }
1593 memcpy(ptr1, tmp, len * 3 * sizeof(INT32));
1594 }
1595 }
1596
1597 #define ISQRT2 FIXR(0.70710678118654752440)
1598
1599 static void compute_stereo(MPADecodeContext *s,
1600 GranuleDef *g0, GranuleDef *g1)
1601 {
1602 int i, j, k, l;
1603 INT32 v1, v2;
1604 int sf_max, tmp0, tmp1, sf, len, non_zero_found;
1605 INT32 (*is_tab)[16];
1606 INT32 *tab0, *tab1;
1607 int non_zero_found_short[3];
1608
1609 /* intensity stereo */
1610 if (s->mode_ext & MODE_EXT_I_STEREO) {
1611 if (!s->lsf) {
1612 is_tab = is_table;
1613 sf_max = 7;
1614 } else {
1615 is_tab = is_table_lsf[g1->scalefac_compress & 1];
1616 sf_max = 16;
1617 }
1618
1619 tab0 = g0->sb_hybrid + 576;
1620 tab1 = g1->sb_hybrid + 576;
1621
1622 non_zero_found_short[0] = 0;
1623 non_zero_found_short[1] = 0;
1624 non_zero_found_short[2] = 0;
1625 k = (13 - g1->short_start) * 3 + g1->long_end - 3;
1626 for(i = 12;i >= g1->short_start;i--) {
1627 /* for last band, use previous scale factor */
1628 if (i != 11)
1629 k -= 3;
1630 len = band_size_short[s->sample_rate_index][i];
1631 for(l=2;l>=0;l--) {
1632 tab0 -= len;
1633 tab1 -= len;
1634 if (!non_zero_found_short[l]) {
1635 /* test if non zero band. if so, stop doing i-stereo */
1636 for(j=0;j<len;j++) {
1637 if (tab1[j] != 0) {
1638 non_zero_found_short[l] = 1;
1639 goto found1;
1640 }
1641 }
1642 sf = g1->scale_factors[k + l];
1643 if (sf >= sf_max)
1644 goto found1;
1645
1646 v1 = is_tab[0][sf];
1647 v2 = is_tab[1][sf];
1648 for(j=0;j<len;j++) {
1649 tmp0 = tab0[j];
1650 tab0[j] = MULL(tmp0, v1);
1651 tab1[j] = MULL(tmp0, v2);
1652 }
1653 } else {
1654 found1:
1655 if (s->mode_ext & MODE_EXT_MS_STEREO) {
1656 /* lower part of the spectrum : do ms stereo
1657 if enabled */
1658 for(j=0;j<len;j++) {
1659 tmp0 = tab0[j];
1660 tmp1 = tab1[j];
1661 tab0[j] = MULL(tmp0 + tmp1, ISQRT2);
1662 tab1[j] = MULL(tmp0 - tmp1, ISQRT2);
1663 }
1664 }
1665 }
1666 }
1667 }
1668
1669 non_zero_found = non_zero_found_short[0] |
1670 non_zero_found_short[1] |
1671 non_zero_found_short[2];
1672
1673 for(i = g1->long_end - 1;i >= 0;i--) {
1674 len = band_size_long[s->sample_rate_index][i];
1675 tab0 -= len;
1676 tab1 -= len;
1677 /* test if non zero band. if so, stop doing i-stereo */
1678 if (!non_zero_found) {
1679 for(j=0;j<len;j++) {
1680 if (tab1[j] != 0) {
1681 non_zero_found = 1;
1682 goto found2;
1683 }
1684 }
1685 /* for last band, use previous scale factor */
1686 k = (i == 21) ? 20 : i;
1687 sf = g1->scale_factors[k];
1688 if (sf >= sf_max)
1689 goto found2;
1690 v1 = is_tab[0][sf];
1691 v2 = is_tab[1][sf];
1692 for(j=0;j<len;j++) {
1693 tmp0 = tab0[j];
1694 tab0[j] = MULL(tmp0, v1);
1695 tab1[j] = MULL(tmp0, v2);
1696 }
1697 } else {
1698 found2:
1699 if (s->mode_ext & MODE_EXT_MS_STEREO) {
1700 /* lower part of the spectrum : do ms stereo
1701 if enabled */
1702 for(j=0;j<len;j++) {
1703 tmp0 = tab0[j];
1704 tmp1 = tab1[j];
1705 tab0[j] = MULL(tmp0 + tmp1, ISQRT2);
1706 tab1[j] = MULL(tmp0 - tmp1, ISQRT2);
1707 }
1708 }
1709 }
1710 }
1711 } else if (s->mode_ext & MODE_EXT_MS_STEREO) {
1712 /* ms stereo ONLY */
1713 /* NOTE: the 1/sqrt(2) normalization factor is included in the
1714 global gain */
1715 tab0 = g0->sb_hybrid;
1716 tab1 = g1->sb_hybrid;
1717 for(i=0;i<576;i++) {
1718 tmp0 = tab0[i];
1719 tmp1 = tab1[i];
1720 tab0[i] = tmp0 + tmp1;
1721 tab1[i] = tmp0 - tmp1;
1722 }
1723 }
1724 }
1725
1726 static void compute_antialias(MPADecodeContext *s,
1727 GranuleDef *g)
1728 {
1729 INT32 *ptr, *p0, *p1, *csa;
1730 int n, tmp0, tmp1, i, j;
1731
1732 /* we antialias only "long" bands */
1733 if (g->block_type == 2) {
1734 if (!g->switch_point)
1735 return;
1736 /* XXX: check this for 8000Hz case */
1737 n = 1;
1738 } else {
1739 n = SBLIMIT - 1;
1740 }
1741
1742 ptr = g->sb_hybrid + 18;
1743 for(i = n;i > 0;i--) {
1744 p0 = ptr - 1;
1745 p1 = ptr;
1746 csa = &csa_table[0][0];
1747 for(j=0;j<8;j++) {
1748 tmp0 = *p0;
1749 tmp1 = *p1;
1750 *p0 = FRAC_RND(MUL64(tmp0, csa[0]) - MUL64(tmp1, csa[1]));
1751 *p1 = FRAC_RND(MUL64(tmp0, csa[1]) + MUL64(tmp1, csa[0]));
1752 p0--;
1753 p1++;
1754 csa += 2;
1755 }
1756 ptr += 18;
1757 }
1758 }
1759
1760 static void compute_imdct(MPADecodeContext *s,
1761 GranuleDef *g,
1762 INT32 *sb_samples,
1763 INT32 *mdct_buf)
1764 {
1765 INT32 *ptr, *win, *win1, *buf, *buf2, *out_ptr, *ptr1;
1766 INT32 in[6];
1767 INT32 out[36];
1768 INT32 out2[12];
1769 int i, j, k, mdct_long_end, v, sblimit;
1770
1771 /* find last non zero block */
1772 ptr = g->sb_hybrid + 576;
1773 ptr1 = g->sb_hybrid + 2 * 18;
1774 while (ptr >= ptr1) {
1775 ptr -= 6;
1776 v = ptr[0] | ptr[1] | ptr[2] | ptr[3] | ptr[4] | ptr[5];
1777 if (v != 0)
1778 break;
1779 }
1780 sblimit = ((ptr - g->sb_hybrid) / 18) + 1;
1781
1782 if (g->block_type == 2) {
1783 /* XXX: check for 8000 Hz */
1784 if (g->switch_point)
1785 mdct_long_end = 2;
1786 else
1787 mdct_long_end = 0;
1788 } else {
1789 mdct_long_end = sblimit;
1790 }
1791
1792 buf = mdct_buf;
1793 ptr = g->sb_hybrid;
1794 for(j=0;j<mdct_long_end;j++) {
1795 imdct36(out, ptr);
1796 /* apply window & overlap with previous buffer */
1797 out_ptr = sb_samples + j;
1798 /* select window */
1799 if (g->switch_point && j < 2)
1800 win1 = mdct_win[0];
1801 else
1802 win1 = mdct_win[g->block_type];
1803 /* select frequency inversion */
1804 win = win1 + ((4 * 36) & -(j & 1));
1805 for(i=0;i<18;i++) {
1806 *out_ptr = MULL(out[i], win[i]) + buf[i];
1807 buf[i] = MULL(out[i + 18], win[i + 18]);
1808 out_ptr += SBLIMIT;
1809 }
1810 ptr += 18;
1811 buf += 18;
1812 }
1813 for(j=mdct_long_end;j<sblimit;j++) {
1814 for(i=0;i<6;i++) {
1815 out[i] = 0;
1816 out[6 + i] = 0;
1817 out[30+i] = 0;
1818 }
1819 /* select frequency inversion */
1820 win = mdct_win[2] + ((4 * 36) & -(j & 1));
1821 buf2 = out + 6;
1822 for(k=0;k<3;k++) {
1823 /* reorder input for short mdct */
1824 ptr1 = ptr + k;
1825 for(i=0;i<6;i++) {
1826 in[i] = *ptr1;
1827 ptr1 += 3;
1828 }
1829 imdct12(out2, in);
1830 /* apply 12 point window and do small overlap */
1831 for(i=0;i<6;i++) {
1832 buf2[i] = MULL(out2[i], win[i]) + buf2[i];
1833 buf2[i + 6] = MULL(out2[i + 6], win[i + 6]);
1834 }
1835 buf2 += 6;
1836 }
1837 /* overlap */
1838 out_ptr = sb_samples + j;
1839 for(i=0;i<18;i++) {
1840 *out_ptr = out[i] + buf[i];
1841 buf[i] = out[i + 18];
1842 out_ptr += SBLIMIT;
1843 }
1844 ptr += 18;
1845 buf += 18;
1846 }
1847 /* zero bands */
1848 for(j=sblimit;j<SBLIMIT;j++) {
1849 /* overlap */
1850 out_ptr = sb_samples + j;
1851 for(i=0;i<18;i++) {
1852 *out_ptr = buf[i];
1853 buf[i] = 0;
1854 out_ptr += SBLIMIT;
1855 }
1856 buf += 18;
1857 }
1858 }
1859
1860 #ifdef DEBUG
1861 void sample_dump(int fnum, INT32 *tab, int n)
1862 {
1863 static FILE *files[16], *f;
1864 char buf[512];
1865
1866 f = files[fnum];
1867 if (!f) {
1868 sprintf(buf, "/tmp/out%d.pcm", fnum);
1869 f = fopen(buf, "w");
1870 if (!f)
1871 return;
1872 files[fnum] = f;
1873 }
1874
1875 if (fnum == 0) {
1876 int i;
1877 static int pos = 0;
1878 printf("pos=%d\n", pos);
1879 for(i=0;i<n;i++) {
1880 printf(" %f", (double)tab[i] / 32768.0);
1881 if ((i % 18) == 17)
1882 printf("\n");
1883 }
1884 pos += n;
1885 }
1886
1887 fwrite(tab, 1, n * sizeof(INT32), f);
1888 }
1889 #endif
1890
1891
1892 /* main layer3 decoding function */
1893 static int mp_decode_layer3(MPADecodeContext *s)
1894 {
1895 int nb_granules, main_data_begin, private_bits;
1896 int gr, ch, blocksplit_flag, i, j, k, n, bits_pos, bits_left;
1897 GranuleDef granules[2][2], *g;
1898 INT16 exponents[576];
1899
1900 /* read side info */
1901 if (s->lsf) {
1902 main_data_begin = get_bits(&s->gb, 8);
1903 if (s->nb_channels == 2)
1904 private_bits = get_bits(&s->gb, 2);
1905 else
1906 private_bits = get_bits(&s->gb, 1);
1907 nb_granules = 1;
1908 } else {
1909 main_data_begin = get_bits(&s->gb, 9);
1910 if (s->nb_channels == 2)
1911 private_bits = get_bits(&s->gb, 3);
1912 else
1913 private_bits = get_bits(&s->gb, 5);
1914 nb_granules = 2;
1915 for(ch=0;ch<s->nb_channels;ch++) {
1916 granules[ch][0].scfsi = 0; /* all scale factors are transmitted */
1917 granules[ch][1].scfsi = get_bits(&s->gb, 4);
1918 }
1919 }
1920
1921 for(gr=0;gr<nb_granules;gr++) {
1922 for(ch=0;ch<s->nb_channels;ch++) {
1923 dprintf("gr=%d ch=%d: side_info\n", gr, ch);
1924 g = &granules[ch][gr];
1925 g->part2_3_length = get_bits(&s->gb, 12);
1926 g->big_values = get_bits(&s->gb, 9);
1927 g->global_gain = get_bits(&s->gb, 8);
1928 /* if MS stereo only is selected, we precompute the
1929 1/sqrt(2) renormalization factor */
1930 if ((s->mode_ext & (MODE_EXT_MS_STEREO | MODE_EXT_I_STEREO)) ==
1931 MODE_EXT_MS_STEREO)
1932 g->global_gain -= 2;
1933 if (s->lsf)
1934 g->scalefac_compress = get_bits(&s->gb, 9);
1935 else
1936 g->scalefac_compress = get_bits(&s->gb, 4);
1937 blocksplit_flag = get_bits(&s->gb, 1);
1938 if (blocksplit_flag) {
1939 g->block_type = get_bits(&s->gb, 2);
1940 if (g->block_type == 0)
1941 return -1;
1942 g->switch_point = get_bits(&s->gb, 1);
1943 for(i=0;i<2;i++)
1944 g->table_select[i] = get_bits(&s->gb, 5);
1945 for(i=0;i<3;i++)
1946 g->subblock_gain[i] = get_bits(&s->gb, 3);
1947 /* compute huffman coded region sizes */
1948 if (g->block_type == 2)
1949 g->region_size[0] = (36 / 2);
1950 else {
1951 if (s->sample_rate_index <= 2)
1952 g->region_size[0] = (36 / 2);
1953 else if (s->sample_rate_index != 8)
1954 g->region_size[0] = (54 / 2);
1955 else
1956 g->region_size[0] = (108 / 2);
1957 }
1958 g->region_size[1] = (576 / 2);
1959 } else {
1960 int region_address1, region_address2, l;
1961 g->block_type = 0;
1962 g->switch_point = 0;
1963 for(i=0;i<3;i++)
1964 g->table_select[i] = get_bits(&s->gb, 5);
1965 /* compute huffman coded region sizes */
1966 region_address1 = get_bits(&s->gb, 4);
1967 region_address2 = get_bits(&s->gb, 3);
1968 dprintf("region1=%d region2=%d\n",
1969 region_address1, region_address2);
1970 g->region_size[0] =
1971 band_index_long[s->sample_rate_index][region_address1 + 1] >> 1;
1972 l = region_address1 + region_address2 + 2;
1973 /* should not overflow */
1974 if (l > 22)
1975 l = 22;
1976 g->region_size[1] =
1977 band_index_long[s->sample_rate_index][l] >> 1;
1978 }
1979 /* convert region offsets to region sizes and truncate
1980 size to big_values */
1981 g->region_size[2] = (576 / 2);
1982 j = 0;
1983 for(i=0;i<3;i++) {
1984 k = g->region_size[i];
1985 if (k > g->big_values)
1986 k = g->big_values;
1987 g->region_size[i] = k - j;
1988 j = k;
1989 }
1990
1991 /* compute band indexes */
1992 if (g->block_type == 2) {
1993 if (g->switch_point) {
1994 /* if switched mode, we handle the 36 first samples as
1995 long blocks. For 8000Hz, we handle the 48 first
1996 exponents as long blocks (XXX: check this!) */
1997 if (s->sample_rate_index <= 2)
1998 g->long_end = 8;
1999 else if (s->sample_rate_index != 8)
2000 g->long_end = 6;
2001 else
2002 g->long_end = 4; /* 8000 Hz */
2003
2004 if (s->sample_rate_index != 8)
2005 g->short_start = 3;
2006 else
2007 g->short_start = 2;
2008 } else {
2009 g->long_end = 0;
2010 g->short_start = 0;
2011 }
2012 } else {
2013 g->short_start = 13;
2014 g->long_end = 22;
2015 }
2016
2017 g->preflag = 0;
2018 if (!s->lsf)
2019 g->preflag = get_bits(&s->gb, 1);
2020 g->scalefac_scale = get_bits(&s->gb, 1);
2021 g->count1table_select = get_bits(&s->gb, 1);
2022 dprintf("block_type=%d switch_point=%d\n",
2023 g->block_type, g->switch_point);
2024 }
2025 }
2026
2027 /* now we get bits from the main_data_begin offset */
2028 dprintf("seekback: %d\n", main_data_begin);
2029 seek_to_maindata(s, main_data_begin);
2030
2031 for(gr=0;gr<nb_granules;gr++) {
2032 for(ch=0;ch<s->nb_channels;ch++) {
2033 g = &granules[ch][gr];
2034
2035 bits_pos = get_bits_count(&s->gb);
2036
2037 if (!s->lsf) {
2038 UINT8 *sc;
2039 int slen, slen1, slen2;
2040
2041 /* MPEG1 scale factors */
2042 slen1 = slen_table[0][g->scalefac_compress];
2043 slen2 = slen_table[1][g->scalefac_compress];
2044 dprintf("slen1=%d slen2=%d\n", slen1, slen2);
2045 if (g->block_type == 2) {
2046 n = g->switch_point ? 17 : 18;
2047 j = 0;
2048 for(i=0;i<n;i++)
2049 g->scale_factors[j++] = get_bitsz(&s->gb, slen1);
2050 for(i=0;i<18;i++)
2051 g->scale_factors[j++] = get_bitsz(&s->gb, slen2);
2052 for(i=0;i<3;i++)
2053 g->scale_factors[j++] = 0;
2054 } else {
2055 sc = granules[ch][0].scale_factors;
2056 j = 0;
2057 for(k=0;k<4;k++) {
2058 n = (k == 0 ? 6 : 5);
2059 if ((g->scfsi & (0x8 >> k)) == 0) {
2060 slen = (k < 2) ? slen1 : slen2;
2061 for(i=0;i<n;i++)
2062 g->scale_factors[j++] = get_bitsz(&s->gb, slen);
2063 } else {
2064 /* simply copy from last granule */
2065 for(i=0;i<n;i++) {
2066 g->scale_factors[j] = sc[j];
2067 j++;
2068 }
2069 }
2070 }
2071 g->scale_factors[j++] = 0;
2072 }
2073 #ifdef DEBUG
2074 {
2075 printf("scfsi=%x gr=%d ch=%d scale_factors:\n",
2076 g->scfsi, gr, ch);
2077 for(i=0;i<j;i++)
2078 printf(" %d", g->scale_factors[i]);
2079 printf("\n");
2080 }
2081 #endif
2082 } else {
2083 int tindex, tindex2, slen[4], sl, sf;
2084
2085 /* LSF scale factors */
2086 if (g->block_type == 2) {
2087 tindex = g->switch_point ? 2 : 1;
2088 } else {
2089 tindex = 0;
2090 }
2091 sf = g->scalefac_compress;
2092 if ((s->mode_ext & MODE_EXT_I_STEREO) && ch == 1) {
2093 /* intensity stereo case */
2094 sf >>= 1;
2095 if (sf < 180) {
2096 lsf_sf_expand(slen, sf, 6, 6, 0);
2097 tindex2 = 3;
2098 } else if (sf < 244) {
2099 lsf_sf_expand(slen, sf - 180, 4, 4, 0);
2100 tindex2 = 4;
2101 } else {
2102 lsf_sf_expand(slen, sf - 244, 3, 0, 0);
2103 tindex2 = 5;
2104 }
2105 } else {
2106 /* normal case */
2107 if (sf < 400) {
2108 lsf_sf_expand(slen, sf, 5, 4, 4);
2109 tindex2 = 0;
2110 } else if (sf < 500) {
2111 lsf_sf_expand(slen, sf - 400, 5, 4, 0);
2112 tindex2 = 1;
2113 } else {
2114 lsf_sf_expand(slen, sf - 500, 3, 0, 0);
2115 tindex2 = 2;
2116 g->preflag = 1;
2117 }
2118 }
2119
2120 j = 0;
2121 for(k=0;k<4;k++) {
2122 n = lsf_nsf_table[tindex2][tindex][k];
2123 sl = slen[k];
2124 for(i=0;i<n;i++)
2125 g->scale_factors[j++] = get_bitsz(&s->gb, sl);
2126 }
2127 /* XXX: should compute exact size */
2128 for(;j<40;j++)
2129 g->scale_factors[j] = 0;
2130 #ifdef DEBUG
2131 {
2132 printf("gr=%d ch=%d scale_factors:\n",
2133 gr, ch);
2134 for(i=0;i<40;i++)
2135 printf(" %d", g->scale_factors[i]);
2136 printf("\n");
2137 }
2138 #endif
2139 }
2140
2141 exponents_from_scale_factors(s, g, exponents);
2142
2143 /* read Huffman coded residue */
2144 if (huffman_decode(s, g, exponents,
2145 bits_pos + g->part2_3_length) < 0)
2146 return -1;
2147 #if defined(DEBUG) && 0
2148 sample_dump(3, g->sb_hybrid, 576);
2149 #endif
2150
2151 /* skip extension bits */
2152 bits_left = g->part2_3_length - (get_bits_count(&s->gb) - bits_pos);
2153 if (bits_left < 0) {
2154 dprintf("bits_left=%d\n", bits_left);
2155 return -1;
2156 }
2157 while (bits_left >= 16) {
2158 skip_bits(&s->gb, 16);
2159 bits_left -= 16;
2160 }
2161 if (bits_left > 0)
2162 skip_bits(&s->gb, bits_left);
2163 } /* ch */
2164
2165 if (s->nb_channels == 2)
2166 compute_stereo(s, &granules[0][gr], &granules[1][gr]);
2167
2168 for(ch=0;ch<s->nb_channels;ch++) {
2169 g = &granules[ch][gr];
2170
2171 reorder_block(s, g);
2172 #ifdef DEBUG
2173 sample_dump(0, g->sb_hybrid, 576);
2174 #endif
2175 compute_antialias(s, g);
2176 #ifdef DEBUG
2177 sample_dump(1, g->sb_hybrid, 576);
2178 #endif
2179 compute_imdct(s, g, &s->sb_samples[ch][18 * gr][0], s->mdct_buf[ch]);
2180 #ifdef DEBUG
2181 sample_dump(2, &s->sb_samples[ch][18 * gr][0], 576);
2182 #endif
2183 }
2184 } /* gr */
2185 return nb_granules * 18;
166 } 2186 }
167 2187
168 static int mp_decode_frame(MPADecodeContext *s, 2188 static int mp_decode_frame(MPADecodeContext *s,
169 short *samples) 2189 short *samples)
170 { 2190 {
171 int nb_bytes; 2191 int i, nb_frames, ch;
172 2192 short *samples_ptr;
173 init_get_bits(&s->gb, s->inbuf + HEADER_SIZE, s->inbuf_ptr - s->inbuf - HEADER_SIZE); 2193
2194 init_get_bits(&s->gb, s->inbuf + HEADER_SIZE,
2195 s->inbuf_ptr - s->inbuf - HEADER_SIZE);
174 2196
175 /* skip error protection field */ 2197 /* skip error protection field */
176 if (s->error_protection) 2198 if (s->error_protection)
177 get_bits(&s->gb, 16); 2199 get_bits(&s->gb, 16);
178 2200
179 /* XXX: horrible: global! */ 2201 dprintf("frame %d:\n", s->frame_count);
180 gmp = &s->mpstr;
181 gmp_s = s;
182 gmp_gb = &s->gb;
183
184 nb_bytes = 0;
185 switch(s->layer) { 2202 switch(s->layer) {
186 case 1: 2203 case 1:
187 do_layer1(&s->mpstr.fr,(unsigned char *)samples, &nb_bytes); 2204 nb_frames = mp_decode_layer1(s);
188 break; 2205 break;
189 case 2: 2206 case 2:
190 do_layer2(&s->mpstr.fr,(unsigned char *)samples, &nb_bytes); 2207 nb_frames = mp_decode_layer2(s);
191 break; 2208 break;
192 case 3: 2209 case 3:
193 do_layer3(&s->mpstr.fr,(unsigned char *)samples, &nb_bytes); 2210 default:
194 s->inbuf_index ^= 1; 2211 nb_frames = mp_decode_layer3(s);
195 s->inbuf = &s->inbuf1[s->inbuf_index][BACKSTEP_SIZE];
196 s->old_frame_size = s->frame_size;
197 break; 2212 break;
198 default: 2213 }
199 break; 2214 #if defined(DEBUG)
200 } 2215 for(i=0;i<nb_frames;i++) {
201 return nb_bytes; 2216 for(ch=0;ch<s->nb_channels;ch++) {
202 } 2217 int j;
203 2218 printf("%d-%d:", i, ch);
204 /* 2219 for(j=0;j<SBLIMIT;j++)
205 * seek back in the stream for backstep bytes (at most 511 bytes, and 2220 printf(" %0.6f", (double)s->sb_samples[ch][i][j] / FRAC_ONE);
206 * at most in last frame). Note that this is slightly incorrect (data 2221 printf("\n");
207 * can span more than one block!) 2222 }
208 */ 2223 }
209 int set_pointer(long backstep) 2224 #endif
210 { 2225 /* apply the synthesis filter */
211 UINT8 *ptr; 2226 for(ch=0;ch<s->nb_channels;ch++) {
212 2227 samples_ptr = samples + ch;
213 /* compute current position in stream */ 2228 for(i=0;i<nb_frames;i++) {
214 ptr = gmp_gb->buf_ptr - (gmp_gb->bit_cnt >> 3); 2229 synth_filter(s, ch, samples_ptr, s->nb_channels,
215 /* copy old data before current one */ 2230 s->sb_samples[ch][i]);
216 ptr -= backstep; 2231 samples_ptr += 32 * s->nb_channels;
217 memcpy(ptr, gmp_s->inbuf1[gmp_s->inbuf_index ^ 1] + 2232 }
218 BACKSTEP_SIZE + gmp_s->old_frame_size - backstep, backstep); 2233 }
219 /* init get bits again */ 2234 #ifdef DEBUG
220 init_get_bits(gmp_gb, ptr, gmp_s->frame_size + backstep); 2235 s->frame_count++;
221 2236 #endif
222 return 0; 2237 return nb_frames * 32 * sizeof(short) * s->nb_channels;
223 } 2238 }
224 2239
225 static int decode_frame(AVCodecContext * avctx, 2240 static int decode_frame(AVCodecContext * avctx,
226 void *data, int *data_size, 2241 void *data, int *data_size,
227 UINT8 * buf, int buf_size) 2242 UINT8 * buf, int buf_size)
235 *data_size = 0; 2250 *data_size = 0;
236 buf_ptr = buf; 2251 buf_ptr = buf;
237 while (buf_size > 0) { 2252 while (buf_size > 0) {
238 len = s->inbuf_ptr - s->inbuf; 2253 len = s->inbuf_ptr - s->inbuf;
239 if (s->frame_size == 0) { 2254 if (s->frame_size == 0) {
240 /* no header seen : find one. We need at least 7 bytes to parse it */ 2255 /* special case for next header for first frame in free
2256 format case (XXX: find a simpler method) */
2257 if (s->free_format_next_header != 0) {
2258 s->inbuf[0] = s->free_format_next_header >> 24;
2259 s->inbuf[1] = s->free_format_next_header >> 16;
2260 s->inbuf[2] = s->free_format_next_header >> 8;
2261 s->inbuf[3] = s->free_format_next_header;
2262 s->inbuf_ptr = s->inbuf + 4;
2263 s->free_format_next_header = 0;
2264 goto got_header;
2265 }
2266 /* no header seen : find one. We need at least HEADER_SIZE
2267 bytes to parse it */
241 len = HEADER_SIZE - len; 2268 len = HEADER_SIZE - len;
242 if (len > buf_size) 2269 if (len > buf_size)
243 len = buf_size; 2270 len = buf_size;
244 memcpy(s->inbuf_ptr, buf_ptr, len); 2271 memcpy(s->inbuf_ptr, buf_ptr, len);
245 buf_ptr += len; 2272 buf_ptr += len;
246 s->inbuf_ptr += len; 2273 s->inbuf_ptr += len;
247 buf_size -= len; 2274 buf_size -= len;
248 if ((s->inbuf_ptr - s->inbuf) == HEADER_SIZE) { 2275 if ((s->inbuf_ptr - s->inbuf) == HEADER_SIZE) {
2276 got_header:
249 header = (s->inbuf[0] << 24) | (s->inbuf[1] << 16) | 2277 header = (s->inbuf[0] << 24) | (s->inbuf[1] << 16) |
250 (s->inbuf[2] << 8) | s->inbuf[3]; 2278 (s->inbuf[2] << 8) | s->inbuf[3];
251 if (check_header(header) < 0) { 2279 if (check_header(header) < 0) {
252 /* no sync found : move by one byte (inefficient, but simple!) */ 2280 /* no sync found : move by one byte (inefficient, but simple!) */
253 memcpy(s->inbuf, s->inbuf + 1, HEADER_SIZE - 1); 2281 memcpy(s->inbuf, s->inbuf + 1, HEADER_SIZE - 1);
254 s->inbuf_ptr--; 2282 s->inbuf_ptr--;
2283 dprintf("skip %x\n", header);
2284 /* reset free format frame size to give a chance
2285 to get a new bitrate */
2286 s->free_format_frame_size = 0;
255 } else { 2287 } else {
256 decode_header(s, header); 2288 if (decode_header(s, header) == 1) {
257 /* update codec info */ 2289 /* free format: compute frame size */
258 avctx->sample_rate = s->sample_rate; 2290 s->frame_size = -1;
259 avctx->channels = s->mpstr.fr.stereo ? 2 : 1; 2291 } else {
260 avctx->bit_rate = s->bit_rate; 2292 /* update codec info */
2293 avctx->sample_rate = s->sample_rate;
2294 avctx->channels = s->nb_channels;
2295 avctx->bit_rate = s->bit_rate;
2296 }
261 } 2297 }
262 } 2298 }
2299 } else if (s->frame_size == -1) {
2300 /* free format : find next sync to compute frame size */
2301 len = MPA_MAX_CODED_FRAME_SIZE - len;
2302 if (len > buf_size)
2303 len = buf_size;
2304 if (len == 0) {
2305 /* frame too long: resync */
2306 s->frame_size = 0;
2307 } else {
2308 UINT8 *p, *pend;
2309 UINT32 header1;
2310 int padding;
2311
2312 memcpy(s->inbuf_ptr, buf_ptr, len);
2313 /* check for header */
2314 p = s->inbuf_ptr - 3;
2315 pend = s->inbuf_ptr + len - 4;
2316 while (p <= pend) {
2317 header = (p[0] << 24) | (p[1] << 16) |
2318 (p[2] << 8) | p[3];
2319 header1 = (s->inbuf[0] << 24) | (s->inbuf[1] << 16) |
2320 (s->inbuf[2] << 8) | s->inbuf[3];
2321 /* check with high probability that we have a
2322 valid header */
2323 if ((header & SAME_HEADER_MASK) ==
2324 (header1 & SAME_HEADER_MASK)) {
2325 /* header found: update pointers */
2326 len = (p + 4) - s->inbuf_ptr;
2327 buf_ptr += len;
2328 buf_size -= len;
2329 s->inbuf_ptr = p;
2330 /* compute frame size */
2331 s->free_format_next_header = header;
2332 s->free_format_frame_size = s->inbuf_ptr - s->inbuf;
2333 padding = (header1 >> 9) & 1;
2334 if (s->layer == 1)
2335 s->free_format_frame_size -= padding * 4;
2336 else
2337 s->free_format_frame_size -= padding;
2338 dprintf("free frame size=%d padding=%d\n",
2339 s->free_format_frame_size, padding);
2340 decode_header(s, header1);
2341 goto next_data;
2342 }
2343 p++;
2344 }
2345 /* not found: simply increase pointers */
2346 buf_ptr += len;
2347 s->inbuf_ptr += len;
2348 buf_size -= len;
2349 }
263 } else if (len < s->frame_size) { 2350 } else if (len < s->frame_size) {
264 len = s->frame_size - len; 2351 len = s->frame_size - len;
265 if (len > buf_size) 2352 if (len > buf_size)
266 len = buf_size; 2353 len = buf_size;
267 2354
274 s->inbuf_ptr = s->inbuf; 2361 s->inbuf_ptr = s->inbuf;
275 s->frame_size = 0; 2362 s->frame_size = 0;
276 *data_size = out_size; 2363 *data_size = out_size;
277 break; 2364 break;
278 } 2365 }
2366 next_data:
279 } 2367 }
280 return buf_ptr - buf; 2368 return buf_ptr - buf;
281 } 2369 }
282 2370
283 AVCodec mp3_decoder = 2371 AVCodec mp3_decoder =