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