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