falkTX
/
FFmpeg
mirror of https://github.com/falkTX/FFmpeg.git
1
0
Fork 0
Code Issues 0 Releases 338 Wiki Activity
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.
14863 Commits
32 Branches
789MB
Tree: 4f20b45fbe
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from '4f20b45fbe'
${ noResults }
FFmpeg/libavcodec/mpegaudiodec.c

2697 lines
80KB
Raw Blame History 

  1. /*

  2.  * MPEG Audio decoder

  3.  * Copyright (c) 2001, 2002 Fabrice Bellard.

  4.  *

  5.  * This file is part of FFmpeg.

  6.  *

  7.  * FFmpeg is free software; you can redistribute it and/or

  8.  * modify it under the terms of the GNU Lesser General Public

  9.  * License as published by the Free Software Foundation; either

  10.  * version 2.1 of the License, or (at your option) any later version.

  11.  *

  12.  * FFmpeg is distributed in the hope that it will be useful,

  13.  * but WITHOUT ANY WARRANTY; without even the implied warranty of

  14.  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU

  15.  * Lesser General Public License for more details.

  16.  *

  17.  * You should have received a copy of the GNU Lesser General Public

  18.  * License along with FFmpeg; if not, write to the Free Software

  19.  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA

  20.  */

  21. 

  22. /**

  23.  * @file mpegaudiodec.c

  24.  * MPEG Audio decoder.

  25.  */

  26. 

  27. //#define DEBUG

  28. #include "avcodec.h"

  29. #include "bitstream.h"

  30. #include "dsputil.h"

  31. 

  32. /*

  33.  * TODO:

  34.  *  - in low precision mode, use more 16 bit multiplies in synth filter

  35.  *  - test lsf / mpeg25 extensively.

  36.  */

  37. 

  38. /* define USE_HIGHPRECISION to have a bit exact (but slower) mpeg

  39.    audio decoder */

  40. #ifdef CONFIG_MPEGAUDIO_HP

  41. #   define USE_HIGHPRECISION

  42. #endif

  43. 

  44. #include "mpegaudio.h"

  45. #include "mpegaudiodecheader.h"

  46. 

  47. #include "mathops.h"

  48. 

  49. /* WARNING: only correct for posititive numbers */

  50. #define FIXR(a)   ((int)((a) * FRAC_ONE + 0.5))

  51. #define FRAC_RND(a) (((a) + (FRAC_ONE/2)) >> FRAC_BITS)

  52. 

  53. #define FIXHR(a) ((int)((a) * (1LL<<32) + 0.5))

  54. 

  55. /****************/

  56. 

  57. #define HEADER_SIZE 4

  58. 

  59. /* layer 3 "granule" */

  60. typedef struct GranuleDef {

  61.     uint8_t scfsi;

  62.     int part2_3_length;

  63.     int big_values;

  64.     int global_gain;

  65.     int scalefac_compress;

  66.     uint8_t block_type;

  67.     uint8_t switch_point;

  68.     int table_select[3];

  69.     int subblock_gain[3];

  70.     uint8_t scalefac_scale;

  71.     uint8_t count1table_select;

  72.     int region_size[3]; /* number of huffman codes in each region */

  73.     int preflag;

  74.     int short_start, long_end; /* long/short band indexes */

  75.     uint8_t scale_factors[40];

  76.     int32_t sb_hybrid[SBLIMIT * 18]; /* 576 samples */

  77. } GranuleDef;

  78. 

  79. #include "mpegaudiodata.h"

  80. #include "mpegaudiodectab.h"

  81. 

  82. static void compute_antialias_integer(MPADecodeContext *s, GranuleDef *g);

  83. static void compute_antialias_float(MPADecodeContext *s, GranuleDef *g);

  84. 

  85. /* vlc structure for decoding layer 3 huffman tables */

  86. static VLC huff_vlc[16];

  87. static VLC huff_quad_vlc[2];

  88. /* computed from band_size_long */

  89. static uint16_t band_index_long[9][23];

  90. /* XXX: free when all decoders are closed */

  91. #define TABLE_4_3_SIZE (8191 + 16)*4

  92. static int8_t  table_4_3_exp[TABLE_4_3_SIZE];

  93. static uint32_t table_4_3_value[TABLE_4_3_SIZE];

  94. static uint32_t exp_table[512];

  95. static uint32_t expval_table[512][16];

  96. /* intensity stereo coef table */

  97. static int32_t is_table[2][16];

  98. static int32_t is_table_lsf[2][2][16];

  99. static int32_t csa_table[8][4];

  100. static float csa_table_float[8][4];

  101. static int32_t mdct_win[8][36];

  102. 

  103. /* lower 2 bits: modulo 3, higher bits: shift */

  104. static uint16_t scale_factor_modshift[64];

  105. /* [i][j]:  2^(-j/3) * FRAC_ONE * 2^(i+2) / (2^(i+2) - 1) */

  106. static int32_t scale_factor_mult[15][3];

  107. /* mult table for layer 2 group quantization */

  108. 

  109. #define SCALE_GEN(v) \

  110. { FIXR(1.0 * (v)), FIXR(0.7937005259 * (v)), FIXR(0.6299605249 * (v)) }

  111. 

  112. static const int32_t scale_factor_mult2[3][3] = {

  113.     SCALE_GEN(4.0 / 3.0), /* 3 steps */

  114.     SCALE_GEN(4.0 / 5.0), /* 5 steps */

  115.     SCALE_GEN(4.0 / 9.0), /* 9 steps */

  116. };

  117. 

  118. static DECLARE_ALIGNED_16(MPA_INT, window[512]);

  119. 

  120. /**

  121.  * Convert region offsets to region sizes and truncate

  122.  * size to big_values.

  123.  */

  124. void ff_region_offset2size(GranuleDef *g){

  125.     int i, k, j=0;

  126.     g->region_size[2] = (576 / 2);

  127.     for(i=0;i<3;i++) {

  128.         k = FFMIN(g->region_size[i], g->big_values);

  129.         g->region_size[i] = k - j;

  130.         j = k;

  131.     }

  132. }

  133. 

  134. void ff_init_short_region(MPADecodeContext *s, GranuleDef *g){

  135.     if (g->block_type == 2)

  136.         g->region_size[0] = (36 / 2);

  137.     else {

  138.         if (s->sample_rate_index <= 2)

  139.             g->region_size[0] = (36 / 2);

  140.         else if (s->sample_rate_index != 8)

  141.             g->region_size[0] = (54 / 2);

  142.         else

  143.             g->region_size[0] = (108 / 2);

  144.     }

  145.     g->region_size[1] = (576 / 2);

  146. }

  147. 

  148. void ff_init_long_region(MPADecodeContext *s, GranuleDef *g, int ra1, int ra2){

  149.     int l;

  150.     g->region_size[0] =

  151.         band_index_long[s->sample_rate_index][ra1 + 1] >> 1;

  152.     /* should not overflow */

  153.     l = FFMIN(ra1 + ra2 + 2, 22);

  154.     g->region_size[1] =

  155.         band_index_long[s->sample_rate_index][l] >> 1;

  156. }

  157. 

  158. void ff_compute_band_indexes(MPADecodeContext *s, GranuleDef *g){

  159.     if (g->block_type == 2) {

  160.         if (g->switch_point) {

  161.             /* if switched mode, we handle the 36 first samples as

  162.                 long blocks.  For 8000Hz, we handle the 48 first

  163.                 exponents as long blocks (XXX: check this!) */

  164.             if (s->sample_rate_index <= 2)

  165.                 g->long_end = 8;

  166.             else if (s->sample_rate_index != 8)

  167.                 g->long_end = 6;

  168.             else

  169.                 g->long_end = 4; /* 8000 Hz */

  170. 

  171.             g->short_start = 2 + (s->sample_rate_index != 8);

  172.         } else {

  173.             g->long_end = 0;

  174.             g->short_start = 0;

  175.         }

  176.     } else {

  177.         g->short_start = 13;

  178.         g->long_end = 22;

  179.     }

  180. }

  181. 

  182. /* layer 1 unscaling */

  183. /* n = number of bits of the mantissa minus 1 */

  184. static inline int l1_unscale(int n, int mant, int scale_factor)

  185. {

  186.     int shift, mod;

  187.     int64_t val;

  188. 

  189.     shift = scale_factor_modshift[scale_factor];

  190.     mod = shift & 3;

  191.     shift >>= 2;

  192.     val = MUL64(mant + (-1 << n) + 1, scale_factor_mult[n-1][mod]);

  193.     shift += n;

  194.     /* NOTE: at this point, 1 <= shift >= 21 + 15 */

  195.     return (int)((val + (1LL << (shift - 1))) >> shift);

  196. }

  197. 

  198. static inline int l2_unscale_group(int steps, int mant, int scale_factor)

  199. {

  200.     int shift, mod, val;

  201. 

  202.     shift = scale_factor_modshift[scale_factor];

  203.     mod = shift & 3;

  204.     shift >>= 2;

  205. 

  206.     val = (mant - (steps >> 1)) * scale_factor_mult2[steps >> 2][mod];

  207.     /* NOTE: at this point, 0 <= shift <= 21 */

  208.     if (shift > 0)

  209.         val = (val + (1 << (shift - 1))) >> shift;

  210.     return val;

  211. }

  212. 

  213. /* compute value^(4/3) * 2^(exponent/4). It normalized to FRAC_BITS */

  214. static inline int l3_unscale(int value, int exponent)

  215. {

  216.     unsigned int m;

  217.     int e;

  218. 

  219.     e = table_4_3_exp  [4*value + (exponent&3)];

  220.     m = table_4_3_value[4*value + (exponent&3)];

  221.     e -= (exponent >> 2);

  222.     assert(e>=1);

  223.     if (e > 31)

  224.         return 0;

  225.     m = (m + (1 << (e-1))) >> e;

  226. 

  227.     return m;

  228. }

  229. 

  230. /* all integer n^(4/3) computation code */

  231. #define DEV_ORDER 13

  232. 

  233. #define POW_FRAC_BITS 24

  234. #define POW_FRAC_ONE    (1 << POW_FRAC_BITS)

  235. #define POW_FIX(a)   ((int)((a) * POW_FRAC_ONE))

  236. #define POW_MULL(a,b) (((int64_t)(a) * (int64_t)(b)) >> POW_FRAC_BITS)

  237. 

  238. static int dev_4_3_coefs[DEV_ORDER];

  239. 

  240. #if 0 /* unused */

  241. static int pow_mult3[3] = {

  242.     POW_FIX(1.0),

  243.     POW_FIX(1.25992104989487316476),

  244.     POW_FIX(1.58740105196819947474),

  245. };

  246. #endif

  247. 

  248. static void int_pow_init(void)

  249. {

  250.     int i, a;

  251. 

  252.     a = POW_FIX(1.0);

  253.     for(i=0;i<DEV_ORDER;i++) {

  254.         a = POW_MULL(a, POW_FIX(4.0 / 3.0) - i * POW_FIX(1.0)) / (i + 1);

  255.         dev_4_3_coefs[i] = a;

  256.     }

  257. }

  258. 

  259. #if 0 /* unused, remove? */

  260. /* return the mantissa and the binary exponent */

  261. static int int_pow(int i, int *exp_ptr)

  262. {

  263.     int e, er, eq, j;

  264.     int a, a1;

  265. 

  266.     /* renormalize */

  267.     a = i;

  268.     e = POW_FRAC_BITS;

  269.     while (a < (1 << (POW_FRAC_BITS - 1))) {

  270.         a = a << 1;

  271.         e--;

  272.     }

  273.     a -= (1 << POW_FRAC_BITS);

  274.     a1 = 0;

  275.     for(j = DEV_ORDER - 1; j >= 0; j--)

  276.         a1 = POW_MULL(a, dev_4_3_coefs[j] + a1);

  277.     a = (1 << POW_FRAC_BITS) + a1;

  278.     /* exponent compute (exact) */

  279.     e = e * 4;

  280.     er = e % 3;

  281.     eq = e / 3;

  282.     a = POW_MULL(a, pow_mult3[er]);

  283.     while (a >= 2 * POW_FRAC_ONE) {

  284.         a = a >> 1;

  285.         eq++;

  286.     }

  287.     /* convert to float */

  288.     while (a < POW_FRAC_ONE) {

  289.         a = a << 1;

  290.         eq--;

  291.     }

  292.     /* now POW_FRAC_ONE <= a < 2 * POW_FRAC_ONE */

  293. #if POW_FRAC_BITS > FRAC_BITS

  294.     a = (a + (1 << (POW_FRAC_BITS - FRAC_BITS - 1))) >> (POW_FRAC_BITS - FRAC_BITS);

  295.     /* correct overflow */

  296.     if (a >= 2 * (1 << FRAC_BITS)) {

  297.         a = a >> 1;

  298.         eq++;

  299.     }

  300. #endif

  301.     *exp_ptr = eq;

  302.     return a;

  303. }

  304. #endif

  305. 

  306. static int decode_init(AVCodecContext * avctx)

  307. {

  308.     MPADecodeContext *s = avctx->priv_data;

  309.     static int init=0;

  310.     int i, j, k;

  311. 

  312.     s->avctx = avctx;

  313. 

  314. #if defined(USE_HIGHPRECISION) && defined(CONFIG_AUDIO_NONSHORT)

  315.     avctx->sample_fmt= SAMPLE_FMT_S32;

  316. #else

  317.     avctx->sample_fmt= SAMPLE_FMT_S16;

  318. #endif

  319.     s->error_resilience= avctx->error_resilience;

  320. 

  321.     if(avctx->antialias_algo != FF_AA_FLOAT)

  322.         s->compute_antialias= compute_antialias_integer;

  323.     else

  324.         s->compute_antialias= compute_antialias_float;

  325. 

  326.     if (!init && !avctx->parse_only) {

  327.         /* scale factors table for layer 1/2 */

  328.         for(i=0;i<64;i++) {

  329.             int shift, mod;

  330.             /* 1.0 (i = 3) is normalized to 2 ^ FRAC_BITS */

  331.             shift = (i / 3);

  332.             mod = i % 3;

  333.             scale_factor_modshift[i] = mod | (shift << 2);

  334.         }

  335. 

  336.         /* scale factor multiply for layer 1 */

  337.         for(i=0;i<15;i++) {

  338.             int n, norm;

  339.             n = i + 2;

  340.             norm = ((INT64_C(1) << n) * FRAC_ONE) / ((1 << n) - 1);

  341.             scale_factor_mult[i][0] = MULL(FIXR(1.0 * 2.0), norm);

  342.             scale_factor_mult[i][1] = MULL(FIXR(0.7937005259 * 2.0), norm);

  343.             scale_factor_mult[i][2] = MULL(FIXR(0.6299605249 * 2.0), norm);

  344.             dprintf(avctx, "%d: norm=%x s=%x %x %x\n",

  345.                     i, norm,

  346.                     scale_factor_mult[i][0],

  347.                     scale_factor_mult[i][1],

  348.                     scale_factor_mult[i][2]);

  349.         }

  350. 

  351.         ff_mpa_synth_init(window);

  352. 

  353.         /* huffman decode tables */

  354.         for(i=1;i<16;i++) {

  355.             const HuffTable *h = &mpa_huff_tables[i];

  356.             int xsize, x, y;

  357.             unsigned int n;

  358.             uint8_t  tmp_bits [512];

  359.             uint16_t tmp_codes[512];

  360. 

  361.             memset(tmp_bits , 0, sizeof(tmp_bits ));

  362.             memset(tmp_codes, 0, sizeof(tmp_codes));

  363. 

  364.             xsize = h->xsize;

  365.             n = xsize * xsize;

  366. 

  367.             j = 0;

  368.             for(x=0;x<xsize;x++) {

  369.                 for(y=0;y<xsize;y++){

  370.                     tmp_bits [(x << 5) | y | ((x&&y)<<4)]= h->bits [j  ];

  371.                     tmp_codes[(x << 5) | y | ((x&&y)<<4)]= h->codes[j++];

  372.                 }

  373.             }

  374. 

  375.             /* XXX: fail test */

  376.             init_vlc(&huff_vlc[i], 7, 512,

  377.                      tmp_bits, 1, 1, tmp_codes, 2, 2, 1);

  378.         }

  379.         for(i=0;i<2;i++) {

  380.             init_vlc(&huff_quad_vlc[i], i == 0 ? 7 : 4, 16,

  381.                      mpa_quad_bits[i], 1, 1, mpa_quad_codes[i], 1, 1, 1);

  382.         }

  383. 

  384.         for(i=0;i<9;i++) {

  385.             k = 0;

  386.             for(j=0;j<22;j++) {

  387.                 band_index_long[i][j] = k;

  388.                 k += band_size_long[i][j];

  389.             }

  390.             band_index_long[i][22] = k;

  391.         }

  392. 

  393.         /* compute n ^ (4/3) and store it in mantissa/exp format */

  394. 

  395.         int_pow_init();

  396.         for(i=1;i<TABLE_4_3_SIZE;i++) {

  397.             double f, fm;

  398.             int e, m;

  399.             f = pow((double)(i/4), 4.0 / 3.0) * pow(2, (i&3)*0.25);

  400.             fm = frexp(f, &e);

  401.             m = (uint32_t)(fm*(1LL<<31) + 0.5);

  402.             e+= FRAC_BITS - 31 + 5 - 100;

  403. 

  404.             /* normalized to FRAC_BITS */

  405.             table_4_3_value[i] = m;

  406. //            av_log(NULL, AV_LOG_DEBUG, "%d %d %f\n", i, m, pow((double)i, 4.0 / 3.0));

  407.             table_4_3_exp[i] = -e;

  408.         }

  409.         for(i=0; i<512*16; i++){

  410.             int exponent= (i>>4);

  411.             double f= pow(i&15, 4.0 / 3.0) * pow(2, (exponent-400)*0.25 + FRAC_BITS + 5);

  412.             expval_table[exponent][i&15]= llrint(f);

  413.             if((i&15)==1)

  414.                 exp_table[exponent]= llrint(f);

  415.         }

  416. 

  417.         for(i=0;i<7;i++) {

  418.             float f;

  419.             int v;

  420.             if (i != 6) {

  421.                 f = tan((double)i * M_PI / 12.0);

  422.                 v = FIXR(f / (1.0 + f));

  423.             } else {

  424.                 v = FIXR(1.0);

  425.             }

  426.             is_table[0][i] = v;

  427.             is_table[1][6 - i] = v;

  428.         }

  429.         /* invalid values */

  430.         for(i=7;i<16;i++)

  431.             is_table[0][i] = is_table[1][i] = 0.0;

  432. 

  433.         for(i=0;i<16;i++) {

  434.             double f;

  435.             int e, k;

  436. 

  437.             for(j=0;j<2;j++) {

  438.                 e = -(j + 1) * ((i + 1) >> 1);

  439.                 f = pow(2.0, e / 4.0);

  440.                 k = i & 1;

  441.                 is_table_lsf[j][k ^ 1][i] = FIXR(f);

  442.                 is_table_lsf[j][k][i] = FIXR(1.0);

  443.                 dprintf(avctx, "is_table_lsf %d %d: %x %x\n",

  444.                         i, j, is_table_lsf[j][0][i], is_table_lsf[j][1][i]);

  445.             }

  446.         }

  447. 

  448.         for(i=0;i<8;i++) {

  449.             float ci, cs, ca;

  450.             ci = ci_table[i];

  451.             cs = 1.0 / sqrt(1.0 + ci * ci);

  452.             ca = cs * ci;

  453.             csa_table[i][0] = FIXHR(cs/4);

  454.             csa_table[i][1] = FIXHR(ca/4);

  455.             csa_table[i][2] = FIXHR(ca/4) + FIXHR(cs/4);

  456.             csa_table[i][3] = FIXHR(ca/4) - FIXHR(cs/4);

  457.             csa_table_float[i][0] = cs;

  458.             csa_table_float[i][1] = ca;

  459.             csa_table_float[i][2] = ca + cs;

  460.             csa_table_float[i][3] = ca - cs;

  461. //            printf("%d %d %d %d\n", FIX(cs), FIX(cs-1), FIX(ca), FIX(cs)-FIX(ca));

  462. //            av_log(NULL, AV_LOG_DEBUG,"%f %f %f %f\n", cs, ca, ca+cs, ca-cs);

  463.         }

  464. 

  465.         /* compute mdct windows */

  466.         for(i=0;i<36;i++) {

  467.             for(j=0; j<4; j++){

  468.                 double d;

  469. 

  470.                 if(j==2 && i%3 != 1)

  471.                     continue;

  472. 

  473.                 d= sin(M_PI * (i + 0.5) / 36.0);

  474.                 if(j==1){

  475.                     if     (i>=30) d= 0;

  476.                     else if(i>=24) d= sin(M_PI * (i - 18 + 0.5) / 12.0);

  477.                     else if(i>=18) d= 1;

  478.                 }else if(j==3){

  479.                     if     (i<  6) d= 0;

  480.                     else if(i< 12) d= sin(M_PI * (i -  6 + 0.5) / 12.0);

  481.                     else if(i< 18) d= 1;

  482.                 }

  483.                 //merge last stage of imdct into the window coefficients

  484.                 d*= 0.5 / cos(M_PI*(2*i + 19)/72);

  485. 

  486.                 if(j==2)

  487.                     mdct_win[j][i/3] = FIXHR((d / (1<<5)));

  488.                 else

  489.                     mdct_win[j][i  ] = FIXHR((d / (1<<5)));

  490. //                av_log(NULL, AV_LOG_DEBUG, "%2d %d %f\n", i,j,d / (1<<5));

  491.             }

  492.         }

  493. 

  494.         /* NOTE: we do frequency inversion adter the MDCT by changing

  495.            the sign of the right window coefs */

  496.         for(j=0;j<4;j++) {

  497.             for(i=0;i<36;i+=2) {

  498.                 mdct_win[j + 4][i] = mdct_win[j][i];

  499.                 mdct_win[j + 4][i + 1] = -mdct_win[j][i + 1];

  500.             }

  501.         }

  502. 

  503. #if defined(DEBUG)

  504.         for(j=0;j<8;j++) {

  505.             av_log(avctx, AV_LOG_DEBUG, "win%d=\n", j);

  506.             for(i=0;i<36;i++)

  507.                 av_log(avctx, AV_LOG_DEBUG, "%f, ", (double)mdct_win[j][i] / FRAC_ONE);

  508.             av_log(avctx, AV_LOG_DEBUG, "\n");

  509.         }

  510. #endif

  511.         init = 1;

  512.     }

  513. 

  514. #ifdef DEBUG

  515.     s->frame_count = 0;

  516. #endif

  517.     if (avctx->codec_id == CODEC_ID_MP3ADU)

  518.         s->adu_mode = 1;

  519.     return 0;

  520. }

  521. 

  522. /* tab[i][j] = 1.0 / (2.0 * cos(pi*(2*k+1) / 2^(6 - j))) */

  523. 

  524. /* cos(i*pi/64) */

  525. 

  526. #define COS0_0  FIXHR(0.50060299823519630134/2)

  527. #define COS0_1  FIXHR(0.50547095989754365998/2)

  528. #define COS0_2  FIXHR(0.51544730992262454697/2)

  529. #define COS0_3  FIXHR(0.53104259108978417447/2)

  530. #define COS0_4  FIXHR(0.55310389603444452782/2)

  531. #define COS0_5  FIXHR(0.58293496820613387367/2)

  532. #define COS0_6  FIXHR(0.62250412303566481615/2)

  533. #define COS0_7  FIXHR(0.67480834145500574602/2)

  534. #define COS0_8  FIXHR(0.74453627100229844977/2)

  535. #define COS0_9  FIXHR(0.83934964541552703873/2)

  536. #define COS0_10 FIXHR(0.97256823786196069369/2)

  537. #define COS0_11 FIXHR(1.16943993343288495515/4)

  538. #define COS0_12 FIXHR(1.48416461631416627724/4)

  539. #define COS0_13 FIXHR(2.05778100995341155085/8)

  540. #define COS0_14 FIXHR(3.40760841846871878570/8)

  541. #define COS0_15 FIXHR(10.19000812354805681150/32)

  542. 

  543. #define COS1_0 FIXHR(0.50241928618815570551/2)

  544. #define COS1_1 FIXHR(0.52249861493968888062/2)

  545. #define COS1_2 FIXHR(0.56694403481635770368/2)

  546. #define COS1_3 FIXHR(0.64682178335999012954/2)

  547. #define COS1_4 FIXHR(0.78815462345125022473/2)

  548. #define COS1_5 FIXHR(1.06067768599034747134/4)

  549. #define COS1_6 FIXHR(1.72244709823833392782/4)

  550. #define COS1_7 FIXHR(5.10114861868916385802/16)

  551. 

  552. #define COS2_0 FIXHR(0.50979557910415916894/2)

  553. #define COS2_1 FIXHR(0.60134488693504528054/2)

  554. #define COS2_2 FIXHR(0.89997622313641570463/2)

  555. #define COS2_3 FIXHR(2.56291544774150617881/8)

  556. 

  557. #define COS3_0 FIXHR(0.54119610014619698439/2)

  558. #define COS3_1 FIXHR(1.30656296487637652785/4)

  559. 

  560. #define COS4_0 FIXHR(0.70710678118654752439/2)

  561. 

  562. /* butterfly operator */

  563. #define BF(a, b, c, s)\

  564. {\

  565.     tmp0 = tab[a] + tab[b];\

  566.     tmp1 = tab[a] - tab[b];\

  567.     tab[a] = tmp0;\

  568.     tab[b] = MULH(tmp1<<(s), c);\

  569. }

  570. 

  571. #define BF1(a, b, c, d)\

  572. {\

  573.     BF(a, b, COS4_0, 1);\

  574.     BF(c, d,-COS4_0, 1);\

  575.     tab[c] += tab[d];\

  576. }

  577. 

  578. #define BF2(a, b, c, d)\

  579. {\

  580.     BF(a, b, COS4_0, 1);\

  581.     BF(c, d,-COS4_0, 1);\

  582.     tab[c] += tab[d];\

  583.     tab[a] += tab[c];\

  584.     tab[c] += tab[b];\

  585.     tab[b] += tab[d];\

  586. }

  587. 

  588. #define ADD(a, b) tab[a] += tab[b]

  589. 

  590. /* DCT32 without 1/sqrt(2) coef zero scaling. */

  591. static void dct32(int32_t *out, int32_t *tab)

  592. {

  593.     int tmp0, tmp1;

  594. 

  595.     /* pass 1 */

  596.     BF( 0, 31, COS0_0 , 1);

  597.     BF(15, 16, COS0_15, 5);

  598.     /* pass 2 */

  599.     BF( 0, 15, COS1_0 , 1);

  600.     BF(16, 31,-COS1_0 , 1);

  601.     /* pass 1 */

  602.     BF( 7, 24, COS0_7 , 1);

  603.     BF( 8, 23, COS0_8 , 1);

  604.     /* pass 2 */

  605.     BF( 7,  8, COS1_7 , 4);

  606.     BF(23, 24,-COS1_7 , 4);

  607.     /* pass 3 */

  608.     BF( 0,  7, COS2_0 , 1);

  609.     BF( 8, 15,-COS2_0 , 1);

  610.     BF(16, 23, COS2_0 , 1);

  611.     BF(24, 31,-COS2_0 , 1);

  612.     /* pass 1 */

  613.     BF( 3, 28, COS0_3 , 1);

  614.     BF(12, 19, COS0_12, 2);

  615.     /* pass 2 */

  616.     BF( 3, 12, COS1_3 , 1);

  617.     BF(19, 28,-COS1_3 , 1);

  618.     /* pass 1 */

  619.     BF( 4, 27, COS0_4 , 1);

  620.     BF(11, 20, COS0_11, 2);

  621.     /* pass 2 */

  622.     BF( 4, 11, COS1_4 , 1);

  623.     BF(20, 27,-COS1_4 , 1);

  624.     /* pass 3 */

  625.     BF( 3,  4, COS2_3 , 3);

  626.     BF(11, 12,-COS2_3 , 3);

  627.     BF(19, 20, COS2_3 , 3);

  628.     BF(27, 28,-COS2_3 , 3);

  629.     /* pass 4 */

  630.     BF( 0,  3, COS3_0 , 1);

  631.     BF( 4,  7,-COS3_0 , 1);

  632.     BF( 8, 11, COS3_0 , 1);

  633.     BF(12, 15,-COS3_0 , 1);

  634.     BF(16, 19, COS3_0 , 1);

  635.     BF(20, 23,-COS3_0 , 1);

  636.     BF(24, 27, COS3_0 , 1);

  637.     BF(28, 31,-COS3_0 , 1);

  638. 

  639. 

  640. 

  641.     /* pass 1 */

  642.     BF( 1, 30, COS0_1 , 1);

  643.     BF(14, 17, COS0_14, 3);

  644.     /* pass 2 */

  645.     BF( 1, 14, COS1_1 , 1);

  646.     BF(17, 30,-COS1_1 , 1);

  647.     /* pass 1 */

  648.     BF( 6, 25, COS0_6 , 1);

  649.     BF( 9, 22, COS0_9 , 1);

  650.     /* pass 2 */

  651.     BF( 6,  9, COS1_6 , 2);

  652.     BF(22, 25,-COS1_6 , 2);

  653.     /* pass 3 */

  654.     BF( 1,  6, COS2_1 , 1);

  655.     BF( 9, 14,-COS2_1 , 1);

  656.     BF(17, 22, COS2_1 , 1);

  657.     BF(25, 30,-COS2_1 , 1);

  658. 

  659.     /* pass 1 */

  660.     BF( 2, 29, COS0_2 , 1);

  661.     BF(13, 18, COS0_13, 3);

  662.     /* pass 2 */

  663.     BF( 2, 13, COS1_2 , 1);

  664.     BF(18, 29,-COS1_2 , 1);

  665.     /* pass 1 */

  666.     BF( 5, 26, COS0_5 , 1);

  667.     BF(10, 21, COS0_10, 1);

  668.     /* pass 2 */

  669.     BF( 5, 10, COS1_5 , 2);

  670.     BF(21, 26,-COS1_5 , 2);

  671.     /* pass 3 */

  672.     BF( 2,  5, COS2_2 , 1);

  673.     BF(10, 13,-COS2_2 , 1);

  674.     BF(18, 21, COS2_2 , 1);

  675.     BF(26, 29,-COS2_2 , 1);

  676.     /* pass 4 */

  677.     BF( 1,  2, COS3_1 , 2);

  678.     BF( 5,  6,-COS3_1 , 2);

  679.     BF( 9, 10, COS3_1 , 2);

  680.     BF(13, 14,-COS3_1 , 2);

  681.     BF(17, 18, COS3_1 , 2);

  682.     BF(21, 22,-COS3_1 , 2);

  683.     BF(25, 26, COS3_1 , 2);

  684.     BF(29, 30,-COS3_1 , 2);

  685. 

  686.     /* pass 5 */

  687.     BF1( 0,  1,  2,  3);

  688.     BF2( 4,  5,  6,  7);

  689.     BF1( 8,  9, 10, 11);

  690.     BF2(12, 13, 14, 15);

  691.     BF1(16, 17, 18, 19);

  692.     BF2(20, 21, 22, 23);

  693.     BF1(24, 25, 26, 27);

  694.     BF2(28, 29, 30, 31);

  695. 

  696.     /* pass 6 */

  697. 

  698.     ADD( 8, 12);

  699.     ADD(12, 10);

  700.     ADD(10, 14);

  701.     ADD(14,  9);

  702.     ADD( 9, 13);

  703.     ADD(13, 11);

  704.     ADD(11, 15);

  705. 

  706.     out[ 0] = tab[0];

  707.     out[16] = tab[1];

  708.     out[ 8] = tab[2];

  709.     out[24] = tab[3];

  710.     out[ 4] = tab[4];

  711.     out[20] = tab[5];

  712.     out[12] = tab[6];

  713.     out[28] = tab[7];

  714.     out[ 2] = tab[8];

  715.     out[18] = tab[9];

  716.     out[10] = tab[10];

  717.     out[26] = tab[11];

  718.     out[ 6] = tab[12];

  719.     out[22] = tab[13];

  720.     out[14] = tab[14];

  721.     out[30] = tab[15];

  722. 

  723.     ADD(24, 28);

  724.     ADD(28, 26);

  725.     ADD(26, 30);

  726.     ADD(30, 25);

  727.     ADD(25, 29);

  728.     ADD(29, 27);

  729.     ADD(27, 31);

  730. 

  731.     out[ 1] = tab[16] + tab[24];

  732.     out[17] = tab[17] + tab[25];

  733.     out[ 9] = tab[18] + tab[26];

  734.     out[25] = tab[19] + tab[27];

  735.     out[ 5] = tab[20] + tab[28];

  736.     out[21] = tab[21] + tab[29];

  737.     out[13] = tab[22] + tab[30];

  738.     out[29] = tab[23] + tab[31];

  739.     out[ 3] = tab[24] + tab[20];

  740.     out[19] = tab[25] + tab[21];

  741.     out[11] = tab[26] + tab[22];

  742.     out[27] = tab[27] + tab[23];

  743.     out[ 7] = tab[28] + tab[18];

  744.     out[23] = tab[29] + tab[19];

  745.     out[15] = tab[30] + tab[17];

  746.     out[31] = tab[31];

  747. }

  748. 

  749. #if FRAC_BITS <= 15

  750. 

  751. static inline int round_sample(int *sum)

  752. {

  753.     int sum1;

  754.     sum1 = (*sum) >> OUT_SHIFT;

  755.     *sum &= (1<<OUT_SHIFT)-1;

  756.     if (sum1 < OUT_MIN)

  757.         sum1 = OUT_MIN;

  758.     else if (sum1 > OUT_MAX)

  759.         sum1 = OUT_MAX;

  760.     return sum1;

  761. }

  762. 

  763. /* signed 16x16 -> 32 multiply add accumulate */

  764. #define MACS(rt, ra, rb) MAC16(rt, ra, rb)

  765. 

  766. /* signed 16x16 -> 32 multiply */

  767. #define MULS(ra, rb) MUL16(ra, rb)

  768. 

  769. #define MLSS(rt, ra, rb) MLS16(rt, ra, rb)

  770. 

  771. #else

  772. 

  773. static inline int round_sample(int64_t *sum)

  774. {

  775.     int sum1;

  776.     sum1 = (int)((*sum) >> OUT_SHIFT);

  777.     *sum &= (1<<OUT_SHIFT)-1;

  778.     if (sum1 < OUT_MIN)

  779.         sum1 = OUT_MIN;

  780.     else if (sum1 > OUT_MAX)

  781.         sum1 = OUT_MAX;

  782.     return sum1;

  783. }

  784. 

  785. #   define MULS(ra, rb) MUL64(ra, rb)

  786. #   define MACS(rt, ra, rb) MAC64(rt, ra, rb)

  787. #   define MLSS(rt, ra, rb) MLS64(rt, ra, rb)

  788. #endif

  789. 

  790. #define SUM8(op, sum, w, p)               \

  791. {                                         \

  792.     op(sum, (w)[0 * 64], p[0 * 64]);      \

  793.     op(sum, (w)[1 * 64], p[1 * 64]);      \

  794.     op(sum, (w)[2 * 64], p[2 * 64]);      \

  795.     op(sum, (w)[3 * 64], p[3 * 64]);      \

  796.     op(sum, (w)[4 * 64], p[4 * 64]);      \

  797.     op(sum, (w)[5 * 64], p[5 * 64]);      \

  798.     op(sum, (w)[6 * 64], p[6 * 64]);      \

  799.     op(sum, (w)[7 * 64], p[7 * 64]);      \

  800. }

  801. 

  802. #define SUM8P2(sum1, op1, sum2, op2, w1, w2, p) \

  803. {                                               \

  804.     int tmp;\

  805.     tmp = p[0 * 64];\

  806.     op1(sum1, (w1)[0 * 64], tmp);\

  807.     op2(sum2, (w2)[0 * 64], tmp);\

  808.     tmp = p[1 * 64];\

  809.     op1(sum1, (w1)[1 * 64], tmp);\

  810.     op2(sum2, (w2)[1 * 64], tmp);\

  811.     tmp = p[2 * 64];\

  812.     op1(sum1, (w1)[2 * 64], tmp);\

  813.     op2(sum2, (w2)[2 * 64], tmp);\

  814.     tmp = p[3 * 64];\

  815.     op1(sum1, (w1)[3 * 64], tmp);\

  816.     op2(sum2, (w2)[3 * 64], tmp);\

  817.     tmp = p[4 * 64];\

  818.     op1(sum1, (w1)[4 * 64], tmp);\

  819.     op2(sum2, (w2)[4 * 64], tmp);\

  820.     tmp = p[5 * 64];\

  821.     op1(sum1, (w1)[5 * 64], tmp);\

  822.     op2(sum2, (w2)[5 * 64], tmp);\

  823.     tmp = p[6 * 64];\

  824.     op1(sum1, (w1)[6 * 64], tmp);\

  825.     op2(sum2, (w2)[6 * 64], tmp);\

  826.     tmp = p[7 * 64];\

  827.     op1(sum1, (w1)[7 * 64], tmp);\

  828.     op2(sum2, (w2)[7 * 64], tmp);\

  829. }

  830. 

  831. void ff_mpa_synth_init(MPA_INT *window)

  832. {

  833.     int i;

  834. 

  835.     /* max = 18760, max sum over all 16 coefs : 44736 */

  836.     for(i=0;i<257;i++) {

  837.         int v;

  838.         v = ff_mpa_enwindow[i];

  839. #if WFRAC_BITS < 16

  840.         v = (v + (1 << (16 - WFRAC_BITS - 1))) >> (16 - WFRAC_BITS);

  841. #endif

  842.         window[i] = v;

  843.         if ((i & 63) != 0)

  844.             v = -v;

  845.         if (i != 0)

  846.             window[512 - i] = v;

  847.     }

  848. }

  849. 

  850. /* 32 sub band synthesis filter. Input: 32 sub band samples, Output:

  851.    32 samples. */

  852. /* XXX: optimize by avoiding ring buffer usage */

  853. void ff_mpa_synth_filter(MPA_INT *synth_buf_ptr, int *synth_buf_offset,

  854.                          MPA_INT *window, int *dither_state,

  855.                          OUT_INT *samples, int incr,

  856.                          int32_t sb_samples[SBLIMIT])

  857. {

  858.     int32_t tmp[32];

  859.     register MPA_INT *synth_buf;

  860.     register const MPA_INT *w, *w2, *p;

  861.     int j, offset, v;

  862.     OUT_INT *samples2;

  863. #if FRAC_BITS <= 15

  864.     int sum, sum2;

  865. #else

  866.     int64_t sum, sum2;

  867. #endif

  868. 

  869.     dct32(tmp, sb_samples);

  870. 

  871.     offset = *synth_buf_offset;

  872.     synth_buf = synth_buf_ptr + offset;

  873. 

  874.     for(j=0;j<32;j++) {

  875.         v = tmp[j];

  876. #if FRAC_BITS <= 15

  877.         /* NOTE: can cause a loss in precision if very high amplitude

  878.            sound */

  879.         v = av_clip_int16(v);

  880. #endif

  881.         synth_buf[j] = v;

  882.     }

  883.     /* copy to avoid wrap */

  884.     memcpy(synth_buf + 512, synth_buf, 32 * sizeof(MPA_INT));

  885. 

  886.     samples2 = samples + 31 * incr;

  887.     w = window;

  888.     w2 = window + 31;

  889. 

  890.     sum = *dither_state;

  891.     p = synth_buf + 16;

  892.     SUM8(MACS, sum, w, p);

  893.     p = synth_buf + 48;

  894.     SUM8(MLSS, sum, w + 32, p);

  895.     *samples = round_sample(&sum);

  896.     samples += incr;

  897.     w++;

  898. 

  899.     /* we calculate two samples at the same time to avoid one memory

  900.        access per two sample */

  901.     for(j=1;j<16;j++) {

  902.         sum2 = 0;

  903.         p = synth_buf + 16 + j;

  904.         SUM8P2(sum, MACS, sum2, MLSS, w, w2, p);

  905.         p = synth_buf + 48 - j;

  906.         SUM8P2(sum, MLSS, sum2, MLSS, w + 32, w2 + 32, p);

  907. 

  908.         *samples = round_sample(&sum);

  909.         samples += incr;

  910.         sum += sum2;

  911.         *samples2 = round_sample(&sum);

  912.         samples2 -= incr;

  913.         w++;

  914.         w2--;

  915.     }

  916. 

  917.     p = synth_buf + 32;

  918.     SUM8(MLSS, sum, w + 32, p);

  919.     *samples = round_sample(&sum);

  920.     *dither_state= sum;

  921. 

  922.     offset = (offset - 32) & 511;

  923.     *synth_buf_offset = offset;

  924. }

  925. 

  926. #define C3 FIXHR(0.86602540378443864676/2)

  927. 

  928. /* 0.5 / cos(pi*(2*i+1)/36) */

  929. static const int icos36[9] = {

  930.     FIXR(0.50190991877167369479),

  931.     FIXR(0.51763809020504152469), //0

  932.     FIXR(0.55168895948124587824),

  933.     FIXR(0.61038729438072803416),

  934.     FIXR(0.70710678118654752439), //1

  935.     FIXR(0.87172339781054900991),

  936.     FIXR(1.18310079157624925896),

  937.     FIXR(1.93185165257813657349), //2

  938.     FIXR(5.73685662283492756461),

  939. };

  940. 

  941. /* 0.5 / cos(pi*(2*i+1)/36) */

  942. static const int icos36h[9] = {

  943.     FIXHR(0.50190991877167369479/2),

  944.     FIXHR(0.51763809020504152469/2), //0

  945.     FIXHR(0.55168895948124587824/2),

  946.     FIXHR(0.61038729438072803416/2),

  947.     FIXHR(0.70710678118654752439/2), //1

  948.     FIXHR(0.87172339781054900991/2),

  949.     FIXHR(1.18310079157624925896/4),

  950.     FIXHR(1.93185165257813657349/4), //2

  951. //    FIXHR(5.73685662283492756461),

  952. };

  953. 

  954. /* 12 points IMDCT. We compute it "by hand" by factorizing obvious

  955.    cases. */

  956. static void imdct12(int *out, int *in)

  957. {

  958.     int in0, in1, in2, in3, in4, in5, t1, t2;

  959. 

  960.     in0= in[0*3];

  961.     in1= in[1*3] + in[0*3];

  962.     in2= in[2*3] + in[1*3];

  963.     in3= in[3*3] + in[2*3];

  964.     in4= in[4*3] + in[3*3];

  965.     in5= in[5*3] + in[4*3];

  966.     in5 += in3;

  967.     in3 += in1;

  968. 

  969.     in2= MULH(2*in2, C3);

  970.     in3= MULH(4*in3, C3);

  971. 

  972.     t1 = in0 - in4;

  973.     t2 = MULH(2*(in1 - in5), icos36h[4]);

  974. 

  975.     out[ 7]=

  976.     out[10]= t1 + t2;

  977.     out[ 1]=

  978.     out[ 4]= t1 - t2;

  979. 

  980.     in0 += in4>>1;

  981.     in4 = in0 + in2;

  982.     in5 += 2*in1;

  983.     in1 = MULH(in5 + in3, icos36h[1]);

  984.     out[ 8]=

  985.     out[ 9]= in4 + in1;

  986.     out[ 2]=

  987.     out[ 3]= in4 - in1;

  988. 

  989.     in0 -= in2;

  990.     in5 = MULH(2*(in5 - in3), icos36h[7]);

  991.     out[ 0]=

  992.     out[ 5]= in0 - in5;

  993.     out[ 6]=

  994.     out[11]= in0 + in5;

  995. }

  996. 

  997. /* cos(pi*i/18) */

  998. #define C1 FIXHR(0.98480775301220805936/2)

  999. #define C2 FIXHR(0.93969262078590838405/2)

  1000. #define C3 FIXHR(0.86602540378443864676/2)

  1001. #define C4 FIXHR(0.76604444311897803520/2)

  1002. #define C5 FIXHR(0.64278760968653932632/2)

  1003. #define C6 FIXHR(0.5/2)

  1004. #define C7 FIXHR(0.34202014332566873304/2)

  1005. #define C8 FIXHR(0.17364817766693034885/2)

  1006. 

  1007. 

  1008. /* using Lee like decomposition followed by hand coded 9 points DCT */

  1009. static void imdct36(int *out, int *buf, int *in, int *win)

  1010. {

  1011.     int i, j, t0, t1, t2, t3, s0, s1, s2, s3;

  1012.     int tmp[18], *tmp1, *in1;

  1013. 

  1014.     for(i=17;i>=1;i--)

  1015.         in[i] += in[i-1];

  1016.     for(i=17;i>=3;i-=2)

  1017.         in[i] += in[i-2];

  1018. 

  1019.     for(j=0;j<2;j++) {

  1020.         tmp1 = tmp + j;

  1021.         in1 = in + j;

  1022. #if 0

  1023. //more accurate but slower

  1024.         int64_t t0, t1, t2, t3;

  1025.         t2 = in1[2*4] + in1[2*8] - in1[2*2];

  1026. 

  1027.         t3 = (in1[2*0] + (int64_t)(in1[2*6]>>1))<<32;

  1028.         t1 = in1[2*0] - in1[2*6];

  1029.         tmp1[ 6] = t1 - (t2>>1);

  1030.         tmp1[16] = t1 + t2;

  1031. 

  1032.         t0 = MUL64(2*(in1[2*2] + in1[2*4]),    C2);

  1033.         t1 = MUL64(   in1[2*4] - in1[2*8] , -2*C8);

  1034.         t2 = MUL64(2*(in1[2*2] + in1[2*8]),   -C4);

  1035. 

  1036.         tmp1[10] = (t3 - t0 - t2) >> 32;

  1037.         tmp1[ 2] = (t3 + t0 + t1) >> 32;

  1038.         tmp1[14] = (t3 + t2 - t1) >> 32;

  1039. 

  1040.         tmp1[ 4] = MULH(2*(in1[2*5] + in1[2*7] - in1[2*1]), -C3);

  1041.         t2 = MUL64(2*(in1[2*1] + in1[2*5]),    C1);

  1042.         t3 = MUL64(   in1[2*5] - in1[2*7] , -2*C7);

  1043.         t0 = MUL64(2*in1[2*3], C3);

  1044. 

  1045.         t1 = MUL64(2*(in1[2*1] + in1[2*7]),   -C5);

  1046. 

  1047.         tmp1[ 0] = (t2 + t3 + t0) >> 32;

  1048.         tmp1[12] = (t2 + t1 - t0) >> 32;

  1049.         tmp1[ 8] = (t3 - t1 - t0) >> 32;

  1050. #else

  1051.         t2 = in1[2*4] + in1[2*8] - in1[2*2];

  1052. 

  1053.         t3 = in1[2*0] + (in1[2*6]>>1);

  1054.         t1 = in1[2*0] - in1[2*6];

  1055.         tmp1[ 6] = t1 - (t2>>1);

  1056.         tmp1[16] = t1 + t2;

  1057. 

  1058.         t0 = MULH(2*(in1[2*2] + in1[2*4]),    C2);

  1059.         t1 = MULH(   in1[2*4] - in1[2*8] , -2*C8);

  1060.         t2 = MULH(2*(in1[2*2] + in1[2*8]),   -C4);

  1061. 

  1062.         tmp1[10] = t3 - t0 - t2;

  1063.         tmp1[ 2] = t3 + t0 + t1;

  1064.         tmp1[14] = t3 + t2 - t1;

  1065. 

  1066.         tmp1[ 4] = MULH(2*(in1[2*5] + in1[2*7] - in1[2*1]), -C3);

  1067.         t2 = MULH(2*(in1[2*1] + in1[2*5]),    C1);

  1068.         t3 = MULH(   in1[2*5] - in1[2*7] , -2*C7);

  1069.         t0 = MULH(2*in1[2*3], C3);

  1070. 

  1071.         t1 = MULH(2*(in1[2*1] + in1[2*7]),   -C5);

  1072. 

  1073.         tmp1[ 0] = t2 + t3 + t0;

  1074.         tmp1[12] = t2 + t1 - t0;

  1075.         tmp1[ 8] = t3 - t1 - t0;

  1076. #endif

  1077.     }

  1078. 

  1079.     i = 0;

  1080.     for(j=0;j<4;j++) {

  1081.         t0 = tmp[i];

  1082.         t1 = tmp[i + 2];

  1083.         s0 = t1 + t0;

  1084.         s2 = t1 - t0;

  1085. 

  1086.         t2 = tmp[i + 1];

  1087.         t3 = tmp[i + 3];

  1088.         s1 = MULH(2*(t3 + t2), icos36h[j]);

  1089.         s3 = MULL(t3 - t2, icos36[8 - j]);

  1090. 

  1091.         t0 = s0 + s1;

  1092.         t1 = s0 - s1;

  1093.         out[(9 + j)*SBLIMIT] =  MULH(t1, win[9 + j]) + buf[9 + j];

  1094.         out[(8 - j)*SBLIMIT] =  MULH(t1, win[8 - j]) + buf[8 - j];

  1095.         buf[9 + j] = MULH(t0, win[18 + 9 + j]);

  1096.         buf[8 - j] = MULH(t0, win[18 + 8 - j]);

  1097. 

  1098.         t0 = s2 + s3;

  1099.         t1 = s2 - s3;

  1100.         out[(9 + 8 - j)*SBLIMIT] =  MULH(t1, win[9 + 8 - j]) + buf[9 + 8 - j];

  1101.         out[(        j)*SBLIMIT] =  MULH(t1, win[        j]) + buf[        j];

  1102.         buf[9 + 8 - j] = MULH(t0, win[18 + 9 + 8 - j]);

  1103.         buf[      + j] = MULH(t0, win[18         + j]);

  1104.         i += 4;

  1105.     }

  1106. 

  1107.     s0 = tmp[16];

  1108.     s1 = MULH(2*tmp[17], icos36h[4]);

  1109.     t0 = s0 + s1;

  1110.     t1 = s0 - s1;

  1111.     out[(9 + 4)*SBLIMIT] =  MULH(t1, win[9 + 4]) + buf[9 + 4];

  1112.     out[(8 - 4)*SBLIMIT] =  MULH(t1, win[8 - 4]) + buf[8 - 4];

  1113.     buf[9 + 4] = MULH(t0, win[18 + 9 + 4]);

  1114.     buf[8 - 4] = MULH(t0, win[18 + 8 - 4]);

  1115. }

  1116. 

  1117. /* return the number of decoded frames */

  1118. static int mp_decode_layer1(MPADecodeContext *s)

  1119. {

  1120.     int bound, i, v, n, ch, j, mant;

  1121.     uint8_t allocation[MPA_MAX_CHANNELS][SBLIMIT];

  1122.     uint8_t scale_factors[MPA_MAX_CHANNELS][SBLIMIT];

  1123. 

  1124.     if (s->mode == MPA_JSTEREO)

  1125.         bound = (s->mode_ext + 1) * 4;

  1126.     else

  1127.         bound = SBLIMIT;

  1128. 

  1129.     /* allocation bits */

  1130.     for(i=0;i<bound;i++) {

  1131.         for(ch=0;ch<s->nb_channels;ch++) {

  1132.             allocation[ch][i] = get_bits(&s->gb, 4);

  1133.         }

  1134.     }

  1135.     for(i=bound;i<SBLIMIT;i++) {

  1136.         allocation[0][i] = get_bits(&s->gb, 4);

  1137.     }

  1138. 

  1139.     /* scale factors */

  1140.     for(i=0;i<bound;i++) {

  1141.         for(ch=0;ch<s->nb_channels;ch++) {

  1142.             if (allocation[ch][i])

  1143.                 scale_factors[ch][i] = get_bits(&s->gb, 6);

  1144.         }

  1145.     }

  1146.     for(i=bound;i<SBLIMIT;i++) {

  1147.         if (allocation[0][i]) {

  1148.             scale_factors[0][i] = get_bits(&s->gb, 6);

  1149.             scale_factors[1][i] = get_bits(&s->gb, 6);

  1150.         }

  1151.     }

  1152. 

  1153.     /* compute samples */

  1154.     for(j=0;j<12;j++) {

  1155.         for(i=0;i<bound;i++) {

  1156.             for(ch=0;ch<s->nb_channels;ch++) {

  1157.                 n = allocation[ch][i];

  1158.                 if (n) {

  1159.                     mant = get_bits(&s->gb, n + 1);

  1160.                     v = l1_unscale(n, mant, scale_factors[ch][i]);

  1161.                 } else {

  1162.                     v = 0;

  1163.                 }

  1164.                 s->sb_samples[ch][j][i] = v;

  1165.             }

  1166.         }

  1167.         for(i=bound;i<SBLIMIT;i++) {

  1168.             n = allocation[0][i];

  1169.             if (n) {

  1170.                 mant = get_bits(&s->gb, n + 1);

  1171.                 v = l1_unscale(n, mant, scale_factors[0][i]);

  1172.                 s->sb_samples[0][j][i] = v;

  1173.                 v = l1_unscale(n, mant, scale_factors[1][i]);

  1174.                 s->sb_samples[1][j][i] = v;

  1175.             } else {

  1176.                 s->sb_samples[0][j][i] = 0;

  1177.                 s->sb_samples[1][j][i] = 0;

  1178.             }

  1179.         }

  1180.     }

  1181.     return 12;

  1182. }

  1183. 

  1184. static int mp_decode_layer2(MPADecodeContext *s)

  1185. {

  1186.     int sblimit; /* number of used subbands */

  1187.     const unsigned char *alloc_table;

  1188.     int table, bit_alloc_bits, i, j, ch, bound, v;

  1189.     unsigned char bit_alloc[MPA_MAX_CHANNELS][SBLIMIT];

  1190.     unsigned char scale_code[MPA_MAX_CHANNELS][SBLIMIT];

  1191.     unsigned char scale_factors[MPA_MAX_CHANNELS][SBLIMIT][3], *sf;

  1192.     int scale, qindex, bits, steps, k, l, m, b;

  1193. 

  1194.     /* select decoding table */

  1195.     table = ff_mpa_l2_select_table(s->bit_rate / 1000, s->nb_channels,

  1196.                             s->sample_rate, s->lsf);

  1197.     sblimit = ff_mpa_sblimit_table[table];

  1198.     alloc_table = ff_mpa_alloc_tables[table];

  1199. 

  1200.     if (s->mode == MPA_JSTEREO)

  1201.         bound = (s->mode_ext + 1) * 4;

  1202.     else

  1203.         bound = sblimit;

  1204. 

  1205.     dprintf(s->avctx, "bound=%d sblimit=%d\n", bound, sblimit);

  1206. 

  1207.     /* sanity check */

  1208.     if( bound > sblimit ) bound = sblimit;

  1209. 

  1210.     /* parse bit allocation */

  1211.     j = 0;

  1212.     for(i=0;i<bound;i++) {

  1213.         bit_alloc_bits = alloc_table[j];

  1214.         for(ch=0;ch<s->nb_channels;ch++) {

  1215.             bit_alloc[ch][i] = get_bits(&s->gb, bit_alloc_bits);

  1216.         }

  1217.         j += 1 << bit_alloc_bits;

  1218.     }

  1219.     for(i=bound;i<sblimit;i++) {

  1220.         bit_alloc_bits = alloc_table[j];

  1221.         v = get_bits(&s->gb, bit_alloc_bits);

  1222.         bit_alloc[0][i] = v;

  1223.         bit_alloc[1][i] = v;

  1224.         j += 1 << bit_alloc_bits;

  1225.     }

  1226. 

  1227. #ifdef DEBUG

  1228.     {

  1229.         for(ch=0;ch<s->nb_channels;ch++) {

  1230.             for(i=0;i<sblimit;i++)

  1231.                 dprintf(s->avctx, " %d", bit_alloc[ch][i]);

  1232.             dprintf(s->avctx, "\n");

  1233.         }

  1234.     }

  1235. #endif

  1236. 

  1237.     /* scale codes */

  1238.     for(i=0;i<sblimit;i++) {

  1239.         for(ch=0;ch<s->nb_channels;ch++) {

  1240.             if (bit_alloc[ch][i])

  1241.                 scale_code[ch][i] = get_bits(&s->gb, 2);

  1242.         }

  1243.     }

  1244. 

  1245.     /* scale factors */

  1246.     for(i=0;i<sblimit;i++) {

  1247.         for(ch=0;ch<s->nb_channels;ch++) {

  1248.             if (bit_alloc[ch][i]) {

  1249.                 sf = scale_factors[ch][i];

  1250.                 switch(scale_code[ch][i]) {

  1251.                 default:

  1252.                 case 0:

  1253.                     sf[0] = get_bits(&s->gb, 6);

  1254.                     sf[1] = get_bits(&s->gb, 6);

  1255.                     sf[2] = get_bits(&s->gb, 6);

  1256.                     break;

  1257.                 case 2:

  1258.                     sf[0] = get_bits(&s->gb, 6);

  1259.                     sf[1] = sf[0];

  1260.                     sf[2] = sf[0];

  1261.                     break;

  1262.                 case 1:

  1263.                     sf[0] = get_bits(&s->gb, 6);

  1264.                     sf[2] = get_bits(&s->gb, 6);

  1265.                     sf[1] = sf[0];

  1266.                     break;

  1267.                 case 3:

  1268.                     sf[0] = get_bits(&s->gb, 6);

  1269.                     sf[2] = get_bits(&s->gb, 6);

  1270.                     sf[1] = sf[2];

  1271.                     break;

  1272.                 }

  1273.             }

  1274.         }

  1275.     }

  1276. 

  1277. #ifdef DEBUG

  1278.     for(ch=0;ch<s->nb_channels;ch++) {

  1279.         for(i=0;i<sblimit;i++) {

  1280.             if (bit_alloc[ch][i]) {

  1281.                 sf = scale_factors[ch][i];

  1282.                 dprintf(s->avctx, " %d %d %d", sf[0], sf[1], sf[2]);

  1283.             } else {

  1284.                 dprintf(s->avctx, " -");

  1285.             }

  1286.         }

  1287.         dprintf(s->avctx, "\n");

  1288.     }

  1289. #endif

  1290. 

  1291.     /* samples */

  1292.     for(k=0;k<3;k++) {

  1293.         for(l=0;l<12;l+=3) {

  1294.             j = 0;

  1295.             for(i=0;i<bound;i++) {

  1296.                 bit_alloc_bits = alloc_table[j];

  1297.                 for(ch=0;ch<s->nb_channels;ch++) {

  1298.                     b = bit_alloc[ch][i];

  1299.                     if (b) {

  1300.                         scale = scale_factors[ch][i][k];

  1301.                         qindex = alloc_table[j+b];

  1302.                         bits = ff_mpa_quant_bits[qindex];

  1303.                         if (bits < 0) {

  1304.                             /* 3 values at the same time */

  1305.                             v = get_bits(&s->gb, -bits);

  1306.                             steps = ff_mpa_quant_steps[qindex];

  1307.                             s->sb_samples[ch][k * 12 + l + 0][i] =

  1308.                                 l2_unscale_group(steps, v % steps, scale);

  1309.                             v = v / steps;

  1310.                             s->sb_samples[ch][k * 12 + l + 1][i] =

  1311.                                 l2_unscale_group(steps, v % steps, scale);

  1312.                             v = v / steps;

  1313.                             s->sb_samples[ch][k * 12 + l + 2][i] =

  1314.                                 l2_unscale_group(steps, v, scale);

  1315.                         } else {

  1316.                             for(m=0;m<3;m++) {

  1317.                                 v = get_bits(&s->gb, bits);

  1318.                                 v = l1_unscale(bits - 1, v, scale);

  1319.                                 s->sb_samples[ch][k * 12 + l + m][i] = v;

  1320.                             }

  1321.                         }

  1322.                     } else {

  1323.                         s->sb_samples[ch][k * 12 + l + 0][i] = 0;

  1324.                         s->sb_samples[ch][k * 12 + l + 1][i] = 0;

  1325.                         s->sb_samples[ch][k * 12 + l + 2][i] = 0;

  1326.                     }

  1327.                 }

  1328.                 /* next subband in alloc table */

  1329.                 j += 1 << bit_alloc_bits;

  1330.             }

  1331.             /* XXX: find a way to avoid this duplication of code */

  1332.             for(i=bound;i<sblimit;i++) {

  1333.                 bit_alloc_bits = alloc_table[j];

  1334.                 b = bit_alloc[0][i];

  1335.                 if (b) {

  1336.                     int mant, scale0, scale1;

  1337.                     scale0 = scale_factors[0][i][k];

  1338.                     scale1 = scale_factors[1][i][k];

  1339.                     qindex = alloc_table[j+b];

  1340.                     bits = ff_mpa_quant_bits[qindex];

  1341.                     if (bits < 0) {

  1342.                         /* 3 values at the same time */

  1343.                         v = get_bits(&s->gb, -bits);

  1344.                         steps = ff_mpa_quant_steps[qindex];

  1345.                         mant = v % steps;

  1346.                         v = v / steps;

  1347.                         s->sb_samples[0][k * 12 + l + 0][i] =

  1348.                             l2_unscale_group(steps, mant, scale0);

  1349.                         s->sb_samples[1][k * 12 + l + 0][i] =

  1350.                             l2_unscale_group(steps, mant, scale1);

  1351.                         mant = v % steps;

  1352.                         v = v / steps;

  1353.                         s->sb_samples[0][k * 12 + l + 1][i] =

  1354.                             l2_unscale_group(steps, mant, scale0);

  1355.                         s->sb_samples[1][k * 12 + l + 1][i] =

  1356.                             l2_unscale_group(steps, mant, scale1);

  1357.                         s->sb_samples[0][k * 12 + l + 2][i] =

  1358.                             l2_unscale_group(steps, v, scale0);

  1359.                         s->sb_samples[1][k * 12 + l + 2][i] =

  1360.                             l2_unscale_group(steps, v, scale1);

  1361.                     } else {

  1362.                         for(m=0;m<3;m++) {

  1363.                             mant = get_bits(&s->gb, bits);

  1364.                             s->sb_samples[0][k * 12 + l + m][i] =

  1365.                                 l1_unscale(bits - 1, mant, scale0);

  1366.                             s->sb_samples[1][k * 12 + l + m][i] =

  1367.                                 l1_unscale(bits - 1, mant, scale1);

  1368.                         }

  1369.                     }

  1370.                 } else {

  1371.                     s->sb_samples[0][k * 12 + l + 0][i] = 0;

  1372.                     s->sb_samples[0][k * 12 + l + 1][i] = 0;

  1373.                     s->sb_samples[0][k * 12 + l + 2][i] = 0;

  1374.                     s->sb_samples[1][k * 12 + l + 0][i] = 0;

  1375.                     s->sb_samples[1][k * 12 + l + 1][i] = 0;

  1376.                     s->sb_samples[1][k * 12 + l + 2][i] = 0;

  1377.                 }

  1378.                 /* next subband in alloc table */

  1379.                 j += 1 << bit_alloc_bits;

  1380.             }

  1381.             /* fill remaining samples to zero */

  1382.             for(i=sblimit;i<SBLIMIT;i++) {

  1383.                 for(ch=0;ch<s->nb_channels;ch++) {

  1384.                     s->sb_samples[ch][k * 12 + l + 0][i] = 0;

  1385.                     s->sb_samples[ch][k * 12 + l + 1][i] = 0;

  1386.                     s->sb_samples[ch][k * 12 + l + 2][i] = 0;

  1387.                 }

  1388.             }

  1389.         }

  1390.     }

  1391.     return 3 * 12;

  1392. }

  1393. 

  1394. static inline void lsf_sf_expand(int *slen,

  1395.                                  int sf, int n1, int n2, int n3)

  1396. {

  1397.     if (n3) {

  1398.         slen[3] = sf % n3;

  1399.         sf /= n3;

  1400.     } else {

  1401.         slen[3] = 0;

  1402.     }

  1403.     if (n2) {

  1404.         slen[2] = sf % n2;

  1405.         sf /= n2;

  1406.     } else {

  1407.         slen[2] = 0;

  1408.     }

  1409.     slen[1] = sf % n1;

  1410.     sf /= n1;

  1411.     slen[0] = sf;

  1412. }

  1413. 

  1414. static void exponents_from_scale_factors(MPADecodeContext *s,

  1415.                                          GranuleDef *g,

  1416.                                          int16_t *exponents)

  1417. {

  1418.     const uint8_t *bstab, *pretab;

  1419.     int len, i, j, k, l, v0, shift, gain, gains[3];

  1420.     int16_t *exp_ptr;

  1421. 

  1422.     exp_ptr = exponents;

  1423.     gain = g->global_gain - 210;

  1424.     shift = g->scalefac_scale + 1;

  1425. 

  1426.     bstab = band_size_long[s->sample_rate_index];

  1427.     pretab = mpa_pretab[g->preflag];

  1428.     for(i=0;i<g->long_end;i++) {

  1429.         v0 = gain - ((g->scale_factors[i] + pretab[i]) << shift) + 400;

  1430.         len = bstab[i];

  1431.         for(j=len;j>0;j--)

  1432.             *exp_ptr++ = v0;

  1433.     }

  1434. 

  1435.     if (g->short_start < 13) {

  1436.         bstab = band_size_short[s->sample_rate_index];

  1437.         gains[0] = gain - (g->subblock_gain[0] << 3);

  1438.         gains[1] = gain - (g->subblock_gain[1] << 3);

  1439.         gains[2] = gain - (g->subblock_gain[2] << 3);

  1440.         k = g->long_end;

  1441.         for(i=g->short_start;i<13;i++) {

  1442.             len = bstab[i];

  1443.             for(l=0;l<3;l++) {

  1444.                 v0 = gains[l] - (g->scale_factors[k++] << shift) + 400;

  1445.                 for(j=len;j>0;j--)

  1446.                 *exp_ptr++ = v0;

  1447.             }

  1448.         }

  1449.     }

  1450. }

  1451. 

  1452. /* handle n = 0 too */

  1453. static inline int get_bitsz(GetBitContext *s, int n)

  1454. {

  1455.     if (n == 0)

  1456.         return 0;

  1457.     else

  1458.         return get_bits(s, n);

  1459. }

  1460. 

  1461. 

  1462. static void switch_buffer(MPADecodeContext *s, int *pos, int *end_pos, int *end_pos2){

  1463.     if(s->in_gb.buffer && *pos >= s->gb.size_in_bits){

  1464.         s->gb= s->in_gb;

  1465.         s->in_gb.buffer=NULL;

  1466.         assert((get_bits_count(&s->gb) & 7) == 0);

  1467.         skip_bits_long(&s->gb, *pos - *end_pos);

  1468.         *end_pos2=

  1469.         *end_pos= *end_pos2 + get_bits_count(&s->gb) - *pos;

  1470.         *pos= get_bits_count(&s->gb);

  1471.     }

  1472. }

  1473. 

  1474. static int huffman_decode(MPADecodeContext *s, GranuleDef *g,

  1475.                           int16_t *exponents, int end_pos2)

  1476. {

  1477.     int s_index;

  1478.     int i;

  1479.     int last_pos, bits_left;

  1480.     VLC *vlc;

  1481.     int end_pos= FFMIN(end_pos2, s->gb.size_in_bits);

  1482. 

  1483.     /* low frequencies (called big values) */

  1484.     s_index = 0;

  1485.     for(i=0;i<3;i++) {

  1486.         int j, k, l, linbits;

  1487.         j = g->region_size[i];

  1488.         if (j == 0)

  1489.             continue;

  1490.         /* select vlc table */

  1491.         k = g->table_select[i];

  1492.         l = mpa_huff_data[k][0];

  1493.         linbits = mpa_huff_data[k][1];

  1494.         vlc = &huff_vlc[l];

  1495. 

  1496.         if(!l){

  1497.             memset(&g->sb_hybrid[s_index], 0, sizeof(*g->sb_hybrid)*2*j);

  1498.             s_index += 2*j;

  1499.             continue;

  1500.         }

  1501. 

  1502.         /* read huffcode and compute each couple */

  1503.         for(;j>0;j--) {

  1504.             int exponent, x, y, v;

  1505.             int pos= get_bits_count(&s->gb);

  1506. 

  1507.             if (pos >= end_pos){

  1508. //                av_log(NULL, AV_LOG_ERROR, "pos: %d %d %d %d\n", pos, end_pos, end_pos2, s_index);

  1509.                 switch_buffer(s, &pos, &end_pos, &end_pos2);

  1510. //                av_log(NULL, AV_LOG_ERROR, "new pos: %d %d\n", pos, end_pos);

  1511.                 if(pos >= end_pos)

  1512.                     break;

  1513.             }

  1514.             y = get_vlc2(&s->gb, vlc->table, 7, 3);

  1515. 

  1516.             if(!y){

  1517.                 g->sb_hybrid[s_index  ] =

  1518.                 g->sb_hybrid[s_index+1] = 0;

  1519.                 s_index += 2;

  1520.                 continue;

  1521.             }

  1522. 

  1523.             exponent= exponents[s_index];

  1524. 

  1525.             dprintf(s->avctx, "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. 

  1568.     /* high frequencies */

  1569.     vlc = &huff_quad_vlc[g->count1table_select];

  1570.     last_pos=0;

  1571.     while (s_index <= 572) {

  1572.         int pos, code;

  1573.         pos = get_bits_count(&s->gb);

  1574.         if (pos >= end_pos) {

  1575.             if (pos > end_pos2 && last_pos){

  1576.                 /* some encoders generate an incorrect size for this

  1577.                    part. We must go back into the data */

  1578.                 s_index -= 4;

  1579.                 skip_bits_long(&s->gb, last_pos - pos);

  1580.                 av_log(NULL, AV_LOG_INFO, "overread, skip %d enddists: %d %d\n", last_pos - pos, end_pos-pos, end_pos2-pos);

  1581.                 if(s->error_resilience >= FF_ER_COMPLIANT)

  1582.                     s_index=0;

  1583.                 break;

  1584.             }

  1585. //                av_log(NULL, AV_LOG_ERROR, "pos2: %d %d %d %d\n", pos, end_pos, end_pos2, s_index);

  1586.             switch_buffer(s, &pos, &end_pos, &end_pos2);

  1587. //                av_log(NULL, AV_LOG_ERROR, "new pos2: %d %d %d\n", pos, end_pos, s_index);

  1588.             if(pos >= end_pos)

  1589.                 break;

  1590.         }

  1591.         last_pos= pos;

  1592. 

  1593.         code = get_vlc2(&s->gb, vlc->table, vlc->bits, 1);

  1594.         dprintf(s->avctx, "t=%d code=%d\n", g->count1table_select, code);

  1595.         g->sb_hybrid[s_index+0]=

  1596.         g->sb_hybrid[s_index+1]=

  1597.         g->sb_hybrid[s_index+2]=

  1598.         g->sb_hybrid[s_index+3]= 0;

  1599.         while(code){

  1600.             static const int idxtab[16]={3,3,2,2,1,1,1,1,0,0,0,0,0,0,0,0};

  1601.             int v;

  1602.             int pos= s_index+idxtab[code];

  1603.             code ^= 8>>idxtab[code];

  1604.             v = exp_table[ exponents[pos] ];

  1605. //            v = exp_table[ (exponents[pos]&3) ] >> FFMIN(0 - (exponents[pos]>>2), 31);

  1606.             if(get_bits1(&s->gb))

  1607.                 v = -v;

  1608.             g->sb_hybrid[pos] = v;

  1609.         }

  1610.         s_index+=4;

  1611.     }

  1612.     /* skip extension bits */

  1613.     bits_left = end_pos2 - get_bits_count(&s->gb);

  1614. //av_log(NULL, AV_LOG_ERROR, "left:%d buf:%p\n", bits_left, s->in_gb.buffer);

  1615.     if (bits_left < 0/* || bits_left > 500*/) {

  1616.         av_log(NULL, AV_LOG_ERROR, "bits_left=%d\n", bits_left);

  1617.         s_index=0;

  1618.     }else if(bits_left > 0 && s->error_resilience >= FF_ER_AGGRESSIVE){

  1619.         av_log(NULL, AV_LOG_ERROR, "bits_left=%d\n", bits_left);

  1620.         s_index=0;

  1621.     }

  1622.     memset(&g->sb_hybrid[s_index], 0, sizeof(*g->sb_hybrid)*(576 - s_index));

  1623.     skip_bits_long(&s->gb, bits_left);

  1624. 

  1625.     i= get_bits_count(&s->gb);

  1626.     switch_buffer(s, &i, &end_pos, &end_pos2);

  1627. 

  1628.     return 0;

  1629. }

  1630. 

  1631. /* Reorder short blocks from bitstream order to interleaved order. It

  1632.    would be faster to do it in parsing, but the code would be far more

  1633.    complicated */

  1634. static void reorder_block(MPADecodeContext *s, GranuleDef *g)

  1635. {

  1636.     int i, j, len;

  1637.     int32_t *ptr, *dst, *ptr1;

  1638.     int32_t tmp[576];

  1639. 

  1640.     if (g->block_type != 2)

  1641.         return;

  1642. 

  1643.     if (g->switch_point) {

  1644.         if (s->sample_rate_index != 8) {

  1645.             ptr = g->sb_hybrid + 36;

  1646.         } else {

  1647.             ptr = g->sb_hybrid + 48;

  1648.         }

  1649.     } else {

  1650.         ptr = g->sb_hybrid;

  1651.     }

  1652. 

  1653.     for(i=g->short_start;i<13;i++) {

  1654.         len = band_size_short[s->sample_rate_index][i];

  1655.         ptr1 = ptr;

  1656.         dst = tmp;

  1657.         for(j=len;j>0;j--) {

  1658.             *dst++ = ptr[0*len];

  1659.             *dst++ = ptr[1*len];

  1660.             *dst++ = ptr[2*len];

  1661.             ptr++;

  1662.         }

  1663.         ptr+=2*len;

  1664.         memcpy(ptr1, tmp, len * 3 * sizeof(*ptr1));

  1665.     }

  1666. }

  1667. 

  1668. #define ISQRT2 FIXR(0.70710678118654752440)

  1669. 

  1670. static void compute_stereo(MPADecodeContext *s,

  1671.                            GranuleDef *g0, GranuleDef *g1)

  1672. {

  1673.     int i, j, k, l;

  1674.     int32_t v1, v2;

  1675.     int sf_max, tmp0, tmp1, sf, len, non_zero_found;

  1676.     int32_t (*is_tab)[16];

  1677.     int32_t *tab0, *tab1;

  1678.     int non_zero_found_short[3];

  1679. 

  1680.     /* intensity stereo */

  1681.     if (s->mode_ext & MODE_EXT_I_STEREO) {

  1682.         if (!s->lsf) {

  1683.             is_tab = is_table;

  1684.             sf_max = 7;

  1685.         } else {

  1686.             is_tab = is_table_lsf[g1->scalefac_compress & 1];

  1687.             sf_max = 16;

  1688.         }

  1689. 

  1690.         tab0 = g0->sb_hybrid + 576;

  1691.         tab1 = g1->sb_hybrid + 576;

  1692. 

  1693.         non_zero_found_short[0] = 0;

  1694.         non_zero_found_short[1] = 0;

  1695.         non_zero_found_short[2] = 0;

  1696.         k = (13 - g1->short_start) * 3 + g1->long_end - 3;

  1697.         for(i = 12;i >= g1->short_start;i--) {

  1698.             /* for last band, use previous scale factor */

  1699.             if (i != 11)

  1700.                 k -= 3;

  1701.             len = band_size_short[s->sample_rate_index][i];

  1702.             for(l=2;l>=0;l--) {

  1703.                 tab0 -= len;

  1704.                 tab1 -= len;

  1705.                 if (!non_zero_found_short[l]) {

  1706.                     /* test if non zero band. if so, stop doing i-stereo */

  1707.                     for(j=0;j<len;j++) {

  1708.                         if (tab1[j] != 0) {

  1709.                             non_zero_found_short[l] = 1;

  1710.                             goto found1;

  1711.                         }

  1712.                     }

  1713.                     sf = g1->scale_factors[k + l];

  1714.                     if (sf >= sf_max)

  1715.                         goto found1;

  1716. 

  1717.                     v1 = is_tab[0][sf];

  1718.                     v2 = is_tab[1][sf];

  1719.                     for(j=0;j<len;j++) {

  1720.                         tmp0 = tab0[j];

  1721.                         tab0[j] = MULL(tmp0, v1);

  1722.                         tab1[j] = MULL(tmp0, v2);

  1723.                     }

  1724.                 } else {

  1725.                 found1:

  1726.                     if (s->mode_ext & MODE_EXT_MS_STEREO) {

  1727.                         /* lower part of the spectrum : do ms stereo

  1728.                            if enabled */

  1729.                         for(j=0;j<len;j++) {

  1730.                             tmp0 = tab0[j];

  1731.                             tmp1 = tab1[j];

  1732.                             tab0[j] = MULL(tmp0 + tmp1, ISQRT2);

  1733.                             tab1[j] = MULL(tmp0 - tmp1, ISQRT2);

  1734.                         }

  1735.                     }

  1736.                 }

  1737.             }

  1738.         }

  1739. 

  1740.         non_zero_found = non_zero_found_short[0] |

  1741.             non_zero_found_short[1] |

  1742.             non_zero_found_short[2];

  1743. 

  1744.         for(i = g1->long_end - 1;i >= 0;i--) {

  1745.             len = band_size_long[s->sample_rate_index][i];

  1746.             tab0 -= len;

  1747.             tab1 -= len;

  1748.             /* test if non zero band. if so, stop doing i-stereo */

  1749.             if (!non_zero_found) {

  1750.                 for(j=0;j<len;j++) {

  1751.                     if (tab1[j] != 0) {

  1752.                         non_zero_found = 1;

  1753.                         goto found2;

  1754.                     }

  1755.                 }

  1756.                 /* for last band, use previous scale factor */

  1757.                 k = (i == 21) ? 20 : i;

  1758.                 sf = g1->scale_factors[k];

  1759.                 if (sf >= sf_max)

  1760.                     goto found2;

  1761.                 v1 = is_tab[0][sf];

  1762.                 v2 = is_tab[1][sf];

  1763.                 for(j=0;j<len;j++) {

  1764.                     tmp0 = tab0[j];

  1765.                     tab0[j] = MULL(tmp0, v1);

  1766.                     tab1[j] = MULL(tmp0, v2);

  1767.                 }

  1768.             } else {

  1769.             found2:

  1770.                 if (s->mode_ext & MODE_EXT_MS_STEREO) {

  1771.                     /* lower part of the spectrum : do ms stereo

  1772.                        if enabled */

  1773.                     for(j=0;j<len;j++) {

  1774.                         tmp0 = tab0[j];

  1775.                         tmp1 = tab1[j];

  1776.                         tab0[j] = MULL(tmp0 + tmp1, ISQRT2);

  1777.                         tab1[j] = MULL(tmp0 - tmp1, ISQRT2);

  1778.                     }

  1779.                 }

  1780.             }

  1781.         }

  1782.     } else if (s->mode_ext & MODE_EXT_MS_STEREO) {

  1783.         /* ms stereo ONLY */

  1784.         /* NOTE: the 1/sqrt(2) normalization factor is included in the

  1785.            global gain */

  1786.         tab0 = g0->sb_hybrid;

  1787.         tab1 = g1->sb_hybrid;

  1788.         for(i=0;i<576;i++) {

  1789.             tmp0 = tab0[i];

  1790.             tmp1 = tab1[i];

  1791.             tab0[i] = tmp0 + tmp1;

  1792.             tab1[i] = tmp0 - tmp1;

  1793.         }

  1794.     }

  1795. }

  1796. 

  1797. static void compute_antialias_integer(MPADecodeContext *s,

  1798.                               GranuleDef *g)

  1799. {

  1800.     int32_t *ptr, *csa;

  1801.     int n, i;

  1802. 

  1803.     /* we antialias only "long" bands */

  1804.     if (g->block_type == 2) {

  1805.         if (!g->switch_point)

  1806.             return;

  1807.         /* XXX: check this for 8000Hz case */

  1808.         n = 1;

  1809.     } else {

  1810.         n = SBLIMIT - 1;

  1811.     }

  1812. 

  1813.     ptr = g->sb_hybrid + 18;

  1814.     for(i = n;i > 0;i--) {

  1815.         int tmp0, tmp1, tmp2;

  1816.         csa = &csa_table[0][0];

  1817. #define INT_AA(j) \

  1818.             tmp0 = ptr[-1-j];\

  1819.             tmp1 = ptr[   j];\

  1820.             tmp2= MULH(tmp0 + tmp1, csa[0+4*j]);\

  1821.             ptr[-1-j] = 4*(tmp2 - MULH(tmp1, csa[2+4*j]));\

  1822.             ptr[   j] = 4*(tmp2 + MULH(tmp0, csa[3+4*j]));

  1823. 

  1824.         INT_AA(0)

  1825.         INT_AA(1)

  1826.         INT_AA(2)

  1827.         INT_AA(3)

  1828.         INT_AA(4)

  1829.         INT_AA(5)

  1830.         INT_AA(6)

  1831.         INT_AA(7)

  1832. 

  1833.         ptr += 18;

  1834.     }

  1835. }

  1836. 

  1837. static void compute_antialias_float(MPADecodeContext *s,

  1838.                               GranuleDef *g)

  1839. {

  1840.     int32_t *ptr;

  1841.     int n, i;

  1842. 

  1843.     /* we antialias only "long" bands */

  1844.     if (g->block_type == 2) {

  1845.         if (!g->switch_point)

  1846.             return;

  1847.         /* XXX: check this for 8000Hz case */

  1848.         n = 1;

  1849.     } else {

  1850.         n = SBLIMIT - 1;

  1851.     }

  1852. 

  1853.     ptr = g->sb_hybrid + 18;

  1854.     for(i = n;i > 0;i--) {

  1855.         float tmp0, tmp1;

  1856.         float *csa = &csa_table_float[0][0];

  1857. #define FLOAT_AA(j)\

  1858.         tmp0= ptr[-1-j];\

  1859.         tmp1= ptr[   j];\

  1860.         ptr[-1-j] = lrintf(tmp0 * csa[0+4*j] - tmp1 * csa[1+4*j]);\

  1861.         ptr[   j] = lrintf(tmp0 * csa[1+4*j] + tmp1 * csa[0+4*j]);

  1862. 

  1863.         FLOAT_AA(0)

  1864.         FLOAT_AA(1)

  1865.         FLOAT_AA(2)

  1866.         FLOAT_AA(3)

  1867.         FLOAT_AA(4)

  1868.         FLOAT_AA(5)

  1869.         FLOAT_AA(6)

  1870.         FLOAT_AA(7)

  1871. 

  1872.         ptr += 18;

  1873.     }

  1874. }

  1875. 

  1876. static void compute_imdct(MPADecodeContext *s,

  1877.                           GranuleDef *g,

  1878.                           int32_t *sb_samples,

  1879.                           int32_t *mdct_buf)

  1880. {

  1881.     int32_t *ptr, *win, *win1, *buf, *out_ptr, *ptr1;

  1882.     int32_t out2[12];

  1883.     int i, j, mdct_long_end, v, sblimit;

  1884. 

  1885.     /* find last non zero block */

  1886.     ptr = g->sb_hybrid + 576;

  1887.     ptr1 = g->sb_hybrid + 2 * 18;

  1888.     while (ptr >= ptr1) {

  1889.         ptr -= 6;

  1890.         v = ptr[0] | ptr[1] | ptr[2] | ptr[3] | ptr[4] | ptr[5];

  1891.         if (v != 0)

  1892.             break;

  1893.     }

  1894.     sblimit = ((ptr - g->sb_hybrid) / 18) + 1;

  1895. 

  1896.     if (g->block_type == 2) {

  1897.         /* XXX: check for 8000 Hz */

  1898.         if (g->switch_point)

  1899.             mdct_long_end = 2;

  1900.         else

  1901.             mdct_long_end = 0;

  1902.     } else {

  1903.         mdct_long_end = sblimit;

  1904.     }

  1905. 

  1906.     buf = mdct_buf;

  1907.     ptr = g->sb_hybrid;

  1908.     for(j=0;j<mdct_long_end;j++) {

  1909.         /* apply window & overlap with previous buffer */

  1910.         out_ptr = sb_samples + j;

  1911.         /* select window */

  1912.         if (g->switch_point && j < 2)

  1913.             win1 = mdct_win[0];

  1914.         else

  1915.             win1 = mdct_win[g->block_type];

  1916.         /* select frequency inversion */

  1917.         win = win1 + ((4 * 36) & -(j & 1));

  1918.         imdct36(out_ptr, buf, ptr, win);

  1919.         out_ptr += 18*SBLIMIT;

  1920.         ptr += 18;

  1921.         buf += 18;

  1922.     }

  1923.     for(j=mdct_long_end;j<sblimit;j++) {

  1924.         /* select frequency inversion */

  1925.         win = mdct_win[2] + ((4 * 36) & -(j & 1));

  1926.         out_ptr = sb_samples + j;

  1927. 

  1928.         for(i=0; i<6; i++){

  1929.             *out_ptr = buf[i];

  1930.             out_ptr += SBLIMIT;

  1931.         }

  1932.         imdct12(out2, ptr + 0);

  1933.         for(i=0;i<6;i++) {

  1934.             *out_ptr = MULH(out2[i], win[i]) + buf[i + 6*1];

  1935.             buf[i + 6*2] = MULH(out2[i + 6], win[i + 6]);

  1936.             out_ptr += SBLIMIT;

  1937.         }

  1938.         imdct12(out2, ptr + 1);

  1939.         for(i=0;i<6;i++) {

  1940.             *out_ptr = MULH(out2[i], win[i]) + buf[i + 6*2];

  1941.             buf[i + 6*0] = MULH(out2[i + 6], win[i + 6]);

  1942.             out_ptr += SBLIMIT;

  1943.         }

  1944.         imdct12(out2, ptr + 2);

  1945.         for(i=0;i<6;i++) {

  1946.             buf[i + 6*0] = MULH(out2[i], win[i]) + buf[i + 6*0];

  1947.             buf[i + 6*1] = MULH(out2[i + 6], win[i + 6]);

  1948.             buf[i + 6*2] = 0;

  1949.         }

  1950.         ptr += 18;

  1951.         buf += 18;

  1952.     }

  1953.     /* zero bands */

  1954.     for(j=sblimit;j<SBLIMIT;j++) {

  1955.         /* overlap */

  1956.         out_ptr = sb_samples + j;

  1957.         for(i=0;i<18;i++) {

  1958.             *out_ptr = buf[i];

  1959.             buf[i] = 0;

  1960.             out_ptr += SBLIMIT;

  1961.         }

  1962.         buf += 18;

  1963.     }

  1964. }

  1965. 

  1966. #if defined(DEBUG)

  1967. void sample_dump(int fnum, int32_t *tab, int n)

  1968. {

  1969.     static FILE *files[16], *f;

  1970.     char buf[512];

  1971.     int i;

  1972.     int32_t v;

  1973. 

  1974.     f = files[fnum];

  1975.     if (!f) {

  1976.         snprintf(buf, sizeof(buf), "/tmp/out%d.%s.pcm",

  1977.                 fnum,

  1978. #ifdef USE_HIGHPRECISION

  1979.                 "hp"

  1980. #else

  1981.                 "lp"

  1982. #endif

  1983.                 );

  1984.         f = fopen(buf, "w");

  1985.         if (!f)

  1986.             return;

  1987.         files[fnum] = f;

  1988.     }

  1989. 

  1990.     if (fnum == 0) {

  1991.         static int pos = 0;

  1992.         av_log(NULL, AV_LOG_DEBUG, "pos=%d\n", pos);

  1993.         for(i=0;i<n;i++) {

  1994.             av_log(NULL, AV_LOG_DEBUG, " %0.4f", (double)tab[i] / FRAC_ONE);

  1995.             if ((i % 18) == 17)

  1996.                 av_log(NULL, AV_LOG_DEBUG, "\n");

  1997.         }

  1998.         pos += n;

  1999.     }

  2000.     for(i=0;i<n;i++) {

  2001.         /* normalize to 23 frac bits */

  2002.         v = tab[i] << (23 - FRAC_BITS);

  2003.         fwrite(&v, 1, sizeof(int32_t), f);

  2004.     }

  2005. }

  2006. #endif

  2007. 

  2008. 

  2009. /* main layer3 decoding function */

  2010. static int mp_decode_layer3(MPADecodeContext *s)

  2011. {

  2012.     int nb_granules, main_data_begin, private_bits;

  2013.     int gr, ch, blocksplit_flag, i, j, k, n, bits_pos;

  2014.     GranuleDef granules[2][2], *g;

  2015.     int16_t exponents[576];

  2016. 

  2017.     /* read side info */

  2018.     if (s->lsf) {

  2019.         main_data_begin = get_bits(&s->gb, 8);

  2020.         private_bits = get_bits(&s->gb, s->nb_channels);

  2021.         nb_granules = 1;

  2022.     } else {

  2023.         main_data_begin = get_bits(&s->gb, 9);

  2024.         if (s->nb_channels == 2)

  2025.             private_bits = get_bits(&s->gb, 3);

  2026.         else

  2027.             private_bits = get_bits(&s->gb, 5);

  2028.         nb_granules = 2;

  2029.         for(ch=0;ch<s->nb_channels;ch++) {

  2030.             granules[ch][0].scfsi = 0; /* all scale factors are transmitted */

  2031.             granules[ch][1].scfsi = get_bits(&s->gb, 4);

  2032.         }

  2033.     }

  2034. 

  2035.     for(gr=0;gr<nb_granules;gr++) {

  2036.         for(ch=0;ch<s->nb_channels;ch++) {

  2037.             dprintf(s->avctx, "gr=%d ch=%d: side_info\n", gr, ch);

  2038.             g = &granules[ch][gr];

  2039.             g->part2_3_length = get_bits(&s->gb, 12);

  2040.             g->big_values = get_bits(&s->gb, 9);

  2041.             if(g->big_values > 288){

  2042.                 av_log(s->avctx, AV_LOG_ERROR, "big_values too big\n");

  2043.                 return -1;

  2044.             }

  2045. 

  2046.             g->global_gain = get_bits(&s->gb, 8);

  2047.             /* if MS stereo only is selected, we precompute the

  2048.                1/sqrt(2) renormalization factor */

  2049.             if ((s->mode_ext & (MODE_EXT_MS_STEREO | MODE_EXT_I_STEREO)) ==

  2050.                 MODE_EXT_MS_STEREO)

  2051.                 g->global_gain -= 2;

  2052.             if (s->lsf)

  2053.                 g->scalefac_compress = get_bits(&s->gb, 9);

  2054.             else

  2055.                 g->scalefac_compress = get_bits(&s->gb, 4);

  2056.             blocksplit_flag = get_bits1(&s->gb);

  2057.             if (blocksplit_flag) {

  2058.                 g->block_type = get_bits(&s->gb, 2);

  2059.                 if (g->block_type == 0){

  2060.                     av_log(NULL, AV_LOG_ERROR, "invalid block type\n");

  2061.                     return -1;

  2062.                 }

  2063.                 g->switch_point = get_bits1(&s->gb);

  2064.                 for(i=0;i<2;i++)

  2065.                     g->table_select[i] = get_bits(&s->gb, 5);

  2066.                 for(i=0;i<3;i++)

  2067.                     g->subblock_gain[i] = get_bits(&s->gb, 3);

  2068.                 ff_init_short_region(s, g);

  2069.             } else {

  2070.                 int region_address1, region_address2;

  2071.                 g->block_type = 0;

  2072.                 g->switch_point = 0;

  2073.                 for(i=0;i<3;i++)

  2074.                     g->table_select[i] = get_bits(&s->gb, 5);

  2075.                 /* compute huffman coded region sizes */

  2076.                 region_address1 = get_bits(&s->gb, 4);

  2077.                 region_address2 = get_bits(&s->gb, 3);

  2078.                 dprintf(s->avctx, "region1=%d region2=%d\n",

  2079.                         region_address1, region_address2);

  2080.                 ff_init_long_region(s, g, region_address1, region_address2);

  2081.             }

  2082.             ff_region_offset2size(g);

  2083.             ff_compute_band_indexes(s, g);

  2084. 

  2085.             g->preflag = 0;

  2086.             if (!s->lsf)

  2087.                 g->preflag = get_bits1(&s->gb);

  2088.             g->scalefac_scale = get_bits1(&s->gb);

  2089.             g->count1table_select = get_bits1(&s->gb);

  2090.             dprintf(s->avctx, "block_type=%d switch_point=%d\n",

  2091.                     g->block_type, g->switch_point);

  2092.         }

  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(s->avctx, "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. 

  2102.     memcpy(s->last_buf + s->last_buf_size, ptr, EXTRABYTES);

  2103.     s->in_gb= s->gb;

  2104.         init_get_bits(&s->gb, s->last_buf, s->last_buf_size*8);

  2105.         skip_bits_long(&s->gb, 8*(s->last_buf_size - main_data_begin));

  2106.   }

  2107. 

  2108.     for(gr=0;gr<nb_granules;gr++) {

  2109.         for(ch=0;ch<s->nb_channels;ch++) {

  2110.             g = &granules[ch][gr];

  2111.             if(get_bits_count(&s->gb)<0){

  2112.                 av_log(NULL, AV_LOG_ERROR, "mdb:%d, lastbuf:%d skipping granule %d\n",

  2113.                                             main_data_begin, s->last_buf_size, gr);

  2114.                 skip_bits_long(&s->gb, g->part2_3_length);

  2115.                 memset(g->sb_hybrid, 0, sizeof(g->sb_hybrid));

  2116.                 if(get_bits_count(&s->gb) >= s->gb.size_in_bits && s->in_gb.buffer){

  2117.                     skip_bits_long(&s->in_gb, get_bits_count(&s->gb) - s->gb.size_in_bits);

  2118.                     s->gb= s->in_gb;

  2119.                     s->in_gb.buffer=NULL;

  2120.                 }

  2121.                 continue;

  2122.             }

  2123. 

  2124.             bits_pos = get_bits_count(&s->gb);

  2125. 

  2126.             if (!s->lsf) {

  2127.                 uint8_t *sc;

  2128.                 int slen, slen1, slen2;

  2129. 

  2130.                 /* MPEG1 scale factors */

  2131.                 slen1 = slen_table[0][g->scalefac_compress];

  2132.                 slen2 = slen_table[1][g->scalefac_compress];

  2133.                 dprintf(s->avctx, "slen1=%d slen2=%d\n", slen1, slen2);

  2134.                 if (g->block_type == 2) {

  2135.                     n = g->switch_point ? 17 : 18;

  2136.                     j = 0;

  2137.                     if(slen1){

  2138.                         for(i=0;i<n;i++)

  2139.                             g->scale_factors[j++] = get_bits(&s->gb, slen1);

  2140.                     }else{

  2141.                         for(i=0;i<n;i++)

  2142.                             g->scale_factors[j++] = 0;

  2143.                     }

  2144.                     if(slen2){

  2145.                         for(i=0;i<18;i++)

  2146.                             g->scale_factors[j++] = get_bits(&s->gb, slen2);

  2147.                         for(i=0;i<3;i++)

  2148.                             g->scale_factors[j++] = 0;

  2149.                     }else{

  2150.                         for(i=0;i<21;i++)

  2151.                             g->scale_factors[j++] = 0;

  2152.                     }

  2153.                 } else {

  2154.                     sc = granules[ch][0].scale_factors;

  2155.                     j = 0;

  2156.                     for(k=0;k<4;k++) {

  2157.                         n = (k == 0 ? 6 : 5);

  2158.                         if ((g->scfsi & (0x8 >> k)) == 0) {

  2159.                             slen = (k < 2) ? slen1 : slen2;

  2160.                             if(slen){

  2161.                                 for(i=0;i<n;i++)

  2162.                                     g->scale_factors[j++] = get_bits(&s->gb, slen);

  2163.                             }else{

  2164.                                 for(i=0;i<n;i++)

  2165.                                     g->scale_factors[j++] = 0;

  2166.                             }

  2167.                         } else {

  2168.                             /* simply copy from last granule */

  2169.                             for(i=0;i<n;i++) {

  2170.                                 g->scale_factors[j] = sc[j];

  2171.                                 j++;

  2172.                             }

  2173.                         }

  2174.                     }

  2175.                     g->scale_factors[j++] = 0;

  2176.                 }

  2177. #if defined(DEBUG)

  2178.                 {

  2179.                     dprintf(s->avctx, "scfsi=%x gr=%d ch=%d scale_factors:\n",

  2180.                            g->scfsi, gr, ch);

  2181.                     for(i=0;i<j;i++)

  2182.                         dprintf(s->avctx, " %d", g->scale_factors[i]);

  2183.                     dprintf(s->avctx, "\n");

  2184.                 }

  2185. #endif

  2186.             } else {

  2187.                 int tindex, tindex2, slen[4], sl, sf;

  2188. 

  2189.                 /* LSF scale factors */

  2190.                 if (g->block_type == 2) {

  2191.                     tindex = g->switch_point ? 2 : 1;

  2192.                 } else {

  2193.                     tindex = 0;

  2194.                 }

  2195.                 sf = g->scalefac_compress;

  2196.                 if ((s->mode_ext & MODE_EXT_I_STEREO) && ch == 1) {

  2197.                     /* intensity stereo case */

  2198.                     sf >>= 1;

  2199.                     if (sf < 180) {

  2200.                         lsf_sf_expand(slen, sf, 6, 6, 0);

  2201.                         tindex2 = 3;

  2202.                     } else if (sf < 244) {

  2203.                         lsf_sf_expand(slen, sf - 180, 4, 4, 0);

  2204.                         tindex2 = 4;

  2205.                     } else {

  2206.                         lsf_sf_expand(slen, sf - 244, 3, 0, 0);

  2207.                         tindex2 = 5;

  2208.                     }

  2209.                 } else {

  2210.                     /* normal case */

  2211.                     if (sf < 400) {

  2212.                         lsf_sf_expand(slen, sf, 5, 4, 4);

  2213.                         tindex2 = 0;

  2214.                     } else if (sf < 500) {

  2215.                         lsf_sf_expand(slen, sf - 400, 5, 4, 0);

  2216.                         tindex2 = 1;

  2217.                     } else {

  2218.                         lsf_sf_expand(slen, sf - 500, 3, 0, 0);

  2219.                         tindex2 = 2;

  2220.                         g->preflag = 1;

  2221.                     }

  2222.                 }

  2223. 

  2224.                 j = 0;

  2225.                 for(k=0;k<4;k++) {

  2226.                     n = lsf_nsf_table[tindex2][tindex][k];

  2227.                     sl = slen[k];

  2228.                     if(sl){

  2229.                         for(i=0;i<n;i++)

  2230.                             g->scale_factors[j++] = get_bits(&s->gb, sl);

  2231.                     }else{

  2232.                         for(i=0;i<n;i++)

  2233.                             g->scale_factors[j++] = 0;

  2234.                     }

  2235.                 }

  2236.                 /* XXX: should compute exact size */

  2237.                 for(;j<40;j++)

  2238.                     g->scale_factors[j] = 0;

  2239. #if defined(DEBUG)

  2240.                 {

  2241.                     dprintf(s->avctx, "gr=%d ch=%d scale_factors:\n",

  2242.                            gr, ch);

  2243.                     for(i=0;i<40;i++)

  2244.                         dprintf(s->avctx, " %d", g->scale_factors[i]);

  2245.                     dprintf(s->avctx, "\n");

  2246.                 }

  2247. #endif

  2248.             }

  2249. 

  2250.             exponents_from_scale_factors(s, g, exponents);

  2251. 

  2252.             /* read Huffman coded residue */

  2253.             huffman_decode(s, g, exponents, bits_pos + g->part2_3_length);

  2254. #if defined(DEBUG)

  2255.             sample_dump(0, g->sb_hybrid, 576);

  2256. #endif

  2257.         } /* ch */

  2258. 

  2259.         if (s->nb_channels == 2)

  2260.             compute_stereo(s, &granules[0][gr], &granules[1][gr]);

  2261. 

  2262.         for(ch=0;ch<s->nb_channels;ch++) {

  2263.             g = &granules[ch][gr];

  2264. 

  2265.             reorder_block(s, g);

  2266. #if defined(DEBUG)

  2267.             sample_dump(0, g->sb_hybrid, 576);

  2268. #endif

  2269.             s->compute_antialias(s, g);

  2270. #if defined(DEBUG)

  2271.             sample_dump(1, g->sb_hybrid, 576);

  2272. #endif

  2273.             compute_imdct(s, g, &s->sb_samples[ch][18 * gr][0], s->mdct_buf[ch]);

  2274. #if defined(DEBUG)

  2275.             sample_dump(2, &s->sb_samples[ch][18 * gr][0], 576);

  2276. #endif

  2277.         }

  2278.     } /* gr */

  2279.     if(get_bits_count(&s->gb)<0)

  2280.         skip_bits_long(&s->gb, -get_bits_count(&s->gb));

  2281.     return nb_granules * 18;

  2282. }

  2283. 

  2284. static int mp_decode_frame(MPADecodeContext *s,

  2285.                            OUT_INT *samples, const uint8_t *buf, int buf_size)

  2286. {

  2287.     int i, nb_frames, ch;

  2288.     OUT_INT *samples_ptr;

  2289. 

  2290.     init_get_bits(&s->gb, buf + HEADER_SIZE, (buf_size - HEADER_SIZE)*8);

  2291. 

  2292.     /* skip error protection field */

  2293.     if (s->error_protection)

  2294.         skip_bits(&s->gb, 16);

  2295. 

  2296.     dprintf(s->avctx, "frame %d:\n", s->frame_count);

  2297.     switch(s->layer) {

  2298.     case 1:

  2299.         s->avctx->frame_size = 384;

  2300.         nb_frames = mp_decode_layer1(s);

  2301.         break;

  2302.     case 2:

  2303.         s->avctx->frame_size = 1152;

  2304.         nb_frames = mp_decode_layer2(s);

  2305.         break;

  2306.     case 3:

  2307.         s->avctx->frame_size = s->lsf ? 576 : 1152;

  2308.     default:

  2309.         nb_frames = mp_decode_layer3(s);

  2310. 

  2311.         s->last_buf_size=0;

  2312.         if(s->in_gb.buffer){

  2313.             align_get_bits(&s->gb);

  2314.             i= (s->gb.size_in_bits - get_bits_count(&s->gb))>>3;

  2315.             if(i >= 0 && i <= BACKSTEP_SIZE){

  2316.                 memmove(s->last_buf, s->gb.buffer + (get_bits_count(&s->gb)>>3), i);

  2317.                 s->last_buf_size=i;

  2318.             }else

  2319.                 av_log(NULL, AV_LOG_ERROR, "invalid old backstep %d\n", i);

  2320.             s->gb= s->in_gb;

  2321.             s->in_gb.buffer= NULL;

  2322.         }

  2323. 

  2324.         align_get_bits(&s->gb);

  2325.         assert((get_bits_count(&s->gb) & 7) == 0);

  2326.         i= (s->gb.size_in_bits - get_bits_count(&s->gb))>>3;

  2327. 

  2328.         if(i<0 || i > BACKSTEP_SIZE || nb_frames<0){

  2329.             av_log(NULL, AV_LOG_ERROR, "invalid new backstep %d\n", i);

  2330.             i= FFMIN(BACKSTEP_SIZE, buf_size - HEADER_SIZE);

  2331.         }

  2332.         assert(i <= buf_size - HEADER_SIZE && i>= 0);

  2333.         memcpy(s->last_buf + s->last_buf_size, s->gb.buffer + buf_size - HEADER_SIZE - i, i);

  2334.         s->last_buf_size += i;

  2335. 

  2336.         break;

  2337.     }

  2338. #if defined(DEBUG)

  2339.     for(i=0;i<nb_frames;i++) {

  2340.         for(ch=0;ch<s->nb_channels;ch++) {

  2341.             int j;

  2342.             dprintf(s->avctx, "%d-%d:", i, ch);

  2343.             for(j=0;j<SBLIMIT;j++)

  2344.                 dprintf(s->avctx, " %0.6f", (double)s->sb_samples[ch][i][j] / FRAC_ONE);

  2345.             dprintf(s->avctx, "\n");

  2346.         }

  2347.     }

  2348. #endif

  2349.     /* apply the synthesis filter */

  2350.     for(ch=0;ch<s->nb_channels;ch++) {

  2351.         samples_ptr = samples + ch;

  2352.         for(i=0;i<nb_frames;i++) {

  2353.             ff_mpa_synth_filter(s->synth_buf[ch], &(s->synth_buf_offset[ch]),

  2354.                          window, &s->dither_state,

  2355.                          samples_ptr, s->nb_channels,

  2356.                          s->sb_samples[ch][i]);

  2357.             samples_ptr += 32 * s->nb_channels;

  2358.         }

  2359.     }

  2360. #ifdef DEBUG

  2361.     s->frame_count++;

  2362. #endif

  2363.     return nb_frames * 32 * sizeof(OUT_INT) * s->nb_channels;

  2364. }

  2365. 

  2366. static int decode_frame(AVCodecContext * avctx,

  2367.                         void *data, int *data_size,

  2368.                         const uint8_t * buf, int buf_size)

  2369. {

  2370.     MPADecodeContext *s = avctx->priv_data;

  2371.     uint32_t header;

  2372.     int out_size;

  2373.     OUT_INT *out_samples = data;

  2374. 

  2375. retry:

  2376.     if(buf_size < HEADER_SIZE)

  2377.         return -1;

  2378. 

  2379.     header = AV_RB32(buf);

  2380.     if(ff_mpa_check_header(header) < 0){

  2381.         buf++;

  2382. //        buf_size--;

  2383.         av_log(avctx, AV_LOG_ERROR, "Header missing skipping one byte.\n");

  2384.         goto retry;

  2385.     }

  2386. 

  2387.     if (ff_mpegaudio_decode_header(s, header) == 1) {

  2388.         /* free format: prepare to compute frame size */

  2389.         s->frame_size = -1;

  2390.         return -1;

  2391.     }

  2392.     /* update codec info */

  2393.     avctx->channels = s->nb_channels;

  2394.     avctx->bit_rate = s->bit_rate;

  2395.     avctx->sub_id = s->layer;

  2396. 

  2397.     if(s->frame_size<=0 || s->frame_size > buf_size){

  2398.         av_log(avctx, AV_LOG_ERROR, "incomplete frame\n");

  2399.         return -1;

  2400.     }else if(s->frame_size < buf_size){

  2401.         av_log(avctx, AV_LOG_ERROR, "incorrect frame size\n");

  2402.         buf_size= s->frame_size;

  2403.     }

  2404. 

  2405.     out_size = mp_decode_frame(s, out_samples, buf, buf_size);

  2406.     if(out_size>=0){

  2407.         *data_size = out_size;

  2408.         avctx->sample_rate = s->sample_rate;

  2409.         //FIXME maybe move the other codec info stuff from above here too

  2410.     }else

  2411.         av_log(avctx, AV_LOG_DEBUG, "Error while decoding MPEG audio frame.\n"); //FIXME return -1 / but also return the number of bytes consumed

  2412.     s->frame_size = 0;

  2413.     return buf_size;

  2414. }

  2415. 

  2416. static void flush(AVCodecContext *avctx){

  2417.     MPADecodeContext *s = avctx->priv_data;

  2418.     memset(s->synth_buf, 0, sizeof(s->synth_buf));

  2419.     s->last_buf_size= 0;

  2420. }

  2421. 

  2422. #ifdef CONFIG_MP3ADU_DECODER

  2423. static int decode_frame_adu(AVCodecContext * avctx,

  2424.                         void *data, int *data_size,

  2425.                         const uint8_t * buf, int buf_size)

  2426. {

  2427.     MPADecodeContext *s = avctx->priv_data;

  2428.     uint32_t header;

  2429.     int len, out_size;

  2430.     OUT_INT *out_samples = data;

  2431. 

  2432.     len = buf_size;

  2433. 

  2434.     // Discard too short frames

  2435.     if (buf_size < HEADER_SIZE) {

  2436.         *data_size = 0;

  2437.         return buf_size;

  2438.     }

  2439. 

  2440. 

  2441.     if (len > MPA_MAX_CODED_FRAME_SIZE)

  2442.         len = MPA_MAX_CODED_FRAME_SIZE;

  2443. 

  2444.     // Get header and restore sync word

  2445.     header = AV_RB32(buf) | 0xffe00000;

  2446. 

  2447.     if (ff_mpa_check_header(header) < 0) { // Bad header, discard frame

  2448.         *data_size = 0;

  2449.         return buf_size;

  2450.     }

  2451. 

  2452.     ff_mpegaudio_decode_header(s, header);

  2453.     /* update codec info */

  2454.     avctx->sample_rate = s->sample_rate;

  2455.     avctx->channels = s->nb_channels;

  2456.     avctx->bit_rate = s->bit_rate;

  2457.     avctx->sub_id = s->layer;

  2458. 

  2459.     s->frame_size = len;

  2460. 

  2461.     if (avctx->parse_only) {

  2462.         out_size = buf_size;

  2463.     } else {

  2464.         out_size = mp_decode_frame(s, out_samples, buf, buf_size);

  2465.     }

  2466. 

  2467.     *data_size = out_size;

  2468.     return buf_size;

  2469. }

  2470. #endif /* CONFIG_MP3ADU_DECODER */

  2471. 

  2472. #ifdef CONFIG_MP3ON4_DECODER

  2473. 

  2474. /**

  2475.  * Context for MP3On4 decoder

  2476.  */

  2477. typedef struct MP3On4DecodeContext {

  2478.     int frames;   ///< number of mp3 frames per block (number of mp3 decoder instances)

  2479.     int syncword; ///< syncword patch

  2480.     const uint8_t *coff; ///< channels offsets in output buffer

  2481.     MPADecodeContext *mp3decctx[5]; ///< MPADecodeContext for every decoder instance

  2482. } MP3On4DecodeContext;

  2483. 

  2484. #include "mpeg4audio.h"

  2485. 

  2486. /* Next 3 arrays are indexed by channel config number (passed via codecdata) */

  2487. static const uint8_t mp3Frames[8] = {0,1,1,2,3,3,4,5};   /* number of mp3 decoder instances */

  2488. /* offsets into output buffer, assume output order is FL FR BL BR C LFE */

  2489. static const uint8_t chan_offset[8][5] = {

  2490.     {0},

  2491.     {0},            // C

  2492.     {0},            // FLR

  2493.     {2,0},          // C FLR

  2494.     {2,0,3},        // C FLR BS

  2495.     {4,0,2},        // C FLR BLRS

  2496.     {4,0,2,5},      // C FLR BLRS LFE

  2497.     {4,0,2,6,5},    // C FLR BLRS BLR LFE

  2498. };

  2499. 

  2500. 

  2501. static int decode_init_mp3on4(AVCodecContext * avctx)

  2502. {

  2503.     MP3On4DecodeContext *s = avctx->priv_data;

  2504.     MPEG4AudioConfig cfg;

  2505.     int i;

  2506. 

  2507.     if ((avctx->extradata_size < 2) || (avctx->extradata == NULL)) {

  2508.         av_log(avctx, AV_LOG_ERROR, "Codec extradata missing or too short.\n");

  2509.         return -1;

  2510.     }

  2511. 

  2512.     ff_mpeg4audio_get_config(&cfg, avctx->extradata, avctx->extradata_size);

  2513.     if (!cfg.chan_config || cfg.chan_config > 7) {

  2514.         av_log(avctx, AV_LOG_ERROR, "Invalid channel config number.\n");

  2515.         return -1;

  2516.     }

  2517.     s->frames = mp3Frames[cfg.chan_config];

  2518.     s->coff = chan_offset[cfg.chan_config];

  2519.     avctx->channels = ff_mpeg4audio_channels[cfg.chan_config];

  2520. 

  2521.     if (cfg.sample_rate < 16000)

  2522.         s->syncword = 0xffe00000;

  2523.     else

  2524.         s->syncword = 0xfff00000;

  2525. 

  2526.     /* Init the first mp3 decoder in standard way, so that all tables get builded

  2527.      * We replace avctx->priv_data with the context of the first decoder so that

  2528.      * decode_init() does not have to be changed.

  2529.      * Other decoders will be initialized here copying data from the first context

  2530.      */

  2531.     // Allocate zeroed memory for the first decoder context

  2532.     s->mp3decctx[0] = av_mallocz(sizeof(MPADecodeContext));

  2533.     // Put decoder context in place to make init_decode() happy

  2534.     avctx->priv_data = s->mp3decctx[0];

  2535.     decode_init(avctx);

  2536.     // Restore mp3on4 context pointer

  2537.     avctx->priv_data = s;

  2538.     s->mp3decctx[0]->adu_mode = 1; // Set adu mode

  2539. 

  2540.     /* Create a separate codec/context for each frame (first is already ok).

  2541.      * Each frame is 1 or 2 channels - up to 5 frames allowed

  2542.      */

  2543.     for (i = 1; i < s->frames; i++) {

  2544.         s->mp3decctx[i] = av_mallocz(sizeof(MPADecodeContext));

  2545.         s->mp3decctx[i]->compute_antialias = s->mp3decctx[0]->compute_antialias;

  2546.         s->mp3decctx[i]->adu_mode = 1;

  2547.         s->mp3decctx[i]->avctx = avctx;

  2548.     }

  2549. 

  2550.     return 0;

  2551. }

  2552. 

  2553. 

  2554. static int decode_close_mp3on4(AVCodecContext * avctx)

  2555. {

  2556.     MP3On4DecodeContext *s = avctx->priv_data;

  2557.     int i;

  2558. 

  2559.     for (i = 0; i < s->frames; i++)

  2560.         if (s->mp3decctx[i])

  2561.             av_free(s->mp3decctx[i]);

  2562. 

  2563.     return 0;

  2564. }

  2565. 

  2566. 

  2567. static int decode_frame_mp3on4(AVCodecContext * avctx,

  2568.                         void *data, int *data_size,

  2569.                         const uint8_t * buf, int buf_size)

  2570. {

  2571.     MP3On4DecodeContext *s = avctx->priv_data;

  2572.     MPADecodeContext *m;

  2573.     int fsize, len = buf_size, out_size = 0;

  2574.     uint32_t header;

  2575.     OUT_INT *out_samples = data;

  2576.     OUT_INT decoded_buf[MPA_FRAME_SIZE * MPA_MAX_CHANNELS];

  2577.     OUT_INT *outptr, *bp;

  2578.     int fr, j, n;

  2579. 

  2580.     *data_size = 0;

  2581.     // Discard too short frames

  2582.     if (buf_size < HEADER_SIZE)

  2583.         return -1;

  2584. 

  2585.     // If only one decoder interleave is not needed

  2586.     outptr = s->frames == 1 ? out_samples : decoded_buf;

  2587. 

  2588.     avctx->bit_rate = 0;

  2589. 

  2590.     for (fr = 0; fr < s->frames; fr++) {

  2591.         fsize = AV_RB16(buf) >> 4;

  2592.         fsize = FFMIN3(fsize, len, MPA_MAX_CODED_FRAME_SIZE);

  2593.         m = s->mp3decctx[fr];

  2594.         assert (m != NULL);

  2595. 

  2596.         header = (AV_RB32(buf) & 0x000fffff) | s->syncword; // patch header

  2597. 

  2598.         if (ff_mpa_check_header(header) < 0) // Bad header, discard block

  2599.             break;

  2600. 

  2601.         ff_mpegaudio_decode_header(m, header);

  2602.         out_size += mp_decode_frame(m, outptr, buf, fsize);

  2603.         buf += fsize;

  2604.         len -= fsize;

  2605. 

  2606.         if(s->frames > 1) {

  2607.             n = m->avctx->frame_size*m->nb_channels;

  2608.             /* interleave output data */

  2609.             bp = out_samples + s->coff[fr];

  2610.             if(m->nb_channels == 1) {

  2611.                 for(j = 0; j < n; j++) {

  2612.                     *bp = decoded_buf[j];

  2613.                     bp += avctx->channels;

  2614.                 }

  2615.             } else {

  2616.                 for(j = 0; j < n; j++) {

  2617.                     bp[0] = decoded_buf[j++];

  2618.                     bp[1] = decoded_buf[j];

  2619.                     bp += avctx->channels;

  2620.                 }

  2621.             }

  2622.         }

  2623.         avctx->bit_rate += m->bit_rate;

  2624.     }

  2625. 

  2626.     /* update codec info */

  2627.     avctx->sample_rate = s->mp3decctx[0]->sample_rate;

  2628. 

  2629.     *data_size = out_size;

  2630.     return buf_size;

  2631. }

  2632. #endif /* CONFIG_MP3ON4_DECODER */

  2633. 

  2634. #ifdef CONFIG_MP2_DECODER

  2635. AVCodec mp2_decoder =

  2636. {

  2637.     "mp2",

  2638.     CODEC_TYPE_AUDIO,

  2639.     CODEC_ID_MP2,

  2640.     sizeof(MPADecodeContext),

  2641.     decode_init,

  2642.     NULL,

  2643.     NULL,

  2644.     decode_frame,

  2645.     CODEC_CAP_PARSE_ONLY,

  2646.     .flush= flush,

  2647.     .long_name= NULL_IF_CONFIG_SMALL("MP2 (MPEG audio layer 2)"),

  2648. };

  2649. #endif

  2650. #ifdef CONFIG_MP3_DECODER

  2651. AVCodec mp3_decoder =

  2652. {

  2653.     "mp3",

  2654.     CODEC_TYPE_AUDIO,

  2655.     CODEC_ID_MP3,

  2656.     sizeof(MPADecodeContext),

  2657.     decode_init,

  2658.     NULL,

  2659.     NULL,

  2660.     decode_frame,

  2661.     CODEC_CAP_PARSE_ONLY,

  2662.     .flush= flush,

  2663.     .long_name= NULL_IF_CONFIG_SMALL("MP3 (MPEG audio layer 3)"),

  2664. };

  2665. #endif

  2666. #ifdef CONFIG_MP3ADU_DECODER

  2667. AVCodec mp3adu_decoder =

  2668. {

  2669.     "mp3adu",

  2670.     CODEC_TYPE_AUDIO,

  2671.     CODEC_ID_MP3ADU,

  2672.     sizeof(MPADecodeContext),

  2673.     decode_init,

  2674.     NULL,

  2675.     NULL,

  2676.     decode_frame_adu,

  2677.     CODEC_CAP_PARSE_ONLY,

  2678.     .flush= flush,

  2679.     .long_name= NULL_IF_CONFIG_SMALL("ADU (Application Data Unit) MP3 (MPEG audio layer 3)"),

  2680. };

  2681. #endif

  2682. #ifdef CONFIG_MP3ON4_DECODER

  2683. AVCodec mp3on4_decoder =

  2684. {

  2685.     "mp3on4",

  2686.     CODEC_TYPE_AUDIO,

  2687.     CODEC_ID_MP3ON4,

  2688.     sizeof(MP3On4DecodeContext),

  2689.     decode_init_mp3on4,

  2690.     NULL,

  2691.     decode_close_mp3on4,

  2692.     decode_frame_mp3on4,

  2693.     .flush= flush,

  2694.     .long_name= NULL_IF_CONFIG_SMALL("MP3onMP4"),

  2695. };

  2696. #endif