annotate src/fftw-3.3.3/rdft/rdft2-tensor-max-index.c @ 95:89f5e221ed7b

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