annotate src/fftw-3.3.8/api/mktensor-rowmajor.c @ 167:bd3cc4d1df30

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