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 "dft/dft.h" cannam@167: cannam@167: /* fill a complex array with zeros. */ cannam@167: static void recur(const iodim *dims, int rnk, R *ri, R *ii) cannam@167: { cannam@167: if (rnk == RNK_MINFTY) cannam@167: return; cannam@167: else if (rnk == 0) cannam@167: ri[0] = ii[0] = K(0.0); cannam@167: else if (rnk > 0) { cannam@167: INT i, n = dims[0].n; cannam@167: INT is = dims[0].is; cannam@167: cannam@167: if (rnk == 1) { cannam@167: /* this case is redundant but faster */ cannam@167: for (i = 0; i < n; ++i) cannam@167: ri[i * is] = ii[i * is] = K(0.0); cannam@167: } else { cannam@167: for (i = 0; i < n; ++i) cannam@167: recur(dims + 1, rnk - 1, ri + i * is, ii + i * is); cannam@167: } cannam@167: } cannam@167: } cannam@167: cannam@167: cannam@167: void X(dft_zerotens)(tensor *sz, R *ri, R *ii) cannam@167: { cannam@167: recur(sz->dims, sz->rnk, ri, ii); cannam@167: }