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