annotate src/fftw-3.3.5/rdft/rdft2-tensor-max-index.c @ 56:af97cad61ff0

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