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:04:51 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_notw_c.native -fma -simd -compact -variables 4 -pipeline-latency 8 -n 3 -name n1fv_3 -include dft/simd/n1f.h */ cannam@167: cannam@167: /* cannam@167: * This function contains 6 FP additions, 4 FP multiplications, cannam@167: * (or, 3 additions, 1 multiplications, 3 fused multiply/add), cannam@167: * 11 stack variables, 2 constants, and 6 memory accesses cannam@167: */ cannam@167: #include "dft/simd/n1f.h" cannam@167: cannam@167: 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@167: { cannam@167: DVK(KP500000000, +0.500000000000000000000000000000000000000000000); cannam@167: DVK(KP866025403, +0.866025403784438646763723170752936183471402627); cannam@167: { cannam@167: INT i; cannam@167: const R *xi; cannam@167: R *xo; cannam@167: xi = ri; cannam@167: xo = ro; cannam@167: 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@167: V T1, T4, T6, T2, T3, T5; cannam@167: T1 = LD(&(xi[0]), ivs, &(xi[0])); cannam@167: T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)])); cannam@167: T3 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0])); cannam@167: T4 = VADD(T2, T3); cannam@167: T6 = VMUL(LDK(KP866025403), VSUB(T3, T2)); cannam@167: ST(&(xo[0]), VADD(T1, T4), ovs, &(xo[0])); cannam@167: T5 = VFNMS(LDK(KP500000000), T4, T1); cannam@167: ST(&(xo[WS(os, 2)]), VFNMSI(T6, T5), ovs, &(xo[0])); cannam@167: ST(&(xo[WS(os, 1)]), VFMAI(T6, T5), ovs, &(xo[WS(os, 1)])); cannam@167: } cannam@167: } cannam@167: VLEAVE(); cannam@167: } cannam@167: cannam@167: static const kdft_desc desc = { 3, XSIMD_STRING("n1fv_3"), {3, 1, 3, 0}, &GENUS, 0, 0, 0, 0 }; cannam@167: cannam@167: void XSIMD(codelet_n1fv_3) (planner *p) { cannam@167: X(kdft_register) (p, n1fv_3, &desc); cannam@167: } cannam@167: cannam@167: #else cannam@167: cannam@167: /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -n 3 -name n1fv_3 -include dft/simd/n1f.h */ cannam@167: cannam@167: /* cannam@167: * This function contains 6 FP additions, 2 FP multiplications, cannam@167: * (or, 5 additions, 1 multiplications, 1 fused multiply/add), cannam@167: * 11 stack variables, 2 constants, and 6 memory accesses cannam@167: */ cannam@167: #include "dft/simd/n1f.h" cannam@167: cannam@167: 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@167: { cannam@167: DVK(KP500000000, +0.500000000000000000000000000000000000000000000); cannam@167: DVK(KP866025403, +0.866025403784438646763723170752936183471402627); cannam@167: { cannam@167: INT i; cannam@167: const R *xi; cannam@167: R *xo; cannam@167: xi = ri; cannam@167: xo = ro; cannam@167: 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@167: V T1, T4, T6, T2, T3, T5; cannam@167: T1 = LD(&(xi[0]), ivs, &(xi[0])); cannam@167: T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)])); cannam@167: T3 = LD(&(xi[WS(is, 2)]), ivs, &(xi[0])); cannam@167: T4 = VADD(T2, T3); cannam@167: T6 = VBYI(VMUL(LDK(KP866025403), VSUB(T3, T2))); cannam@167: ST(&(xo[0]), VADD(T1, T4), ovs, &(xo[0])); cannam@167: T5 = VFNMS(LDK(KP500000000), T4, T1); cannam@167: ST(&(xo[WS(os, 2)]), VSUB(T5, T6), ovs, &(xo[0])); cannam@167: ST(&(xo[WS(os, 1)]), VADD(T5, T6), ovs, &(xo[WS(os, 1)])); cannam@167: } cannam@167: } cannam@167: VLEAVE(); cannam@167: } cannam@167: cannam@167: static const kdft_desc desc = { 3, XSIMD_STRING("n1fv_3"), {5, 1, 1, 0}, &GENUS, 0, 0, 0, 0 }; cannam@167: cannam@167: void XSIMD(codelet_n1fv_3) (planner *p) { cannam@167: X(kdft_register) (p, n1fv_3, &desc); cannam@167: } cannam@167: cannam@167: #endif