---
include/fft.h | 4 +-
src/libfft/CMakeLists.txt | 27 ------
src/libfft/Makefile.am | 74 +---------------
src/libfft/ditsplitc.c | 212 ---------------------------------------------
src/libfft/fftc.c | 65 --------------
src/libfft/ifftc.c | 62 -------------
src/libfft/splitditc.c | 192 ----------------------------------------
7 files changed, 3 insertions(+), 633 deletions(-)
delete mode 100644 src/libfft/ditsplitc.c
delete mode 100644 src/libfft/fftc.c
delete mode 100644 src/libfft/ifftc.c
delete mode 100644 src/libfft/splitditc.c
diff --git a/include/fft.h b/include/fft.h
index f6d2faf..225e93d 100644
--- a/include/fft.h
+++ b/include/fft.h
@@ -54,15 +54,13 @@ typedef struct {
double im; /* Imaginary Part */
} COMPLEX;
-FFT_EXPORT extern void splitdit(int N, int M);
-FFT_EXPORT extern void ditsplit(int n /* length */, int m /* n = 2^m */);
-FFT_EXPORT extern void cdiv(COMPLEX *result, COMPLEX *val1, COMPLEX *val2);
FFT_EXPORT extern void rfft(double *x, int n);
FFT_EXPORT extern void irfft(double *x, int n);
FFT_EXPORT extern void cfft(fftw_complex *dat, int num);
FFT_EXPORT extern void icfft(fftw_complex *dat, int num);
+FFT_EXPORT extern void cdiv(COMPLEX *result, COMPLEX *val1, COMPLEX *val2);
/*
* Local Variables:
diff --git a/src/libfft/CMakeLists.txt b/src/libfft/CMakeLists.txt
index 6a8d178..de1451e 100644
--- a/src/libfft/CMakeLists.txt
+++ b/src/libfft/CMakeLists.txt
@@ -2,33 +2,6 @@ include_directories(
${CMAKE_CURRENT_SOURCE_DIR}
)
-ADD_EXECUTABLE(fftc fftc.c splitditc.c)
-target_link_libraries(fftc ${M_LIBRARY})
-
-ADD_EXECUTABLE(ifftc ifftc.c ditsplitc.c)
-target_link_libraries(ifftc ${M_LIBRARY})
-
-# 512 and 1024 are tough in optimized compiles, don't
-# go that high until there's a demonstrated need. Only
-# use in BRL-CAD right now is 256.
-SET(FFT_NUMLIST "16;32;64;128;256")
-SET(FFT_GEN_SRCS "")
-
-FOREACH(filenum ${FFT_NUMLIST})
- ADD_CUSTOM_COMMAND(
- OUTPUT rfft${filenum}.c
- COMMAND fftc ${filenum} > ${CMAKE_CURRENT_BINARY_DIR}/rfft${filenum}.c
- DEPENDS fftc
- )
- SET(FFT_GEN_SRCS "${FFT_GEN_SRCS};rfft${filenum}.c")
- ADD_CUSTOM_COMMAND(
- OUTPUT irfft${filenum}.c
- COMMAND ifftc ${filenum} > ${CMAKE_CURRENT_BINARY_DIR}/irfft${filenum}.c
- DEPENDS ifftc
- )
- SET(FFT_GEN_SRCS "${FFT_GEN_SRCS};irfft${filenum}.c")
-ENDFOREACH(filenum ${FFT_NUMLIST})
-
SET(LIBFFT_SRCS
fftfast.c
splitdit.c
diff --git a/src/libfft/Makefile.am b/src/libfft/Makefile.am
index 672892f..74b85b2 100644
--- a/src/libfft/Makefile.am
+++ b/src/libfft/Makefile.am
@@ -1,10 +1,7 @@
-
lib_LTLIBRARIES = libfft.la
noinst_PROGRAMS = \
- fftc \
- fftest \
- ifftc
+ fftest
SRCS = \
fftfast.c \
@@ -12,8 +9,7 @@ SRCS = \
ditsplit.c
libfft_la_SOURCES = \
- $(SRCS) \
- $(BUILT_SOURCES)
+ $(SRCS)
libfft_la_LDFLAGS = -version-info 19:1 -no-undefined
libfft_la_LIBADD = \
@@ -21,73 +17,9 @@ libfft_la_LIBADD = \
AM_CFLAGS = ${STRICT_FLAGS}
-fftc_LDADD = ${LIBM}
-fftc_SOURCES = \
- fftc.c \
- splitditc.c
-
fftest_LDADD = libfft.la ${LIBM}
fftest_SOURCES = fftest.c
-ifftc_LDADD = ${LIBM}
-ifftc_SOURCES = \
- ditsplitc.c \
- ifftc.c
-
-rfft16.c: fftc$(EXEEXT)
- ./fftc$(EXEEXT) 16 > rfft16.c
-
-rfft32.c: fftc$(EXEEXT)
- ./fftc$(EXEEXT) 32 > rfft32.c
-
-rfft64.c: fftc$(EXEEXT)
- ./fftc$(EXEEXT) 64 > rfft64.c
-
-rfft128.c: fftc$(EXEEXT)
- ./fftc$(EXEEXT) 128 > rfft128.c
-
-rfft256.c: fftc$(EXEEXT)
- ./fftc$(EXEEXT) 256 > rfft256.c
-
-rfft512.c: fftc$(EXEEXT)
- ./fftc$(EXEEXT) 512 > rfft512.c
-
-rfft1024.c: fftc$(EXEEXT)
- ./fftc$(EXEEXT) 1024 > rfft1024.c
-
-irfft16.c: ifftc$(EXEEXT)
- ./ifftc$(EXEEXT) 16 > irfft16.c
-
-irfft32.c: ifftc$(EXEEXT)
- ./ifftc$(EXEEXT) 32 > irfft32.c
-
-irfft64.c: ifftc$(EXEEXT)
- ./ifftc$(EXEEXT) 64 > irfft64.c
-
-irfft128.c: ifftc$(EXEEXT)
- ./ifftc$(EXEEXT) 128 > irfft128.c
-
-irfft256.c: ifftc$(EXEEXT)
- ./ifftc$(EXEEXT) 256 > irfft256.c
-
-irfft512.c: ifftc$(EXEEXT)
- ./ifftc$(EXEEXT) 512 > irfft512.c
-
-irfft1024.c: ifftc$(EXEEXT)
- ./ifftc$(EXEEXT) 1024 > irfft1024.c
-
-BUILT_SOURCES = \
- irfft16.c \
- irfft32.c \
- irfft64.c \
- irfft128.c \
- irfft256.c \
- rfft16.c \
- rfft32.c \
- rfft64.c \
- rfft128.c \
- rfft256.c
-
CLEANFILES = $(BUILT_SOURCES)
DISTCLEANFILES = $(CLEANFILES)
@@ -96,9 +28,7 @@ include $(top_srcdir)/misc/Makefile.defs
FAST_OBJECTS = \
$(libfft_la_OBJECTS) \
$(lib_LTLIBRARIES) \
- $(fftc_OBJECTS) \
$(fftest_OBJECTS) \
- $(ifftc_OBJECTS) \
$(bin_PROGRAMS)
EXTRA_DIST = CMakeLists.txt
diff --git a/src/libfft/ditsplitc.c b/src/libfft/ditsplitc.c
deleted file mode 100644
index 8395acc..0000000
--- a/src/libfft/ditsplitc.c
+++ /dev/null
@@ -1,212 +0,0 @@
-/* D I T S P L I T C . C
- * BRL-CAD
- *
- * Copyright (c) 2004-2011 United States Government as represented by
- * the U.S. Army Research Laboratory.
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public License
- * version 2.1 as published by the Free Software Foundation.
- *
- * This library is distributed in the hope that it will be useful, but
- * WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this file; see the file named COPYING for more
- * information.
- */
-/** @file libfft/ditsplitc.c
- *
- * Split Radix, Decimation in Frequency, Inverse Real-valued FFT.
- *
- * Input order:
- * [ Re(0), Re(1), ..., Re(N/2), Im(N/2-1), ..., Im(1) ]
- *
- * Transactions on Acoustics, Speech, and Signal Processing, June 1987.
- *
- */
-
-#include "common.h"
-
-#include <stdio.h>
-
-#include "fft.h"
-
-
-/* used by ifftc.c */
-int irfft_adds, irfft_mults;
-
-
-void
-ditsplit(int n /* length */, int m /* n = 2^m */)
-{
- int i, j, k, n1, n2, n4, n8;
- int i0, i1, i2, i3, i4, i5, i6, i7, i8;
- int is, id;
- double cc1, ss1, cc3, ss3, e, a, a3;
- irfft_adds = irfft_mults = 0;
-
- printf("/*\n"
- " * BRL-CAD\n"
- " *\n"
- " * This file is a generated source file.\n"
- " * See %s for license and distribution details.\n"
- " */\n", __FILE__);
-
- printf("/*\n"
- " * Machine-generated Real Split Radix Decimation in Freq Inverse
FFT\n"
- " */\n\n");
-
- printf("#include \"fft.h\"\n\n");
- printf("void\n");
- printf("irfft%d(register double x[])\n", n);
- printf("{\n");
- printf(" register double t1, t2, t3, t4, t5;\n");
- printf(" register int i;\n");
-
- /* L shaped butterflies */
- printf("\n /* L shaped butterflies */\n");
- n2 = n << 1;
- for (k = 1; k < m; k++) {
- is = 0;
- id = n2;
- n2 = n2 >> 1;
- n4 = n2 >> 2;
- n8 = n4 >> 1;
- e = 2.0*M_PI / n2;
- l17:
- for (i = is; i < n; i += id) {
- i1 = i + 1;
- i2 = i1 + n4;
- i3 = i2 + n4;
- i4 = i3 + n4;
-
- printf(" t1 = x[%d] - x[%d];\n", i1-1, i3-1);
- printf(" x[%d] += x[%d];\n", i1-1, i3-1);
- printf(" x[%d] *= 2.0;\n", i2-1);
- printf(" x[%d] = t1 - 2.0 * x[%d];\n", i3-1, i4-1);
- printf(" x[%d] = t1 + 2.0 * x[%d];\n", i4-1, i4-1);
- irfft_adds += 4; irfft_mults += 3;
-
- if (n4 == 1)
- continue;
- i1 += n8;
- i2 += n8;
- i3 += n8;
- i4 += n8;
-
- printf(" t1 = (x[%d] - x[%d]) * M_SQRT1_2;\n", i2-1, i1-1);
- printf(" t2 = (x[%d] + x[%d]) * M_SQRT1_2;\n", i4-1, i3-1);
- printf(" x[%d] += x[%d];\n", i1-1, i2-1);
- printf(" x[%d] = x[%d] - x[%d];\n", i2-1, i4-1, i3-1);
- printf(" x[%d] = -2.0 * (t2 + t1);\n", i3-1);
- printf(" x[%d] = 2.0 * (-t2 + t1);\n", i4-1);
- irfft_adds += 6; irfft_mults += 4;
-
- }
- is = 2 * id - n2;
- id = 4 * id;
- if (is < n-1)
- goto l17;
-
- a = e;
- for (j = 2; j <= n8; j++) {
- a3 = 3.0 * a;
- cc1 = cos(a);
- ss1 = sin(a);
- cc3 = cos(a3);
- ss3 = sin(a3);
- a = j * e;
- is = 0;
- id = 2 * n2;
- l40:
- for (i = is; i < n; i += id) {
- i1 = i + j;
- i2 = i1 + n4;
- i3 = i2 + n4;
- i4 = i3 + n4;
- i5 = i + n4 - j + 2;
- i6 = i5 + n4;
- i7 = i6 + n4;
- i8 = i7 + n4;
-
- printf(" t1 = x[%d] - x[%d];\n", i1-1, i6-1);
- printf(" x[%d] += x[%d];\n", i1-1, i6-1);
- printf(" t2 = x[%d] - x[%d];\n", i5-1, i2-1);
- printf(" x[%d] += x[%d];\n", i5-1, i2-1);
- printf(" t3 = x[%d] + x[%d];\n", i8-1, i3-1);
- printf(" x[%d] = x[%d] - x[%d];\n", i6-1, i8-1, i3-1);
- printf(" t4 = x[%d] + x[%d];\n", i4-1, i7-1);
- printf(" x[%d] = x[%d] - x[%d];\n", i2-1, i4-1, i7-1);
- printf(" t5 = t1 - t4;\n");
- printf(" t1 += t4;\n");
- printf(" t4 = t2 - t3;\n");
- printf(" t2 += t3;\n");
- printf(" x[%d] = t5 * %.24f + t4 * %.24f;\n", i3-1, cc1,
ss1);
- printf(" x[%d] = - t4 * %.24f + t5 * %.24f;\n", i7-1, cc1,
ss1);
- printf(" x[%d] = t1 * %.24f - t2 * %.24f;\n", i4-1, cc3,
ss3);
- printf(" x[%d] = t2 * %.24f + t1 * %.24f;\n", i8-1, cc3,
ss3);
- irfft_adds += 16; irfft_mults += 8;
-
- }
- is = 2 * id - n2;
- id = 4 * id;
- if (is < n-1)
- goto l40;
- }
- }
-
- /* Length two butterflies */
- printf("\n /* Length two butterflies */\n");
- is = 1;
- id = 4;
-l70:
- for (i0 = is; i0 <= n; i0 += id) {
- i1 = i0 + 1;
-
- printf(" t1 = x[%d];\n", i0-1);
- printf(" x[%d] = t1 + x[%d];\n", i0-1, i1-1);
- printf(" x[%d] = t1 - x[%d];\n", i1-1, i1-1);
- irfft_adds += 2;
-
- }
- is = 2 * id - 1;
- id = 4 * id;
- if (is < n)
- goto l70;
-
- /* Digit reverse counter */
- printf("\n /* bit reverse */\n");
- j = 1;
- n1 = n - 1;
- for (i = 1; i <= n1; i++) {
- if (i < j) {
- printf(" t1 = x[%d];\n", j-1);
- printf(" x[%d] = x[%d];\n", j-1, i-1);
- printf(" x[%d] = t1;\n", i-1);
- }
- k = n/2;
- while (k < j) {
- j -= k;
- k /= 2;
- }
- j += k;
- }
-
- printf("\n /* scale result */\n");
- printf(" for (i = 0; i < %d; i++)\n", n);
- printf("\tx[i] /= %f;\n", (double)n);
- printf("}\n");
-}
-
-/*
- * Local Variables:
- * mode: C
- * tab-width: 8
- * indent-tabs-mode: t
- * c-file-style: "stroustrup"
- * End:
- * ex: shiftwidth=4 tabstop=8
- */
diff --git a/src/libfft/fftc.c b/src/libfft/fftc.c
deleted file mode 100644
index d94ad1d..0000000
--- a/src/libfft/fftc.c
+++ /dev/null
@@ -1,65 +0,0 @@
-/* F F T C . C
- * BRL-CAD
- *
- * Copyright (c) 2004-2011 United States Government as represented by
- * the U.S. Army Research Laboratory.
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public License
- * version 2.1 as published by the Free Software Foundation.
- *
- * This library is distributed in the hope that it will be useful, but
- * WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this file; see the file named COPYING for more
- * information.
- */
-/** @file libfft/fftc.c
- *
- * Split Radix Decimation in Time
- * FFT C code generator.
- *
- */
-
-#include "common.h"
-
-#include <stdlib.h>
-#include <stdio.h>
-#include <math.h>
-
-#include "./fft.h"
-
-
-extern int rfft_adds, rfft_mults;
-
-
-int
-main(int argc, char *argv[])
-{
- int n, m;
-
- if ( argc != 2 ) {
- fprintf( stderr, "Usage: fftc length > fftlength.c\n" );
- return 1;
- }
-
- n = atoi(argv[1]);
- m = log((double)n)/log(2.0) + 0.5; /* careful truncation */
-
- splitdit( n, m );
- fprintf( stderr, "adds = %d, mults = %d\n", rfft_adds, rfft_mults );
- return 0;
-}
-
-/*
- * Local Variables:
- * mode: C
- * tab-width: 8
- * indent-tabs-mode: t
- * c-file-style: "stroustrup"
- * End:
- * ex: shiftwidth=4 tabstop=8
- */
diff --git a/src/libfft/ifftc.c b/src/libfft/ifftc.c
deleted file mode 100644
index 56f58ba..0000000
--- a/src/libfft/ifftc.c
+++ /dev/null
@@ -1,62 +0,0 @@
-/* I F F T C . C
- * BRL-CAD
- *
- * Copyright (c) 2004-2011 United States Government as represented by
- * the U.S. Army Research Laboratory.
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public License
- * version 2.1 as published by the Free Software Foundation.
- *
- * This library is distributed in the hope that it will be useful, but
- * WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this file; see the file named COPYING for more
- * information.
- */
-/** @file libfft/ifftc.c
- *
- * Split Radix Decimation in Freq Inverse FFT C code generator.
- *
- */
-
-#include "common.h"
-
-#include <stdlib.h>
-#include <stdio.h>
-#include <math.h>
-
-#include "./fft.h"
-
-extern int irfft_adds, irfft_mults;
-
-int
-main(int argc, char **argv)
-{
- int n, m;
-
- if ( argc != 2 ) {
- fprintf( stderr, "Usage: ifftc length > fftlength.c\n" );
- return 1;
- }
-
- n = atoi(argv[1]);
- m = log((double)n)/log(2.0) + 0.5; /* careful truncation */
-
- ditsplit( n, m );
- fprintf( stderr, "adds = %d, mults = %d\n", irfft_adds, irfft_mults );
- return 0;
-}
-
-/*
- * Local Variables:
- * mode: C
- * tab-width: 8
- * indent-tabs-mode: t
- * c-file-style: "stroustrup"
- * End:
- * ex: shiftwidth=4 tabstop=8
- */
diff --git a/src/libfft/splitditc.c b/src/libfft/splitditc.c
deleted file mode 100644
index 1b35804..0000000
--- a/src/libfft/splitditc.c
+++ /dev/null
@@ -1,192 +0,0 @@
-/* S P L I T D I T C . C
- * BRL-CAD
- *
- * Copyright (c) 2004-2011 United States Government as represented by
- * the U.S. Army Research Laboratory.
- *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public License
- * version 2.1 as published by the Free Software Foundation.
- *
- * This library is distributed in the hope that it will be useful, but
- * WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this file; see the file named COPYING for more
- * information.
- */
-/** @file libfft/splitditc.c
- *
- * Real valued, split-radix, decimation in time FFT code generator.
- *
- */
-
-#include "common.h"
-
-#include <stdio.h>
-
-#include "fft.h"
-
-
-/* used by fftc.c */
-int rfft_adds, rfft_mults;
-
-
-void
-splitdit(int N, int M)
-{
- int i0, i1, i2, i3;
- int a0, a1, a2, a3, b0, b1, b2, b3;
- int s, d;
- double a, aa3, e;
- double cc1, ss1, cc3, ss3;
- int i, j, k, ni;
- int n2, n4;
- rfft_adds = rfft_mults = 0;
-
- printf("/*\n"
- " * BRL-CAD\n"
- " *\n"
- " * This file is a generated source file.\n"
- " * See %s for license and distribution details.\n"
- " */\n", __FILE__);
-
- printf("/*\n"
- " * Machine-generated Real Split Radix Decimation in Time FFT\n"
- " */\n\n");
- printf("#include \"fft.h\"\n\n");
- printf("void\n");
- printf("rfft%d(register double X[])\n", N);
- printf("{\n");
- printf(" register double t0, t1, c3, d3, c2, d2;\n");
- printf(" register int i;\n");
-
- /* bit reverse counter */
- printf("\n /* bit reverse */\n");
- j = 1;
- ni = N - 1;
- for (i = 1; i <= ni; i++) {
- if (i < j) {
- printf(" t0 = X[%d];\n", j-1);
- printf(" X[%d] = X[%d];\n", j-1, i-1);
- printf(" X[%d] = t0;\n", i-1);
- }
- k = N/2;
- while (k < j) {
- j -= k;
- k /= 2;
- }
- j += k;
- }
-
- /* length two transforms */
- printf("\n /* length two xforms */\n");
- for (s = 1, d = 4; s < N; s = 2*d-1, d *= 4) {
- for (i0 = s; i0 <= N; i0 += d) {
- i1 = i0 + 1;
- printf(" t0 = X[%d];\n", i0-1);
- printf(" X[%d] += X[%d];\n", i0-1, i1-1);
- printf(" X[%d] = t0 - X[%d];\n", i1-1, i1-1);
- rfft_adds += 2;
- }
- }
-
- /* other butterflies */
- printf("\n /* other butterflies */\n");
- n2 = 2;
- for (k = 2; k <= M; k++) {
- n2 *= 2;
- n4 = n2/4;
-
- /* without mult */
- for (s = 1, d = 2*n2; s < N; s = 2*d-n2+1, d *= 4) {
- for (i0 = s; i0 < N; i0 += d) {
- i1 = i0 + n4;
- i2 = i1 + n4;
- i3 = i2 + n4;
- printf(" t0 = X[%d] + X[%d];\n", i3-1, i2-1);
- printf(" X[%d] = X[%d] - X[%d];\n", i3-1, i2-1, i3-1);
- printf(" X[%d] = X[%d] - t0;\n", i2-1, i0-1);
- printf(" X[%d] += t0;\n", i0-1);
- rfft_adds += 4;
- }
- }
- if (n4 < 2) continue;
- /* with 2 real mult */
- for (s = n4/2+1, d = 2*n2; s < N; s = 2*d-n2+n4/2+1, d *= 4) {
- for (i0 = s; i0 < N; i0 += d) {
- i1 = i0 + n4;
- i2 = i1 + n4;
- i3 = i2 + n4;
- printf(" t0 = (X[%d]-X[%d])*M_SQRT1_2;\n", i2-1, i3-1);
- printf(" t1 = (X[%d]+X[%d])*M_SQRT1_2;\n", i2-1, i3-1);
- printf(" X[%d] = t1 - X[%d];\n", i2-1, i1-1);
- printf(" X[%d] = t1 + X[%d];\n", i3-1, i1-1);
- printf(" X[%d] = X[%d] - t0;\n", i1-1, i0-1);
- printf(" X[%d] += t0;\n", i0-1);
- rfft_mults += 2; rfft_adds += 6;
- }
- }
- e = 2.0*M_PI/n2;
- a = e;
- if (n4 < 4) continue;
- for (j = 2; j <= n4/2; j++) {
- aa3 = 3*a;
- cc1 = cos(a);
- ss1 = sin(a);
- cc3 = cos(aa3);
- ss3 = sin(aa3);
- a = j * e;
- /* with 6 real mult */
- for (s = j, d = 2*n2; s < N; s = 2*d-n2+j, d *= 4) {
- for (a0 = s; a0 < N; a0 += d) {
- b1 = a0 + n4;
- a1 = b1-j-j+2;
- b0 = a1 + n4;
- a2 = b1 + n4;
- a3 = a2 + n4;
- b2 = b0 + n4;
- b3 = b2 + n4;
- printf(" c2 = X[%d]*%.24g - X[%d]*%.24g;\n", a2-1, cc1,
b2-1, ss1);
- printf(" d2 = -(X[%d]*%.24g + X[%d]*%.24g);\n", a2-1,
ss1, b2-1, cc1);
- printf(" c3 = X[%d]*%.24g - X[%d]*%.24g;\n", a3-1, cc3,
b3-1, ss3);
- printf(" d3 = -(X[%d]*%.24g + X[%d]*%.24g);\n", a3-1,
ss3, b3-1, cc3);
- rfft_mults += 8; rfft_adds += 4;
- printf(" t0 = c2 + c3;\n");
- printf(" c3 = c2 - c3;\n");
- printf(" t1 = d2 - d3;\n");
- printf(" d3 += d2;\n");
- printf(" X[%d] = -X[%d] - d3;\n", a2-1, b0-1);
- printf(" X[%d] = -X[%d] + c3;\n", b2-1, b1-1);
- printf(" X[%d] = X[%d] + c3;\n", a3-1, b1-1);
- printf(" X[%d] = X[%d] - d3;\n", b3-1, b0-1);
- printf(" X[%d] = X[%d] + t1;\n", b1-1, a1-1);
- printf(" X[%d] = X[%d] - t0;\n", b0-1, a0-1);
- printf(" X[%d] += t0;\n", a0-1);
- printf(" X[%d] -= t1;\n", a1-1);
- rfft_adds += 12;
- }
- }
- }
- }
-
- /* For some reason the Imag part is comming out with the wrong
- * sign, so we reverse it here! We need to figure this out!
- */
- printf("\n /* reverse Imag part! */\n");
- printf(" for (i = %d/2+1; i < %d; i++)\n", N, N);
- printf("\tX[i] = -X[i];\n");
- printf("}\n");
-}
-
-/*
- * Local Variables:
- * mode: C
- * tab-width: 8
- * indent-tabs-mode: t
- * c-file-style: "stroustrup"
- * End:
- * ex: shiftwidth=4 tabstop=8
- */
--
1.7.6
------------------------------------------------------------------------------
uberSVN's rich system and user administration capabilities and model
configuration take the hassle out of deploying and managing Subversion and
the tools developers use with it. Learn more about uberSVN and get a free
download at: http://p.sf.net/sfu/wandisco-dev2dev
_______________________________________________
BRL-CAD Developer mailing list
brlcad-devel@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/brlcad-devel
