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