annotate src/fftw-3.3.3/api/mktensor-rowmajor.c @ 23:619f715526df sv_v2.1

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