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:35:42 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_notw.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 4 -name n1_4 -include n.h */
|
Chris@10
|
29
|
Chris@10
|
30 /*
|
Chris@10
|
31 * This function contains 16 FP additions, 0 FP multiplications,
|
Chris@10
|
32 * (or, 16 additions, 0 multiplications, 0 fused multiply/add),
|
Chris@10
|
33 * 13 stack variables, 0 constants, and 16 memory accesses
|
Chris@10
|
34 */
|
Chris@10
|
35 #include "n.h"
|
Chris@10
|
36
|
Chris@10
|
37 static void n1_4(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
|
Chris@10
|
38 {
|
Chris@10
|
39 {
|
Chris@10
|
40 INT i;
|
Chris@10
|
41 for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(16, is), MAKE_VOLATILE_STRIDE(16, os)) {
|
Chris@10
|
42 E T4, Tb, T3, Tf, T9, T5, Tc, Td;
|
Chris@10
|
43 {
|
Chris@10
|
44 E T1, T2, T7, T8;
|
Chris@10
|
45 T1 = ri[0];
|
Chris@10
|
46 T2 = ri[WS(is, 2)];
|
Chris@10
|
47 T7 = ii[0];
|
Chris@10
|
48 T8 = ii[WS(is, 2)];
|
Chris@10
|
49 T4 = ri[WS(is, 1)];
|
Chris@10
|
50 Tb = T1 - T2;
|
Chris@10
|
51 T3 = T1 + T2;
|
Chris@10
|
52 Tf = T7 + T8;
|
Chris@10
|
53 T9 = T7 - T8;
|
Chris@10
|
54 T5 = ri[WS(is, 3)];
|
Chris@10
|
55 Tc = ii[WS(is, 1)];
|
Chris@10
|
56 Td = ii[WS(is, 3)];
|
Chris@10
|
57 }
|
Chris@10
|
58 {
|
Chris@10
|
59 E T6, Ta, Te, Tg;
|
Chris@10
|
60 T6 = T4 + T5;
|
Chris@10
|
61 Ta = T4 - T5;
|
Chris@10
|
62 Te = Tc - Td;
|
Chris@10
|
63 Tg = Tc + Td;
|
Chris@10
|
64 io[WS(os, 3)] = Ta + T9;
|
Chris@10
|
65 io[WS(os, 1)] = T9 - Ta;
|
Chris@10
|
66 ro[0] = T3 + T6;
|
Chris@10
|
67 ro[WS(os, 2)] = T3 - T6;
|
Chris@10
|
68 io[0] = Tf + Tg;
|
Chris@10
|
69 io[WS(os, 2)] = Tf - Tg;
|
Chris@10
|
70 ro[WS(os, 3)] = Tb - Te;
|
Chris@10
|
71 ro[WS(os, 1)] = Tb + Te;
|
Chris@10
|
72 }
|
Chris@10
|
73 }
|
Chris@10
|
74 }
|
Chris@10
|
75 }
|
Chris@10
|
76
|
Chris@10
|
77 static const kdft_desc desc = { 4, "n1_4", {16, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
|
Chris@10
|
78
|
Chris@10
|
79 void X(codelet_n1_4) (planner *p) {
|
Chris@10
|
80 X(kdft_register) (p, n1_4, &desc);
|
Chris@10
|
81 }
|
Chris@10
|
82
|
Chris@10
|
83 #else /* HAVE_FMA */
|
Chris@10
|
84
|
Chris@10
|
85 /* Generated by: ../../../genfft/gen_notw.native -compact -variables 4 -pipeline-latency 4 -n 4 -name n1_4 -include n.h */
|
Chris@10
|
86
|
Chris@10
|
87 /*
|
Chris@10
|
88 * This function contains 16 FP additions, 0 FP multiplications,
|
Chris@10
|
89 * (or, 16 additions, 0 multiplications, 0 fused multiply/add),
|
Chris@10
|
90 * 13 stack variables, 0 constants, and 16 memory accesses
|
Chris@10
|
91 */
|
Chris@10
|
92 #include "n.h"
|
Chris@10
|
93
|
Chris@10
|
94 static void n1_4(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
|
Chris@10
|
95 {
|
Chris@10
|
96 {
|
Chris@10
|
97 INT i;
|
Chris@10
|
98 for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(16, is), MAKE_VOLATILE_STRIDE(16, os)) {
|
Chris@10
|
99 E T3, Tb, T9, Tf, T6, Ta, Te, Tg;
|
Chris@10
|
100 {
|
Chris@10
|
101 E T1, T2, T7, T8;
|
Chris@10
|
102 T1 = ri[0];
|
Chris@10
|
103 T2 = ri[WS(is, 2)];
|
Chris@10
|
104 T3 = T1 + T2;
|
Chris@10
|
105 Tb = T1 - T2;
|
Chris@10
|
106 T7 = ii[0];
|
Chris@10
|
107 T8 = ii[WS(is, 2)];
|
Chris@10
|
108 T9 = T7 - T8;
|
Chris@10
|
109 Tf = T7 + T8;
|
Chris@10
|
110 }
|
Chris@10
|
111 {
|
Chris@10
|
112 E T4, T5, Tc, Td;
|
Chris@10
|
113 T4 = ri[WS(is, 1)];
|
Chris@10
|
114 T5 = ri[WS(is, 3)];
|
Chris@10
|
115 T6 = T4 + T5;
|
Chris@10
|
116 Ta = T4 - T5;
|
Chris@10
|
117 Tc = ii[WS(is, 1)];
|
Chris@10
|
118 Td = ii[WS(is, 3)];
|
Chris@10
|
119 Te = Tc - Td;
|
Chris@10
|
120 Tg = Tc + Td;
|
Chris@10
|
121 }
|
Chris@10
|
122 ro[WS(os, 2)] = T3 - T6;
|
Chris@10
|
123 io[WS(os, 2)] = Tf - Tg;
|
Chris@10
|
124 ro[0] = T3 + T6;
|
Chris@10
|
125 io[0] = Tf + Tg;
|
Chris@10
|
126 io[WS(os, 1)] = T9 - Ta;
|
Chris@10
|
127 ro[WS(os, 1)] = Tb + Te;
|
Chris@10
|
128 io[WS(os, 3)] = Ta + T9;
|
Chris@10
|
129 ro[WS(os, 3)] = Tb - Te;
|
Chris@10
|
130 }
|
Chris@10
|
131 }
|
Chris@10
|
132 }
|
Chris@10
|
133
|
Chris@10
|
134 static const kdft_desc desc = { 4, "n1_4", {16, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
|
Chris@10
|
135
|
Chris@10
|
136 void X(codelet_n1_4) (planner *p) {
|
Chris@10
|
137 X(kdft_register) (p, n1_4, &desc);
|
Chris@10
|
138 }
|
Chris@10
|
139
|
Chris@10
|
140 #endif /* HAVE_FMA */
|