Subversion Repositories shark

Rev

Rev 3 | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
2 pj 1
/*
2
 * Copyright (c) 1997-1999 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 Tue May 18 13:54:44 EDT 1999 */
22
 
107 pj 23
#include <fftw-int.h>
24
#include <fftw.h>
2 pj 25
 
26
/* Generated by: ./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 = FFTW_KONST(+0.866025403784438646763723170752936183471402627);
34
static const fftw_real K500000000 = FFTW_KONST(+0.500000000000000000000000000000000000000000000);
35
 
36
/*
37
 * Generator Id's :
107 pj 38
 * $Id: fni_6.c,v 1.2 2003-03-24 11:14:52 pj Exp $
39
 * $Id: fni_6.c,v 1.2 2003-03-24 11:14:52 pj Exp $
40
 * $Id: fni_6.c,v 1.2 2003-03-24 11:14:52 pj Exp $
2 pj 41
 */
42
 
43
void fftwi_no_twiddle_6(const fftw_complex *input, fftw_complex *output, int istride, int ostride)
44
{
45
     fftw_real tmp3;
46
     fftw_real tmp11;
47
     fftw_real tmp26;
48
     fftw_real tmp29;
49
     fftw_real tmp6;
50
     fftw_real tmp12;
51
     fftw_real tmp9;
52
     fftw_real tmp13;
53
     fftw_real tmp10;
54
     fftw_real tmp14;
55
     fftw_real tmp18;
56
     fftw_real tmp31;
57
     fftw_real tmp21;
58
     fftw_real tmp30;
59
     fftw_real tmp27;
60
     fftw_real tmp32;
61
     ASSERT_ALIGNED_DOUBLE();
62
     {
63
          fftw_real tmp1;
64
          fftw_real tmp2;
65
          fftw_real tmp24;
66
          fftw_real tmp25;
67
          ASSERT_ALIGNED_DOUBLE();
68
          tmp1 = c_re(input[0]);
69
          tmp2 = c_re(input[3 * istride]);
70
          tmp3 = tmp1 - tmp2;
71
          tmp11 = tmp1 + tmp2;
72
          tmp24 = c_im(input[0]);
73
          tmp25 = c_im(input[3 * istride]);
74
          tmp26 = tmp24 - tmp25;
75
          tmp29 = tmp24 + tmp25;
76
     }
77
     {
78
          fftw_real tmp4;
79
          fftw_real tmp5;
80
          fftw_real tmp7;
81
          fftw_real tmp8;
82
          ASSERT_ALIGNED_DOUBLE();
83
          tmp4 = c_re(input[2 * istride]);
84
          tmp5 = c_re(input[5 * istride]);
85
          tmp6 = tmp4 - tmp5;
86
          tmp12 = tmp4 + tmp5;
87
          tmp7 = c_re(input[4 * istride]);
88
          tmp8 = c_re(input[istride]);
89
          tmp9 = tmp7 - tmp8;
90
          tmp13 = tmp7 + tmp8;
91
     }
92
     tmp10 = tmp6 + tmp9;
93
     tmp14 = tmp12 + tmp13;
94
     {
95
          fftw_real tmp16;
96
          fftw_real tmp17;
97
          fftw_real tmp19;
98
          fftw_real tmp20;
99
          ASSERT_ALIGNED_DOUBLE();
100
          tmp16 = c_im(input[4 * istride]);
101
          tmp17 = c_im(input[istride]);
102
          tmp18 = tmp16 - tmp17;
103
          tmp31 = tmp16 + tmp17;
104
          tmp19 = c_im(input[2 * istride]);
105
          tmp20 = c_im(input[5 * istride]);
106
          tmp21 = tmp19 - tmp20;
107
          tmp30 = tmp19 + tmp20;
108
     }
109
     tmp27 = tmp21 + tmp18;
110
     tmp32 = tmp30 + tmp31;
111
     {
112
          fftw_real tmp15;
113
          fftw_real tmp22;
114
          fftw_real tmp35;
115
          fftw_real tmp36;
116
          ASSERT_ALIGNED_DOUBLE();
117
          c_re(output[3 * ostride]) = tmp3 + tmp10;
118
          tmp15 = tmp3 - (K500000000 * tmp10);
119
          tmp22 = K866025403 * (tmp18 - tmp21);
120
          c_re(output[5 * ostride]) = tmp15 - tmp22;
121
          c_re(output[ostride]) = tmp15 + tmp22;
122
          c_re(output[0]) = tmp11 + tmp14;
123
          tmp35 = tmp11 - (K500000000 * tmp14);
124
          tmp36 = K866025403 * (tmp31 - tmp30);
125
          c_re(output[2 * ostride]) = tmp35 - tmp36;
126
          c_re(output[4 * ostride]) = tmp35 + tmp36;
127
     }
128
     {
129
          fftw_real tmp23;
130
          fftw_real tmp28;
131
          fftw_real tmp33;
132
          fftw_real tmp34;
133
          ASSERT_ALIGNED_DOUBLE();
134
          c_im(output[3 * ostride]) = tmp26 + tmp27;
135
          tmp23 = K866025403 * (tmp6 - tmp9);
136
          tmp28 = tmp26 - (K500000000 * tmp27);
137
          c_im(output[ostride]) = tmp23 + tmp28;
138
          c_im(output[5 * ostride]) = tmp28 - tmp23;
139
          c_im(output[0]) = tmp29 + tmp32;
140
          tmp33 = tmp29 - (K500000000 * tmp32);
141
          tmp34 = K866025403 * (tmp12 - tmp13);
142
          c_im(output[2 * ostride]) = tmp33 - tmp34;
143
          c_im(output[4 * ostride]) = tmp34 + tmp33;
144
     }
145
}
146
 
147
fftw_codelet_desc fftwi_no_twiddle_6_desc =
148
{
149
     "fftwi_no_twiddle_6",
150
     (void (*)()) fftwi_no_twiddle_6,
151
     6,
152
     FFTW_BACKWARD,
153
     FFTW_NOTW,
154
     144,
155
     0,
156
     (const int *) 0,
157
};