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