Chris@42: /*
Chris@42:  * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@42:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@42:  *
Chris@42:  * This program is free software; you can redistribute it and/or modify
Chris@42:  * it under the terms of the GNU General Public License as published by
Chris@42:  * the Free Software Foundation; either version 2 of the License, or
Chris@42:  * (at your option) any later version.
Chris@42:  *
Chris@42:  * This program is distributed in the hope that it will be useful,
Chris@42:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@42:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@42:  * GNU General Public License for more details.
Chris@42:  *
Chris@42:  * You should have received a copy of the GNU General Public License
Chris@42:  * along with this program; if not, write to the Free Software
Chris@42:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@42:  *
Chris@42:  */
Chris@42: 
Chris@42: 
Chris@42: #include "rdft.h"
Chris@42: 
Chris@42: /* Check if the vecsz/sz strides are consistent with the problem
Chris@42:    being in-place for vecsz.dim[vdim], or for all dimensions
Chris@42:    if vdim == RNK_MINFTY.  We can't just use tensor_inplace_strides
Chris@42:    because rdft transforms have the unfortunate property of
Chris@42:    differing input and output sizes.   This routine is not
Chris@42:    exhaustive; we only return 1 for the most common case.  */
Chris@42: int X(rdft2_inplace_strides)(const problem_rdft2 *p, int vdim)
Chris@42: {
Chris@42:      INT N, Nc;
Chris@42:      INT rs, cs;
Chris@42:      int i;
Chris@42:      
Chris@42:      for (i = 0; i + 1 < p->sz->rnk; ++i)
Chris@42: 	  if (p->sz->dims[i].is != p->sz->dims[i].os)
Chris@42: 	       return 0;
Chris@42: 
Chris@42:      if (!FINITE_RNK(p->vecsz->rnk) || p->vecsz->rnk == 0)
Chris@42: 	  return 1;
Chris@42:      if (!FINITE_RNK(vdim)) { /* check all vector dimensions */
Chris@42: 	  for (vdim = 0; vdim < p->vecsz->rnk; ++vdim)
Chris@42: 	       if (!X(rdft2_inplace_strides)(p, vdim))
Chris@42: 		    return 0;
Chris@42: 	  return 1;
Chris@42:      }
Chris@42: 
Chris@42:      A(vdim < p->vecsz->rnk);
Chris@42:      if (p->sz->rnk == 0)
Chris@42: 	  return(p->vecsz->dims[vdim].is == p->vecsz->dims[vdim].os);
Chris@42: 
Chris@42:      N = X(tensor_sz)(p->sz);
Chris@42:      Nc = (N / p->sz->dims[p->sz->rnk-1].n) *
Chris@42: 	  (p->sz->dims[p->sz->rnk-1].n/2 + 1);
Chris@42:      X(rdft2_strides)(p->kind, p->sz->dims + p->sz->rnk - 1, &rs, &cs);
Chris@42: 
Chris@42:      /* the factor of 2 comes from the fact that RS is the stride
Chris@42: 	of p->r0 and p->r1, which is twice as large as the strides
Chris@42: 	in the r2r case */
Chris@42:      return(p->vecsz->dims[vdim].is == p->vecsz->dims[vdim].os
Chris@42: 	    && (X(iabs)(2 * p->vecsz->dims[vdim].os)
Chris@42: 		>= X(imax)(2 * Nc * X(iabs)(cs), N * X(iabs)(rs))));
Chris@42: }