eden-emu/opus
15
0
Fork 0
mirror of https://github.com/xiph/opus.git synced 2025-06-07 07:50:51 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 4

Supporting large prime factors in the FFT

Browse source
This commit is contained in:
Jean-Marc Valin 2008-09-27 22:14:18 -04:00
parent 23e654ff82
commit f02c9bac3a
1 changed files with 5 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

15
libcelt/kiss_fft.c
View file

@ -25,6 +25,7 @@ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
#include "arch.h" #include "arch.h"
#include "os_support.h" #include "os_support.h"
#include "mathops.h" #include "mathops.h"
#include "stack_alloc.h"
/* The guts header contains all the multiplication and addition macros that are defined for /* The guts header contains all the multiplication and addition macros that are defined for
complex numbers. It also delares the kf_ internal functions. complex numbers. It also delares the kf_ internal functions.
@ -409,13 +410,10 @@ static void kf_bfly_generic(
int u,k,q1,q; int u,k,q1,q;
kiss_twiddle_cpx * twiddles = st->twiddles; kiss_twiddle_cpx * twiddles = st->twiddles;
kiss_fft_cpx t; kiss_fft_cpx t;
kiss_fft_cpx scratchbuf[17]; VARDECL(kiss_fft_cpx, scratchbuf);
int Norig = st->nfft; int Norig = st->nfft;
ALLOC(scratchbuf, p, kiss_fft_cpx);
/*CHECKBUF(scratchbuf,nscratchbuf,p);*/
if (p>17)
celt_fatal("KissFFT: max radix supported is 17");
for ( u=0; u<m; ++u ) { for ( u=0; u<m; ++u ) {
k=u; k=u;
for ( q1=0 ; q1<p ; ++q1 ) { for ( q1=0 ; q1<p ; ++q1 ) {
@ -450,13 +448,10 @@ static void ki_bfly_generic(
int u,k,q1,q; int u,k,q1,q;
kiss_twiddle_cpx * twiddles = st->twiddles; kiss_twiddle_cpx * twiddles = st->twiddles;
kiss_fft_cpx t; kiss_fft_cpx t;
kiss_fft_cpx scratchbuf[17]; VARDECL(kiss_fft_cpx, scratchbuf);
int Norig = st->nfft; int Norig = st->nfft;
ALLOC(scratchbuf, p, kiss_fft_cpx);
/*CHECKBUF(scratchbuf,nscratchbuf,p);*/
if (p>17)
celt_fatal("KissFFT: max radix supported is 17");
for ( u=0; u<m; ++u ) { for ( u=0; u<m; ++u ) {
k=u; k=u;
for ( q1=0 ; q1<p ; ++q1 ) { for ( q1=0 ; q1<p ; ++q1 ) {