comparison src/fftw-3.3.8/rdft/scalar/r2cb/r2cb_3.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:07:28 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_r2cb.native -fma -compact -variables 4 -pipeline-latency 4 -sign 1 -n 3 -name r2cb_3 -include rdft/scalar/r2cb.h */
29
30 /*
31 * This function contains 4 FP additions, 3 FP multiplications,
32 * (or, 1 additions, 0 multiplications, 3 fused multiply/add),
33 * 7 stack variables, 2 constants, and 6 memory accesses
34 */
35 #include "rdft/scalar/r2cb.h"
36
37 static void r2cb_3(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
38 {
39 DK(KP1_732050807, +1.732050807568877293527446341505872366942805254);
40 DK(KP2_000000000, +2.000000000000000000000000000000000000000000000);
41 {
42 INT i;
43 for (i = v; i > 0; i = i - 1, R0 = R0 + ovs, R1 = R1 + ovs, Cr = Cr + ivs, Ci = Ci + ivs, MAKE_VOLATILE_STRIDE(12, rs), MAKE_VOLATILE_STRIDE(12, csr), MAKE_VOLATILE_STRIDE(12, csi)) {
44 E T4, T1, T2, T3;
45 T4 = Ci[WS(csi, 1)];
46 T1 = Cr[0];
47 T2 = Cr[WS(csr, 1)];
48 T3 = T1 - T2;
49 R0[0] = FMA(KP2_000000000, T2, T1);
50 R0[WS(rs, 1)] = FMA(KP1_732050807, T4, T3);
51 R1[0] = FNMS(KP1_732050807, T4, T3);
52 }
53 }
54 }
55
56 static const kr2c_desc desc = { 3, "r2cb_3", {1, 0, 3, 0}, &GENUS };
57
58 void X(codelet_r2cb_3) (planner *p) {
59 X(kr2c_register) (p, r2cb_3, &desc);
60 }
61
62 #else
63
64 /* Generated by: ../../../genfft/gen_r2cb.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 3 -name r2cb_3 -include rdft/scalar/r2cb.h */
65
66 /*
67 * This function contains 4 FP additions, 2 FP multiplications,
68 * (or, 3 additions, 1 multiplications, 1 fused multiply/add),
69 * 8 stack variables, 2 constants, and 6 memory accesses
70 */
71 #include "rdft/scalar/r2cb.h"
72
73 static void r2cb_3(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
74 {
75 DK(KP2_000000000, +2.000000000000000000000000000000000000000000000);
76 DK(KP1_732050807, +1.732050807568877293527446341505872366942805254);
77 {
78 INT i;
79 for (i = v; i > 0; i = i - 1, R0 = R0 + ovs, R1 = R1 + ovs, Cr = Cr + ivs, Ci = Ci + ivs, MAKE_VOLATILE_STRIDE(12, rs), MAKE_VOLATILE_STRIDE(12, csr), MAKE_VOLATILE_STRIDE(12, csi)) {
80 E T5, T1, T2, T3, T4;
81 T4 = Ci[WS(csi, 1)];
82 T5 = KP1_732050807 * T4;
83 T1 = Cr[0];
84 T2 = Cr[WS(csr, 1)];
85 T3 = T1 - T2;
86 R0[0] = FMA(KP2_000000000, T2, T1);
87 R0[WS(rs, 1)] = T3 + T5;
88 R1[0] = T3 - T5;
89 }
90 }
91 }
92
93 static const kr2c_desc desc = { 3, "r2cb_3", {3, 1, 1, 0}, &GENUS };
94
95 void X(codelet_r2cb_3) (planner *p) {
96 X(kr2c_register) (p, r2cb_3, &desc);
97 }
98
99 #endif