Mercurial > hg > sv-dependency-builds
comparison src/fftw-3.3.3/rdft/scalar/r2cf/hc2cfdft_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:40:44 EST 2012 */ | |
23 | |
24 #include "codelet-rdft.h" | |
25 | |
26 #ifdef HAVE_FMA | |
27 | |
28 /* Generated by: ../../../genfft/gen_hc2cdft.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 2 -dit -name hc2cfdft_2 -include hc2cf.h */ | |
29 | |
30 /* | |
31 * This function contains 10 FP additions, 8 FP multiplications, | |
32 * (or, 8 additions, 6 multiplications, 2 fused multiply/add), | |
33 * 12 stack variables, 1 constants, and 8 memory accesses | |
34 */ | |
35 #include "hc2cf.h" | |
36 | |
37 static void hc2cfdft_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms) | |
38 { | |
39 DK(KP500000000, +0.500000000000000000000000000000000000000000000); | |
40 { | |
41 INT m; | |
42 for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 2, MAKE_VOLATILE_STRIDE(8, rs)) { | |
43 E T9, Ta, T3, Tc, T7, T4; | |
44 { | |
45 E T1, T2, T5, T6; | |
46 T1 = Ip[0]; | |
47 T2 = Im[0]; | |
48 T5 = Rm[0]; | |
49 T6 = Rp[0]; | |
50 T9 = W[1]; | |
51 Ta = T1 + T2; | |
52 T3 = T1 - T2; | |
53 Tc = T6 + T5; | |
54 T7 = T5 - T6; | |
55 T4 = W[0]; | |
56 } | |
57 { | |
58 E Td, T8, Te, Tb; | |
59 Td = T9 * T7; | |
60 T8 = T4 * T7; | |
61 Te = FMA(T4, Ta, Td); | |
62 Tb = FNMS(T9, Ta, T8); | |
63 Rp[0] = KP500000000 * (Tc + Te); | |
64 Rm[0] = KP500000000 * (Tc - Te); | |
65 Im[0] = KP500000000 * (Tb - T3); | |
66 Ip[0] = KP500000000 * (T3 + Tb); | |
67 } | |
68 } | |
69 } | |
70 } | |
71 | |
72 static const tw_instr twinstr[] = { | |
73 {TW_FULL, 1, 2}, | |
74 {TW_NEXT, 1, 0} | |
75 }; | |
76 | |
77 static const hc2c_desc desc = { 2, "hc2cfdft_2", twinstr, &GENUS, {8, 6, 2, 0} }; | |
78 | |
79 void X(codelet_hc2cfdft_2) (planner *p) { | |
80 X(khc2c_register) (p, hc2cfdft_2, &desc, HC2C_VIA_DFT); | |
81 } | |
82 #else /* HAVE_FMA */ | |
83 | |
84 /* Generated by: ../../../genfft/gen_hc2cdft.native -compact -variables 4 -pipeline-latency 4 -n 2 -dit -name hc2cfdft_2 -include hc2cf.h */ | |
85 | |
86 /* | |
87 * This function contains 10 FP additions, 8 FP multiplications, | |
88 * (or, 8 additions, 6 multiplications, 2 fused multiply/add), | |
89 * 10 stack variables, 1 constants, and 8 memory accesses | |
90 */ | |
91 #include "hc2cf.h" | |
92 | |
93 static void hc2cfdft_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms) | |
94 { | |
95 DK(KP500000000, +0.500000000000000000000000000000000000000000000); | |
96 { | |
97 INT m; | |
98 for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 2, MAKE_VOLATILE_STRIDE(8, rs)) { | |
99 E T3, T9, T7, Tb; | |
100 { | |
101 E T1, T2, T5, T6; | |
102 T1 = Ip[0]; | |
103 T2 = Im[0]; | |
104 T3 = T1 - T2; | |
105 T9 = T1 + T2; | |
106 T5 = Rm[0]; | |
107 T6 = Rp[0]; | |
108 T7 = T5 - T6; | |
109 Tb = T6 + T5; | |
110 } | |
111 { | |
112 E Ta, Tc, T4, T8; | |
113 T4 = W[0]; | |
114 T8 = W[1]; | |
115 Ta = FNMS(T8, T9, T4 * T7); | |
116 Tc = FMA(T8, T7, T4 * T9); | |
117 Ip[0] = KP500000000 * (T3 + Ta); | |
118 Rp[0] = KP500000000 * (Tb + Tc); | |
119 Im[0] = KP500000000 * (Ta - T3); | |
120 Rm[0] = KP500000000 * (Tb - Tc); | |
121 } | |
122 } | |
123 } | |
124 } | |
125 | |
126 static const tw_instr twinstr[] = { | |
127 {TW_FULL, 1, 2}, | |
128 {TW_NEXT, 1, 0} | |
129 }; | |
130 | |
131 static const hc2c_desc desc = { 2, "hc2cfdft_2", twinstr, &GENUS, {8, 6, 2, 0} }; | |
132 | |
133 void X(codelet_hc2cfdft_2) (planner *p) { | |
134 X(khc2c_register) (p, hc2cfdft_2, &desc, HC2C_VIA_DFT); | |
135 } | |
136 #endif /* HAVE_FMA */ |