Chris@10: /*
Chris@10:  * Copyright (c) 2003, 2007-11 Matteo Frigo
Chris@10:  * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
Chris@10:  *
Chris@10:  * This program is free software; you can redistribute it and/or modify
Chris@10:  * it under the terms of the GNU General Public License as published by
Chris@10:  * the Free Software Foundation; either version 2 of the License, or
Chris@10:  * (at your option) any later version.
Chris@10:  *
Chris@10:  * This program is distributed in the hope that it will be useful,
Chris@10:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@10:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@10:  * GNU General Public License for more details.
Chris@10:  *
Chris@10:  * You should have received a copy of the GNU General Public License
Chris@10:  * along with this program; if not, write to the Free Software
Chris@10:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@10:  *
Chris@10:  */
Chris@10: 
Chris@10: /* This file was automatically generated --- DO NOT EDIT */
Chris@10: /* Generated on Sun Nov 25 07:36:52 EST 2012 */
Chris@10: 
Chris@10: #include "codelet-dft.h"
Chris@10: 
Chris@10: #ifdef HAVE_FMA
Chris@10: 
Chris@10: /* Generated by: ../../../genfft/gen_notw_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 4 -name n1fv_4 -include n1f.h */
Chris@10: 
Chris@10: /*
Chris@10:  * This function contains 8 FP additions, 2 FP multiplications,
Chris@10:  * (or, 6 additions, 0 multiplications, 2 fused multiply/add),
Chris@10:  * 11 stack variables, 0 constants, and 8 memory accesses
Chris@10:  */
Chris@10: #include "n1f.h"
Chris@10: 
Chris@10: static void n1fv_4(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@10: {
Chris@10:      {
Chris@10: 	  INT i;
Chris@10: 	  const R *xi;
Chris@10: 	  R *xo;
Chris@10: 	  xi = ri;
Chris@10: 	  xo = ro;
Chris@10: 	  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@10: 	       V T1, T2, T4, T5;
Chris@10: 	       T1 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@10: 	       T2 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@10: 	       T4 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@10: 	       T5 = LD(&(xi[WS(is, 3)]), ivs, &(xi[WS(is, 1)]));
Chris@10: 	       {
Chris@10: 		    V T3, T7, T6, T8;
Chris@10: 		    T3 = VSUB(T1, T2);
Chris@10: 		    T7 = VADD(T1, T2);
Chris@10: 		    T6 = VSUB(T4, T5);
Chris@10: 		    T8 = VADD(T4, T5);
Chris@10: 		    ST(&(xo[WS(os, 2)]), VSUB(T7, T8), ovs, &(xo[0]));
Chris@10: 		    ST(&(xo[0]), VADD(T7, T8), ovs, &(xo[0]));
Chris@10: 		    ST(&(xo[WS(os, 3)]), VFMAI(T6, T3), ovs, &(xo[WS(os, 1)]));
Chris@10: 		    ST(&(xo[WS(os, 1)]), VFNMSI(T6, T3), ovs, &(xo[WS(os, 1)]));
Chris@10: 	       }
Chris@10: 	  }
Chris@10:      }
Chris@10:      VLEAVE();
Chris@10: }
Chris@10: 
Chris@10: static const kdft_desc desc = { 4, XSIMD_STRING("n1fv_4"), {6, 0, 2, 0}, &GENUS, 0, 0, 0, 0 };
Chris@10: 
Chris@10: void XSIMD(codelet_n1fv_4) (planner *p) {
Chris@10:      X(kdft_register) (p, n1fv_4, &desc);
Chris@10: }
Chris@10: 
Chris@10: #else				/* HAVE_FMA */
Chris@10: 
Chris@10: /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 4 -name n1fv_4 -include n1f.h */
Chris@10: 
Chris@10: /*
Chris@10:  * This function contains 8 FP additions, 0 FP multiplications,
Chris@10:  * (or, 8 additions, 0 multiplications, 0 fused multiply/add),
Chris@10:  * 11 stack variables, 0 constants, and 8 memory accesses
Chris@10:  */
Chris@10: #include "n1f.h"
Chris@10: 
Chris@10: static void n1fv_4(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs)
Chris@10: {
Chris@10:      {
Chris@10: 	  INT i;
Chris@10: 	  const R *xi;
Chris@10: 	  R *xo;
Chris@10: 	  xi = ri;
Chris@10: 	  xo = ro;
Chris@10: 	  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@10: 	       V T3, T7, T6, T8;
Chris@10: 	       {
Chris@10: 		    V T1, T2, T4, T5;
Chris@10: 		    T1 = LD(&(xi[0]), ivs, &(xi[0]));
Chris@10: 		    T2 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0]));
Chris@10: 		    T3 = VSUB(T1, T2);
Chris@10: 		    T7 = VADD(T1, T2);
Chris@10: 		    T4 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)]));
Chris@10: 		    T5 = LD(&(xi[WS(is, 3)]), ivs, &(xi[WS(is, 1)]));
Chris@10: 		    T6 = VBYI(VSUB(T4, T5));
Chris@10: 		    T8 = VADD(T4, T5);
Chris@10: 	       }
Chris@10: 	       ST(&(xo[WS(os, 1)]), VSUB(T3, T6), ovs, &(xo[WS(os, 1)]));
Chris@10: 	       ST(&(xo[0]), VADD(T7, T8), ovs, &(xo[0]));
Chris@10: 	       ST(&(xo[WS(os, 3)]), VADD(T3, T6), ovs, &(xo[WS(os, 1)]));
Chris@10: 	       ST(&(xo[WS(os, 2)]), VSUB(T7, T8), ovs, &(xo[0]));
Chris@10: 	  }
Chris@10:      }
Chris@10:      VLEAVE();
Chris@10: }
Chris@10: 
Chris@10: static const kdft_desc desc = { 4, XSIMD_STRING("n1fv_4"), {8, 0, 0, 0}, &GENUS, 0, 0, 0, 0 };
Chris@10: 
Chris@10: void XSIMD(codelet_n1fv_4) (planner *p) {
Chris@10:      X(kdft_register) (p, n1fv_4, &desc);
Chris@10: }
Chris@10: 
Chris@10: #endif				/* HAVE_FMA */