Mercurial > hg > sv-dependency-builds
comparison src/fftw-3.3.8/dft/simd/common/n1fv_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: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 3 -name n1fv_3 -include dft/simd/n1f.h */ | |
29 | |
30 /* | |
31 * This function contains 6 FP additions, 4 FP multiplications, | |
32 * (or, 3 additions, 1 multiplications, 3 fused multiply/add), | |
33 * 11 stack variables, 2 constants, and 6 memory accesses | |
34 */ | |
35 #include "dft/simd/n1f.h" | |
36 | |
37 static void n1fv_3(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs) | |
38 { | |
39 DVK(KP500000000, +0.500000000000000000000000000000000000000000000); | |
40 DVK(KP866025403, +0.866025403784438646763723170752936183471402627); | |
41 { | |
42 INT i; | |
43 const R *xi; | |
44 R *xo; | |
45 xi = ri; | |
46 xo = ro; | |
47 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(6, is), MAKE_VOLATILE_STRIDE(6, os)) { | |
48 V T1, T4, T6, T2, T3, T5; | |
49 T1 = LD(&(xi[0]), ivs, &(xi[0])); | |
50 T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)])); | |
51 T3 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0])); | |
52 T4 = VADD(T2, T3); | |
53 T6 = VMUL(LDK(KP866025403), VSUB(T3, T2)); | |
54 ST(&(xo[0]), VADD(T1, T4), ovs, &(xo[0])); | |
55 T5 = VFNMS(LDK(KP500000000), T4, T1); | |
56 ST(&(xo[WS(os, 2)]), VFNMSI(T6, T5), ovs, &(xo[0])); | |
57 ST(&(xo[WS(os, 1)]), VFMAI(T6, T5), ovs, &(xo[WS(os, 1)])); | |
58 } | |
59 } | |
60 VLEAVE(); | |
61 } | |
62 | |
63 static const kdft_desc desc = { 3, XSIMD_STRING("n1fv_3"), {3, 1, 3, 0}, &GENUS, 0, 0, 0, 0 }; | |
64 | |
65 void XSIMD(codelet_n1fv_3) (planner *p) { | |
66 X(kdft_register) (p, n1fv_3, &desc); | |
67 } | |
68 | |
69 #else | |
70 | |
71 /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 3 -name n1fv_3 -include dft/simd/n1f.h */ | |
72 | |
73 /* | |
74 * This function contains 6 FP additions, 2 FP multiplications, | |
75 * (or, 5 additions, 1 multiplications, 1 fused multiply/add), | |
76 * 11 stack variables, 2 constants, and 6 memory accesses | |
77 */ | |
78 #include "dft/simd/n1f.h" | |
79 | |
80 static void n1fv_3(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs) | |
81 { | |
82 DVK(KP500000000, +0.500000000000000000000000000000000000000000000); | |
83 DVK(KP866025403, +0.866025403784438646763723170752936183471402627); | |
84 { | |
85 INT i; | |
86 const R *xi; | |
87 R *xo; | |
88 xi = ri; | |
89 xo = ro; | |
90 for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(6, is), MAKE_VOLATILE_STRIDE(6, os)) { | |
91 V T1, T4, T6, T2, T3, T5; | |
92 T1 = LD(&(xi[0]), ivs, &(xi[0])); | |
93 T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)])); | |
94 T3 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0])); | |
95 T4 = VADD(T2, T3); | |
96 T6 = VBYI(VMUL(LDK(KP866025403), VSUB(T3, T2))); | |
97 ST(&(xo[0]), VADD(T1, T4), ovs, &(xo[0])); | |
98 T5 = VFNMS(LDK(KP500000000), T4, T1); | |
99 ST(&(xo[WS(os, 2)]), VSUB(T5, T6), ovs, &(xo[0])); | |
100 ST(&(xo[WS(os, 1)]), VADD(T5, T6), ovs, &(xo[WS(os, 1)])); | |
101 } | |
102 } | |
103 VLEAVE(); | |
104 } | |
105 | |
106 static const kdft_desc desc = { 3, XSIMD_STRING("n1fv_3"), {5, 1, 1, 0}, &GENUS, 0, 0, 0, 0 }; | |
107 | |
108 void XSIMD(codelet_n1fv_3) (planner *p) { | |
109 X(kdft_register) (p, n1fv_3, &desc); | |
110 } | |
111 | |
112 #endif |