Subversion Repositories shark

Rev

Details | 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:43 EDT 1999 */
22
 
23
#include <ports/fftw-int.h>
24
#include <ports/fftw.h>
25
 
26
/* Generated by: ./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 = FFTW_KONST(+0.500000000000000000000000000000000000000000000);
34
static const fftw_real K866025403 = FFTW_KONST(+0.866025403784438646763723170752936183471402627);
35
 
36
/*
37
 * Generator Id's :
38
 * $Id: fni_3.c,v 1.1.1.1 2002-03-29 14:12:56 pj Exp $
39
 * $Id: fni_3.c,v 1.1.1.1 2002-03-29 14:12:56 pj Exp $
40
 * $Id: fni_3.c,v 1.1.1.1 2002-03-29 14:12:56 pj Exp $
41
 */
42
 
43
void fftwi_no_twiddle_3(const fftw_complex *input, fftw_complex *output, int istride, int ostride)
44
{
45
     fftw_real tmp1;
46
     fftw_real tmp6;
47
     fftw_real tmp4;
48
     fftw_real tmp5;
49
     fftw_real tmp9;
50
     fftw_real tmp12;
51
     fftw_real tmp11;
52
     fftw_real tmp10;
53
     ASSERT_ALIGNED_DOUBLE();
54
     tmp1 = c_re(input[0]);
55
     tmp6 = c_im(input[0]);
56
     {
57
          fftw_real tmp2;
58
          fftw_real tmp3;
59
          fftw_real tmp7;
60
          fftw_real tmp8;
61
          ASSERT_ALIGNED_DOUBLE();
62
          tmp2 = c_re(input[istride]);
63
          tmp3 = c_re(input[2 * istride]);
64
          tmp4 = tmp2 + tmp3;
65
          tmp5 = K866025403 * (tmp2 - tmp3);
66
          tmp7 = c_im(input[istride]);
67
          tmp8 = c_im(input[2 * istride]);
68
          tmp9 = tmp7 + tmp8;
69
          tmp12 = K866025403 * (tmp8 - tmp7);
70
     }
71
     c_re(output[0]) = tmp1 + tmp4;
72
     tmp11 = tmp1 - (K500000000 * tmp4);
73
     c_re(output[2 * ostride]) = tmp11 - tmp12;
74
     c_re(output[ostride]) = tmp11 + tmp12;
75
     c_im(output[0]) = tmp6 + tmp9;
76
     tmp10 = tmp6 - (K500000000 * tmp9);
77
     c_im(output[ostride]) = tmp5 + tmp10;
78
     c_im(output[2 * ostride]) = tmp10 - tmp5;
79
}
80
 
81
fftw_codelet_desc fftwi_no_twiddle_3_desc =
82
{
83
     "fftwi_no_twiddle_3",
84
     (void (*)()) fftwi_no_twiddle_3,
85
     3,
86
     FFTW_BACKWARD,
87
     FFTW_NOTW,
88
     78,
89
     0,
90
     (const int *) 0,
91
};