Subversion Repositories shark

Rev

Rev 3 | Go to most recent revision | 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:27 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 -notwiddle 4 */
27
 
28
/*
29
 * This function contains 16 FP additions, 0 FP multiplications,
30
 * (or, 16 additions, 0 multiplications, 0 fused multiply/add),
31
 * 12 stack variables, and 16 memory accesses
32
 */
33
 
34
/*
35
 * Generator Id's :
107 pj 36
 * $Id: fn_4.c,v 1.2 2003-03-24 11:14:50 pj Exp $
37
 * $Id: fn_4.c,v 1.2 2003-03-24 11:14:50 pj Exp $
38
 * $Id: fn_4.c,v 1.2 2003-03-24 11:14:50 pj Exp $
2 pj 39
 */
40
 
41
void fftw_no_twiddle_4(const fftw_complex *input, fftw_complex *output, int istride, int ostride)
42
{
43
     fftw_real tmp3;
44
     fftw_real tmp11;
45
     fftw_real tmp9;
46
     fftw_real tmp15;
47
     fftw_real tmp6;
48
     fftw_real tmp10;
49
     fftw_real tmp14;
50
     fftw_real tmp16;
51
     ASSERT_ALIGNED_DOUBLE();
52
     {
53
          fftw_real tmp1;
54
          fftw_real tmp2;
55
          fftw_real tmp7;
56
          fftw_real tmp8;
57
          ASSERT_ALIGNED_DOUBLE();
58
          tmp1 = c_re(input[0]);
59
          tmp2 = c_re(input[2 * istride]);
60
          tmp3 = tmp1 + tmp2;
61
          tmp11 = tmp1 - tmp2;
62
          tmp7 = c_im(input[0]);
63
          tmp8 = c_im(input[2 * istride]);
64
          tmp9 = tmp7 - tmp8;
65
          tmp15 = tmp7 + tmp8;
66
     }
67
     {
68
          fftw_real tmp4;
69
          fftw_real tmp5;
70
          fftw_real tmp12;
71
          fftw_real tmp13;
72
          ASSERT_ALIGNED_DOUBLE();
73
          tmp4 = c_re(input[istride]);
74
          tmp5 = c_re(input[3 * istride]);
75
          tmp6 = tmp4 + tmp5;
76
          tmp10 = tmp4 - tmp5;
77
          tmp12 = c_im(input[istride]);
78
          tmp13 = c_im(input[3 * istride]);
79
          tmp14 = tmp12 - tmp13;
80
          tmp16 = tmp12 + tmp13;
81
     }
82
     c_re(output[2 * ostride]) = tmp3 - tmp6;
83
     c_re(output[0]) = tmp3 + tmp6;
84
     c_im(output[ostride]) = tmp9 - tmp10;
85
     c_im(output[3 * ostride]) = tmp10 + tmp9;
86
     c_re(output[3 * ostride]) = tmp11 - tmp14;
87
     c_re(output[ostride]) = tmp11 + tmp14;
88
     c_im(output[2 * ostride]) = tmp15 - tmp16;
89
     c_im(output[0]) = tmp15 + tmp16;
90
}
91
 
92
fftw_codelet_desc fftw_no_twiddle_4_desc =
93
{
94
     "fftw_no_twiddle_4",
95
     (void (*)()) fftw_no_twiddle_4,
96
     4,
97
     FFTW_FORWARD,
98
     FFTW_NOTW,
99
     89,
100
     0,
101
     (const int *) 0,
102
};