Mercurial > hg > sv-dependency-builds
comparison src/fftw-3.3.3/dft/simd/common/t1fv_3.c @ 10:37bf6b4a2645
Add FFTW3
author | Chris Cannam |
---|---|
date | Wed, 20 Mar 2013 15:35:50 +0000 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
9:c0fb53affa76 | 10:37bf6b4a2645 |
---|---|
1 /* | |
2 * Copyright (c) 2003, 2007-11 Matteo Frigo | |
3 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology | |
4 * | |
5 * This program is free software; you can redistribute it and/or modify | |
6 * it under the terms of the GNU General Public License as published by | |
7 * the Free Software Foundation; either version 2 of the License, or | |
8 * (at your option) any later version. | |
9 * | |
10 * This program is distributed in the hope that it will be useful, | |
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
13 * GNU General Public License for more details. | |
14 * | |
15 * You should have received a copy of the GNU General Public License | |
16 * along with this program; if not, write to the Free Software | |
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | |
18 * | |
19 */ | |
20 | |
21 /* This file was automatically generated --- DO NOT EDIT */ | |
22 /* Generated on Sun Nov 25 07:38:01 EST 2012 */ | |
23 | |
24 #include "codelet-dft.h" | |
25 | |
26 #ifdef HAVE_FMA | |
27 | |
28 /* Generated by: ../../../genfft/gen_twiddle_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 3 -name t1fv_3 -include t1f.h */ | |
29 | |
30 /* | |
31 * This function contains 8 FP additions, 8 FP multiplications, | |
32 * (or, 5 additions, 5 multiplications, 3 fused multiply/add), | |
33 * 12 stack variables, 2 constants, and 6 memory accesses | |
34 */ | |
35 #include "t1f.h" | |
36 | |
37 static void t1fv_3(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms) | |
38 { | |
39 DVK(KP500000000, +0.500000000000000000000000000000000000000000000); | |
40 DVK(KP866025403, +0.866025403784438646763723170752936183471402627); | |
41 { | |
42 INT m; | |
43 R *x; | |
44 x = ri; | |
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)) { | |
46 V T1, T2, T4; | |
47 T1 = LD(&(x[0]), ms, &(x[0])); | |
48 T2 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)])); | |
49 T4 = LD(&(x[WS(rs, 2)]), ms, &(x[0])); | |
50 { | |
51 V T3, T5, T8, T6, T7; | |
52 T3 = BYTWJ(&(W[0]), T2); | |
53 T5 = BYTWJ(&(W[TWVL * 2]), T4); | |
54 T8 = VMUL(LDK(KP866025403), VSUB(T5, T3)); | |
55 T6 = VADD(T3, T5); | |
56 T7 = VFNMS(LDK(KP500000000), T6, T1); | |
57 ST(&(x[0]), VADD(T1, T6), ms, &(x[0])); | |
58 ST(&(x[WS(rs, 1)]), VFMAI(T8, T7), ms, &(x[WS(rs, 1)])); | |
59 ST(&(x[WS(rs, 2)]), VFNMSI(T8, T7), ms, &(x[0])); | |
60 } | |
61 } | |
62 } | |
63 VLEAVE(); | |
64 } | |
65 | |
66 static const tw_instr twinstr[] = { | |
67 VTW(0, 1), | |
68 VTW(0, 2), | |
69 {TW_NEXT, VL, 0} | |
70 }; | |
71 | |
72 static const ct_desc desc = { 3, XSIMD_STRING("t1fv_3"), twinstr, &GENUS, {5, 5, 3, 0}, 0, 0, 0 }; | |
73 | |
74 void XSIMD(codelet_t1fv_3) (planner *p) { | |
75 X(kdft_dit_register) (p, t1fv_3, &desc); | |
76 } | |
77 #else /* HAVE_FMA */ | |
78 | |
79 /* Generated by: ../../../genfft/gen_twiddle_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 3 -name t1fv_3 -include t1f.h */ | |
80 | |
81 /* | |
82 * This function contains 8 FP additions, 6 FP multiplications, | |
83 * (or, 7 additions, 5 multiplications, 1 fused multiply/add), | |
84 * 12 stack variables, 2 constants, and 6 memory accesses | |
85 */ | |
86 #include "t1f.h" | |
87 | |
88 static void t1fv_3(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms) | |
89 { | |
90 DVK(KP866025403, +0.866025403784438646763723170752936183471402627); | |
91 DVK(KP500000000, +0.500000000000000000000000000000000000000000000); | |
92 { | |
93 INT m; | |
94 R *x; | |
95 x = ri; | |
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)) { | |
97 V T1, T3, T5, T6, T2, T4, T7, T8; | |
98 T1 = LD(&(x[0]), ms, &(x[0])); | |
99 T2 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)])); | |
100 T3 = BYTWJ(&(W[0]), T2); | |
101 T4 = LD(&(x[WS(rs, 2)]), ms, &(x[0])); | |
102 T5 = BYTWJ(&(W[TWVL * 2]), T4); | |
103 T6 = VADD(T3, T5); | |
104 ST(&(x[0]), VADD(T1, T6), ms, &(x[0])); | |
105 T7 = VFNMS(LDK(KP500000000), T6, T1); | |
106 T8 = VBYI(VMUL(LDK(KP866025403), VSUB(T5, T3))); | |
107 ST(&(x[WS(rs, 2)]), VSUB(T7, T8), ms, &(x[0])); | |
108 ST(&(x[WS(rs, 1)]), VADD(T7, T8), ms, &(x[WS(rs, 1)])); | |
109 } | |
110 } | |
111 VLEAVE(); | |
112 } | |
113 | |
114 static const tw_instr twinstr[] = { | |
115 VTW(0, 1), | |
116 VTW(0, 2), | |
117 {TW_NEXT, VL, 0} | |
118 }; | |
119 | |
120 static const ct_desc desc = { 3, XSIMD_STRING("t1fv_3"), twinstr, &GENUS, {7, 5, 1, 0}, 0, 0, 0 }; | |
121 | |
122 void XSIMD(codelet_t1fv_3) (planner *p) { | |
123 X(kdft_dit_register) (p, t1fv_3, &desc); | |
124 } | |
125 #endif /* HAVE_FMA */ |