~noskcaj/ubuntu/saucy/sflphone/merge-1.2.3-2

* 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 author nor the names of any 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.

#define MIN(a,b) ((a)<(b) ? (a):(b))

#define MAX(a,b) ((a)>(b) ? (a):(b))

/* kiss_fft.h

defines kiss_fft_scalar as either short or a float type

and defines

typedef struct { kiss_fft_scalar r; kiss_fft_scalar i; }kiss_fft_cpx; */

#include "kiss_fft.h"

#include "math_approx.h"

#define MAXFACTORS 32

/* e.g. an fft of length 128 has 4 factors

as far as kissfft is concerned

4*4*4*2

struct kiss_fft_state{

int nfft;

int inverse;

int factors[2*MAXFACTORS];

kiss_fft_cpx twiddles[1];

};

Explanation of macros dealing with complex math:

C_MUL(m,a,b) : m = a*b

C_FIXDIV( c , div ) : if a fixed point impl., c /= div. noop otherwise

C_SUB( res, a,b) : res = a - b

C_SUBFROM( res , a) : res -= a

C_ADDTO( res , a) : res += a

* */

#ifdef FIXED_POINT

#include "arch.h"

# define FRACBITS 15

# define SAMPPROD spx_int32_t

#define SAMP_MAX 32767

#define SAMP_MIN -SAMP_MAX

#if defined(CHECK_OVERFLOW)

# define CHECK_OVERFLOW_OP(a,op,b) \

if ( (SAMPPROD)(a) op (SAMPPROD)(b) > SAMP_MAX || (SAMPPROD)(a) op (SAMPPROD)(b) < SAMP_MIN ) { \

fprintf(stderr,"WARNING:overflow @ " __FILE__ "(%d): (%d " #op" %d) = %ld\n",__LINE__,(a),(b),(SAMPPROD)(a) op (SAMPPROD)(b) ); }

#endif

# define smul(a,b) ( (SAMPPROD)(a)*(b) )

# define sround( x ) (kiss_fft_scalar)( ( (x) + (1<<(FRACBITS-1)) ) >> FRACBITS )

# define S_MUL(a,b) sround( smul(a,b) )

# define C_MUL(m,a,b) \

do{ (m).r = sround( smul((a).r,(b).r) - smul((a).i,(b).i) ); \

(m).i = sround( smul((a).r,(b).i) + smul((a).i,(b).r) ); }while(0)

# define C_MUL4(m,a,b) \

do{ (m).r = PSHR32( smul((a).r,(b).r) - smul((a).i,(b).i),17 ); \

(m).i = PSHR32( smul((a).r,(b).i) + smul((a).i,(b).r),17 ); }while(0)

# define DIVSCALAR(x,k) \

(x) = sround( smul( x, SAMP_MAX/k ) )

# define C_FIXDIV(c,div) \

do { DIVSCALAR( (c).r , div); \

DIVSCALAR( (c).i , div); }while (0)

# define C_MULBYSCALAR( c, s ) \

do{ (c).r = sround( smul( (c).r , s ) ) ;\

(c).i = sround( smul( (c).i , s ) ) ; }while(0)

#else /* not FIXED_POINT*/

# define S_MUL(a,b) ( (a)*(b) )

#define C_MUL(m,a,b) \

do{ (m).r = (a).r*(b).r - (a).i*(b).i;\

(m).i = (a).r*(b).i + (a).i*(b).r; }while(0)

#define C_MUL4(m,a,b) C_MUL(m,a,b)

# define C_FIXDIV(c,div) /* NOOP */

# define C_MULBYSCALAR( c, s ) \

do{ (c).r *= (s);\

(c).i *= (s); }while(0)

#endif

100

101

#ifndef CHECK_OVERFLOW_OP

102

# define CHECK_OVERFLOW_OP(a,op,b) /* noop */

103

#endif

104

105

#define C_ADD( res, a,b)\

106

do { \

107

CHECK_OVERFLOW_OP((a).r,+,(b).r)\

108

CHECK_OVERFLOW_OP((a).i,+,(b).i)\

109

(res).r=(a).r+(b).r; (res).i=(a).i+(b).i; \

110

}while(0)

111

#define C_SUB( res, a,b)\

112

do { \

113

CHECK_OVERFLOW_OP((a).r,-,(b).r)\

114

CHECK_OVERFLOW_OP((a).i,-,(b).i)\

115

(res).r=(a).r-(b).r; (res).i=(a).i-(b).i; \

116

}while(0)

117

#define C_ADDTO( res , a)\

118

do { \

119

CHECK_OVERFLOW_OP((res).r,+,(a).r)\

120

CHECK_OVERFLOW_OP((res).i,+,(a).i)\

121

(res).r += (a).r; (res).i += (a).i;\

122

}while(0)

123

124

#define C_SUBFROM( res , a)\

125

do {\

126

CHECK_OVERFLOW_OP((res).r,-,(a).r)\

127

CHECK_OVERFLOW_OP((res).i,-,(a).i)\

128

(res).r -= (a).r; (res).i -= (a).i; \

129

}while(0)

130

131

132

#ifdef FIXED_POINT

133

# define KISS_FFT_COS(phase) floor(MIN(32767,MAX(-32767,.5+32768 * cos (phase))))

134

# define KISS_FFT_SIN(phase) floor(MIN(32767,MAX(-32767,.5+32768 * sin (phase))))

135

# define HALF_OF(x) ((x)>>1)

136

#elif defined(USE_SIMD)

137

# define KISS_FFT_COS(phase) _mm_set1_ps( cos(phase) )

138

# define KISS_FFT_SIN(phase) _mm_set1_ps( sin(phase) )

139

# define HALF_OF(x) ((x)*_mm_set1_ps(.5))

140

#else

141

# define KISS_FFT_COS(phase) (kiss_fft_scalar) cos(phase)

142

# define KISS_FFT_SIN(phase) (kiss_fft_scalar) sin(phase)

143

# define HALF_OF(x) ((x)*.5)

144

#endif

145

146

#define kf_cexp(x,phase) \

147

do{ \

148

(x)->r = KISS_FFT_COS(phase);\

149

(x)->i = KISS_FFT_SIN(phase);\

150

}while(0)

151

#define kf_cexp2(x,phase) \

152

do{ \

153

(x)->r = spx_cos_norm((phase));\

154

(x)->i = spx_cos_norm((phase)-32768);\

155

}while(0)

156

157

158

/* a debugging function */

159

#define pcpx(c)\

160

fprintf(stderr,"%g + %gi\n",(double)((c)->r),(double)((c)->i) )

Older »