cannam@167: /*
cannam@167:  * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@167:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
cannam@167:  *
cannam@167:  * This program is free software; you can redistribute it and/or modify
cannam@167:  * it under the terms of the GNU General Public License as published by
cannam@167:  * the Free Software Foundation; either version 2 of the License, or
cannam@167:  * (at your option) any later version.
cannam@167:  *
cannam@167:  * This program is distributed in the hope that it will be useful,
cannam@167:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@167:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@167:  * GNU General Public License for more details.
cannam@167:  *
cannam@167:  * You should have received a copy of the GNU General Public License
cannam@167:  * along with this program; if not, write to the Free Software
cannam@167:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@167:  *
cannam@167:  */
cannam@167: 
cannam@167: 
cannam@167: #include "kernel/ifftw.h"
cannam@167: 
cannam@167: INT X(tensor_max_index)(const tensor *sz)
cannam@167: {
cannam@167:      int i;
cannam@167:      INT ni = 0, no = 0;
cannam@167: 
cannam@167:      A(FINITE_RNK(sz->rnk));
cannam@167:      for (i = 0; i < sz->rnk; ++i) {
cannam@167:           const iodim *p = sz->dims + i;
cannam@167:           ni += (p->n - 1) * X(iabs)(p->is);
cannam@167:           no += (p->n - 1) * X(iabs)(p->os);
cannam@167:      }
cannam@167:      return X(imax)(ni, no);
cannam@167: }
cannam@167: 
cannam@167: #define tensor_min_xstride(sz, xs) {			\
cannam@167:      A(FINITE_RNK(sz->rnk));				\
cannam@167:      if (sz->rnk == 0) return 0;			\
cannam@167:      else {						\
cannam@167:           int i;					\
cannam@167:           INT s = X(iabs)(sz->dims[0].xs);		\
cannam@167:           for (i = 1; i < sz->rnk; ++i)			\
cannam@167:                s = X(imin)(s, X(iabs)(sz->dims[i].xs));	\
cannam@167:           return s;					\
cannam@167:      }							\
cannam@167: }
cannam@167: 
cannam@167: INT X(tensor_min_istride)(const tensor *sz) tensor_min_xstride(sz, is)
cannam@167: INT X(tensor_min_ostride)(const tensor *sz) tensor_min_xstride(sz, os)
cannam@167: 
cannam@167: INT X(tensor_min_stride)(const tensor *sz)
cannam@167: {
cannam@167:      return X(imin)(X(tensor_min_istride)(sz), X(tensor_min_ostride)(sz));
cannam@167: }
cannam@167: 
cannam@167: int X(tensor_inplace_strides)(const tensor *sz)
cannam@167: {
cannam@167:      int i;
cannam@167:      A(FINITE_RNK(sz->rnk));
cannam@167:      for (i = 0; i < sz->rnk; ++i) {
cannam@167:           const iodim *p = sz->dims + i;
cannam@167:           if (p->is != p->os)
cannam@167:                return 0;
cannam@167:      }
cannam@167:      return 1;
cannam@167: }
cannam@167: 
cannam@167: int X(tensor_inplace_strides2)(const tensor *a, const tensor *b)
cannam@167: {
cannam@167:      return X(tensor_inplace_strides(a)) && X(tensor_inplace_strides(b));
cannam@167: }
cannam@167: 
cannam@167: /* return true (1) iff *any* strides of sz decrease when we
cannam@167:    tensor_inplace_copy(sz, k). */
cannam@167: static int tensor_strides_decrease(const tensor *sz, inplace_kind k)
cannam@167: {
cannam@167:      if (FINITE_RNK(sz->rnk)) {
cannam@167:           int i;
cannam@167:           for (i = 0; i < sz->rnk; ++i)
cannam@167:                if ((sz->dims[i].os - sz->dims[i].is)
cannam@167:                    * (k == INPLACE_OS ? (INT)1 : (INT)-1) < 0)
cannam@167:                     return 1;
cannam@167:      }
cannam@167:      return 0;
cannam@167: }
cannam@167: 
cannam@167: /* Return true (1) iff *any* strides of sz decrease when we
cannam@167:    tensor_inplace_copy(k) *or* if *all* strides of sz are unchanged
cannam@167:    but *any* strides of vecsz decrease.  This is used in indirect.c
cannam@167:    to determine whether to use INPLACE_IS or INPLACE_OS.
cannam@167: 
cannam@167:    Note: X(tensor_strides_decrease)(sz, vecsz, INPLACE_IS)
cannam@167:          || X(tensor_strides_decrease)(sz, vecsz, INPLACE_OS)
cannam@167:          || X(tensor_inplace_strides2)(p->sz, p->vecsz)
cannam@167:    must always be true. */
cannam@167: int X(tensor_strides_decrease)(const tensor *sz, const tensor *vecsz,
cannam@167: 			       inplace_kind k)
cannam@167: {
cannam@167:      return(tensor_strides_decrease(sz, k)
cannam@167: 	    || (X(tensor_inplace_strides)(sz)
cannam@167: 		&& tensor_strides_decrease(vecsz, k)));
cannam@167: }