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:50:35 EDT 2016 */ Chris@42: Chris@42: #include "codelet-rdft.h" Chris@42: Chris@42: #ifdef HAVE_FMA Chris@42: Chris@42: /* Generated by: ../../../genfft/gen_r2cb.native -fma -reorder-insns -schedule-for-pipeline -compact -variables 4 -pipeline-latency 4 -sign 1 -n 6 -name r2cbIII_6 -dft-III -include r2cbIII.h */ Chris@42: Chris@42: /* Chris@42: * This function contains 12 FP additions, 8 FP multiplications, Chris@42: * (or, 6 additions, 2 multiplications, 6 fused multiply/add), Chris@42: * 15 stack variables, 2 constants, and 12 memory accesses Chris@42: */ Chris@42: #include "r2cbIII.h" Chris@42: Chris@42: static void r2cbIII_6(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs) Chris@42: { Chris@42: DK(KP1_732050807, +1.732050807568877293527446341505872366942805254); Chris@42: DK(KP2_000000000, +2.000000000000000000000000000000000000000000000); Chris@42: { Chris@42: INT i; Chris@42: for (i = v; i > 0; i = i - 1, R0 = R0 + ovs, R1 = R1 + ovs, Cr = Cr + ivs, Ci = Ci + ivs, MAKE_VOLATILE_STRIDE(24, rs), MAKE_VOLATILE_STRIDE(24, csr), MAKE_VOLATILE_STRIDE(24, csi)) { Chris@42: E T1, T8, T2, T3, T5, T6; Chris@42: T1 = Cr[WS(csr, 1)]; Chris@42: T8 = Ci[WS(csi, 1)]; Chris@42: T2 = Cr[WS(csr, 2)]; Chris@42: T3 = Cr[0]; Chris@42: T5 = Ci[WS(csi, 2)]; Chris@42: T6 = Ci[0]; Chris@42: { Chris@42: E T4, Ta, T7, Tc, Tb, T9; Chris@42: T4 = T2 + T3; Chris@42: Ta = T2 - T3; Chris@42: T7 = T5 + T6; Chris@42: Tc = T5 - T6; Chris@42: Tb = FNMS(KP2_000000000, T1, T4); Chris@42: R0[0] = KP2_000000000 * (T1 + T4); Chris@42: T9 = FMA(KP2_000000000, T8, T7); Chris@42: R1[WS(rs, 1)] = KP2_000000000 * (T8 - T7); Chris@42: R0[WS(rs, 2)] = FMS(KP1_732050807, Tc, Tb); Chris@42: R0[WS(rs, 1)] = FMA(KP1_732050807, Tc, Tb); Chris@42: R1[WS(rs, 2)] = FMS(KP1_732050807, Ta, T9); Chris@42: R1[0] = -(FMA(KP1_732050807, Ta, T9)); Chris@42: } Chris@42: } Chris@42: } Chris@42: } Chris@42: Chris@42: static const kr2c_desc desc = { 6, "r2cbIII_6", {6, 2, 6, 0}, &GENUS }; Chris@42: Chris@42: void X(codelet_r2cbIII_6) (planner *p) { Chris@42: X(kr2c_register) (p, r2cbIII_6, &desc); Chris@42: } Chris@42: Chris@42: #else /* HAVE_FMA */ Chris@42: Chris@42: /* Generated by: ../../../genfft/gen_r2cb.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 6 -name r2cbIII_6 -dft-III -include r2cbIII.h */ Chris@42: Chris@42: /* Chris@42: * This function contains 12 FP additions, 6 FP multiplications, Chris@42: * (or, 10 additions, 4 multiplications, 2 fused multiply/add), Chris@42: * 15 stack variables, 2 constants, and 12 memory accesses Chris@42: */ Chris@42: #include "r2cbIII.h" Chris@42: Chris@42: static void r2cbIII_6(R *R0, R *R1, R *Cr, R *Ci, stride rs, stride csr, stride csi, INT v, INT ivs, INT ovs) Chris@42: { Chris@42: DK(KP2_000000000, +2.000000000000000000000000000000000000000000000); Chris@42: DK(KP1_732050807, +1.732050807568877293527446341505872366942805254); Chris@42: { Chris@42: INT i; Chris@42: for (i = v; i > 0; i = i - 1, R0 = R0 + ovs, R1 = R1 + ovs, Cr = Cr + ivs, Ci = Ci + ivs, MAKE_VOLATILE_STRIDE(24, rs), MAKE_VOLATILE_STRIDE(24, csr), MAKE_VOLATILE_STRIDE(24, csi)) { Chris@42: E T1, T6, T4, T5, T9, Tb, Ta, Tc; Chris@42: T1 = Cr[WS(csr, 1)]; Chris@42: T6 = Ci[WS(csi, 1)]; Chris@42: { Chris@42: E T2, T3, T7, T8; Chris@42: T2 = Cr[WS(csr, 2)]; Chris@42: T3 = Cr[0]; Chris@42: T4 = T2 + T3; Chris@42: T5 = KP1_732050807 * (T2 - T3); Chris@42: T7 = Ci[WS(csi, 2)]; Chris@42: T8 = Ci[0]; Chris@42: T9 = T7 + T8; Chris@42: Tb = KP1_732050807 * (T7 - T8); Chris@42: } Chris@42: R0[0] = KP2_000000000 * (T1 + T4); Chris@42: R1[WS(rs, 1)] = KP2_000000000 * (T6 - T9); Chris@42: Ta = FMA(KP2_000000000, T6, T9); Chris@42: R1[0] = -(T5 + Ta); Chris@42: R1[WS(rs, 2)] = T5 - Ta; Chris@42: Tc = FMS(KP2_000000000, T1, T4); Chris@42: R0[WS(rs, 1)] = Tb - Tc; Chris@42: R0[WS(rs, 2)] = Tc + Tb; Chris@42: } Chris@42: } Chris@42: } Chris@42: Chris@42: static const kr2c_desc desc = { 6, "r2cbIII_6", {10, 4, 2, 0}, &GENUS }; Chris@42: Chris@42: void X(codelet_r2cbIII_6) (planner *p) { Chris@42: X(kr2c_register) (p, r2cbIII_6, &desc); Chris@42: } Chris@42: Chris@42: #endif /* HAVE_FMA */