annotate src/fftw-3.3.5/api/mktensor-rowmajor.c @ 70:9e21af8f0420

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