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