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