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