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:33 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_r2cb.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -sign 1 -n 6 -name r2cbIII_6 -dft-III -include r2cbIII.h */
|
Chris@10
|
29
|
Chris@10
|
30 /*
|
Chris@10
|
31 * This function contains 12 FP additions, 8 FP multiplications,
|
Chris@10
|
32 * (or, 6 additions, 2 multiplications, 6 fused multiply/add),
|
Chris@10
|
33 * 15 stack variables, 2 constants, and 12 memory accesses
|
Chris@10
|
34 */
|
Chris@10
|
35 #include "r2cbIII.h"
|
Chris@10
|
36
|
Chris@10
|
37 static void r2cbIII_6(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
|
Chris@10
|
38 {
|
Chris@10
|
39 DK(KP1_732050807, +1.732050807568877293527446341505872366942805254);
|
Chris@10
|
40 DK(KP2_000000000, +2.000000000000000000000000000000000000000000000);
|
Chris@10
|
41 {
|
Chris@10
|
42 INT i;
|
Chris@10
|
43 for (i = v; i > 0; i = i - 1, R0 = R0 + ovs, R1 = R1 + ovs, Cr = Cr + ivs, Ci = Ci + ivs, MAKE_VOLATILE_STRIDE(24, rs), MAKE_VOLATILE_STRIDE(24, csr), MAKE_VOLATILE_STRIDE(24, csi)) {
|
Chris@10
|
44 E T1, T8, T2, T3, T5, T6;
|
Chris@10
|
45 T1 = Cr[WS(csr, 1)];
|
Chris@10
|
46 T8 = Ci[WS(csi, 1)];
|
Chris@10
|
47 T2 = Cr[WS(csr, 2)];
|
Chris@10
|
48 T3 = Cr[0];
|
Chris@10
|
49 T5 = Ci[WS(csi, 2)];
|
Chris@10
|
50 T6 = Ci[0];
|
Chris@10
|
51 {
|
Chris@10
|
52 E T4, Ta, T7, Tc, Tb, T9;
|
Chris@10
|
53 T4 = T2 + T3;
|
Chris@10
|
54 Ta = T2 - T3;
|
Chris@10
|
55 T7 = T5 + T6;
|
Chris@10
|
56 Tc = T5 - T6;
|
Chris@10
|
57 Tb = FNMS(KP2_000000000, T1, T4);
|
Chris@10
|
58 R0[0] = KP2_000000000 * (T1 + T4);
|
Chris@10
|
59 T9 = FMA(KP2_000000000, T8, T7);
|
Chris@10
|
60 R1[WS(rs, 1)] = KP2_000000000 * (T8 - T7);
|
Chris@10
|
61 R0[WS(rs, 2)] = FMS(KP1_732050807, Tc, Tb);
|
Chris@10
|
62 R0[WS(rs, 1)] = FMA(KP1_732050807, Tc, Tb);
|
Chris@10
|
63 R1[WS(rs, 2)] = FMS(KP1_732050807, Ta, T9);
|
Chris@10
|
64 R1[0] = -(FMA(KP1_732050807, Ta, T9));
|
Chris@10
|
65 }
|
Chris@10
|
66 }
|
Chris@10
|
67 }
|
Chris@10
|
68 }
|
Chris@10
|
69
|
Chris@10
|
70 static const kr2c_desc desc = { 6, "r2cbIII_6", {6, 2, 6, 0}, &GENUS };
|
Chris@10
|
71
|
Chris@10
|
72 void X(codelet_r2cbIII_6) (planner *p) {
|
Chris@10
|
73 X(kr2c_register) (p, r2cbIII_6, &desc);
|
Chris@10
|
74 }
|
Chris@10
|
75
|
Chris@10
|
76 #else /* HAVE_FMA */
|
Chris@10
|
77
|
Chris@10
|
78 /* Generated by: ../../../genfft/gen_r2cb.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 6 -name r2cbIII_6 -dft-III -include r2cbIII.h */
|
Chris@10
|
79
|
Chris@10
|
80 /*
|
Chris@10
|
81 * This function contains 12 FP additions, 6 FP multiplications,
|
Chris@10
|
82 * (or, 10 additions, 4 multiplications, 2 fused multiply/add),
|
Chris@10
|
83 * 15 stack variables, 2 constants, and 12 memory accesses
|
Chris@10
|
84 */
|
Chris@10
|
85 #include "r2cbIII.h"
|
Chris@10
|
86
|
Chris@10
|
87 static void r2cbIII_6(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
|
Chris@10
|
88 {
|
Chris@10
|
89 DK(KP2_000000000, +2.000000000000000000000000000000000000000000000);
|
Chris@10
|
90 DK(KP1_732050807, +1.732050807568877293527446341505872366942805254);
|
Chris@10
|
91 {
|
Chris@10
|
92 INT i;
|
Chris@10
|
93 for (i = v; i > 0; i = i - 1, R0 = R0 + ovs, R1 = R1 + ovs, Cr = Cr + ivs, Ci = Ci + ivs, MAKE_VOLATILE_STRIDE(24, rs), MAKE_VOLATILE_STRIDE(24, csr), MAKE_VOLATILE_STRIDE(24, csi)) {
|
Chris@10
|
94 E T1, T6, T4, T5, T9, Tb, Ta, Tc;
|
Chris@10
|
95 T1 = Cr[WS(csr, 1)];
|
Chris@10
|
96 T6 = Ci[WS(csi, 1)];
|
Chris@10
|
97 {
|
Chris@10
|
98 E T2, T3, T7, T8;
|
Chris@10
|
99 T2 = Cr[WS(csr, 2)];
|
Chris@10
|
100 T3 = Cr[0];
|
Chris@10
|
101 T4 = T2 + T3;
|
Chris@10
|
102 T5 = KP1_732050807 * (T2 - T3);
|
Chris@10
|
103 T7 = Ci[WS(csi, 2)];
|
Chris@10
|
104 T8 = Ci[0];
|
Chris@10
|
105 T9 = T7 + T8;
|
Chris@10
|
106 Tb = KP1_732050807 * (T7 - T8);
|
Chris@10
|
107 }
|
Chris@10
|
108 R0[0] = KP2_000000000 * (T1 + T4);
|
Chris@10
|
109 R1[WS(rs, 1)] = KP2_000000000 * (T6 - T9);
|
Chris@10
|
110 Ta = FMA(KP2_000000000, T6, T9);
|
Chris@10
|
111 R1[0] = -(T5 + Ta);
|
Chris@10
|
112 R1[WS(rs, 2)] = T5 - Ta;
|
Chris@10
|
113 Tc = FMS(KP2_000000000, T1, T4);
|
Chris@10
|
114 R0[WS(rs, 1)] = Tb - Tc;
|
Chris@10
|
115 R0[WS(rs, 2)] = Tc + Tb;
|
Chris@10
|
116 }
|
Chris@10
|
117 }
|
Chris@10
|
118 }
|
Chris@10
|
119
|
Chris@10
|
120 static const kr2c_desc desc = { 6, "r2cbIII_6", {10, 4, 2, 0}, &GENUS };
|
Chris@10
|
121
|
Chris@10
|
122 void X(codelet_r2cbIII_6) (planner *p) {
|
Chris@10
|
123 X(kr2c_register) (p, r2cbIII_6, &desc);
|
Chris@10
|
124 }
|
Chris@10
|
125
|
Chris@10
|
126 #endif /* HAVE_FMA */
|