mirror of
https://github.com/DrBeef/ioq3quest.git
synced 2024-11-23 20:42:30 +00:00
99 lines
3.5 KiB
C
99 lines
3.5 KiB
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.
|
|
***********************************************************************/
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
#include "config.h"
|
|
#endif
|
|
|
|
#include "typedef.h"
|
|
#include "pitch_est_defines.h"
|
|
|
|
const opus_int8 silk_CB_lags_stage2_10_ms[ PE_MAX_NB_SUBFR >> 1][ PE_NB_CBKS_STAGE2_10MS ] =
|
|
{
|
|
{0, 1, 0},
|
|
{0, 0, 1}
|
|
};
|
|
|
|
const opus_int8 silk_CB_lags_stage3_10_ms[ PE_MAX_NB_SUBFR >> 1 ][ PE_NB_CBKS_STAGE3_10MS ] =
|
|
{
|
|
{ 0, 0, 1,-1, 1,-1, 2,-2, 2,-2, 3,-3},
|
|
{ 0, 1, 0, 1,-1, 2,-1, 2,-2, 3,-2, 3}
|
|
};
|
|
|
|
const opus_int8 silk_Lag_range_stage3_10_ms[ PE_MAX_NB_SUBFR >> 1 ][ 2 ] =
|
|
{
|
|
{-3, 7},
|
|
{-2, 7}
|
|
};
|
|
|
|
const opus_int8 silk_CB_lags_stage2[ PE_MAX_NB_SUBFR ][ PE_NB_CBKS_STAGE2_EXT ] =
|
|
{
|
|
{0, 2,-1,-1,-1, 0, 0, 1, 1, 0, 1},
|
|
{0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0},
|
|
{0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0},
|
|
{0,-1, 2, 1, 0, 1, 1, 0, 0,-1,-1}
|
|
};
|
|
|
|
const opus_int8 silk_CB_lags_stage3[ PE_MAX_NB_SUBFR ][ PE_NB_CBKS_STAGE3_MAX ] =
|
|
{
|
|
{0, 0, 1,-1, 0, 1,-1, 0,-1, 1,-2, 2,-2,-2, 2,-3, 2, 3,-3,-4, 3,-4, 4, 4,-5, 5,-6,-5, 6,-7, 6, 5, 8,-9},
|
|
{0, 0, 1, 0, 0, 0, 0, 0, 0, 0,-1, 1, 0, 0, 1,-1, 0, 1,-1,-1, 1,-1, 2, 1,-1, 2,-2,-2, 2,-2, 2, 2, 3,-3},
|
|
{0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1,-1, 1, 0, 0, 2, 1,-1, 2,-1,-1, 2,-1, 2, 2,-1, 3,-2,-2,-2, 3},
|
|
{0, 1, 0, 0, 1, 0, 1,-1, 2,-1, 2,-1, 2, 3,-2, 3,-2,-2, 4, 4,-3, 5,-3,-4, 6,-4, 6, 5,-5, 8,-6,-5,-7, 9}
|
|
};
|
|
|
|
const opus_int8 silk_Lag_range_stage3[ SILK_PE_MAX_COMPLEX + 1 ] [ PE_MAX_NB_SUBFR ][ 2 ] =
|
|
{
|
|
/* Lags to search for low number of stage3 cbks */
|
|
{
|
|
{-5,8},
|
|
{-1,6},
|
|
{-1,6},
|
|
{-4,10}
|
|
},
|
|
/* Lags to search for middle number of stage3 cbks */
|
|
{
|
|
{-6,10},
|
|
{-2,6},
|
|
{-1,6},
|
|
{-5,10}
|
|
},
|
|
/* Lags to search for max number of stage3 cbks */
|
|
{
|
|
{-9,12},
|
|
{-3,7},
|
|
{-2,7},
|
|
{-7,13}
|
|
}
|
|
};
|
|
|
|
const opus_int8 silk_nb_cbk_searchs_stage3[ SILK_PE_MAX_COMPLEX + 1 ] =
|
|
{
|
|
PE_NB_CBKS_STAGE3_MIN,
|
|
PE_NB_CBKS_STAGE3_MID,
|
|
PE_NB_CBKS_STAGE3_MAX
|
|
};
|