cannam@127: /* cannam@127: * Copyright (c) 2003, 2007-14 Matteo Frigo cannam@127: * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology cannam@127: * cannam@127: * This program is free software; you can redistribute it and/or modify cannam@127: * it under the terms of the GNU General Public License as published by cannam@127: * the Free Software Foundation; either version 2 of the License, or cannam@127: * (at your option) any later version. cannam@127: * cannam@127: * This program is distributed in the hope that it will be useful, cannam@127: * but WITHOUT ANY WARRANTY; without even the implied warranty of cannam@127: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the cannam@127: * GNU General Public License for more details. cannam@127: * cannam@127: * You should have received a copy of the GNU General Public License cannam@127: * along with this program; if not, write to the Free Software cannam@127: * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA cannam@127: * cannam@127: */ cannam@127: cannam@127: cannam@127: #include "dft.h" cannam@127: cannam@127: /* fill a complex array with zeros. */ cannam@127: static void recur(const iodim *dims, int rnk, R *ri, R *ii) cannam@127: { cannam@127: if (rnk == RNK_MINFTY) cannam@127: return; cannam@127: else if (rnk == 0) cannam@127: ri[0] = ii[0] = K(0.0); cannam@127: else if (rnk > 0) { cannam@127: INT i, n = dims[0].n; cannam@127: INT is = dims[0].is; cannam@127: cannam@127: if (rnk == 1) { cannam@127: /* this case is redundant but faster */ cannam@127: for (i = 0; i < n; ++i) cannam@127: ri[i * is] = ii[i * is] = K(0.0); cannam@127: } else { cannam@127: for (i = 0; i < n; ++i) cannam@127: recur(dims + 1, rnk - 1, ri + i * is, ii + i * is); cannam@127: } cannam@127: } cannam@127: } cannam@127: cannam@127: cannam@127: void X(dft_zerotens)(tensor *sz, R *ri, R *ii) cannam@127: { cannam@127: recur(sz->dims, sz->rnk, ri, ii); cannam@127: }