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