mirror of
https://github.com/DrBeef/ioq3quest.git
synced 2024-11-27 22:33:10 +00:00
135 lines
5.8 KiB
C
135 lines
5.8 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.
|
|
***********************************************************************/
|
|
|
|
#ifndef SILK_MACROS_H
|
|
#define SILK_MACROS_H
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
#include "config.h"
|
|
#endif
|
|
|
|
/* This is an inline header file for general platform. */
|
|
|
|
/* (a32 * (opus_int32)((opus_int16)(b32))) >> 16 output have to be 32bit int */
|
|
#define silk_SMULWB(a32, b32) ((((a32) >> 16) * (opus_int32)((opus_int16)(b32))) + ((((a32) & 0x0000FFFF) * (opus_int32)((opus_int16)(b32))) >> 16))
|
|
|
|
/* a32 + (b32 * (opus_int32)((opus_int16)(c32))) >> 16 output have to be 32bit int */
|
|
#define silk_SMLAWB(a32, b32, c32) ((a32) + ((((b32) >> 16) * (opus_int32)((opus_int16)(c32))) + ((((b32) & 0x0000FFFF) * (opus_int32)((opus_int16)(c32))) >> 16)))
|
|
|
|
/* (a32 * (b32 >> 16)) >> 16 */
|
|
#define silk_SMULWT(a32, b32) (((a32) >> 16) * ((b32) >> 16) + ((((a32) & 0x0000FFFF) * ((b32) >> 16)) >> 16))
|
|
|
|
/* a32 + (b32 * (c32 >> 16)) >> 16 */
|
|
#define silk_SMLAWT(a32, b32, c32) ((a32) + (((b32) >> 16) * ((c32) >> 16)) + ((((b32) & 0x0000FFFF) * ((c32) >> 16)) >> 16))
|
|
|
|
/* (opus_int32)((opus_int16)(a3))) * (opus_int32)((opus_int16)(b32)) output have to be 32bit int */
|
|
#define silk_SMULBB(a32, b32) ((opus_int32)((opus_int16)(a32)) * (opus_int32)((opus_int16)(b32)))
|
|
|
|
/* a32 + (opus_int32)((opus_int16)(b32)) * (opus_int32)((opus_int16)(c32)) output have to be 32bit int */
|
|
#define silk_SMLABB(a32, b32, c32) ((a32) + ((opus_int32)((opus_int16)(b32))) * (opus_int32)((opus_int16)(c32)))
|
|
|
|
/* (opus_int32)((opus_int16)(a32)) * (b32 >> 16) */
|
|
#define silk_SMULBT(a32, b32) ((opus_int32)((opus_int16)(a32)) * ((b32) >> 16))
|
|
|
|
/* a32 + (opus_int32)((opus_int16)(b32)) * (c32 >> 16) */
|
|
#define silk_SMLABT(a32, b32, c32) ((a32) + ((opus_int32)((opus_int16)(b32))) * ((c32) >> 16))
|
|
|
|
/* a64 + (b32 * c32) */
|
|
#define silk_SMLAL(a64, b32, c32) (silk_ADD64((a64), ((opus_int64)(b32) * (opus_int64)(c32))))
|
|
|
|
/* (a32 * b32) >> 16 */
|
|
#define silk_SMULWW(a32, b32) silk_MLA(silk_SMULWB((a32), (b32)), (a32), silk_RSHIFT_ROUND((b32), 16))
|
|
|
|
/* a32 + ((b32 * c32) >> 16) */
|
|
#define silk_SMLAWW(a32, b32, c32) silk_MLA(silk_SMLAWB((a32), (b32), (c32)), (b32), silk_RSHIFT_ROUND((c32), 16))
|
|
|
|
/* add/subtract with output saturated */
|
|
#define silk_ADD_SAT32(a, b) ((((opus_uint32)(a) + (opus_uint32)(b)) & 0x80000000) == 0 ? \
|
|
((((a) & (b)) & 0x80000000) != 0 ? silk_int32_MIN : (a)+(b)) : \
|
|
((((a) | (b)) & 0x80000000) == 0 ? silk_int32_MAX : (a)+(b)) )
|
|
|
|
#define silk_SUB_SAT32(a, b) ((((opus_uint32)(a)-(opus_uint32)(b)) & 0x80000000) == 0 ? \
|
|
(( (a) & ((b)^0x80000000) & 0x80000000) ? silk_int32_MIN : (a)-(b)) : \
|
|
((((a)^0x80000000) & (b) & 0x80000000) ? silk_int32_MAX : (a)-(b)) )
|
|
|
|
static inline opus_int32 silk_CLZ16(opus_int16 in16)
|
|
{
|
|
opus_int32 out32 = 0;
|
|
if( in16 == 0 ) {
|
|
return 16;
|
|
}
|
|
/* test nibbles */
|
|
if( in16 & 0xFF00 ) {
|
|
if( in16 & 0xF000 ) {
|
|
in16 >>= 12;
|
|
} else {
|
|
out32 += 4;
|
|
in16 >>= 8;
|
|
}
|
|
} else {
|
|
if( in16 & 0xFFF0 ) {
|
|
out32 += 8;
|
|
in16 >>= 4;
|
|
} else {
|
|
out32 += 12;
|
|
}
|
|
}
|
|
/* test bits and return */
|
|
if( in16 & 0xC ) {
|
|
if( in16 & 0x8 )
|
|
return out32 + 0;
|
|
else
|
|
return out32 + 1;
|
|
} else {
|
|
if( in16 & 0xE )
|
|
return out32 + 2;
|
|
else
|
|
return out32 + 3;
|
|
}
|
|
}
|
|
|
|
static inline opus_int32 silk_CLZ32(opus_int32 in32)
|
|
{
|
|
/* test highest 16 bits and convert to opus_int16 */
|
|
if( in32 & 0xFFFF0000 ) {
|
|
return silk_CLZ16((opus_int16)(in32 >> 16));
|
|
} else {
|
|
return silk_CLZ16((opus_int16)in32) + 16;
|
|
}
|
|
}
|
|
|
|
/* Row based */
|
|
#define matrix_ptr(Matrix_base_adr, row, column, N) *(Matrix_base_adr + ((row)*(N)+(column)))
|
|
#define matrix_adr(Matrix_base_adr, row, column, N) (Matrix_base_adr + ((row)*(N)+(column)))
|
|
|
|
/* Column based */
|
|
#ifndef matrix_c_ptr
|
|
# define matrix_c_ptr(Matrix_base_adr, row, column, M) *(Matrix_base_adr + ((row)+(M)*(column)))
|
|
#endif
|
|
|
|
#endif /* SILK_MACROS_H */
|
|
|