summaryrefslogtreecommitdiff
path: root/src/fftw3/api/mktensor-rowmajor.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-rowmajor.c
First commit - moving from LuaForge to SourceForge
Diffstat (limited to 'src/fftw3/api/mktensor-rowmajor.c')
-rw-r--r--src/fftw3/api/mktensor-rowmajor.c61
1 files changed, 61 insertions, 0 deletions
diff --git a/src/fftw3/api/mktensor-rowmajor.c b/src/fftw3/api/mktensor-rowmajor.c
new file mode 100644
index 0000000..84b87ca
--- /dev/null
+++ b/src/fftw3/api/mktensor-rowmajor.c
@@ -0,0 +1,61 @@
+/*
+ * 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_rowmajor)(int rnk, const int *n,
+ const int *niphys, const int *nophys,
+ int is, int os)
+{
+ tensor *x = X(mktensor)(rnk);
+
+ if (FINITE_RNK(rnk) && rnk > 0) {
+ int i;
+
+ A(n && niphys && nophys);
+ x->dims[rnk - 1].is = is;
+ x->dims[rnk - 1].os = os;
+ x->dims[rnk - 1].n = n[rnk - 1];
+ for (i = rnk - 1; i > 0; --i) {
+ x->dims[i - 1].is = x->dims[i].is * niphys[i];
+ x->dims[i - 1].os = x->dims[i].os * nophys[i];
+ x->dims[i - 1].n = n[i - 1];
+ }
+ }
+ return x;
+}
+
+static int rowmajor_kosherp(int rnk, const int *n)
+{
+ int i;
+
+ if (!FINITE_RNK(rnk)) return 0;
+ if (rnk < 0) return 0;
+
+ for (i = 0; i < rnk; ++i)
+ if (n[i] <= 0) return 0;
+
+ return 1;
+}
+
+int X(many_kosherp)(int rnk, const int *n, int howmany)
+{
+ return (howmany >= 0) && rowmajor_kosherp(rnk, n);
+}