annotate src/fftw-3.3.3/kernel/pickdim.c @ 25:7c42c2fc4173

Add Vamp SDK for OS/X
author Chris Cannam
date Thu, 09 Jan 2014 09:17:21 +0000
parents 37bf6b4a2645
children
rev   line source
Chris@10 1 /*
Chris@10 2 * Copyright (c) 2003, 2007-11 Matteo Frigo
Chris@10 3 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
Chris@10 4 *
Chris@10 5 * This program is free software; you can redistribute it and/or modify
Chris@10 6 * it under the terms of the GNU General Public License as published by
Chris@10 7 * the Free Software Foundation; either version 2 of the License, or
Chris@10 8 * (at your option) any later version.
Chris@10 9 *
Chris@10 10 * This program is distributed in the hope that it will be useful,
Chris@10 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@10 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@10 13 * GNU General Public License for more details.
Chris@10 14 *
Chris@10 15 * You should have received a copy of the GNU General Public License
Chris@10 16 * along with this program; if not, write to the Free Software
Chris@10 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@10 18 *
Chris@10 19 */
Chris@10 20
Chris@10 21 #include "ifftw.h"
Chris@10 22
Chris@10 23
Chris@10 24 /* Given a solver which_dim, a vector sz, and whether or not the
Chris@10 25 transform is out-of-place, return the actual dimension index that
Chris@10 26 it corresponds to. The basic idea here is that we return the
Chris@10 27 which_dim'th valid dimension, starting from the end if
Chris@10 28 which_dim < 0. */
Chris@10 29 static int really_pickdim(int which_dim, const tensor *sz, int oop, int *dp)
Chris@10 30 {
Chris@10 31 int i;
Chris@10 32 int count_ok = 0;
Chris@10 33 if (which_dim > 0) {
Chris@10 34 for (i = 0; i < sz->rnk; ++i) {
Chris@10 35 if (oop || sz->dims[i].is == sz->dims[i].os)
Chris@10 36 if (++count_ok == which_dim) {
Chris@10 37 *dp = i;
Chris@10 38 return 1;
Chris@10 39 }
Chris@10 40 }
Chris@10 41 }
Chris@10 42 else if (which_dim < 0) {
Chris@10 43 for (i = sz->rnk - 1; i >= 0; --i) {
Chris@10 44 if (oop || sz->dims[i].is == sz->dims[i].os)
Chris@10 45 if (++count_ok == -which_dim) {
Chris@10 46 *dp = i;
Chris@10 47 return 1;
Chris@10 48 }
Chris@10 49 }
Chris@10 50 }
Chris@10 51 else { /* zero: pick the middle, if valid */
Chris@10 52 i = (sz->rnk - 1) / 2;
Chris@10 53 if (i >= 0 && (oop || sz->dims[i].is == sz->dims[i].os)) {
Chris@10 54 *dp = i;
Chris@10 55 return 1;
Chris@10 56 }
Chris@10 57 }
Chris@10 58 return 0;
Chris@10 59 }
Chris@10 60
Chris@10 61 /* Like really_pickdim, but only returns 1 if no previous "buddy"
Chris@10 62 which_dim in the buddies list would give the same dim. */
Chris@10 63 int X(pickdim)(int which_dim, const int *buddies, int nbuddies,
Chris@10 64 const tensor *sz, int oop, int *dp)
Chris@10 65 {
Chris@10 66 int i, d1;
Chris@10 67
Chris@10 68 if (!really_pickdim(which_dim, sz, oop, dp))
Chris@10 69 return 0;
Chris@10 70
Chris@10 71 /* check whether some buddy solver would produce the same dim.
Chris@10 72 If so, consider this solver unapplicable and let the buddy
Chris@10 73 take care of it. The smallest-indexed buddy is applicable. */
Chris@10 74 for (i = 0; i < nbuddies; ++i) {
Chris@10 75 if (buddies[i] == which_dim)
Chris@10 76 break; /* found self */
Chris@10 77 if (really_pickdim(buddies[i], sz, oop, &d1) && *dp == d1)
Chris@10 78 return 0; /* found equivalent buddy */
Chris@10 79 }
Chris@10 80 return 1;
Chris@10 81 }