annotate src/opus-1.3/silk/encode_pulses.c @ 73:02caadb7509e

Rebuild with --disable-stack-protector for mingw32
author Chris Cannam
date Fri, 25 Jan 2019 14:31:07 +0000
parents 7aeed7906520
children
rev   line source
Chris@69 1 /***********************************************************************
Chris@69 2 Copyright (c) 2006-2011, Skype Limited. All rights reserved.
Chris@69 3 Redistribution and use in source and binary forms, with or without
Chris@69 4 modification, are permitted provided that the following conditions
Chris@69 5 are met:
Chris@69 6 - Redistributions of source code must retain the above copyright notice,
Chris@69 7 this list of conditions and the following disclaimer.
Chris@69 8 - Redistributions in binary form must reproduce the above copyright
Chris@69 9 notice, this list of conditions and the following disclaimer in the
Chris@69 10 documentation and/or other materials provided with the distribution.
Chris@69 11 - Neither the name of Internet Society, IETF or IETF Trust, nor the
Chris@69 12 names of specific contributors, may be used to endorse or promote
Chris@69 13 products derived from this software without specific prior written
Chris@69 14 permission.
Chris@69 15 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
Chris@69 16 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
Chris@69 17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
Chris@69 18 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
Chris@69 19 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
Chris@69 20 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
Chris@69 21 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
Chris@69 22 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
Chris@69 23 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
Chris@69 24 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
Chris@69 25 POSSIBILITY OF SUCH DAMAGE.
Chris@69 26 ***********************************************************************/
Chris@69 27
Chris@69 28 #ifdef HAVE_CONFIG_H
Chris@69 29 #include "config.h"
Chris@69 30 #endif
Chris@69 31
Chris@69 32 #include "main.h"
Chris@69 33 #include "stack_alloc.h"
Chris@69 34
Chris@69 35 /*********************************************/
Chris@69 36 /* Encode quantization indices of excitation */
Chris@69 37 /*********************************************/
Chris@69 38
Chris@69 39 static OPUS_INLINE opus_int combine_and_check( /* return ok */
Chris@69 40 opus_int *pulses_comb, /* O */
Chris@69 41 const opus_int *pulses_in, /* I */
Chris@69 42 opus_int max_pulses, /* I max value for sum of pulses */
Chris@69 43 opus_int len /* I number of output values */
Chris@69 44 )
Chris@69 45 {
Chris@69 46 opus_int k, sum;
Chris@69 47
Chris@69 48 for( k = 0; k < len; k++ ) {
Chris@69 49 sum = pulses_in[ 2 * k ] + pulses_in[ 2 * k + 1 ];
Chris@69 50 if( sum > max_pulses ) {
Chris@69 51 return 1;
Chris@69 52 }
Chris@69 53 pulses_comb[ k ] = sum;
Chris@69 54 }
Chris@69 55
Chris@69 56 return 0;
Chris@69 57 }
Chris@69 58
Chris@69 59 /* Encode quantization indices of excitation */
Chris@69 60 void silk_encode_pulses(
Chris@69 61 ec_enc *psRangeEnc, /* I/O compressor data structure */
Chris@69 62 const opus_int signalType, /* I Signal type */
Chris@69 63 const opus_int quantOffsetType, /* I quantOffsetType */
Chris@69 64 opus_int8 pulses[], /* I quantization indices */
Chris@69 65 const opus_int frame_length /* I Frame length */
Chris@69 66 )
Chris@69 67 {
Chris@69 68 opus_int i, k, j, iter, bit, nLS, scale_down, RateLevelIndex = 0;
Chris@69 69 opus_int32 abs_q, minSumBits_Q5, sumBits_Q5;
Chris@69 70 VARDECL( opus_int, abs_pulses );
Chris@69 71 VARDECL( opus_int, sum_pulses );
Chris@69 72 VARDECL( opus_int, nRshifts );
Chris@69 73 opus_int pulses_comb[ 8 ];
Chris@69 74 opus_int *abs_pulses_ptr;
Chris@69 75 const opus_int8 *pulses_ptr;
Chris@69 76 const opus_uint8 *cdf_ptr;
Chris@69 77 const opus_uint8 *nBits_ptr;
Chris@69 78 SAVE_STACK;
Chris@69 79
Chris@69 80 silk_memset( pulses_comb, 0, 8 * sizeof( opus_int ) ); /* Fixing Valgrind reported problem*/
Chris@69 81
Chris@69 82 /****************************/
Chris@69 83 /* Prepare for shell coding */
Chris@69 84 /****************************/
Chris@69 85 /* Calculate number of shell blocks */
Chris@69 86 silk_assert( 1 << LOG2_SHELL_CODEC_FRAME_LENGTH == SHELL_CODEC_FRAME_LENGTH );
Chris@69 87 iter = silk_RSHIFT( frame_length, LOG2_SHELL_CODEC_FRAME_LENGTH );
Chris@69 88 if( iter * SHELL_CODEC_FRAME_LENGTH < frame_length ) {
Chris@69 89 celt_assert( frame_length == 12 * 10 ); /* Make sure only happens for 10 ms @ 12 kHz */
Chris@69 90 iter++;
Chris@69 91 silk_memset( &pulses[ frame_length ], 0, SHELL_CODEC_FRAME_LENGTH * sizeof(opus_int8));
Chris@69 92 }
Chris@69 93
Chris@69 94 /* Take the absolute value of the pulses */
Chris@69 95 ALLOC( abs_pulses, iter * SHELL_CODEC_FRAME_LENGTH, opus_int );
Chris@69 96 silk_assert( !( SHELL_CODEC_FRAME_LENGTH & 3 ) );
Chris@69 97 for( i = 0; i < iter * SHELL_CODEC_FRAME_LENGTH; i+=4 ) {
Chris@69 98 abs_pulses[i+0] = ( opus_int )silk_abs( pulses[ i + 0 ] );
Chris@69 99 abs_pulses[i+1] = ( opus_int )silk_abs( pulses[ i + 1 ] );
Chris@69 100 abs_pulses[i+2] = ( opus_int )silk_abs( pulses[ i + 2 ] );
Chris@69 101 abs_pulses[i+3] = ( opus_int )silk_abs( pulses[ i + 3 ] );
Chris@69 102 }
Chris@69 103
Chris@69 104 /* Calc sum pulses per shell code frame */
Chris@69 105 ALLOC( sum_pulses, iter, opus_int );
Chris@69 106 ALLOC( nRshifts, iter, opus_int );
Chris@69 107 abs_pulses_ptr = abs_pulses;
Chris@69 108 for( i = 0; i < iter; i++ ) {
Chris@69 109 nRshifts[ i ] = 0;
Chris@69 110
Chris@69 111 while( 1 ) {
Chris@69 112 /* 1+1 -> 2 */
Chris@69 113 scale_down = combine_and_check( pulses_comb, abs_pulses_ptr, silk_max_pulses_table[ 0 ], 8 );
Chris@69 114 /* 2+2 -> 4 */
Chris@69 115 scale_down += combine_and_check( pulses_comb, pulses_comb, silk_max_pulses_table[ 1 ], 4 );
Chris@69 116 /* 4+4 -> 8 */
Chris@69 117 scale_down += combine_and_check( pulses_comb, pulses_comb, silk_max_pulses_table[ 2 ], 2 );
Chris@69 118 /* 8+8 -> 16 */
Chris@69 119 scale_down += combine_and_check( &sum_pulses[ i ], pulses_comb, silk_max_pulses_table[ 3 ], 1 );
Chris@69 120
Chris@69 121 if( scale_down ) {
Chris@69 122 /* We need to downscale the quantization signal */
Chris@69 123 nRshifts[ i ]++;
Chris@69 124 for( k = 0; k < SHELL_CODEC_FRAME_LENGTH; k++ ) {
Chris@69 125 abs_pulses_ptr[ k ] = silk_RSHIFT( abs_pulses_ptr[ k ], 1 );
Chris@69 126 }
Chris@69 127 } else {
Chris@69 128 /* Jump out of while(1) loop and go to next shell coding frame */
Chris@69 129 break;
Chris@69 130 }
Chris@69 131 }
Chris@69 132 abs_pulses_ptr += SHELL_CODEC_FRAME_LENGTH;
Chris@69 133 }
Chris@69 134
Chris@69 135 /**************/
Chris@69 136 /* Rate level */
Chris@69 137 /**************/
Chris@69 138 /* find rate level that leads to fewest bits for coding of pulses per block info */
Chris@69 139 minSumBits_Q5 = silk_int32_MAX;
Chris@69 140 for( k = 0; k < N_RATE_LEVELS - 1; k++ ) {
Chris@69 141 nBits_ptr = silk_pulses_per_block_BITS_Q5[ k ];
Chris@69 142 sumBits_Q5 = silk_rate_levels_BITS_Q5[ signalType >> 1 ][ k ];
Chris@69 143 for( i = 0; i < iter; i++ ) {
Chris@69 144 if( nRshifts[ i ] > 0 ) {
Chris@69 145 sumBits_Q5 += nBits_ptr[ SILK_MAX_PULSES + 1 ];
Chris@69 146 } else {
Chris@69 147 sumBits_Q5 += nBits_ptr[ sum_pulses[ i ] ];
Chris@69 148 }
Chris@69 149 }
Chris@69 150 if( sumBits_Q5 < minSumBits_Q5 ) {
Chris@69 151 minSumBits_Q5 = sumBits_Q5;
Chris@69 152 RateLevelIndex = k;
Chris@69 153 }
Chris@69 154 }
Chris@69 155 ec_enc_icdf( psRangeEnc, RateLevelIndex, silk_rate_levels_iCDF[ signalType >> 1 ], 8 );
Chris@69 156
Chris@69 157 /***************************************************/
Chris@69 158 /* Sum-Weighted-Pulses Encoding */
Chris@69 159 /***************************************************/
Chris@69 160 cdf_ptr = silk_pulses_per_block_iCDF[ RateLevelIndex ];
Chris@69 161 for( i = 0; i < iter; i++ ) {
Chris@69 162 if( nRshifts[ i ] == 0 ) {
Chris@69 163 ec_enc_icdf( psRangeEnc, sum_pulses[ i ], cdf_ptr, 8 );
Chris@69 164 } else {
Chris@69 165 ec_enc_icdf( psRangeEnc, SILK_MAX_PULSES + 1, cdf_ptr, 8 );
Chris@69 166 for( k = 0; k < nRshifts[ i ] - 1; k++ ) {
Chris@69 167 ec_enc_icdf( psRangeEnc, SILK_MAX_PULSES + 1, silk_pulses_per_block_iCDF[ N_RATE_LEVELS - 1 ], 8 );
Chris@69 168 }
Chris@69 169 ec_enc_icdf( psRangeEnc, sum_pulses[ i ], silk_pulses_per_block_iCDF[ N_RATE_LEVELS - 1 ], 8 );
Chris@69 170 }
Chris@69 171 }
Chris@69 172
Chris@69 173 /******************/
Chris@69 174 /* Shell Encoding */
Chris@69 175 /******************/
Chris@69 176 for( i = 0; i < iter; i++ ) {
Chris@69 177 if( sum_pulses[ i ] > 0 ) {
Chris@69 178 silk_shell_encoder( psRangeEnc, &abs_pulses[ i * SHELL_CODEC_FRAME_LENGTH ] );
Chris@69 179 }
Chris@69 180 }
Chris@69 181
Chris@69 182 /****************/
Chris@69 183 /* LSB Encoding */
Chris@69 184 /****************/
Chris@69 185 for( i = 0; i < iter; i++ ) {
Chris@69 186 if( nRshifts[ i ] > 0 ) {
Chris@69 187 pulses_ptr = &pulses[ i * SHELL_CODEC_FRAME_LENGTH ];
Chris@69 188 nLS = nRshifts[ i ] - 1;
Chris@69 189 for( k = 0; k < SHELL_CODEC_FRAME_LENGTH; k++ ) {
Chris@69 190 abs_q = (opus_int8)silk_abs( pulses_ptr[ k ] );
Chris@69 191 for( j = nLS; j > 0; j-- ) {
Chris@69 192 bit = silk_RSHIFT( abs_q, j ) & 1;
Chris@69 193 ec_enc_icdf( psRangeEnc, bit, silk_lsb_iCDF, 8 );
Chris@69 194 }
Chris@69 195 bit = abs_q & 1;
Chris@69 196 ec_enc_icdf( psRangeEnc, bit, silk_lsb_iCDF, 8 );
Chris@69 197 }
Chris@69 198 }
Chris@69 199 }
Chris@69 200
Chris@69 201 /****************/
Chris@69 202 /* Encode signs */
Chris@69 203 /****************/
Chris@69 204 silk_encode_signs( psRangeEnc, pulses, frame_length, signalType, quantOffsetType, sum_pulses );
Chris@69 205 RESTORE_STACK;
Chris@69 206 }