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:12 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 -n 3 -dif -name hb_3 -include hb.h */
|
Chris@10
|
29
|
Chris@10
|
30 /*
|
Chris@10
|
31 * This function contains 16 FP additions, 14 FP multiplications,
|
Chris@10
|
32 * (or, 6 additions, 4 multiplications, 10 fused multiply/add),
|
Chris@10
|
33 * 27 stack variables, 2 constants, and 12 memory accesses
|
Chris@10
|
34 */
|
Chris@10
|
35 #include "hb.h"
|
Chris@10
|
36
|
Chris@10
|
37 static void hb_3(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
|
Chris@10
|
38 {
|
Chris@10
|
39 DK(KP866025403, +0.866025403784438646763723170752936183471402627);
|
Chris@10
|
40 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
|
Chris@10
|
41 {
|
Chris@10
|
42 INT m;
|
Chris@10
|
43 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(6, rs)) {
|
Chris@10
|
44 E Tk, Tj, Tn, Tl, Tm, To;
|
Chris@10
|
45 {
|
Chris@10
|
46 E T1, Td, T7, T8, T4, Tg, T2, T3;
|
Chris@10
|
47 T1 = cr[0];
|
Chris@10
|
48 T2 = cr[WS(rs, 1)];
|
Chris@10
|
49 T3 = ci[0];
|
Chris@10
|
50 Td = ci[WS(rs, 2)];
|
Chris@10
|
51 T7 = ci[WS(rs, 1)];
|
Chris@10
|
52 T8 = cr[WS(rs, 2)];
|
Chris@10
|
53 T4 = T2 + T3;
|
Chris@10
|
54 Tg = T2 - T3;
|
Chris@10
|
55 {
|
Chris@10
|
56 E T5, Tc, Tf, Ta, T9, Te, T6, Th, Ti, Tb;
|
Chris@10
|
57 T5 = W[0];
|
Chris@10
|
58 T9 = T7 + T8;
|
Chris@10
|
59 Te = T7 - T8;
|
Chris@10
|
60 cr[0] = T1 + T4;
|
Chris@10
|
61 T6 = FNMS(KP500000000, T4, T1);
|
Chris@10
|
62 Tc = W[1];
|
Chris@10
|
63 ci[0] = Td + Te;
|
Chris@10
|
64 Tf = FNMS(KP500000000, Te, Td);
|
Chris@10
|
65 Tk = FMA(KP866025403, T9, T6);
|
Chris@10
|
66 Ta = FNMS(KP866025403, T9, T6);
|
Chris@10
|
67 Tj = W[2];
|
Chris@10
|
68 Tn = FNMS(KP866025403, Tg, Tf);
|
Chris@10
|
69 Th = FMA(KP866025403, Tg, Tf);
|
Chris@10
|
70 Ti = Tc * Ta;
|
Chris@10
|
71 Tb = T5 * Ta;
|
Chris@10
|
72 Tl = Tj * Tk;
|
Chris@10
|
73 Tm = W[3];
|
Chris@10
|
74 ci[WS(rs, 1)] = FMA(T5, Th, Ti);
|
Chris@10
|
75 cr[WS(rs, 1)] = FNMS(Tc, Th, Tb);
|
Chris@10
|
76 }
|
Chris@10
|
77 }
|
Chris@10
|
78 cr[WS(rs, 2)] = FNMS(Tm, Tn, Tl);
|
Chris@10
|
79 To = Tm * Tk;
|
Chris@10
|
80 ci[WS(rs, 2)] = FMA(Tj, Tn, To);
|
Chris@10
|
81 }
|
Chris@10
|
82 }
|
Chris@10
|
83 }
|
Chris@10
|
84
|
Chris@10
|
85 static const tw_instr twinstr[] = {
|
Chris@10
|
86 {TW_FULL, 1, 3},
|
Chris@10
|
87 {TW_NEXT, 1, 0}
|
Chris@10
|
88 };
|
Chris@10
|
89
|
Chris@10
|
90 static const hc2hc_desc desc = { 3, "hb_3", twinstr, &GENUS, {6, 4, 10, 0} };
|
Chris@10
|
91
|
Chris@10
|
92 void X(codelet_hb_3) (planner *p) {
|
Chris@10
|
93 X(khc2hc_register) (p, hb_3, &desc);
|
Chris@10
|
94 }
|
Chris@10
|
95 #else /* HAVE_FMA */
|
Chris@10
|
96
|
Chris@10
|
97 /* Generated by: ../../../genfft/gen_hc2hc.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 3 -dif -name hb_3 -include hb.h */
|
Chris@10
|
98
|
Chris@10
|
99 /*
|
Chris@10
|
100 * This function contains 16 FP additions, 12 FP multiplications,
|
Chris@10
|
101 * (or, 10 additions, 6 multiplications, 6 fused multiply/add),
|
Chris@10
|
102 * 15 stack variables, 2 constants, and 12 memory accesses
|
Chris@10
|
103 */
|
Chris@10
|
104 #include "hb.h"
|
Chris@10
|
105
|
Chris@10
|
106 static void hb_3(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
|
Chris@10
|
107 {
|
Chris@10
|
108 DK(KP866025403, +0.866025403784438646763723170752936183471402627);
|
Chris@10
|
109 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
|
Chris@10
|
110 {
|
Chris@10
|
111 INT m;
|
Chris@10
|
112 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(6, rs)) {
|
Chris@10
|
113 E T1, T4, Ta, Te, T5, T8, Tb, Tf;
|
Chris@10
|
114 {
|
Chris@10
|
115 E T2, T3, T6, T7;
|
Chris@10
|
116 T1 = cr[0];
|
Chris@10
|
117 T2 = cr[WS(rs, 1)];
|
Chris@10
|
118 T3 = ci[0];
|
Chris@10
|
119 T4 = T2 + T3;
|
Chris@10
|
120 Ta = FNMS(KP500000000, T4, T1);
|
Chris@10
|
121 Te = KP866025403 * (T2 - T3);
|
Chris@10
|
122 T5 = ci[WS(rs, 2)];
|
Chris@10
|
123 T6 = ci[WS(rs, 1)];
|
Chris@10
|
124 T7 = cr[WS(rs, 2)];
|
Chris@10
|
125 T8 = T6 - T7;
|
Chris@10
|
126 Tb = KP866025403 * (T6 + T7);
|
Chris@10
|
127 Tf = FNMS(KP500000000, T8, T5);
|
Chris@10
|
128 }
|
Chris@10
|
129 cr[0] = T1 + T4;
|
Chris@10
|
130 ci[0] = T5 + T8;
|
Chris@10
|
131 {
|
Chris@10
|
132 E Tc, Tg, T9, Td;
|
Chris@10
|
133 Tc = Ta - Tb;
|
Chris@10
|
134 Tg = Te + Tf;
|
Chris@10
|
135 T9 = W[0];
|
Chris@10
|
136 Td = W[1];
|
Chris@10
|
137 cr[WS(rs, 1)] = FNMS(Td, Tg, T9 * Tc);
|
Chris@10
|
138 ci[WS(rs, 1)] = FMA(T9, Tg, Td * Tc);
|
Chris@10
|
139 }
|
Chris@10
|
140 {
|
Chris@10
|
141 E Ti, Tk, Th, Tj;
|
Chris@10
|
142 Ti = Ta + Tb;
|
Chris@10
|
143 Tk = Tf - Te;
|
Chris@10
|
144 Th = W[2];
|
Chris@10
|
145 Tj = W[3];
|
Chris@10
|
146 cr[WS(rs, 2)] = FNMS(Tj, Tk, Th * Ti);
|
Chris@10
|
147 ci[WS(rs, 2)] = FMA(Th, Tk, Tj * Ti);
|
Chris@10
|
148 }
|
Chris@10
|
149 }
|
Chris@10
|
150 }
|
Chris@10
|
151 }
|
Chris@10
|
152
|
Chris@10
|
153 static const tw_instr twinstr[] = {
|
Chris@10
|
154 {TW_FULL, 1, 3},
|
Chris@10
|
155 {TW_NEXT, 1, 0}
|
Chris@10
|
156 };
|
Chris@10
|
157
|
Chris@10
|
158 static const hc2hc_desc desc = { 3, "hb_3", twinstr, &GENUS, {10, 6, 6, 0} };
|
Chris@10
|
159
|
Chris@10
|
160 void X(codelet_hb_3) (planner *p) {
|
Chris@10
|
161 X(khc2hc_register) (p, hb_3, &desc);
|
Chris@10
|
162 }
|
Chris@10
|
163 #endif /* HAVE_FMA */
|