Updating Opus to release 1.1

silk/NLSF2A.c

 /***********************************************************************
 Copyright (c) 2006-2011, Skype Limited. All rights reserved.
 Redistribution and use in source and binary forms, with or without
 modification, are permitted provided that the following conditions
 are met:
 - Redistributions of source code must retain the above copyright notice,
 this list of conditions and the following disclaimer.
 - Redistributions in binary form must reproduce the above copyright
 notice, this list of conditions and the following disclaimer in the
 documentation and/or other materials provided with the distribution.
@@ skipping 23 matching lines @@
 /* a piecewise linear approximation maps LSF <-> cos(LSF)       */
 /* therefore the result is not accurate LSFs, but the two       */
 /* functions are accurate inverses of each other                */
 
 #include "SigProc_FIX.h"
 #include "tables.h"
 
 #define QA      16
 
 /* helper function for NLSF2A(..) */
-static inline void silk_NLSF2A_find_poly(
+static OPUS_INLINE void silk_NLSF2A_find_poly(
     opus_int32          *out,      /* O    intermediate polynomial, QA [dd+1]        */
     const opus_int32    *cLSF,     /* I    vector of interleaved 2*cos(LSFs), QA [d] */
     opus_int            dd         /* I    polynomial order (= 1/2 * filter order)   */
 )
 {
     opus_int   k, n;
     opus_int32 ftmp;
 
     out[0] = silk_LSHIFT( 1, QA );
     out[1] = -cLSF[0];
@@ skipping 114 matching lines @@
             silk_bwexpander_32( a32_QA1, d, 65536 - silk_LSHIFT( 2, i ) );
             for( k = 0; k < d; k++ ) {
                 a_Q12[ k ] = (opus_int16)silk_RSHIFT_ROUND( a32_QA1[ k ], QA + 1 - 12 );            /* QA+1 -> Q12 */
             }
         } else {
             break;
         }
     }
 }