summaryrefslogtreecommitdiff
path: root/src/fftw3/api/mktensor-iodims.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/mktensor-iodims.c
First commit - moving from LuaForge to SourceForge
Diffstat (limited to 'src/fftw3/api/mktensor-iodims.c')
-rw-r--r--src/fftw3/api/mktensor-iodims.c62
1 files changed, 62 insertions, 0 deletions
diff --git a/src/fftw3/api/mktensor-iodims.c b/src/fftw3/api/mktensor-iodims.c
new file mode 100644
index 0000000..99ce49e
--- /dev/null
+++ b/src/fftw3/api/mktensor-iodims.c
@@ -0,0 +1,62 @@
+/*
+ * 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"
+
+tensor *X(mktensor_iodims)(int rank, const X(iodim) *dims, int is, int os)
+{
+ int i;
+ tensor *x = X(mktensor)(rank);
+
+ if (FINITE_RNK(rank)) {
+ for (i = 0; i < rank; ++i) {
+ x->dims[i].n = dims[i].n;
+ x->dims[i].is = dims[i].is * is;
+ x->dims[i].os = dims[i].os * os;
+ }
+ }
+ return x;
+}
+
+static int iodims_kosherp(int rank, const X(iodim) *dims, int allow_minfty)
+{
+ int i;
+
+ if (rank < 0) return 0;
+
+ if (allow_minfty) {
+ if (!FINITE_RNK(rank)) return 1;
+ for (i = 0; i < rank; ++i)
+ if (dims[i].n < 0) return 0;
+ } else {
+ if (!FINITE_RNK(rank)) return 0;
+ for (i = 0; i < rank; ++i)
+ if (dims[i].n <= 0) return 0;
+ }
+
+ return 1;
+}
+
+int X(guru_kosherp)(int rank, const X(iodim) *dims,
+ int howmany_rank, const X(iodim) *howmany_dims)
+{
+ return (iodims_kosherp(rank, dims, 0) &&
+ iodims_kosherp(howmany_rank, howmany_dims, 1));
+}