cannam@167
|
1 /*
|
cannam@167
|
2 * Copyright (c) 2003, 2007-14 Matteo Frigo
|
cannam@167
|
3 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
|
cannam@167
|
4 *
|
cannam@167
|
5 * This program is free software; you can redistribute it and/or modify
|
cannam@167
|
6 * it under the terms of the GNU General Public License as published by
|
cannam@167
|
7 * the Free Software Foundation; either version 2 of the License, or
|
cannam@167
|
8 * (at your option) any later version.
|
cannam@167
|
9 *
|
cannam@167
|
10 * This program is distributed in the hope that it will be useful,
|
cannam@167
|
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
cannam@167
|
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
cannam@167
|
13 * GNU General Public License for more details.
|
cannam@167
|
14 *
|
cannam@167
|
15 * You should have received a copy of the GNU General Public License
|
cannam@167
|
16 * along with this program; if not, write to the Free Software
|
cannam@167
|
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
cannam@167
|
18 *
|
cannam@167
|
19 */
|
cannam@167
|
20
|
cannam@167
|
21 /* This file was automatically generated --- DO NOT EDIT */
|
cannam@167
|
22 /* Generated on Thu May 24 08:06:28 EDT 2018 */
|
cannam@167
|
23
|
cannam@167
|
24 #include "rdft/codelet-rdft.h"
|
cannam@167
|
25
|
cannam@167
|
26 #if defined(ARCH_PREFERS_FMA) || defined(ISA_EXTENSION_PREFERS_FMA)
|
cannam@167
|
27
|
cannam@167
|
28 /* Generated by: ../../../genfft/gen_hc2hc.native -fma -compact -variables 4 -pipeline-latency 4 -n 2 -dit -name hf_2 -include rdft/scalar/hf.h */
|
cannam@167
|
29
|
cannam@167
|
30 /*
|
cannam@167
|
31 * This function contains 6 FP additions, 4 FP multiplications,
|
cannam@167
|
32 * (or, 4 additions, 2 multiplications, 2 fused multiply/add),
|
cannam@167
|
33 * 11 stack variables, 0 constants, and 8 memory accesses
|
cannam@167
|
34 */
|
cannam@167
|
35 #include "rdft/scalar/hf.h"
|
cannam@167
|
36
|
cannam@167
|
37 static void hf_2(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
|
cannam@167
|
38 {
|
cannam@167
|
39 {
|
cannam@167
|
40 INT m;
|
cannam@167
|
41 for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 2, MAKE_VOLATILE_STRIDE(4, rs)) {
|
cannam@167
|
42 E T1, Ta, T3, T6, T4, T8, T2, T7, T9, T5;
|
cannam@167
|
43 T1 = cr[0];
|
cannam@167
|
44 Ta = ci[0];
|
cannam@167
|
45 T3 = cr[WS(rs, 1)];
|
cannam@167
|
46 T6 = ci[WS(rs, 1)];
|
cannam@167
|
47 T2 = W[0];
|
cannam@167
|
48 T4 = T2 * T3;
|
cannam@167
|
49 T8 = T2 * T6;
|
cannam@167
|
50 T5 = W[1];
|
cannam@167
|
51 T7 = FMA(T5, T6, T4);
|
cannam@167
|
52 T9 = FNMS(T5, T3, T8);
|
cannam@167
|
53 ci[0] = T1 - T7;
|
cannam@167
|
54 cr[0] = T1 + T7;
|
cannam@167
|
55 cr[WS(rs, 1)] = T9 - Ta;
|
cannam@167
|
56 ci[WS(rs, 1)] = T9 + Ta;
|
cannam@167
|
57 }
|
cannam@167
|
58 }
|
cannam@167
|
59 }
|
cannam@167
|
60
|
cannam@167
|
61 static const tw_instr twinstr[] = {
|
cannam@167
|
62 {TW_FULL, 1, 2},
|
cannam@167
|
63 {TW_NEXT, 1, 0}
|
cannam@167
|
64 };
|
cannam@167
|
65
|
cannam@167
|
66 static const hc2hc_desc desc = { 2, "hf_2", twinstr, &GENUS, {4, 2, 2, 0} };
|
cannam@167
|
67
|
cannam@167
|
68 void X(codelet_hf_2) (planner *p) {
|
cannam@167
|
69 X(khc2hc_register) (p, hf_2, &desc);
|
cannam@167
|
70 }
|
cannam@167
|
71 #else
|
cannam@167
|
72
|
cannam@167
|
73 /* Generated by: ../../../genfft/gen_hc2hc.native -compact -variables 4 -pipeline-latency 4 -n 2 -dit -name hf_2 -include rdft/scalar/hf.h */
|
cannam@167
|
74
|
cannam@167
|
75 /*
|
cannam@167
|
76 * This function contains 6 FP additions, 4 FP multiplications,
|
cannam@167
|
77 * (or, 4 additions, 2 multiplications, 2 fused multiply/add),
|
cannam@167
|
78 * 9 stack variables, 0 constants, and 8 memory accesses
|
cannam@167
|
79 */
|
cannam@167
|
80 #include "rdft/scalar/hf.h"
|
cannam@167
|
81
|
cannam@167
|
82 static void hf_2(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms)
|
cannam@167
|
83 {
|
cannam@167
|
84 {
|
cannam@167
|
85 INT m;
|
cannam@167
|
86 for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 2, MAKE_VOLATILE_STRIDE(4, rs)) {
|
cannam@167
|
87 E T1, T8, T6, T7;
|
cannam@167
|
88 T1 = cr[0];
|
cannam@167
|
89 T8 = ci[0];
|
cannam@167
|
90 {
|
cannam@167
|
91 E T3, T5, T2, T4;
|
cannam@167
|
92 T3 = cr[WS(rs, 1)];
|
cannam@167
|
93 T5 = ci[WS(rs, 1)];
|
cannam@167
|
94 T2 = W[0];
|
cannam@167
|
95 T4 = W[1];
|
cannam@167
|
96 T6 = FMA(T2, T3, T4 * T5);
|
cannam@167
|
97 T7 = FNMS(T4, T3, T2 * T5);
|
cannam@167
|
98 }
|
cannam@167
|
99 ci[0] = T1 - T6;
|
cannam@167
|
100 cr[0] = T1 + T6;
|
cannam@167
|
101 cr[WS(rs, 1)] = T7 - T8;
|
cannam@167
|
102 ci[WS(rs, 1)] = T7 + T8;
|
cannam@167
|
103 }
|
cannam@167
|
104 }
|
cannam@167
|
105 }
|
cannam@167
|
106
|
cannam@167
|
107 static const tw_instr twinstr[] = {
|
cannam@167
|
108 {TW_FULL, 1, 2},
|
cannam@167
|
109 {TW_NEXT, 1, 0}
|
cannam@167
|
110 };
|
cannam@167
|
111
|
cannam@167
|
112 static const hc2hc_desc desc = { 2, "hf_2", twinstr, &GENUS, {4, 2, 2, 0} };
|
cannam@167
|
113
|
cannam@167
|
114 void X(codelet_hf_2) (planner *p) {
|
cannam@167
|
115 X(khc2hc_register) (p, hf_2, &desc);
|
cannam@167
|
116 }
|
cannam@167
|
117 #endif
|