Chris@42: /*
Chris@42:  * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@42:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@42:  *
Chris@42:  * This program is free software; you can redistribute it and/or modify
Chris@42:  * it under the terms of the GNU General Public License as published by
Chris@42:  * the Free Software Foundation; either version 2 of the License, or
Chris@42:  * (at your option) any later version.
Chris@42:  *
Chris@42:  * This program is distributed in the hope that it will be useful,
Chris@42:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@42:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@42:  * GNU General Public License for more details.
Chris@42:  *
Chris@42:  * You should have received a copy of the GNU General Public License
Chris@42:  * along with this program; if not, write to the Free Software
Chris@42:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@42:  *
Chris@42:  */
Chris@42: 
Chris@42: /* This file was automatically generated --- DO NOT EDIT */
Chris@42: /* Generated on Sat Jul 30 16:36:06 EDT 2016 */
Chris@42: 
Chris@42: #include "codelet-dft.h"
Chris@42: 
Chris@42: #ifdef HAVE_FMA
Chris@42: 
Chris@42: /* Generated by: ../../../genfft/gen_twiddle.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 5 -name t1_5 -include t.h */
Chris@42: 
Chris@42: /*
Chris@42:  * This function contains 40 FP additions, 34 FP multiplications,
Chris@42:  * (or, 14 additions, 8 multiplications, 26 fused multiply/add),
Chris@42:  * 43 stack variables, 4 constants, and 20 memory accesses
Chris@42:  */
Chris@42: #include "t.h"
Chris@42: 
Chris@42: static void t1_5(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@42: {
Chris@42:      DK(KP951056516, +0.951056516295153572116439333379382143405698634);
Chris@42:      DK(KP559016994, +0.559016994374947424102293417182819058860154590);
Chris@42:      DK(KP250000000, +0.250000000000000000000000000000000000000000000);
Chris@42:      DK(KP618033988, +0.618033988749894848204586834365638117720309180);
Chris@42:      {
Chris@42: 	  INT m;
Chris@42: 	  for (m = mb, W = W + (mb * 8); m < me; m = m + 1, ri = ri + ms, ii = ii + ms, W = W + 8, MAKE_VOLATILE_STRIDE(10, rs)) {
Chris@42: 	       E T1, TM, TJ, TA, TQ, Te, TC, Tk, TE, Tq;
Chris@42: 	       {
Chris@42: 		    E Tg, Tj, Tm, TB, Th, Tp, Tl, Ti, To, TD, Tn;
Chris@42: 		    T1 = ri[0];
Chris@42: 		    TM = ii[0];
Chris@42: 		    {
Chris@42: 			 E T9, Tc, Ty, Ta, Tb, Tx, T7, Tf, Tz, Td;
Chris@42: 			 {
Chris@42: 			      E T3, T6, T8, Tw, T4, T2, T5;
Chris@42: 			      T3 = ri[WS(rs, 1)];
Chris@42: 			      T6 = ii[WS(rs, 1)];
Chris@42: 			      T2 = W[0];
Chris@42: 			      T9 = ri[WS(rs, 4)];
Chris@42: 			      Tc = ii[WS(rs, 4)];
Chris@42: 			      T8 = W[6];
Chris@42: 			      Tw = T2 * T6;
Chris@42: 			      T4 = T2 * T3;
Chris@42: 			      T5 = W[1];
Chris@42: 			      Ty = T8 * Tc;
Chris@42: 			      Ta = T8 * T9;
Chris@42: 			      Tb = W[7];
Chris@42: 			      Tx = FNMS(T5, T3, Tw);
Chris@42: 			      T7 = FMA(T5, T6, T4);
Chris@42: 			 }
Chris@42: 			 Tg = ri[WS(rs, 2)];
Chris@42: 			 Tz = FNMS(Tb, T9, Ty);
Chris@42: 			 Td = FMA(Tb, Tc, Ta);
Chris@42: 			 Tj = ii[WS(rs, 2)];
Chris@42: 			 Tf = W[2];
Chris@42: 			 TJ = Tx + Tz;
Chris@42: 			 TA = Tx - Tz;
Chris@42: 			 TQ = T7 - Td;
Chris@42: 			 Te = T7 + Td;
Chris@42: 			 Tm = ri[WS(rs, 3)];
Chris@42: 			 TB = Tf * Tj;
Chris@42: 			 Th = Tf * Tg;
Chris@42: 			 Tp = ii[WS(rs, 3)];
Chris@42: 			 Tl = W[4];
Chris@42: 			 Ti = W[3];
Chris@42: 			 To = W[5];
Chris@42: 		    }
Chris@42: 		    TD = Tl * Tp;
Chris@42: 		    Tn = Tl * Tm;
Chris@42: 		    TC = FNMS(Ti, Tg, TB);
Chris@42: 		    Tk = FMA(Ti, Tj, Th);
Chris@42: 		    TE = FNMS(To, Tm, TD);
Chris@42: 		    Tq = FMA(To, Tp, Tn);
Chris@42: 	       }
Chris@42: 	       {
Chris@42: 		    E TG, TI, TO, TS, TU, Tu, TN, Tt, TK, TF;
Chris@42: 		    TK = TC + TE;
Chris@42: 		    TF = TC - TE;
Chris@42: 		    {
Chris@42: 			 E Tr, TR, TL, Ts;
Chris@42: 			 Tr = Tk + Tq;
Chris@42: 			 TR = Tk - Tq;
Chris@42: 			 TG = FMA(KP618033988, TF, TA);
Chris@42: 			 TI = FNMS(KP618033988, TA, TF);
Chris@42: 			 TO = TJ - TK;
Chris@42: 			 TL = TJ + TK;
Chris@42: 			 TS = FMA(KP618033988, TR, TQ);
Chris@42: 			 TU = FNMS(KP618033988, TQ, TR);
Chris@42: 			 Tu = Te - Tr;
Chris@42: 			 Ts = Te + Tr;
Chris@42: 			 ii[0] = TL + TM;
Chris@42: 			 TN = FNMS(KP250000000, TL, TM);
Chris@42: 			 ri[0] = T1 + Ts;
Chris@42: 			 Tt = FNMS(KP250000000, Ts, T1);
Chris@42: 		    }
Chris@42: 		    {
Chris@42: 			 E TT, TP, TH, Tv;
Chris@42: 			 TT = FNMS(KP559016994, TO, TN);
Chris@42: 			 TP = FMA(KP559016994, TO, TN);
Chris@42: 			 TH = FNMS(KP559016994, Tu, Tt);
Chris@42: 			 Tv = FMA(KP559016994, Tu, Tt);
Chris@42: 			 ii[WS(rs, 4)] = FMA(KP951056516, TS, TP);
Chris@42: 			 ii[WS(rs, 1)] = FNMS(KP951056516, TS, TP);
Chris@42: 			 ii[WS(rs, 3)] = FNMS(KP951056516, TU, TT);
Chris@42: 			 ii[WS(rs, 2)] = FMA(KP951056516, TU, TT);
Chris@42: 			 ri[WS(rs, 1)] = FMA(KP951056516, TG, Tv);
Chris@42: 			 ri[WS(rs, 4)] = FNMS(KP951056516, TG, Tv);
Chris@42: 			 ri[WS(rs, 3)] = FMA(KP951056516, TI, TH);
Chris@42: 			 ri[WS(rs, 2)] = FNMS(KP951056516, TI, TH);
Chris@42: 		    }
Chris@42: 	       }
Chris@42: 	  }
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: static const tw_instr twinstr[] = {
Chris@42:      {TW_FULL, 0, 5},
Chris@42:      {TW_NEXT, 1, 0}
Chris@42: };
Chris@42: 
Chris@42: static const ct_desc desc = { 5, "t1_5", twinstr, &GENUS, {14, 8, 26, 0}, 0, 0, 0 };
Chris@42: 
Chris@42: void X(codelet_t1_5) (planner *p) {
Chris@42:      X(kdft_dit_register) (p, t1_5, &desc);
Chris@42: }
Chris@42: #else				/* HAVE_FMA */
Chris@42: 
Chris@42: /* Generated by: ../../../genfft/gen_twiddle.native -compact -variables 4 -pipeline-latency 4 -n 5 -name t1_5 -include t.h */
Chris@42: 
Chris@42: /*
Chris@42:  * This function contains 40 FP additions, 28 FP multiplications,
Chris@42:  * (or, 26 additions, 14 multiplications, 14 fused multiply/add),
Chris@42:  * 29 stack variables, 4 constants, and 20 memory accesses
Chris@42:  */
Chris@42: #include "t.h"
Chris@42: 
Chris@42: static void t1_5(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@42: {
Chris@42:      DK(KP250000000, +0.250000000000000000000000000000000000000000000);
Chris@42:      DK(KP559016994, +0.559016994374947424102293417182819058860154590);
Chris@42:      DK(KP587785252, +0.587785252292473129168705954639072768597652438);
Chris@42:      DK(KP951056516, +0.951056516295153572116439333379382143405698634);
Chris@42:      {
Chris@42: 	  INT m;
Chris@42: 	  for (m = mb, W = W + (mb * 8); m < me; m = m + 1, ri = ri + ms, ii = ii + ms, W = W + 8, MAKE_VOLATILE_STRIDE(10, rs)) {
Chris@42: 	       E T1, TE, Tu, Tx, TJ, TI, TB, TC, TD, Tc, Tn, To;
Chris@42: 	       T1 = ri[0];
Chris@42: 	       TE = ii[0];
Chris@42: 	       {
Chris@42: 		    E T6, Ts, Tm, Tw, Tb, Tt, Th, Tv;
Chris@42: 		    {
Chris@42: 			 E T3, T5, T2, T4;
Chris@42: 			 T3 = ri[WS(rs, 1)];
Chris@42: 			 T5 = ii[WS(rs, 1)];
Chris@42: 			 T2 = W[0];
Chris@42: 			 T4 = W[1];
Chris@42: 			 T6 = FMA(T2, T3, T4 * T5);
Chris@42: 			 Ts = FNMS(T4, T3, T2 * T5);
Chris@42: 		    }
Chris@42: 		    {
Chris@42: 			 E Tj, Tl, Ti, Tk;
Chris@42: 			 Tj = ri[WS(rs, 3)];
Chris@42: 			 Tl = ii[WS(rs, 3)];
Chris@42: 			 Ti = W[4];
Chris@42: 			 Tk = W[5];
Chris@42: 			 Tm = FMA(Ti, Tj, Tk * Tl);
Chris@42: 			 Tw = FNMS(Tk, Tj, Ti * Tl);
Chris@42: 		    }
Chris@42: 		    {
Chris@42: 			 E T8, Ta, T7, T9;
Chris@42: 			 T8 = ri[WS(rs, 4)];
Chris@42: 			 Ta = ii[WS(rs, 4)];
Chris@42: 			 T7 = W[6];
Chris@42: 			 T9 = W[7];
Chris@42: 			 Tb = FMA(T7, T8, T9 * Ta);
Chris@42: 			 Tt = FNMS(T9, T8, T7 * Ta);
Chris@42: 		    }
Chris@42: 		    {
Chris@42: 			 E Te, Tg, Td, Tf;
Chris@42: 			 Te = ri[WS(rs, 2)];
Chris@42: 			 Tg = ii[WS(rs, 2)];
Chris@42: 			 Td = W[2];
Chris@42: 			 Tf = W[3];
Chris@42: 			 Th = FMA(Td, Te, Tf * Tg);
Chris@42: 			 Tv = FNMS(Tf, Te, Td * Tg);
Chris@42: 		    }
Chris@42: 		    Tu = Ts - Tt;
Chris@42: 		    Tx = Tv - Tw;
Chris@42: 		    TJ = Th - Tm;
Chris@42: 		    TI = T6 - Tb;
Chris@42: 		    TB = Ts + Tt;
Chris@42: 		    TC = Tv + Tw;
Chris@42: 		    TD = TB + TC;
Chris@42: 		    Tc = T6 + Tb;
Chris@42: 		    Tn = Th + Tm;
Chris@42: 		    To = Tc + Tn;
Chris@42: 	       }
Chris@42: 	       ri[0] = T1 + To;
Chris@42: 	       ii[0] = TD + TE;
Chris@42: 	       {
Chris@42: 		    E Ty, TA, Tr, Tz, Tp, Tq;
Chris@42: 		    Ty = FMA(KP951056516, Tu, KP587785252 * Tx);
Chris@42: 		    TA = FNMS(KP587785252, Tu, KP951056516 * Tx);
Chris@42: 		    Tp = KP559016994 * (Tc - Tn);
Chris@42: 		    Tq = FNMS(KP250000000, To, T1);
Chris@42: 		    Tr = Tp + Tq;
Chris@42: 		    Tz = Tq - Tp;
Chris@42: 		    ri[WS(rs, 4)] = Tr - Ty;
Chris@42: 		    ri[WS(rs, 3)] = Tz + TA;
Chris@42: 		    ri[WS(rs, 1)] = Tr + Ty;
Chris@42: 		    ri[WS(rs, 2)] = Tz - TA;
Chris@42: 	       }
Chris@42: 	       {
Chris@42: 		    E TK, TL, TH, TM, TF, TG;
Chris@42: 		    TK = FMA(KP951056516, TI, KP587785252 * TJ);
Chris@42: 		    TL = FNMS(KP587785252, TI, KP951056516 * TJ);
Chris@42: 		    TF = KP559016994 * (TB - TC);
Chris@42: 		    TG = FNMS(KP250000000, TD, TE);
Chris@42: 		    TH = TF + TG;
Chris@42: 		    TM = TG - TF;
Chris@42: 		    ii[WS(rs, 1)] = TH - TK;
Chris@42: 		    ii[WS(rs, 3)] = TM - TL;
Chris@42: 		    ii[WS(rs, 4)] = TK + TH;
Chris@42: 		    ii[WS(rs, 2)] = TL + TM;
Chris@42: 	       }
Chris@42: 	  }
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: static const tw_instr twinstr[] = {
Chris@42:      {TW_FULL, 0, 5},
Chris@42:      {TW_NEXT, 1, 0}
Chris@42: };
Chris@42: 
Chris@42: static const ct_desc desc = { 5, "t1_5", twinstr, &GENUS, {26, 14, 14, 0}, 0, 0, 0 };
Chris@42: 
Chris@42: void X(codelet_t1_5) (planner *p) {
Chris@42:      X(kdft_dit_register) (p, t1_5, &desc);
Chris@42: }
Chris@42: #endif				/* HAVE_FMA */