cannam@167
|
1 /*
|
cannam@167
|
2 * Copyright (c) 2003, 2007-14 Matteo Frigo
|
cannam@167
|
3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
|
cannam@167
|
4 *
|
cannam@167
|
5 * This program is free software; you can redistribute it and/or modify
|
cannam@167
|
6 * it under the terms of the GNU General Public License as published by
|
cannam@167
|
7 * the Free Software Foundation; either version 2 of the License, or
|
cannam@167
|
8 * (at your option) any later version.
|
cannam@167
|
9 *
|
cannam@167
|
10 * This program is distributed in the hope that it will be useful,
|
cannam@167
|
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
cannam@167
|
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
cannam@167
|
13 * GNU General Public License for more details.
|
cannam@167
|
14 *
|
cannam@167
|
15 * You should have received a copy of the GNU General Public License
|
cannam@167
|
16 * along with this program; if not, write to the Free Software
|
cannam@167
|
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
cannam@167
|
18 *
|
cannam@167
|
19 */
|
cannam@167
|
20
|
cannam@167
|
21 /* This file was automatically generated --- DO NOT EDIT */
|
cannam@167
|
22 /* Generated on Thu May 24 08:06:09 EDT 2018 */
|
cannam@167
|
23
|
cannam@167
|
24 #include "dft/codelet-dft.h"
|
cannam@167
|
25
|
cannam@167
|
26 #if defined(ARCH_PREFERS_FMA) || defined(ISA_EXTENSION_PREFERS_FMA)
|
cannam@167
|
27
|
cannam@167
|
28 /* Generated by: ../../../genfft/gen_twiddle.native -fma -simd -compact -variables 4 -pipeline-latency 8 -n 2 -name t1sv_2 -include dft/simd/ts.h */
|
cannam@167
|
29
|
cannam@167
|
30 /*
|
cannam@167
|
31 * This function contains 6 FP additions, 4 FP multiplications,
|
cannam@167
|
32 * (or, 4 additions, 2 multiplications, 2 fused multiply/add),
|
cannam@167
|
33 * 11 stack variables, 0 constants, and 8 memory accesses
|
cannam@167
|
34 */
|
cannam@167
|
35 #include "dft/simd/ts.h"
|
cannam@167
|
36
|
cannam@167
|
37 static void t1sv_2(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
|
cannam@167
|
38 {
|
cannam@167
|
39 {
|
cannam@167
|
40 INT m;
|
cannam@167
|
41 for (m = mb, W = W + (mb * 2); m < me; m = m + (2 * VL), ri = ri + ((2 * VL) * ms), ii = ii + ((2 * VL) * ms), W = W + ((2 * VL) * 2), MAKE_VOLATILE_STRIDE(4, rs)) {
|
cannam@167
|
42 V T1, Ta, T3, T6, T4, T8, T2, T7, T9, T5;
|
cannam@167
|
43 T1 = LD(&(ri[0]), ms, &(ri[0]));
|
cannam@167
|
44 Ta = LD(&(ii[0]), ms, &(ii[0]));
|
cannam@167
|
45 T3 = LD(&(ri[WS(rs, 1)]), ms, &(ri[WS(rs, 1)]));
|
cannam@167
|
46 T6 = LD(&(ii[WS(rs, 1)]), ms, &(ii[WS(rs, 1)]));
|
cannam@167
|
47 T2 = LDW(&(W[0]));
|
cannam@167
|
48 T4 = VMUL(T2, T3);
|
cannam@167
|
49 T8 = VMUL(T2, T6);
|
cannam@167
|
50 T5 = LDW(&(W[TWVL * 1]));
|
cannam@167
|
51 T7 = VFMA(T5, T6, T4);
|
cannam@167
|
52 T9 = VFNMS(T5, T3, T8);
|
cannam@167
|
53 ST(&(ri[WS(rs, 1)]), VSUB(T1, T7), ms, &(ri[WS(rs, 1)]));
|
cannam@167
|
54 ST(&(ii[WS(rs, 1)]), VSUB(Ta, T9), ms, &(ii[WS(rs, 1)]));
|
cannam@167
|
55 ST(&(ri[0]), VADD(T1, T7), ms, &(ri[0]));
|
cannam@167
|
56 ST(&(ii[0]), VADD(T9, Ta), ms, &(ii[0]));
|
cannam@167
|
57 }
|
cannam@167
|
58 }
|
cannam@167
|
59 VLEAVE();
|
cannam@167
|
60 }
|
cannam@167
|
61
|
cannam@167
|
62 static const tw_instr twinstr[] = {
|
cannam@167
|
63 VTW(0, 1),
|
cannam@167
|
64 {TW_NEXT, (2 * VL), 0}
|
cannam@167
|
65 };
|
cannam@167
|
66
|
cannam@167
|
67 static const ct_desc desc = { 2, XSIMD_STRING("t1sv_2"), twinstr, &GENUS, {4, 2, 2, 0}, 0, 0, 0 };
|
cannam@167
|
68
|
cannam@167
|
69 void XSIMD(codelet_t1sv_2) (planner *p) {
|
cannam@167
|
70 X(kdft_dit_register) (p, t1sv_2, &desc);
|
cannam@167
|
71 }
|
cannam@167
|
72 #else
|
cannam@167
|
73
|
cannam@167
|
74 /* Generated by: ../../../genfft/gen_twiddle.native -simd -compact -variables 4 -pipeline-latency 8 -n 2 -name t1sv_2 -include dft/simd/ts.h */
|
cannam@167
|
75
|
cannam@167
|
76 /*
|
cannam@167
|
77 * This function contains 6 FP additions, 4 FP multiplications,
|
cannam@167
|
78 * (or, 4 additions, 2 multiplications, 2 fused multiply/add),
|
cannam@167
|
79 * 9 stack variables, 0 constants, and 8 memory accesses
|
cannam@167
|
80 */
|
cannam@167
|
81 #include "dft/simd/ts.h"
|
cannam@167
|
82
|
cannam@167
|
83 static void t1sv_2(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
|
cannam@167
|
84 {
|
cannam@167
|
85 {
|
cannam@167
|
86 INT m;
|
cannam@167
|
87 for (m = mb, W = W + (mb * 2); m < me; m = m + (2 * VL), ri = ri + ((2 * VL) * ms), ii = ii + ((2 * VL) * ms), W = W + ((2 * VL) * 2), MAKE_VOLATILE_STRIDE(4, rs)) {
|
cannam@167
|
88 V T1, T8, T6, T7;
|
cannam@167
|
89 T1 = LD(&(ri[0]), ms, &(ri[0]));
|
cannam@167
|
90 T8 = LD(&(ii[0]), ms, &(ii[0]));
|
cannam@167
|
91 {
|
cannam@167
|
92 V T3, T5, T2, T4;
|
cannam@167
|
93 T3 = LD(&(ri[WS(rs, 1)]), ms, &(ri[WS(rs, 1)]));
|
cannam@167
|
94 T5 = LD(&(ii[WS(rs, 1)]), ms, &(ii[WS(rs, 1)]));
|
cannam@167
|
95 T2 = LDW(&(W[0]));
|
cannam@167
|
96 T4 = LDW(&(W[TWVL * 1]));
|
cannam@167
|
97 T6 = VFMA(T2, T3, VMUL(T4, T5));
|
cannam@167
|
98 T7 = VFNMS(T4, T3, VMUL(T2, T5));
|
cannam@167
|
99 }
|
cannam@167
|
100 ST(&(ri[WS(rs, 1)]), VSUB(T1, T6), ms, &(ri[WS(rs, 1)]));
|
cannam@167
|
101 ST(&(ii[WS(rs, 1)]), VSUB(T8, T7), ms, &(ii[WS(rs, 1)]));
|
cannam@167
|
102 ST(&(ri[0]), VADD(T1, T6), ms, &(ri[0]));
|
cannam@167
|
103 ST(&(ii[0]), VADD(T7, T8), ms, &(ii[0]));
|
cannam@167
|
104 }
|
cannam@167
|
105 }
|
cannam@167
|
106 VLEAVE();
|
cannam@167
|
107 }
|
cannam@167
|
108
|
cannam@167
|
109 static const tw_instr twinstr[] = {
|
cannam@167
|
110 VTW(0, 1),
|
cannam@167
|
111 {TW_NEXT, (2 * VL), 0}
|
cannam@167
|
112 };
|
cannam@167
|
113
|
cannam@167
|
114 static const ct_desc desc = { 2, XSIMD_STRING("t1sv_2"), twinstr, &GENUS, {4, 2, 2, 0}, 0, 0, 0 };
|
cannam@167
|
115
|
cannam@167
|
116 void XSIMD(codelet_t1sv_2) (planner *p) {
|
cannam@167
|
117 X(kdft_dit_register) (p, t1sv_2, &desc);
|
cannam@167
|
118 }
|
cannam@167
|
119 #endif
|