Mercurial > hg > sv-dependency-builds
comparison src/fftw-3.3.3/dft/simd/common/n2fv_2.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 /* This file was automatically generated --- DO NOT EDIT */ | |
22 /* Generated on Sun Nov 25 07:37:21 EST 2012 */ | |
23 | |
24 #include "codelet-dft.h" | |
25 | |
26 #ifdef HAVE_FMA | |
27 | |
28 /* Generated by: ../../../genfft/gen_notw_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 2 -name n2fv_2 -with-ostride 2 -include n2f.h -store-multiple 2 */ | |
29 | |
30 /* | |
31 * This function contains 2 FP additions, 0 FP multiplications, | |
32 * (or, 2 additions, 0 multiplications, 0 fused multiply/add), | |
33 * 7 stack variables, 0 constants, and 5 memory accesses | |
34 */ | |
35 #include "n2f.h" | |
36 | |
37 static void n2fv_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs) | |
38 { | |
39 { | |
40 INT i; | |
41 const R *xi; | |
42 R *xo; | |
43 xi = ri; | |
44 xo = ro; | |
45 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(4, is), MAKE_VOLATILE_STRIDE(4, os)) { | |
46 V T1, T2, T3, T4; | |
47 T1 = LD(&(xi[0]), ivs, &(xi[0])); | |
48 T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)])); | |
49 T3 = VADD(T1, T2); | |
50 STM2(&(xo[0]), T3, ovs, &(xo[0])); | |
51 T4 = VSUB(T1, T2); | |
52 STM2(&(xo[2]), T4, ovs, &(xo[2])); | |
53 STN2(&(xo[0]), T3, T4, ovs); | |
54 } | |
55 } | |
56 VLEAVE(); | |
57 } | |
58 | |
59 static const kdft_desc desc = { 2, XSIMD_STRING("n2fv_2"), {2, 0, 0, 0}, &GENUS, 0, 2, 0, 0 }; | |
60 | |
61 void XSIMD(codelet_n2fv_2) (planner *p) { | |
62 X(kdft_register) (p, n2fv_2, &desc); | |
63 } | |
64 | |
65 #else /* HAVE_FMA */ | |
66 | |
67 /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 2 -name n2fv_2 -with-ostride 2 -include n2f.h -store-multiple 2 */ | |
68 | |
69 /* | |
70 * This function contains 2 FP additions, 0 FP multiplications, | |
71 * (or, 2 additions, 0 multiplications, 0 fused multiply/add), | |
72 * 7 stack variables, 0 constants, and 5 memory accesses | |
73 */ | |
74 #include "n2f.h" | |
75 | |
76 static void n2fv_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs) | |
77 { | |
78 { | |
79 INT i; | |
80 const R *xi; | |
81 R *xo; | |
82 xi = ri; | |
83 xo = ro; | |
84 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(4, is), MAKE_VOLATILE_STRIDE(4, os)) { | |
85 V T1, T2, T3, T4; | |
86 T1 = LD(&(xi[0]), ivs, &(xi[0])); | |
87 T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)])); | |
88 T3 = VSUB(T1, T2); | |
89 STM2(&(xo[2]), T3, ovs, &(xo[2])); | |
90 T4 = VADD(T1, T2); | |
91 STM2(&(xo[0]), T4, ovs, &(xo[0])); | |
92 STN2(&(xo[0]), T4, T3, ovs); | |
93 } | |
94 } | |
95 VLEAVE(); | |
96 } | |
97 | |
98 static const kdft_desc desc = { 2, XSIMD_STRING("n2fv_2"), {2, 0, 0, 0}, &GENUS, 0, 2, 0, 0 }; | |
99 | |
100 void XSIMD(codelet_n2fv_2) (planner *p) { | |
101 X(kdft_register) (p, n2fv_2, &desc); | |
102 } | |
103 | |
104 #endif /* HAVE_FMA */ |