Alexandre Lision | 744f742 | 2013-09-25 11:39:37 -0400 | [diff] [blame] | 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 | |
| 34 | /* Copy and multiply a vector by a constant */ |
| 35 | void silk_scale_copy_vector16( |
| 36 | opus_int16 *data_out, |
| 37 | const opus_int16 *data_in, |
| 38 | opus_int32 gain_Q16, /* I Gain in Q16 */ |
| 39 | const opus_int dataSize /* I Length */ |
| 40 | ) |
| 41 | { |
| 42 | opus_int i; |
| 43 | opus_int32 tmp32; |
| 44 | |
| 45 | for( i = 0; i < dataSize; i++ ) { |
| 46 | tmp32 = silk_SMULWB( gain_Q16, data_in[ i ] ); |
| 47 | data_out[ i ] = (opus_int16)silk_CHECK_FIT16( tmp32 ); |
| 48 | } |
| 49 | } |
| 50 | |
| 51 | /* Multiply a vector by a constant */ |
| 52 | void silk_scale_vector32_Q26_lshift_18( |
| 53 | opus_int32 *data1, /* I/O Q0/Q18 */ |
| 54 | opus_int32 gain_Q26, /* I Q26 */ |
| 55 | opus_int dataSize /* I length */ |
| 56 | ) |
| 57 | { |
| 58 | opus_int i; |
| 59 | |
| 60 | for( i = 0; i < dataSize; i++ ) { |
| 61 | data1[ i ] = (opus_int32)silk_CHECK_FIT32( silk_RSHIFT64( silk_SMULL( data1[ i ], gain_Q26 ), 8 ) ); /* OUTPUT: Q18 */ |
| 62 | } |
| 63 | } |
| 64 | |
| 65 | /* sum = for(i=0;i<len;i++)inVec1[i]*inVec2[i]; --- inner product */ |
| 66 | /* Note for ARM asm: */ |
| 67 | /* * inVec1 and inVec2 should be at least 2 byte aligned. */ |
| 68 | /* * len should be positive 16bit integer. */ |
| 69 | /* * only when len>6, memory access can be reduced by half. */ |
| 70 | opus_int32 silk_inner_prod_aligned( |
| 71 | const opus_int16 *const inVec1, /* I input vector 1 */ |
| 72 | const opus_int16 *const inVec2, /* I input vector 2 */ |
| 73 | const opus_int len /* I vector lengths */ |
| 74 | ) |
| 75 | { |
| 76 | opus_int i; |
| 77 | opus_int32 sum = 0; |
| 78 | for( i = 0; i < len; i++ ) { |
| 79 | sum = silk_SMLABB( sum, inVec1[ i ], inVec2[ i ] ); |
| 80 | } |
| 81 | return sum; |
| 82 | } |
| 83 | |
| 84 | opus_int64 silk_inner_prod16_aligned_64( |
| 85 | const opus_int16 *inVec1, /* I input vector 1 */ |
| 86 | const opus_int16 *inVec2, /* I input vector 2 */ |
| 87 | const opus_int len /* I vector lengths */ |
| 88 | ) |
| 89 | { |
| 90 | opus_int i; |
| 91 | opus_int64 sum = 0; |
| 92 | for( i = 0; i < len; i++ ) { |
| 93 | sum = silk_SMLALBB( sum, inVec1[ i ], inVec2[ i ] ); |
| 94 | } |
| 95 | return sum; |
| 96 | } |
| 97 | |
| 98 | /* Function that returns the maximum absolut value of the input vector */ |
| 99 | opus_int16 silk_int16_array_maxabs( /* O Maximum absolute value, max: 2^15-1 */ |
| 100 | const opus_int16 *vec, /* I Input vector [len] */ |
| 101 | const opus_int32 len /* I Length of input vector */ |
| 102 | ) |
| 103 | { |
| 104 | opus_int32 max = 0, i, lvl = 0, ind; |
| 105 | if( len == 0 ) return 0; |
| 106 | |
| 107 | ind = len - 1; |
| 108 | max = silk_SMULBB( vec[ ind ], vec[ ind ] ); |
| 109 | for( i = len - 2; i >= 0; i-- ) { |
| 110 | lvl = silk_SMULBB( vec[ i ], vec[ i ] ); |
| 111 | if( lvl > max ) { |
| 112 | max = lvl; |
| 113 | ind = i; |
| 114 | } |
| 115 | } |
| 116 | |
| 117 | /* Do not return 32768, as it will not fit in an int16 so may lead to problems later on */ |
| 118 | if( max >= 1073676289 ) { /* (2^15-1)^2 = 1073676289 */ |
| 119 | return( silk_int16_MAX ); |
| 120 | } else { |
| 121 | if( vec[ ind ] < 0 ) { |
| 122 | return( -vec[ ind ] ); |
| 123 | } else { |
| 124 | return( vec[ ind ] ); |
| 125 | } |
| 126 | } |
| 127 | } |