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:05 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 4 -name t1_4 -include t.h */
Chris@42: 
Chris@42: /*
Chris@42:  * This function contains 22 FP additions, 12 FP multiplications,
Chris@42:  * (or, 16 additions, 6 multiplications, 6 fused multiply/add),
Chris@42:  * 31 stack variables, 0 constants, and 16 memory accesses
Chris@42:  */
Chris@42: #include "t.h"
Chris@42: 
Chris@42: static void t1_4(R *ri, R *ii, 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 * 6); m < me; m = m + 1, ri = ri + ms, ii = ii + ms, W = W + 6, MAKE_VOLATILE_STRIDE(8, rs)) {
Chris@42: 	       E To, Te, Tm, T8, Tw, Tx, Tq, Tk;
Chris@42: 	       {
Chris@42: 		    E T1, Tv, Tu, T7, Tg, Tj, Tf, Ti, Tp, Th;
Chris@42: 		    T1 = ri[0];
Chris@42: 		    Tv = ii[0];
Chris@42: 		    {
Chris@42: 			 E T3, T6, T2, T5;
Chris@42: 			 T3 = ri[WS(rs, 2)];
Chris@42: 			 T6 = ii[WS(rs, 2)];
Chris@42: 			 T2 = W[2];
Chris@42: 			 T5 = W[3];
Chris@42: 			 {
Chris@42: 			      E Ta, Td, Tc, Tn, Tb, Tt, T4, T9;
Chris@42: 			      Ta = ri[WS(rs, 1)];
Chris@42: 			      Td = ii[WS(rs, 1)];
Chris@42: 			      Tt = T2 * T6;
Chris@42: 			      T4 = T2 * T3;
Chris@42: 			      T9 = W[0];
Chris@42: 			      Tc = W[1];
Chris@42: 			      Tu = FNMS(T5, T3, Tt);
Chris@42: 			      T7 = FMA(T5, T6, T4);
Chris@42: 			      Tn = T9 * Td;
Chris@42: 			      Tb = T9 * Ta;
Chris@42: 			      Tg = ri[WS(rs, 3)];
Chris@42: 			      Tj = ii[WS(rs, 3)];
Chris@42: 			      To = FNMS(Tc, Ta, Tn);
Chris@42: 			      Te = FMA(Tc, Td, Tb);
Chris@42: 			      Tf = W[4];
Chris@42: 			      Ti = W[5];
Chris@42: 			 }
Chris@42: 		    }
Chris@42: 		    Tm = T1 - T7;
Chris@42: 		    T8 = T1 + T7;
Chris@42: 		    Tw = Tu + Tv;
Chris@42: 		    Tx = Tv - Tu;
Chris@42: 		    Tp = Tf * Tj;
Chris@42: 		    Th = Tf * Tg;
Chris@42: 		    Tq = FNMS(Ti, Tg, Tp);
Chris@42: 		    Tk = FMA(Ti, Tj, Th);
Chris@42: 	       }
Chris@42: 	       {
Chris@42: 		    E Ts, Tr, Tl, Ty;
Chris@42: 		    Ts = To + Tq;
Chris@42: 		    Tr = To - Tq;
Chris@42: 		    Tl = Te + Tk;
Chris@42: 		    Ty = Te - Tk;
Chris@42: 		    ri[WS(rs, 1)] = Tm + Tr;
Chris@42: 		    ri[WS(rs, 3)] = Tm - Tr;
Chris@42: 		    ii[WS(rs, 2)] = Tw - Ts;
Chris@42: 		    ii[0] = Ts + Tw;
Chris@42: 		    ii[WS(rs, 3)] = Ty + Tx;
Chris@42: 		    ii[WS(rs, 1)] = Tx - Ty;
Chris@42: 		    ri[0] = T8 + Tl;
Chris@42: 		    ri[WS(rs, 2)] = T8 - Tl;
Chris@42: 	       }
Chris@42: 	  }
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: static const tw_instr twinstr[] = {
Chris@42:      {TW_FULL, 0, 4},
Chris@42:      {TW_NEXT, 1, 0}
Chris@42: };
Chris@42: 
Chris@42: static const ct_desc desc = { 4, "t1_4", twinstr, &GENUS, {16, 6, 6, 0}, 0, 0, 0 };
Chris@42: 
Chris@42: void X(codelet_t1_4) (planner *p) {
Chris@42:      X(kdft_dit_register) (p, t1_4, &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 4 -name t1_4 -include t.h */
Chris@42: 
Chris@42: /*
Chris@42:  * This function contains 22 FP additions, 12 FP multiplications,
Chris@42:  * (or, 16 additions, 6 multiplications, 6 fused multiply/add),
Chris@42:  * 13 stack variables, 0 constants, and 16 memory accesses
Chris@42:  */
Chris@42: #include "t.h"
Chris@42: 
Chris@42: static void t1_4(R *ri, R *ii, 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 * 6); m < me; m = m + 1, ri = ri + ms, ii = ii + ms, W = W + 6, MAKE_VOLATILE_STRIDE(8, rs)) {
Chris@42: 	       E T1, Tp, T6, To, Tc, Tk, Th, Tl;
Chris@42: 	       T1 = ri[0];
Chris@42: 	       Tp = ii[0];
Chris@42: 	       {
Chris@42: 		    E T3, T5, T2, T4;
Chris@42: 		    T3 = ri[WS(rs, 2)];
Chris@42: 		    T5 = ii[WS(rs, 2)];
Chris@42: 		    T2 = W[2];
Chris@42: 		    T4 = W[3];
Chris@42: 		    T6 = FMA(T2, T3, T4 * T5);
Chris@42: 		    To = FNMS(T4, T3, T2 * T5);
Chris@42: 	       }
Chris@42: 	       {
Chris@42: 		    E T9, Tb, T8, Ta;
Chris@42: 		    T9 = ri[WS(rs, 1)];
Chris@42: 		    Tb = ii[WS(rs, 1)];
Chris@42: 		    T8 = W[0];
Chris@42: 		    Ta = W[1];
Chris@42: 		    Tc = FMA(T8, T9, Ta * Tb);
Chris@42: 		    Tk = FNMS(Ta, T9, T8 * Tb);
Chris@42: 	       }
Chris@42: 	       {
Chris@42: 		    E Te, Tg, Td, Tf;
Chris@42: 		    Te = ri[WS(rs, 3)];
Chris@42: 		    Tg = ii[WS(rs, 3)];
Chris@42: 		    Td = W[4];
Chris@42: 		    Tf = W[5];
Chris@42: 		    Th = FMA(Td, Te, Tf * Tg);
Chris@42: 		    Tl = FNMS(Tf, Te, Td * Tg);
Chris@42: 	       }
Chris@42: 	       {
Chris@42: 		    E T7, Ti, Tn, Tq;
Chris@42: 		    T7 = T1 + T6;
Chris@42: 		    Ti = Tc + Th;
Chris@42: 		    ri[WS(rs, 2)] = T7 - Ti;
Chris@42: 		    ri[0] = T7 + Ti;
Chris@42: 		    Tn = Tk + Tl;
Chris@42: 		    Tq = To + Tp;
Chris@42: 		    ii[0] = Tn + Tq;
Chris@42: 		    ii[WS(rs, 2)] = Tq - Tn;
Chris@42: 	       }
Chris@42: 	       {
Chris@42: 		    E Tj, Tm, Tr, Ts;
Chris@42: 		    Tj = T1 - T6;
Chris@42: 		    Tm = Tk - Tl;
Chris@42: 		    ri[WS(rs, 3)] = Tj - Tm;
Chris@42: 		    ri[WS(rs, 1)] = Tj + Tm;
Chris@42: 		    Tr = Tp - To;
Chris@42: 		    Ts = Tc - Th;
Chris@42: 		    ii[WS(rs, 1)] = Tr - Ts;
Chris@42: 		    ii[WS(rs, 3)] = Ts + Tr;
Chris@42: 	       }
Chris@42: 	  }
Chris@42:      }
Chris@42: }
Chris@42: 
Chris@42: static const tw_instr twinstr[] = {
Chris@42:      {TW_FULL, 0, 4},
Chris@42:      {TW_NEXT, 1, 0}
Chris@42: };
Chris@42: 
Chris@42: static const ct_desc desc = { 4, "t1_4", twinstr, &GENUS, {16, 6, 6, 0}, 0, 0, 0 };
Chris@42: 
Chris@42: void X(codelet_t1_4) (planner *p) {
Chris@42:      X(kdft_dit_register) (p, t1_4, &desc);
Chris@42: }
Chris@42: #endif				/* HAVE_FMA */