Chris@19: /*
Chris@19:  * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@19:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@19:  *
Chris@19:  * This program is free software; you can redistribute it and/or modify
Chris@19:  * it under the terms of the GNU General Public License as published by
Chris@19:  * the Free Software Foundation; either version 2 of the License, or
Chris@19:  * (at your option) any later version.
Chris@19:  *
Chris@19:  * This program is distributed in the hope that it will be useful,
Chris@19:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@19:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@19:  * GNU General Public License for more details.
Chris@19:  *
Chris@19:  * You should have received a copy of the GNU General Public License
Chris@19:  * along with this program; if not, write to the Free Software
Chris@19:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@19:  *
Chris@19:  */
Chris@19: 
Chris@19: /* This file was automatically generated --- DO NOT EDIT */
Chris@19: /* Generated on Tue Mar  4 13:45:48 EST 2014 */
Chris@19: 
Chris@19: #include "codelet-dft.h"
Chris@19: 
Chris@19: #ifdef HAVE_FMA
Chris@19: 
Chris@19: /* Generated by: ../../../genfft/gen_notw.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -n 4 -name n1_4 -include n.h */
Chris@19: 
Chris@19: /*
Chris@19:  * This function contains 16 FP additions, 0 FP multiplications,
Chris@19:  * (or, 16 additions, 0 multiplications, 0 fused multiply/add),
Chris@19:  * 13 stack variables, 0 constants, and 16 memory accesses
Chris@19:  */
Chris@19: #include "n.h"
Chris@19: 
Chris@19: static void n1_4(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@19: {
Chris@19:      {
Chris@19: 	  INT i;
Chris@19: 	  for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(16, is), MAKE_VOLATILE_STRIDE(16, os)) {
Chris@19: 	       E T4, Tb, T3, Tf, T9, T5, Tc, Td;
Chris@19: 	       {
Chris@19: 		    E T1, T2, T7, T8;
Chris@19: 		    T1 = ri[0];
Chris@19: 		    T2 = ri[WS(is, 2)];
Chris@19: 		    T7 = ii[0];
Chris@19: 		    T8 = ii[WS(is, 2)];
Chris@19: 		    T4 = ri[WS(is, 1)];
Chris@19: 		    Tb = T1 - T2;
Chris@19: 		    T3 = T1 + T2;
Chris@19: 		    Tf = T7 + T8;
Chris@19: 		    T9 = T7 - T8;
Chris@19: 		    T5 = ri[WS(is, 3)];
Chris@19: 		    Tc = ii[WS(is, 1)];
Chris@19: 		    Td = ii[WS(is, 3)];
Chris@19: 	       }
Chris@19: 	       {
Chris@19: 		    E T6, Ta, Te, Tg;
Chris@19: 		    T6 = T4 + T5;
Chris@19: 		    Ta = T4 - T5;
Chris@19: 		    Te = Tc - Td;
Chris@19: 		    Tg = Tc + Td;
Chris@19: 		    io[WS(os, 3)] = Ta + T9;
Chris@19: 		    io[WS(os, 1)] = T9 - Ta;
Chris@19: 		    ro[0] = T3 + T6;
Chris@19: 		    ro[WS(os, 2)] = T3 - T6;
Chris@19: 		    io[0] = Tf + Tg;
Chris@19: 		    io[WS(os, 2)] = Tf - Tg;
Chris@19: 		    ro[WS(os, 3)] = Tb - Te;
Chris@19: 		    ro[WS(os, 1)] = Tb + Te;
Chris@19: 	       }
Chris@19: 	  }
Chris@19:      }
Chris@19: }
Chris@19: 
Chris@19: static const kdft_desc desc = { 4, "n1_4", {16, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
Chris@19: 
Chris@19: void X(codelet_n1_4) (planner *p) {
Chris@19:      X(kdft_register) (p, n1_4, &desc);
Chris@19: }
Chris@19: 
Chris@19: #else				/* HAVE_FMA */
Chris@19: 
Chris@19: /* Generated by: ../../../genfft/gen_notw.native -compact -variables 4 -pipeline-latency 4 -n 4 -name n1_4 -include n.h */
Chris@19: 
Chris@19: /*
Chris@19:  * This function contains 16 FP additions, 0 FP multiplications,
Chris@19:  * (or, 16 additions, 0 multiplications, 0 fused multiply/add),
Chris@19:  * 13 stack variables, 0 constants, and 16 memory accesses
Chris@19:  */
Chris@19: #include "n.h"
Chris@19: 
Chris@19: static void n1_4(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@19: {
Chris@19:      {
Chris@19: 	  INT i;
Chris@19: 	  for (i = v; i > 0; i = i - 1, ri = ri + ivs, ii = ii + ivs, ro = ro + ovs, io = io + ovs, MAKE_VOLATILE_STRIDE(16, is), MAKE_VOLATILE_STRIDE(16, os)) {
Chris@19: 	       E T3, Tb, T9, Tf, T6, Ta, Te, Tg;
Chris@19: 	       {
Chris@19: 		    E T1, T2, T7, T8;
Chris@19: 		    T1 = ri[0];
Chris@19: 		    T2 = ri[WS(is, 2)];
Chris@19: 		    T3 = T1 + T2;
Chris@19: 		    Tb = T1 - T2;
Chris@19: 		    T7 = ii[0];
Chris@19: 		    T8 = ii[WS(is, 2)];
Chris@19: 		    T9 = T7 - T8;
Chris@19: 		    Tf = T7 + T8;
Chris@19: 	       }
Chris@19: 	       {
Chris@19: 		    E T4, T5, Tc, Td;
Chris@19: 		    T4 = ri[WS(is, 1)];
Chris@19: 		    T5 = ri[WS(is, 3)];
Chris@19: 		    T6 = T4 + T5;
Chris@19: 		    Ta = T4 - T5;
Chris@19: 		    Tc = ii[WS(is, 1)];
Chris@19: 		    Td = ii[WS(is, 3)];
Chris@19: 		    Te = Tc - Td;
Chris@19: 		    Tg = Tc + Td;
Chris@19: 	       }
Chris@19: 	       ro[WS(os, 2)] = T3 - T6;
Chris@19: 	       io[WS(os, 2)] = Tf - Tg;
Chris@19: 	       ro[0] = T3 + T6;
Chris@19: 	       io[0] = Tf + Tg;
Chris@19: 	       io[WS(os, 1)] = T9 - Ta;
Chris@19: 	       ro[WS(os, 1)] = Tb + Te;
Chris@19: 	       io[WS(os, 3)] = Ta + T9;
Chris@19: 	       ro[WS(os, 3)] = Tb - Te;
Chris@19: 	  }
Chris@19:      }
Chris@19: }
Chris@19: 
Chris@19: static const kdft_desc desc = { 4, "n1_4", {16, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
Chris@19: 
Chris@19: void X(codelet_n1_4) (planner *p) {
Chris@19:      X(kdft_register) (p, n1_4, &desc);
Chris@19: }
Chris@19: 
Chris@19: #endif				/* HAVE_FMA */