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