annotate fft/fftw/fftw-3.3.4/kernel/pickdim.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 #include "ifftw.h"
Chris@19 22
Chris@19 23
Chris@19 24 /* Given a solver which_dim, a vector sz, and whether or not the
Chris@19 25 transform is out-of-place, return the actual dimension index that
Chris@19 26 it corresponds to. The basic idea here is that we return the
Chris@19 27 which_dim'th valid dimension, starting from the end if
Chris@19 28 which_dim < 0. */
Chris@19 29 static int really_pickdim(int which_dim, const tensor *sz, int oop, int *dp)
Chris@19 30 {
Chris@19 31 int i;
Chris@19 32 int count_ok = 0;
Chris@19 33 if (which_dim > 0) {
Chris@19 34 for (i = 0; i < sz->rnk; ++i) {
Chris@19 35 if (oop || sz->dims[i].is == sz->dims[i].os)
Chris@19 36 if (++count_ok == which_dim) {
Chris@19 37 *dp = i;
Chris@19 38 return 1;
Chris@19 39 }
Chris@19 40 }
Chris@19 41 }
Chris@19 42 else if (which_dim < 0) {
Chris@19 43 for (i = sz->rnk - 1; i >= 0; --i) {
Chris@19 44 if (oop || sz->dims[i].is == sz->dims[i].os)
Chris@19 45 if (++count_ok == -which_dim) {
Chris@19 46 *dp = i;
Chris@19 47 return 1;
Chris@19 48 }
Chris@19 49 }
Chris@19 50 }
Chris@19 51 else { /* zero: pick the middle, if valid */
Chris@19 52 i = (sz->rnk - 1) / 2;
Chris@19 53 if (i >= 0 && (oop || sz->dims[i].is == sz->dims[i].os)) {
Chris@19 54 *dp = i;
Chris@19 55 return 1;
Chris@19 56 }
Chris@19 57 }
Chris@19 58 return 0;
Chris@19 59 }
Chris@19 60
Chris@19 61 /* Like really_pickdim, but only returns 1 if no previous "buddy"
Chris@19 62 which_dim in the buddies list would give the same dim. */
Chris@19 63 int X(pickdim)(int which_dim, const int *buddies, int nbuddies,
Chris@19 64 const tensor *sz, int oop, int *dp)
Chris@19 65 {
Chris@19 66 int i, d1;
Chris@19 67
Chris@19 68 if (!really_pickdim(which_dim, sz, oop, dp))
Chris@19 69 return 0;
Chris@19 70
Chris@19 71 /* check whether some buddy solver would produce the same dim.
Chris@19 72 If so, consider this solver unapplicable and let the buddy
Chris@19 73 take care of it. The smallest-indexed buddy is applicable. */
Chris@19 74 for (i = 0; i < nbuddies; ++i) {
Chris@19 75 if (buddies[i] == which_dim)
Chris@19 76 break; /* found self */
Chris@19 77 if (really_pickdim(buddies[i], sz, oop, &d1) && *dp == d1)
Chris@19 78 return 0; /* found equivalent buddy */
Chris@19 79 }
Chris@19 80 return 1;
Chris@19 81 }