comparison src/fftw-3.3.3/dft/scalar/codelets/n1_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:35:42 EST 2012 */
23
24 #include "codelet-dft.h"
25
26 #ifdef HAVE_FMA
27
28 /* Generated by: ../../../genfft/gen_notw.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 3 -name n1_3 -include n.h */
29
30 /*
31 * This function contains 12 FP additions, 6 FP multiplications,
32 * (or, 6 additions, 0 multiplications, 6 fused multiply/add),
33 * 15 stack variables, 2 constants, and 12 memory accesses
34 */
35 #include "n.h"
36
37 static void n1_3(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
38 {
39 DK(KP866025403, +0.866025403784438646763723170752936183471402627);
40 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
41 {
42 INT i;
43 for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(12, is), MAKE_VOLATILE_STRIDE(12, os)) {
44 E T1, T9, T2, T3, T6, T7;
45 T1 = ri[0];
46 T9 = ii[0];
47 T2 = ri[WS(is, 1)];
48 T3 = ri[WS(is, 2)];
49 T6 = ii[WS(is, 1)];
50 T7 = ii[WS(is, 2)];
51 {
52 E T4, Tc, T8, Ta, T5, Tb;
53 T4 = T2 + T3;
54 Tc = T3 - T2;
55 T8 = T6 - T7;
56 Ta = T6 + T7;
57 T5 = FNMS(KP500000000, T4, T1);
58 ro[0] = T1 + T4;
59 Tb = FNMS(KP500000000, Ta, T9);
60 io[0] = T9 + Ta;
61 ro[WS(os, 1)] = FMA(KP866025403, T8, T5);
62 ro[WS(os, 2)] = FNMS(KP866025403, T8, T5);
63 io[WS(os, 2)] = FNMS(KP866025403, Tc, Tb);
64 io[WS(os, 1)] = FMA(KP866025403, Tc, Tb);
65 }
66 }
67 }
68 }
69
70 static const kdft_desc desc = { 3, "n1_3", {6, 0, 6, 0}, &GENUS, 0, 0, 0, 0 };
71
72 void X(codelet_n1_3) (planner *p) {
73 X(kdft_register) (p, n1_3, &desc);
74 }
75
76 #else /* HAVE_FMA */
77
78 /* Generated by: ../../../genfft/gen_notw.native -compact -variables 4 -pipeline-latency 4 -n 3 -name n1_3 -include n.h */
79
80 /*
81 * This function contains 12 FP additions, 4 FP multiplications,
82 * (or, 10 additions, 2 multiplications, 2 fused multiply/add),
83 * 15 stack variables, 2 constants, and 12 memory accesses
84 */
85 #include "n.h"
86
87 static void n1_3(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
88 {
89 DK(KP500000000, +0.500000000000000000000000000000000000000000000);
90 DK(KP866025403, +0.866025403784438646763723170752936183471402627);
91 {
92 INT i;
93 for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(12, is), MAKE_VOLATILE_STRIDE(12, os)) {
94 E T1, Ta, T4, T9, T8, Tb, T5, Tc;
95 T1 = ri[0];
96 Ta = ii[0];
97 {
98 E T2, T3, T6, T7;
99 T2 = ri[WS(is, 1)];
100 T3 = ri[WS(is, 2)];
101 T4 = T2 + T3;
102 T9 = KP866025403 * (T3 - T2);
103 T6 = ii[WS(is, 1)];
104 T7 = ii[WS(is, 2)];
105 T8 = KP866025403 * (T6 - T7);
106 Tb = T6 + T7;
107 }
108 ro[0] = T1 + T4;
109 io[0] = Ta + Tb;
110 T5 = FNMS(KP500000000, T4, T1);
111 ro[WS(os, 2)] = T5 - T8;
112 ro[WS(os, 1)] = T5 + T8;
113 Tc = FNMS(KP500000000, Tb, Ta);
114 io[WS(os, 1)] = T9 + Tc;
115 io[WS(os, 2)] = Tc - T9;
116 }
117 }
118 }
119
120 static const kdft_desc desc = { 3, "n1_3", {10, 2, 2, 0}, &GENUS, 0, 0, 0, 0 };
121
122 void X(codelet_n1_3) (planner *p) {
123 X(kdft_register) (p, n1_3, &desc);
124 }
125
126 #endif /* HAVE_FMA */