Chris@19: /*
Chris@19:  * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@19:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@19:  *
Chris@19:  * This program is free software; you can redistribute it and/or modify
Chris@19:  * it under the terms of the GNU General Public License as published by
Chris@19:  * the Free Software Foundation; either version 2 of the License, or
Chris@19:  * (at your option) any later version.
Chris@19:  *
Chris@19:  * This program is distributed in the hope that it will be useful,
Chris@19:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@19:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@19:  * GNU General Public License for more details.
Chris@19:  *
Chris@19:  * You should have received a copy of the GNU General Public License
Chris@19:  * along with this program; if not, write to the Free Software
Chris@19:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@19:  *
Chris@19:  */
Chris@19: 
Chris@19: #include "ifftw.h"
Chris@19: 
Chris@19: 
Chris@19: /* Given a solver which_dim, a vector sz, and whether or not the
Chris@19:    transform is out-of-place, return the actual dimension index that
Chris@19:    it corresponds to.  The basic idea here is that we return the
Chris@19:    which_dim'th valid dimension, starting from the end if
Chris@19:    which_dim < 0. */
Chris@19: static int really_pickdim(int which_dim, const tensor *sz, int oop, int *dp)
Chris@19: {
Chris@19:      int i;
Chris@19:      int count_ok = 0;
Chris@19:      if (which_dim > 0) {
Chris@19:           for (i = 0; i < sz->rnk; ++i) {
Chris@19:                if (oop || sz->dims[i].is == sz->dims[i].os)
Chris@19:                     if (++count_ok == which_dim) {
Chris@19:                          *dp = i;
Chris@19:                          return 1;
Chris@19:                     }
Chris@19:           }
Chris@19:      }
Chris@19:      else if (which_dim < 0) {
Chris@19:           for (i = sz->rnk - 1; i >= 0; --i) {
Chris@19:                if (oop || sz->dims[i].is == sz->dims[i].os)
Chris@19:                     if (++count_ok == -which_dim) {
Chris@19:                          *dp = i;
Chris@19:                          return 1;
Chris@19:                     }
Chris@19:           }
Chris@19:      }
Chris@19:      else { /* zero: pick the middle, if valid */
Chris@19: 	  i = (sz->rnk - 1) / 2;
Chris@19: 	  if (i >= 0 && (oop || sz->dims[i].is == sz->dims[i].os)) {
Chris@19: 	       *dp = i;
Chris@19: 	       return 1;
Chris@19: 	  }
Chris@19:      }
Chris@19:      return 0;
Chris@19: }
Chris@19: 
Chris@19: /* Like really_pickdim, but only returns 1 if no previous "buddy"
Chris@19:    which_dim in the buddies list would give the same dim. */
Chris@19: int X(pickdim)(int which_dim, const int *buddies, int nbuddies,
Chris@19: 	       const tensor *sz, int oop, int *dp)
Chris@19: {
Chris@19:      int i, d1;
Chris@19: 
Chris@19:      if (!really_pickdim(which_dim, sz, oop, dp))
Chris@19:           return 0;
Chris@19: 
Chris@19:      /* check whether some buddy solver would produce the same dim.
Chris@19:         If so, consider this solver unapplicable and let the buddy
Chris@19:         take care of it.  The smallest-indexed buddy is applicable. */
Chris@19:      for (i = 0; i < nbuddies; ++i) {
Chris@19:           if (buddies[i] == which_dim)
Chris@19:                break;  /* found self */
Chris@19:           if (really_pickdim(buddies[i], sz, oop, &d1) && *dp == d1)
Chris@19:                return 0; /* found equivalent buddy */
Chris@19:      }
Chris@19:      return 1;
Chris@19: }