1*a58d3d2aSXin Li /***********************************************************************
2*a58d3d2aSXin Li Copyright (c) 2006-2011, Skype Limited. All rights reserved.
3*a58d3d2aSXin Li Redistribution and use in source and binary forms, with or without
4*a58d3d2aSXin Li modification, are permitted provided that the following conditions
5*a58d3d2aSXin Li are met:
6*a58d3d2aSXin Li - Redistributions of source code must retain the above copyright notice,
7*a58d3d2aSXin Li this list of conditions and the following disclaimer.
8*a58d3d2aSXin Li - Redistributions in binary form must reproduce the above copyright
9*a58d3d2aSXin Li notice, this list of conditions and the following disclaimer in the
10*a58d3d2aSXin Li documentation and/or other materials provided with the distribution.
11*a58d3d2aSXin Li - Neither the name of Internet Society, IETF or IETF Trust, nor the
12*a58d3d2aSXin Li names of specific contributors, may be used to endorse or promote
13*a58d3d2aSXin Li products derived from this software without specific prior written
14*a58d3d2aSXin Li permission.
15*a58d3d2aSXin Li THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
16*a58d3d2aSXin Li AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17*a58d3d2aSXin Li IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18*a58d3d2aSXin Li ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
19*a58d3d2aSXin Li LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
20*a58d3d2aSXin Li CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
21*a58d3d2aSXin Li SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
22*a58d3d2aSXin Li INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
23*a58d3d2aSXin Li CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
24*a58d3d2aSXin Li ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
25*a58d3d2aSXin Li POSSIBILITY OF SUCH DAMAGE.
26*a58d3d2aSXin Li ***********************************************************************/
27*a58d3d2aSXin Li
28*a58d3d2aSXin Li #ifdef HAVE_CONFIG_H
29*a58d3d2aSXin Li #include "config.h"
30*a58d3d2aSXin Li #endif
31*a58d3d2aSXin Li
32*a58d3d2aSXin Li #include "main.h"
33*a58d3d2aSXin Li
34*a58d3d2aSXin Li /* Interpolate two vectors */
silk_interpolate(opus_int16 xi[MAX_LPC_ORDER],const opus_int16 x0[MAX_LPC_ORDER],const opus_int16 x1[MAX_LPC_ORDER],const opus_int ifact_Q2,const opus_int d)35*a58d3d2aSXin Li void silk_interpolate(
36*a58d3d2aSXin Li opus_int16 xi[ MAX_LPC_ORDER ], /* O interpolated vector */
37*a58d3d2aSXin Li const opus_int16 x0[ MAX_LPC_ORDER ], /* I first vector */
38*a58d3d2aSXin Li const opus_int16 x1[ MAX_LPC_ORDER ], /* I second vector */
39*a58d3d2aSXin Li const opus_int ifact_Q2, /* I interp. factor, weight on 2nd vector */
40*a58d3d2aSXin Li const opus_int d /* I number of parameters */
41*a58d3d2aSXin Li )
42*a58d3d2aSXin Li {
43*a58d3d2aSXin Li opus_int i;
44*a58d3d2aSXin Li
45*a58d3d2aSXin Li celt_assert( ifact_Q2 >= 0 );
46*a58d3d2aSXin Li celt_assert( ifact_Q2 <= 4 );
47*a58d3d2aSXin Li
48*a58d3d2aSXin Li for( i = 0; i < d; i++ ) {
49*a58d3d2aSXin Li xi[ i ] = (opus_int16)silk_ADD_RSHIFT( x0[ i ], silk_SMULBB( x1[ i ] - x0[ i ], ifact_Q2 ), 2 );
50*a58d3d2aSXin Li }
51*a58d3d2aSXin Li }
52