summaryrefslogtreecommitdiff
path: root/gr-vocoder/lib/codec2/kiss_fft.c
diff options
context:
space:
mode:
Diffstat (limited to 'gr-vocoder/lib/codec2/kiss_fft.c')
-rw-r--r--gr-vocoder/lib/codec2/kiss_fft.c20
1 files changed, 10 insertions, 10 deletions
diff --git a/gr-vocoder/lib/codec2/kiss_fft.c b/gr-vocoder/lib/codec2/kiss_fft.c
index 465d6c97a..17b4e7211 100644
--- a/gr-vocoder/lib/codec2/kiss_fft.c
+++ b/gr-vocoder/lib/codec2/kiss_fft.c
@@ -250,7 +250,7 @@ void kf_work(
const kiss_fft_cpx * Fout_end = Fout + p*m;
#ifdef _OPENMP
- // use openmp extensions at the
+ // use openmp extensions at the
// top-level (not recursive)
if (fstride==1 && p<=5)
{
@@ -258,15 +258,15 @@ void kf_work(
// execute the p different work units in different threads
# pragma omp parallel for
- for (k=0;k<p;++k)
+ for (k=0;k<p;++k)
kf_work( Fout +k*m, f+ fstride*in_stride*k,fstride*p,in_stride,factors,st);
// all threads have joined by this point
switch (p) {
case 2: kf_bfly2(Fout,fstride,st,m); break;
- case 3: kf_bfly3(Fout,fstride,st,m); break;
+ case 3: kf_bfly3(Fout,fstride,st,m); break;
case 4: kf_bfly4(Fout,fstride,st,m); break;
- case 5: kf_bfly5(Fout,fstride,st,m); break;
+ case 5: kf_bfly5(Fout,fstride,st,m); break;
default: kf_bfly_generic(Fout,fstride,st,m,p); break;
}
return;
@@ -282,7 +282,7 @@ void kf_work(
do{
// recursive call:
// DFT of size m*p performed by doing
- // p instances of smaller DFTs of size m,
+ // p instances of smaller DFTs of size m,
// each one takes a decimated version of the input
kf_work( Fout , f, fstride*p, in_stride, factors,st);
f += fstride*in_stride;
@@ -291,21 +291,21 @@ void kf_work(
Fout=Fout_beg;
- // recombine the p smaller DFTs
+ // recombine the p smaller DFTs
switch (p) {
case 2: kf_bfly2(Fout,fstride,st,m); break;
- case 3: kf_bfly3(Fout,fstride,st,m); break;
+ case 3: kf_bfly3(Fout,fstride,st,m); break;
case 4: kf_bfly4(Fout,fstride,st,m); break;
- case 5: kf_bfly5(Fout,fstride,st,m); break;
+ case 5: kf_bfly5(Fout,fstride,st,m); break;
default: kf_bfly_generic(Fout,fstride,st,m,p); break;
}
}
/* facbuf is populated by p1,m1,p2,m2, ...
- where
+ where
p[i] * m[i] = m[i-1]
m0 = n */
-static
+static
void kf_factor(int n,int * facbuf)
{
int p=4;