cannam@127: /*
cannam@127:  * Copyright (c) 2003, 2007-14 Matteo Frigo
cannam@127:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
cannam@127:  *
cannam@127:  * This program is free software; you can redistribute it and/or modify
cannam@127:  * it under the terms of the GNU General Public License as published by
cannam@127:  * the Free Software Foundation; either version 2 of the License, or
cannam@127:  * (at your option) any later version.
cannam@127:  *
cannam@127:  * This program is distributed in the hope that it will be useful,
cannam@127:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
cannam@127:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
cannam@127:  * GNU General Public License for more details.
cannam@127:  *
cannam@127:  * You should have received a copy of the GNU General Public License
cannam@127:  * along with this program; if not, write to the Free Software
cannam@127:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
cannam@127:  *
cannam@127:  */
cannam@127: 
cannam@127: /* This file was automatically generated --- DO NOT EDIT */
cannam@127: /* Generated on Sat Jul 30 16:43:11 EDT 2016 */
cannam@127: 
cannam@127: #include "codelet-dft.h"
cannam@127: 
cannam@127: #ifdef HAVE_FMA
cannam@127: 
cannam@127: /* Generated by: ../../../genfft/gen_twiddle_c.native -fma -reorder-insns -schedule-for-pipeline -simd -compact -variables 4 -pipeline-latency 8 -n 4 -name t2fv_4 -include t2f.h */
cannam@127: 
cannam@127: /*
cannam@127:  * This function contains 11 FP additions, 8 FP multiplications,
cannam@127:  * (or, 9 additions, 6 multiplications, 2 fused multiply/add),
cannam@127:  * 13 stack variables, 0 constants, and 8 memory accesses
cannam@127:  */
cannam@127: #include "t2f.h"
cannam@127: 
cannam@127: static void t2fv_4(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
cannam@127: {
cannam@127:      {
cannam@127: 	  INT m;
cannam@127: 	  R *x;
cannam@127: 	  x = ri;
cannam@127: 	  for (m = mb, W = W + (mb * ((TWVL / VL) * 6)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 6), MAKE_VOLATILE_STRIDE(4, rs)) {
cannam@127: 	       V T1, T7, T2, T5, T8, T3, T6;
cannam@127: 	       T1 = LD(&(x[0]), ms, &(x[0]));
cannam@127: 	       T7 = LD(&(x[WS(rs, 3)]), ms, &(x[WS(rs, 1)]));
cannam@127: 	       T2 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
cannam@127: 	       T5 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
cannam@127: 	       T8 = BYTWJ(&(W[TWVL * 4]), T7);
cannam@127: 	       T3 = BYTWJ(&(W[TWVL * 2]), T2);
cannam@127: 	       T6 = BYTWJ(&(W[0]), T5);
cannam@127: 	       {
cannam@127: 		    V Ta, T4, Tb, T9;
cannam@127: 		    Ta = VADD(T1, T3);
cannam@127: 		    T4 = VSUB(T1, T3);
cannam@127: 		    Tb = VADD(T6, T8);
cannam@127: 		    T9 = VSUB(T6, T8);
cannam@127: 		    ST(&(x[0]), VADD(Ta, Tb), ms, &(x[0]));
cannam@127: 		    ST(&(x[WS(rs, 2)]), VSUB(Ta, Tb), ms, &(x[0]));
cannam@127: 		    ST(&(x[WS(rs, 3)]), VFMAI(T9, T4), ms, &(x[WS(rs, 1)]));
cannam@127: 		    ST(&(x[WS(rs, 1)]), VFNMSI(T9, T4), ms, &(x[WS(rs, 1)]));
cannam@127: 	       }
cannam@127: 	  }
cannam@127:      }
cannam@127:      VLEAVE();
cannam@127: }
cannam@127: 
cannam@127: static const tw_instr twinstr[] = {
cannam@127:      VTW(0, 1),
cannam@127:      VTW(0, 2),
cannam@127:      VTW(0, 3),
cannam@127:      {TW_NEXT, VL, 0}
cannam@127: };
cannam@127: 
cannam@127: static const ct_desc desc = { 4, XSIMD_STRING("t2fv_4"), twinstr, &GENUS, {9, 6, 2, 0}, 0, 0, 0 };
cannam@127: 
cannam@127: void XSIMD(codelet_t2fv_4) (planner *p) {
cannam@127:      X(kdft_dit_register) (p, t2fv_4, &desc);
cannam@127: }
cannam@127: #else				/* HAVE_FMA */
cannam@127: 
cannam@127: /* Generated by: ../../../genfft/gen_twiddle_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 4 -name t2fv_4 -include t2f.h */
cannam@127: 
cannam@127: /*
cannam@127:  * This function contains 11 FP additions, 6 FP multiplications,
cannam@127:  * (or, 11 additions, 6 multiplications, 0 fused multiply/add),
cannam@127:  * 13 stack variables, 0 constants, and 8 memory accesses
cannam@127:  */
cannam@127: #include "t2f.h"
cannam@127: 
cannam@127: static void t2fv_4(R *ri, R *ii, const R *W, stride rs, INT mb, INT me, INT ms)
cannam@127: {
cannam@127:      {
cannam@127: 	  INT m;
cannam@127: 	  R *x;
cannam@127: 	  x = ri;
cannam@127: 	  for (m = mb, W = W + (mb * ((TWVL / VL) * 6)); m < me; m = m + VL, x = x + (VL * ms), W = W + (TWVL * 6), MAKE_VOLATILE_STRIDE(4, rs)) {
cannam@127: 	       V T1, T8, T3, T6, T7, T2, T5;
cannam@127: 	       T1 = LD(&(x[0]), ms, &(x[0]));
cannam@127: 	       T7 = LD(&(x[WS(rs, 3)]), ms, &(x[WS(rs, 1)]));
cannam@127: 	       T8 = BYTWJ(&(W[TWVL * 4]), T7);
cannam@127: 	       T2 = LD(&(x[WS(rs, 2)]), ms, &(x[0]));
cannam@127: 	       T3 = BYTWJ(&(W[TWVL * 2]), T2);
cannam@127: 	       T5 = LD(&(x[WS(rs, 1)]), ms, &(x[WS(rs, 1)]));
cannam@127: 	       T6 = BYTWJ(&(W[0]), T5);
cannam@127: 	       {
cannam@127: 		    V T4, T9, Ta, Tb;
cannam@127: 		    T4 = VSUB(T1, T3);
cannam@127: 		    T9 = VBYI(VSUB(T6, T8));
cannam@127: 		    ST(&(x[WS(rs, 1)]), VSUB(T4, T9), ms, &(x[WS(rs, 1)]));
cannam@127: 		    ST(&(x[WS(rs, 3)]), VADD(T4, T9), ms, &(x[WS(rs, 1)]));
cannam@127: 		    Ta = VADD(T1, T3);
cannam@127: 		    Tb = VADD(T6, T8);
cannam@127: 		    ST(&(x[WS(rs, 2)]), VSUB(Ta, Tb), ms, &(x[0]));
cannam@127: 		    ST(&(x[0]), VADD(Ta, Tb), ms, &(x[0]));
cannam@127: 	       }
cannam@127: 	  }
cannam@127:      }
cannam@127:      VLEAVE();
cannam@127: }
cannam@127: 
cannam@127: static const tw_instr twinstr[] = {
cannam@127:      VTW(0, 1),
cannam@127:      VTW(0, 2),
cannam@127:      VTW(0, 3),
cannam@127:      {TW_NEXT, VL, 0}
cannam@127: };
cannam@127: 
cannam@127: static const ct_desc desc = { 4, XSIMD_STRING("t2fv_4"), twinstr, &GENUS, {11, 6, 0, 0}, 0, 0, 0 };
cannam@127: 
cannam@127: void XSIMD(codelet_t2fv_4) (planner *p) {
cannam@127:      X(kdft_dit_register) (p, t2fv_4, &desc);
cannam@127: }
cannam@127: #endif				/* HAVE_FMA */