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:41:54 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_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 3 -name t1fv_3 -include t1f.h */
Chris@42: 
Chris@42: /*
Chris@42:  * This function contains 8 FP additions, 8 FP multiplications,
Chris@42:  * (or, 5 additions, 5 multiplications, 3 fused multiply/add),
Chris@42:  * 12 stack variables, 2 constants, and 6 memory accesses
Chris@42:  */
Chris@42: #include "t1f.h"
Chris@42: 
Chris@42: static void t1fv_3(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@42: {
Chris@42:      DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@42:      DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@42:      {
Chris@42: 	  INT m;
Chris@42: 	  R *x;
Chris@42: 	  x = ri;
Chris@42: 	  for (m = mb, W = W + (mb * ((TWVL / VL) * 4)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 4), MAKE_VOLATILE_STRIDE(3, rs)) {
Chris@42: 	       V T1, T2, T4;
Chris@42: 	       T1 = LD(&(x[0]), ms, &(x[0]));
Chris@42: 	       T2 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
Chris@42: 	       T4 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
Chris@42: 	       {
Chris@42: 		    V T3, T5, T8, T6, T7;
Chris@42: 		    T3 = BYTWJ(&(W[0]), T2);
Chris@42: 		    T5 = BYTWJ(&(W[TWVL * 2]), T4);
Chris@42: 		    T8 = VMUL(LDK(KP866025403), VSUB(T5, T3));
Chris@42: 		    T6 = VADD(T3, T5);
Chris@42: 		    T7 = VFNMS(LDK(KP500000000), T6, T1);
Chris@42: 		    ST(&(x[0]), VADD(T1, T6), ms, &(x[0]));
Chris@42: 		    ST(&(x[WS(rs, 1)]), VFMAI(T8, T7), ms, &(x[WS(rs, 1)]));
Chris@42: 		    ST(&(x[WS(rs, 2)]), VFNMSI(T8, T7), ms, &(x[0]));
Chris@42: 	       }
Chris@42: 	  }
Chris@42:      }
Chris@42:      VLEAVE();
Chris@42: }
Chris@42: 
Chris@42: static const tw_instr twinstr[] = {
Chris@42:      VTW(0, 1),
Chris@42:      VTW(0, 2),
Chris@42:      {TW_NEXT, VL, 0}
Chris@42: };
Chris@42: 
Chris@42: static const ct_desc desc = { 3, XSIMD_STRING("t1fv_3"), twinstr, &GENUS, {5, 5, 3, 0}, 0, 0, 0 };
Chris@42: 
Chris@42: void XSIMD(codelet_t1fv_3) (planner *p) {
Chris@42:      X(kdft_dit_register) (p, t1fv_3, &desc);
Chris@42: }
Chris@42: #else				/* HAVE_FMA */
Chris@42: 
Chris@42: /* Generated by: ../../../genfft/gen_twiddle_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 3 -name t1fv_3 -include t1f.h */
Chris@42: 
Chris@42: /*
Chris@42:  * This function contains 8 FP additions, 6 FP multiplications,
Chris@42:  * (or, 7 additions, 5 multiplications, 1 fused multiply/add),
Chris@42:  * 12 stack variables, 2 constants, and 6 memory accesses
Chris@42:  */
Chris@42: #include "t1f.h"
Chris@42: 
Chris@42: static void t1fv_3(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
Chris@42: {
Chris@42:      DVK(KP866025403, +0.866025403784438646763723170752936183471402627);
Chris@42:      DVK(KP500000000, +0.500000000000000000000000000000000000000000000);
Chris@42:      {
Chris@42: 	  INT m;
Chris@42: 	  R *x;
Chris@42: 	  x = ri;
Chris@42: 	  for (m = mb, W = W + (mb * ((TWVL / VL) * 4)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 4), MAKE_VOLATILE_STRIDE(3, rs)) {
Chris@42: 	       V T1, T3, T5, T6, T2, T4, T7, T8;
Chris@42: 	       T1 = LD(&(x[0]), ms, &(x[0]));
Chris@42: 	       T2 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
Chris@42: 	       T3 = BYTWJ(&(W[0]), T2);
Chris@42: 	       T4 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
Chris@42: 	       T5 = BYTWJ(&(W[TWVL * 2]), T4);
Chris@42: 	       T6 = VADD(T3, T5);
Chris@42: 	       ST(&(x[0]), VADD(T1, T6), ms, &(x[0]));
Chris@42: 	       T7 = VFNMS(LDK(KP500000000), T6, T1);
Chris@42: 	       T8 = VBYI(VMUL(LDK(KP866025403), VSUB(T5, T3)));
Chris@42: 	       ST(&(x[WS(rs, 2)]), VSUB(T7, T8), ms, &(x[0]));
Chris@42: 	       ST(&(x[WS(rs, 1)]), VADD(T7, T8), ms, &(x[WS(rs, 1)]));
Chris@42: 	  }
Chris@42:      }
Chris@42:      VLEAVE();
Chris@42: }
Chris@42: 
Chris@42: static const tw_instr twinstr[] = {
Chris@42:      VTW(0, 1),
Chris@42:      VTW(0, 2),
Chris@42:      {TW_NEXT, VL, 0}
Chris@42: };
Chris@42: 
Chris@42: static const ct_desc desc = { 3, XSIMD_STRING("t1fv_3"), twinstr, &GENUS, {7, 5, 1, 0}, 0, 0, 0 };
Chris@42: 
Chris@42: void XSIMD(codelet_t1fv_3) (planner *p) {
Chris@42:      X(kdft_dit_register) (p, t1fv_3, &desc);
Chris@42: }
Chris@42: #endif				/* HAVE_FMA */