iwinbq.ch

DSP c64优化 ACT spraa14 mp3优化实例 与其优化应用报告配套

   si += (256 + -3 * 32 + 2 * 32 - 1);
   bx += (32 + 3 * 32 + 2 * 32 + 1);
   for (i = 0; i < 7; i++)
   {
      sum = WINMULT(vbuf[si], (*coef--));
      for (j = 0; j < 3; j++)
      {
         si += 32;
         sum += WINMULT(vbuf[bx], (*coef--));
         bx += 32;
         sum += WINMULT(vbuf[si], (*coef--));
      }
      si += (32 - 1 + 4 * 32);
      bx += (5 * 32 + 1);
      coef -= 7;
      sum >>= WINBITS;
      if (sum > 32767)
         sum = 32767;
      else if (sum < -32768)
         sum = -32768;
      *pcm = (unsigned char) ((sum >> 8) ^ 0x80);
      pcm += 2;
   }
}
/*--------------- 16 pt dual window (interleaved output) -----------------*/
void i_windowB16_dual_right(WININT * vbuf, int vb_ptr, unsigned char *pcm)
{
/* right identical to dual, for asm */
   int i, j;
   unsigned char si, bx;
   WINCOEF *coef;
   INT32 sum;


/*-- first 8 --*/
   si = (unsigned char) (vb_ptr + 8 + 3 * 32);
   bx = (unsigned char) (si + (16 + 256 - 3 * 32 + 2 * 32));
   coef = iwincoef;
   for (i = 0; i < 8; i++)
   {
      sum = -WINMULT(vbuf[bx], (*coef++));
      for (j = 0; j < 3; j++)
      {
         bx += 32;
         sum += WINMULT(vbuf[si], (*coef++));
         si += 32;
         sum -= WINMULT(vbuf[bx], (*coef++));
      }
      si += (5 * 32 + 1);
      bx += (32 + 4 * 32 - 1);
      coef += 7;
      sum >>= WINBITS;
      if (sum > 32767)
         sum = 32767;
      else if (sum < -32768)
         sum = -32768;
      *pcm = (unsigned char) ((sum >> 8) ^ 0x80);
      pcm += 2;
   }
/*--  special case --*/
   bx += (256 - 32);
   sum = WINMULT(vbuf[bx], (*coef++));
   for (j = 0; j < 3; j++)
   {
      bx += 32;
      sum += WINMULT(vbuf[bx], (*coef++));
   }
   sum >>= WINBITS;
   if (sum > 32767)
      sum = 32767;
   else if (sum < -32768)
      sum = -32768;
   *pcm = (unsigned char) ((sum >> 8) ^ 0x80);
   pcm += 2;

/*-- last 7 --*/
   coef = iwincoef + (111 - 7);        /* back pass through coefs */
   si += (256 + -3 * 32 + 2 * 32 - 1);
   bx += (32 + 3 * 32 + 2 * 32 + 1);
   for (i = 0; i < 7; i++)
   {
      sum = WINMULT(vbuf[si], (*coef--));
      for (j = 0; j < 3; j++)
      {
         si += 32;
         sum += WINMULT(vbuf[bx], (*coef--));
         bx += 32;
         sum += WINMULT(vbuf[si], (*coef--));
      }
      si += (32 - 1 + 4 * 32);
      bx += (5 * 32 + 1);
      coef -= 7;
      sum >>= WINBITS;
      if (sum > 32767)
         sum = 32767;
      else if (sum < -32768)
         sum = -32768;
      *pcm = (unsigned char) ((sum >> 8) ^ 0x80);
      pcm += 2;
   }
}
/*------------------------------------------------------------*/
/*------------------- 8 pt window ------------------------------*/
void i_windowB8(WININT * vbuf, int vb_ptr, unsigned char *pcm)
{
   int i, j;
   unsigned int si, bx;
   WINCOEF *coef;
   INT32 sum;

/*-- first 4 --*/
   si = (vb_ptr + (4 + 3 * 16)) & 127;
   bx = (si + (8 + 128 - 3 * 16 + 2 * 16)) & 127;
   coef = iwincoef;
   for (i = 0; i < 4; i++)
   {
      sum = -WINMULT(vbuf[bx], (*coef++));
      for (j = 0; j < 3; j++)
      {
         bx = (bx + 16) & 127;
         sum += WINMULT(vbuf[si], (*coef++));
         si = (si + 16) & 127;
         sum -= WINMULT(vbuf[bx], (*coef++));
      }
      si = (si + (5 * 16 + 1)) & 127;
      bx = (bx + (16 + 4 * 16 - 1)) & 127;
      coef += (3 * 7);
      sum >>= WINBITS;
      if (sum > 32767)
         sum = 32767;
      else if (sum < -32768)
         sum = -32768;
      *pcm++ = (unsigned char) ((sum >> 8) ^ 0x80);
   }
/*--  special case --*/
   bx = (bx + (128 - 16)) & 127;
   sum = WINMULT(vbuf[bx], (*coef++));
   for (j = 0; j < 3; j++)
   {
      bx = (bx + 16) & 127;
      sum += WINMULT(vbuf[bx], (*coef++));
   }
   sum >>= WINBITS;
   if (sum > 32767)
      sum = 32767;
   else if (sum < -32768)
      sum = -32768;
   *pcm++ = (unsigned char) ((sum >> 8) ^ 0x80);

/*-- last 3 --*/
   coef = iwincoef + (111 - 3 * 7);        /* back pass through coefs */
   si = (si + (128 - 3 * 16 + 2 * 16 - 1)) & 127;
   bx = (bx + (16 + 3 * 16 + 2 * 16 + 1)) & 127;
   for (i = 0; i < 3; i++)
   {
      sum = WINMULT(vbuf[si], (*coef--));
      for (j = 0; j < 3; j++)
      {
         si = (si + 16) & 127;
         sum += WINMULT(vbuf[bx], (*coef--));
         bx = (bx + 16) & 127;
         sum += WINMULT(vbuf[si], (*coef--));
      }
      si = (si + (16 - 1 + 4 * 16)) & 127;
      bx = (bx + (5 * 16 + 1)) & 127;
      coef -= (3 * 7);
      sum >>= WINBITS;
      if (sum > 32767)
         sum = 32767;
      else if (sum < -32768)
         sum = -32768;
      *pcm++ = (unsigned char) ((sum >> 8) ^ 0x80);
   }
}
/*--------------- 8 pt dual window (interleaved output) --------------*/
void i_windowB8_dual(WININT * vbuf, int vb_ptr, unsigned char *pcm)
{
   int i, j;
   unsigned int si, bx;
   WINCOEF *coef;
   INT32 sum;

/*-- first 4 --*/
   si = (vb_ptr + (4 + 3 * 16)) & 127;
   bx = (si + (8 + 128 - 3 * 16 + 2 * 16)) & 127;
   coef = iwincoef;
   for (i = 0; i < 4; i++)
   {
      sum = -WINMULT(vbuf[bx], (*coef++));
      for (j = 0; j < 3; j++)
      {
         bx = (bx + 16) & 127;
         sum += WINMULT(vbuf[si], (*coef++));
         si = (si + 16) & 127;
         sum -= WINMULT(vbuf[bx], (*coef++));
      }
      si = (si + (5 * 16 + 1)) & 127;
      bx = (bx + (16 + 4 * 16 - 1)) & 127;
      coef += (3 * 7);
      sum >>= WINBITS;
      if (sum > 32767)
         sum = 32767;
      else if (sum < -32768)
         sum = -32768;
      *pcm = (unsigned char) ((sum >> 8) ^ 0x80);
      pcm += 2;
   }
/*--  special case --*/
   bx = (bx + (128 - 16)) & 127;
   sum = WINMULT(vbuf[bx], (*coef++));
   for (j = 0; j < 3; j++)
   {
      bx = (bx + 16) & 127;
      sum += WINMULT(vbuf[bx], (*coef++));
   }
   sum >>= WINBITS;
   if (sum > 32767)
      sum = 32767;
   else if (sum < -32768)
      sum = -32768;
   *pcm = (unsigned char) ((sum >> 8) ^ 0x80);
   pcm += 2;

/*-- last 3 --*/
   coef = iwincoef + (111 - 3 * 7);        /* back pass through coefs */
   si = (si + (128 - 3 * 16 + 2 * 16 - 1)) & 127;
   bx = (bx + (16 + 3 * 16 + 2 * 16 + 1)) & 127;
   for (i = 0; i < 3; i++)
   {
      sum = WINMULT(vbuf[si], (*coef--));
      for (j = 0; j < 3; j++)
      {
         si = (si + 16) & 127;
         sum += WINMULT(vbuf[bx], (*coef--));
         bx = (bx + 16) & 127;
         sum += WINMULT(vbuf[si], (*coef--));
      }
      si = (si + (16 - 1 + 4 * 16)) & 127;
      bx = (bx + (5 * 16 + 1)) & 127;
      coef -= (3 * 7);
      sum >>= WINBITS;
      if (sum > 32767)
         sum = 32767;
      else if (sum < -32768)
         sum = -32768;
      *pcm = (unsigned char) ((sum >> 8) ^ 0x80);
      pcm += 2;
   }
}
/*------------------------------------------------------------*/
/*--------------- 8 pt dual window (interleaved output) --------------*/
void i_windowB8_dual_right(WININT * vbuf, int vb_ptr, unsigned char *pcm)
{
   int i, j;
   unsigned int si, bx;
   WINCOEF *coef;
   INT32 sum;

/* right identical to dual, for asm */

/*-- first 4 --*/
   si = (vb_ptr + (4 + 3 * 16)) & 127;
   bx = (si + (8 + 128 - 3 * 16 + 2 * 16)) & 127;
   coef = iwincoef;
   for (i = 0; i < 4; i++)
   {
      sum = -WINMULT(vbuf[bx], (*coef++));
      for (j = 0; j < 3; j++)
      {
         bx = (bx + 16) & 127;
         sum += WINMULT(vbuf[si], (*coef++));
         si = (si + 16) & 127;
         sum -= WINMULT(vbuf[bx], (*coef++));
      }
      si = (si + (5 * 16 + 1)) & 127;
      bx = (bx + (16 + 4 * 16 - 1)) & 127;
      coef += (3 * 7);
      sum >>= WINBITS;
      if (sum > 32767)
         sum = 32767;
      else if (sum < -32768)
         sum = -32768;
      *pcm = (unsigned char) ((sum >> 8) ^ 0x80);
      pcm += 2;
   }
/*--  special case --*/
   bx = (bx + (128 - 16)) & 127;
   sum = WINMULT(vbuf[bx], (*coef++));
   for (j = 0; j < 3; j++)
   {
      bx = (bx + 16) & 127;
      sum += WINMULT(vbuf[bx], (*coef++));
   }
   sum >>= WINBITS;
   if (sum > 32767)
      sum = 32767;
   else if (sum < -32768)
      sum = -32768;
   *pcm = (unsigned char) ((sum >> 8) ^ 0x80);
   pcm += 2;

/*-- last 3 --*/
   coef = iwincoef + (111 - 3 * 7);        /* back pass through coefs */
   si = (si + (128 - 3 * 16 + 2 * 16 - 1)) & 127;
   bx = (bx + (16 + 3 * 16 + 2 * 16 + 1)) & 127;
   for (i = 0; i < 3; i++)
   {
      sum = WINMULT(vbuf[si], (*coef--));
      for (j = 0; j < 3; j++)
      {
         si = (si + 16) & 127;
         sum += WINMULT(vbuf[bx], (*coef--));
         bx = (bx + 16) & 127;
         sum += WINMULT(vbuf[si], (*coef--));
      }
      si = (si + (16 - 1 + 4 * 16)) & 127;
      bx = (bx + (5 * 16 + 1)) & 127;
      coef -= (3 * 7);
      sum >>= WINBITS;
      if (sum > 32767)
         sum = 32767;
      else if (sum < -32768)
         sum = -32768;
      *pcm = (unsigned char) ((sum >> 8) ^ 0x80);
      pcm += 2;
   }
}
/*--------------------------------------------------------*/

/* ***********************************************************
* 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.
* ********************************************************* */