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
|
/*
* 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:05:37 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 -notwiddle 3 */
/*
* This function contains 12 FP additions, 4 FP multiplications,
* (or, 10 additions, 2 multiplications, 2 fused multiply/add),
* 12 stack variables, and 12 memory accesses
*/
static const fftw_real K500000000 =
FFTW_KONST(+0.500000000000000000000000000000000000000000000);
static const fftw_real K866025403 =
FFTW_KONST(+0.866025403784438646763723170752936183471402627);
/*
* Generator Id's :
* $Id: fn_3.c,v 1.1 2008/10/17 06:13:18 scuri Exp $
* $Id: fn_3.c,v 1.1 2008/10/17 06:13:18 scuri Exp $
* $Id: fn_3.c,v 1.1 2008/10/17 06:13:18 scuri Exp $
*/
void fftw_no_twiddle_3(const fftw_complex *input, fftw_complex *output,
int istride, int ostride)
{
fftw_real tmp1;
fftw_real tmp10;
fftw_real tmp4;
fftw_real tmp9;
fftw_real tmp8;
fftw_real tmp11;
fftw_real tmp5;
fftw_real tmp12;
ASSERT_ALIGNED_DOUBLE;
tmp1 = c_re(input[0]);
tmp10 = c_im(input[0]);
{
fftw_real tmp2;
fftw_real tmp3;
fftw_real tmp6;
fftw_real tmp7;
ASSERT_ALIGNED_DOUBLE;
tmp2 = c_re(input[istride]);
tmp3 = c_re(input[2 * istride]);
tmp4 = tmp2 + tmp3;
tmp9 = K866025403 * (tmp3 - tmp2);
tmp6 = c_im(input[istride]);
tmp7 = c_im(input[2 * istride]);
tmp8 = K866025403 * (tmp6 - tmp7);
tmp11 = tmp6 + tmp7;
}
c_re(output[0]) = tmp1 + tmp4;
tmp5 = tmp1 - (K500000000 * tmp4);
c_re(output[2 * ostride]) = tmp5 - tmp8;
c_re(output[ostride]) = tmp5 + tmp8;
c_im(output[0]) = tmp10 + tmp11;
tmp12 = tmp10 - (K500000000 * tmp11);
c_im(output[ostride]) = tmp9 + tmp12;
c_im(output[2 * ostride]) = tmp12 - tmp9;
}
fftw_codelet_desc fftw_no_twiddle_3_desc = {
"fftw_no_twiddle_3",
(void (*)()) fftw_no_twiddle_3,
3,
FFTW_FORWARD,
FFTW_NOTW,
67,
0,
(const int *) 0,
};
|
