comparison src/fftw-3.3.8/dft/simd/common/n1fv_2.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:04:51 EDT 2018 */
23
24 #include "dft/codelet-dft.h"
25
26 #if defined(ARCH_PREFERS_FMA) || defined(ISA_EXTENSION_PREFERS_FMA)
27
28 /* Generated by: ../../../genfft/gen_notw_c.native -fma -simd -compact -variables 4 -pipeline-latency 8 -n 2 -name n1fv_2 -include dft/simd/n1f.h */
29
30 /*
31 * This function contains 2 FP additions, 0 FP multiplications,
32 * (or, 2 additions, 0 multiplications, 0 fused multiply/add),
33 * 5 stack variables, 0 constants, and 4 memory accesses
34 */
35 #include "dft/simd/n1f.h"
36
37 static void n1fv_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
38 {
39 {
40 INT i;
41 const R *xi;
42 R *xo;
43 xi = ri;
44 xo = ro;
45 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(4, is), MAKE_VOLATILE_STRIDE(4, os)) {
46 V T1, T2;
47 T1 = LD(&(xi[0]), ivs, &(xi[0]));
48 T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
49 ST(&(xo[WS(os, 1)]), VSUB(T1, T2), ovs, &(xo[WS(os, 1)]));
50 ST(&(xo[0]), VADD(T1, T2), ovs, &(xo[0]));
51 }
52 }
53 VLEAVE();
54 }
55
56 static const kdft_desc desc = { 2, XSIMD_STRING("n1fv_2"), {2, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
57
58 void XSIMD(codelet_n1fv_2) (planner *p) {
59 X(kdft_register) (p, n1fv_2, &desc);
60 }
61
62 #else
63
64 /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 2 -name n1fv_2 -include dft/simd/n1f.h */
65
66 /*
67 * This function contains 2 FP additions, 0 FP multiplications,
68 * (or, 2 additions, 0 multiplications, 0 fused multiply/add),
69 * 5 stack variables, 0 constants, and 4 memory accesses
70 */
71 #include "dft/simd/n1f.h"
72
73 static void n1fv_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
74 {
75 {
76 INT i;
77 const R *xi;
78 R *xo;
79 xi = ri;
80 xo = ro;
81 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(4, is), MAKE_VOLATILE_STRIDE(4, os)) {
82 V T1, T2;
83 T1 = LD(&(xi[0]), ivs, &(xi[0]));
84 T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
85 ST(&(xo[WS(os, 1)]), VSUB(T1, T2), ovs, &(xo[WS(os, 1)]));
86 ST(&(xo[0]), VADD(T1, T2), ovs, &(xo[0]));
87 }
88 }
89 VLEAVE();
90 }
91
92 static const kdft_desc desc = { 2, XSIMD_STRING("n1fv_2"), {2, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
93
94 void XSIMD(codelet_n1fv_2) (planner *p) {
95 X(kdft_register) (p, n1fv_2, &desc);
96 }
97
98 #endif