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