comparison src/fftw-3.3.8/rdft/scalar/r2cf/r2cf_6.c @ 167:bd3cc4d1df30

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