diff options
| author | scuri <scuri> | 2008-10-17 06:10:15 +0000 | 
|---|---|---|
| committer | scuri <scuri> | 2008-10-17 06:10:15 +0000 | 
| commit | 5a422aba704c375a307a902bafe658342e209906 (patch) | |
| tree | 5005011e086bb863d8fb587ad3319bbec59b2447 /src/fftw3/rdft/codelets/r2r | |
First commit - moving from LuaForge to SourceForge
Diffstat (limited to 'src/fftw3/rdft/codelets/r2r')
| -rw-r--r-- | src/fftw3/rdft/codelets/r2r/e01_8.c | 118 | ||||
| -rw-r--r-- | src/fftw3/rdft/codelets/r2r/e10_8.c | 118 | ||||
| -rw-r--r-- | src/fftw3/rdft/codelets/r2r/rrcodlist.c | 12 | 
3 files changed, 248 insertions, 0 deletions
diff --git a/src/fftw3/rdft/codelets/r2r/e01_8.c b/src/fftw3/rdft/codelets/r2r/e01_8.c new file mode 100644 index 0000000..b48371c --- /dev/null +++ b/src/fftw3/rdft/codelets/r2r/e01_8.c @@ -0,0 +1,118 @@ +/* + * Copyright (c) 2003 Matteo Frigo + * Copyright (c) 2003 Massachusetts Institute of Technology + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation; either version 2 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA + * + */ + +/* This file was automatically generated --- DO NOT EDIT */ +/* Generated on Sat Jul  5 22:22:02 EDT 2003 */ + +#include "codelet-rdft.h" + +/* Generated by: /homee/stevenj/cvs/fftw3.0.1/genfft/gen_r2r -compact -variables 4 -redft01 -n 8 -name e01_8 -include r2r.h */ + +/* + * This function contains 26 FP additions, 15 FP multiplications, + * (or, 20 additions, 9 multiplications, 6 fused multiply/add), + * 27 stack variables, and 16 memory accesses + */ +/* + * Generator Id's :  + * $Id: e01_8.c,v 1.1 2008/10/17 06:13:17 scuri Exp $ + * $Id: e01_8.c,v 1.1 2008/10/17 06:13:17 scuri Exp $ + * $Id: e01_8.c,v 1.1 2008/10/17 06:13:17 scuri Exp $ + */ + +#include "r2r.h" + +static void e01_8_0(const R *I, R *O, stride istride, stride ostride) +{ +     DK(KP1_662939224, +1.662939224605090474157576755235811513477121624); +     DK(KP1_111140466, +1.111140466039204449485661627897065748749874382); +     DK(KP390180644, +0.390180644032256535696569736954044481855383236); +     DK(KP1_961570560, +1.961570560806460898252364472268478073947867462); +     DK(KP707106781, +0.707106781186547524400844362104849039284835938); +     DK(KP1_414213562, +1.414213562373095048801688724209698078569671875); +     DK(KP765366864, +0.765366864730179543456919968060797733522689125); +     DK(KP1_847759065, +1.847759065022573512256366378793576573644833252); +     { +	  E T7, Tl, T4, Tk, Td, To, Tg, Tn; +	  { +	       E T5, T6, T1, T3, T2; +	       T5 = I[WS(istride, 2)]; +	       T6 = I[WS(istride, 6)]; +	       T7 = FMA(KP1_847759065, T5, KP765366864 * T6); +	       Tl = FNMS(KP1_847759065, T6, KP765366864 * T5); +	       T1 = I[0]; +	       T2 = I[WS(istride, 4)]; +	       T3 = KP1_414213562 * T2; +	       T4 = T1 + T3; +	       Tk = T1 - T3; +	       { +		    E T9, Tf, Tc, Te, Ta, Tb; +		    T9 = I[WS(istride, 1)]; +		    Tf = I[WS(istride, 7)]; +		    Ta = I[WS(istride, 5)]; +		    Tb = I[WS(istride, 3)]; +		    Tc = KP707106781 * (Ta + Tb); +		    Te = KP707106781 * (Ta - Tb); +		    Td = T9 + Tc; +		    To = Te + Tf; +		    Tg = Te - Tf; +		    Tn = T9 - Tc; +	       } +	  } +	  { +	       E T8, Th, Tq, Tr; +	       T8 = T4 + T7; +	       Th = FNMS(KP390180644, Tg, KP1_961570560 * Td); +	       O[WS(ostride, 7)] = T8 - Th; +	       O[0] = T8 + Th; +	       Tq = Tk - Tl; +	       Tr = FMA(KP1_111140466, Tn, KP1_662939224 * To); +	       O[WS(ostride, 5)] = Tq - Tr; +	       O[WS(ostride, 2)] = Tq + Tr; +	  } +	  { +	       E Ti, Tj, Tm, Tp; +	       Ti = T4 - T7; +	       Tj = FMA(KP390180644, Td, KP1_961570560 * Tg); +	       O[WS(ostride, 4)] = Ti - Tj; +	       O[WS(ostride, 3)] = Ti + Tj; +	       Tm = Tk + Tl; +	       Tp = FNMS(KP1_111140466, To, KP1_662939224 * Tn); +	       O[WS(ostride, 6)] = Tm - Tp; +	       O[WS(ostride, 1)] = Tm + Tp; +	  } +     } +} + +static void e01_8(const R *I, R *O, stride is, stride os, int v, int ivs, int ovs) +{ +     int i; +     for (i = v; i > 0; --i) { +	  e01_8_0(I, O, is, os); +	  I += ivs; +	  O += ovs; +     } +} + +static const kr2r_desc desc = { 8, "e01_8", {20, 9, 6, 0}, &GENUS, REDFT01, 0, 0, 0, 0 }; + +void X(codelet_e01_8) (planner *p) { +     X(kr2r_register) (p, e01_8, &desc); +} diff --git a/src/fftw3/rdft/codelets/r2r/e10_8.c b/src/fftw3/rdft/codelets/r2r/e10_8.c new file mode 100644 index 0000000..6d7be49 --- /dev/null +++ b/src/fftw3/rdft/codelets/r2r/e10_8.c @@ -0,0 +1,118 @@ +/* + * Copyright (c) 2003 Matteo Frigo + * Copyright (c) 2003 Massachusetts Institute of Technology + * + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License as published by + * the Free Software Foundation; either version 2 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the + * GNU General Public License for more details. + * + * You should have received a copy of the GNU General Public License + * along with this program; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA + * + */ + +/* This file was automatically generated --- DO NOT EDIT */ +/* Generated on Sat Jul  5 22:22:02 EDT 2003 */ + +#include "codelet-rdft.h" + +/* Generated by: /homee/stevenj/cvs/fftw3.0.1/genfft/gen_r2r -compact -variables 4 -redft10 -n 8 -name e10_8 -include r2r.h */ + +/* + * This function contains 26 FP additions, 16 FP multiplications, + * (or, 20 additions, 10 multiplications, 6 fused multiply/add), + * 27 stack variables, and 16 memory accesses + */ +/* + * Generator Id's :  + * $Id: e10_8.c,v 1.1 2008/10/17 06:13:17 scuri Exp $ + * $Id: e10_8.c,v 1.1 2008/10/17 06:13:17 scuri Exp $ + * $Id: e10_8.c,v 1.1 2008/10/17 06:13:17 scuri Exp $ + */ + +#include "r2r.h" + +static void e10_8_0(const R *I, R *O, stride istride, stride ostride) +{ +     DK(KP765366864, +0.765366864730179543456919968060797733522689125); +     DK(KP1_847759065, +1.847759065022573512256366378793576573644833252); +     DK(KP390180644, +0.390180644032256535696569736954044481855383236); +     DK(KP1_961570560, +1.961570560806460898252364472268478073947867462); +     DK(KP2_000000000, +2.000000000000000000000000000000000000000000000); +     DK(KP1_414213562, +1.414213562373095048801688724209698078569671875); +     DK(KP1_111140466, +1.111140466039204449485661627897065748749874382); +     DK(KP1_662939224, +1.662939224605090474157576755235811513477121624); +     DK(KP707106781, +0.707106781186547524400844362104849039284835938); +     { +	  E T3, Tj, Tf, Tk, Ta, Tn, Tc, Tm; +	  { +	       E T1, T2, Td, Te; +	       T1 = I[0]; +	       T2 = I[WS(istride, 7)]; +	       T3 = T1 - T2; +	       Tj = T1 + T2; +	       Td = I[WS(istride, 4)]; +	       Te = I[WS(istride, 3)]; +	       Tf = Td - Te; +	       Tk = Td + Te; +	       { +		    E T4, T5, T6, T7, T8, T9; +		    T4 = I[WS(istride, 2)]; +		    T5 = I[WS(istride, 5)]; +		    T6 = T4 - T5; +		    T7 = I[WS(istride, 1)]; +		    T8 = I[WS(istride, 6)]; +		    T9 = T7 - T8; +		    Ta = KP707106781 * (T6 + T9); +		    Tn = T7 + T8; +		    Tc = KP707106781 * (T6 - T9); +		    Tm = T4 + T5; +	       } +	  } +	  { +	       E Tb, Tg, Tp, Tq; +	       Tb = T3 - Ta; +	       Tg = Tc - Tf; +	       O[WS(ostride, 3)] = FNMS(KP1_111140466, Tg, KP1_662939224 * Tb); +	       O[WS(ostride, 5)] = FMA(KP1_662939224, Tg, KP1_111140466 * Tb); +	       Tp = Tj + Tk; +	       Tq = Tm + Tn; +	       O[WS(ostride, 4)] = KP1_414213562 * (Tp - Tq); +	       O[0] = KP2_000000000 * (Tp + Tq); +	  } +	  { +	       E Th, Ti, Tl, To; +	       Th = T3 + Ta; +	       Ti = Tf + Tc; +	       O[WS(ostride, 1)] = FNMS(KP390180644, Ti, KP1_961570560 * Th); +	       O[WS(ostride, 7)] = FMA(KP1_961570560, Ti, KP390180644 * Th); +	       Tl = Tj - Tk; +	       To = Tm - Tn; +	       O[WS(ostride, 2)] = FNMS(KP765366864, To, KP1_847759065 * Tl); +	       O[WS(ostride, 6)] = FMA(KP765366864, Tl, KP1_847759065 * To); +	  } +     } +} + +static void e10_8(const R *I, R *O, stride is, stride os, int v, int ivs, int ovs) +{ +     int i; +     for (i = v; i > 0; --i) { +	  e10_8_0(I, O, is, os); +	  I += ivs; +	  O += ovs; +     } +} + +static const kr2r_desc desc = { 8, "e10_8", {20, 10, 6, 0}, &GENUS, REDFT10, 0, 0, 0, 0 }; + +void X(codelet_e10_8) (planner *p) { +     X(kr2r_register) (p, e10_8, &desc); +} diff --git a/src/fftw3/rdft/codelets/r2r/rrcodlist.c b/src/fftw3/rdft/codelets/r2r/rrcodlist.c new file mode 100644 index 0000000..28c1ebc --- /dev/null +++ b/src/fftw3/rdft/codelets/r2r/rrcodlist.c @@ -0,0 +1,12 @@ +#include "ifftw.h" + +extern void X(codelet_e01_8)(planner *); +extern void X(codelet_e10_8)(planner *); + + +extern const solvtab X(solvtab_rdft_r2r); +const solvtab X(solvtab_rdft_r2r) = { +   SOLVTAB(X(codelet_e01_8)), +   SOLVTAB(X(codelet_e10_8)), +   SOLVTAB_END +};  | 
