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