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