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