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:39:23 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_twiddle.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 2 -name t1sv_2 -include ts.h */
|
Chris@10
|
29
|
Chris@10
|
30 /*
|
Chris@10
|
31 * This function contains 6 FP additions, 4 FP multiplications,
|
Chris@10
|
32 * (or, 4 additions, 2 multiplications, 2 fused multiply/add),
|
Chris@10
|
33 * 11 stack variables, 0 constants, and 8 memory accesses
|
Chris@10
|
34 */
|
Chris@10
|
35 #include "ts.h"
|
Chris@10
|
36
|
Chris@10
|
37 static void t1sv_2(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
|
Chris@10
|
38 {
|
Chris@10
|
39 {
|
Chris@10
|
40 INT m;
|
Chris@10
|
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)) {
|
Chris@10
|
42 V T1, Ta, T3, T6, T2, T5;
|
Chris@10
|
43 T1 = LD(&(ri[0]), ms, &(ri[0]));
|
Chris@10
|
44 Ta = LD(&(ii[0]), ms, &(ii[0]));
|
Chris@10
|
45 T3 = LD(&(ri[WS(rs, 1)]), ms, &(ri[WS(rs, 1)]));
|
Chris@10
|
46 T6 = LD(&(ii[WS(rs, 1)]), ms, &(ii[WS(rs, 1)]));
|
Chris@10
|
47 T2 = LDW(&(W[0]));
|
Chris@10
|
48 T5 = LDW(&(W[TWVL * 1]));
|
Chris@10
|
49 {
|
Chris@10
|
50 V T8, T4, T9, T7;
|
Chris@10
|
51 T8 = VMUL(T2, T6);
|
Chris@10
|
52 T4 = VMUL(T2, T3);
|
Chris@10
|
53 T9 = VFNMS(T5, T3, T8);
|
Chris@10
|
54 T7 = VFMA(T5, T6, T4);
|
Chris@10
|
55 ST(&(ii[0]), VADD(T9, Ta), ms, &(ii[0]));
|
Chris@10
|
56 ST(&(ii[WS(rs, 1)]), VSUB(Ta, T9), ms, &(ii[WS(rs, 1)]));
|
Chris@10
|
57 ST(&(ri[0]), VADD(T1, T7), ms, &(ri[0]));
|
Chris@10
|
58 ST(&(ri[WS(rs, 1)]), VSUB(T1, T7), ms, &(ri[WS(rs, 1)]));
|
Chris@10
|
59 }
|
Chris@10
|
60 }
|
Chris@10
|
61 }
|
Chris@10
|
62 VLEAVE();
|
Chris@10
|
63 }
|
Chris@10
|
64
|
Chris@10
|
65 static const tw_instr twinstr[] = {
|
Chris@10
|
66 VTW(0, 1),
|
Chris@10
|
67 {TW_NEXT, (2 * VL), 0}
|
Chris@10
|
68 };
|
Chris@10
|
69
|
Chris@10
|
70 static const ct_desc desc = { 2, XSIMD_STRING("t1sv_2"), twinstr, &GENUS, {4, 2, 2, 0}, 0, 0, 0 };
|
Chris@10
|
71
|
Chris@10
|
72 void XSIMD(codelet_t1sv_2) (planner *p) {
|
Chris@10
|
73 X(kdft_dit_register) (p, t1sv_2, &desc);
|
Chris@10
|
74 }
|
Chris@10
|
75 #else /* HAVE_FMA */
|
Chris@10
|
76
|
Chris@10
|
77 /* Generated by: ../../../genfft/gen_twiddle.native -simd -compact -variables 4 -pipeline-latency 8 -n 2 -name t1sv_2 -include ts.h */
|
Chris@10
|
78
|
Chris@10
|
79 /*
|
Chris@10
|
80 * This function contains 6 FP additions, 4 FP multiplications,
|
Chris@10
|
81 * (or, 4 additions, 2 multiplications, 2 fused multiply/add),
|
Chris@10
|
82 * 9 stack variables, 0 constants, and 8 memory accesses
|
Chris@10
|
83 */
|
Chris@10
|
84 #include "ts.h"
|
Chris@10
|
85
|
Chris@10
|
86 static void t1sv_2(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
|
Chris@10
|
87 {
|
Chris@10
|
88 {
|
Chris@10
|
89 INT m;
|
Chris@10
|
90 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)) {
|
Chris@10
|
91 V T1, T8, T6, T7;
|
Chris@10
|
92 T1 = LD(&(ri[0]), ms, &(ri[0]));
|
Chris@10
|
93 T8 = LD(&(ii[0]), ms, &(ii[0]));
|
Chris@10
|
94 {
|
Chris@10
|
95 V T3, T5, T2, T4;
|
Chris@10
|
96 T3 = LD(&(ri[WS(rs, 1)]), ms, &(ri[WS(rs, 1)]));
|
Chris@10
|
97 T5 = LD(&(ii[WS(rs, 1)]), ms, &(ii[WS(rs, 1)]));
|
Chris@10
|
98 T2 = LDW(&(W[0]));
|
Chris@10
|
99 T4 = LDW(&(W[TWVL * 1]));
|
Chris@10
|
100 T6 = VFMA(T2, T3, VMUL(T4, T5));
|
Chris@10
|
101 T7 = VFNMS(T4, T3, VMUL(T2, T5));
|
Chris@10
|
102 }
|
Chris@10
|
103 ST(&(ri[WS(rs, 1)]), VSUB(T1, T6), ms, &(ri[WS(rs, 1)]));
|
Chris@10
|
104 ST(&(ii[WS(rs, 1)]), VSUB(T8, T7), ms, &(ii[WS(rs, 1)]));
|
Chris@10
|
105 ST(&(ri[0]), VADD(T1, T6), ms, &(ri[0]));
|
Chris@10
|
106 ST(&(ii[0]), VADD(T7, T8), ms, &(ii[0]));
|
Chris@10
|
107 }
|
Chris@10
|
108 }
|
Chris@10
|
109 VLEAVE();
|
Chris@10
|
110 }
|
Chris@10
|
111
|
Chris@10
|
112 static const tw_instr twinstr[] = {
|
Chris@10
|
113 VTW(0, 1),
|
Chris@10
|
114 {TW_NEXT, (2 * VL), 0}
|
Chris@10
|
115 };
|
Chris@10
|
116
|
Chris@10
|
117 static const ct_desc desc = { 2, XSIMD_STRING("t1sv_2"), twinstr, &GENUS, {4, 2, 2, 0}, 0, 0, 0 };
|
Chris@10
|
118
|
Chris@10
|
119 void XSIMD(codelet_t1sv_2) (planner *p) {
|
Chris@10
|
120 X(kdft_dit_register) (p, t1sv_2, &desc);
|
Chris@10
|
121 }
|
Chris@10
|
122 #endif /* HAVE_FMA */
|