Mercurial > hg > sv-dependency-builds

annotate src/opus-1.3/silk/code_signs.c @ 83:ae30d91d2ffe

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Replace these with versions built using an older toolset (so as to avoid ABI compatibilities when linking on Ubuntu 14.04 for packaging purposes)
author Chris Cannam
date Fri, 07 Feb 2020 11:51:13 +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
Chris@69 34 /*#define silk_enc_map(a) ((a) > 0 ? 1 : 0)*/
Chris@69 35 /*#define silk_dec_map(a) ((a) > 0 ? 1 : -1)*/
Chris@69 36 /* shifting avoids if-statement */
Chris@69 37 #define silk_enc_map(a) ( silk_RSHIFT( (a), 15 ) + 1 )
Chris@69 38 #define silk_dec_map(a) ( silk_LSHIFT( (a), 1 ) - 1 )
Chris@69 39
Chris@69 40 /* Encodes signs of excitation */
Chris@69 41 void silk_encode_signs(
Chris@69 42 ec_enc *psRangeEnc, /* I/O Compressor data structure */
Chris@69 43 const opus_int8 pulses[], /* I pulse signal */
Chris@69 44 opus_int length, /* I length of input */
Chris@69 45 const opus_int signalType, /* I Signal type */
Chris@69 46 const opus_int quantOffsetType, /* I Quantization offset type */
Chris@69 47 const opus_int sum_pulses[ MAX_NB_SHELL_BLOCKS ] /* I Sum of absolute pulses per block */
Chris@69 48 )
Chris@69 49 {
Chris@69 50 opus_int i, j, p;
Chris@69 51 opus_uint8 icdf[ 2 ];
Chris@69 52 const opus_int8 *q_ptr;
Chris@69 53 const opus_uint8 *icdf_ptr;
Chris@69 54
Chris@69 55 icdf[ 1 ] = 0;
Chris@69 56 q_ptr = pulses;
Chris@69 57 i = silk_SMULBB( 7, silk_ADD_LSHIFT( quantOffsetType, signalType, 1 ) );
Chris@69 58 icdf_ptr = &silk_sign_iCDF[ i ];
Chris@69 59 length = silk_RSHIFT( length + SHELL_CODEC_FRAME_LENGTH/2, LOG2_SHELL_CODEC_FRAME_LENGTH );
Chris@69 60 for( i = 0; i < length; i++ ) {
Chris@69 61 p = sum_pulses[ i ];
Chris@69 62 if( p > 0 ) {
Chris@69 63 icdf[ 0 ] = icdf_ptr[ silk_min( p & 0x1F, 6 ) ];
Chris@69 64 for( j = 0; j < SHELL_CODEC_FRAME_LENGTH; j++ ) {
Chris@69 65 if( q_ptr[ j ] != 0 ) {
Chris@69 66 ec_enc_icdf( psRangeEnc, silk_enc_map( q_ptr[ j ]), icdf, 8 );
Chris@69 67 }
Chris@69 68 }
Chris@69 69 }
Chris@69 70 q_ptr += SHELL_CODEC_FRAME_LENGTH;
Chris@69 71 }
Chris@69 72 }
Chris@69 73
Chris@69 74 /* Decodes signs of excitation */
Chris@69 75 void silk_decode_signs(
Chris@69 76 ec_dec *psRangeDec, /* I/O Compressor data structure */
Chris@69 77 opus_int16 pulses[], /* I/O pulse signal */
Chris@69 78 opus_int length, /* I length of input */
Chris@69 79 const opus_int signalType, /* I Signal type */
Chris@69 80 const opus_int quantOffsetType, /* I Quantization offset type */
Chris@69 81 const opus_int sum_pulses[ MAX_NB_SHELL_BLOCKS ] /* I Sum of absolute pulses per block */
Chris@69 82 )
Chris@69 83 {
Chris@69 84 opus_int i, j, p;
Chris@69 85 opus_uint8 icdf[ 2 ];
Chris@69 86 opus_int16 *q_ptr;
Chris@69 87 const opus_uint8 *icdf_ptr;
Chris@69 88
Chris@69 89 icdf[ 1 ] = 0;
Chris@69 90 q_ptr = pulses;
Chris@69 91 i = silk_SMULBB( 7, silk_ADD_LSHIFT( quantOffsetType, signalType, 1 ) );
Chris@69 92 icdf_ptr = &silk_sign_iCDF[ i ];
Chris@69 93 length = silk_RSHIFT( length + SHELL_CODEC_FRAME_LENGTH/2, LOG2_SHELL_CODEC_FRAME_LENGTH );
Chris@69 94 for( i = 0; i < length; i++ ) {
Chris@69 95 p = sum_pulses[ i ];
Chris@69 96 if( p > 0 ) {
Chris@69 97 icdf[ 0 ] = icdf_ptr[ silk_min( p & 0x1F, 6 ) ];
Chris@69 98 for( j = 0; j < SHELL_CODEC_FRAME_LENGTH; j++ ) {
Chris@69 99 if( q_ptr[ j ] > 0 ) {
Chris@69 100 /* attach sign */
Chris@69 101 #if 0
Chris@69 102 /* conditional implementation */
Chris@69 103 if( ec_dec_icdf( psRangeDec, icdf, 8 ) == 0 ) {
Chris@69 104 q_ptr[ j ] = -q_ptr[ j ];
Chris@69 105 }
Chris@69 106 #else
Chris@69 107 /* implementation with shift, subtraction, multiplication */
Chris@69 108 q_ptr[ j ] *= silk_dec_map( ec_dec_icdf( psRangeDec, icdf, 8 ) );
Chris@69 109 #endif
Chris@69 110 }
Chris@69 111 }
Chris@69 112 }
Chris@69 113 q_ptr += SHELL_CODEC_FRAME_LENGTH;
Chris@69 114 }
Chris@69 115 }