| Bsoft 1.9 Bernard's software package

- Main Page
- Namespaces
- Classes
- Files

- File List
- File Members

fni_3.c
Go to the documentation of this file.
1 /*
2 * Copyright (c) 1997-1999, 2003 Massachusetts Institute of Technology
3 *
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 2 of the License, or
7 * (at your option) any later version.
8 *
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 *
18 */
19
20 /* This file was automatically generated --- DO NOT EDIT */
21 /* Generated on Mon Mar 24 02:06:18 EST 2003 */
22
23 #include "fftw-int.h"
24 #include "fftw.h"
25
26 /* Generated by: /homee/stevenj/cvs/fftw/gensrc/genfft -magic-alignment-check -magic-twiddle-load-all -magic-variables 4 -magic-loopi -notwiddleinv 3 */
27
28 /*
29 * This function contains 12 FP additions, 4 FP multiplications,
30 * (or, 10 additions, 2 multiplications, 2 fused multiply/add),
31 * 12 stack variables, and 12 memory accesses
32 */
33 static const fftw_real K500000000 =
34 FFTW_KONST(+0.500000000000000000000000000000000000000000000);
35 static const fftw_real K866025403 =
36 FFTW_KONST(+0.866025403784438646763723170752936183471402627);
37
38 /*
39 * Generator Id's :
40 * $Id: exprdag.ml,v 1.43 2003/03/16 23:43:46 stevenj Exp $
41 * $Id: fft.ml,v 1.44 2003/03/16 23:43:46 stevenj Exp $
42 * $Id: to_c.ml,v 1.26 2003/03/16 23:43:46 stevenj Exp $
43 */
44
45 void fftwi_no_twiddle_3(const fftw_complex *input, fftw_complex *output,
46 int istride, int ostride)
47 {
48 fftw_real tmp1;
49 fftw_real tmp6;
50 fftw_real tmp4;
51 fftw_real tmp5;
52 fftw_real tmp9;
53 fftw_real tmp12;
54 fftw_real tmp11;
55 fftw_real tmp10;
56 ASSERT_ALIGNED_DOUBLE;
57 tmp1 = c_re(input[0]);
58 tmp6 = c_im(input[0]);
59 {
60 fftw_real tmp2;
61 fftw_real tmp3;
62 fftw_real tmp7;
63 fftw_real tmp8;
64 ASSERT_ALIGNED_DOUBLE;
65 tmp2 = c_re(input[istride]);
66 tmp3 = c_re(input[2 * istride]);
67 tmp4 = tmp2 + tmp3;
68 tmp5 = K866025403 * (tmp2 - tmp3);
69 tmp7 = c_im(input[istride]);
70 tmp8 = c_im(input[2 * istride]);
71 tmp9 = tmp7 + tmp8;
72 tmp12 = K866025403 * (tmp8 - tmp7);
73 }
74 c_re(output[0]) = tmp1 + tmp4;
75 tmp11 = tmp1 - (K500000000 * tmp4);
76 c_re(output[2 * ostride]) = tmp11 - tmp12;
77 c_re(output[ostride]) = tmp11 + tmp12;
78 c_im(output[0]) = tmp6 + tmp9;
79 tmp10 = tmp6 - (K500000000 * tmp9);
80 c_im(output[ostride]) = tmp5 + tmp10;
81 c_im(output[2 * ostride]) = tmp10 - tmp5;
82 }
83
84 fftw_codelet_desc fftwi_no_twiddle_3_desc = {
85 "fftwi_no_twiddle_3",
86 (void (*)()) fftwi_no_twiddle_3,
87 3,
88 FFTW_BACKWARD,
89 FFTW_NOTW,
90 78,
91 0,
92 (const int *) 0,
93 };
fftw_codelet_desc
Definition: fftw.h:126
fftwi_no_twiddle_3
void fftwi_no_twiddle_3(const fftw_complex *input, fftw_complex *output, int istride, int ostride)
Definition: fni_3.c:45
fftw-int.h
fftw_complex
Definition: fftw.h:57
FFTW_KONST
#define FFTW_KONST(x)
Definition: fftw-int.h:178
fftw.h
fftwi_no_twiddle_3_desc
fftw_codelet_desc fftwi_no_twiddle_3_desc
Definition: fni_3.c:84
c_re
#define c_re(c)
Definition: fftw.h:60
FFTW_BACKWARD
Definition: fftw.h:64
ASSERT_ALIGNED_DOUBLE
#define ASSERT_ALIGNED_DOUBLE
Definition: fftw-int.h:236
c_im
#define c_im(c)
Definition: fftw.h:61
fftw_real
float fftw_real
Definition: fftw.h:49
FFTW_NOTW
Definition: fftw.h:121