Chris@10
|
1 /*
|
Chris@10
|
2 * Copyright (c) 2003, 2007-11 Matteo Frigo
|
Chris@10
|
3 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
|
Chris@10
|
4 *
|
Chris@10
|
5 * This program is free software; you can redistribute it and/or modify
|
Chris@10
|
6 * it under the terms of the GNU General Public License as published by
|
Chris@10
|
7 * the Free Software Foundation; either version 2 of the License, or
|
Chris@10
|
8 * (at your option) any later version.
|
Chris@10
|
9 *
|
Chris@10
|
10 * This program is distributed in the hope that it will be useful,
|
Chris@10
|
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
Chris@10
|
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
Chris@10
|
13 * GNU General Public License for more details.
|
Chris@10
|
14 *
|
Chris@10
|
15 * You should have received a copy of the GNU General Public License
|
Chris@10
|
16 * along with this program; if not, write to the Free Software
|
Chris@10
|
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
Chris@10
|
18 *
|
Chris@10
|
19 */
|
Chris@10
|
20
|
Chris@10
|
21 /* This file was automatically generated --- DO NOT EDIT */
|
Chris@10
|
22 /* Generated on Sun Nov 25 07:41:23 EST 2012 */
|
Chris@10
|
23
|
Chris@10
|
24 #include "codelet-rdft.h"
|
Chris@10
|
25
|
Chris@10
|
26 #ifdef HAVE_FMA
|
Chris@10
|
27
|
Chris@10
|
28 /* Generated by: ../../../genfft/gen_hc2hc.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -sign 1 -twiddle-log3 -precompute-twiddles -n 4 -dif -name hb2_4 -include hb.h */
|
Chris@10
|
29
|
Chris@10
|
30 /*
|
Chris@10
|
31 * This function contains 24 FP additions, 16 FP multiplications,
|
Chris@10
|
32 * (or, 16 additions, 8 multiplications, 8 fused multiply/add),
|
Chris@10
|
33 * 33 stack variables, 0 constants, and 16 memory accesses
|
Chris@10
|
34 */
|
Chris@10
|
35 #include "hb.h"
|
Chris@10
|
36
|
Chris@10
|
37 static void hb2_4(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
|
Chris@10
|
38 {
|
Chris@10
|
39 {
|
Chris@10
|
40 INT m;
|
Chris@10
|
41 for (m = mb, W = W + ((mb - 1) * 4); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 4, MAKE_VOLATILE_STRIDE(8, rs)) {
|
Chris@10
|
42 E Tg, Tc, Te, To, Tn;
|
Chris@10
|
43 {
|
Chris@10
|
44 E T7, Tb, T8, Ta;
|
Chris@10
|
45 T7 = W[0];
|
Chris@10
|
46 Tb = W[3];
|
Chris@10
|
47 T8 = W[2];
|
Chris@10
|
48 Ta = W[1];
|
Chris@10
|
49 {
|
Chris@10
|
50 E Tj, Tm, T3, T6, Tx, Tr, Tz, Tv, Td;
|
Chris@10
|
51 {
|
Chris@10
|
52 E Tu, T4, Tq, T5, Tp, Tt;
|
Chris@10
|
53 {
|
Chris@10
|
54 E Tk, Tl, T1, T2;
|
Chris@10
|
55 {
|
Chris@10
|
56 E Th, Tf, T9, Ti;
|
Chris@10
|
57 Th = ci[WS(rs, 3)];
|
Chris@10
|
58 Tf = T7 * Tb;
|
Chris@10
|
59 T9 = T7 * T8;
|
Chris@10
|
60 Ti = cr[WS(rs, 2)];
|
Chris@10
|
61 Tk = ci[WS(rs, 2)];
|
Chris@10
|
62 Tg = FNMS(Ta, T8, Tf);
|
Chris@10
|
63 Tc = FMA(Ta, Tb, T9);
|
Chris@10
|
64 Tu = Th + Ti;
|
Chris@10
|
65 Tj = Th - Ti;
|
Chris@10
|
66 Tl = cr[WS(rs, 3)];
|
Chris@10
|
67 }
|
Chris@10
|
68 T1 = cr[0];
|
Chris@10
|
69 T2 = ci[WS(rs, 1)];
|
Chris@10
|
70 T4 = cr[WS(rs, 1)];
|
Chris@10
|
71 Tm = Tk - Tl;
|
Chris@10
|
72 Tq = Tk + Tl;
|
Chris@10
|
73 T5 = ci[0];
|
Chris@10
|
74 T3 = T1 + T2;
|
Chris@10
|
75 Tp = T1 - T2;
|
Chris@10
|
76 }
|
Chris@10
|
77 Tt = T4 - T5;
|
Chris@10
|
78 T6 = T4 + T5;
|
Chris@10
|
79 Tx = Tp + Tq;
|
Chris@10
|
80 Tr = Tp - Tq;
|
Chris@10
|
81 Tz = Tu - Tt;
|
Chris@10
|
82 Tv = Tt + Tu;
|
Chris@10
|
83 Td = T3 - T6;
|
Chris@10
|
84 }
|
Chris@10
|
85 {
|
Chris@10
|
86 E Ts, Tw, TA, Ty;
|
Chris@10
|
87 cr[0] = T3 + T6;
|
Chris@10
|
88 Ts = T7 * Tr;
|
Chris@10
|
89 ci[0] = Tj + Tm;
|
Chris@10
|
90 Tw = T7 * Tv;
|
Chris@10
|
91 TA = T8 * Tz;
|
Chris@10
|
92 cr[WS(rs, 1)] = FNMS(Ta, Tv, Ts);
|
Chris@10
|
93 Ty = T8 * Tx;
|
Chris@10
|
94 ci[WS(rs, 1)] = FMA(Ta, Tr, Tw);
|
Chris@10
|
95 ci[WS(rs, 3)] = FMA(Tb, Tx, TA);
|
Chris@10
|
96 Te = Tc * Td;
|
Chris@10
|
97 cr[WS(rs, 3)] = FNMS(Tb, Tz, Ty);
|
Chris@10
|
98 To = Tg * Td;
|
Chris@10
|
99 Tn = Tj - Tm;
|
Chris@10
|
100 }
|
Chris@10
|
101 }
|
Chris@10
|
102 }
|
Chris@10
|
103 ci[WS(rs, 2)] = FMA(Tc, Tn, To);
|
Chris@10
|
104 cr[WS(rs, 2)] = FNMS(Tg, Tn, Te);
|
Chris@10
|
105 }
|
Chris@10
|
106 }
|
Chris@10
|
107 }
|
Chris@10
|
108
|
Chris@10
|
109 static const tw_instr twinstr[] = {
|
Chris@10
|
110 {TW_CEXP, 1, 1},
|
Chris@10
|
111 {TW_CEXP, 1, 3},
|
Chris@10
|
112 {TW_NEXT, 1, 0}
|
Chris@10
|
113 };
|
Chris@10
|
114
|
Chris@10
|
115 static const hc2hc_desc desc = { 4, "hb2_4", twinstr, &GENUS, {16, 8, 8, 0} };
|
Chris@10
|
116
|
Chris@10
|
117 void X(codelet_hb2_4) (planner *p) {
|
Chris@10
|
118 X(khc2hc_register) (p, hb2_4, &desc);
|
Chris@10
|
119 }
|
Chris@10
|
120 #else /* HAVE_FMA */
|
Chris@10
|
121
|
Chris@10
|
122 /* Generated by: ../../../genfft/gen_hc2hc.native -compact -variables 4 -pipeline-latency 4 -sign 1 -twiddle-log3 -precompute-twiddles -n 4 -dif -name hb2_4 -include hb.h */
|
Chris@10
|
123
|
Chris@10
|
124 /*
|
Chris@10
|
125 * This function contains 24 FP additions, 16 FP multiplications,
|
Chris@10
|
126 * (or, 16 additions, 8 multiplications, 8 fused multiply/add),
|
Chris@10
|
127 * 21 stack variables, 0 constants, and 16 memory accesses
|
Chris@10
|
128 */
|
Chris@10
|
129 #include "hb.h"
|
Chris@10
|
130
|
Chris@10
|
131 static void hb2_4(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
|
Chris@10
|
132 {
|
Chris@10
|
133 {
|
Chris@10
|
134 INT m;
|
Chris@10
|
135 for (m = mb, W = W + ((mb - 1) * 4); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 4, MAKE_VOLATILE_STRIDE(8, rs)) {
|
Chris@10
|
136 E T7, T9, T8, Ta, Tb, Td;
|
Chris@10
|
137 T7 = W[0];
|
Chris@10
|
138 T9 = W[1];
|
Chris@10
|
139 T8 = W[2];
|
Chris@10
|
140 Ta = W[3];
|
Chris@10
|
141 Tb = FMA(T7, T8, T9 * Ta);
|
Chris@10
|
142 Td = FNMS(T9, T8, T7 * Ta);
|
Chris@10
|
143 {
|
Chris@10
|
144 E T3, Tl, T6, To, Tg, Tp, Tj, Tm, Tc, Tk;
|
Chris@10
|
145 {
|
Chris@10
|
146 E T1, T2, T4, T5;
|
Chris@10
|
147 T1 = cr[0];
|
Chris@10
|
148 T2 = ci[WS(rs, 1)];
|
Chris@10
|
149 T3 = T1 + T2;
|
Chris@10
|
150 Tl = T1 - T2;
|
Chris@10
|
151 T4 = cr[WS(rs, 1)];
|
Chris@10
|
152 T5 = ci[0];
|
Chris@10
|
153 T6 = T4 + T5;
|
Chris@10
|
154 To = T4 - T5;
|
Chris@10
|
155 }
|
Chris@10
|
156 {
|
Chris@10
|
157 E Te, Tf, Th, Ti;
|
Chris@10
|
158 Te = ci[WS(rs, 3)];
|
Chris@10
|
159 Tf = cr[WS(rs, 2)];
|
Chris@10
|
160 Tg = Te - Tf;
|
Chris@10
|
161 Tp = Te + Tf;
|
Chris@10
|
162 Th = ci[WS(rs, 2)];
|
Chris@10
|
163 Ti = cr[WS(rs, 3)];
|
Chris@10
|
164 Tj = Th - Ti;
|
Chris@10
|
165 Tm = Th + Ti;
|
Chris@10
|
166 }
|
Chris@10
|
167 cr[0] = T3 + T6;
|
Chris@10
|
168 ci[0] = Tg + Tj;
|
Chris@10
|
169 Tc = T3 - T6;
|
Chris@10
|
170 Tk = Tg - Tj;
|
Chris@10
|
171 cr[WS(rs, 2)] = FNMS(Td, Tk, Tb * Tc);
|
Chris@10
|
172 ci[WS(rs, 2)] = FMA(Td, Tc, Tb * Tk);
|
Chris@10
|
173 {
|
Chris@10
|
174 E Tn, Tq, Tr, Ts;
|
Chris@10
|
175 Tn = Tl - Tm;
|
Chris@10
|
176 Tq = To + Tp;
|
Chris@10
|
177 cr[WS(rs, 1)] = FNMS(T9, Tq, T7 * Tn);
|
Chris@10
|
178 ci[WS(rs, 1)] = FMA(T7, Tq, T9 * Tn);
|
Chris@10
|
179 Tr = Tl + Tm;
|
Chris@10
|
180 Ts = Tp - To;
|
Chris@10
|
181 cr[WS(rs, 3)] = FNMS(Ta, Ts, T8 * Tr);
|
Chris@10
|
182 ci[WS(rs, 3)] = FMA(T8, Ts, Ta * Tr);
|
Chris@10
|
183 }
|
Chris@10
|
184 }
|
Chris@10
|
185 }
|
Chris@10
|
186 }
|
Chris@10
|
187 }
|
Chris@10
|
188
|
Chris@10
|
189 static const tw_instr twinstr[] = {
|
Chris@10
|
190 {TW_CEXP, 1, 1},
|
Chris@10
|
191 {TW_CEXP, 1, 3},
|
Chris@10
|
192 {TW_NEXT, 1, 0}
|
Chris@10
|
193 };
|
Chris@10
|
194
|
Chris@10
|
195 static const hc2hc_desc desc = { 4, "hb2_4", twinstr, &GENUS, {16, 8, 8, 0} };
|
Chris@10
|
196
|
Chris@10
|
197 void X(codelet_hb2_4) (planner *p) {
|
Chris@10
|
198 X(khc2hc_register) (p, hb2_4, &desc);
|
Chris@10
|
199 }
|
Chris@10
|
200 #endif /* HAVE_FMA */
|