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.

2898 lines
86KB

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