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