annotate src/fftw-3.3.5/rdft/rdft2-tensor-max-index.c @ 127:7867fa7e1b6b

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