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:39:45 EST 2012 */
|
Chris@10
|
23
|
Chris@10
|
24 #include "codelet-rdft.h"
|
Chris@10
|
25
|
Chris@10
|
26 #ifdef HAVE_FMA
|
Chris@10
|
27
|
Chris@10
|
28 /* Generated by: ../../../genfft/gen_r2cf.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 2 -name r2cf_2 -include r2cf.h */
|
Chris@10
|
29
|
Chris@10
|
30 /*
|
Chris@10
|
31 * This function contains 2 FP additions, 0 FP multiplications,
|
Chris@10
|
32 * (or, 2 additions, 0 multiplications, 0 fused multiply/add),
|
Chris@10
|
33 * 3 stack variables, 0 constants, and 4 memory accesses
|
Chris@10
|
34 */
|
Chris@10
|
35 #include "r2cf.h"
|
Chris@10
|
36
|
Chris@10
|
37 static void r2cf_2(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, 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, R0 = R0 + ivs, R1 = R1 + ivs, Cr = Cr + ovs, Ci = Ci + ovs, MAKE_VOLATILE_STRIDE(8, rs), MAKE_VOLATILE_STRIDE(8, csr), MAKE_VOLATILE_STRIDE(8, csi)) {
|
Chris@10
|
42 E T1, T2;
|
Chris@10
|
43 T1 = R0[0];
|
Chris@10
|
44 T2 = R1[0];
|
Chris@10
|
45 Cr[0] = T1 + T2;
|
Chris@10
|
46 Cr[WS(csr, 1)] = T1 - T2;
|
Chris@10
|
47 }
|
Chris@10
|
48 }
|
Chris@10
|
49 }
|
Chris@10
|
50
|
Chris@10
|
51 static const kr2c_desc desc = { 2, "r2cf_2", {2, 0, 0, 0}, &GENUS };
|
Chris@10
|
52
|
Chris@10
|
53 void X(codelet_r2cf_2) (planner *p) {
|
Chris@10
|
54 X(kr2c_register) (p, r2cf_2, &desc);
|
Chris@10
|
55 }
|
Chris@10
|
56
|
Chris@10
|
57 #else /* HAVE_FMA */
|
Chris@10
|
58
|
Chris@10
|
59 /* Generated by: ../../../genfft/gen_r2cf.native -compact -variables 4 -pipeline-latency 4 -n 2 -name r2cf_2 -include r2cf.h */
|
Chris@10
|
60
|
Chris@10
|
61 /*
|
Chris@10
|
62 * This function contains 2 FP additions, 0 FP multiplications,
|
Chris@10
|
63 * (or, 2 additions, 0 multiplications, 0 fused multiply/add),
|
Chris@10
|
64 * 3 stack variables, 0 constants, and 4 memory accesses
|
Chris@10
|
65 */
|
Chris@10
|
66 #include "r2cf.h"
|
Chris@10
|
67
|
Chris@10
|
68 static void r2cf_2(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs)
|
Chris@10
|
69 {
|
Chris@10
|
70 {
|
Chris@10
|
71 INT i;
|
Chris@10
|
72 for (i = v; i > 0; i = i - 1, R0 = R0 + ivs, R1 = R1 + ivs, Cr = Cr + ovs, Ci = Ci + ovs, MAKE_VOLATILE_STRIDE(8, rs), MAKE_VOLATILE_STRIDE(8, csr), MAKE_VOLATILE_STRIDE(8, csi)) {
|
Chris@10
|
73 E T1, T2;
|
Chris@10
|
74 T1 = R0[0];
|
Chris@10
|
75 T2 = R1[0];
|
Chris@10
|
76 Cr[WS(csr, 1)] = T1 - T2;
|
Chris@10
|
77 Cr[0] = T1 + T2;
|
Chris@10
|
78 }
|
Chris@10
|
79 }
|
Chris@10
|
80 }
|
Chris@10
|
81
|
Chris@10
|
82 static const kr2c_desc desc = { 2, "r2cf_2", {2, 0, 0, 0}, &GENUS };
|
Chris@10
|
83
|
Chris@10
|
84 void X(codelet_r2cf_2) (planner *p) {
|
Chris@10
|
85 X(kr2c_register) (p, r2cf_2, &desc);
|
Chris@10
|
86 }
|
Chris@10
|
87
|
Chris@10
|
88 #endif /* HAVE_FMA */
|