OLD | NEW |
1 /*********************************************************************** | 1 /*********************************************************************** |
2 Copyright (c) 2006-2011, Skype Limited. All rights reserved. | 2 Copyright (c) 2006-2011, Skype Limited. All rights reserved. |
3 Redistribution and use in source and binary forms, with or without | 3 Redistribution and use in source and binary forms, with or without |
4 modification, are permitted provided that the following conditions | 4 modification, are permitted provided that the following conditions |
5 are met: | 5 are met: |
6 - Redistributions of source code must retain the above copyright notice, | 6 - Redistributions of source code must retain the above copyright notice, |
7 this list of conditions and the following disclaimer. | 7 this list of conditions and the following disclaimer. |
8 - Redistributions in binary form must reproduce the above copyright | 8 - Redistributions in binary form must reproduce the above copyright |
9 notice, this list of conditions and the following disclaimer in the | 9 notice, this list of conditions and the following disclaimer in the |
10 documentation and/or other materials provided with the distribution. | 10 documentation and/or other materials provided with the distribution. |
11 - Neither the name of Internet Society, IETF or IETF Trust, nor the | 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 | 12 names of specific contributors, may be used to endorse or promote |
13 products derived from this software without specific prior written | 13 products derived from this software without specific prior written |
14 permission. | 14 permission. |
15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS IS” | 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 | 16 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | 17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
18 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE | 18 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
19 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | 19 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
20 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | 20 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS | 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 | 22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | 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 | 24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
25 POSSIBILITY OF SUCH DAMAGE. | 25 POSSIBILITY OF SUCH DAMAGE. |
(...skipping 61 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
87 const opus_int len /* I vector lengths
*/ | 87 const opus_int len /* I vector lengths
*/ |
88 ) | 88 ) |
89 { | 89 { |
90 opus_int i; | 90 opus_int i; |
91 opus_int64 sum = 0; | 91 opus_int64 sum = 0; |
92 for( i = 0; i < len; i++ ) { | 92 for( i = 0; i < len; i++ ) { |
93 sum = silk_SMLALBB( sum, inVec1[ i ], inVec2[ i ] ); | 93 sum = silk_SMLALBB( sum, inVec1[ i ], inVec2[ i ] ); |
94 } | 94 } |
95 return sum; | 95 return sum; |
96 } | 96 } |
97 | |
98 /* Function that returns the maximum absolut value of the input vector */ | |
99 opus_int16 silk_int16_array_maxabs( /* O Maximum absolute valu
e, max: 2^15-1 */ | |
100 const opus_int16 *vec, /* I Input vector [len]
*/ | |
101 const opus_int32 len /* I Length of input vecto
r */ | |
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 proble
ms 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 } | |
OLD | NEW |