Rev 2 | 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:55:18 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 -twiddle 2 */ |
||
| 27 | |||
| 28 | /* |
||
| 29 | * This function contains 6 FP additions, 4 FP multiplications, |
||
| 30 | * (or, 4 additions, 2 multiplications, 2 fused multiply/add), |
||
| 31 | * 10 stack variables, and 8 memory accesses |
||
| 32 | */ |
||
| 33 | |||
| 34 | /* |
||
| 35 | * Generator Id's : |
||
| 36 | * $Id: ftw_2.c,v 1.1.1.1 2002-03-29 14:12:56 pj Exp $ |
||
| 37 | * $Id: ftw_2.c,v 1.1.1.1 2002-03-29 14:12:56 pj Exp $ |
||
| 38 | * $Id: ftw_2.c,v 1.1.1.1 2002-03-29 14:12:56 pj Exp $ |
||
| 39 | */ |
||
| 40 | |||
| 41 | void fftw_twiddle_2(fftw_complex *A, const fftw_complex *W, int iostride, int m, int dist) |
||
| 42 | { |
||
| 43 | int i; |
||
| 44 | fftw_complex *inout; |
||
| 45 | inout = A; |
||
| 46 | for (i = m; i > 0; i = i - 1, inout = inout + dist, W = W + 1) { |
||
| 47 | fftw_real tmp1; |
||
| 48 | fftw_real tmp8; |
||
| 49 | fftw_real tmp6; |
||
| 50 | fftw_real tmp7; |
||
| 51 | ASSERT_ALIGNED_DOUBLE(); |
||
| 52 | tmp1 = c_re(inout[0]); |
||
| 53 | tmp8 = c_im(inout[0]); |
||
| 54 | { |
||
| 55 | fftw_real tmp3; |
||
| 56 | fftw_real tmp5; |
||
| 57 | fftw_real tmp2; |
||
| 58 | fftw_real tmp4; |
||
| 59 | ASSERT_ALIGNED_DOUBLE(); |
||
| 60 | tmp3 = c_re(inout[iostride]); |
||
| 61 | tmp5 = c_im(inout[iostride]); |
||
| 62 | tmp2 = c_re(W[0]); |
||
| 63 | tmp4 = c_im(W[0]); |
||
| 64 | tmp6 = (tmp2 * tmp3) - (tmp4 * tmp5); |
||
| 65 | tmp7 = (tmp4 * tmp3) + (tmp2 * tmp5); |
||
| 66 | } |
||
| 67 | c_re(inout[iostride]) = tmp1 - tmp6; |
||
| 68 | c_re(inout[0]) = tmp1 + tmp6; |
||
| 69 | c_im(inout[0]) = tmp7 + tmp8; |
||
| 70 | c_im(inout[iostride]) = tmp8 - tmp7; |
||
| 71 | } |
||
| 72 | } |
||
| 73 | |||
| 74 | static const int twiddle_order[] = |
||
| 75 | {1}; |
||
| 76 | fftw_codelet_desc fftw_twiddle_2_desc = |
||
| 77 | { |
||
| 78 | "fftw_twiddle_2", |
||
| 79 | (void (*)()) fftw_twiddle_2, |
||
| 80 | 2, |
||
| 81 | FFTW_FORWARD, |
||
| 82 | FFTW_TWIDDLE, |
||
| 83 | 44, |
||
| 84 | 1, |
||
| 85 | twiddle_order, |
||
| 86 | }; |