annotate src/fftw-3.3.5/api/mktensor-rowmajor.c @ 169:223a55898ab9 tip default

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