| Bsoft 1.9 Bernard's software package

- Main Page
- Namespaces
- Classes
- Files

- File List
- File Members

fni_6.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:19 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 6 */
27
28 /*
29 * This function contains 36 FP additions, 8 FP multiplications,
30 * (or, 32 additions, 4 multiplications, 4 fused multiply/add),
31 * 20 stack variables, and 24 memory accesses
32 */
33 static const fftw_real K866025403 =
34 FFTW_KONST(+0.866025403784438646763723170752936183471402627);
35 static const fftw_real K500000000 =
36 FFTW_KONST(+0.500000000000000000000000000000000000000000000);
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_6(const fftw_complex *input, fftw_complex *output,
46 int istride, int ostride)
47 {
48 fftw_real tmp3;
49 fftw_real tmp11;
50 fftw_real tmp26;
51 fftw_real tmp29;
52 fftw_real tmp6;
53 fftw_real tmp12;
54 fftw_real tmp9;
55 fftw_real tmp13;
56 fftw_real tmp10;
57 fftw_real tmp14;
58 fftw_real tmp18;
59 fftw_real tmp31;
60 fftw_real tmp21;
61 fftw_real tmp30;
62 fftw_real tmp27;
63 fftw_real tmp32;
64 ASSERT_ALIGNED_DOUBLE;
65 {
66 fftw_real tmp1;
67 fftw_real tmp2;
68 fftw_real tmp24;
69 fftw_real tmp25;
70 ASSERT_ALIGNED_DOUBLE;
71 tmp1 = c_re(input[0]);
72 tmp2 = c_re(input[3 * istride]);
73 tmp3 = tmp1 - tmp2;
74 tmp11 = tmp1 + tmp2;
75 tmp24 = c_im(input[0]);
76 tmp25 = c_im(input[3 * istride]);
77 tmp26 = tmp24 - tmp25;
78 tmp29 = tmp24 + tmp25;
79 }
80 {
81 fftw_real tmp4;
82 fftw_real tmp5;
83 fftw_real tmp7;
84 fftw_real tmp8;
85 ASSERT_ALIGNED_DOUBLE;
86 tmp4 = c_re(input[2 * istride]);
87 tmp5 = c_re(input[5 * istride]);
88 tmp6 = tmp4 - tmp5;
89 tmp12 = tmp4 + tmp5;
90 tmp7 = c_re(input[4 * istride]);
91 tmp8 = c_re(input[istride]);
92 tmp9 = tmp7 - tmp8;
93 tmp13 = tmp7 + tmp8;
94 }
95 tmp10 = tmp6 + tmp9;
96 tmp14 = tmp12 + tmp13;
97 {
98 fftw_real tmp16;
99 fftw_real tmp17;
100 fftw_real tmp19;
101 fftw_real tmp20;
102 ASSERT_ALIGNED_DOUBLE;
103 tmp16 = c_im(input[4 * istride]);
104 tmp17 = c_im(input[istride]);
105 tmp18 = tmp16 - tmp17;
106 tmp31 = tmp16 + tmp17;
107 tmp19 = c_im(input[2 * istride]);
108 tmp20 = c_im(input[5 * istride]);
109 tmp21 = tmp19 - tmp20;
110 tmp30 = tmp19 + tmp20;
111 }
112 tmp27 = tmp21 + tmp18;
113 tmp32 = tmp30 + tmp31;
114 {
115 fftw_real tmp15;
116 fftw_real tmp22;
117 fftw_real tmp35;
118 fftw_real tmp36;
119 ASSERT_ALIGNED_DOUBLE;
120 c_re(output[3 * ostride]) = tmp3 + tmp10;
121 tmp15 = tmp3 - (K500000000 * tmp10);
122 tmp22 = K866025403 * (tmp18 - tmp21);
123 c_re(output[5 * ostride]) = tmp15 - tmp22;
124 c_re(output[ostride]) = tmp15 + tmp22;
125 c_re(output[0]) = tmp11 + tmp14;
126 tmp35 = tmp11 - (K500000000 * tmp14);
127 tmp36 = K866025403 * (tmp31 - tmp30);
128 c_re(output[2 * ostride]) = tmp35 - tmp36;
129 c_re(output[4 * ostride]) = tmp35 + tmp36;
130 }
131 {
132 fftw_real tmp23;
133 fftw_real tmp28;
134 fftw_real tmp33;
135 fftw_real tmp34;
136 ASSERT_ALIGNED_DOUBLE;
137 c_im(output[3 * ostride]) = tmp26 + tmp27;
138 tmp23 = K866025403 * (tmp6 - tmp9);
139 tmp28 = tmp26 - (K500000000 * tmp27);
140 c_im(output[ostride]) = tmp23 + tmp28;
141 c_im(output[5 * ostride]) = tmp28 - tmp23;
142 c_im(output[0]) = tmp29 + tmp32;
143 tmp33 = tmp29 - (K500000000 * tmp32);
144 tmp34 = K866025403 * (tmp12 - tmp13);
145 c_im(output[2 * ostride]) = tmp33 - tmp34;
146 c_im(output[4 * ostride]) = tmp34 + tmp33;
147 }
148 }
149
150 fftw_codelet_desc fftwi_no_twiddle_6_desc = {
151 "fftwi_no_twiddle_6",
152 (void (*)()) fftwi_no_twiddle_6,
153 6,
154 FFTW_BACKWARD,
155 FFTW_NOTW,
156 144,
157 0,
158 (const int *) 0,
159 };
fftw_codelet_desc
Definition: fftw.h:126
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_6
void fftwi_no_twiddle_6(const fftw_complex *input, fftw_complex *output, int istride, int ostride)
Definition: fni_6.c:45
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
fftwi_no_twiddle_6_desc
fftw_codelet_desc fftwi_no_twiddle_6_desc
Definition: fni_6.c:150
FFTW_NOTW
Definition: fftw.h:121