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:18 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_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -twiddle-log3 -precompute-twiddles -no-generate-bytw -n 4 -name t3bv_4 -include t3b.h -sign 1 */
|
Chris@10
|
29
|
Chris@10
|
30 /*
|
Chris@10
|
31 * This function contains 12 FP additions, 10 FP multiplications,
|
Chris@10
|
32 * (or, 10 additions, 8 multiplications, 2 fused multiply/add),
|
Chris@10
|
33 * 16 stack variables, 0 constants, and 8 memory accesses
|
Chris@10
|
34 */
|
Chris@10
|
35 #include "t3b.h"
|
Chris@10
|
36
|
Chris@10
|
37 static void t3bv_4(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 R *x;
|
Chris@10
|
42 x = ii;
|
Chris@10
|
43 for (m = mb, W = W + (mb * ((TWVL / VL) * 4)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 4), MAKE_VOLATILE_STRIDE(4, rs)) {
|
Chris@10
|
44 V T2, T3, T1, Ta, T5, T8;
|
Chris@10
|
45 T2 = LDW(&(W[0]));
|
Chris@10
|
46 T3 = LDW(&(W[TWVL * 2]));
|
Chris@10
|
47 T1 = LD(&(x[0]), ms, &(x[0]));
|
Chris@10
|
48 Ta = LD(&(x[WS(rs, 3)]), ms, &(x[WS(rs, 1)]));
|
Chris@10
|
49 T5 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
|
Chris@10
|
50 T8 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
|
Chris@10
|
51 {
|
Chris@10
|
52 V T4, Tb, T9, T6;
|
Chris@10
|
53 T4 = VZMULJ(T2, T3);
|
Chris@10
|
54 Tb = VZMUL(T3, Ta);
|
Chris@10
|
55 T9 = VZMUL(T2, T8);
|
Chris@10
|
56 T6 = VZMUL(T4, T5);
|
Chris@10
|
57 {
|
Chris@10
|
58 V Tc, Te, T7, Td;
|
Chris@10
|
59 Tc = VSUB(T9, Tb);
|
Chris@10
|
60 Te = VADD(T9, Tb);
|
Chris@10
|
61 T7 = VSUB(T1, T6);
|
Chris@10
|
62 Td = VADD(T1, T6);
|
Chris@10
|
63 ST(&(x[0]), VADD(Td, Te), ms, &(x[0]));
|
Chris@10
|
64 ST(&(x[WS(rs, 2)]), VSUB(Td, Te), ms, &(x[0]));
|
Chris@10
|
65 ST(&(x[WS(rs, 1)]), VFMAI(Tc, T7), ms, &(x[WS(rs, 1)]));
|
Chris@10
|
66 ST(&(x[WS(rs, 3)]), VFNMSI(Tc, T7), ms, &(x[WS(rs, 1)]));
|
Chris@10
|
67 }
|
Chris@10
|
68 }
|
Chris@10
|
69 }
|
Chris@10
|
70 }
|
Chris@10
|
71 VLEAVE();
|
Chris@10
|
72 }
|
Chris@10
|
73
|
Chris@10
|
74 static const tw_instr twinstr[] = {
|
Chris@10
|
75 VTW(0, 1),
|
Chris@10
|
76 VTW(0, 3),
|
Chris@10
|
77 {TW_NEXT, VL, 0}
|
Chris@10
|
78 };
|
Chris@10
|
79
|
Chris@10
|
80 static const ct_desc desc = { 4, XSIMD_STRING("t3bv_4"), twinstr, &GENUS, {10, 8, 2, 0}, 0, 0, 0 };
|
Chris@10
|
81
|
Chris@10
|
82 void XSIMD(codelet_t3bv_4) (planner *p) {
|
Chris@10
|
83 X(kdft_dit_register) (p, t3bv_4, &desc);
|
Chris@10
|
84 }
|
Chris@10
|
85 #else /* HAVE_FMA */
|
Chris@10
|
86
|
Chris@10
|
87 /* Generated by: ../../../genfft/gen_twiddle_c.native -simd -compact -variables 4 -pipeline-latency 8 -twiddle-log3 -precompute-twiddles -no-generate-bytw -n 4 -name t3bv_4 -include t3b.h -sign 1 */
|
Chris@10
|
88
|
Chris@10
|
89 /*
|
Chris@10
|
90 * This function contains 12 FP additions, 8 FP multiplications,
|
Chris@10
|
91 * (or, 12 additions, 8 multiplications, 0 fused multiply/add),
|
Chris@10
|
92 * 16 stack variables, 0 constants, and 8 memory accesses
|
Chris@10
|
93 */
|
Chris@10
|
94 #include "t3b.h"
|
Chris@10
|
95
|
Chris@10
|
96 static void t3bv_4(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
|
Chris@10
|
97 {
|
Chris@10
|
98 {
|
Chris@10
|
99 INT m;
|
Chris@10
|
100 R *x;
|
Chris@10
|
101 x = ii;
|
Chris@10
|
102 for (m = mb, W = W + (mb * ((TWVL / VL) * 4)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 4), MAKE_VOLATILE_STRIDE(4, rs)) {
|
Chris@10
|
103 V T2, T3, T4;
|
Chris@10
|
104 T2 = LDW(&(W[0]));
|
Chris@10
|
105 T3 = LDW(&(W[TWVL * 2]));
|
Chris@10
|
106 T4 = VZMULJ(T2, T3);
|
Chris@10
|
107 {
|
Chris@10
|
108 V T1, Tb, T6, T9, Ta, T5, T8;
|
Chris@10
|
109 T1 = LD(&(x[0]), ms, &(x[0]));
|
Chris@10
|
110 Ta = LD(&(x[WS(rs, 3)]), ms, &(x[WS(rs, 1)]));
|
Chris@10
|
111 Tb = VZMUL(T3, Ta);
|
Chris@10
|
112 T5 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
|
Chris@10
|
113 T6 = VZMUL(T4, T5);
|
Chris@10
|
114 T8 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
|
Chris@10
|
115 T9 = VZMUL(T2, T8);
|
Chris@10
|
116 {
|
Chris@10
|
117 V T7, Tc, Td, Te;
|
Chris@10
|
118 T7 = VSUB(T1, T6);
|
Chris@10
|
119 Tc = VBYI(VSUB(T9, Tb));
|
Chris@10
|
120 ST(&(x[WS(rs, 3)]), VSUB(T7, Tc), ms, &(x[WS(rs, 1)]));
|
Chris@10
|
121 ST(&(x[WS(rs, 1)]), VADD(T7, Tc), ms, &(x[WS(rs, 1)]));
|
Chris@10
|
122 Td = VADD(T1, T6);
|
Chris@10
|
123 Te = VADD(T9, Tb);
|
Chris@10
|
124 ST(&(x[WS(rs, 2)]), VSUB(Td, Te), ms, &(x[0]));
|
Chris@10
|
125 ST(&(x[0]), VADD(Td, Te), ms, &(x[0]));
|
Chris@10
|
126 }
|
Chris@10
|
127 }
|
Chris@10
|
128 }
|
Chris@10
|
129 }
|
Chris@10
|
130 VLEAVE();
|
Chris@10
|
131 }
|
Chris@10
|
132
|
Chris@10
|
133 static const tw_instr twinstr[] = {
|
Chris@10
|
134 VTW(0, 1),
|
Chris@10
|
135 VTW(0, 3),
|
Chris@10
|
136 {TW_NEXT, VL, 0}
|
Chris@10
|
137 };
|
Chris@10
|
138
|
Chris@10
|
139 static const ct_desc desc = { 4, XSIMD_STRING("t3bv_4"), twinstr, &GENUS, {12, 8, 0, 0}, 0, 0, 0 };
|
Chris@10
|
140
|
Chris@10
|
141 void XSIMD(codelet_t3bv_4) (planner *p) {
|
Chris@10
|
142 X(kdft_dit_register) (p, t3bv_4, &desc);
|
Chris@10
|
143 }
|
Chris@10
|
144 #endif /* HAVE_FMA */
|