Mercurial > hg > sv-dependency-builds
diff src/fftw-3.3.3/rdft/scalar/r2cb/hb2_4.c @ 10:37bf6b4a2645
Add FFTW3
author | Chris Cannam |
---|---|
date | Wed, 20 Mar 2013 15:35:50 +0000 |
parents | |
children |
line wrap: on
line diff
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/src/fftw-3.3.3/rdft/scalar/r2cb/hb2_4.c Wed Mar 20 15:35:50 2013 +0000 @@ -0,0 +1,200 @@ +/* + * Copyright (c) 2003, 2007-11 Matteo Frigo + * Copyright (c) 2003, 2007-11 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA + * + */ + +/* This file was automatically generated --- DO NOT EDIT */ +/* Generated on Sun Nov 25 07:41:23 EST 2012 */ + +#include "codelet-rdft.h" + +#ifdef HAVE_FMA + +/* Generated by: ../../../genfft/gen_hc2hc.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -sign 1 -twiddle-log3 -precompute-twiddles -n 4 -dif -name hb2_4 -include hb.h */ + +/* + * This function contains 24 FP additions, 16 FP multiplications, + * (or, 16 additions, 8 multiplications, 8 fused multiply/add), + * 33 stack variables, 0 constants, and 16 memory accesses + */ +#include "hb.h" + +static void hb2_4(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms) +{ + { + INT m; + for (m = mb, W = W + ((mb - 1) * 4); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 4, MAKE_VOLATILE_STRIDE(8, rs)) { + E Tg, Tc, Te, To, Tn; + { + E T7, Tb, T8, Ta; + T7 = W[0]; + Tb = W[3]; + T8 = W[2]; + Ta = W[1]; + { + E Tj, Tm, T3, T6, Tx, Tr, Tz, Tv, Td; + { + E Tu, T4, Tq, T5, Tp, Tt; + { + E Tk, Tl, T1, T2; + { + E Th, Tf, T9, Ti; + Th = ci[WS(rs, 3)]; + Tf = T7 * Tb; + T9 = T7 * T8; + Ti = cr[WS(rs, 2)]; + Tk = ci[WS(rs, 2)]; + Tg = FNMS(Ta, T8, Tf); + Tc = FMA(Ta, Tb, T9); + Tu = Th + Ti; + Tj = Th - Ti; + Tl = cr[WS(rs, 3)]; + } + T1 = cr[0]; + T2 = ci[WS(rs, 1)]; + T4 = cr[WS(rs, 1)]; + Tm = Tk - Tl; + Tq = Tk + Tl; + T5 = ci[0]; + T3 = T1 + T2; + Tp = T1 - T2; + } + Tt = T4 - T5; + T6 = T4 + T5; + Tx = Tp + Tq; + Tr = Tp - Tq; + Tz = Tu - Tt; + Tv = Tt + Tu; + Td = T3 - T6; + } + { + E Ts, Tw, TA, Ty; + cr[0] = T3 + T6; + Ts = T7 * Tr; + ci[0] = Tj + Tm; + Tw = T7 * Tv; + TA = T8 * Tz; + cr[WS(rs, 1)] = FNMS(Ta, Tv, Ts); + Ty = T8 * Tx; + ci[WS(rs, 1)] = FMA(Ta, Tr, Tw); + ci[WS(rs, 3)] = FMA(Tb, Tx, TA); + Te = Tc * Td; + cr[WS(rs, 3)] = FNMS(Tb, Tz, Ty); + To = Tg * Td; + Tn = Tj - Tm; + } + } + } + ci[WS(rs, 2)] = FMA(Tc, Tn, To); + cr[WS(rs, 2)] = FNMS(Tg, Tn, Te); + } + } +} + +static const tw_instr twinstr[] = { + {TW_CEXP, 1, 1}, + {TW_CEXP, 1, 3}, + {TW_NEXT, 1, 0} +}; + +static const hc2hc_desc desc = { 4, "hb2_4", twinstr, &GENUS, {16, 8, 8, 0} }; + +void X(codelet_hb2_4) (planner *p) { + X(khc2hc_register) (p, hb2_4, &desc); +} +#else /* HAVE_FMA */ + +/* Generated by: ../../../genfft/gen_hc2hc.native -compact -variables 4 -pipeline-latency 4 -sign 1 -twiddle-log3 -precompute-twiddles -n 4 -dif -name hb2_4 -include hb.h */ + +/* + * This function contains 24 FP additions, 16 FP multiplications, + * (or, 16 additions, 8 multiplications, 8 fused multiply/add), + * 21 stack variables, 0 constants, and 16 memory accesses + */ +#include "hb.h" + +static void hb2_4(R *cr, R *ci, const R *W, stride rs, INT mb, INT me, INT ms) +{ + { + INT m; + for (m = mb, W = W + ((mb - 1) * 4); m < me; m = m + 1, cr = cr + ms, ci = ci - ms, W = W + 4, MAKE_VOLATILE_STRIDE(8, rs)) { + E T7, T9, T8, Ta, Tb, Td; + T7 = W[0]; + T9 = W[1]; + T8 = W[2]; + Ta = W[3]; + Tb = FMA(T7, T8, T9 * Ta); + Td = FNMS(T9, T8, T7 * Ta); + { + E T3, Tl, T6, To, Tg, Tp, Tj, Tm, Tc, Tk; + { + E T1, T2, T4, T5; + T1 = cr[0]; + T2 = ci[WS(rs, 1)]; + T3 = T1 + T2; + Tl = T1 - T2; + T4 = cr[WS(rs, 1)]; + T5 = ci[0]; + T6 = T4 + T5; + To = T4 - T5; + } + { + E Te, Tf, Th, Ti; + Te = ci[WS(rs, 3)]; + Tf = cr[WS(rs, 2)]; + Tg = Te - Tf; + Tp = Te + Tf; + Th = ci[WS(rs, 2)]; + Ti = cr[WS(rs, 3)]; + Tj = Th - Ti; + Tm = Th + Ti; + } + cr[0] = T3 + T6; + ci[0] = Tg + Tj; + Tc = T3 - T6; + Tk = Tg - Tj; + cr[WS(rs, 2)] = FNMS(Td, Tk, Tb * Tc); + ci[WS(rs, 2)] = FMA(Td, Tc, Tb * Tk); + { + E Tn, Tq, Tr, Ts; + Tn = Tl - Tm; + Tq = To + Tp; + cr[WS(rs, 1)] = FNMS(T9, Tq, T7 * Tn); + ci[WS(rs, 1)] = FMA(T7, Tq, T9 * Tn); + Tr = Tl + Tm; + Ts = Tp - To; + cr[WS(rs, 3)] = FNMS(Ta, Ts, T8 * Tr); + ci[WS(rs, 3)] = FMA(T8, Ts, Ta * Tr); + } + } + } + } +} + +static const tw_instr twinstr[] = { + {TW_CEXP, 1, 1}, + {TW_CEXP, 1, 3}, + {TW_NEXT, 1, 0} +}; + +static const hc2hc_desc desc = { 4, "hb2_4", twinstr, &GENUS, {16, 8, 8, 0} }; + +void X(codelet_hb2_4) (planner *p) { + X(khc2hc_register) (p, hb2_4, &desc); +} +#endif /* HAVE_FMA */