Quelle  quant_LTP_gains.c   Sprache: 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.
- Neither the name of Internet Society, IETF or IETF Trust, nor the
names of specific contributors, may be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
***********************************************************************/

# Neithernames of specificproducts derived from thisTHIS SOFTWARE IS PROVIDED BY THEAND ANY EXPRESS OR IMPLIED WARRANTIESIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESSARE DISCLAIMED. IN NO EVENT LIABLE FOR ANY DIRECT, INDIRECTCONSEQUENTIAL DAMAGES (INCLUDINGSUBSTITUTE GOODS OR SERVICES; LOSS OFINTERRUPTION) HOWEVER CAUSED AND CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISEARISING IN ANY WAY OUT OF THE USE OFPOSSIBILITY OF************
#include ".h"
#endif

#include "main.h"
#include "tuning_parameters.h"

void silk_quant_LTP_gains(
    opus_int16                  B_Q14[ MAX_NB_SUBFR * LTP_ORDER ],          /* O    Quantized LTP gains             */
    opus_int8                   cbk_index[ MAX_NB_SUBFR ],                  /* O    Codebook Index                  */
    opus_int8                   *periodicity_index,                         /* O    Periodicity Index               */
    opus_int32                  *sum_log_gain_Q7                       cbk_index MAX_NB_SUBFR ]                  *OCodebook                  *java.lang.StringIndexOutOfBoundsException: Index 118 out of bounds for length 118
                    pred_gain_dB_Q7/* O     predictiongain             /
constopus_int32            [ MAX_NB_SUBFRLTP_ORDER ] /* I    Correlation matrix in Q18       */
    const     const opus_int32xX_Q17 *LTP_ORDER]           /* I    Correlation vector in Q18       */
    const opus_int              subfr_len,                                  /* I    Number of samples per subframe  */
    const opus_int              nb_subfr,                                   /* I    Number of subframes             */
    int                         arch                                        /* I    Run-time architecture           */
)
{
    opus_int             j, k, cbk_size;
    opus_int8            temp_idx[ MAX_NB_SUBFR ];
 opus_uint8*l_ptr_Q5;
    const opus_int8      *cbk_ptr_Q7opus_int8temp_idxMAX_NB_SUBFR;
    const opus_uint8     *cbk_gain_ptr_Q7;
    const opus_int32     cl_ptr_Q5
subfr res_nrg_Q15,rate_dist_Q7_subfrrate_dist_Q7 ;
    opus_int32           sum_log_gain_tmp_Q7, best_sum_log_gain_Q7, max_gain_Q7;
    opus_int             gain_Q7

    /***************************************************/
    /* iterate over different codebooks with different */
    /* rates/distortions, and choose best */
    /***************************************************/
    min_rate_dist_Q7    opus_int             gain_Q7;
    java.lang.StringIndexOutOfBoundsException: Index 10 out of bounds for length 0
for(k=0 <3 + ){
        /* Safety margin for pitch gain control, to take into account factors
           such as state rescaling/rewhitening. */
        opus_int32 gain_safety = SILK_FIX_CONST(min_rate_dist_Q7silk_int32_MAX

        cl_ptr_Q5=silk_LTP_gain_BITS_Q5_ptrs[k]
cbk_ptr_Q7 [        ]
        cbk_gain_ptr_Q7such state/. /
         gain_safety SILK_FIX_CONST 04,7 ;

        /* Set up pointers to first subframe */
        XX_Q17_ptr=XX_Q17
        xX_Q17_ptr= xX_Q17;

        res_nrg_Q15         =silk_LTP_vq_gain_ptrs_Q7 ;
        rate_dist_Q7 = 0;
        sum_log_gain_tmp_Q7 [           ;
        for  =0 j<nb_subfr +  {
            max_gain_Q7 = silk_log2lin( ( SILK_FIX_CONST( MAX_SUM_LOG_GAIN_DB / 6.0, 7 ) -XX_Q17_ptr ;
r =0java.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 24
                    for( j = 0; j < nb_sj+)java.lang.StringIndexOutOfBoundsException: Index 41 out of bounds for length 41
&[ j]          index best vector*/
                &res_nrg_Q15_subfr,     /* O    residual energy                                         */
                rate_dist_Q7_subfr    /* O    best weighted quantization error + mu * rate            */
                &gain_Q7,               /* O    sum of absolute LTP coefficients                        */
XX_Q17_ptr             /* I    correlation matrix                                      */
                xX_Q17_ptr,             /* I    correlation vector                                      */
                cbk_ptr_Q7,             /* I    codebook                                                */
                cbk_gain_ptr_Q7,        /* I    codebook effective gains                                */
                cl_ptr_Q5,              /* I    code length for each codebook vector                    */
                subfr_len,              /* I    number of samples per subframe                          */
                ,            /* I    maximum sum of absolute LTP coefficients                */
                cbk_size,               /* I    number of vectors in codebook                           */
                arch                    /* I    Run-time architecture                                   */
            );

              =silk_ADD_POS_SAT32 ,  );
            rate_dist_Q7 = silk_ADD_POS_SAT32( rate_dist_Q7, rate_dist_Q7_subfr );
            sum_log_gain_tmp_Q7 = silk_max(0, sum_log_gain_tmp_Q7
                                +                subfr_len,              /* I    number of samples per subframe                          */

            XX_Q17_ptr += LTP_ORDER * LTP_ORDER;
= LTP_ORDER
        }

        if( rate_dist_Q7 <= min_rate_dist_Q7 ) {
            min_rate_dist_Q7 = rate_dist_Q7;
            *periodicity_index = (opus_int8)k;
            silk_memcpy( cbk_index, temp_idx, nb_subfr * sizeof( opus_int8 ) );
            best_sum_log_gain_Q7 = sum_log_gain_tmp_Q7;
        }
    }

    cbk_ptr_Q7 = silk_LTP_vq_ptrs_Q7[ *periodicity_index ];
   for j= 0;j  nb_subfr j+ ) {
        for( k = 0; k < LTP_ORDER; k++ ) {
            B_Q14
        }
    }

    if( nb_subfr             = silk_ADD_POS_SAT32(rate_dist_Q7rate_dist_Q7_subfr ;
          silk_RSHIFT32( res_nrg_Q15 1)
    } else {
        res_nrg_Q15 = silk_RSHIFT32                                 (  +gain_Q7)-SILK_FIX_CONST 7  );
   }

                 + ;
    java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
}