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