cannam@95
|
1 /*
|
cannam@95
|
2 * Copyright (c) 2003, 2007-11 Matteo Frigo
|
cannam@95
|
3 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
|
cannam@95
|
4 *
|
cannam@95
|
5 * This program is free software; you can redistribute it and/or modify
|
cannam@95
|
6 * it under the terms of the GNU General Public License as published by
|
cannam@95
|
7 * the Free Software Foundation; either version 2 of the License, or
|
cannam@95
|
8 * (at your option) any later version.
|
cannam@95
|
9 *
|
cannam@95
|
10 * This program is distributed in the hope that it will be useful,
|
cannam@95
|
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
cannam@95
|
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
cannam@95
|
13 * GNU General Public License for more details.
|
cannam@95
|
14 *
|
cannam@95
|
15 * You should have received a copy of the GNU General Public License
|
cannam@95
|
16 * along with this program; if not, write to the Free Software
|
cannam@95
|
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
cannam@95
|
18 *
|
cannam@95
|
19 */
|
cannam@95
|
20
|
cannam@95
|
21 /* This file was automatically generated --- DO NOT EDIT */
|
cannam@95
|
22 /* Generated on Sun Nov 25 07:42:03 EST 2012 */
|
cannam@95
|
23
|
cannam@95
|
24 #include "codelet-rdft.h"
|
cannam@95
|
25
|
cannam@95
|
26 #ifdef HAVE_FMA
|
cannam@95
|
27
|
cannam@95
|
28 /* Generated by: ../../../genfft/gen_hc2cdft.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -sign 1 -n 2 -dif -name hc2cbdft_2 -include hc2cb.h */
|
cannam@95
|
29
|
cannam@95
|
30 /*
|
cannam@95
|
31 * This function contains 10 FP additions, 4 FP multiplications,
|
cannam@95
|
32 * (or, 8 additions, 2 multiplications, 2 fused multiply/add),
|
cannam@95
|
33 * 11 stack variables, 0 constants, and 8 memory accesses
|
cannam@95
|
34 */
|
cannam@95
|
35 #include "hc2cb.h"
|
cannam@95
|
36
|
cannam@95
|
37 static void hc2cbdft_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
|
cannam@95
|
38 {
|
cannam@95
|
39 {
|
cannam@95
|
40 INT m;
|
cannam@95
|
41 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)) {
|
cannam@95
|
42 E T9, Ta, T3, Tc, T7, T4;
|
cannam@95
|
43 {
|
cannam@95
|
44 E T1, T2, T5, T6;
|
cannam@95
|
45 T1 = Ip[0];
|
cannam@95
|
46 T2 = Im[0];
|
cannam@95
|
47 T5 = Rp[0];
|
cannam@95
|
48 T6 = Rm[0];
|
cannam@95
|
49 T9 = W[1];
|
cannam@95
|
50 Ta = T1 + T2;
|
cannam@95
|
51 T3 = T1 - T2;
|
cannam@95
|
52 Tc = T5 + T6;
|
cannam@95
|
53 T7 = T5 - T6;
|
cannam@95
|
54 T4 = W[0];
|
cannam@95
|
55 }
|
cannam@95
|
56 {
|
cannam@95
|
57 E Td, T8, Te, Tb;
|
cannam@95
|
58 Td = T9 * T7;
|
cannam@95
|
59 T8 = T4 * T7;
|
cannam@95
|
60 Te = FMA(T4, Ta, Td);
|
cannam@95
|
61 Tb = FNMS(T9, Ta, T8);
|
cannam@95
|
62 Rm[0] = Tc + Te;
|
cannam@95
|
63 Rp[0] = Tc - Te;
|
cannam@95
|
64 Im[0] = Tb - T3;
|
cannam@95
|
65 Ip[0] = T3 + Tb;
|
cannam@95
|
66 }
|
cannam@95
|
67 }
|
cannam@95
|
68 }
|
cannam@95
|
69 }
|
cannam@95
|
70
|
cannam@95
|
71 static const tw_instr twinstr[] = {
|
cannam@95
|
72 {TW_FULL, 1, 2},
|
cannam@95
|
73 {TW_NEXT, 1, 0}
|
cannam@95
|
74 };
|
cannam@95
|
75
|
cannam@95
|
76 static const hc2c_desc desc = { 2, "hc2cbdft_2", twinstr, &GENUS, {8, 2, 2, 0} };
|
cannam@95
|
77
|
cannam@95
|
78 void X(codelet_hc2cbdft_2) (planner *p) {
|
cannam@95
|
79 X(khc2c_register) (p, hc2cbdft_2, &desc, HC2C_VIA_DFT);
|
cannam@95
|
80 }
|
cannam@95
|
81 #else /* HAVE_FMA */
|
cannam@95
|
82
|
cannam@95
|
83 /* Generated by: ../../../genfft/gen_hc2cdft.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 2 -dif -name hc2cbdft_2 -include hc2cb.h */
|
cannam@95
|
84
|
cannam@95
|
85 /*
|
cannam@95
|
86 * This function contains 10 FP additions, 4 FP multiplications,
|
cannam@95
|
87 * (or, 8 additions, 2 multiplications, 2 fused multiply/add),
|
cannam@95
|
88 * 9 stack variables, 0 constants, and 8 memory accesses
|
cannam@95
|
89 */
|
cannam@95
|
90 #include "hc2cb.h"
|
cannam@95
|
91
|
cannam@95
|
92 static void hc2cbdft_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
|
cannam@95
|
93 {
|
cannam@95
|
94 {
|
cannam@95
|
95 INT m;
|
cannam@95
|
96 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)) {
|
cannam@95
|
97 E T3, T9, T7, Tb;
|
cannam@95
|
98 {
|
cannam@95
|
99 E T1, T2, T5, T6;
|
cannam@95
|
100 T1 = Ip[0];
|
cannam@95
|
101 T2 = Im[0];
|
cannam@95
|
102 T3 = T1 - T2;
|
cannam@95
|
103 T9 = T1 + T2;
|
cannam@95
|
104 T5 = Rp[0];
|
cannam@95
|
105 T6 = Rm[0];
|
cannam@95
|
106 T7 = T5 - T6;
|
cannam@95
|
107 Tb = T5 + T6;
|
cannam@95
|
108 }
|
cannam@95
|
109 {
|
cannam@95
|
110 E Ta, Tc, T4, T8;
|
cannam@95
|
111 T4 = W[0];
|
cannam@95
|
112 T8 = W[1];
|
cannam@95
|
113 Ta = FNMS(T8, T9, T4 * T7);
|
cannam@95
|
114 Tc = FMA(T8, T7, T4 * T9);
|
cannam@95
|
115 Ip[0] = T3 + Ta;
|
cannam@95
|
116 Rp[0] = Tb - Tc;
|
cannam@95
|
117 Im[0] = Ta - T3;
|
cannam@95
|
118 Rm[0] = Tb + Tc;
|
cannam@95
|
119 }
|
cannam@95
|
120 }
|
cannam@95
|
121 }
|
cannam@95
|
122 }
|
cannam@95
|
123
|
cannam@95
|
124 static const tw_instr twinstr[] = {
|
cannam@95
|
125 {TW_FULL, 1, 2},
|
cannam@95
|
126 {TW_NEXT, 1, 0}
|
cannam@95
|
127 };
|
cannam@95
|
128
|
cannam@95
|
129 static const hc2c_desc desc = { 2, "hc2cbdft_2", twinstr, &GENUS, {8, 2, 2, 0} };
|
cannam@95
|
130
|
cannam@95
|
131 void X(codelet_hc2cbdft_2) (planner *p) {
|
cannam@95
|
132 X(khc2c_register) (p, hc2cbdft_2, &desc, HC2C_VIA_DFT);
|
cannam@95
|
133 }
|
cannam@95
|
134 #endif /* HAVE_FMA */
|