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:52:05 EDT 2016 */
Chris@42: 
Chris@42: #include "codelet-rdft.h"
Chris@42: 
Chris@42: #ifdef HAVE_FMA
Chris@42: 
Chris@42: /* Generated by: ../../../genfft/gen_hc2cdft.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -sign 1 -n 4 -dif -name hc2cbdft2_4 -include hc2cb.h */
Chris@42: 
Chris@42: /*
Chris@42:  * This function contains 30 FP additions, 12 FP multiplications,
Chris@42:  * (or, 24 additions, 6 multiplications, 6 fused multiply/add),
Chris@42:  * 35 stack variables, 0 constants, and 16 memory accesses
Chris@42:  */
Chris@42: #include "hc2cb.h"
Chris@42: 
Chris@42: static void hc2cbdft2_4(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@42: {
Chris@42:      {
Chris@42: 	  INT m;
Chris@42: 	  for (m = mb, W = W + ((mb - 1) * 6); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 6, MAKE_VOLATILE_STRIDE(16, rs)) {
Chris@42: 	       E Ty, TB, Tw, TE, TA, TF, Tz, TG, TC;
Chris@42: 	       {
Chris@42: 		    E T4, Tg, T3, Tm, Tc, T5, Th, Ti;
Chris@42: 		    {
Chris@42: 			 E T1, T2, Ta, Tb;
Chris@42: 			 T1 = Rp[0];
Chris@42: 			 T2 = Rm[WS(rs, 1)];
Chris@42: 			 Ta = Ip[0];
Chris@42: 			 Tb = Im[WS(rs, 1)];
Chris@42: 			 T4 = Rp[WS(rs, 1)];
Chris@42: 			 Tg = T1 - T2;
Chris@42: 			 T3 = T1 + T2;
Chris@42: 			 Tm = Ta - Tb;
Chris@42: 			 Tc = Ta + Tb;
Chris@42: 			 T5 = Rm[0];
Chris@42: 			 Th = Ip[WS(rs, 1)];
Chris@42: 			 Ti = Im[0];
Chris@42: 		    }
Chris@42: 		    {
Chris@42: 			 E T8, Td, T7, Ts, To, Tv, Tk, Te, Tf;
Chris@42: 			 T8 = W[0];
Chris@42: 			 {
Chris@42: 			      E T9, T6, Tn, Tj;
Chris@42: 			      T9 = T4 - T5;
Chris@42: 			      T6 = T4 + T5;
Chris@42: 			      Tn = Th - Ti;
Chris@42: 			      Tj = Th + Ti;
Chris@42: 			      Ty = Tc - T9;
Chris@42: 			      Td = T9 + Tc;
Chris@42: 			      T7 = T3 + T6;
Chris@42: 			      Ts = T3 - T6;
Chris@42: 			      To = Tm + Tn;
Chris@42: 			      Tv = Tm - Tn;
Chris@42: 			      TB = Tg + Tj;
Chris@42: 			      Tk = Tg - Tj;
Chris@42: 			      Te = T8 * Td;
Chris@42: 			 }
Chris@42: 			 Tf = W[1];
Chris@42: 			 {
Chris@42: 			      E Tr, Tu, Tt, TD, Tx, Tp, Tl, Tq;
Chris@42: 			      Tr = W[2];
Chris@42: 			      Tp = T8 * Tk;
Chris@42: 			      Tu = W[3];
Chris@42: 			      Tl = FMA(Tf, Tk, Te);
Chris@42: 			      Tt = Tr * Ts;
Chris@42: 			      Tq = FNMS(Tf, Td, Tp);
Chris@42: 			      TD = Tu * Ts;
Chris@42: 			      Rm[0] = T7 + Tl;
Chris@42: 			      Rp[0] = T7 - Tl;
Chris@42: 			      Im[0] = Tq - To;
Chris@42: 			      Ip[0] = To + Tq;
Chris@42: 			      Tx = W[4];
Chris@42: 			      Tw = FNMS(Tu, Tv, Tt);
Chris@42: 			      TE = FMA(Tr, Tv, TD);
Chris@42: 			      TA = W[5];
Chris@42: 			      TF = Tx * TB;
Chris@42: 			      Tz = Tx * Ty;
Chris@42: 			 }
Chris@42: 		    }
Chris@42: 	       }
Chris@42: 	       TG = FNMS(TA, Ty, TF);
Chris@42: 	       TC = FMA(TA, TB, Tz);
Chris@42: 	       Im[WS(rs, 1)] = TG - TE;
Chris@42: 	       Ip[WS(rs, 1)] = TE + TG;
Chris@42: 	       Rm[WS(rs, 1)] = Tw + TC;
Chris@42: 	       Rp[WS(rs, 1)] = Tw - TC;
Chris@42: 	  }
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: static const tw_instr twinstr[] = {
Chris@42:      {TW_FULL, 1, 4},
Chris@42:      {TW_NEXT, 1, 0}
Chris@42: };
Chris@42: 
Chris@42: static const hc2c_desc desc = { 4, "hc2cbdft2_4", twinstr, &GENUS, {24, 6, 6, 0} };
Chris@42: 
Chris@42: void X(codelet_hc2cbdft2_4) (planner *p) {
Chris@42:      X(khc2c_register) (p, hc2cbdft2_4, &desc, HC2C_VIA_DFT);
Chris@42: }
Chris@42: #else				/* HAVE_FMA */
Chris@42: 
Chris@42: /* Generated by: ../../../genfft/gen_hc2cdft.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 4 -dif -name hc2cbdft2_4 -include hc2cb.h */
Chris@42: 
Chris@42: /*
Chris@42:  * This function contains 30 FP additions, 12 FP multiplications,
Chris@42:  * (or, 24 additions, 6 multiplications, 6 fused multiply/add),
Chris@42:  * 19 stack variables, 0 constants, and 16 memory accesses
Chris@42:  */
Chris@42: #include "hc2cb.h"
Chris@42: 
Chris@42: static void hc2cbdft2_4(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@42: {
Chris@42:      {
Chris@42: 	  INT m;
Chris@42: 	  for (m = mb, W = W + ((mb - 1) * 6); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 6, MAKE_VOLATILE_STRIDE(16, rs)) {
Chris@42: 	       E T3, Tl, T6, Tm, Td, Tj, Tx, Tv, Ts, Tq;
Chris@42: 	       {
Chris@42: 		    E Tf, Tc, T9, Ti;
Chris@42: 		    {
Chris@42: 			 E T1, T2, Ta, Tb;
Chris@42: 			 T1 = Rp[0];
Chris@42: 			 T2 = Rm[WS(rs, 1)];
Chris@42: 			 T3 = T1 + T2;
Chris@42: 			 Tf = T1 - T2;
Chris@42: 			 Ta = Ip[0];
Chris@42: 			 Tb = Im[WS(rs, 1)];
Chris@42: 			 Tc = Ta + Tb;
Chris@42: 			 Tl = Ta - Tb;
Chris@42: 		    }
Chris@42: 		    {
Chris@42: 			 E T4, T5, Tg, Th;
Chris@42: 			 T4 = Rp[WS(rs, 1)];
Chris@42: 			 T5 = Rm[0];
Chris@42: 			 T6 = T4 + T5;
Chris@42: 			 T9 = T4 - T5;
Chris@42: 			 Tg = Ip[WS(rs, 1)];
Chris@42: 			 Th = Im[0];
Chris@42: 			 Ti = Tg + Th;
Chris@42: 			 Tm = Tg - Th;
Chris@42: 		    }
Chris@42: 		    Td = T9 + Tc;
Chris@42: 		    Tj = Tf - Ti;
Chris@42: 		    Tx = Tf + Ti;
Chris@42: 		    Tv = Tc - T9;
Chris@42: 		    Ts = Tl - Tm;
Chris@42: 		    Tq = T3 - T6;
Chris@42: 	       }
Chris@42: 	       {
Chris@42: 		    E T7, Tn, Tk, To, T8, Te;
Chris@42: 		    T7 = T3 + T6;
Chris@42: 		    Tn = Tl + Tm;
Chris@42: 		    T8 = W[0];
Chris@42: 		    Te = W[1];
Chris@42: 		    Tk = FMA(T8, Td, Te * Tj);
Chris@42: 		    To = FNMS(Te, Td, T8 * Tj);
Chris@42: 		    Rp[0] = T7 - Tk;
Chris@42: 		    Ip[0] = Tn + To;
Chris@42: 		    Rm[0] = T7 + Tk;
Chris@42: 		    Im[0] = To - Tn;
Chris@42: 	       }
Chris@42: 	       {
Chris@42: 		    E Tt, Tz, Ty, TA;
Chris@42: 		    {
Chris@42: 			 E Tp, Tr, Tu, Tw;
Chris@42: 			 Tp = W[2];
Chris@42: 			 Tr = W[3];
Chris@42: 			 Tt = FNMS(Tr, Ts, Tp * Tq);
Chris@42: 			 Tz = FMA(Tr, Tq, Tp * Ts);
Chris@42: 			 Tu = W[4];
Chris@42: 			 Tw = W[5];
Chris@42: 			 Ty = FMA(Tu, Tv, Tw * Tx);
Chris@42: 			 TA = FNMS(Tw, Tv, Tu * Tx);
Chris@42: 		    }
Chris@42: 		    Rp[WS(rs, 1)] = Tt - Ty;
Chris@42: 		    Ip[WS(rs, 1)] = Tz + TA;
Chris@42: 		    Rm[WS(rs, 1)] = Tt + Ty;
Chris@42: 		    Im[WS(rs, 1)] = TA - Tz;
Chris@42: 	       }
Chris@42: 	  }
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: static const tw_instr twinstr[] = {
Chris@42:      {TW_FULL, 1, 4},
Chris@42:      {TW_NEXT, 1, 0}
Chris@42: };
Chris@42: 
Chris@42: static const hc2c_desc desc = { 4, "hc2cbdft2_4", twinstr, &GENUS, {24, 6, 6, 0} };
Chris@42: 
Chris@42: void X(codelet_hc2cbdft2_4) (planner *p) {
Chris@42:      X(khc2c_register) (p, hc2cbdft2_4, &desc, HC2C_VIA_DFT);
Chris@42: }
Chris@42: #endif				/* HAVE_FMA */