summaryrefslogtreecommitdiff
path: root/src/fftw3/rdft/rdft2-tensor-max-index.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/rdft/rdft2-tensor-max-index.c
First commit - moving from LuaForge to SourceForge
Diffstat (limited to 'src/fftw3/rdft/rdft2-tensor-max-index.c')
-rw-r--r--src/fftw3/rdft/rdft2-tensor-max-index.c44
1 files changed, 44 insertions, 0 deletions
diff --git a/src/fftw3/rdft/rdft2-tensor-max-index.c b/src/fftw3/rdft/rdft2-tensor-max-index.c
new file mode 100644
index 0000000..0d29af3
--- /dev/null
+++ b/src/fftw3/rdft/rdft2-tensor-max-index.c
@@ -0,0 +1,44 @@
+/*
+ * 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
+ *
+ */
+
+/* $Id: rdft2-tensor-max-index.c,v 1.1 2008/10/17 06:11:29 scuri Exp $ */
+
+#include "rdft.h"
+
+/* like X(tensor_max_index), but takes into account the special n/2+1
+ final dimension for the complex output/input of an R2HC/HC2R transform. */
+int X(rdft2_tensor_max_index)(const tensor *sz, rdft_kind k)
+{
+ int i;
+ int n = 0;
+
+ A(FINITE_RNK(sz->rnk));
+ for (i = 0; i + 1 < sz->rnk; ++i) {
+ const iodim *p = sz->dims + i;
+ n += (p->n - 1) * X(imax)(X(iabs)(p->is), X(iabs)(p->os));
+ }
+ if (i < sz->rnk) {
+ const iodim *p = sz->dims + i;
+ int is, os;
+ X(rdft2_strides)(k, p, &is, &os);
+ n += X(imax)((p->n - 1) * X(iabs)(is), (p->n/2) * X(iabs)(os));
+ }
+ return n;
+}