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 "ifftw.h" cannam@95: cannam@95: INT X(tensor_max_index)(const tensor *sz) cannam@95: { cannam@95: int i; cannam@95: INT ni = 0, no = 0; cannam@95: cannam@95: A(FINITE_RNK(sz->rnk)); cannam@95: for (i = 0; i < sz->rnk; ++i) { cannam@95: const iodim *p = sz->dims + i; cannam@95: ni += (p->n - 1) * X(iabs)(p->is); cannam@95: no += (p->n - 1) * X(iabs)(p->os); cannam@95: } cannam@95: return X(imax)(ni, no); cannam@95: } cannam@95: cannam@95: #define tensor_min_xstride(sz, xs) { \ cannam@95: A(FINITE_RNK(sz->rnk)); \ cannam@95: if (sz->rnk == 0) return 0; \ cannam@95: else { \ cannam@95: int i; \ cannam@95: INT s = X(iabs)(sz->dims[0].xs); \ cannam@95: for (i = 1; i < sz->rnk; ++i) \ cannam@95: s = X(imin)(s, X(iabs)(sz->dims[i].xs)); \ cannam@95: return s; \ cannam@95: } \ cannam@95: } cannam@95: cannam@95: INT X(tensor_min_istride)(const tensor *sz) tensor_min_xstride(sz, is) cannam@95: INT X(tensor_min_ostride)(const tensor *sz) tensor_min_xstride(sz, os) cannam@95: cannam@95: INT X(tensor_min_stride)(const tensor *sz) cannam@95: { cannam@95: return X(imin)(X(tensor_min_istride)(sz), X(tensor_min_ostride)(sz)); cannam@95: } cannam@95: cannam@95: int X(tensor_inplace_strides)(const tensor *sz) cannam@95: { cannam@95: int i; cannam@95: A(FINITE_RNK(sz->rnk)); cannam@95: for (i = 0; i < sz->rnk; ++i) { cannam@95: const iodim *p = sz->dims + i; cannam@95: if (p->is != p->os) cannam@95: return 0; cannam@95: } cannam@95: return 1; cannam@95: } cannam@95: cannam@95: int X(tensor_inplace_strides2)(const tensor *a, const tensor *b) cannam@95: { cannam@95: return X(tensor_inplace_strides(a)) && X(tensor_inplace_strides(b)); cannam@95: } cannam@95: cannam@95: /* return true (1) iff *any* strides of sz decrease when we cannam@95: tensor_inplace_copy(sz, k). */ cannam@95: static int tensor_strides_decrease(const tensor *sz, inplace_kind k) cannam@95: { cannam@95: if (FINITE_RNK(sz->rnk)) { cannam@95: int i; cannam@95: for (i = 0; i < sz->rnk; ++i) cannam@95: if ((sz->dims[i].os - sz->dims[i].is) cannam@95: * (k == INPLACE_OS ? (INT)1 : (INT)-1) < 0) cannam@95: return 1; cannam@95: } cannam@95: return 0; cannam@95: } cannam@95: cannam@95: /* Return true (1) iff *any* strides of sz decrease when we cannam@95: tensor_inplace_copy(k) *or* if *all* strides of sz are unchanged cannam@95: but *any* strides of vecsz decrease. This is used in indirect.c cannam@95: to determine whether to use INPLACE_IS or INPLACE_OS. cannam@95: cannam@95: Note: X(tensor_strides_decrease)(sz, vecsz, INPLACE_IS) cannam@95: || X(tensor_strides_decrease)(sz, vecsz, INPLACE_OS) cannam@95: || X(tensor_inplace_strides2)(p->sz, p->vecsz) cannam@95: must always be true. */ cannam@95: int X(tensor_strides_decrease)(const tensor *sz, const tensor *vecsz, cannam@95: inplace_kind k) cannam@95: { cannam@95: return(tensor_strides_decrease(sz, k) cannam@95: || (X(tensor_inplace_strides)(sz) cannam@95: && tensor_strides_decrease(vecsz, k))); cannam@95: }