Chris@10
|
1 /*
|
Chris@10
|
2 * Copyright (c) 2003, 2007-11 Matteo Frigo
|
Chris@10
|
3 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
|
Chris@10
|
4 *
|
Chris@10
|
5 * This program is free software; you can redistribute it and/or modify
|
Chris@10
|
6 * it under the terms of the GNU General Public License as published by
|
Chris@10
|
7 * the Free Software Foundation; either version 2 of the License, or
|
Chris@10
|
8 * (at your option) any later version.
|
Chris@10
|
9 *
|
Chris@10
|
10 * This program is distributed in the hope that it will be useful,
|
Chris@10
|
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
Chris@10
|
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
Chris@10
|
13 * GNU General Public License for more details.
|
Chris@10
|
14 *
|
Chris@10
|
15 * You should have received a copy of the GNU General Public License
|
Chris@10
|
16 * along with this program; if not, write to the Free Software
|
Chris@10
|
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
Chris@10
|
18 *
|
Chris@10
|
19 */
|
Chris@10
|
20
|
Chris@10
|
21 /* This file was automatically generated --- DO NOT EDIT */
|
Chris@10
|
22 /* Generated on Sun Nov 25 07:36:52 EST 2012 */
|
Chris@10
|
23
|
Chris@10
|
24 #include "codelet-dft.h"
|
Chris@10
|
25
|
Chris@10
|
26 #ifdef HAVE_FMA
|
Chris@10
|
27
|
Chris@10
|
28 /* Generated by: ../../../genfft/gen_notw_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 3 -name n1fv_3 -include n1f.h */
|
Chris@10
|
29
|
Chris@10
|
30 /*
|
Chris@10
|
31 * This function contains 6 FP additions, 4 FP multiplications,
|
Chris@10
|
32 * (or, 3 additions, 1 multiplications, 3 fused multiply/add),
|
Chris@10
|
33 * 11 stack variables, 2 constants, and 6 memory accesses
|
Chris@10
|
34 */
|
Chris@10
|
35 #include "n1f.h"
|
Chris@10
|
36
|
Chris@10
|
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)
|
Chris@10
|
38 {
|
Chris@10
|
39 DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
|
Chris@10
|
40 DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
|
Chris@10
|
41 {
|
Chris@10
|
42 INT i;
|
Chris@10
|
43 const R *xi;
|
Chris@10
|
44 R *xo;
|
Chris@10
|
45 xi = ri;
|
Chris@10
|
46 xo = ro;
|
Chris@10
|
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)) {
|
Chris@10
|
48 V T1, T2, T3, T6, T4, T5;
|
Chris@10
|
49 T1 = LD(&(xi[0]), ivs, &(xi[0]));
|
Chris@10
|
50 T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
|
Chris@10
|
51 T3 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
|
Chris@10
|
52 T6 = VMUL(LDK(KP866025403), VSUB(T3, T2));
|
Chris@10
|
53 T4 = VADD(T2, T3);
|
Chris@10
|
54 T5 = VFNMS(LDK(KP500000000), T4, T1);
|
Chris@10
|
55 ST(&(xo[0]), VADD(T1, T4), ovs, &(xo[0]));
|
Chris@10
|
56 ST(&(xo[WS(os, 1)]), VFMAI(T6, T5), ovs, &(xo[WS(os, 1)]));
|
Chris@10
|
57 ST(&(xo[WS(os, 2)]), VFNMSI(T6, T5), ovs, &(xo[0]));
|
Chris@10
|
58 }
|
Chris@10
|
59 }
|
Chris@10
|
60 VLEAVE();
|
Chris@10
|
61 }
|
Chris@10
|
62
|
Chris@10
|
63 static const kdft_desc desc = { 3, XSIMD_STRING("n1fv_3"), {3, 1, 3, 0}, &GENUS, 0, 0, 0, 0 };
|
Chris@10
|
64
|
Chris@10
|
65 void XSIMD(codelet_n1fv_3) (planner *p) {
|
Chris@10
|
66 X(kdft_register) (p, n1fv_3, &desc);
|
Chris@10
|
67 }
|
Chris@10
|
68
|
Chris@10
|
69 #else /* HAVE_FMA */
|
Chris@10
|
70
|
Chris@10
|
71 /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 3 -name n1fv_3 -include n1f.h */
|
Chris@10
|
72
|
Chris@10
|
73 /*
|
Chris@10
|
74 * This function contains 6 FP additions, 2 FP multiplications,
|
Chris@10
|
75 * (or, 5 additions, 1 multiplications, 1 fused multiply/add),
|
Chris@10
|
76 * 11 stack variables, 2 constants, and 6 memory accesses
|
Chris@10
|
77 */
|
Chris@10
|
78 #include "n1f.h"
|
Chris@10
|
79
|
Chris@10
|
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)
|
Chris@10
|
81 {
|
Chris@10
|
82 DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
|
Chris@10
|
83 DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
|
Chris@10
|
84 {
|
Chris@10
|
85 INT i;
|
Chris@10
|
86 const R *xi;
|
Chris@10
|
87 R *xo;
|
Chris@10
|
88 xi = ri;
|
Chris@10
|
89 xo = ro;
|
Chris@10
|
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)) {
|
Chris@10
|
91 V T1, T4, T6, T2, T3, T5;
|
Chris@10
|
92 T1 = LD(&(xi[0]), ivs, &(xi[0]));
|
Chris@10
|
93 T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
|
Chris@10
|
94 T3 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
|
Chris@10
|
95 T4 = VADD(T2, T3);
|
Chris@10
|
96 T6 = VBYI(VMUL(LDK(KP866025403), VSUB(T3, T2)));
|
Chris@10
|
97 ST(&(xo[0]), VADD(T1, T4), ovs, &(xo[0]));
|
Chris@10
|
98 T5 = VFNMS(LDK(KP500000000), T4, T1);
|
Chris@10
|
99 ST(&(xo[WS(os, 2)]), VSUB(T5, T6), ovs, &(xo[0]));
|
Chris@10
|
100 ST(&(xo[WS(os, 1)]), VADD(T5, T6), ovs, &(xo[WS(os, 1)]));
|
Chris@10
|
101 }
|
Chris@10
|
102 }
|
Chris@10
|
103 VLEAVE();
|
Chris@10
|
104 }
|
Chris@10
|
105
|
Chris@10
|
106 static const kdft_desc desc = { 3, XSIMD_STRING("n1fv_3"), {5, 1, 1, 0}, &GENUS, 0, 0, 0, 0 };
|
Chris@10
|
107
|
Chris@10
|
108 void XSIMD(codelet_n1fv_3) (planner *p) {
|
Chris@10
|
109 X(kdft_register) (p, n1fv_3, &desc);
|
Chris@10
|
110 }
|
Chris@10
|
111
|
Chris@10
|
112 #endif /* HAVE_FMA */
|