annotate src/fftw-3.3.5/kernel/pickdim.c @ 167:bd3cc4d1df30

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