annotate fft/fftw/fftw-3.3.4/rdft/rdft2-tensor-max-index.c @ 40:223f770b5341 kissfft-double tip

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