[Opus] Update to v1.2.1

third_party/opus/src/silk/fixed/schur_FIX.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 25 matching lines @@
 opus_int32 silk_schur(                              /* O    Returns residual energy                                     */
     opus_int16                  *rc_Q15,            /* O    reflection coefficients [order] Q15                         */
     const opus_int32            *c,                 /* I    correlations [order+1]                                      */
     const opus_int32            order               /* I    prediction order                                            */
 )
 {
     opus_int        k, n, lz;
     opus_int32    C[ SILK_MAX_ORDER_LPC + 1 ][ 2 ];
     opus_int32    Ctmp1, Ctmp2, rc_tmp_Q15;
 
-    silk_assert( order==6||order==8||order==10||order==12||order==14||order==16 );
+    silk_assert( order >= 0 && order <= SILK_MAX_ORDER_LPC );
 
     /* Get number of leading zeros */
     lz = silk_CLZ32( c[ 0 ] );
 
     /* Copy correlations and adjust level to Q30 */
+    k = 0;
     if( lz < 2 ) {
         /* lz must be 1, so shift one to the right */
-        for( k = 0; k < order + 1; k++ ) {
+        do {
             C[ k ][ 0 ] = C[ k ][ 1 ] = silk_RSHIFT( c[ k ], 1 );
-        }
+        } while( ++k <= order );
     } else if( lz > 2 ) {
         /* Shift to the left */
         lz -= 2;
-        for( k = 0; k < order + 1; k++ ) {
+        do {
             C[ k ][ 0 ] = C[ k ][ 1 ] = silk_LSHIFT( c[ k ], lz );
-        }
+        } while( ++k <= order );
     } else {
         /* No need to shift */
-        for( k = 0; k < order + 1; k++ ) {
+        do {
             C[ k ][ 0 ] = C[ k ][ 1 ] = c[ k ];
-        }
+        } while( ++k <= order );
     }
 
     for( k = 0; k < order; k++ ) {
         /* Check that we won't be getting an unstable rc, otherwise stop here. */
         if (silk_abs_int32(C[ k + 1 ][ 0 ]) >= C[ 0 ][ 1 ]) {
            if ( C[ k + 1 ][ 0 ] > 0 ) {
               rc_Q15[ k ] = -SILK_FIX_CONST( .99f, 15 );
            } else {
               rc_Q15[ k ] = SILK_FIX_CONST( .99f, 15 );
            }
@@ skipping 19 matching lines @@
         }
     }
 
     for(; k < order; k++ ) {
        rc_Q15[ k ] = 0;
     }
 
     /* return residual energy */
     return silk_max_32( 1, C[ 0 ][ 1 ] );
 }