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:35:59 EST 2012 */
|
Chris@10
|
23
|
Chris@10
|
24 #include "codelet-dft.h"
|
Chris@10
|
25
|
Chris@10
|
26 #ifdef HAVE_FMA
|
Chris@10
|
27
|
Chris@10
|
28 /* Generated by: ../../../genfft/gen_twiddle.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -twiddle-log3 -precompute-twiddles -n 4 -name t2_4 -include t.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 "t.h"
|
Chris@10
|
36
|
Chris@10
|
37 static void t2_4(R *ri, R *ii, 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 * 4); m < me; m = m + 1, ri = ri + ms, ii = ii + ms, W = W + 4, MAKE_VOLATILE_STRIDE(8, rs)) {
|
Chris@10
|
42 E Ti, Tq, To, Te, Ty, Tz, Tm, Ts;
|
Chris@10
|
43 {
|
Chris@10
|
44 E T2, T6, T3, T5;
|
Chris@10
|
45 T2 = W[0];
|
Chris@10
|
46 T6 = W[3];
|
Chris@10
|
47 T3 = W[2];
|
Chris@10
|
48 T5 = W[1];
|
Chris@10
|
49 {
|
Chris@10
|
50 E T1, Tx, Td, Tw, Tj, Tl, Ta, T4, Tk, Tr;
|
Chris@10
|
51 T1 = ri[0];
|
Chris@10
|
52 Ta = T2 * T6;
|
Chris@10
|
53 T4 = T2 * T3;
|
Chris@10
|
54 Tx = ii[0];
|
Chris@10
|
55 {
|
Chris@10
|
56 E T8, Tb, T7, Tc;
|
Chris@10
|
57 T8 = ri[WS(rs, 2)];
|
Chris@10
|
58 Tb = FNMS(T5, T3, Ta);
|
Chris@10
|
59 T7 = FMA(T5, T6, T4);
|
Chris@10
|
60 Tc = ii[WS(rs, 2)];
|
Chris@10
|
61 {
|
Chris@10
|
62 E Tf, Th, T9, Tv, Tg, Tp;
|
Chris@10
|
63 Tf = ri[WS(rs, 1)];
|
Chris@10
|
64 Th = ii[WS(rs, 1)];
|
Chris@10
|
65 T9 = T7 * T8;
|
Chris@10
|
66 Tv = T7 * Tc;
|
Chris@10
|
67 Tg = T2 * Tf;
|
Chris@10
|
68 Tp = T2 * Th;
|
Chris@10
|
69 Td = FMA(Tb, Tc, T9);
|
Chris@10
|
70 Tw = FNMS(Tb, T8, Tv);
|
Chris@10
|
71 Ti = FMA(T5, Th, Tg);
|
Chris@10
|
72 Tq = FNMS(T5, Tf, Tp);
|
Chris@10
|
73 }
|
Chris@10
|
74 Tj = ri[WS(rs, 3)];
|
Chris@10
|
75 Tl = ii[WS(rs, 3)];
|
Chris@10
|
76 }
|
Chris@10
|
77 To = T1 - Td;
|
Chris@10
|
78 Te = T1 + Td;
|
Chris@10
|
79 Ty = Tw + Tx;
|
Chris@10
|
80 Tz = Tx - Tw;
|
Chris@10
|
81 Tk = T3 * Tj;
|
Chris@10
|
82 Tr = T3 * Tl;
|
Chris@10
|
83 Tm = FMA(T6, Tl, Tk);
|
Chris@10
|
84 Ts = FNMS(T6, Tj, Tr);
|
Chris@10
|
85 }
|
Chris@10
|
86 }
|
Chris@10
|
87 {
|
Chris@10
|
88 E Tn, TA, Tu, Tt;
|
Chris@10
|
89 Tn = Ti + Tm;
|
Chris@10
|
90 TA = Ti - Tm;
|
Chris@10
|
91 Tu = Tq + Ts;
|
Chris@10
|
92 Tt = Tq - Ts;
|
Chris@10
|
93 ii[WS(rs, 3)] = TA + Tz;
|
Chris@10
|
94 ii[WS(rs, 1)] = Tz - TA;
|
Chris@10
|
95 ri[0] = Te + Tn;
|
Chris@10
|
96 ri[WS(rs, 2)] = Te - Tn;
|
Chris@10
|
97 ri[WS(rs, 1)] = To + Tt;
|
Chris@10
|
98 ri[WS(rs, 3)] = To - Tt;
|
Chris@10
|
99 ii[WS(rs, 2)] = Ty - Tu;
|
Chris@10
|
100 ii[0] = Tu + Ty;
|
Chris@10
|
101 }
|
Chris@10
|
102 }
|
Chris@10
|
103 }
|
Chris@10
|
104 }
|
Chris@10
|
105
|
Chris@10
|
106 static const tw_instr twinstr[] = {
|
Chris@10
|
107 {TW_CEXP, 0, 1},
|
Chris@10
|
108 {TW_CEXP, 0, 3},
|
Chris@10
|
109 {TW_NEXT, 1, 0}
|
Chris@10
|
110 };
|
Chris@10
|
111
|
Chris@10
|
112 static const ct_desc desc = { 4, "t2_4", twinstr, &GENUS, {16, 8, 8, 0}, 0, 0, 0 };
|
Chris@10
|
113
|
Chris@10
|
114 void X(codelet_t2_4) (planner *p) {
|
Chris@10
|
115 X(kdft_dit_register) (p, t2_4, &desc);
|
Chris@10
|
116 }
|
Chris@10
|
117 #else /* HAVE_FMA */
|
Chris@10
|
118
|
Chris@10
|
119 /* Generated by: ../../../genfft/gen_twiddle.native -compact -variables 4 -pipeline-latency 4 -twiddle-log3 -precompute-twiddles -n 4 -name t2_4 -include t.h */
|
Chris@10
|
120
|
Chris@10
|
121 /*
|
Chris@10
|
122 * This function contains 24 FP additions, 16 FP multiplications,
|
Chris@10
|
123 * (or, 16 additions, 8 multiplications, 8 fused multiply/add),
|
Chris@10
|
124 * 21 stack variables, 0 constants, and 16 memory accesses
|
Chris@10
|
125 */
|
Chris@10
|
126 #include "t.h"
|
Chris@10
|
127
|
Chris@10
|
128 static void t2_4(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
|
Chris@10
|
129 {
|
Chris@10
|
130 {
|
Chris@10
|
131 INT m;
|
Chris@10
|
132 for (m = mb, W = W + (mb * 4); m < me; m = m + 1, ri = ri + ms, ii = ii + ms, W = W + 4, MAKE_VOLATILE_STRIDE(8, rs)) {
|
Chris@10
|
133 E T2, T4, T3, T5, T6, T8;
|
Chris@10
|
134 T2 = W[0];
|
Chris@10
|
135 T4 = W[1];
|
Chris@10
|
136 T3 = W[2];
|
Chris@10
|
137 T5 = W[3];
|
Chris@10
|
138 T6 = FMA(T2, T3, T4 * T5);
|
Chris@10
|
139 T8 = FNMS(T4, T3, T2 * T5);
|
Chris@10
|
140 {
|
Chris@10
|
141 E T1, Tp, Ta, To, Te, Tk, Th, Tl, T7, T9;
|
Chris@10
|
142 T1 = ri[0];
|
Chris@10
|
143 Tp = ii[0];
|
Chris@10
|
144 T7 = ri[WS(rs, 2)];
|
Chris@10
|
145 T9 = ii[WS(rs, 2)];
|
Chris@10
|
146 Ta = FMA(T6, T7, T8 * T9);
|
Chris@10
|
147 To = FNMS(T8, T7, T6 * T9);
|
Chris@10
|
148 {
|
Chris@10
|
149 E Tc, Td, Tf, Tg;
|
Chris@10
|
150 Tc = ri[WS(rs, 1)];
|
Chris@10
|
151 Td = ii[WS(rs, 1)];
|
Chris@10
|
152 Te = FMA(T2, Tc, T4 * Td);
|
Chris@10
|
153 Tk = FNMS(T4, Tc, T2 * Td);
|
Chris@10
|
154 Tf = ri[WS(rs, 3)];
|
Chris@10
|
155 Tg = ii[WS(rs, 3)];
|
Chris@10
|
156 Th = FMA(T3, Tf, T5 * Tg);
|
Chris@10
|
157 Tl = FNMS(T5, Tf, T3 * Tg);
|
Chris@10
|
158 }
|
Chris@10
|
159 {
|
Chris@10
|
160 E Tb, Ti, Tn, Tq;
|
Chris@10
|
161 Tb = T1 + Ta;
|
Chris@10
|
162 Ti = Te + Th;
|
Chris@10
|
163 ri[WS(rs, 2)] = Tb - Ti;
|
Chris@10
|
164 ri[0] = Tb + Ti;
|
Chris@10
|
165 Tn = Tk + Tl;
|
Chris@10
|
166 Tq = To + Tp;
|
Chris@10
|
167 ii[0] = Tn + Tq;
|
Chris@10
|
168 ii[WS(rs, 2)] = Tq - Tn;
|
Chris@10
|
169 }
|
Chris@10
|
170 {
|
Chris@10
|
171 E Tj, Tm, Tr, Ts;
|
Chris@10
|
172 Tj = T1 - Ta;
|
Chris@10
|
173 Tm = Tk - Tl;
|
Chris@10
|
174 ri[WS(rs, 3)] = Tj - Tm;
|
Chris@10
|
175 ri[WS(rs, 1)] = Tj + Tm;
|
Chris@10
|
176 Tr = Tp - To;
|
Chris@10
|
177 Ts = Te - Th;
|
Chris@10
|
178 ii[WS(rs, 1)] = Tr - Ts;
|
Chris@10
|
179 ii[WS(rs, 3)] = Ts + Tr;
|
Chris@10
|
180 }
|
Chris@10
|
181 }
|
Chris@10
|
182 }
|
Chris@10
|
183 }
|
Chris@10
|
184 }
|
Chris@10
|
185
|
Chris@10
|
186 static const tw_instr twinstr[] = {
|
Chris@10
|
187 {TW_CEXP, 0, 1},
|
Chris@10
|
188 {TW_CEXP, 0, 3},
|
Chris@10
|
189 {TW_NEXT, 1, 0}
|
Chris@10
|
190 };
|
Chris@10
|
191
|
Chris@10
|
192 static const ct_desc desc = { 4, "t2_4", twinstr, &GENUS, {16, 8, 8, 0}, 0, 0, 0 };
|
Chris@10
|
193
|
Chris@10
|
194 void X(codelet_t2_4) (planner *p) {
|
Chris@10
|
195 X(kdft_dit_register) (p, t2_4, &desc);
|
Chris@10
|
196 }
|
Chris@10
|
197 #endif /* HAVE_FMA */
|