michael@0: /***********************************************************************
michael@0: Copyright (c) 2006-2011, Skype Limited. All rights reserved.
michael@0: Redistribution and use in source and binary forms, with or without
michael@0: modification, are permitted provided that the following conditions
michael@0: are met:
michael@0: - Redistributions of source code must retain the above copyright notice,
michael@0: this list of conditions and the following disclaimer.
michael@0: - Redistributions in binary form must reproduce the above copyright
michael@0: notice, this list of conditions and the following disclaimer in the
michael@0: documentation and/or other materials provided with the distribution.
michael@0: - Neither the name of Internet Society, IETF or IETF Trust, nor the
michael@0: names of specific contributors, may be used to endorse or promote
michael@0: products derived from this software without specific prior written
michael@0: permission.
michael@0: THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
michael@0: AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
michael@0: IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
michael@0: ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
michael@0: LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
michael@0: CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
michael@0: SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
michael@0: INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
michael@0: CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
michael@0: ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
michael@0: POSSIBILITY OF SUCH DAMAGE.
michael@0: ***********************************************************************/
michael@0: 
michael@0: #ifdef HAVE_CONFIG_H
michael@0: #include "config.h"
michael@0: #endif
michael@0: 
michael@0: #include "SigProc_FIX.h"
michael@0: 
michael@0: /* Copy and multiply a vector by a constant */
michael@0: void silk_scale_copy_vector16(
michael@0:     opus_int16                  *data_out,
michael@0:     const opus_int16            *data_in,
michael@0:     opus_int32                  gain_Q16,           /* I    Gain in Q16                                                 */
michael@0:     const opus_int              dataSize            /* I    Length                                                      */
michael@0: )
michael@0: {
michael@0:     opus_int  i;
michael@0:     opus_int32 tmp32;
michael@0: 
michael@0:     for( i = 0; i < dataSize; i++ ) {
michael@0:         tmp32 = silk_SMULWB( gain_Q16, data_in[ i ] );
michael@0:         data_out[ i ] = (opus_int16)silk_CHECK_FIT16( tmp32 );
michael@0:     }
michael@0: }
michael@0: 
michael@0: /* Multiply a vector by a constant */
michael@0: void silk_scale_vector32_Q26_lshift_18(
michael@0:     opus_int32                  *data1,             /* I/O  Q0/Q18                                                      */
michael@0:     opus_int32                  gain_Q26,           /* I    Q26                                                         */
michael@0:     opus_int                    dataSize            /* I    length                                                      */
michael@0: )
michael@0: {
michael@0:     opus_int  i;
michael@0: 
michael@0:     for( i = 0; i < dataSize; i++ ) {
michael@0:         data1[ i ] = (opus_int32)silk_CHECK_FIT32( silk_RSHIFT64( silk_SMULL( data1[ i ], gain_Q26 ), 8 ) );    /* OUTPUT: Q18 */
michael@0:     }
michael@0: }
michael@0: 
michael@0: /* sum = for(i=0;i<len;i++)inVec1[i]*inVec2[i];      ---        inner product   */
michael@0: /* Note for ARM asm:                                                            */
michael@0: /*        * inVec1 and inVec2 should be at least 2 byte aligned.                */
michael@0: /*        * len should be positive 16bit integer.                               */
michael@0: /*        * only when len>6, memory access can be reduced by half.              */
michael@0: opus_int32 silk_inner_prod_aligned(
michael@0:     const opus_int16 *const     inVec1,             /*    I input vector 1                                              */
michael@0:     const opus_int16 *const     inVec2,             /*    I input vector 2                                              */
michael@0:     const opus_int              len                 /*    I vector lengths                                              */
michael@0: )
michael@0: {
michael@0:     opus_int   i;
michael@0:     opus_int32 sum = 0;
michael@0:     for( i = 0; i < len; i++ ) {
michael@0:         sum = silk_SMLABB( sum, inVec1[ i ], inVec2[ i ] );
michael@0:     }
michael@0:     return sum;
michael@0: }
michael@0: 
michael@0: opus_int64 silk_inner_prod16_aligned_64(
michael@0:     const opus_int16            *inVec1,            /*    I input vector 1                                              */
michael@0:     const opus_int16            *inVec2,            /*    I input vector 2                                              */
michael@0:     const opus_int              len                 /*    I vector lengths                                              */
michael@0: )
michael@0: {
michael@0:     opus_int   i;
michael@0:     opus_int64 sum = 0;
michael@0:     for( i = 0; i < len; i++ ) {
michael@0:         sum = silk_SMLALBB( sum, inVec1[ i ], inVec2[ i ] );
michael@0:     }
michael@0:     return sum;
michael@0: }