annotate fft/fftw/fftw-3.3.4/api/mktensor-iodims.h @ 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 *MKTENSOR_IODIMS(int rank, const IODIM *dims, int is, int os)
Chris@19 24 {
Chris@19 25 int i;
Chris@19 26 tensor *x = X(mktensor)(rank);
Chris@19 27
Chris@19 28 if (FINITE_RNK(rank)) {
Chris@19 29 for (i = 0; i < rank; ++i) {
Chris@19 30 x->dims[i].n = dims[i].n;
Chris@19 31 x->dims[i].is = dims[i].is * is;
Chris@19 32 x->dims[i].os = dims[i].os * os;
Chris@19 33 }
Chris@19 34 }
Chris@19 35 return x;
Chris@19 36 }
Chris@19 37
Chris@19 38 static int iodims_kosherp(int rank, const IODIM *dims, int allow_minfty)
Chris@19 39 {
Chris@19 40 int i;
Chris@19 41
Chris@19 42 if (rank < 0) return 0;
Chris@19 43
Chris@19 44 if (allow_minfty) {
Chris@19 45 if (!FINITE_RNK(rank)) return 1;
Chris@19 46 for (i = 0; i < rank; ++i)
Chris@19 47 if (dims[i].n < 0) return 0;
Chris@19 48 } else {
Chris@19 49 if (!FINITE_RNK(rank)) return 0;
Chris@19 50 for (i = 0; i < rank; ++i)
Chris@19 51 if (dims[i].n <= 0) return 0;
Chris@19 52 }
Chris@19 53
Chris@19 54 return 1;
Chris@19 55 }
Chris@19 56
Chris@19 57 int GURU_KOSHERP(int rank, const IODIM *dims,
Chris@19 58 int howmany_rank, const IODIM *howmany_dims)
Chris@19 59 {
Chris@19 60 return (iodims_kosherp(rank, dims, 0) &&
Chris@19 61 iodims_kosherp(howmany_rank, howmany_dims, 1));
Chris@19 62 }