📄 iupl1.ch
字号:
/*____________________________________________________________________________
FreeAmp - The Free MP3 Player
MP3 Decoder originally Copyright (C) 1995-1997 Xing Technology
Corp. http://www.xingtech.com
Portions Copyright (C) 1998-1999 EMusic.com
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
____________________________________________________________________________*/
/**** iupL1.c ***************************************************
MPEG audio decoder Layer I mpeg1 and mpeg2
should be portable ANSI C, should be endian independent
icupL1 integer version of cupL1.c
******************************************************************/
/*======================================================================*/
static int nbatL1 = 32;
static int bat_bit_masterL1[] =
{
0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16};
/*--- static int *cs_factorL1 = cs_factor[0]; ---*/
static INT32 *cs_factorL1 = cs_factor[0];
static int look_c_valueL1[16]; /* built by init */
static int look_c_shiftL1[16]; /* built by init */
/*======================================================================*/
static void unpack_baL1()
{
int k;
int nstereo;
int n;
bit_skip = 0;
nstereo = stereo_sb;
for (k = 0; k < nbatL1; k++)
{
mac_load_check(4);
n = ballo[k] = samp_dispatch[k] = mac_load(4);
if (k >= nsb_limit)
bit_skip += bat_bit_masterL1[samp_dispatch[k]];
c_value[k] = look_c_valueL1[n];
c_shift[k] = look_c_shiftL1[n];
if (--nstereo < 0)
{
ballo[k + 1] = ballo[k];
samp_dispatch[k] += 15; /* flag as joint */
samp_dispatch[k + 1] = samp_dispatch[k]; /* flag for sf */
c_value[k + 1] = c_value[k];
c_shift[k + 1] = c_shift[k];
k++;
}
}
samp_dispatch[nsb_limit] = 31; /* terminate the dispatcher with skip */
samp_dispatch[k] = 30; /* terminate the dispatcher */
}
/*-------------------------------------------------------------------------*/
static void unpack_sfL1() /* unpack scale factor */
{ /* combine dequant and scale factors */
int i, n;
INT32 tmp; /* only reason tmp is 32 bit is to get 32 bit mult result */
for (i = 0; i < nbatL1; i++)
{
if (ballo[i])
{
mac_load_check(6);
tmp = c_value[i];
n = c_shift[i];
cs_factorL1[i] = (tmp * sf_table[mac_load(6)]) >> n;
}
}
/*-- done --*/
}
/*-------------------------------------------------------------------------*/
#define UNPACKL1_N(n) s[k] = (cs_factorL1[k]*(load(n)-((1 << (n-1)) -1)))>>(n-1); \
goto dispatch;
#define UNPACKL1J_N(n) tmp = (load(n)-((1 << (n-1)) -1)); \
s[k] = (cs_factorL1[k]*tmp)>>(n-1); \
s[k+1] = (cs_factorL1[k+1]*tmp)>>(n-1); \
k++; /* skip right chan dispatch */ \
goto dispatch;
/*-------------------------------------------------------------------------*/
static void unpack_sampL1() /* unpack samples */
{
int j, k;
SAMPLEINT *s;
INT32 tmp;
s = sample;
for (j = 0; j < 12; j++)
{
k = -1;
dispatch:switch (samp_dispatch[++k])
{
case 0:
s[k] = 0;
goto dispatch;
case 1:
UNPACKL1_N(2) /* 3 levels */
case 2:
UNPACKL1_N(3) /* 7 levels */
case 3:
UNPACKL1_N(4) /* 15 levels */
case 4:
UNPACKL1_N(5) /* 31 levels */
case 5:
UNPACKL1_N(6) /* 63 levels */
case 6:
UNPACKL1_N(7) /* 127 levels */
case 7:
UNPACKL1_N(8) /* 255 levels */
case 8:
UNPACKL1_N(9) /* 511 levels */
case 9:
UNPACKL1_N(10) /* 1023 levels */
case 10:
UNPACKL1_N(11) /* 2047 levels */
case 11:
UNPACKL1_N(12) /* 4095 levels */
case 12:
UNPACKL1_N(13) /* 8191 levels */
case 13:
UNPACKL1_N(14) /* 16383 levels */
case 14:
UNPACKL1_N(15) /* 32767 levels */
/* -- joint ---- */
case 15 + 0:
s[k + 1] = s[k] = 0;
k++; /* skip right chan dispatch */
goto dispatch;
/* -- joint ---- */
case 15 + 1:
UNPACKL1J_N(2) /* 3 levels */
case 15 + 2:
UNPACKL1J_N(3) /* 7 levels */
case 15 + 3:
UNPACKL1J_N(4) /* 15 levels */
case 15 + 4:
UNPACKL1J_N(5) /* 31 levels */
case 15 + 5:
UNPACKL1J_N(6) /* 63 levels */
case 15 + 6:
UNPACKL1J_N(7) /* 127 levels */
case 15 + 7:
UNPACKL1J_N(8) /* 255 levels */
case 15 + 8:
UNPACKL1J_N(9) /* 511 levels */
case 15 + 9:
UNPACKL1J_N(10) /* 1023 levels */
case 15 + 10:
UNPACKL1J_N(11) /* 2047 levels */
case 15 + 11:
UNPACKL1J_N(12) /* 4095 levels */
case 15 + 12:
UNPACKL1J_N(13) /* 8191 levels */
case 15 + 13:
UNPACKL1J_N(14) /* 16383 levels */
case 15 + 14:
UNPACKL1J_N(15) /* 32767 levels */
/* -- end of dispatch -- */
case 31:
skip(bit_skip);
case 30:
s += 64;
} /* end switch */
} /* end j loop */
/*-- done --*/
}
/*-------------------------------------------------------------------------*/
static void unpackL1()
{
int prot;
/* at entry bit getter points at id, sync skipped by caller */
load(3); /* skip id and option (checked by init) */
prot = load(1); /* load prot bit */
load(6); /* skip to pad */
pad = load(1) << 2;
load(1); /* skip to mode */
stereo_sb = look_joint[load(4)];
if (prot)
load(4); /* skip to data */
else
load(20); /* skip crc */
unpack_baL1(); /* unpack bit allocation */
unpack_sfL1(); /* unpack scale factor */
unpack_sampL1(); /* unpack samples */
}
/*-------------------------------------------------------------------------*/
int i_audio_decode_initL1(MPEG_HEAD * h, int framebytes_arg,
int reduction_code, int transform_code, int convert_code,
int freq_limit)
{
int i, k;
static int first_pass = 1;
long samprate;
int limit;
int stepbit;
long step;
int bit_code;
/*--- sf table built by Layer II init ---*/
if (first_pass)
{
stepbit = 2;
step = 4;
for (i = 1; i < 16; i++)
{
look_c_valueL1[i] = (int) (32768.0 * 2.0 / (step - 1));
look_c_shiftL1[i] = 16 - stepbit;
stepbit++;
step <<= 1;
}
first_pass = 0;
}
unpack_routine = unpackL1;
transform_code = transform_code; /* not used, asm compatability */
bit_code = 0;
if (convert_code & 8)
bit_code = 1;
convert_code = convert_code & 3; /* higher bits used by dec8 freq cvt */
if (reduction_code < 0)
reduction_code = 0;
if (reduction_code > 2)
reduction_code = 2;
if (freq_limit < 1000)
freq_limit = 1000;
framebytes = framebytes_arg;
/* check if code handles */
if (h->option != 3)
return 0; /* layer I only */
nbatL1 = 32;
max_sb = nbatL1;
/*----- compute nsb_limit --------*/
samprate = sr_table[4 * h->id + h->sr_index];
nsb_limit = (freq_limit * 64L + samprate / 2) / samprate;
/*- caller limit -*/
/*---- limit = 0.94*(32>>reduction_code); ----*/
limit = (32 >> reduction_code);
if (limit > 8)
limit--;
if (nsb_limit > limit)
nsb_limit = limit;
if (nsb_limit > max_sb)
nsb_limit = max_sb;
outvalues = 384 >> reduction_code;
if (h->mode != 3)
{ /* adjust for 2 channel modes */
nbatL1 *= 2;
max_sb *= 2;
nsb_limit *= 2;
}
/* set sbt function */
nsbt = 12;
k = 1 + convert_code;
if (h->mode == 3)
{
k = 0;
}
sbt = sbt_table[bit_code][reduction_code][k];
outvalues *= out_chans[k];
if (bit_code != 0)
outbytes = outvalues;
else
#if __TMS320C55X__ || _TMS320C5XX || _TMS320C27XX
outbytes = 2 * outvalues;
#else
outbytes = sizeof(short) * outvalues;
#endif
decinfo.channels = out_chans[k];
decinfo.outvalues = outvalues;
decinfo.samprate = samprate >> reduction_code;
if (bit_code != 0)
decinfo.bits = 8;
else
#if __TMS320C55X__ || _TMS320C5XX || _TMS320C27XX
decinfo.bits = 2 * 8;
#else
decinfo.bits = sizeof(short) * 8;
#endif
decinfo.framebytes = framebytes;
decinfo.type = 0;
/* clear sample buffer, unused sub bands must be 0 */
for (i = 0; i < 768; i++)
sample[i] = 0;
/* init sub-band transform */
i_sbt_init();
return 1;
}
/*---------------------------------------------------------*/
/* ***********************************************************
* THIS PROGRAM IS PROVIDED "AS IS". TI MAKES NO WARRANTIES OR
* REPRESENTATIONS, EITHER EXPRESS, IMPLIED OR STATUTORY,
* INCLUDING ANY IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS
* FOR A PARTICULAR PURPOSE, LACK OF VIRUSES, ACCURACY OR
* COMPLETENESS OF RESPONSES, RESULTS AND LACK OF NEGLIGENCE.
* TI DISCLAIMS ANY WARRANTY OF TITLE, QUIET ENJOYMENT, QUIET
* POSSESSION, AND NON-INFRINGEMENT OF ANY THIRD PARTY
* INTELLECTUAL PROPERTY RIGHTS WITH REGARD TO THE PROGRAM OR
* YOUR USE OF THE PROGRAM.
*
* IN NO EVENT SHALL TI BE LIABLE FOR ANY SPECIAL, INCIDENTAL,
* CONSEQUENTIAL OR INDIRECT DAMAGES, HOWEVER CAUSED, ON ANY
* THEORY OF LIABILITY AND WHETHER OR NOT TI HAS BEEN ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGES, ARISING IN ANY WAY OUT
* OF THIS AGREEMENT, THE PROGRAM, OR YOUR USE OF THE PROGRAM.
* EXCLUDED DAMAGES INCLUDE, BUT ARE NOT LIMITED TO, COST OF
* REMOVAL OR REINSTALLATION, COMPUTER TIME, LABOR COSTS, LOSS
* OF GOODWILL, LOSS OF PROFITS, LOSS OF SAVINGS, OR LOSS OF
* USE OR INTERRUPTION OF BUSINESS. IN NO EVENT WILL TI'S
* AGGREGATE LIABILITY UNDER THIS AGREEMENT OR ARISING OUT OF
* YOUR USE OF THE PROGRAM EXCEED FIVE HUNDRED DOLLARS
* (U.S.$500).
*
* Unless otherwise stated, the Program written and copyrighted
* by Texas Instruments is distributed as "freeware". You may,
* only under TI's copyright in the Program, use and modify the
* Program without any charge or restriction. You may
* distribute to third parties, provided that you transfer a
* copy of this license to the third party and the third party
* agrees to these terms by its first use of the Program. You
* must reproduce the copyright notice and any other legend of
* ownership on each copy or partial copy, of the Program.
*
* You acknowledge and agree that the Program contains
* copyrighted material, trade secrets and other TI proprietary
* information and is protected by copyright laws,
* international copyright treaties, and trade secret laws, as
* well as other intellectual property laws. To protect TI's
* rights in the Program, you agree not to decompile, reverse
* engineer, disassemble or otherwise translate any object code
* versions of the Program to a human-readable form. You agree
* that in no event will you alter, remove or destroy any
* copyright notice included in the Program. TI reserves all
* rights not specifically granted under this license. Except
* as specifically provided herein, nothing in this agreement
* shall be construed as conferring by implication, estoppel,
* or otherwise, upon you, any license or other right under any
* TI patents, copyrights or trade secrets.
*
* You may not use the Program in non-TI devices.
* ********************************************************* */
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -