Mercurial > libavcodec.hg
changeset 8636:9766c268bc9f libavcodec
Clean up FFT related comments.
| author | alexc |
|---|---|
| date | Thu, 22 Jan 2009 19:46:23 +0000 |
| parents | 6b164adb1907 |
| children | 3f72756b0c5c |
| files | dsputil.h fft.c |
| diffstat | 2 files changed, 12 insertions(+), 12 deletions(-) [+] |
line wrap: on
line diff
--- a/dsputil.h Thu Jan 22 00:31:26 2009 +0000 +++ b/dsputil.h Thu Jan 22 19:46:23 2009 +0000 @@ -674,6 +674,11 @@ void (*imdct_half)(struct MDCTContext *s, FFTSample *output, const FFTSample *input); } FFTContext; +/** + * Sets up a complex FFT. + * @param nbits log2 of the length of the input array + * @param inverse if 0 perform the forward transform, if 1 perform the inverse + */ int ff_fft_init(FFTContext *s, int nbits, int inverse); void ff_fft_permute_c(FFTContext *s, FFTComplex *z); void ff_fft_permute_sse(FFTContext *s, FFTComplex *z); @@ -683,10 +688,17 @@ void ff_fft_calc_3dn2(FFTContext *s, FFTComplex *z); void ff_fft_calc_altivec(FFTContext *s, FFTComplex *z); +/** + * Do the permutation needed BEFORE calling ff_fft_calc(). + */ static inline void ff_fft_permute(FFTContext *s, FFTComplex *z) { s->fft_permute(s, z); } +/** + * Do a complex FFT with the parameters defined in ff_fft_init(). The + * input data must be permuted before. No 1.0/sqrt(n) normalization is done. + */ static inline void ff_fft_calc(FFTContext *s, FFTComplex *z) { s->fft_calc(s, z);
--- a/fft.c Thu Jan 22 00:31:26 2009 +0000 +++ b/fft.c Thu Jan 22 19:46:23 2009 +0000 @@ -58,10 +58,6 @@ else return split_radix_permutation(i, m, inverse)*4 - 1; } -/** - * The size of the FFT is 2^nbits. If inverse is TRUE, inverse FFT is - * done - */ int ff_fft_init(FFTContext *s, int nbits, int inverse) { int i, j, m, n; @@ -185,9 +181,6 @@ return -1; } -/** - * Do the permutation needed BEFORE calling ff_fft_calc() - */ void ff_fft_permute_c(FFTContext *s, FFTComplex *z) { int j, k, np; @@ -374,11 +367,6 @@ fft2048, fft4096, fft8192, fft16384, fft32768, fft65536, }; -/** - * Do a complex FFT with the parameters defined in ff_fft_init(). The - * input data must be permuted before with s->revtab table. No - * 1.0/sqrt(n) normalization is done. - */ void ff_fft_calc_c(FFTContext *s, FFTComplex *z) { fft_dispatch[s->nbits-2](z);