annotate src/fftw-3.3.8/api/mktensor-rowmajor.c @ 82:d0c2a83c1364

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