annotate src/fftw-3.3.3/rdft/rdft2-tensor-max-index.c @ 10:37bf6b4a2645

Add FFTW3
author Chris Cannam
date Wed, 20 Mar 2013 15:35:50 +0000
parents
children
rev   line source
Chris@10 1 /*
Chris@10 2 * Copyright (c) 2003, 2007-11 Matteo Frigo
Chris@10 3 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
Chris@10 4 *
Chris@10 5 * This program is free software; you can redistribute it and/or modify
Chris@10 6 * it under the terms of the GNU General Public License as published by
Chris@10 7 * the Free Software Foundation; either version 2 of the License, or
Chris@10 8 * (at your option) any later version.
Chris@10 9 *
Chris@10 10 * This program is distributed in the hope that it will be useful,
Chris@10 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@10 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@10 13 * GNU General Public License for more details.
Chris@10 14 *
Chris@10 15 * You should have received a copy of the GNU General Public License
Chris@10 16 * along with this program; if not, write to the Free Software
Chris@10 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@10 18 *
Chris@10 19 */
Chris@10 20
Chris@10 21
Chris@10 22 #include "rdft.h"
Chris@10 23
Chris@10 24 /* like X(tensor_max_index), but takes into account the special n/2+1
Chris@10 25 final dimension for the complex output/input of an R2HC/HC2R transform. */
Chris@10 26 INT X(rdft2_tensor_max_index)(const tensor *sz, rdft_kind k)
Chris@10 27 {
Chris@10 28 int i;
Chris@10 29 INT n = 0;
Chris@10 30
Chris@10 31 A(FINITE_RNK(sz->rnk));
Chris@10 32 for (i = 0; i + 1 < sz->rnk; ++i) {
Chris@10 33 const iodim *p = sz->dims + i;
Chris@10 34 n += (p->n - 1) * X(imax)(X(iabs)(p->is), X(iabs)(p->os));
Chris@10 35 }
Chris@10 36 if (i < sz->rnk) {
Chris@10 37 const iodim *p = sz->dims + i;
Chris@10 38 INT is, os;
Chris@10 39 X(rdft2_strides)(k, p, &is, &os);
Chris@10 40 n += X(imax)((p->n - 1) * X(iabs)(is), (p->n/2) * X(iabs)(os));
Chris@10 41 }
Chris@10 42 return n;
Chris@10 43 }