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
|
/*
* Copyright (c) 1997-1999, 2003 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 Mon Mar 24 02:07:48 EST 2003 */
#include "fftw-int.h"
#include "fftw.h"
/* Generated by: /homee/stevenj/cvs/fftw/gensrc/genfft -magic-alignment-check -magic-twiddle-load-all -magic-variables 4 -magic-loopi -hc2hc-forward 2 */
/*
* This function contains 8 FP additions, 4 FP multiplications,
* (or, 6 additions, 2 multiplications, 2 fused multiply/add),
* 11 stack variables, and 16 memory accesses
*/
/*
* Generator Id's :
* $Id: exprdag.ml,v 1.43 2003/03/16 23:43:46 stevenj Exp $
* $Id: fft.ml,v 1.44 2003/03/16 23:43:46 stevenj Exp $
* $Id: to_c.ml,v 1.26 2003/03/16 23:43:46 stevenj Exp $
*/
void fftw_hc2hc_forward_2(fftw_real *A, const fftw_complex *W,
int iostride, int m, int dist)
{
int i;
fftw_real *X;
fftw_real *Y;
X = A;
Y = A + (2 * iostride);
{
fftw_real tmp11;
fftw_real tmp12;
ASSERT_ALIGNED_DOUBLE;
tmp11 = X[0];
tmp12 = X[iostride];
X[iostride] = tmp11 - tmp12;
X[0] = tmp11 + tmp12;
}
X = X + dist;
Y = Y - dist;
for (i = 2; i < m; i = i + 2, X = X + dist, Y = Y - dist, W = W + 1) {
fftw_real tmp3;
fftw_real tmp9;
fftw_real tmp8;
fftw_real tmp10;
ASSERT_ALIGNED_DOUBLE;
tmp3 = X[0];
tmp9 = Y[-iostride];
{
fftw_real tmp5;
fftw_real tmp7;
fftw_real tmp4;
fftw_real tmp6;
ASSERT_ALIGNED_DOUBLE;
tmp5 = X[iostride];
tmp7 = Y[0];
tmp4 = c_re(W[0]);
tmp6 = c_im(W[0]);
tmp8 = (tmp4 * tmp5) - (tmp6 * tmp7);
tmp10 = (tmp6 * tmp5) + (tmp4 * tmp7);
}
Y[-iostride] = tmp3 - tmp8;
X[0] = tmp3 + tmp8;
X[iostride] = -(tmp9 - tmp10);
Y[0] = tmp10 + tmp9;
}
if (i == m) {
fftw_real tmp1;
fftw_real tmp2;
ASSERT_ALIGNED_DOUBLE;
tmp1 = X[0];
X[0] = tmp1;
tmp2 = X[iostride];
Y[0] = -tmp2;
}
}
static const int twiddle_order[] = { 1 };
fftw_codelet_desc fftw_hc2hc_forward_2_desc = {
"fftw_hc2hc_forward_2",
(void (*)()) fftw_hc2hc_forward_2,
2,
FFTW_FORWARD,
FFTW_HC2HC,
47,
1,
twiddle_order,
};
|
