c@289: #ifndef KISS_FFT_H
c@289: #define KISS_FFT_H
c@289: 
c@289: #include <stdlib.h>
c@289: #include <stdio.h>
c@289: #include <math.h>
c@289: #include <memory.h>
c@297: #ifdef __APPLE__
c@297: #include <malloc/malloc.h>
c@297: #else
c@289: #include <malloc.h>
c@297: #endif
c@289: 
c@289: #ifdef __cplusplus
c@289: extern "C" {
c@289: #endif
c@289: 
c@289: #ifdef USE_SIMD
c@289: # include <xmmintrin.h>
c@289: # define kiss_fft_scalar __m128
c@289: #define KISS_FFT_MALLOC(nbytes) memalign(16,nbytes)
c@289: #else	
c@289: #define KISS_FFT_MALLOC malloc
c@289: #endif	
c@289: 
c@289: 
c@289: #ifdef FIXED_POINT
c@289: #include <sys/types.h>	
c@289: # if (FIXED_POINT == 32)
c@289: #  define kiss_fft_scalar int32_t
c@289: # else	
c@289: #  define kiss_fft_scalar int16_t
c@289: # endif
c@289: #else
c@289: # ifndef kiss_fft_scalar
c@289: /*  default is float */
c@289: /* #   define kiss_fft_scalar float */
c@289: /* ... but doubles for QM library ... */
c@289: #define kiss_fft_scalar double
c@289: # endif
c@289: #endif
c@289: 
c@289: typedef struct {
c@289:     kiss_fft_scalar r;
c@289:     kiss_fft_scalar i;
c@289: }kiss_fft_cpx;
c@289: 
c@289: typedef struct kiss_fft_state* kiss_fft_cfg;
c@289: 
c@289: /* 
c@289:  *  kiss_fft_alloc
c@289:  *  
c@289:  *  Initialize a FFT (or IFFT) algorithm's cfg/state buffer.
c@289:  *
c@289:  *  typical usage:      kiss_fft_cfg mycfg=kiss_fft_alloc(1024,0,NULL,NULL);
c@289:  *
c@289:  *  The return value from fft_alloc is a cfg buffer used internally
c@289:  *  by the fft routine or NULL.
c@289:  *
c@289:  *  If lenmem is NULL, then kiss_fft_alloc will allocate a cfg buffer using malloc.
c@289:  *  The returned value should be free()d when done to avoid memory leaks.
c@289:  *  
c@289:  *  The state can be placed in a user supplied buffer 'mem':
c@289:  *  If lenmem is not NULL and mem is not NULL and *lenmem is large enough,
c@289:  *      then the function places the cfg in mem and the size used in *lenmem
c@289:  *      and returns mem.
c@289:  *  
c@289:  *  If lenmem is not NULL and ( mem is NULL or *lenmem is not large enough),
c@289:  *      then the function returns NULL and places the minimum cfg 
c@289:  *      buffer size in *lenmem.
c@289:  * */
c@289: 
c@289: kiss_fft_cfg kiss_fft_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem); 
c@289: 
c@289: /*
c@289:  * kiss_fft(cfg,in_out_buf)
c@289:  *
c@289:  * Perform an FFT on a complex input buffer.
c@289:  * for a forward FFT,
c@289:  * fin should be  f[0] , f[1] , ... ,f[nfft-1]
c@289:  * fout will be   F[0] , F[1] , ... ,F[nfft-1]
c@289:  * Note that each element is complex and can be accessed like
c@289:     f[k].r and f[k].i
c@289:  * */
c@289: void kiss_fft(kiss_fft_cfg cfg,const kiss_fft_cpx *fin,kiss_fft_cpx *fout);
c@289: 
c@289: /*
c@289:  A more generic version of the above function. It reads its input from every Nth sample.
c@289:  * */
c@289: void kiss_fft_stride(kiss_fft_cfg cfg,const kiss_fft_cpx *fin,kiss_fft_cpx *fout,int fin_stride);
c@289: 
c@289: /* If kiss_fft_alloc allocated a buffer, it is one contiguous 
c@289:    buffer and can be simply free()d when no longer needed*/
c@289: #define kiss_fft_free free
c@289: 
c@289: /*
c@289:  Cleans up some memory that gets managed internally. Not necessary to call, but it might clean up 
c@289:  your compiler output to call this before you exit.
c@289: */
c@289: void kiss_fft_cleanup(void);
c@289: 	
c@289: 
c@289: /*
c@289:  * Returns the smallest integer k, such that k>=n and k has only "fast" factors (2,3,5)
c@289:  */
c@289: int kiss_fft_next_fast_size(int n);
c@289: 
c@289: #ifdef __cplusplus
c@289: } 
c@289: #endif
c@289: 
c@289: #endif