Mercurial > hg > sv-dependency-builds
comparison src/fftw-3.3.3/libbench2/dotens2.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 | |
22 #include "verify.h" | |
23 | |
24 static void recur(int rnk, const bench_iodim *dims0, const bench_iodim *dims1, | |
25 dotens2_closure *k, | |
26 int indx0, int ondx0, int indx1, int ondx1) | |
27 { | |
28 if (rnk == 0) | |
29 k->apply(k, indx0, ondx0, indx1, ondx1); | |
30 else { | |
31 int i, n = dims0[0].n; | |
32 int is0 = dims0[0].is; | |
33 int os0 = dims0[0].os; | |
34 int is1 = dims1[0].is; | |
35 int os1 = dims1[0].os; | |
36 | |
37 BENCH_ASSERT(n == dims1[0].n); | |
38 | |
39 for (i = 0; i < n; ++i) { | |
40 recur(rnk - 1, dims0 + 1, dims1 + 1, k, | |
41 indx0, ondx0, indx1, ondx1); | |
42 indx0 += is0; ondx0 += os0; | |
43 indx1 += is1; ondx1 += os1; | |
44 } | |
45 } | |
46 } | |
47 | |
48 void bench_dotens2(const bench_tensor *sz0, const bench_tensor *sz1, dotens2_closure *k) | |
49 { | |
50 BENCH_ASSERT(sz0->rnk == sz1->rnk); | |
51 if (sz0->rnk == RNK_MINFTY) | |
52 return; | |
53 recur(sz0->rnk, sz0->dims, sz1->dims, k, 0, 0, 0, 0); | |
54 } |