Chris@82: /* Chris@82: * Copyright (c) 2003, 2007-14 Matteo Frigo Chris@82: * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology Chris@82: * Chris@82: * This program is free software; you can redistribute it and/or modify Chris@82: * it under the terms of the GNU General Public License as published by Chris@82: * the Free Software Foundation; either version 2 of the License, or Chris@82: * (at your option) any later version. Chris@82: * Chris@82: * This program is distributed in the hope that it will be useful, Chris@82: * but WITHOUT ANY WARRANTY; without even the implied warranty of Chris@82: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the Chris@82: * GNU General Public License for more details. Chris@82: * Chris@82: * You should have received a copy of the GNU General Public License Chris@82: * along with this program; if not, write to the Free Software Chris@82: * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Chris@82: * Chris@82: */ Chris@82: Chris@82: /* This file was automatically generated --- DO NOT EDIT */ Chris@82: /* Generated on Thu May 24 08:05:11 EDT 2018 */ Chris@82: Chris@82: #include "dft/codelet-dft.h" Chris@82: Chris@82: #if defined(ARCH_PREFERS_FMA) || defined(ISA_EXTENSION_PREFERS_FMA) Chris@82: Chris@82: /* Generated by: ../../../genfft/gen_notw_c.native -fma -simd -compact -variables 4 -pipeline-latency 8 -sign 1 -n 2 -name n2bv_2 -with-ostride 2 -include dft/simd/n2b.h -store-multiple 2 */ Chris@82: Chris@82: /* Chris@82: * This function contains 2 FP additions, 0 FP multiplications, Chris@82: * (or, 2 additions, 0 multiplications, 0 fused multiply/add), Chris@82: * 7 stack variables, 0 constants, and 5 memory accesses Chris@82: */ Chris@82: #include "dft/simd/n2b.h" Chris@82: Chris@82: static void n2bv_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs) Chris@82: { Chris@82: { Chris@82: INT i; Chris@82: const R *xi; Chris@82: R *xo; Chris@82: xi = ii; Chris@82: xo = io; Chris@82: for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(4, is), MAKE_VOLATILE_STRIDE(4, os)) { Chris@82: V T1, T2, T3, T4; Chris@82: T1 = LD(&(xi[0]), ivs, &(xi[0])); Chris@82: T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)])); Chris@82: T3 = VSUB(T1, T2); Chris@82: STM2(&(xo[2]), T3, ovs, &(xo[2])); Chris@82: T4 = VADD(T1, T2); Chris@82: STM2(&(xo[0]), T4, ovs, &(xo[0])); Chris@82: STN2(&(xo[0]), T4, T3, ovs); Chris@82: } Chris@82: } Chris@82: VLEAVE(); Chris@82: } Chris@82: Chris@82: static const kdft_desc desc = { 2, XSIMD_STRING("n2bv_2"), {2, 0, 0, 0}, &GENUS, 0, 2, 0, 0 }; Chris@82: Chris@82: void XSIMD(codelet_n2bv_2) (planner *p) { Chris@82: X(kdft_register) (p, n2bv_2, &desc); Chris@82: } Chris@82: Chris@82: #else Chris@82: Chris@82: /* Generated by: ../../../genfft/gen_notw_c.native -simd -compact -variables 4 -pipeline-latency 8 -sign 1 -n 2 -name n2bv_2 -with-ostride 2 -include dft/simd/n2b.h -store-multiple 2 */ Chris@82: Chris@82: /* Chris@82: * This function contains 2 FP additions, 0 FP multiplications, Chris@82: * (or, 2 additions, 0 multiplications, 0 fused multiply/add), Chris@82: * 7 stack variables, 0 constants, and 5 memory accesses Chris@82: */ Chris@82: #include "dft/simd/n2b.h" Chris@82: Chris@82: static void n2bv_2(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, INT v, INT ivs, INT ovs) Chris@82: { Chris@82: { Chris@82: INT i; Chris@82: const R *xi; Chris@82: R *xo; Chris@82: xi = ii; Chris@82: xo = io; Chris@82: for (i = v; i > 0; i = i - VL, xi = xi + (VL * ivs), xo = xo + (VL * ovs), MAKE_VOLATILE_STRIDE(4, is), MAKE_VOLATILE_STRIDE(4, os)) { Chris@82: V T1, T2, T3, T4; Chris@82: T1 = LD(&(xi[0]), ivs, &(xi[0])); Chris@82: T2 = LD(&(xi[WS(is, 1)]), ivs, &(xi[WS(is, 1)])); Chris@82: T3 = VSUB(T1, T2); Chris@82: STM2(&(xo[2]), T3, ovs, &(xo[2])); Chris@82: T4 = VADD(T1, T2); Chris@82: STM2(&(xo[0]), T4, ovs, &(xo[0])); Chris@82: STN2(&(xo[0]), T4, T3, ovs); Chris@82: } Chris@82: } Chris@82: VLEAVE(); Chris@82: } Chris@82: Chris@82: static const kdft_desc desc = { 2, XSIMD_STRING("n2bv_2"), {2, 0, 0, 0}, &GENUS, 0, 2, 0, 0 }; Chris@82: Chris@82: void XSIMD(codelet_n2bv_2) (planner *p) { Chris@82: X(kdft_register) (p, n2bv_2, &desc); Chris@82: } Chris@82: Chris@82: #endif