| OLD | NEW |
| (Empty) | |
| 1 /*********************************************************************** |
| 2 Copyright (c) 2006-2011, Skype Limited. All rights reserved. |
| 3 Redistribution and use in source and binary forms, with or without |
| 4 modification, are permitted provided that the following conditions |
| 5 are met: |
| 6 - Redistributions of source code must retain the above copyright notice, |
| 7 this list of conditions and the following disclaimer. |
| 8 - Redistributions in binary form must reproduce the above copyright |
| 9 notice, this list of conditions and the following disclaimer in the |
| 10 documentation and/or other materials provided with the distribution. |
| 11 - Neither the name of Internet Society, IETF or IETF Trust, nor the |
| 12 names of specific contributors, may be used to endorse or promote |
| 13 products derived from this software without specific prior written |
| 14 permission. |
| 15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 16 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 18 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| 19 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 20 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| 25 POSSIBILITY OF SUCH DAMAGE. |
| 26 ***********************************************************************/ |
| 27 |
| 28 #ifdef HAVE_CONFIG_H |
| 29 #include "config.h" |
| 30 #endif |
| 31 |
| 32 #include "SigProc_FIX.h" |
| 33 #include "pitch.h" |
| 34 |
| 35 /* Copy and multiply a vector by a constant */ |
| 36 void silk_scale_copy_vector16( |
| 37 opus_int16 *data_out, |
| 38 const opus_int16 *data_in, |
| 39 opus_int32 gain_Q16, /* I Gain in Q16
*/ |
| 40 const opus_int dataSize /* I Length
*/ |
| 41 ) |
| 42 { |
| 43 opus_int i; |
| 44 opus_int32 tmp32; |
| 45 |
| 46 for( i = 0; i < dataSize; i++ ) { |
| 47 tmp32 = silk_SMULWB( gain_Q16, data_in[ i ] ); |
| 48 data_out[ i ] = (opus_int16)silk_CHECK_FIT16( tmp32 ); |
| 49 } |
| 50 } |
| 51 |
| 52 /* Multiply a vector by a constant */ |
| 53 void silk_scale_vector32_Q26_lshift_18( |
| 54 opus_int32 *data1, /* I/O Q0/Q18
*/ |
| 55 opus_int32 gain_Q26, /* I Q26
*/ |
| 56 opus_int dataSize /* I length
*/ |
| 57 ) |
| 58 { |
| 59 opus_int i; |
| 60 |
| 61 for( i = 0; i < dataSize; i++ ) { |
| 62 data1[ i ] = (opus_int32)silk_CHECK_FIT32( silk_RSHIFT64( silk_SMULL( da
ta1[ i ], gain_Q26 ), 8 ) ); /* OUTPUT: Q18 */ |
| 63 } |
| 64 } |
| 65 |
| 66 /* sum = for(i=0;i<len;i++)inVec1[i]*inVec2[i]; --- inner product
*/ |
| 67 /* Note for ARM asm:
*/ |
| 68 /* * inVec1 and inVec2 should be at least 2 byte aligned.
*/ |
| 69 /* * len should be positive 16bit integer.
*/ |
| 70 /* * only when len>6, memory access can be reduced by half.
*/ |
| 71 opus_int32 silk_inner_prod_aligned( |
| 72 const opus_int16 *const inVec1, /* I input vector 1
*/ |
| 73 const opus_int16 *const inVec2, /* I input vector 2
*/ |
| 74 const opus_int len, /* I vector lengths
*/ |
| 75 int arch /* I Run-time architectur
e */ |
| 76 ) |
| 77 { |
| 78 #ifdef FIXED_POINT |
| 79 return celt_inner_prod(inVec1, inVec2, len, arch); |
| 80 #else |
| 81 opus_int i; |
| 82 opus_int32 sum = 0; |
| 83 for( i = 0; i < len; i++ ) { |
| 84 sum = silk_SMLABB( sum, inVec1[ i ], inVec2[ i ] ); |
| 85 } |
| 86 return sum; |
| 87 #endif |
| 88 } |
| 89 |
| 90 opus_int64 silk_inner_prod16_aligned_64_c( |
| 91 const opus_int16 *inVec1, /* I input vector 1
*/ |
| 92 const opus_int16 *inVec2, /* I input vector 2
*/ |
| 93 const opus_int len /* I vector lengths
*/ |
| 94 ) |
| 95 { |
| 96 opus_int i; |
| 97 opus_int64 sum = 0; |
| 98 for( i = 0; i < len; i++ ) { |
| 99 sum = silk_SMLALBB( sum, inVec1[ i ], inVec2[ i ] ); |
| 100 } |
| 101 return sum; |
| 102 } |
| OLD | NEW |