You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

2927 lines
88KB

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