1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
|
/*
* Copyright (c) 2003, 2006 Matteo Frigo
* Copyright (c) 2003, 2006 Massachusetts Institute of Technology
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
/* This file was automatically generated --- DO NOT EDIT */
/* Generated on Sun Jul 2 16:15:24 EDT 2006 */
#include "codelet-rdft.h"
#ifdef HAVE_FMA
/* Generated by: ../../../genfft/gen_hc2r -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -sign 1 -n 4 -name hc2r_4 -include hc2r.h */
/*
* This function contains 6 FP additions, 4 FP multiplications,
* (or, 2 additions, 0 multiplications, 4 fused multiply/add),
* 8 stack variables, and 8 memory accesses
*/
/*
* Generator Id's :
* $Id: algsimp.ml,v 1.9 2006-02-12 23:34:12 athena Exp $
* $Id: fft.ml,v 1.4 2006-01-05 03:04:27 stevenj Exp $
* $Id: gen_hc2r.ml,v 1.19 2006-02-12 23:34:12 athena Exp $
*/
#include "hc2r.h"
static void hc2r_4(const R *ri, const R *ii, R *O, stride ris, stride iis, stride os, INT v, INT ivs, INT ovs)
{
DK(KP2_000000000, +2.000000000000000000000000000000000000000000000);
INT i;
for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, O = O + ovs, MAKE_VOLATILE_STRIDE(ris), MAKE_VOLATILE_STRIDE(iis), MAKE_VOLATILE_STRIDE(os)) {
E T4, T6, T1, T2, T3, T5;
T4 = ri[WS(ris, 1)];
T6 = ii[WS(iis, 1)];
T1 = ri[0];
T2 = ri[WS(ris, 2)];
T3 = T1 + T2;
T5 = T1 - T2;
O[WS(os, 1)] = FNMS(KP2_000000000, T6, T5);
O[WS(os, 3)] = FMA(KP2_000000000, T6, T5);
O[0] = FMA(KP2_000000000, T4, T3);
O[WS(os, 2)] = FNMS(KP2_000000000, T4, T3);
}
}
static const khc2r_desc desc = { 4, "hc2r_4", {2, 0, 4, 0}, &GENUS, 0, 0, 0, 0, 0 };
void X(codelet_hc2r_4) (planner *p) {
X(khc2r_register) (p, hc2r_4, &desc);
}
#else /* HAVE_FMA */
/* Generated by: ../../../genfft/gen_hc2r -compact -variables 4 -pipeline-latency 4 -sign 1 -n 4 -name hc2r_4 -include hc2r.h */
/*
* This function contains 6 FP additions, 2 FP multiplications,
* (or, 6 additions, 2 multiplications, 0 fused multiply/add),
* 10 stack variables, and 8 memory accesses
*/
/*
* Generator Id's :
* $Id: algsimp.ml,v 1.9 2006-02-12 23:34:12 athena Exp $
* $Id: fft.ml,v 1.4 2006-01-05 03:04:27 stevenj Exp $
* $Id: gen_hc2r.ml,v 1.19 2006-02-12 23:34:12 athena Exp $
*/
#include "hc2r.h"
static void hc2r_4(const R *ri, const R *ii, R *O, stride ris, stride iis, stride os, INT v, INT ivs, INT ovs)
{
DK(KP2_000000000, +2.000000000000000000000000000000000000000000000);
INT i;
for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, O = O + ovs, MAKE_VOLATILE_STRIDE(ris), MAKE_VOLATILE_STRIDE(iis), MAKE_VOLATILE_STRIDE(os)) {
E T5, T8, T3, T6;
{
E T4, T7, T1, T2;
T4 = ri[WS(ris, 1)];
T5 = KP2_000000000 * T4;
T7 = ii[WS(iis, 1)];
T8 = KP2_000000000 * T7;
T1 = ri[0];
T2 = ri[WS(ris, 2)];
T3 = T1 + T2;
T6 = T1 - T2;
}
O[WS(os, 2)] = T3 - T5;
O[WS(os, 3)] = T6 + T8;
O[0] = T3 + T5;
O[WS(os, 1)] = T6 - T8;
}
}
static const khc2r_desc desc = { 4, "hc2r_4", {6, 2, 0, 0}, &GENUS, 0, 0, 0, 0, 0 };
void X(codelet_hc2r_4) (planner *p) {
X(khc2r_register) (p, hc2r_4, &desc);
}
#endif /* HAVE_FMA */
|
