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:40:44 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_hc2cdft.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 2 -dit -name hc2cfdft_2 -include hc2cf.h */
|
Chris@10
|
29
|
Chris@10
|
30 /*
|
Chris@10
|
31 * This function contains 10 FP additions, 8 FP multiplications,
|
Chris@10
|
32 * (or, 8 additions, 6 multiplications, 2 fused multiply/add),
|
Chris@10
|
33 * 12 stack variables, 1 constants, and 8 memory accesses
|
Chris@10
|
34 */
|
Chris@10
|
35 #include "hc2cf.h"
|
Chris@10
|
36
|
Chris@10
|
37 static void hc2cfdft_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
|
Chris@10
|
38 {
|
Chris@10
|
39 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
|
Chris@10
|
40 {
|
Chris@10
|
41 INT m;
|
Chris@10
|
42 for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 2, MAKE_VOLATILE_STRIDE(8, rs)) {
|
Chris@10
|
43 E T9, Ta, T3, Tc, T7, T4;
|
Chris@10
|
44 {
|
Chris@10
|
45 E T1, T2, T5, T6;
|
Chris@10
|
46 T1 = Ip[0];
|
Chris@10
|
47 T2 = Im[0];
|
Chris@10
|
48 T5 = Rm[0];
|
Chris@10
|
49 T6 = Rp[0];
|
Chris@10
|
50 T9 = W[1];
|
Chris@10
|
51 Ta = T1 + T2;
|
Chris@10
|
52 T3 = T1 - T2;
|
Chris@10
|
53 Tc = T6 + T5;
|
Chris@10
|
54 T7 = T5 - T6;
|
Chris@10
|
55 T4 = W[0];
|
Chris@10
|
56 }
|
Chris@10
|
57 {
|
Chris@10
|
58 E Td, T8, Te, Tb;
|
Chris@10
|
59 Td = T9 * T7;
|
Chris@10
|
60 T8 = T4 * T7;
|
Chris@10
|
61 Te = FMA(T4, Ta, Td);
|
Chris@10
|
62 Tb = FNMS(T9, Ta, T8);
|
Chris@10
|
63 Rp[0] = KP500000000 * (Tc + Te);
|
Chris@10
|
64 Rm[0] = KP500000000 * (Tc - Te);
|
Chris@10
|
65 Im[0] = KP500000000 * (Tb - T3);
|
Chris@10
|
66 Ip[0] = KP500000000 * (T3 + Tb);
|
Chris@10
|
67 }
|
Chris@10
|
68 }
|
Chris@10
|
69 }
|
Chris@10
|
70 }
|
Chris@10
|
71
|
Chris@10
|
72 static const tw_instr twinstr[] = {
|
Chris@10
|
73 {TW_FULL, 1, 2},
|
Chris@10
|
74 {TW_NEXT, 1, 0}
|
Chris@10
|
75 };
|
Chris@10
|
76
|
Chris@10
|
77 static const hc2c_desc desc = { 2, "hc2cfdft_2", twinstr, &GENUS, {8, 6, 2, 0} };
|
Chris@10
|
78
|
Chris@10
|
79 void X(codelet_hc2cfdft_2) (planner *p) {
|
Chris@10
|
80 X(khc2c_register) (p, hc2cfdft_2, &desc, HC2C_VIA_DFT);
|
Chris@10
|
81 }
|
Chris@10
|
82 #else /* HAVE_FMA */
|
Chris@10
|
83
|
Chris@10
|
84 /* Generated by: ../../../genfft/gen_hc2cdft.native -compact -variables 4 -pipeline-latency 4 -n 2 -dit -name hc2cfdft_2 -include hc2cf.h */
|
Chris@10
|
85
|
Chris@10
|
86 /*
|
Chris@10
|
87 * This function contains 10 FP additions, 8 FP multiplications,
|
Chris@10
|
88 * (or, 8 additions, 6 multiplications, 2 fused multiply/add),
|
Chris@10
|
89 * 10 stack variables, 1 constants, and 8 memory accesses
|
Chris@10
|
90 */
|
Chris@10
|
91 #include "hc2cf.h"
|
Chris@10
|
92
|
Chris@10
|
93 static void hc2cfdft_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
|
Chris@10
|
94 {
|
Chris@10
|
95 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
|
Chris@10
|
96 {
|
Chris@10
|
97 INT m;
|
Chris@10
|
98 for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 2, MAKE_VOLATILE_STRIDE(8, rs)) {
|
Chris@10
|
99 E T3, T9, T7, Tb;
|
Chris@10
|
100 {
|
Chris@10
|
101 E T1, T2, T5, T6;
|
Chris@10
|
102 T1 = Ip[0];
|
Chris@10
|
103 T2 = Im[0];
|
Chris@10
|
104 T3 = T1 - T2;
|
Chris@10
|
105 T9 = T1 + T2;
|
Chris@10
|
106 T5 = Rm[0];
|
Chris@10
|
107 T6 = Rp[0];
|
Chris@10
|
108 T7 = T5 - T6;
|
Chris@10
|
109 Tb = T6 + T5;
|
Chris@10
|
110 }
|
Chris@10
|
111 {
|
Chris@10
|
112 E Ta, Tc, T4, T8;
|
Chris@10
|
113 T4 = W[0];
|
Chris@10
|
114 T8 = W[1];
|
Chris@10
|
115 Ta = FNMS(T8, T9, T4 * T7);
|
Chris@10
|
116 Tc = FMA(T8, T7, T4 * T9);
|
Chris@10
|
117 Ip[0] = KP500000000 * (T3 + Ta);
|
Chris@10
|
118 Rp[0] = KP500000000 * (Tb + Tc);
|
Chris@10
|
119 Im[0] = KP500000000 * (Ta - T3);
|
Chris@10
|
120 Rm[0] = KP500000000 * (Tb - Tc);
|
Chris@10
|
121 }
|
Chris@10
|
122 }
|
Chris@10
|
123 }
|
Chris@10
|
124 }
|
Chris@10
|
125
|
Chris@10
|
126 static const tw_instr twinstr[] = {
|
Chris@10
|
127 {TW_FULL, 1, 2},
|
Chris@10
|
128 {TW_NEXT, 1, 0}
|
Chris@10
|
129 };
|
Chris@10
|
130
|
Chris@10
|
131 static const hc2c_desc desc = { 2, "hc2cfdft_2", twinstr, &GENUS, {8, 6, 2, 0} };
|
Chris@10
|
132
|
Chris@10
|
133 void X(codelet_hc2cfdft_2) (planner *p) {
|
Chris@10
|
134 X(khc2c_register) (p, hc2cfdft_2, &desc, HC2C_VIA_DFT);
|
Chris@10
|
135 }
|
Chris@10
|
136 #endif /* HAVE_FMA */
|