summaryrefslogtreecommitdiff
path: root/src/fftw3/api/plan-many-r2r.c
diff options
context:
space:
mode:
authorscuri <scuri>2008-10-17 06:10:15 +0000
committerscuri <scuri>2008-10-17 06:10:15 +0000
commit5a422aba704c375a307a902bafe658342e209906 (patch)
tree5005011e086bb863d8fb587ad3319bbec59b2447 /src/fftw3/api/plan-many-r2r.c
First commit - moving from LuaForge to SourceForge
Diffstat (limited to 'src/fftw3/api/plan-many-r2r.c')
-rw-r--r--src/fftw3/api/plan-many-r2r.c52
1 files changed, 52 insertions, 0 deletions
diff --git a/src/fftw3/api/plan-many-r2r.c b/src/fftw3/api/plan-many-r2r.c
new file mode 100644
index 0000000..0a6815f
--- /dev/null
+++ b/src/fftw3/api/plan-many-r2r.c
@@ -0,0 +1,52 @@
+/*
+ * Copyright (c) 2003 Matteo Frigo
+ * Copyright (c) 2003 Massachusetts Institute of Technology
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program 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 General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ *
+ */
+
+#include "api.h"
+#include "rdft.h"
+
+rdft_kind *X(map_r2r_kind)(int rank, const X(r2r_kind) * kind);
+
+#define N0(nembed)((nembed) ? (nembed) : n)
+
+X(plan) X(plan_many_r2r)(int rank, const int *n,
+ int howmany,
+ R *in, const int *inembed,
+ int istride, int idist,
+ R *out, const int *onembed,
+ int ostride, int odist,
+ const X(r2r_kind) * kind, unsigned flags)
+{
+ X(plan) p;
+ rdft_kind *k;
+
+ if (!X(many_kosherp)(rank, n, howmany)) return 0;
+
+ k = X(map_r2r_kind)(rank, kind);
+ p = X(mkapiplan)(
+ 0, flags,
+ X(mkproblem_rdft_d)(X(mktensor_rowmajor)(rank, n,
+ N0(inembed), N0(onembed),
+ istride, ostride),
+ X(mktensor_1d)(howmany, idist, odist),
+ TAINT_UNALIGNED(in, flags),
+ TAINT_UNALIGNED(out, flags), k));
+ X(ifree0)(k);
+ return p;
+}