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