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.

2586 lines
77KB

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