Mercurial > hg > sv-dependency-builds
comparison src/fftw-3.3.3/kernel/cpy2d-pair.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 /* out of place copy routines for pairs of isomorphic 2D arrays */ | |
22 #include "ifftw.h" | |
23 | |
24 void X(cpy2d_pair)(R *I0, R *I1, R *O0, R *O1, | |
25 INT n0, INT is0, INT os0, | |
26 INT n1, INT is1, INT os1) | |
27 { | |
28 INT i0, i1; | |
29 | |
30 for (i1 = 0; i1 < n1; ++i1) | |
31 for (i0 = 0; i0 < n0; ++i0) { | |
32 R x0 = I0[i0 * is0 + i1 * is1]; | |
33 R x1 = I1[i0 * is0 + i1 * is1]; | |
34 O0[i0 * os0 + i1 * os1] = x0; | |
35 O1[i0 * os0 + i1 * os1] = x1; | |
36 } | |
37 } | |
38 | |
39 /* like cpy2d_pair, but read input contiguously if possible */ | |
40 void X(cpy2d_pair_ci)(R *I0, R *I1, R *O0, R *O1, | |
41 INT n0, INT is0, INT os0, | |
42 INT n1, INT is1, INT os1) | |
43 { | |
44 if (IABS(is0) < IABS(is1)) /* inner loop is for n0 */ | |
45 X(cpy2d_pair) (I0, I1, O0, O1, n0, is0, os0, n1, is1, os1); | |
46 else | |
47 X(cpy2d_pair) (I0, I1, O0, O1, n1, is1, os1, n0, is0, os0); | |
48 } | |
49 | |
50 /* like cpy2d_pair, but write output contiguously if possible */ | |
51 void X(cpy2d_pair_co)(R *I0, R *I1, R *O0, R *O1, | |
52 INT n0, INT is0, INT os0, | |
53 INT n1, INT is1, INT os1) | |
54 { | |
55 if (IABS(os0) < IABS(os1)) /* inner loop is for n0 */ | |
56 X(cpy2d_pair) (I0, I1, O0, O1, n0, is0, os0, n1, is1, os1); | |
57 else | |
58 X(cpy2d_pair) (I0, I1, O0, O1, n1, is1, os1, n0, is0, os0); | |
59 } |