annotate fft/fftw/fftw-3.3.4/api/mktensor-rowmajor.c @ 40:223f770b5341 kissfft-double tip

Try a double-precision kissfft
author Chris Cannam
date Wed, 07 Sep 2016 10:40:32 +0100
parents 26056e866c29
children
rev   line source
Chris@19 1 /*
Chris@19 2 * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@19 3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@19 4 *
Chris@19 5 * This program is free software; you can redistribute it and/or modify
Chris@19 6 * it under the terms of the GNU General Public License as published by
Chris@19 7 * the Free Software Foundation; either version 2 of the License, or
Chris@19 8 * (at your option) any later version.
Chris@19 9 *
Chris@19 10 * This program is distributed in the hope that it will be useful,
Chris@19 11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@19 12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@19 13 * GNU General Public License for more details.
Chris@19 14 *
Chris@19 15 * You should have received a copy of the GNU General Public License
Chris@19 16 * along with this program; if not, write to the Free Software
Chris@19 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@19 18 *
Chris@19 19 */
Chris@19 20
Chris@19 21 #include "api.h"
Chris@19 22
Chris@19 23 tensor *X(mktensor_rowmajor)(int rnk, const int *n,
Chris@19 24 const int *niphys, const int *nophys,
Chris@19 25 int is, int os)
Chris@19 26 {
Chris@19 27 tensor *x = X(mktensor)(rnk);
Chris@19 28
Chris@19 29 if (FINITE_RNK(rnk) && rnk > 0) {
Chris@19 30 int i;
Chris@19 31
Chris@19 32 A(n && niphys && nophys);
Chris@19 33 x->dims[rnk - 1].is = is;
Chris@19 34 x->dims[rnk - 1].os = os;
Chris@19 35 x->dims[rnk - 1].n = n[rnk - 1];
Chris@19 36 for (i = rnk - 1; i > 0; --i) {
Chris@19 37 x->dims[i - 1].is = x->dims[i].is * niphys[i];
Chris@19 38 x->dims[i - 1].os = x->dims[i].os * nophys[i];
Chris@19 39 x->dims[i - 1].n = n[i - 1];
Chris@19 40 }
Chris@19 41 }
Chris@19 42 return x;
Chris@19 43 }
Chris@19 44
Chris@19 45 static int rowmajor_kosherp(int rnk, const int *n)
Chris@19 46 {
Chris@19 47 int i;
Chris@19 48
Chris@19 49 if (!FINITE_RNK(rnk)) return 0;
Chris@19 50 if (rnk < 0) return 0;
Chris@19 51
Chris@19 52 for (i = 0; i < rnk; ++i)
Chris@19 53 if (n[i] <= 0) return 0;
Chris@19 54
Chris@19 55 return 1;
Chris@19 56 }
Chris@19 57
Chris@19 58 int X(many_kosherp)(int rnk, const int *n, int howmany)
Chris@19 59 {
Chris@19 60 return (howmany >= 0) && rowmajor_kosherp(rnk, n);
Chris@19 61 }