cannam@127
|
1 /*
|
cannam@127
|
2 * Copyright (c) 2003, 2007-14 Matteo Frigo
|
cannam@127
|
3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
|
cannam@127
|
4 *
|
cannam@127
|
5 * This program is free software; you can redistribute it and/or modify
|
cannam@127
|
6 * it under the terms of the GNU General Public License as published by
|
cannam@127
|
7 * the Free Software Foundation; either version 2 of the License, or
|
cannam@127
|
8 * (at your option) any later version.
|
cannam@127
|
9 *
|
cannam@127
|
10 * This program is distributed in the hope that it will be useful,
|
cannam@127
|
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
cannam@127
|
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
cannam@127
|
13 * GNU General Public License for more details.
|
cannam@127
|
14 *
|
cannam@127
|
15 * You should have received a copy of the GNU General Public License
|
cannam@127
|
16 * along with this program; if not, write to the Free Software
|
cannam@127
|
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
cannam@127
|
18 *
|
cannam@127
|
19 */
|
cannam@127
|
20
|
cannam@127
|
21 /* out of place 1D copy routine */
|
cannam@127
|
22 #include "ifftw.h"
|
cannam@127
|
23
|
cannam@127
|
24 void X(cpy1d)(R *I, R *O, INT n0, INT is0, INT os0, INT vl)
|
cannam@127
|
25 {
|
cannam@127
|
26 INT i0, v;
|
cannam@127
|
27
|
cannam@127
|
28 A(I != O);
|
cannam@127
|
29 switch (vl) {
|
cannam@127
|
30 case 1:
|
cannam@127
|
31 if ((n0 & 1) || is0 != 1 || os0 != 1) {
|
cannam@127
|
32 for (; n0 > 0; --n0, I += is0, O += os0)
|
cannam@127
|
33 *O = *I;
|
cannam@127
|
34 break;
|
cannam@127
|
35 }
|
cannam@127
|
36 n0 /= 2; is0 = 2; os0 = 2;
|
cannam@127
|
37 /* fall through */
|
cannam@127
|
38 case 2:
|
cannam@127
|
39 if ((n0 & 1) || is0 != 2 || os0 != 2) {
|
cannam@127
|
40 for (; n0 > 0; --n0, I += is0, O += os0) {
|
cannam@127
|
41 R x0 = I[0];
|
cannam@127
|
42 R x1 = I[1];
|
cannam@127
|
43 O[0] = x0;
|
cannam@127
|
44 O[1] = x1;
|
cannam@127
|
45 }
|
cannam@127
|
46 break;
|
cannam@127
|
47 }
|
cannam@127
|
48 n0 /= 2; is0 = 4; os0 = 4;
|
cannam@127
|
49 /* fall through */
|
cannam@127
|
50 case 4:
|
cannam@127
|
51 for (; n0 > 0; --n0, I += is0, O += os0) {
|
cannam@127
|
52 R x0 = I[0];
|
cannam@127
|
53 R x1 = I[1];
|
cannam@127
|
54 R x2 = I[2];
|
cannam@127
|
55 R x3 = I[3];
|
cannam@127
|
56 O[0] = x0;
|
cannam@127
|
57 O[1] = x1;
|
cannam@127
|
58 O[2] = x2;
|
cannam@127
|
59 O[3] = x3;
|
cannam@127
|
60 }
|
cannam@127
|
61 break;
|
cannam@127
|
62 default:
|
cannam@127
|
63 for (i0 = 0; i0 < n0; ++i0)
|
cannam@127
|
64 for (v = 0; v < vl; ++v) {
|
cannam@127
|
65 R x0 = I[i0 * is0 + v];
|
cannam@127
|
66 O[i0 * os0 + v] = x0;
|
cannam@127
|
67 }
|
cannam@127
|
68 break;
|
cannam@127
|
69 }
|
cannam@127
|
70 }
|