annotate ext/kissfft/tools/kiss_fftr.h @ 515:08bcc06c38ec tip master

Remove fast-math
author Chris Cannam <cannam@all-day-breakfast.com>
date Tue, 28 Jan 2020 15:27:37 +0000
parents 1f1999b0f577
children
rev   line source
c@409 1 #ifndef KISS_FTR_H
c@409 2 #define KISS_FTR_H
c@409 3
c@409 4 #include "kiss_fft.h"
c@409 5 #ifdef __cplusplus
c@409 6 extern "C" {
c@409 7 #endif
c@409 8
c@409 9
c@409 10 /*
c@409 11
c@409 12 Real optimized version can save about 45% cpu time vs. complex fft of a real seq.
c@409 13
c@409 14
c@409 15
c@409 16 */
c@409 17
c@409 18 typedef struct kiss_fftr_state *kiss_fftr_cfg;
c@409 19
c@409 20
c@409 21 kiss_fftr_cfg kiss_fftr_alloc(int nfft,int inverse_fft,void * mem, size_t * lenmem);
c@409 22 /*
c@409 23 nfft must be even
c@409 24
c@409 25 If you don't care to allocate space, use mem = lenmem = NULL
c@409 26 */
c@409 27
c@409 28
c@409 29 void kiss_fftr(kiss_fftr_cfg cfg,const kiss_fft_scalar *timedata,kiss_fft_cpx *freqdata);
c@409 30 /*
c@409 31 input timedata has nfft scalar points
c@409 32 output freqdata has nfft/2+1 complex points
c@409 33 */
c@409 34
c@409 35 void kiss_fftri(kiss_fftr_cfg cfg,const kiss_fft_cpx *freqdata,kiss_fft_scalar *timedata);
c@409 36 /*
c@409 37 input freqdata has nfft/2+1 complex points
c@409 38 output timedata has nfft scalar points
c@409 39 */
c@409 40
c@409 41 #define kiss_fftr_free free
c@409 42
c@409 43 #ifdef __cplusplus
c@409 44 }
c@409 45 #endif
c@409 46 #endif