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:46:54 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_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 4 -name n2fv_4 -with-ostride 2 -include n2f.h -store-multiple 2 */
Chris@19: 
Chris@19: /*
Chris@19:  * This function contains 8 FP additions, 2 FP multiplications,
Chris@19:  * (or, 6 additions, 0 multiplications, 2 fused multiply/add),
Chris@19:  * 15 stack variables, 0 constants, and 10 memory accesses
Chris@19:  */
Chris@19: #include "n2f.h"
Chris@19: 
Chris@19: static void n2fv_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: 	  const R *xi;
Chris@19: 	  R *xo;
Chris@19: 	  xi = ri;
Chris@19: 	  xo = ro;
Chris@19: 	  for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(8, is), MAKE_VOLATILE_STRIDE(8, os)) {
Chris@19: 	       V T1, T2, T4, T5;
Chris@19: 	       T1 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@19: 	       T2 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@19: 	       T4 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@19: 	       T5 = LD(&(xi[WS(is, 3)]), ivs, &(xi[WS(is, 1)]));
Chris@19: 	       {
Chris@19: 		    V T3, T7, T6, T8;
Chris@19: 		    T3 = VSUB(T1, T2);
Chris@19: 		    T7 = VADD(T1, T2);
Chris@19: 		    T6 = VSUB(T4, T5);
Chris@19: 		    T8 = VADD(T4, T5);
Chris@19: 		    {
Chris@19: 			 V T9, Ta, Tb, Tc;
Chris@19: 			 T9 = VSUB(T7, T8);
Chris@19: 			 STM2(&(xo[4]), T9, ovs, &(xo[0]));
Chris@19: 			 Ta = VADD(T7, T8);
Chris@19: 			 STM2(&(xo[0]), Ta, ovs, &(xo[0]));
Chris@19: 			 Tb = VFMAI(T6, T3);
Chris@19: 			 STM2(&(xo[6]), Tb, ovs, &(xo[2]));
Chris@19: 			 STN2(&(xo[4]), T9, Tb, ovs);
Chris@19: 			 Tc = VFNMSI(T6, T3);
Chris@19: 			 STM2(&(xo[2]), Tc, ovs, &(xo[2]));
Chris@19: 			 STN2(&(xo[0]), Ta, Tc, ovs);
Chris@19: 		    }
Chris@19: 	       }
Chris@19: 	  }
Chris@19:      }
Chris@19:      VLEAVE();
Chris@19: }
Chris@19: 
Chris@19: static const kdft_desc desc = { 4, XSIMD_STRING("n2fv_4"), {6, 0, 2, 0}, &GENUS, 0, 2, 0, 0 };
Chris@19: 
Chris@19: void XSIMD(codelet_n2fv_4) (planner *p) {
Chris@19:      X(kdft_register) (p, n2fv_4, &desc);
Chris@19: }
Chris@19: 
Chris@19: #else				/* HAVE_FMA */
Chris@19: 
Chris@19: /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 4 -name n2fv_4 -with-ostride 2 -include n2f.h -store-multiple 2 */
Chris@19: 
Chris@19: /*
Chris@19:  * This function contains 8 FP additions, 0 FP multiplications,
Chris@19:  * (or, 8 additions, 0 multiplications, 0 fused multiply/add),
Chris@19:  * 11 stack variables, 0 constants, and 10 memory accesses
Chris@19:  */
Chris@19: #include "n2f.h"
Chris@19: 
Chris@19: static void n2fv_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: 	  const R *xi;
Chris@19: 	  R *xo;
Chris@19: 	  xi = ri;
Chris@19: 	  xo = ro;
Chris@19: 	  for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(8, is), MAKE_VOLATILE_STRIDE(8, os)) {
Chris@19: 	       V T3, T7, T6, T8;
Chris@19: 	       {
Chris@19: 		    V T1, T2, T4, T5;
Chris@19: 		    T1 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@19: 		    T2 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@19: 		    T3 = VSUB(T1, T2);
Chris@19: 		    T7 = VADD(T1, T2);
Chris@19: 		    T4 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@19: 		    T5 = LD(&(xi[WS(is, 3)]), ivs, &(xi[WS(is, 1)]));
Chris@19: 		    T6 = VBYI(VSUB(T4, T5));
Chris@19: 		    T8 = VADD(T4, T5);
Chris@19: 	       }
Chris@19: 	       {
Chris@19: 		    V T9, Ta, Tb, Tc;
Chris@19: 		    T9 = VSUB(T3, T6);
Chris@19: 		    STM2(&(xo[2]), T9, ovs, &(xo[2]));
Chris@19: 		    Ta = VADD(T7, T8);
Chris@19: 		    STM2(&(xo[0]), Ta, ovs, &(xo[0]));
Chris@19: 		    STN2(&(xo[0]), Ta, T9, ovs);
Chris@19: 		    Tb = VADD(T3, T6);
Chris@19: 		    STM2(&(xo[6]), Tb, ovs, &(xo[2]));
Chris@19: 		    Tc = VSUB(T7, T8);
Chris@19: 		    STM2(&(xo[4]), Tc, ovs, &(xo[0]));
Chris@19: 		    STN2(&(xo[4]), Tc, Tb, ovs);
Chris@19: 	       }
Chris@19: 	  }
Chris@19:      }
Chris@19:      VLEAVE();
Chris@19: }
Chris@19: 
Chris@19: static const kdft_desc desc = { 4, XSIMD_STRING("n2fv_4"), {8, 0, 0, 0}, &GENUS, 0, 2, 0, 0 };
Chris@19: 
Chris@19: void XSIMD(codelet_n2fv_4) (planner *p) {
Chris@19:      X(kdft_register) (p, n2fv_4, &desc);
Chris@19: }
Chris@19: 
Chris@19: #endif				/* HAVE_FMA */